contrib/gcc/dominance.c

54    artificial ENTRY_BLOCK (or EXIT_BLOCK in the post-dom case) in our lists to
80   /* After the algorithm is done, dom[x] contains the immediate dominator
82   TBB *dom;
156   init_ar (di->dom, TBB, num, 0);
184   free (di->dom);
326       /* In the post-dom case we may have nodes without a path to EXIT_BLOCK.
327          They are reverse-unreachable.  In the dom-case we disallow such
328          nodes, but in post-dom we have to deal with them.
471    On return the immediate dominator to node V is in di->dom[V].  */
550 	    di->dom[w] = k;
552 	    di->dom[w] = par;
560   di->dom[1] = 0;
562     if (di->dom[v] != di->key[v])
563       di->dom[v] = di->dom[di->dom[v]];
601       if (!bb->dom[dir]->father)
602 	assign_dfs_numbers (bb->dom[dir], &num);
627 	  b->dom[dir] = et_new_tree (b);
637 	  TBB d = di.dom[di.dfs_order[b->index]];
640 	    et_set_father (b->dom[dir], di.dfs_to_bb[d]->dom[dir]);
663       et_free_tree_force (bb->dom[dir]);
664       bb->dom[dir] = NULL;
677   struct et_node *node = bb->dom[dir];
693   struct et_node *node = bb->dom[dir];
705     et_set_father (node, dominated_by->dom[dir]);
717   struct et_node *node = bb->dom[dir], *son = node->son, *ason;
748   basic_block dom;
753     for (dom = first_dom_son (dir, region[i]);
754 	 dom;
755 	 dom = next_dom_son (dir, dom))
756       if (!(dom->flags & BB_DUPLICATED))
757 	doms[n_doms++] = dom;
769   struct et_node *bb_node = bb->dom[dir], *to_node = to->dom[dir], *son;
799   return et_nca (bb1->dom[dir], bb2->dom[dir])->data;
811   basic_block dom;
814   dom = BASIC_BLOCK (first);
816     if (dom != BASIC_BLOCK (i))
817       dom = nearest_common_dominator (dir, dom, BASIC_BLOCK (i));
819   return dom;
901   struct et_node *n1 = bb1->dom[dir], *n2 = bb2->dom[dir];
917   struct et_node *n = bb->dom[dir];
928   struct et_node *n = bb->dom[dir];
1051   gcc_assert (!bb->dom[dir]);
1055   bb->dom[dir] = et_new_tree (bb);
1066   et_free_tree (bb->dom[dir]);
1067   bb->dom[dir] = NULL;
1080   struct et_node *son = bb->dom[dir]->son;
1091   struct et_node *next = bb->dom[dir]->right;