Searched refs:loop_tree (Results 1 - 7 of 7) sorted by relevance

/external/v8/src/compiler/
H A Dloop-peeling.h32 static bool CanPeel(LoopTree* loop_tree, LoopTree::Loop* loop);
34 LoopTree* loop_tree, LoopTree::Loop* loop,
H A Dloop-peeling.cc164 static void FindLoopExits(LoopTree* loop_tree, LoopTree::Loop* loop, argument
168 for (Node* node : loop_tree->LoopNodes(loop)) {
170 if (!loop_tree->Contains(loop, use)) {
175 loop_tree->Contains(loop,
186 bool LoopPeeler::CanPeel(LoopTree* loop_tree, LoopTree::Loop* loop) { argument
187 Zone zone(loop_tree->zone()->allocator());
190 FindLoopExits(loop_tree, loop, exits, rets);
196 LoopTree* loop_tree, LoopTree::Loop* loop,
203 FindLoopExits(loop_tree, loop, exits, rets);
218 for (Node* node : loop_tree
195 Peel(Graph* graph, CommonOperatorBuilder* common, LoopTree* loop_tree, LoopTree::Loop* loop, Zone* tmp_zone) argument
[all...]
H A Dosr.cc48 LoopTree* loop_tree, LoopTree::Loop* osr_loop,
63 loop->depth(), loop_tree->HeaderNode(loop)->id(),
64 loop_tree->HeaderNode(loop)->op()->mnemonic());
73 for (Node* node : loop_tree->HeaderNodes(outer)) {
122 Node* loop_header = loop_tree->HeaderNode(loop);
126 for (Node* node : loop_tree->HeaderNodes(loop)) {
142 std::max(incoming_depth, loop_tree->ContainingLoop(k)->depth());
228 Node* loop_header = loop_tree->HeaderNode(outer);
283 LoopTree* loop_tree = LoopFinder::BuildLoopTree(graph, tmp_zone); local
286 LoopTree::Loop* loop = loop_tree
46 PeelOuterLoopsForOsr(Graph* graph, CommonOperatorBuilder* common, Zone* tmp_zone, Node* dead, LoopTree* loop_tree, LoopTree::Loop* osr_loop, Node* osr_normal_entry, Node* osr_loop_entry) argument
[all...]
H A Dloop-analysis.cc53 LoopFinderImpl(Graph* graph, LoopTree* loop_tree, Zone* zone) argument
61 loop_tree_(loop_tree),
451 LoopTree* loop_tree = local
453 LoopFinderImpl finder(graph, loop_tree, zone);
458 return loop_tree;
H A Dpipeline.cc1112 LoopTree* loop_tree = LoopFinder::BuildLoopTree(data->graph(), temp_zone); local
1113 if (loop_tree != nullptr && loop_tree->outer_loops().size() > 0) {
1114 LoopPeeler::Peel(data->graph(), data->common(), loop_tree,
1115 loop_tree->outer_loops()[0], temp_zone);
/external/v8/test/unittests/compiler/
H A Dloop-peeling-unittest.cc73 LoopTree* loop_tree = GetLoopTree(); local
74 LoopTree::Loop* loop = loop_tree->outer_loops()[0];
75 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
76 return Peel(loop_tree, loop);
79 PeeledIteration* Peel(LoopTree* loop_tree, LoopTree::Loop* loop) { argument
80 EXPECT_TRUE(LoopPeeler::CanPeel(loop_tree, loop));
82 LoopPeeler::Peel(graph(), common(), loop_tree, loop, zone());
241 LoopTree* loop_tree = GetLoopTree(); local
242 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop);
246 PeeledIteration* peeled = Peel(loop_tree, loo
278 LoopTree* loop_tree = GetLoopTree(); local
465 LoopTree* loop_tree = GetLoopTree(); local
491 LoopTree* loop_tree = GetLoopTree(); local
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-loop-analysis.cc50 loop_tree(NULL) {
72 LoopTree* loop_tree; member in class:v8::internal::compiler::LoopFinderTester
125 if (loop_tree == NULL) {
131 loop_tree = LoopFinder::BuildLoopTree(&graph, &zone);
133 return loop_tree;

Completed in 380 milliseconds