Searched refs:ContainingLoop (Results 1 – 5 of 5) sorted by relevance
65 Loop* ContainingLoop(Node* node) { in ContainingLoop() function74 for (Loop* c = ContainingLoop(node); c != nullptr; c = c->parent_) { in Contains()
142 std::max(incoming_depth, loop_tree->ContainingLoop(k)->depth()); in PeelOuterLoopsForOsr()286 LoopTree::Loop* loop = loop_tree->ContainingLoop(osr_loop); in Deconstruct()
1038 LoopData *ContainingLoop = Working[Index].getContainingLoop();1039 if (ContainingLoop)1040 ContainingLoop->Nodes.push_back(Index);
138 LoopTree::Loop* loop = tree->ContainingLoop(header[0]); in CheckLoop()144 CHECK_EQ(loop, tree->ContainingLoop(header[i])); in CheckLoop()166 LoopTree::Loop* loop = tree->ContainingLoop(header); in CheckNestedLoops()170 i == 0 ? NULL : tree->ContainingLoop(chain[i - 1]); in CheckNestedLoops()175 LoopTree::Loop* outer = tree->ContainingLoop(outer_header); in CheckNestedLoops()
242 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); in TEST_F()279 LoopTree::Loop* loop = loop_tree->ContainingLoop(inner.loop); in TEST_F()