Lines Matching refs:nodes
51 /* We name our nodes with integers, beginning with 1. Zero is reserved for
70 exists a way to x only over nodes behind x. Such a node is also called
76 /* bucket[x] points to the first node of the set of nodes having x as key. */
101 more nodes that basic blocks, so only dfs_to_bb[dfs_order[bb->index]]==bb
107 /* The number of nodes in the DFS tree (==dfsnum-1). */
108 unsigned int nodes;
169 di->nodes = 0;
198 node. After this is done all nodes reachable from BB were visited, have
311 because there may be nodes from which the EXIT_BLOCK is unreachable. */
326 /* In the post-dom case we may have nodes without a path to EXIT_BLOCK.
328 nodes, but in post-dom we have to deal with them.
371 di->nodes = di->dfsnum - 1;
374 gcc_assert (di->nodes == (unsigned int) n_basic_blocks - 1);
486 v = di->nodes;
510 us only over nodes behind us. In effect we search for our
561 for (v = 2; v <= di->nodes; v++)
829 nodes in the subtree of the dominator tree rooted at that node
833 only three possible relations two nodes in the dominator tree have