Lines Matching defs:zero
1128 Node* const zero = Int32Constant(0);
1129 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero));
1175 Node* const zero = Int32Constant(0);
1176 return Replace(Word32Equal(Word32Equal(m.left().node(), zero), zero));
1210 Node* const zero = Int32Constant(0);
1212 graph()->NewNode(machine()->Int32LessThan(), dividend, zero),
1216 Int32Sub(zero, Word32And(Int32Sub(zero, dividend), mask)),
1992 // (x & K1) | K2 => x | K2 if K2 has ones for every zero bit in K1.
2318 // Reductions involving control flow happen elsewhere. Non-zero inputs are
2338 // Branch conditions are 32-bit comparisons against zero, so they are the