1 /* Calculate (post)dominators in slightly super-linear time.
2 Copyright (C) 2000, 2003, 2004, 2005 Free Software Foundation, Inc.
3 Contributed by Michael Matz (matz@ifh.de).
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
22 /* This file implements the well known algorithm from Lengauer and Tarjan
23 to compute the dominators in a control flow graph. A basic block D is said
24 to dominate another block X, when all paths from the entry node of the CFG
25 to X go also over D. The dominance relation is a transitive reflexive
26 relation and its minimal transitive reduction is a tree, called the
27 dominator tree. So for each block X besides the entry block exists a
28 block I(X), called the immediate dominator of X, which is the parent of X
29 in the dominator tree.
31 The algorithm computes this dominator tree implicitly by computing for
32 each block its immediate dominator. We use tree balancing and path
33 compression, so it's the O(e*a(e,v)) variant, where a(e,v) is the very
34 slowly growing functional inverse of the Ackerman function. */
38 #include "coretypes.h"
41 #include "hard-reg-set.h"
43 #include "basic-block.h"
45 #include "et-forest.h"
47 /* Whether the dominators and the postdominators are available. */
48 enum dom_state dom_computed
[2];
50 /* We name our nodes with integers, beginning with 1. Zero is reserved for
51 'undefined' or 'end of list'. The name of each node is given by the dfs
52 number of the corresponding basic block. Please note, that we include the
53 artificial ENTRY_BLOCK (or EXIT_BLOCK in the post-dom case) in our lists to
54 support multiple entry points. Its dfs number is of course 1. */
56 /* Type of Basic Block aka. TBB */
57 typedef unsigned int TBB
;
59 /* We work in a poor-mans object oriented fashion, and carry an instance of
60 this structure through all our 'methods'. It holds various arrays
61 reflecting the (sub)structure of the flowgraph. Most of them are of type
62 TBB and are also indexed by TBB. */
66 /* The parent of a node in the DFS tree. */
68 /* For a node x key[x] is roughly the node nearest to the root from which
69 exists a way to x only over nodes behind x. Such a node is also called
72 /* The value in path_min[x] is the node y on the path from x to the root of
73 the tree x is in with the smallest key[y]. */
75 /* bucket[x] points to the first node of the set of nodes having x as key. */
77 /* And next_bucket[x] points to the next node. */
79 /* After the algorithm is done, dom[x] contains the immediate dominator
83 /* The following few fields implement the structures needed for disjoint
85 /* set_chain[x] is the next node on the path from x to the representant
86 of the set containing x. If set_chain[x]==0 then x is a root. */
88 /* set_size[x] is the number of elements in the set named by x. */
89 unsigned int *set_size
;
90 /* set_child[x] is used for balancing the tree representing a set. It can
91 be understood as the next sibling of x. */
94 /* If b is the number of a basic block (BB->index), dfs_order[b] is the
95 number of that node in DFS order counted from 1. This is an index
96 into most of the other arrays in this structure. */
98 /* If x is the DFS-index of a node which corresponds with a basic block,
99 dfs_to_bb[x] is that basic block. Note, that in our structure there are
100 more nodes that basic blocks, so only dfs_to_bb[dfs_order[bb->index]]==bb
101 is true for every basic block bb, but not the opposite. */
102 basic_block
*dfs_to_bb
;
104 /* This is the next free DFS number when creating the DFS tree. */
106 /* The number of nodes in the DFS tree (==dfsnum-1). */
109 /* Blocks with bits set here have a fake edge to EXIT. These are used
110 to turn a DFS forest into a proper tree. */
111 bitmap fake_exit_edge
;
114 static void init_dom_info (struct dom_info
*, enum cdi_direction
);
115 static void free_dom_info (struct dom_info
*);
116 static void calc_dfs_tree_nonrec (struct dom_info
*, basic_block
,
118 static void calc_dfs_tree (struct dom_info
*, enum cdi_direction
);
119 static void compress (struct dom_info
*, TBB
);
120 static TBB
eval (struct dom_info
*, TBB
);
121 static void link_roots (struct dom_info
*, TBB
, TBB
);
122 static void calc_idoms (struct dom_info
*, enum cdi_direction
);
123 void debug_dominance_info (enum cdi_direction
);
125 /* Keeps track of the*/
126 static unsigned n_bbs_in_dom_tree
[2];
128 /* Helper macro for allocating and initializing an array,
129 for aesthetic reasons. */
130 #define init_ar(var, type, num, content) \
133 unsigned int i = 1; /* Catch content == i. */ \
135 (var) = xcalloc ((num), sizeof (type)); \
138 (var) = xmalloc ((num) * sizeof (type)); \
139 for (i = 0; i < num; i++) \
140 (var)[i] = (content); \
145 /* Allocate all needed memory in a pessimistic fashion (so we round up).
146 This initializes the contents of DI, which already must be allocated. */
149 init_dom_info (struct dom_info
*di
, enum cdi_direction dir
)
151 unsigned int num
= n_basic_blocks
;
152 init_ar (di
->dfs_parent
, TBB
, num
, 0);
153 init_ar (di
->path_min
, TBB
, num
, i
);
154 init_ar (di
->key
, TBB
, num
, i
);
155 init_ar (di
->dom
, TBB
, num
, 0);
157 init_ar (di
->bucket
, TBB
, num
, 0);
158 init_ar (di
->next_bucket
, TBB
, num
, 0);
160 init_ar (di
->set_chain
, TBB
, num
, 0);
161 init_ar (di
->set_size
, unsigned int, num
, 1);
162 init_ar (di
->set_child
, TBB
, num
, 0);
164 init_ar (di
->dfs_order
, TBB
, (unsigned int) last_basic_block
+ 1, 0);
165 init_ar (di
->dfs_to_bb
, basic_block
, num
, 0);
170 di
->fake_exit_edge
= dir
? BITMAP_ALLOC (NULL
) : NULL
;
175 /* Free all allocated memory in DI, but not DI itself. */
178 free_dom_info (struct dom_info
*di
)
180 free (di
->dfs_parent
);
185 free (di
->next_bucket
);
186 free (di
->set_chain
);
188 free (di
->set_child
);
189 free (di
->dfs_order
);
190 free (di
->dfs_to_bb
);
191 BITMAP_FREE (di
->fake_exit_edge
);
194 /* The nonrecursive variant of creating a DFS tree. DI is our working
195 structure, BB the starting basic block for this tree and REVERSE
196 is true, if predecessors should be visited instead of successors of a
197 node. After this is done all nodes reachable from BB were visited, have
198 assigned their dfs number and are linked together to form a tree. */
201 calc_dfs_tree_nonrec (struct dom_info
*di
, basic_block bb
,
202 enum cdi_direction reverse
)
204 /* We call this _only_ if bb is not already visited. */
206 TBB child_i
, my_i
= 0;
207 edge_iterator
*stack
;
208 edge_iterator ei
, einext
;
210 /* Start block (ENTRY_BLOCK_PTR for forward problem, EXIT_BLOCK for backward
212 basic_block en_block
;
214 basic_block ex_block
;
216 stack
= xmalloc ((n_basic_blocks
+ 1) * sizeof (edge_iterator
));
219 /* Initialize our border blocks, and the first edge. */
222 ei
= ei_start (bb
->preds
);
223 en_block
= EXIT_BLOCK_PTR
;
224 ex_block
= ENTRY_BLOCK_PTR
;
228 ei
= ei_start (bb
->succs
);
229 en_block
= ENTRY_BLOCK_PTR
;
230 ex_block
= EXIT_BLOCK_PTR
;
233 /* When the stack is empty we break out of this loop. */
238 /* This loop traverses edges e in depth first manner, and fills the
240 while (!ei_end_p (ei
))
244 /* Deduce from E the current and the next block (BB and BN), and the
250 /* If the next node BN is either already visited or a border
251 block the current edge is useless, and simply overwritten
252 with the next edge out of the current node. */
253 if (bn
== ex_block
|| di
->dfs_order
[bn
->index
])
259 einext
= ei_start (bn
->preds
);
264 if (bn
== ex_block
|| di
->dfs_order
[bn
->index
])
270 einext
= ei_start (bn
->succs
);
273 gcc_assert (bn
!= en_block
);
275 /* Fill the DFS tree info calculatable _before_ recursing. */
277 my_i
= di
->dfs_order
[bb
->index
];
279 my_i
= di
->dfs_order
[last_basic_block
];
280 child_i
= di
->dfs_order
[bn
->index
] = di
->dfsnum
++;
281 di
->dfs_to_bb
[child_i
] = bn
;
282 di
->dfs_parent
[child_i
] = my_i
;
284 /* Save the current point in the CFG on the stack, and recurse. */
293 /* OK. The edge-list was exhausted, meaning normally we would
294 end the recursion. After returning from the recursive call,
295 there were (may be) other statements which were run after a
296 child node was completely considered by DFS. Here is the
297 point to do it in the non-recursive variant.
298 E.g. The block just completed is in e->dest for forward DFS,
299 the block not yet completed (the parent of the one above)
300 in e->src. This could be used e.g. for computing the number of
301 descendants or the tree depth. */
307 /* The main entry for calculating the DFS tree or forest. DI is our working
308 structure and REVERSE is true, if we are interested in the reverse flow
309 graph. In that case the result is not necessarily a tree but a forest,
310 because there may be nodes from which the EXIT_BLOCK is unreachable. */
313 calc_dfs_tree (struct dom_info
*di
, enum cdi_direction reverse
)
315 /* The first block is the ENTRY_BLOCK (or EXIT_BLOCK if REVERSE). */
316 basic_block begin
= reverse
? EXIT_BLOCK_PTR
: ENTRY_BLOCK_PTR
;
317 di
->dfs_order
[last_basic_block
] = di
->dfsnum
;
318 di
->dfs_to_bb
[di
->dfsnum
] = begin
;
321 calc_dfs_tree_nonrec (di
, begin
, reverse
);
325 /* In the post-dom case we may have nodes without a path to EXIT_BLOCK.
326 They are reverse-unreachable. In the dom-case we disallow such
327 nodes, but in post-dom we have to deal with them.
329 There are two situations in which this occurs. First, noreturn
330 functions. Second, infinite loops. In the first case we need to
331 pretend that there is an edge to the exit block. In the second
332 case, we wind up with a forest. We need to process all noreturn
333 blocks before we know if we've got any infinite loops. */
336 bool saw_unconnected
= false;
338 FOR_EACH_BB_REVERSE (b
)
340 if (EDGE_COUNT (b
->succs
) > 0)
342 if (di
->dfs_order
[b
->index
] == 0)
343 saw_unconnected
= true;
346 bitmap_set_bit (di
->fake_exit_edge
, b
->index
);
347 di
->dfs_order
[b
->index
] = di
->dfsnum
;
348 di
->dfs_to_bb
[di
->dfsnum
] = b
;
349 di
->dfs_parent
[di
->dfsnum
] = di
->dfs_order
[last_basic_block
];
351 calc_dfs_tree_nonrec (di
, b
, reverse
);
356 FOR_EACH_BB_REVERSE (b
)
358 if (di
->dfs_order
[b
->index
])
360 bitmap_set_bit (di
->fake_exit_edge
, b
->index
);
361 di
->dfs_order
[b
->index
] = di
->dfsnum
;
362 di
->dfs_to_bb
[di
->dfsnum
] = b
;
363 di
->dfs_parent
[di
->dfsnum
] = di
->dfs_order
[last_basic_block
];
365 calc_dfs_tree_nonrec (di
, b
, reverse
);
370 di
->nodes
= di
->dfsnum
- 1;
372 /* This aborts e.g. when there is _no_ path from ENTRY to EXIT at all. */
373 gcc_assert (di
->nodes
== (unsigned int) n_basic_blocks
- 1);
376 /* Compress the path from V to the root of its set and update path_min at the
377 same time. After compress(di, V) set_chain[V] is the root of the set V is
378 in and path_min[V] is the node with the smallest key[] value on the path
379 from V to that root. */
382 compress (struct dom_info
*di
, TBB v
)
384 /* Btw. It's not worth to unrecurse compress() as the depth is usually not
385 greater than 5 even for huge graphs (I've not seen call depth > 4).
386 Also performance wise compress() ranges _far_ behind eval(). */
387 TBB parent
= di
->set_chain
[v
];
388 if (di
->set_chain
[parent
])
390 compress (di
, parent
);
391 if (di
->key
[di
->path_min
[parent
]] < di
->key
[di
->path_min
[v
]])
392 di
->path_min
[v
] = di
->path_min
[parent
];
393 di
->set_chain
[v
] = di
->set_chain
[parent
];
397 /* Compress the path from V to the set root of V if needed (when the root has
398 changed since the last call). Returns the node with the smallest key[]
399 value on the path from V to the root. */
402 eval (struct dom_info
*di
, TBB v
)
404 /* The representant of the set V is in, also called root (as the set
405 representation is a tree). */
406 TBB rep
= di
->set_chain
[v
];
408 /* V itself is the root. */
410 return di
->path_min
[v
];
412 /* Compress only if necessary. */
413 if (di
->set_chain
[rep
])
416 rep
= di
->set_chain
[v
];
419 if (di
->key
[di
->path_min
[rep
]] >= di
->key
[di
->path_min
[v
]])
420 return di
->path_min
[v
];
422 return di
->path_min
[rep
];
425 /* This essentially merges the two sets of V and W, giving a single set with
426 the new root V. The internal representation of these disjoint sets is a
427 balanced tree. Currently link(V,W) is only used with V being the parent
431 link_roots (struct dom_info
*di
, TBB v
, TBB w
)
435 /* Rebalance the tree. */
436 while (di
->key
[di
->path_min
[w
]] < di
->key
[di
->path_min
[di
->set_child
[s
]]])
438 if (di
->set_size
[s
] + di
->set_size
[di
->set_child
[di
->set_child
[s
]]]
439 >= 2 * di
->set_size
[di
->set_child
[s
]])
441 di
->set_chain
[di
->set_child
[s
]] = s
;
442 di
->set_child
[s
] = di
->set_child
[di
->set_child
[s
]];
446 di
->set_size
[di
->set_child
[s
]] = di
->set_size
[s
];
447 s
= di
->set_chain
[s
] = di
->set_child
[s
];
451 di
->path_min
[s
] = di
->path_min
[w
];
452 di
->set_size
[v
] += di
->set_size
[w
];
453 if (di
->set_size
[v
] < 2 * di
->set_size
[w
])
456 s
= di
->set_child
[v
];
457 di
->set_child
[v
] = tmp
;
460 /* Merge all subtrees. */
463 di
->set_chain
[s
] = v
;
464 s
= di
->set_child
[s
];
468 /* This calculates the immediate dominators (or post-dominators if REVERSE is
469 true). DI is our working structure and should hold the DFS forest.
470 On return the immediate dominator to node V is in di->dom[V]. */
473 calc_idoms (struct dom_info
*di
, enum cdi_direction reverse
)
476 basic_block en_block
;
477 edge_iterator ei
, einext
;
480 en_block
= EXIT_BLOCK_PTR
;
482 en_block
= ENTRY_BLOCK_PTR
;
484 /* Go backwards in DFS order, to first look at the leafs. */
488 basic_block bb
= di
->dfs_to_bb
[v
];
491 par
= di
->dfs_parent
[v
];
494 ei
= (reverse
) ? ei_start (bb
->succs
) : ei_start (bb
->preds
);
498 /* If this block has a fake edge to exit, process that first. */
499 if (bitmap_bit_p (di
->fake_exit_edge
, bb
->index
))
503 goto do_fake_exit_edge
;
507 /* Search all direct predecessors for the smallest node with a path
508 to them. That way we have the smallest node with also a path to
509 us only over nodes behind us. In effect we search for our
511 while (!ei_end_p (ei
))
517 b
= (reverse
) ? e
->dest
: e
->src
;
524 k1
= di
->dfs_order
[last_basic_block
];
527 k1
= di
->dfs_order
[b
->index
];
529 /* Call eval() only if really needed. If k1 is above V in DFS tree,
530 then we know, that eval(k1) == k1 and key[k1] == k1. */
532 k1
= di
->key
[eval (di
, k1
)];
540 link_roots (di
, par
, v
);
541 di
->next_bucket
[v
] = di
->bucket
[k
];
544 /* Transform semidominators into dominators. */
545 for (w
= di
->bucket
[par
]; w
; w
= di
->next_bucket
[w
])
548 if (di
->key
[k
] < di
->key
[w
])
553 /* We don't need to cleanup next_bucket[]. */
558 /* Explicitly define the dominators. */
560 for (v
= 2; v
<= di
->nodes
; v
++)
561 if (di
->dom
[v
] != di
->key
[v
])
562 di
->dom
[v
] = di
->dom
[di
->dom
[v
]];
565 /* Assign dfs numbers starting from NUM to NODE and its sons. */
568 assign_dfs_numbers (struct et_node
*node
, int *num
)
572 node
->dfs_num_in
= (*num
)++;
576 assign_dfs_numbers (node
->son
, num
);
577 for (son
= node
->son
->right
; son
!= node
->son
; son
= son
->right
)
578 assign_dfs_numbers (son
, num
);
581 node
->dfs_num_out
= (*num
)++;
584 /* Compute the data necessary for fast resolving of dominator queries in a
585 static dominator tree. */
588 compute_dom_fast_query (enum cdi_direction dir
)
593 gcc_assert (dom_info_available_p (dir
));
595 if (dom_computed
[dir
] == DOM_OK
)
600 if (!bb
->dom
[dir
]->father
)
601 assign_dfs_numbers (bb
->dom
[dir
], &num
);
604 dom_computed
[dir
] = DOM_OK
;
607 /* The main entry point into this module. DIR is set depending on whether
608 we want to compute dominators or postdominators. */
611 calculate_dominance_info (enum cdi_direction dir
)
616 if (dom_computed
[dir
] == DOM_OK
)
619 if (!dom_info_available_p (dir
))
621 gcc_assert (!n_bbs_in_dom_tree
[dir
]);
625 b
->dom
[dir
] = et_new_tree (b
);
627 n_bbs_in_dom_tree
[dir
] = n_basic_blocks
;
629 init_dom_info (&di
, dir
);
630 calc_dfs_tree (&di
, dir
);
631 calc_idoms (&di
, dir
);
635 TBB d
= di
.dom
[di
.dfs_order
[b
->index
]];
638 et_set_father (b
->dom
[dir
], di
.dfs_to_bb
[d
]->dom
[dir
]);
642 dom_computed
[dir
] = DOM_NO_FAST_QUERY
;
645 compute_dom_fast_query (dir
);
648 /* Free dominance information for direction DIR. */
650 free_dominance_info (enum cdi_direction dir
)
654 if (!dom_info_available_p (dir
))
659 et_free_tree_force (bb
->dom
[dir
]);
663 n_bbs_in_dom_tree
[dir
] = 0;
665 dom_computed
[dir
] = DOM_NONE
;
668 /* Return the immediate dominator of basic block BB. */
670 get_immediate_dominator (enum cdi_direction dir
, basic_block bb
)
672 struct et_node
*node
= bb
->dom
[dir
];
674 gcc_assert (dom_computed
[dir
]);
679 return node
->father
->data
;
682 /* Set the immediate dominator of the block possibly removing
683 existing edge. NULL can be used to remove any edge. */
685 set_immediate_dominator (enum cdi_direction dir
, basic_block bb
,
686 basic_block dominated_by
)
688 struct et_node
*node
= bb
->dom
[dir
];
690 gcc_assert (dom_computed
[dir
]);
694 if (node
->father
->data
== dominated_by
)
700 et_set_father (node
, dominated_by
->dom
[dir
]);
702 if (dom_computed
[dir
] == DOM_OK
)
703 dom_computed
[dir
] = DOM_NO_FAST_QUERY
;
706 /* Store all basic blocks immediately dominated by BB into BBS and return
709 get_dominated_by (enum cdi_direction dir
, basic_block bb
, basic_block
**bbs
)
712 struct et_node
*node
= bb
->dom
[dir
], *son
= node
->son
, *ason
;
714 gcc_assert (dom_computed
[dir
]);
722 for (ason
= son
->right
, n
= 1; ason
!= son
; ason
= ason
->right
)
725 *bbs
= xmalloc (n
* sizeof (basic_block
));
726 (*bbs
)[0] = son
->data
;
727 for (ason
= son
->right
, n
= 1; ason
!= son
; ason
= ason
->right
)
728 (*bbs
)[n
++] = ason
->data
;
733 /* Find all basic blocks that are immediately dominated (in direction DIR)
734 by some block between N_REGION ones stored in REGION, except for blocks
735 in the REGION itself. The found blocks are stored to DOMS and their number
739 get_dominated_by_region (enum cdi_direction dir
, basic_block
*region
,
740 unsigned n_region
, basic_block
*doms
)
742 unsigned n_doms
= 0, i
;
745 for (i
= 0; i
< n_region
; i
++)
746 region
[i
]->flags
|= BB_DUPLICATED
;
747 for (i
= 0; i
< n_region
; i
++)
748 for (dom
= first_dom_son (dir
, region
[i
]);
750 dom
= next_dom_son (dir
, dom
))
751 if (!(dom
->flags
& BB_DUPLICATED
))
752 doms
[n_doms
++] = dom
;
753 for (i
= 0; i
< n_region
; i
++)
754 region
[i
]->flags
&= ~BB_DUPLICATED
;
759 /* Redirect all edges pointing to BB to TO. */
761 redirect_immediate_dominators (enum cdi_direction dir
, basic_block bb
,
764 struct et_node
*bb_node
= bb
->dom
[dir
], *to_node
= to
->dom
[dir
], *son
;
766 gcc_assert (dom_computed
[dir
]);
776 et_set_father (son
, to_node
);
779 if (dom_computed
[dir
] == DOM_OK
)
780 dom_computed
[dir
] = DOM_NO_FAST_QUERY
;
783 /* Find first basic block in the tree dominating both BB1 and BB2. */
785 nearest_common_dominator (enum cdi_direction dir
, basic_block bb1
, basic_block bb2
)
787 gcc_assert (dom_computed
[dir
]);
794 return et_nca (bb1
->dom
[dir
], bb2
->dom
[dir
])->data
;
798 /* Find the nearest common dominator for the basic blocks in BLOCKS,
799 using dominance direction DIR. */
802 nearest_common_dominator_for_set (enum cdi_direction dir
, bitmap blocks
)
808 first
= bitmap_first_set_bit (blocks
);
809 dom
= BASIC_BLOCK (first
);
810 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
811 if (dom
!= BASIC_BLOCK (i
))
812 dom
= nearest_common_dominator (dir
, dom
, BASIC_BLOCK (i
));
818 /* Return TRUE in case BB1 is dominated by BB2. */
820 dominated_by_p (enum cdi_direction dir
, basic_block bb1
, basic_block bb2
)
822 struct et_node
*n1
= bb1
->dom
[dir
], *n2
= bb2
->dom
[dir
];
824 gcc_assert (dom_computed
[dir
]);
826 if (dom_computed
[dir
] == DOM_OK
)
827 return (n1
->dfs_num_in
>= n2
->dfs_num_in
828 && n1
->dfs_num_out
<= n2
->dfs_num_out
);
830 return et_below (n1
, n2
);
833 /* Verify invariants of dominator structure. */
835 verify_dominators (enum cdi_direction dir
)
840 gcc_assert (dom_info_available_p (dir
));
847 dom_bb
= recount_dominator (dir
, bb
);
848 imm_bb
= get_immediate_dominator (dir
, bb
);
849 if (dom_bb
!= imm_bb
)
851 if ((dom_bb
== NULL
) || (imm_bb
== NULL
))
852 error ("dominator of %d status unknown", bb
->index
);
854 error ("dominator of %d should be %d, not %d",
855 bb
->index
, dom_bb
->index
, imm_bb
->index
);
860 if (dir
== CDI_DOMINATORS
)
864 if (!dominated_by_p (dir
, bb
, ENTRY_BLOCK_PTR
))
866 error ("ENTRY does not dominate bb %d", bb
->index
);
875 /* Determine immediate dominator (or postdominator, according to DIR) of BB,
876 assuming that dominators of other blocks are correct. We also use it to
877 recompute the dominators in a restricted area, by iterating it until it
878 reaches a fixed point. */
881 recount_dominator (enum cdi_direction dir
, basic_block bb
)
883 basic_block dom_bb
= NULL
;
887 gcc_assert (dom_computed
[dir
]);
889 if (dir
== CDI_DOMINATORS
)
891 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
893 /* Ignore the predecessors that either are not reachable from
894 the entry block, or whose dominator was not determined yet. */
895 if (!dominated_by_p (dir
, e
->src
, ENTRY_BLOCK_PTR
))
898 if (!dominated_by_p (dir
, e
->src
, bb
))
899 dom_bb
= nearest_common_dominator (dir
, dom_bb
, e
->src
);
904 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
906 if (!dominated_by_p (dir
, e
->dest
, bb
))
907 dom_bb
= nearest_common_dominator (dir
, dom_bb
, e
->dest
);
914 /* Iteratively recount dominators of BBS. The change is supposed to be local
915 and not to grow further. */
917 iterate_fix_dominators (enum cdi_direction dir
, basic_block
*bbs
, int n
)
920 basic_block old_dom
, new_dom
;
922 gcc_assert (dom_computed
[dir
]);
924 for (i
= 0; i
< n
; i
++)
925 set_immediate_dominator (dir
, bbs
[i
], NULL
);
930 for (i
= 0; i
< n
; i
++)
932 old_dom
= get_immediate_dominator (dir
, bbs
[i
]);
933 new_dom
= recount_dominator (dir
, bbs
[i
]);
934 if (old_dom
!= new_dom
)
937 set_immediate_dominator (dir
, bbs
[i
], new_dom
);
942 for (i
= 0; i
< n
; i
++)
943 gcc_assert (get_immediate_dominator (dir
, bbs
[i
]));
947 add_to_dominance_info (enum cdi_direction dir
, basic_block bb
)
949 gcc_assert (dom_computed
[dir
]);
950 gcc_assert (!bb
->dom
[dir
]);
952 n_bbs_in_dom_tree
[dir
]++;
954 bb
->dom
[dir
] = et_new_tree (bb
);
956 if (dom_computed
[dir
] == DOM_OK
)
957 dom_computed
[dir
] = DOM_NO_FAST_QUERY
;
961 delete_from_dominance_info (enum cdi_direction dir
, basic_block bb
)
963 gcc_assert (dom_computed
[dir
]);
965 et_free_tree (bb
->dom
[dir
]);
967 n_bbs_in_dom_tree
[dir
]--;
969 if (dom_computed
[dir
] == DOM_OK
)
970 dom_computed
[dir
] = DOM_NO_FAST_QUERY
;
973 /* Returns the first son of BB in the dominator or postdominator tree
974 as determined by DIR. */
977 first_dom_son (enum cdi_direction dir
, basic_block bb
)
979 struct et_node
*son
= bb
->dom
[dir
]->son
;
981 return son
? son
->data
: NULL
;
984 /* Returns the next dominance son after BB in the dominator or postdominator
985 tree as determined by DIR, or NULL if it was the last one. */
988 next_dom_son (enum cdi_direction dir
, basic_block bb
)
990 struct et_node
*next
= bb
->dom
[dir
]->right
;
992 return next
->father
->son
== next
? NULL
: next
->data
;
995 /* Returns true if dominance information for direction DIR is available. */
998 dom_info_available_p (enum cdi_direction dir
)
1000 return dom_computed
[dir
] != DOM_NONE
;
1004 debug_dominance_info (enum cdi_direction dir
)
1006 basic_block bb
, bb2
;
1008 if ((bb2
= get_immediate_dominator (dir
, bb
)))
1009 fprintf (stderr
, "%i %i\n", bb
->index
, bb2
->index
);