Home
last modified time | relevance | path

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

/external/v8/test/cctest/compiler/
Dtest-graph-reducer.cc203 graph.SetEnd(end); in TEST()
221 graph.SetEnd(end); in TEST()
239 graph.SetEnd(end); in TEST()
264 graph.SetEnd(end); in TEST()
294 graph.SetEnd(end); in TEST()
330 graph.SetEnd(end); in TEST()
352 graph.SetEnd(end); in TEST()
380 graph.SetEnd(end); in TEST()
404 graph.SetEnd(end); in TEST()
435 graph.SetEnd(end); in TEST()
[all …]
Dtest-node-algorithm.cc62 graph.SetEnd(n5); in TEST()
82 graph.SetEnd(n5); in TEST()
105 graph.SetEnd(n8); in TEST()
136 graph.SetEnd(n12); in TEST()
164 graph.SetEnd(n2); in TEST()
226 graph.SetEnd(n5); in TEST()
326 graph.SetEnd(n12); in TEST()
Dtest-changes-lowering.cc111 this->graph()->SetEnd(end); in BuildAndLower()
127 this->graph()->SetEnd(end); in BuildStoreAndLower()
142 this->graph()->SetEnd(end); in BuildLoadAndLower()
Dsimplified-graph-builder.cc42 graph()->SetEnd(end); in End()
Dtest-scheduler.cc625 graph.SetEnd(graph.NewNode(builder.End(), graph.start())); in TEST()
640 graph.SetEnd(graph.NewNode(builder.End(), ret)); in TEST()
667 graph.SetEnd(graph.NewNode(builder.End(), merge)); in TEST()
812 graph.SetEnd(n23); in TEST()
924 graph.SetEnd(n20); in TEST()
1171 graph.SetEnd(n46); in TEST()
1500 graph.SetEnd(n58); in TEST()
1624 graph.SetEnd(n22); in TEST()
1661 graph.SetEnd(end); in TEST()
1684 graph.SetEnd(end); in TEST()
[all …]
Dtest-js-context-specialization.cc229 t.graph()->SetEnd(end); in TEST()
Dtest-simplified-lowering.cc659 graph()->SetEnd(end); in TestingGraph()
/external/v8/src/compiler/
Dgeneric-graph.h41 void SetEnd(V* end) { end_ = end; } in SetEnd() function
Dgraph-reducer.cc48 if (node == graph_->end()) graph_->SetEnd(replacement); in ReduceNode()
Dschedule.h165 SetEnd(NewBasicBlock()); // exit. in Schedule()
Dast-graph-builder.cc110 graph()->SetEnd(NewNode(common()->End())); in CreateGraph()