Home
last modified time | relevance | path

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

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