- int a2b = value_dominates(a, b);
- int b2a = value_dominates(b, a);
-
- /*
- * Adjust a and b so, that a dominates b if
- * a dominates b or vice versa.
- */
- if(b2a) {
- const ir_node *t = a;
- a = b;
- b = t;
- }
-
- /*
- * If either a dmoninates b or vice versa
- * check if there is usage which is dominated by b.
- *
- * remind, that if a and b are in a dom relation, a always dominates b
- * here due to the if above.
- */
- if(a2b + b2a) {
- const ir_edge_t *edge;
-
- /* Look at all usages of a */
- foreach_out_edge(a, edge) {
- const ir_node *user = edge->src;
-
- /*
- * If the user is a phi we must check the last instruction in the
- * corresponding phi predecessor block since the phi is not a
- * proper user.
- */
- if(is_Phi(user)) {
- ir_node *phi_block = get_nodes_block(user);
- user = sched_last(get_Block_cfgpred_block(phi_block, edge->pos));
- }
-
- /* If b dominates a user of a, we can safely return 1 here. */
- if(value_dominates(b, user))
- return 1;
- }
+ assert(selected_allocator != NULL);
+ if(selected_allocator != NULL) {
+ selected_allocator->allocate(birg);
+ }
+}