Stowage/go
2
0
Fork 0
mirror of https://github.com/golang/go.git synced 2025-12-08 06:10:04 +00:00
Code Issues Projects Releases Packages Wiki Activity

cmd/compile: convert more generic rules to typed aux

Browse source 
Passes toolstash-check.

Change-Id: I07d79d809babfeda883a49f0b21ab27ede5381cb
Reviewed-on: https://go-review.googlesource.com/c/go/+/230211
Run-TryBot: Josh Bleecher Snyder <josharian@gmail.com>
TryBot-Result: Gobot Gobot <gobot@golang.org>
Reviewed-by: Keith Randall <khr@golang.org>
This commit is contained in:
Josh Bleecher Snyder 2020-04-26 13:02:32 -07:00
parent c9591d73ef
commit a3374fa0f8
3 changed files with 176 additions and 169 deletions
Download patch file Download diff file Expand all files Collapse all files

64
src/cmd/compile/internal/ssa/gen/generic.rules
View file

@ -1171,44 +1171,44 @@
(Const64 <typ.UInt64> [63]))) (Const64 <typ.UInt64> [63])))
// Unsigned mod by power of 2 constant. // Unsigned mod by power of 2 constant.
(Mod8u <t> n (Const8 [c])) && isPowerOfTwo(c&0xff) -> (And8 n (Const8 <t> [(c&0xff)-1])) (Mod8u <t> n (Const8 [c])) && isPowerOfTwo8(c) => (And8 n (Const8 <t> [c-1]))
(Mod16u <t> n (Const16 [c])) && isPowerOfTwo(c&0xffff) -> (And16 n (Const16 <t> [(c&0xffff)-1])) (Mod16u <t> n (Const16 [c])) && isPowerOfTwo16(c) => (And16 n (Const16 <t> [c-1]))
(Mod32u <t> n (Const32 [c])) && isPowerOfTwo(c&0xffffffff) -> (And32 n (Const32 <t> [(c&0xffffffff)-1])) (Mod32u <t> n (Const32 [c])) && isPowerOfTwo32(c) => (And32 n (Const32 <t> [c-1]))
(Mod64u <t> n (Const64 [c])) && isPowerOfTwo(c) -> (And64 n (Const64 <t> [c-1])) (Mod64u <t> n (Const64 [c])) && isPowerOfTwo64(c) => (And64 n (Const64 <t> [c-1]))
(Mod64u <t> n (Const64 [-1<<63])) -> (And64 n (Const64 <t> [1<<63-1])) (Mod64u <t> n (Const64 [-1<<63])) => (And64 n (Const64 <t> [1<<63-1]))
// Signed non-negative mod by power of 2 constant. // Signed non-negative mod by power of 2 constant.
(Mod8 <t> n (Const8 [c])) && isNonNegative(n) && isPowerOfTwo(c&0xff) -> (And8 n (Const8 <t> [(c&0xff)-1])) (Mod8 <t> n (Const8 [c])) && isNonNegative(n) && isPowerOfTwo8(c) => (And8 n (Const8 <t> [c-1]))
(Mod16 <t> n (Const16 [c])) && isNonNegative(n) && isPowerOfTwo(c&0xffff) -> (And16 n (Const16 <t> [(c&0xffff)-1])) (Mod16 <t> n (Const16 [c])) && isNonNegative(n) && isPowerOfTwo16(c) => (And16 n (Const16 <t> [c-1]))
(Mod32 <t> n (Const32 [c])) && isNonNegative(n) && isPowerOfTwo(c&0xffffffff) -> (And32 n (Const32 <t> [(c&0xffffffff)-1])) (Mod32 <t> n (Const32 [c])) && isNonNegative(n) && isPowerOfTwo32(c) => (And32 n (Const32 <t> [c-1]))
(Mod64 <t> n (Const64 [c])) && isNonNegative(n) && isPowerOfTwo(c) -> (And64 n (Const64 <t> [c-1])) (Mod64 <t> n (Const64 [c])) && isNonNegative(n) && isPowerOfTwo64(c) => (And64 n (Const64 <t> [c-1]))
(Mod64 n (Const64 [-1<<63])) && isNonNegative(n) -> n (Mod64 n (Const64 [-1<<63])) && isNonNegative(n) => n
// Signed mod by negative constant. // Signed mod by negative constant.
(Mod8 <t> n (Const8 [c])) && c < 0 && c != -1<<7 -> (Mod8 <t> n (Const8 <t> [-c])) (Mod8 <t> n (Const8 [c])) && c < 0 && c != -1<<7 => (Mod8 <t> n (Const8 <t> [-c]))
(Mod16 <t> n (Const16 [c])) && c < 0 && c != -1<<15 -> (Mod16 <t> n (Const16 <t> [-c])) (Mod16 <t> n (Const16 [c])) && c < 0 && c != -1<<15 => (Mod16 <t> n (Const16 <t> [-c]))
(Mod32 <t> n (Const32 [c])) && c < 0 && c != -1<<31 -> (Mod32 <t> n (Const32 <t> [-c])) (Mod32 <t> n (Const32 [c])) && c < 0 && c != -1<<31 => (Mod32 <t> n (Const32 <t> [-c]))
(Mod64 <t> n (Const64 [c])) && c < 0 && c != -1<<63 -> (Mod64 <t> n (Const64 <t> [-c])) (Mod64 <t> n (Const64 [c])) && c < 0 && c != -1<<63 => (Mod64 <t> n (Const64 <t> [-c]))
// All other mods by constants, do A%B = A-(A/B*B). // All other mods by constants, do A%B = A-(A/B*B).
// This implements % with two * and a bunch of ancillary ops. // This implements % with two * and a bunch of ancillary ops.
// One of the * is free if the user's code also computes A/B. // One of the * is free if the user's code also computes A/B.
(Mod8 <t> x (Const8 [c])) && x.Op != OpConst8 && (c > 0 || c == -1<<7) (Mod8 <t> x (Const8 [c])) && x.Op != OpConst8 && (c > 0 || c == -1<<7)
-> (Sub8 x (Mul8 <t> (Div8 <t> x (Const8 <t> [c])) (Const8 <t> [c]))) => (Sub8 x (Mul8 <t> (Div8 <t> x (Const8 <t> [c])) (Const8 <t> [c])))
(Mod16 <t> x (Const16 [c])) && x.Op != OpConst16 && (c > 0 || c == -1<<15) (Mod16 <t> x (Const16 [c])) && x.Op != OpConst16 && (c > 0 || c == -1<<15)
-> (Sub16 x (Mul16 <t> (Div16 <t> x (Const16 <t> [c])) (Const16 <t> [c]))) => (Sub16 x (Mul16 <t> (Div16 <t> x (Const16 <t> [c])) (Const16 <t> [c])))
(Mod32 <t> x (Const32 [c])) && x.Op != OpConst32 && (c > 0 || c == -1<<31) (Mod32 <t> x (Const32 [c])) && x.Op != OpConst32 && (c > 0 || c == -1<<31)
-> (Sub32 x (Mul32 <t> (Div32 <t> x (Const32 <t> [c])) (Const32 <t> [c]))) => (Sub32 x (Mul32 <t> (Div32 <t> x (Const32 <t> [c])) (Const32 <t> [c])))
(Mod64 <t> x (Const64 [c])) && x.Op != OpConst64 && (c > 0 || c == -1<<63) (Mod64 <t> x (Const64 [c])) && x.Op != OpConst64 && (c > 0 || c == -1<<63)
-> (Sub64 x (Mul64 <t> (Div64 <t> x (Const64 <t> [c])) (Const64 <t> [c]))) => (Sub64 x (Mul64 <t> (Div64 <t> x (Const64 <t> [c])) (Const64 <t> [c])))
(Mod8u <t> x (Const8 [c])) && x.Op != OpConst8 && c > 0 && umagicOK(8, c) (Mod8u <t> x (Const8 [c])) && x.Op != OpConst8 && c > 0 && umagicOK8( c)
-> (Sub8 x (Mul8 <t> (Div8u <t> x (Const8 <t> [c])) (Const8 <t> [c]))) => (Sub8 x (Mul8 <t> (Div8u <t> x (Const8 <t> [c])) (Const8 <t> [c])))
(Mod16u <t> x (Const16 [c])) && x.Op != OpConst16 && c > 0 && umagicOK(16,c) (Mod16u <t> x (Const16 [c])) && x.Op != OpConst16 && c > 0 && umagicOK16(c)
-> (Sub16 x (Mul16 <t> (Div16u <t> x (Const16 <t> [c])) (Const16 <t> [c]))) => (Sub16 x (Mul16 <t> (Div16u <t> x (Const16 <t> [c])) (Const16 <t> [c])))
(Mod32u <t> x (Const32 [c])) && x.Op != OpConst32 && c > 0 && umagicOK(32,c) (Mod32u <t> x (Const32 [c])) && x.Op != OpConst32 && c > 0 && umagicOK32(c)
-> (Sub32 x (Mul32 <t> (Div32u <t> x (Const32 <t> [c])) (Const32 <t> [c]))) => (Sub32 x (Mul32 <t> (Div32u <t> x (Const32 <t> [c])) (Const32 <t> [c])))
(Mod64u <t> x (Const64 [c])) && x.Op != OpConst64 && c > 0 && umagicOK(64,c) (Mod64u <t> x (Const64 [c])) && x.Op != OpConst64 && c > 0 && umagicOK64(c)
-> (Sub64 x (Mul64 <t> (Div64u <t> x (Const64 <t> [c])) (Const64 <t> [c]))) => (Sub64 x (Mul64 <t> (Div64u <t> x (Const64 <t> [c])) (Const64 <t> [c])))
// For architectures without rotates on less than 32-bits, promote these checks to 32-bit. // For architectures without rotates on less than 32-bits, promote these checks to 32-bit.
(Eq8 (Mod8u x (Const8 [c])) (Const8 [0])) && x.Op != OpConst8 && udivisibleOK(8,c) && !hasSmallRotate(config) -> (Eq8 (Mod8u x (Const8 [c])) (Const8 [0])) && x.Op != OpConst8 && udivisibleOK(8,c) && !hasSmallRotate(config) ->
@ -1745,7 +1745,7 @@
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
) && k > 0 && k < 7 && kbar == 8 - k ) && k > 0 && k < 7 && kbar == 8 - k
-> ((Eq8|Neq8) (And8 <t> n (Const8 <t> [int64(1<<uint(k)-1)])) (Const8 <t> [0])) => ((Eq8|Neq8) (And8 <t> n (Const8 <t> [1<<uint(k)-1])) (Const8 <t> [0]))
((Eq16|Neq16) n (Lsh16x64 ((Eq16|Neq16) n (Lsh16x64
(Rsh16x64 (Rsh16x64
@ -1753,7 +1753,7 @@
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
) && k > 0 && k < 15 && kbar == 16 - k ) && k > 0 && k < 15 && kbar == 16 - k
-> ((Eq16|Neq16) (And16 <t> n (Const16 <t> [int64(1<<uint(k)-1)])) (Const16 <t> [0])) => ((Eq16|Neq16) (And16 <t> n (Const16 <t> [1<<uint(k)-1])) (Const16 <t> [0]))
((Eq32|Neq32) n (Lsh32x64 ((Eq32|Neq32) n (Lsh32x64
(Rsh32x64 (Rsh32x64
@ -1761,7 +1761,7 @@
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
) && k > 0 && k < 31 && kbar == 32 - k ) && k > 0 && k < 31 && kbar == 32 - k
-> ((Eq32|Neq32) (And32 <t> n (Const32 <t> [int64(1<<uint(k)-1)])) (Const32 <t> [0])) => ((Eq32|Neq32) (And32 <t> n (Const32 <t> [1<<uint(k)-1])) (Const32 <t> [0]))
((Eq64|Neq64) n (Lsh64x64 ((Eq64|Neq64) n (Lsh64x64
(Rsh64x64 (Rsh64x64
@ -1769,10 +1769,10 @@
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
(Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k]))
) && k > 0 && k < 63 && kbar == 64 - k ) && k > 0 && k < 63 && kbar == 64 - k
-> ((Eq64|Neq64) (And64 <t> n (Const64 <t> [int64(1<<uint(k)-1)])) (Const64 <t> [0])) => ((Eq64|Neq64) (And64 <t> n (Const64 <t> [1<<uint(k)-1])) (Const64 <t> [0]))
(Eq(8|16|32|64) s:(Sub(8|16|32|64) x y) (Const(8|16|32|64) [0])) && s.Uses == 1 -> (Eq(8|16|32|64) x y) (Eq(8|16|32|64) s:(Sub(8|16|32|64) x y) (Const(8|16|32|64) [0])) && s.Uses == 1 => (Eq(8|16|32|64) x y)
(Neq(8|16|32|64) s:(Sub(8|16|32|64) x y) (Const(8|16|32|64) [0])) && s.Uses == 1 -> (Neq(8|16|32|64) x y) (Neq(8|16|32|64) s:(Sub(8|16|32|64) x y) (Const(8|16|32|64) [0])) && s.Uses == 1 => (Neq(8|16|32|64) x y)
// Optimize bitsets // Optimize bitsets
(Eq8 (And8 <t> x (Const8 <t> [y])) (Const8 <t> [y])) && oneBit8(y) (Eq8 (And8 <t> x (Const8 <t> [y])) (Const8 <t> [y])) && oneBit8(y)

7
src/cmd/compile/internal/ssa/magic.go
View file

@ -96,6 +96,13 @@ func umagicOK(n uint, c int64) bool {
return d&(d-1) != 0 return d&(d-1) != 0
} }
// umagicOKn reports whether we should strength reduce an n-bit divide by c.
// We can strength reduce when c != 0 and c is not a power of two.
func umagicOK8(c int8) bool { return c&(c-1) != 0 }
func umagicOK16(c int16) bool { return c&(c-1) != 0 }
func umagicOK32(c int32) bool { return c&(c-1) != 0 }
func umagicOK64(c int64) bool { return c&(c-1) != 0 }
type umagicData struct { type umagicData struct {
s int64 // ⎡log2(c)⎤ s int64 // ⎡log2(c)⎤
m uint64 // ⎡2^(n+s)/c⎤ - 2^n m uint64 // ⎡2^(n+s)/c⎤ - 2^n

274
src/cmd/compile/internal/ssa/rewritegeneric.go
View file

@ -6213,7 +6213,7 @@ func rewriteValuegeneric_OpEq16(v *Value) bool {
} }
// match: (Eq16 n (Lsh16x64 (Rsh16x64 (Add16 <t> n (Rsh16Ux64 <t> (Rsh16x64 <t> n (Const64 <typ.UInt64> [15])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Eq16 n (Lsh16x64 (Rsh16x64 (Add16 <t> n (Rsh16Ux64 <t> (Rsh16x64 <t> n (Const64 <typ.UInt64> [15])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 15 && kbar == 16 - k // cond: k > 0 && k < 15 && kbar == 16 - k
// result: (Eq16 (And16 <t> n (Const16 <t> [int64(1<<uint(k)-1)])) (Const16 <t> [0])) // result: (Eq16 (And16 <t> n (Const16 <t> [1<<uint(k)-1])) (Const16 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -6248,30 +6248,30 @@ func rewriteValuegeneric_OpEq16(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 15 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 15 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 15 && kbar == 16-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 15 && kbar == 16-k) {
continue continue
} }
v.reset(OpEq16) v.reset(OpEq16)
v0 := b.NewValue0(v.Pos, OpAnd16, t) v0 := b.NewValue0(v.Pos, OpAnd16, t)
v1 := b.NewValue0(v.Pos, OpConst16, t) v1 := b.NewValue0(v.Pos, OpConst16, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int16ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst16, t) v2 := b.NewValue0(v.Pos, OpConst16, t)
v2.AuxInt = 0 v2.AuxInt = int16ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -6289,7 +6289,7 @@ func rewriteValuegeneric_OpEq16(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst16 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst16 || auxIntToInt16(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpEq16) v.reset(OpEq16)
@ -7077,7 +7077,7 @@ func rewriteValuegeneric_OpEq32(v *Value) bool {
} }
// match: (Eq32 n (Lsh32x64 (Rsh32x64 (Add32 <t> n (Rsh32Ux64 <t> (Rsh32x64 <t> n (Const64 <typ.UInt64> [31])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Eq32 n (Lsh32x64 (Rsh32x64 (Add32 <t> n (Rsh32Ux64 <t> (Rsh32x64 <t> n (Const64 <typ.UInt64> [31])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 31 && kbar == 32 - k // cond: k > 0 && k < 31 && kbar == 32 - k
// result: (Eq32 (And32 <t> n (Const32 <t> [int64(1<<uint(k)-1)])) (Const32 <t> [0])) // result: (Eq32 (And32 <t> n (Const32 <t> [1<<uint(k)-1])) (Const32 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -7112,30 +7112,30 @@ func rewriteValuegeneric_OpEq32(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 31 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 31 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 31 && kbar == 32-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 31 && kbar == 32-k) {
continue continue
} }
v.reset(OpEq32) v.reset(OpEq32)
v0 := b.NewValue0(v.Pos, OpAnd32, t) v0 := b.NewValue0(v.Pos, OpAnd32, t)
v1 := b.NewValue0(v.Pos, OpConst32, t) v1 := b.NewValue0(v.Pos, OpConst32, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int32ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst32, t) v2 := b.NewValue0(v.Pos, OpConst32, t)
v2.AuxInt = 0 v2.AuxInt = int32ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -7153,7 +7153,7 @@ func rewriteValuegeneric_OpEq32(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst32 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst32 || auxIntToInt32(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpEq32) v.reset(OpEq32)
@ -7658,7 +7658,7 @@ func rewriteValuegeneric_OpEq64(v *Value) bool {
} }
// match: (Eq64 n (Lsh64x64 (Rsh64x64 (Add64 <t> n (Rsh64Ux64 <t> (Rsh64x64 <t> n (Const64 <typ.UInt64> [63])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Eq64 n (Lsh64x64 (Rsh64x64 (Add64 <t> n (Rsh64Ux64 <t> (Rsh64x64 <t> n (Const64 <typ.UInt64> [63])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 63 && kbar == 64 - k // cond: k > 0 && k < 63 && kbar == 64 - k
// result: (Eq64 (And64 <t> n (Const64 <t> [int64(1<<uint(k)-1)])) (Const64 <t> [0])) // result: (Eq64 (And64 <t> n (Const64 <t> [1<<uint(k)-1])) (Const64 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -7693,30 +7693,30 @@ func rewriteValuegeneric_OpEq64(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 63 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 63 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 63 && kbar == 64-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 63 && kbar == 64-k) {
continue continue
} }
v.reset(OpEq64) v.reset(OpEq64)
v0 := b.NewValue0(v.Pos, OpAnd64, t) v0 := b.NewValue0(v.Pos, OpAnd64, t)
v1 := b.NewValue0(v.Pos, OpConst64, t) v1 := b.NewValue0(v.Pos, OpConst64, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int64ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst64, t) v2 := b.NewValue0(v.Pos, OpConst64, t)
v2.AuxInt = 0 v2.AuxInt = int64ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -7734,7 +7734,7 @@ func rewriteValuegeneric_OpEq64(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst64 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst64 || auxIntToInt64(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpEq64) v.reset(OpEq64)
@ -8080,7 +8080,7 @@ func rewriteValuegeneric_OpEq8(v *Value) bool {
} }
// match: (Eq8 n (Lsh8x64 (Rsh8x64 (Add8 <t> n (Rsh8Ux64 <t> (Rsh8x64 <t> n (Const64 <typ.UInt64> [ 7])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Eq8 n (Lsh8x64 (Rsh8x64 (Add8 <t> n (Rsh8Ux64 <t> (Rsh8x64 <t> n (Const64 <typ.UInt64> [ 7])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 7 && kbar == 8 - k // cond: k > 0 && k < 7 && kbar == 8 - k
// result: (Eq8 (And8 <t> n (Const8 <t> [int64(1<<uint(k)-1)])) (Const8 <t> [0])) // result: (Eq8 (And8 <t> n (Const8 <t> [1<<uint(k)-1])) (Const8 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -8115,30 +8115,30 @@ func rewriteValuegeneric_OpEq8(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 7 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 7 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 7 && kbar == 8-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 7 && kbar == 8-k) {
continue continue
} }
v.reset(OpEq8) v.reset(OpEq8)
v0 := b.NewValue0(v.Pos, OpAnd8, t) v0 := b.NewValue0(v.Pos, OpAnd8, t)
v1 := b.NewValue0(v.Pos, OpConst8, t) v1 := b.NewValue0(v.Pos, OpConst8, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int8ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst8, t) v2 := b.NewValue0(v.Pos, OpConst8, t)
v2.AuxInt = 0 v2.AuxInt = int8ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -8156,7 +8156,7 @@ func rewriteValuegeneric_OpEq8(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst8 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst8 || auxIntToInt8(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpEq8) v.reset(OpEq8)
@ -11776,21 +11776,21 @@ func rewriteValuegeneric_OpMod16(v *Value) bool {
return true return true
} }
// match: (Mod16 <t> n (Const16 [c])) // match: (Mod16 <t> n (Const16 [c]))
// cond: isNonNegative(n) && isPowerOfTwo(c&0xffff) // cond: isNonNegative(n) && isPowerOfTwo16(c)
// result: (And16 n (Const16 <t> [(c&0xffff)-1])) // result: (And16 n (Const16 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst16 { if v_1.Op != OpConst16 {
break break
} }
c := v_1.AuxInt c := auxIntToInt16(v_1.AuxInt)
if !(isNonNegative(n) && isPowerOfTwo(c&0xffff)) { if !(isNonNegative(n) && isPowerOfTwo16(c)) {
break break
} }
v.reset(OpAnd16) v.reset(OpAnd16)
v0 := b.NewValue0(v.Pos, OpConst16, t) v0 := b.NewValue0(v.Pos, OpConst16, t)
v0.AuxInt = (c & 0xffff) - 1 v0.AuxInt = int16ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -11803,14 +11803,14 @@ func rewriteValuegeneric_OpMod16(v *Value) bool {
if v_1.Op != OpConst16 { if v_1.Op != OpConst16 {
break break
} }
c := v_1.AuxInt c := auxIntToInt16(v_1.AuxInt)
if !(c < 0 && c != -1<<15) { if !(c < 0 && c != -1<<15) {
break break
} }
v.reset(OpMod16) v.reset(OpMod16)
v.Type = t v.Type = t
v0 := b.NewValue0(v.Pos, OpConst16, t) v0 := b.NewValue0(v.Pos, OpConst16, t)
v0.AuxInt = -c v0.AuxInt = int16ToAuxInt(-c)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -11823,7 +11823,7 @@ func rewriteValuegeneric_OpMod16(v *Value) bool {
if v_1.Op != OpConst16 { if v_1.Op != OpConst16 {
break break
} }
c := v_1.AuxInt c := auxIntToInt16(v_1.AuxInt)
if !(x.Op != OpConst16 && (c > 0 || c == -1<<15)) { if !(x.Op != OpConst16 && (c > 0 || c == -1<<15)) {
break break
} }
@ -11831,7 +11831,7 @@ func rewriteValuegeneric_OpMod16(v *Value) bool {
v0 := b.NewValue0(v.Pos, OpMul16, t) v0 := b.NewValue0(v.Pos, OpMul16, t)
v1 := b.NewValue0(v.Pos, OpDiv16, t) v1 := b.NewValue0(v.Pos, OpDiv16, t)
v2 := b.NewValue0(v.Pos, OpConst16, t) v2 := b.NewValue0(v.Pos, OpConst16, t)
v2.AuxInt = c v2.AuxInt = int16ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -11863,26 +11863,26 @@ func rewriteValuegeneric_OpMod16u(v *Value) bool {
return true return true
} }
// match: (Mod16u <t> n (Const16 [c])) // match: (Mod16u <t> n (Const16 [c]))
// cond: isPowerOfTwo(c&0xffff) // cond: isPowerOfTwo16(c)
// result: (And16 n (Const16 <t> [(c&0xffff)-1])) // result: (And16 n (Const16 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst16 { if v_1.Op != OpConst16 {
break break
} }
c := v_1.AuxInt c := auxIntToInt16(v_1.AuxInt)
if !(isPowerOfTwo(c & 0xffff)) { if !(isPowerOfTwo16(c)) {
break break
} }
v.reset(OpAnd16) v.reset(OpAnd16)
v0 := b.NewValue0(v.Pos, OpConst16, t) v0 := b.NewValue0(v.Pos, OpConst16, t)
v0.AuxInt = (c & 0xffff) - 1 v0.AuxInt = int16ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
// match: (Mod16u <t> x (Const16 [c])) // match: (Mod16u <t> x (Const16 [c]))
// cond: x.Op != OpConst16 && c > 0 && umagicOK(16,c) // cond: x.Op != OpConst16 && c > 0 && umagicOK16(c)
// result: (Sub16 x (Mul16 <t> (Div16u <t> x (Const16 <t> [c])) (Const16 <t> [c]))) // result: (Sub16 x (Mul16 <t> (Div16u <t> x (Const16 <t> [c])) (Const16 <t> [c])))
for { for {
t := v.Type t := v.Type
@ -11890,15 +11890,15 @@ func rewriteValuegeneric_OpMod16u(v *Value) bool {
if v_1.Op != OpConst16 { if v_1.Op != OpConst16 {
break break
} }
c := v_1.AuxInt c := auxIntToInt16(v_1.AuxInt)
if !(x.Op != OpConst16 && c > 0 && umagicOK(16, c)) { if !(x.Op != OpConst16 && c > 0 && umagicOK16(c)) {
break break
} }
v.reset(OpSub16) v.reset(OpSub16)
v0 := b.NewValue0(v.Pos, OpMul16, t) v0 := b.NewValue0(v.Pos, OpMul16, t)
v1 := b.NewValue0(v.Pos, OpDiv16u, t) v1 := b.NewValue0(v.Pos, OpDiv16u, t)
v2 := b.NewValue0(v.Pos, OpConst16, t) v2 := b.NewValue0(v.Pos, OpConst16, t)
v2.AuxInt = c v2.AuxInt = int16ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -11930,21 +11930,21 @@ func rewriteValuegeneric_OpMod32(v *Value) bool {
return true return true
} }
// match: (Mod32 <t> n (Const32 [c])) // match: (Mod32 <t> n (Const32 [c]))
// cond: isNonNegative(n) && isPowerOfTwo(c&0xffffffff) // cond: isNonNegative(n) && isPowerOfTwo32(c)
// result: (And32 n (Const32 <t> [(c&0xffffffff)-1])) // result: (And32 n (Const32 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst32 { if v_1.Op != OpConst32 {
break break
} }
c := v_1.AuxInt c := auxIntToInt32(v_1.AuxInt)
if !(isNonNegative(n) && isPowerOfTwo(c&0xffffffff)) { if !(isNonNegative(n) && isPowerOfTwo32(c)) {
break break
} }
v.reset(OpAnd32) v.reset(OpAnd32)
v0 := b.NewValue0(v.Pos, OpConst32, t) v0 := b.NewValue0(v.Pos, OpConst32, t)
v0.AuxInt = (c & 0xffffffff) - 1 v0.AuxInt = int32ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -11957,14 +11957,14 @@ func rewriteValuegeneric_OpMod32(v *Value) bool {
if v_1.Op != OpConst32 { if v_1.Op != OpConst32 {
break break
} }
c := v_1.AuxInt c := auxIntToInt32(v_1.AuxInt)
if !(c < 0 && c != -1<<31) { if !(c < 0 && c != -1<<31) {
break break
} }
v.reset(OpMod32) v.reset(OpMod32)
v.Type = t v.Type = t
v0 := b.NewValue0(v.Pos, OpConst32, t) v0 := b.NewValue0(v.Pos, OpConst32, t)
v0.AuxInt = -c v0.AuxInt = int32ToAuxInt(-c)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -11977,7 +11977,7 @@ func rewriteValuegeneric_OpMod32(v *Value) bool {
if v_1.Op != OpConst32 { if v_1.Op != OpConst32 {
break break
} }
c := v_1.AuxInt c := auxIntToInt32(v_1.AuxInt)
if !(x.Op != OpConst32 && (c > 0 || c == -1<<31)) { if !(x.Op != OpConst32 && (c > 0 || c == -1<<31)) {
break break
} }
@ -11985,7 +11985,7 @@ func rewriteValuegeneric_OpMod32(v *Value) bool {
v0 := b.NewValue0(v.Pos, OpMul32, t) v0 := b.NewValue0(v.Pos, OpMul32, t)
v1 := b.NewValue0(v.Pos, OpDiv32, t) v1 := b.NewValue0(v.Pos, OpDiv32, t)
v2 := b.NewValue0(v.Pos, OpConst32, t) v2 := b.NewValue0(v.Pos, OpConst32, t)
v2.AuxInt = c v2.AuxInt = int32ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -12017,26 +12017,26 @@ func rewriteValuegeneric_OpMod32u(v *Value) bool {
return true return true
} }
// match: (Mod32u <t> n (Const32 [c])) // match: (Mod32u <t> n (Const32 [c]))
// cond: isPowerOfTwo(c&0xffffffff) // cond: isPowerOfTwo32(c)
// result: (And32 n (Const32 <t> [(c&0xffffffff)-1])) // result: (And32 n (Const32 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst32 { if v_1.Op != OpConst32 {
break break
} }
c := v_1.AuxInt c := auxIntToInt32(v_1.AuxInt)
if !(isPowerOfTwo(c & 0xffffffff)) { if !(isPowerOfTwo32(c)) {
break break
} }
v.reset(OpAnd32) v.reset(OpAnd32)
v0 := b.NewValue0(v.Pos, OpConst32, t) v0 := b.NewValue0(v.Pos, OpConst32, t)
v0.AuxInt = (c & 0xffffffff) - 1 v0.AuxInt = int32ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
// match: (Mod32u <t> x (Const32 [c])) // match: (Mod32u <t> x (Const32 [c]))
// cond: x.Op != OpConst32 && c > 0 && umagicOK(32,c) // cond: x.Op != OpConst32 && c > 0 && umagicOK32(c)
// result: (Sub32 x (Mul32 <t> (Div32u <t> x (Const32 <t> [c])) (Const32 <t> [c]))) // result: (Sub32 x (Mul32 <t> (Div32u <t> x (Const32 <t> [c])) (Const32 <t> [c])))
for { for {
t := v.Type t := v.Type
@ -12044,15 +12044,15 @@ func rewriteValuegeneric_OpMod32u(v *Value) bool {
if v_1.Op != OpConst32 { if v_1.Op != OpConst32 {
break break
} }
c := v_1.AuxInt c := auxIntToInt32(v_1.AuxInt)
if !(x.Op != OpConst32 && c > 0 && umagicOK(32, c)) { if !(x.Op != OpConst32 && c > 0 && umagicOK32(c)) {
break break
} }
v.reset(OpSub32) v.reset(OpSub32)
v0 := b.NewValue0(v.Pos, OpMul32, t) v0 := b.NewValue0(v.Pos, OpMul32, t)
v1 := b.NewValue0(v.Pos, OpDiv32u, t) v1 := b.NewValue0(v.Pos, OpDiv32u, t)
v2 := b.NewValue0(v.Pos, OpConst32, t) v2 := b.NewValue0(v.Pos, OpConst32, t)
v2.AuxInt = c v2.AuxInt = int32ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -12084,7 +12084,7 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
return true return true
} }
// match: (Mod64 <t> n (Const64 [c])) // match: (Mod64 <t> n (Const64 [c]))
// cond: isNonNegative(n) && isPowerOfTwo(c) // cond: isNonNegative(n) && isPowerOfTwo64(c)
// result: (And64 n (Const64 <t> [c-1])) // result: (And64 n (Const64 <t> [c-1]))
for { for {
t := v.Type t := v.Type
@ -12092,13 +12092,13 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
if v_1.Op != OpConst64 { if v_1.Op != OpConst64 {
break break
} }
c := v_1.AuxInt c := auxIntToInt64(v_1.AuxInt)
if !(isNonNegative(n) && isPowerOfTwo(c)) { if !(isNonNegative(n) && isPowerOfTwo64(c)) {
break break
} }
v.reset(OpAnd64) v.reset(OpAnd64)
v0 := b.NewValue0(v.Pos, OpConst64, t) v0 := b.NewValue0(v.Pos, OpConst64, t)
v0.AuxInt = c - 1 v0.AuxInt = int64ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -12107,7 +12107,7 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
// result: n // result: n
for { for {
n := v_0 n := v_0
if v_1.Op != OpConst64 || v_1.AuxInt != -1<<63 || !(isNonNegative(n)) { if v_1.Op != OpConst64 || auxIntToInt64(v_1.AuxInt) != -1<<63 || !(isNonNegative(n)) {
break break
} }
v.copyOf(n) v.copyOf(n)
@ -12122,14 +12122,14 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
if v_1.Op != OpConst64 { if v_1.Op != OpConst64 {
break break
} }
c := v_1.AuxInt c := auxIntToInt64(v_1.AuxInt)
if !(c < 0 && c != -1<<63) { if !(c < 0 && c != -1<<63) {
break break
} }
v.reset(OpMod64) v.reset(OpMod64)
v.Type = t v.Type = t
v0 := b.NewValue0(v.Pos, OpConst64, t) v0 := b.NewValue0(v.Pos, OpConst64, t)
v0.AuxInt = -c v0.AuxInt = int64ToAuxInt(-c)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -12142,7 +12142,7 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
if v_1.Op != OpConst64 { if v_1.Op != OpConst64 {
break break
} }
c := v_1.AuxInt c := auxIntToInt64(v_1.AuxInt)
if !(x.Op != OpConst64 && (c > 0 || c == -1<<63)) { if !(x.Op != OpConst64 && (c > 0 || c == -1<<63)) {
break break
} }
@ -12150,7 +12150,7 @@ func rewriteValuegeneric_OpMod64(v *Value) bool {
v0 := b.NewValue0(v.Pos, OpMul64, t) v0 := b.NewValue0(v.Pos, OpMul64, t)
v1 := b.NewValue0(v.Pos, OpDiv64, t) v1 := b.NewValue0(v.Pos, OpDiv64, t)
v2 := b.NewValue0(v.Pos, OpConst64, t) v2 := b.NewValue0(v.Pos, OpConst64, t)
v2.AuxInt = c v2.AuxInt = int64ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -12182,7 +12182,7 @@ func rewriteValuegeneric_OpMod64u(v *Value) bool {
return true return true
} }
// match: (Mod64u <t> n (Const64 [c])) // match: (Mod64u <t> n (Const64 [c]))
// cond: isPowerOfTwo(c) // cond: isPowerOfTwo64(c)
// result: (And64 n (Const64 <t> [c-1])) // result: (And64 n (Const64 <t> [c-1]))
for { for {
t := v.Type t := v.Type
@ -12190,13 +12190,13 @@ func rewriteValuegeneric_OpMod64u(v *Value) bool {
if v_1.Op != OpConst64 { if v_1.Op != OpConst64 {
break break
} }
c := v_1.AuxInt c := auxIntToInt64(v_1.AuxInt)
if !(isPowerOfTwo(c)) { if !(isPowerOfTwo64(c)) {
break break
} }
v.reset(OpAnd64) v.reset(OpAnd64)
v0 := b.NewValue0(v.Pos, OpConst64, t) v0 := b.NewValue0(v.Pos, OpConst64, t)
v0.AuxInt = c - 1 v0.AuxInt = int64ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -12205,17 +12205,17 @@ func rewriteValuegeneric_OpMod64u(v *Value) bool {
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst64 || v_1.AuxInt != -1<<63 { if v_1.Op != OpConst64 || auxIntToInt64(v_1.AuxInt) != -1<<63 {
break break
} }
v.reset(OpAnd64) v.reset(OpAnd64)
v0 := b.NewValue0(v.Pos, OpConst64, t) v0 := b.NewValue0(v.Pos, OpConst64, t)
v0.AuxInt = 1<<63 - 1 v0.AuxInt = int64ToAuxInt(1<<63 - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
// match: (Mod64u <t> x (Const64 [c])) // match: (Mod64u <t> x (Const64 [c]))
// cond: x.Op != OpConst64 && c > 0 && umagicOK(64,c) // cond: x.Op != OpConst64 && c > 0 && umagicOK64(c)
// result: (Sub64 x (Mul64 <t> (Div64u <t> x (Const64 <t> [c])) (Const64 <t> [c]))) // result: (Sub64 x (Mul64 <t> (Div64u <t> x (Const64 <t> [c])) (Const64 <t> [c])))
for { for {
t := v.Type t := v.Type
@ -12223,15 +12223,15 @@ func rewriteValuegeneric_OpMod64u(v *Value) bool {
if v_1.Op != OpConst64 { if v_1.Op != OpConst64 {
break break
} }
c := v_1.AuxInt c := auxIntToInt64(v_1.AuxInt)
if !(x.Op != OpConst64 && c > 0 && umagicOK(64, c)) { if !(x.Op != OpConst64 && c > 0 && umagicOK64(c)) {
break break
} }
v.reset(OpSub64) v.reset(OpSub64)
v0 := b.NewValue0(v.Pos, OpMul64, t) v0 := b.NewValue0(v.Pos, OpMul64, t)
v1 := b.NewValue0(v.Pos, OpDiv64u, t) v1 := b.NewValue0(v.Pos, OpDiv64u, t)
v2 := b.NewValue0(v.Pos, OpConst64, t) v2 := b.NewValue0(v.Pos, OpConst64, t)
v2.AuxInt = c v2.AuxInt = int64ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -12263,21 +12263,21 @@ func rewriteValuegeneric_OpMod8(v *Value) bool {
return true return true
} }
// match: (Mod8 <t> n (Const8 [c])) // match: (Mod8 <t> n (Const8 [c]))
// cond: isNonNegative(n) && isPowerOfTwo(c&0xff) // cond: isNonNegative(n) && isPowerOfTwo8(c)
// result: (And8 n (Const8 <t> [(c&0xff)-1])) // result: (And8 n (Const8 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst8 { if v_1.Op != OpConst8 {
break break
} }
c := v_1.AuxInt c := auxIntToInt8(v_1.AuxInt)
if !(isNonNegative(n) && isPowerOfTwo(c&0xff)) { if !(isNonNegative(n) && isPowerOfTwo8(c)) {
break break
} }
v.reset(OpAnd8) v.reset(OpAnd8)
v0 := b.NewValue0(v.Pos, OpConst8, t) v0 := b.NewValue0(v.Pos, OpConst8, t)
v0.AuxInt = (c & 0xff) - 1 v0.AuxInt = int8ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -12290,14 +12290,14 @@ func rewriteValuegeneric_OpMod8(v *Value) bool {
if v_1.Op != OpConst8 { if v_1.Op != OpConst8 {
break break
} }
c := v_1.AuxInt c := auxIntToInt8(v_1.AuxInt)
if !(c < 0 && c != -1<<7) { if !(c < 0 && c != -1<<7) {
break break
} }
v.reset(OpMod8) v.reset(OpMod8)
v.Type = t v.Type = t
v0 := b.NewValue0(v.Pos, OpConst8, t) v0 := b.NewValue0(v.Pos, OpConst8, t)
v0.AuxInt = -c v0.AuxInt = int8ToAuxInt(-c)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
@ -12310,7 +12310,7 @@ func rewriteValuegeneric_OpMod8(v *Value) bool {
if v_1.Op != OpConst8 { if v_1.Op != OpConst8 {
break break
} }
c := v_1.AuxInt c := auxIntToInt8(v_1.AuxInt)
if !(x.Op != OpConst8 && (c > 0 || c == -1<<7)) { if !(x.Op != OpConst8 && (c > 0 || c == -1<<7)) {
break break
} }
@ -12318,7 +12318,7 @@ func rewriteValuegeneric_OpMod8(v *Value) bool {
v0 := b.NewValue0(v.Pos, OpMul8, t) v0 := b.NewValue0(v.Pos, OpMul8, t)
v1 := b.NewValue0(v.Pos, OpDiv8, t) v1 := b.NewValue0(v.Pos, OpDiv8, t)
v2 := b.NewValue0(v.Pos, OpConst8, t) v2 := b.NewValue0(v.Pos, OpConst8, t)
v2.AuxInt = c v2.AuxInt = int8ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -12350,26 +12350,26 @@ func rewriteValuegeneric_OpMod8u(v *Value) bool {
return true return true
} }
// match: (Mod8u <t> n (Const8 [c])) // match: (Mod8u <t> n (Const8 [c]))
// cond: isPowerOfTwo(c&0xff) // cond: isPowerOfTwo8(c)
// result: (And8 n (Const8 <t> [(c&0xff)-1])) // result: (And8 n (Const8 <t> [c-1]))
for { for {
t := v.Type t := v.Type
n := v_0 n := v_0
if v_1.Op != OpConst8 { if v_1.Op != OpConst8 {
break break
} }
c := v_1.AuxInt c := auxIntToInt8(v_1.AuxInt)
if !(isPowerOfTwo(c & 0xff)) { if !(isPowerOfTwo8(c)) {
break break
} }
v.reset(OpAnd8) v.reset(OpAnd8)
v0 := b.NewValue0(v.Pos, OpConst8, t) v0 := b.NewValue0(v.Pos, OpConst8, t)
v0.AuxInt = (c & 0xff) - 1 v0.AuxInt = int8ToAuxInt(c - 1)
v.AddArg2(n, v0) v.AddArg2(n, v0)
return true return true
} }
// match: (Mod8u <t> x (Const8 [c])) // match: (Mod8u <t> x (Const8 [c]))
// cond: x.Op != OpConst8 && c > 0 && umagicOK(8, c) // cond: x.Op != OpConst8 && c > 0 && umagicOK8( c)
// result: (Sub8 x (Mul8 <t> (Div8u <t> x (Const8 <t> [c])) (Const8 <t> [c]))) // result: (Sub8 x (Mul8 <t> (Div8u <t> x (Const8 <t> [c])) (Const8 <t> [c])))
for { for {
t := v.Type t := v.Type
@ -12377,15 +12377,15 @@ func rewriteValuegeneric_OpMod8u(v *Value) bool {
if v_1.Op != OpConst8 { if v_1.Op != OpConst8 {
break break
} }
c := v_1.AuxInt c := auxIntToInt8(v_1.AuxInt)
if !(x.Op != OpConst8 && c > 0 && umagicOK(8, c)) { if !(x.Op != OpConst8 && c > 0 && umagicOK8(c)) {
break break
} }
v.reset(OpSub8) v.reset(OpSub8)
v0 := b.NewValue0(v.Pos, OpMul8, t) v0 := b.NewValue0(v.Pos, OpMul8, t)
v1 := b.NewValue0(v.Pos, OpDiv8u, t) v1 := b.NewValue0(v.Pos, OpDiv8u, t)
v2 := b.NewValue0(v.Pos, OpConst8, t) v2 := b.NewValue0(v.Pos, OpConst8, t)
v2.AuxInt = c v2.AuxInt = int8ToAuxInt(c)
v1.AddArg2(x, v2) v1.AddArg2(x, v2)
v0.AddArg2(v1, v2) v0.AddArg2(v1, v2)
v.AddArg2(x, v0) v.AddArg2(x, v0)
@ -14816,7 +14816,7 @@ func rewriteValuegeneric_OpNeq16(v *Value) bool {
} }
// match: (Neq16 n (Lsh16x64 (Rsh16x64 (Add16 <t> n (Rsh16Ux64 <t> (Rsh16x64 <t> n (Const64 <typ.UInt64> [15])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Neq16 n (Lsh16x64 (Rsh16x64 (Add16 <t> n (Rsh16Ux64 <t> (Rsh16x64 <t> n (Const64 <typ.UInt64> [15])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 15 && kbar == 16 - k // cond: k > 0 && k < 15 && kbar == 16 - k
// result: (Neq16 (And16 <t> n (Const16 <t> [int64(1<<uint(k)-1)])) (Const16 <t> [0])) // result: (Neq16 (And16 <t> n (Const16 <t> [1<<uint(k)-1])) (Const16 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -14851,30 +14851,30 @@ func rewriteValuegeneric_OpNeq16(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 15 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 15 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 15 && kbar == 16-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 15 && kbar == 16-k) {
continue continue
} }
v.reset(OpNeq16) v.reset(OpNeq16)
v0 := b.NewValue0(v.Pos, OpAnd16, t) v0 := b.NewValue0(v.Pos, OpAnd16, t)
v1 := b.NewValue0(v.Pos, OpConst16, t) v1 := b.NewValue0(v.Pos, OpConst16, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int16ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst16, t) v2 := b.NewValue0(v.Pos, OpConst16, t)
v2.AuxInt = 0 v2.AuxInt = int16ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -14892,7 +14892,7 @@ func rewriteValuegeneric_OpNeq16(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst16 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst16 || auxIntToInt16(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpNeq16) v.reset(OpNeq16)
@ -15003,7 +15003,7 @@ func rewriteValuegeneric_OpNeq32(v *Value) bool {
} }
// match: (Neq32 n (Lsh32x64 (Rsh32x64 (Add32 <t> n (Rsh32Ux64 <t> (Rsh32x64 <t> n (Const64 <typ.UInt64> [31])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Neq32 n (Lsh32x64 (Rsh32x64 (Add32 <t> n (Rsh32Ux64 <t> (Rsh32x64 <t> n (Const64 <typ.UInt64> [31])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 31 && kbar == 32 - k // cond: k > 0 && k < 31 && kbar == 32 - k
// result: (Neq32 (And32 <t> n (Const32 <t> [int64(1<<uint(k)-1)])) (Const32 <t> [0])) // result: (Neq32 (And32 <t> n (Const32 <t> [1<<uint(k)-1])) (Const32 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -15038,30 +15038,30 @@ func rewriteValuegeneric_OpNeq32(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 31 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 31 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 31 && kbar == 32-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 31 && kbar == 32-k) {
continue continue
} }
v.reset(OpNeq32) v.reset(OpNeq32)
v0 := b.NewValue0(v.Pos, OpAnd32, t) v0 := b.NewValue0(v.Pos, OpAnd32, t)
v1 := b.NewValue0(v.Pos, OpConst32, t) v1 := b.NewValue0(v.Pos, OpConst32, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int32ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst32, t) v2 := b.NewValue0(v.Pos, OpConst32, t)
v2.AuxInt = 0 v2.AuxInt = int32ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -15079,7 +15079,7 @@ func rewriteValuegeneric_OpNeq32(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst32 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst32 || auxIntToInt32(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpNeq32) v.reset(OpNeq32)
@ -15213,7 +15213,7 @@ func rewriteValuegeneric_OpNeq64(v *Value) bool {
} }
// match: (Neq64 n (Lsh64x64 (Rsh64x64 (Add64 <t> n (Rsh64Ux64 <t> (Rsh64x64 <t> n (Const64 <typ.UInt64> [63])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Neq64 n (Lsh64x64 (Rsh64x64 (Add64 <t> n (Rsh64Ux64 <t> (Rsh64x64 <t> n (Const64 <typ.UInt64> [63])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 63 && kbar == 64 - k // cond: k > 0 && k < 63 && kbar == 64 - k
// result: (Neq64 (And64 <t> n (Const64 <t> [int64(1<<uint(k)-1)])) (Const64 <t> [0])) // result: (Neq64 (And64 <t> n (Const64 <t> [1<<uint(k)-1])) (Const64 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -15248,30 +15248,30 @@ func rewriteValuegeneric_OpNeq64(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 63 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 63 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 63 && kbar == 64-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 63 && kbar == 64-k) {
continue continue
} }
v.reset(OpNeq64) v.reset(OpNeq64)
v0 := b.NewValue0(v.Pos, OpAnd64, t) v0 := b.NewValue0(v.Pos, OpAnd64, t)
v1 := b.NewValue0(v.Pos, OpConst64, t) v1 := b.NewValue0(v.Pos, OpConst64, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int64ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst64, t) v2 := b.NewValue0(v.Pos, OpConst64, t)
v2.AuxInt = 0 v2.AuxInt = int64ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -15289,7 +15289,7 @@ func rewriteValuegeneric_OpNeq64(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst64 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst64 || auxIntToInt64(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpNeq64) v.reset(OpNeq64)
@ -15423,7 +15423,7 @@ func rewriteValuegeneric_OpNeq8(v *Value) bool {
} }
// match: (Neq8 n (Lsh8x64 (Rsh8x64 (Add8 <t> n (Rsh8Ux64 <t> (Rsh8x64 <t> n (Const64 <typ.UInt64> [ 7])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) ) // match: (Neq8 n (Lsh8x64 (Rsh8x64 (Add8 <t> n (Rsh8Ux64 <t> (Rsh8x64 <t> n (Const64 <typ.UInt64> [ 7])) (Const64 <typ.UInt64> [kbar]))) (Const64 <typ.UInt64> [k])) (Const64 <typ.UInt64> [k])) )
// cond: k > 0 && k < 7 && kbar == 8 - k // cond: k > 0 && k < 7 && kbar == 8 - k
// result: (Neq8 (And8 <t> n (Const8 <t> [int64(1<<uint(k)-1)])) (Const8 <t> [0])) // result: (Neq8 (And8 <t> n (Const8 <t> [1<<uint(k)-1])) (Const8 <t> [0]))
for { for {
for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 { for _i0 := 0; _i0 <= 1; _i0, v_0, v_1 = _i0+1, v_1, v_0 {
n := v_0 n := v_0
@ -15458,30 +15458,30 @@ func rewriteValuegeneric_OpNeq8(v *Value) bool {
continue continue
} }
v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1] v_1_0_0_1_0_1 := v_1_0_0_1_0.Args[1]
if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || v_1_0_0_1_0_1.AuxInt != 7 { if v_1_0_0_1_0_1.Op != OpConst64 || v_1_0_0_1_0_1.Type != typ.UInt64 || auxIntToInt64(v_1_0_0_1_0_1.AuxInt) != 7 {
continue continue
} }
v_1_0_0_1_1 := v_1_0_0_1.Args[1] v_1_0_0_1_1 := v_1_0_0_1.Args[1]
if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 { if v_1_0_0_1_1.Op != OpConst64 || v_1_0_0_1_1.Type != typ.UInt64 {
continue continue
} }
kbar := v_1_0_0_1_1.AuxInt kbar := auxIntToInt64(v_1_0_0_1_1.AuxInt)
v_1_0_1 := v_1_0.Args[1] v_1_0_1 := v_1_0.Args[1]
if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 { if v_1_0_1.Op != OpConst64 || v_1_0_1.Type != typ.UInt64 {
continue continue
} }
k := v_1_0_1.AuxInt k := auxIntToInt64(v_1_0_1.AuxInt)
v_1_1 := v_1.Args[1] v_1_1 := v_1.Args[1]
if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || v_1_1.AuxInt != k || !(k > 0 && k < 7 && kbar == 8-k) { if v_1_1.Op != OpConst64 || v_1_1.Type != typ.UInt64 || auxIntToInt64(v_1_1.AuxInt) != k || !(k > 0 && k < 7 && kbar == 8-k) {
continue continue
} }
v.reset(OpNeq8) v.reset(OpNeq8)
v0 := b.NewValue0(v.Pos, OpAnd8, t) v0 := b.NewValue0(v.Pos, OpAnd8, t)
v1 := b.NewValue0(v.Pos, OpConst8, t) v1 := b.NewValue0(v.Pos, OpConst8, t)
v1.AuxInt = int64(1<<uint(k) - 1) v1.AuxInt = int8ToAuxInt(1<<uint(k) - 1)
v0.AddArg2(n, v1) v0.AddArg2(n, v1)
v2 := b.NewValue0(v.Pos, OpConst8, t) v2 := b.NewValue0(v.Pos, OpConst8, t)
v2.AuxInt = 0 v2.AuxInt = int8ToAuxInt(0)
v.AddArg2(v0, v2) v.AddArg2(v0, v2)
return true return true
} }
@ -15499,7 +15499,7 @@ func rewriteValuegeneric_OpNeq8(v *Value) bool {
} }
y := s.Args[1] y := s.Args[1]
x := s.Args[0] x := s.Args[0]
if v_1.Op != OpConst8 || v_1.AuxInt != 0 || !(s.Uses == 1) { if v_1.Op != OpConst8 || auxIntToInt8(v_1.AuxInt) != 0 || !(s.Uses == 1) {
continue continue
} }
v.reset(OpNeq8) v.reset(OpNeq8)