Lines Matching defs:lhs
2343 Node* lhs = node->InputAt(0);
2345 if (IsNodeRepresentationTagged(lhs) &&
4634 Node* const lhs = m.left().node();
4638 return graph()->NewNode(machine()->Int32Sub(), zero, lhs);
4642 return graph()->NewNode(machine()->Int32Div(), lhs, rhs, graph()->start());
4648 // lhs / rhs
4651 // lhs / rhs
4655 // 0 - lhs
4668 Node* true0 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true0);
4677 Node* true1 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true1);
4689 Node* false2 = graph()->NewNode(machine()->Int32Sub(), zero, lhs);
4707 Node* const lhs = m.left().node();
4713 return graph()->NewNode(machine()->Int32Mod(), lhs, rhs, graph()->start());
4722 // lhs % rhs
4724 // if lhs < 0 then
4725 // -(-lhs & msk)
4727 // lhs & msk
4730 // lhs % rhs
4753 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
4758 Node* check2 = graph()->NewNode(machine()->Int32LessThan(), lhs, zero);
4766 graph()->NewNode(machine()->Int32Sub(), zero, lhs),
4770 Node* false2 = graph()->NewNode(machine()->Word32And(), lhs, msk);
4788 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
4820 Node* const lhs = m.left().node();
4826 return graph()->NewNode(machine()->Uint32Div(), lhs, rhs, graph()->start());
4831 Node* div = graph()->NewNode(machine()->Uint32Div(), lhs, rhs, d.if_false);
4839 Node* const lhs = m.left().node();
4845 return graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, graph()->start());
4856 // lhs % rhs
4858 // lhs & msk
4882 Node* true1 = graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, if_true1);
4885 Node* false1 = graph()->NewNode(machine()->Word32And(), lhs, msk);
4897 Node* const lhs = node->InputAt(0);
4900 node->ReplaceInput(0, graph()->NewNode(op, lhs, rhs));
4902 node->AppendInput(graph()->zone(), lhs);
4908 Node* const lhs = node->InputAt(0);
4911 node->InsertInput(graph()->zone(), 0, graph()->NewNode(op, lhs, rhs));
4912 DCHECK_EQ(lhs, node->InputAt(1));