Home
last modified time | relevance | path

Searched refs:SetEnd (Results 1 – 25 of 28) sorted by relevance

12

/external/v8/test/unittests/compiler/
Djs-type-feedback-unittest.cc111 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
128 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
154 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
172 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
197 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
214 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
240 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
257 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
291 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
309 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
Dgraph-trimmer-unittest.cc47 graph()->SetEnd(end); in TEST_F()
57 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
67 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
78 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
Dgraph-reducer-unittest.cc497 graph()->SetEnd(end); in TEST_F()
511 graph()->SetEnd(end); in TEST_F()
524 graph()->SetEnd(end); in TEST_F()
544 graph()->SetEnd(end); in TEST_F()
569 graph()->SetEnd(end); in TEST_F()
600 graph()->SetEnd(end); in TEST_F()
618 graph()->SetEnd(end); in TEST_F()
642 graph()->SetEnd(end); in TEST_F()
662 graph()->SetEnd(end); in TEST_F()
689 graph()->SetEnd(end); in TEST_F()
[all …]
Dbranch-elimination-unittest.cc70 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
111 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
149 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
198 graph()->SetEnd(graph()->NewNode(common()->End(3), ret1, ret2, terminate)); in TEST_F()
Dscheduler-unittest.cc636 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
648 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
680 graph()->SetEnd(end); in TARGET_TEST_F()
698 graph()->SetEnd(end); in TARGET_TEST_F()
717 graph()->SetEnd(end); in TARGET_TEST_F()
755 graph()->SetEnd(end); in TARGET_TEST_F()
801 graph()->SetEnd(end); in TARGET_TEST_F()
837 graph()->SetEnd(end); in TARGET_TEST_F()
872 graph()->SetEnd(end); in TARGET_TEST_F()
908 graph()->SetEnd(end); in TARGET_TEST_F()
[all …]
Dcontrol-flow-optimizer-unittest.cc57 graph()->SetEnd(graph()->NewNode(common()->End(1), merge)); in TEST_F()
88 graph()->SetEnd(graph()->NewNode(common()->End(1), merge)); in TEST_F()
114 graph()->SetEnd(graph()->NewNode(common()->End(1), merge)); in TEST_F()
Dtail-call-optimization-unittest.cc70 graph()->SetEnd(end); in TEST_F()
142 graph()->SetEnd(end); in TEST_F()
Dgraph-unittest.cc18 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in GraphTest()
Dcontrol-equivalence-unittest.cc31 graph()->SetEnd(graph()->NewNode(common()->End(1), node)); in ComputeEquivalence()
Dloop-peeling-unittest.cc92 graph()->SetEnd(r); in InsertReturn()
Dcommon-operator-reducer-unittest.cc451 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
/external/v8/test/cctest/compiler/
Dtest-graph-visualizer.cc39 graph.SetEnd(phi); in TEST()
58 graph.SetEnd(phi); in TEST()
77 graph.SetEnd(start); in TEST()
94 graph.SetEnd(merge); in TEST()
121 graph.SetEnd(end); in TEST()
Dtest-osr.cc138 T.graph.SetEnd(loop); in TEST()
154 T.graph.SetEnd(ret); in TEST()
174 T.graph.SetEnd(ret); in TEST()
205 T.graph.SetEnd(ret); in TEST()
238 T.graph.SetEnd(ret); in TEST()
277 T.graph.SetEnd(ret); in TEST()
355 T.graph.SetEnd(end); in TEST()
422 T.graph.SetEnd(end); in TEST()
529 T.graph.SetEnd(end); in TEST()
Dtest-changes-lowering.cc93 this->graph()->SetEnd(end); in BuildAndLower()
109 this->graph()->SetEnd(end); in BuildStoreAndLower()
124 this->graph()->SetEnd(end); in BuildLoadAndLower()
Dtest-run-stubs.cc51 graph.SetEnd(end); in TEST()
Dtest-loop-analysis.cc51 graph.SetEnd(end); in LoopFinderTester()
635 t.graph.SetEnd(end); in TEST()
672 t.graph.SetEnd(exit); in TEST()
700 t.graph.SetEnd(ret); in TEST()
747 t.graph.SetEnd(ret); in RunEdgeMatrix2()
834 t.graph.SetEnd(ret); in RunEdgeMatrix3()
947 t.graph.SetEnd(ret); in RunManyChainedLoops_i()
985 t.graph.SetEnd(ret); in RunManyNestedLoops_i()
Dtest-js-context-specialization.cc236 t.graph()->SetEnd(end); in TEST()
Dgraph-builder-tester.h95 graph()->SetEnd(end); in End()
Dtest-js-constant-cache.cc43 main_graph_.SetEnd( in JSConstantCacheTester()
Dtest-run-native-calls.cc299 b.graph()->SetEnd(ret); in WrapWithCFunction()
536 b.graph()->SetEnd(ret); in TestInt32Sub()
Dtest-js-typed-lowering.cc48 graph.SetEnd(graph.NewNode(common.End(1), graph.start())); in JSTypedLoweringTester()
/external/v8/src/compiler/
Dgraph.h95 void SetEnd(Node* end) { end_ = end; } in SetEnd() function
Dgraph-reducer.cc172 if (node == graph()->end()) graph()->SetEnd(replacement); in Replace()
Draw-machine-assembler.cc35 graph->SetEnd(graph->NewNode(common_.End(0))); in RawMachineAssembler()
Dbytecode-graph-builder.cc502 graph()->SetEnd(end); in CreateGraph()

12