Searched refs:GetInnerloopNode (Results 1 – 4 of 4) sorted by relevance
216 auto* node = tree.root()->GetInnerloopNode(0); in TEST()241 auto* node1 = tree.root()->GetInnerloopNode(0); in TEST()245 auto* node2 = tree.root()->GetInnerloopNode(1); in TEST()269 auto* node1 = tree.root()->GetInnerloopNode(0); in TEST()273 auto* node2 = node1->GetInnerloopNode(0); in TEST()308 auto* loop_node = root->GetInnerloopNode(0); in TEST()355 auto* outerloop_node = root->GetInnerloopNode(0); in TEST()359 auto* innerloop_node = outerloop_node->GetInnerloopNode(0); in TEST()412 auto* outerloop_node = root->GetInnerloopNode(0); in TEST()416 auto* innerloop_node1 = outerloop_node->GetInnerloopNode(0); in TEST()[all …]
183 auto* innerloop_node = node->GetInnerloopNode(i); in TryInsertLoopAtNode()
297 OptimizeLoopTree(machine_ir, node->GetInnerloopNode(i), predicate); in OptimizeLoopTree()
36 LoopTreeNode* GetInnerloopNode(size_t i) const { return innerloop_nodes_.at(i); } in GetInnerloopNode() function