Home
last modified time | relevance | path

Searched refs:ReplaceInput (Results 1 – 25 of 40) sorted by relevance

12

/external/v8/src/compiler/
Dmachine-operator-reducer.cc181 node->ReplaceInput(0, msub.left().node()); in Reduce()
182 node->ReplaceInput(1, msub.right().node()); in Reduce()
196 node->ReplaceInput(0, msub.left().node()); in Reduce()
197 node->ReplaceInput(1, msub.right().node()); in Reduce()
216 node->ReplaceInput(0, Int32Constant(0)); in Reduce()
217 node->ReplaceInput(1, m.left().node()); in Reduce()
222 node->ReplaceInput(1, Int32Constant(WhichPowerOf2(m.right().Value()))); in Reduce()
244 node->ReplaceInput(0, msub.left().node()); in Reduce()
245 node->ReplaceInput(1, msub.right().node()); in Reduce()
250 node->ReplaceInput(0, msub.right().node()); in Reduce()
[all …]
Ddiamond.h36 void Chain(Diamond& that) { branch->ReplaceInput(1, that.merge); } in Chain()
39 void Chain(Node* that) { branch->ReplaceInput(1, that); } in Chain()
44 branch->ReplaceInput(1, that.if_true); in Nest()
45 that.merge->ReplaceInput(0, merge); in Nest()
47 branch->ReplaceInput(1, that.if_false); in Nest()
48 that.merge->ReplaceInput(1, merge); in Nest()
Ddead-code-elimination.cc49 if (i != live_input_count) node->ReplaceInput(live_input_count, input); in ReduceEnd()
81 node->ReplaceInput(live_input_count, input); in ReduceLoopOrMerge()
85 use->ReplaceInput(live_input_count, use->InputAt(i)); in ReduceLoopOrMerge()
113 use->ReplaceInput(live_input_count, node); in ReduceLoopOrMerge()
Dselect-lowering.cc55 node->ReplaceInput(0, vthen); in Reduce()
56 node->ReplaceInput(1, velse); in Reduce()
57 node->ReplaceInput(2, merge); in Reduce()
Dloop-peeling.cc137 copy->ReplaceInput(i, map(original->InputAt(i))); in CopyNodes()
253 node->ReplaceInput(0, phi); in Peel()
263 node->ReplaceInput(0, peeling.map(node->InputAt(0))); in Peel()
267 loop_node->ReplaceInput(0, new_entry); in Peel()
286 merge->ReplaceInput(0, postdom); // input 0 overwritten by above line. in Peel()
Dnode-properties.cc137 node->ReplaceInput(FirstValueIndex(node) + index, value); in ReplaceValueInput()
145 node->ReplaceInput(0, value); in ReplaceValueInputs()
154 node->ReplaceInput(FirstContextIndex(node), context); in ReplaceContextInput()
160 node->ReplaceInput(FirstControlIndex(node), control); in ReplaceControlInput()
167 return node->ReplaceInput(FirstEffectIndex(node) + index, effect); in ReplaceEffectInput()
175 node->ReplaceInput(FirstFrameStateIndex(node) + index, frame_state); in ReplaceFrameStateInput()
Dtail-call-optimization.cc66 node->ReplaceInput(0, NodeProperties::GetEffectInput(call)); in Reduce()
67 node->ReplaceInput(1, NodeProperties::GetControlInput(call)); in Reduce()
Djs-typed-lowering.cc76 node->ReplaceInput(0, allocation_); in FinishAndChange()
77 node->ReplaceInput(1, effect_); in FinishAndChange()
140 node_->ReplaceInput(0, left_input); in ConvertInputsToNumber()
141 node_->ReplaceInput(1, right_input); in ConvertInputsToNumber()
146 node_->ReplaceInput(0, ConvertToUI32(left(), left_signedness)); in ConvertInputsToUI32()
147 node_->ReplaceInput(1, ConvertToUI32(right(), right_signedness)); in ConvertInputsToUI32()
153 node_->ReplaceInput(0, r); in SwapInputs()
154 node_->ReplaceInput(1, l); in SwapInputs()
185 value->ReplaceInput(0, node_); in ChangeToPureOperator()
200 node_->ReplaceInput(2, effect); in ChangeToStringComparisonOperator()
[all …]
Dcontrol-flow-optimizer.cc246 if_true->ReplaceInput(0, node); in TryBuildSwitch()
264 node->ReplaceInput(0, index); in TryBuildSwitch()
266 if_true->ReplaceInput(0, node); in TryBuildSwitch()
269 if_false->ReplaceInput(0, node); in TryBuildSwitch()
Djs-context-specialization.cc62 node->ReplaceInput(0, jsgraph_->Constant(context)); in ReduceJSLoadContext()
104 node->ReplaceInput(0, jsgraph_->Constant(context)); in ReduceJSStoreContext()
Djs-intrinsic-lowering.cc625 node->ReplaceInput(0, a); in Change()
626 node->ReplaceInput(1, b); in Change()
636 node->ReplaceInput(0, a); in Change()
637 node->ReplaceInput(1, b); in Change()
638 node->ReplaceInput(2, c); in Change()
648 node->ReplaceInput(0, a); in Change()
649 node->ReplaceInput(1, b); in Change()
650 node->ReplaceInput(2, c); in Change()
651 node->ReplaceInput(3, d); in Change()
Djs-generic-lowering.cc55 node->ReplaceInput(0, test); in Reduce()
204 node->ReplaceInput(0, booleanize); in ReplaceWithCompareIC()
205 node->ReplaceInput(1, true_value); in ReplaceWithCompareIC()
206 node->ReplaceInput(2, false_value); in ReplaceWithCompareIC()
401 node->ReplaceInput( in LowerJSLoadContext()
409 node->ReplaceInput(1, jsgraph()->Int32Constant(Context::SlotOffset( in LowerJSLoadContext()
419 node->ReplaceInput( in LowerJSStoreContext()
427 node->ReplaceInput(2, NodeProperties::GetValueInput(node, 1)); in LowerJSStoreContext()
428 node->ReplaceInput(1, jsgraph()->Int32Constant(Context::SlotOffset( in LowerJSStoreContext()
447 projection->ReplaceInput(0, node); in LowerJSLoadDynamic()
[all …]
Dosr.cc114 copy->ReplaceInput(j, mapping->at(orig->InputAt(j)->id())); in PeelOuterLoopsForOsr()
173 copy->ReplaceInput(0, input); in PeelOuterLoopsForOsr()
195 copy->ReplaceInput(0, merge); in PeelOuterLoopsForOsr()
204 copy->ReplaceInput(0, phi); in PeelOuterLoopsForOsr()
Dcommon-operator-reducer.cc102 node->ReplaceInput(0, cond->InputAt(0)); in ReduceBranch()
377 node->ReplaceInput(0, a); in Change()
386 node->ReplaceInput(0, a); in Change()
387 node->ReplaceInput(1, b); in Change()
Dsimplified-lowering.cc557 node->ReplaceInput(index, n); in ConvertInput()
1097 node->ReplaceInput(0, in VisitNode()
1563 node->ReplaceInput(0, vtrue); in DoLoadBuffer()
1564 node->ReplaceInput(1, vfalse); in DoLoadBuffer()
1565 node->ReplaceInput(2, merge); in DoLoadBuffer()
1602 node->ReplaceInput(0, vtrue); in DoObjectIsNumber()
1610 node->ReplaceInput(0, in DoObjectIsSmi()
1889 node->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rhs, in DoShift()
1916 node->ReplaceInput(0, comparison); in DoStringEqual()
1917 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); in DoStringEqual()
[all …]
Dnode.cc190 ReplaceInput(i, InputAt(i - 1)); in InsertInput()
192 ReplaceInput(index, new_to); in InsertInput()
201 ReplaceInput(index, InputAt(index + 1)); in RemoveInput()
Djs-call-reducer.cc112 node->ReplaceInput(0, node->InputAt(1)); in ReduceFunctionPrototypeApply()
113 node->ReplaceInput(1, jsgraph()->UndefinedConstant()); in ReduceFunctionPrototypeApply()
198 node->ReplaceInput(0, node->InputAt(1)); in ReduceFunctionPrototypeCall()
199 node->ReplaceInput(1, jsgraph()->UndefinedConstant()); in ReduceFunctionPrototypeCall()
/external/v8/test/cctest/compiler/
Dtest-osr.cc199 loop->ReplaceInput(2, if_true); in TEST()
231 loop->ReplaceInput(2, if_true2); in TEST()
269 loop->ReplaceInput(2, if_false1); in TEST()
270 loop->ReplaceInput(3, if_true2); in TEST()
308 loop->ReplaceInput(loop->InputCount() - 1, if_true); in While()
312 that.loop->ReplaceInput(that.loop->InputCount() - 1, exit); in Nest()
313 this->loop->ReplaceInput(0, that.if_true); in Nest()
345 outer.branch->ReplaceInput(0, outer_phi); in TEST()
349 inner.branch->ReplaceInput(0, osr_phi); in TEST()
350 outer_phi->ReplaceInput(1, osr_phi); in TEST()
[all …]
Dtest-loop-analysis.cc108 if (edge.to() == self) node->ReplaceInput(edge.index(), node); in SetSelfReferences()
120 end->ReplaceInput(0, ret); in Return()
198 loop->ReplaceInput(1, if_true); in While()
201 void chain(Node* control) { loop->ReplaceInput(0, control); } in chain()
203 that.loop->ReplaceInput(1, exit); in nest()
204 this->loop->ReplaceInput(0, that.if_true); in nest()
225 phi->ReplaceInput(1, add); in Build()
246 phi->ReplaceInput(1, store); in Build()
400 if (i & 3) w2.branch->ReplaceInput(0, c1.phi); in TEST()
454 w2.branch->ReplaceInput(0, c2.phi); in TEST()
[all …]
Dtest-graph-visualizer.cc38 phi->ReplaceInput(0, NULL); in TEST()
57 phi->ReplaceInput(1, NULL); in TEST()
76 phi->ReplaceInput(0, NULL); in TEST()
93 merge->ReplaceInput(1, NULL); in TEST()
Dtest-node.cc177 n1->ReplaceInput(0, n1); // Create self-reference. in TEST()
192 TEST(ReplaceInput) { in TEST() argument
209 n3->ReplaceInput(1, n4); in TEST()
254 n2->ReplaceInput(0, n3); in TEST()
383 n2->ReplaceInput(0, nullptr); in TEST()
389 n2->ReplaceInput(1, nullptr); in TEST()
413 n3->ReplaceInput(1, NULL); in TEST()
455 n2->ReplaceInput(0, n1); in TEST()
460 n3->ReplaceInput(0, n1); in TEST()
733 n1->ReplaceInput(0, n1); // self-reference. in TEST()
Dtest-basic-block-profiler.cc89 count->ReplaceInput(1, m.Int32Sub(count, one)); in TEST()
/external/v8/test/unittests/compiler/
Dloop-peeling-unittest.cc112 loop->ReplaceInput(1, if_true); in NewWhile()
116 void Chain(While* a, Node* control) { a->loop->ReplaceInput(0, control); } in Chain()
118 b->loop->ReplaceInput(1, a->exit); in Nest()
119 a->loop->ReplaceInput(0, b->if_true); in Nest()
140 phi->ReplaceInput(1, add); in NewCounter()
318 loop->ReplaceInput(1, b2.if_true); in TEST_F()
319 loop->ReplaceInput(2, b2.if_false); in TEST_F()
355 loop->ReplaceInput(1, b2.if_true); in TEST_F()
356 loop->ReplaceInput(2, b2.if_false); in TEST_F()
403 phi->ReplaceInput( in TEST_F()
[all …]
Dcontrol-equivalence-unittest.cc208 l->ReplaceInput(1, l); in TEST_F()
222 l->ReplaceInput(1, t); in TEST_F()
245 lp->ReplaceInput(1, f3); in TEST_F()
Dscheduler-unittest.cc827 loop->ReplaceInput(1, t1); // close loop. in TARGET_TEST_F()
828 ind->ReplaceInput(1, ind); // close induction variable. in TARGET_TEST_F()
866 loop->ReplaceInput(1, t); // close loop. in TARGET_TEST_F()
867 ind->ReplaceInput(1, phi1); // close induction variable. in TARGET_TEST_F()
902 loop->ReplaceInput(1, t); // close loop. in TARGET_TEST_F()
903 ind->ReplaceInput(1, add); // close induction variable. in TARGET_TEST_F()
938 loop1->ReplaceInput(1, t2); // close inner loop. in TARGET_TEST_F()
939 ind1->ReplaceInput(1, ind1); // close inner induction variable. in TARGET_TEST_F()
951 loop->ReplaceInput(1, t); // close loop. in TARGET_TEST_F()
952 ind->ReplaceInput(1, add); // close induction variable. in TARGET_TEST_F()
[all …]

12