* the way we have been doing that is to call exists() which
         * calls this method so another technique will be necessary
         * to support DFS referral _to_ Win95/98/ME.
         */

        // Optimization: Prefer SMB2 approach for better performance
        if (th.isSMB2()) {
            // SMB2: Use optimized open with minimal access for better performance

	CVTTSS2SL X2, R11                       // f3440f2cda or f34c0f2cda
	CVTTSS2SL X11, R11                      // f3450f2cdb or f34d0f2cdb
	CWD                                     // 6699
	CWDE                                    // 98
	DECW (BX)                               // 66ff0b
	DECW (R11)                              // 6641ff0b
	DECW DX                                 // 66ffca
	DECW R11                                // 6641ffcb

</p>

<pre>
const Huge = 1 &lt;&lt; 100         // Huge == 1267650600228229401496703205376  (untyped integer constant)
const Four int8 = Huge &gt;&gt; 98  // Four == 4                                (type int8)
</pre>

<p>
The divisor of a constant division or remainder operation must not be zero:
</p>

<pre>
3.14 / 0.0   // illegal: division by zero

(uint64(arg1[17]) << 8) x16 := arg1[16] x17 := (uint64(arg1[15]) << 56) x18 := (uint64(arg1[14]) << 48) x19 := (uint64(arg1[13]) << 40) x20 := (uint64(arg1[12]) << 32) x21 := (uint64(arg1[11]) << 24) x22 := (uint64(arg1[10]) << 16) x23 := (uint64(arg1[9]) << 8) x24 := arg1[8] x25 := (uint64(arg1[7]) << 56) x26 := (uint64(arg1[6]) << 48) x27 := (uint64(arg1[5]) << 40) x28 := (uint64(arg1[4]) << 32) x29 := (uint64(arg1[3]) << 24) x30 := (uint64(arg1[2]) << 16) x31 := (uint64(arg1[1]) << 8) x32 := arg1[0]...