Lines Matching defs:subloop_node
309 ira_loop_tree_node_t subloop_node;
314 for (subloop_node = loop_node->subloops;
315 subloop_node != NULL;
316 subloop_node = subloop_node->subloop_next)
318 ira_assert (subloop_node->bb == NULL);
319 height = setup_loop_tree_level (subloop_node, level + 1);
1697 ira_loop_tree_node_t subloop_node;
1706 FOR_EACH_VEC_ELT (loop_preorder, i, subloop_node)
1708 gcc_checking_assert (! (subloop_node->bb->flags & BB_TO_VISIT));
1709 subloop_node->bb->flags |= BB_TO_VISIT;
1715 FOR_EACH_VEC_ELT_REVERSE (loop_preorder, i, subloop_node)
1717 if (! (subloop_node->bb->flags & BB_TO_VISIT))
1720 subloop_node->bb->flags &= ~BB_TO_VISIT;
1721 dfs_stack.quick_push (subloop_node);
1783 ira_loop_tree_node_t subloop_node;
1800 for (subloop_node = loop_node->children;
1801 subloop_node != NULL;
1802 subloop_node = subloop_node->next)
1803 if (subloop_node->bb != NULL)
1804 loop_preorder.safe_push (subloop_node);
1807 FOR_EACH_VEC_ELT (loop_preorder, i, subloop_node)
1808 (*preorder_func) (subloop_node);
1814 FOR_EACH_VEC_ELT_REVERSE (loop_rev_postorder, i, subloop_node)
1815 (*postorder_func) (subloop_node);
1820 for (subloop_node = loop_node->subloops;
1821 subloop_node != NULL;
1822 subloop_node = subloop_node->subloop_next)
1824 ira_assert (subloop_node->bb == NULL);
1825 ira_traverse_loop_tree (bb_p, subloop_node,