Home | History | Annotate | Download | only in compiler

Lines Matching full:machine

33 // Representation selection and lowering of {Simplified} operators to machine
37 // machine representation after this phase, as dictated by the machine
899 NodeProperties::ChangeOp(node, lowering->machine()->Word32Equal());
903 NodeProperties::ChangeOp(node, lowering->machine()->WordEqual());
921 NodeProperties::ChangeOp(node, lowering->machine()->WordEqual());
1058 lowering->DoShift(node, lowering->machine()->Word32Shl(), rhs_type);
1067 lowering->DoShift(node, lowering->machine()->Word32Sar(), rhs_type);
1076 lowering->DoShift(node, lowering->machine()->Word32Shr(), rhs_type);
1099 lowering->machine()->Float64ExtractLowWord32(),
1103 NodeProperties::ChangeOp(node, jsgraph_->machine()->Word32Equal());
1127 NodeProperties::ChangeOp(node, lowering->machine()->WordEqual());
1251 // Machine-level operators.
1254 // TODO(jarin) Eventually, we should get rid of all machine stores
1264 // TODO(jarin) Eventually, we should get rid of all machine stores
1285 // though the machine bits are the same for either signed or unsigned,
1526 machine()->Is64()
1527 ? graph()->NewNode(machine()->ChangeUint32ToUint64(), offset)
1530 Node* check = graph()->NewNode(machine()->Uint32LessThan(), offset, length);
1535 Node* etrue = graph()->NewNode(machine()->Load(access_type), buffer, index,
1569 NodeProperties::ChangeOp(node, machine()->CheckedLoad(access_type));
1578 NodeProperties::ChangeOp(node, machine()->CheckedStore(rep));
1586 graph()->NewNode(machine()->WordEqual(),
1587 graph()->NewNode(machine()->WordAnd(), input,
1595 machine()->WordEqual(),
1597 machine()->Load(MachineType::AnyTagged()), input,
1611 graph()->NewNode(machine()->WordAnd(), node->InputAt(0),
1614 NodeProperties::ChangeOp(node, machine()->WordEqual());
1641 return graph()->NewNode(machine()->Int32Sub(), zero, lhs);
1644 } else if (machine()->Int32DivIsSafe() || m.right().HasValue()) {
1645 return graph()->NewNode(machine()->Int32Div(), lhs, rhs, graph()->start());
1666 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
1671 Node* true0 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true0);
1676 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one);
1680 Node* true1 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true1);
1685 Node* check2 = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
1692 Node* false2 = graph()->NewNode(machine()->Int32Sub(), zero, lhs);
1717 return graph()->NewNode(machine()->Int32Mod(), lhs, rhs, graph()->start());
1744 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
1751 Node* msk = graph()->NewNode(machine()->Int32Add(), rhs, minus_one);
1753 Node* check1 = graph()->NewNode(machine()->Word32And(), rhs, msk);
1757 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
1762 Node* check2 = graph()->NewNode(machine()->Int32LessThan(), lhs, zero);
1768 machine()->Int32Sub(), zero,
1769 graph()->NewNode(machine()->Word32And(),
1770 graph()->NewNode(machine()->Int32Sub(), zero, lhs),
1774 Node* false2 = graph()->NewNode(machine()->Word32And(), lhs, msk);
1787 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one);
1792 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
1814 } else if (machine()->Uint32DivIsSafe() || m.right().HasValue()) {
1815 return graph()->NewNode(machine()->Uint32Div(), lhs, rhs, graph()->start());
1818 Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
1820 Node* div = graph()->NewNode(machine()->Uint32Div(), lhs, rhs, d.if_false);
1835 return graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, graph()->start());
1862 Node* msk = graph()->NewNode(machine()->Int32Add(), rhs, minus_one);
1864 Node* check1 = graph()->NewNode(machine()->Word32And(), rhs, msk);
1868 Node* true1 = graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, if_true1);
1871 Node* false1 = graph()->NewNode(machine()->Word32And(), lhs, msk);
1889 node->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rhs,
1919 NodeProperties::ChangeOp(node, machine()->WordEqual());
1929 NodeProperties::ChangeOp(node, machine()->IntLessThan());
1939 NodeProperties::ChangeOp(node, machine()->IntLessThanOrEqual());