-/* Returns the smallest common dominator block of all users of a node. */
-ir_node *node_users_smallest_common_dominator(ir_node *irn, int handle_phi)
-{
- int n, j, i = 0, success;
- ir_node **user_blocks, *dom_bl;
- const ir_edge_t *edge;
-
- assert(! is_Block(irn) && "WRONG USAGE of node_users_smallest_common_dominator");
- assert(edges_activated(get_irn_irg(irn)) && "need edges activated");
-
- n = get_irn_n_edges(irn);
-
- /* get array to hold all block of the node users */
- NEW_ARR_A(ir_node *, user_blocks, n);
- foreach_out_edge(irn, edge) {
- ir_node *src = get_edge_src_irn(edge);
-
- if (is_Phi(src) && handle_phi) {
- /* get the corresponding cfg predecessor block if phi handling requested */
- j = get_edge_src_pos(edge);
- assert(j >= 0 && "kaputt");
- user_blocks[i++] = get_Block_cfgpred_block(get_nodes_block(src), j);
- }
- else
- user_blocks[i++] = is_Block(src) ? src : get_nodes_block(src);
- }
-
- assert(i == n && "get_irn_n_edges probably broken");
-
- /* in case of only one user: return the block of the user */
- if (n == 1)
- return user_blocks[0];
-
- i = 0;
- /* search the smallest block dominating all user blocks */
- do {
- dom_bl = node_smallest_common_dominator(user_blocks[i], user_blocks[i + 1]);
- success = 1;
-
- /* check if this block dominates all remaining blocks as well */
- for (j = i + 2; j < n; j++) {
- if (! block_dominates(dom_bl, user_blocks[j]))
- success = 0;
- }
-
- if (success)
- break;
-
- /* inherit the dominator block of the first (i + 1) users */
- user_blocks[++i] = dom_bl;
- } while (i < n - 1);
-
- assert(success && "no block found dominating all users");
-
- return dom_bl;
-}
-
-