Lines Matching refs:nodes
179 /* Allocate bitmap to track nodes that have been visited. */
182 /* None of the nodes in the CFG have been visited yet. */
525 flow_nodes_print (const char *str, const sbitmap nodes, FILE *file)
530 if (! nodes)
534 EXECUTE_IF_SET_IN_SBITMAP (nodes, 0, node, sbi)
623 nodes not reachable from the exit block. */
631 /* Perform depth-first search in the reverse graph to find nodes
636 /* Repeatedly add fake edges, updating the unreachable nodes. */
671 /* Allocate bitmap to track nodes that have been visited. */
674 /* None of the nodes in the CFG have been visited yet. */
725 PRE_ORDER if nonzero, marking the nodes visited in VISITED. If
727 node. Returns the number of nodes visited. A depth first search
760 /* Allocate bitmap to track nodes that have been visited. */
763 /* None of the nodes in the CFG have been visited yet. */
825 /* The number of nodes visited should be the number of blocks. */
829 /* The number of nodes visited should be the number of blocks minus
837 store in the array DFS_ORDER, marking the nodes visited in VISITED.
838 Returns the number of nodes visited.
873 /* Allocate bitmap to track nodes that have been visited. */
876 /* None of the nodes in the CFG have been visited yet. */
894 block at the stack's top and ending when the stack is empty. Visited nodes
1032 dominance frontier of each of the nodes in the walk, except for j's
1037 The number of nodes touched by this algorithm is equal to the size