/external/v8/test/unittests/compiler/x64/ |
D | instruction-selector-x64-unittest.cc | 174 {&RawMachineAssembler::Int32Add, "Int32Add"}, 258 Node* const a0 = m.Int32Add(p0, p1); in TEST_F() 281 Node* const v0 = m.Int32Add(p0, c0); in TEST_F() 300 m.Return(m.Int32Add(p0, c0)); in TEST_F() 316 Node* const a0 = m.Int32Add(p0, c0); in TEST_F() 338 m.Return(m.Int32Add(c0, p0)); in TEST_F() 354 Node* const a0 = m.Int32Add(c0, p0); in TEST_F() 378 m.Return(m.Int32Add(p0, p1)); in TEST_F() 395 Node* const v1 = m.Int32Add(p0, p1); in TEST_F() 396 m.Return(m.Int32Add(m.Int32Add(v1, p1), p0)); in TEST_F() [all …]
|
/external/v8/test/cctest/compiler/ |
D | test-multiple-return.cc | 82 Node* add = m.Int32Add(p0, p1); in TEST() 105 Node* ret = mt.Int32Add(mt.Int32Add(x, y), z); in TEST()
|
D | test-run-machops.cc | 27 Node* add = m.Int32Add(m.Int32Constant(0), m.Int32Constant(1)); in TEST() 37 Node* add = m.Int32Add(m.Int32Constant(add_left), m.Int32Constant(add_right)); in RunInt32AddShift() 38 Node* lsa = is_left ? m.Int32Add(shift, add) : m.Int32Add(add, shift); in RunInt32AddShift() 406 m.machine()->Word32Equal(), m.machine()->Int32Add(), in TEST() 929 Node* add = m.Int32Add(phi, m.Int32Constant(1)); in TEST() 955 phi->ReplaceInput(1, m.Int32Add(phi, m.Int32Constant(1))); in TEST() 982 phi->ReplaceInput(1, m.Int32Add(phi, m.Int32Constant(1))); in TEST() 1010 phi->ReplaceInput(1, m.Int32Add(phi, m.Int32Constant(1))); in TEST() 1215 bt.AddReturn(m.Int32Add(bt.param0, bt.param1)); in TEST() 1231 m.Return(m.Int32Add(m.Parameter(0), in TEST() [all …]
|
D | test-machine-operator-reducer.cc | 417 R.binop = R.machine.Int32Add(); in TEST()
|
D | test-simplified-lowering.cc | 507 index = t.Int32Add(index, one); in RunCopyElements() 767 return graph()->NewNode(machine()->Int32Add(), jsgraph.Int32Constant(1), in ExampleWithOutput() 1209 const Operator* ops[] = {t.machine()->Int32Add(), t.machine()->Int32Sub(), in TEST()
|
/external/v8/test/unittests/compiler/ia32/ |
D | instruction-selector-ia32-unittest.cc | 24 m.Return(m.Int32Add(m.Parameter(0), m.Parameter(1))); in TEST_F() 35 m.Return(m.Int32Add(m.Parameter(0), m.Int32Constant(imm))); in TEST_F() 48 m.Return(m.Int32Add(m.Int32Constant(imm), m.Parameter(0))); in TEST_F() 122 Node* add = m.Int32Add(param1, param2); in TEST_F() 123 m.Return(m.Int32Add(add, param1)); in TEST_F() 402 Node* load_index = m->Int32Add(index_reg, non_zero); in TEST_F() 403 Node* store_index = m->Int32Add(index_reg, non_zero); in TEST_F() 413 Node* load_index = m->Int32Add(m->Int32Mul(index_reg, scales[i]), non_zero); in TEST_F() 415 m->Int32Add(m->Int32Mul(index_reg, scales[i]), non_zero); in TEST_F() 443 Node* load_index = m->Int32Add(index_reg, non_zero); in TEST_F() [all …]
|
/external/v8/src/compiler/ |
D | machine-operator-reducer.cc | 71 Node* MachineOperatorReducer::Int32Add(Node* lhs, Node* rhs) { in Int32Add() function in v8::internal::compiler::MachineOperatorReducer 72 Node* const node = graph()->NewNode(machine()->Int32Add(), lhs, rhs); in Int32Add() 98 quotient = Int32Add(quotient, dividend); in Int32Div() 102 return Int32Add(Word32Sar(quotient, mag.shift), Word32Shr(dividend, 31)); in Int32Div() 121 Int32Add(Word32Shr(Int32Sub(dividend, quotient), 1), quotient), in Uint32Div() 551 NodeProperties::ChangeOp(node, machine()->Int32Add()); in ReduceInt32Sub() 589 quotient = Int32Add(Word32Shr(quotient, 32u - shift), dividend); in ReduceInt32Div() 927 NodeProperties::ChangeOp(node, machine()->Int32Add()); in ReduceWord32And() 938 NodeProperties::ChangeOp(node, machine()->Int32Add()); in ReduceWord32And() 950 NodeProperties::ChangeOp(node, machine()->Int32Add()); in ReduceWord32And() [all …]
|
D | int64-lowering.cc | 107 index_high = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes() 110 index_low = graph()->NewNode(machine()->Int32Add(), index, in GetIndexNodes() 694 graph()->NewNode(machine()->Int32Add(), in LowerNode() 712 graph()->NewNode(machine()->Int32Add(), in LowerNode() 728 machine()->Int32Add(), in LowerNode()
|
D | basic-block-instrumentor.cc | 86 Node* inc = graph->NewNode(machine.Int32Add(), load, one); in Instrument()
|
D | machine-operator-reducer.h | 44 Node* Int32Add(Node* lhs, Node* rhs);
|
D | representation-change.cc | 580 return machine()->Int32Add(); in Int32OperatorFor() 631 return machine()->Int32Add(); in Uint32OperatorFor()
|
D | code-assembler.h | 83 V(Int32Add) \
|
D | machine-operator.h | 236 const Operator* Int32Add();
|
D | raw-machine-assembler.h | 240 Node* Int32Add(Node* a, Node* b) { in Int32Add() function 241 return AddNode(machine()->Int32Add(), a, b); in Int32Add()
|
D | opcodes.h | 315 V(Int32Add) \
|
D | memory-optimizer.cc | 382 index = graph()->NewNode(machine()->Int32Add(), index, in ComputeIndex()
|
D | machine-operator.cc | 90 V(Int32Add, Operator::kAssociative | Operator::kCommutative, 2, 0, 1) \
|
/external/v8/src/ |
D | code-stub-assembler.cc | 1490 value = Int32Add(value, Int32Constant(delta)); in IncrementCounter() 1554 return Int32Add(entry_index, in EntryToIndex() 1585 entry = Word32And(Int32Add(entry, count), mask); in NameDictionaryLookup() 1610 count = Int32Add(count, Int32Constant(1)); in NameDictionaryLookup() 1611 entry = Word32And(Int32Add(entry, count), mask); in NameDictionaryLookup() 1629 hash = Int32Add(Word32Xor(hash, Int32Constant(0xffffffff)), in ComputeIntegerHash() 1632 hash = Int32Add(hash, Word32Shl(hash, Int32Constant(2))); in ComputeIntegerHash() 1702 count = Int32Add(count, Int32Constant(1)); in NumberDictionaryLookup() 1703 entry = Word32And(Int32Add(entry, count), mask); in NumberDictionaryLookup() 1758 Node* name_index = Int32Add(name_offset, Int32Mul(index, factor)); in TryLookupProperty() [all …]
|
/external/v8/test/unittests/compiler/ |
D | machine-operator-unittest.cc | 210 PURE(Int32Add, 2, 0, 1), // -- 387 EXPECT_EQ(machine.Int32Add(), machine.IntAdd()); in TEST_F()
|
D | machine-operator-reducer-unittest.cc | 553 graph()->NewNode(machine()->Int32Add(), p0, Int32Constant(k << l)), in TEST_F() 565 machine()->Word32And(), graph()->NewNode(machine()->Int32Add(), s1, p0), in TEST_F() 573 machine()->Word32And(), graph()->NewNode(machine()->Int32Add(), p0, s1), in TEST_F() 620 graph()->NewNode(machine()->Int32Add(), in TEST_F() 633 graph()->NewNode(machine()->Int32Add(), p0, in TEST_F() 906 graph()->NewNode(machine()->Int32Add(), p0, in TEST_F() 1269 machine()->Int32Add(), in TEST_F() 1275 machine()->Int32Add(), p0, in TEST_F()
|
D | loop-peeling-unittest.cc | 139 Node* add = graph()->NewNode(machine()->Int32Add(), phi, inc); in NewCounter() 404 1, graph()->NewNode(machine()->Int32Add(), phi, Int32Constant(1))); in TEST_F() 406 2, graph()->NewNode(machine()->Int32Add(), phi, Int32Constant(2))); in TEST_F()
|
D | branch-elimination-unittest.cc | 146 Node* add = graph()->NewNode(machine()->Int32Add(), phi1, phi2); in TEST_F()
|
/external/v8/src/interpreter/ |
D | interpreter-assembler.cc | 489 new_budget.Bind(Int32Add(old_budget, weight)); in UpdateInterruptBudget() 742 var_index.Bind(Int32Add(index, Int32Constant(1))); in ExportRegisterFile() 778 var_index.Bind(Int32Add(index, Int32Constant(1))); in ImportRegisterFile()
|
/external/v8/test/unittests/compiler/arm64/ |
D | instruction-selector-arm64-unittest.cc | 139 {{&RawMachineAssembler::Int32Add, "Int32Add", kArm64Add32, 174 {&RawMachineAssembler::Int32Add, "Int32Add", kArm64Cmn32, 350 {&RawMachineAssembler::Int32Add, "Int32Add", kArm64Add32, 640 m.Return(m.Int32Add(m.Int32Constant(imm), m.Parameter(0))); in TEST_F() 763 m.Return(m.Int32Add(m.Int32Constant(-imm), m.Parameter(0))); in TEST_F() 805 m.Return((m.Int32Add)( in TEST_F() 848 m.Return(m.Int32Add(m.Word32And(m.Parameter(0), m.Int32Constant(0xff)), in TEST_F() 876 m.Return(m.Int32Add(m.Word32And(m.Parameter(0), m.Int32Constant(0xffff)), in TEST_F() 905 m.Int32Add(m.Word32Sar(m.Word32Shl(m.Parameter(0), m.Int32Constant(24)), in TEST_F() 937 m.Int32Add(m.Word32Sar(m.Word32Shl(m.Parameter(0), m.Int32Constant(16)), in TEST_F() [all …]
|
/external/v8/test/unittests/compiler/arm/ |
D | instruction-selector-arm-unittest.cc | 37 {&RawMachineAssembler::Int32Add, "Int32Add", kArmAdd, kArmAdd, kArmCmn}, 2019 Node* const n = m.Int32Add(p0, m.Int32Mul(p1, p2)); in TEST_F() 2037 Node* const n = m.Int32Add(m.Int32Mul(p1, p2), p0); in TEST_F() 2059 Node* const n = m.Int32Add(p0, m.Int32MulHigh(p1, p2)); in TEST_F() 2077 Node* const n = m.Int32Add(m.Int32MulHigh(p1, p2), p0); in TEST_F() 2098 Node* const r = m.Int32Add(m.Word32And(p0, m.Int32Constant(0xff)), p1); in TEST_F() 2115 Node* const r = m.Int32Add(p1, m.Word32And(p0, m.Int32Constant(0xff))); in TEST_F() 2132 Node* const r = m.Int32Add(m.Word32And(p0, m.Int32Constant(0xffff)), p1); in TEST_F() 2149 Node* const r = m.Int32Add(p1, m.Word32And(p0, m.Int32Constant(0xffff))); in TEST_F() 2170 Node* const r = m.Int32Add( in TEST_F() [all …]
|