Lines Matching defs:zero
198 // Signed32). Technically, the inputs could also be minus zero, which we treat
1618 // have to do any check if at most one side can be minus zero. For
1633 // right-hand side is not minus zero, we do not have to distinguish
1643 // a minus zero check for the right hand side, since we already
2242 // For equality we also handle the case that one side is non-zero, in
2745 // choose to ignore minus zero in all cases.
2791 // zero in those cases.
2849 // zero in those cases.
2923 // the zero identification part of the truncation, and we turn them into
3063 // all of them to zero here.
4601 Node* const zero = jsgraph()->Float64Constant(0.0);
4608 graph()->NewNode(machine()->Float64LessThan(), input, zero), minus_one,
4611 graph()->NewNode(machine()->Float64LessThan(), zero, input), one,
4632 Node* const zero = jsgraph()->Int32Constant(0);
4638 return graph()->NewNode(machine()->Int32Sub(), zero, lhs);
4663 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
4682 Node* check2 = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
4686 Node* true2 = zero;
4689 Node* false2 = graph()->NewNode(machine()->Int32Sub(), zero, lhs);
4705 Node* const zero = jsgraph()->Int32Constant(0);
4711 return zero;
4732 // zero
4740 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
4758 Node* check2 = graph()->NewNode(machine()->Int32LessThan(), lhs, zero);
4764 machine()->Int32Sub(), zero,
4766 graph()->NewNode(machine()->Int32Sub(), zero, lhs),
4791 Node* false1 = zero;
4803 Node* const zero = jsgraph()->Int32Constant(0);
4810 graph()->NewNode(machine()->Int32LessThan(), input, zero), minus_one,
4813 graph()->NewNode(machine()->Int32LessThan(), zero, input), one,
4814 zero));
4819 Node* const zero = jsgraph()->Uint32Constant(0);
4824 return zero;
4829 Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
4832 return d.Phi(MachineRepresentation::kWord32, zero, div);
4838 Node* const zero = jsgraph()->Uint32Constant(0);
4843 return zero;
4852 // zero
4866 Node* check0 = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
4871 Node* true0 = zero;
4919 Node* const zero = jsgraph()->Int32Constant(0);
4922 node->ReplaceInput(0, graph()->NewNode(op, input, zero));
4923 node->AppendInput(graph()->zone(), zero);