Lines Matching refs:machine
8 #include "src/compiler/machine-operator-reducer.h"
59 machine(main_zone(), MachineType::PointerRepresentation(), flags),
64 jsgraph(isolate, &graph, &common, &javascript, nullptr, &machine),
73 MachineOperatorBuilder machine;
225 R.binop = R.machine.Word32And();
251 R.binop = R.machine.Word32Or();
277 R.binop = R.machine.Word32Xor();
300 R.binop = R.machine.Word32Shl();
321 R.binop = R.machine.Word32Shr();
342 R.binop = R.machine.Word32Sar();
362 CHECK(R->machine.Word32ShiftIsSafe());
368 R->graph.NewNode(R->machine.Word32And(), y, thirty_one);
370 // If the underlying machine shift instructions 'and' their right operand
379 R.binop = R.machine.Word32Shl();
382 R.binop = R.machine.Word32Shr();
385 R.binop = R.machine.Word32Sar();
392 R.binop = R.machine.Word32Equal();
407 Node* sub = R.graph.NewNode(R.machine.Int32Sub(), x, y);
417 R.binop = R.machine.Int32Add();
439 R.binop = R.machine.Int32Sub();
459 R.binop = R.machine.Int32Mul();
480 R.CheckFoldBinop<int32_t>(0, R.machine.Int32Sub(), x, minus_one,
482 R.CheckFoldBinop<int32_t>(0, R.machine.Int32Sub(), x, x,
487 R.CheckFoldBinop<int32_t>(x, R.machine.Word32Shl(), n, x,
489 R.CheckFoldBinop<int32_t>(x, R.machine.Word32Shl(), n, multiplier,
497 R.binop = R.machine.Int32Div();
518 R.CheckFoldBinop<int32_t>(0, R.machine.Int32Sub(), x, x,
525 R.binop = R.machine.Uint32Div();
546 R.CheckFoldBinop<int32_t>(x, R.machine.Word32Shr(), n, x,
554 R.binop = R.machine.Int32Mod();
578 R.binop = R.machine.Uint32Mod();
598 R.CheckFoldBinop<int32_t>(x, R.machine.Word32And(), (1u << n) - 1, x,
606 R.binop = R.machine.Int32LessThan();
621 Node* sub = R.graph.NewNode(R.machine.Int32Sub(), x, y);
631 R.binop = R.machine.Int32LessThanOrEqual();
645 Node* sub = R.graph.NewNode(R.machine.Int32Sub(), x, y);
655 R.binop = R.machine.Uint32LessThan();
679 R.binop = R.machine.Uint32LessThanOrEqual();
706 Node* load = R.graph.NewNode(R.machine.Load(MachineType::Int32()), base,
717 R.graph.NewNode(R.machine.Store(StoreRepresentation(
