/**
* Pre-Walker: Copies blocks and nodes from the original method graph
* to the copied graph.
*
* @param n A node from the original method graph.
* @param env The copied graph.
*/
static void copy_all_nodes(ir_node *node, void *env)
{
ir_graph *irg = (ir_graph*)env;
ir_node *new_node = irn_copy_into_irg(node, irg);
set_irn_link(node, new_node);
/* fix access to entities on the stack frame */
if (is_Member(new_node)) {
ir_entity *ent = get_Member_entity(new_node);
ir_type *tp = get_entity_owner(ent);
if (is_frame_type(tp)) {
/* replace by the copied entity */
ent = (ir_entity*)get_entity_link(ent);
assert(is_entity(ent));
assert(get_entity_owner(ent) == get_irg_frame_type(irg));
set_Member_entity(new_node, ent);
}
}
}
/**
* Copies a node to a new irg. The Ins of the new node point to
* the predecessors on the old irg. n->link points to the new node.
*
* @param n The node to be copied
* @param irg the new irg
*
* Does NOT copy standard nodes like Start, End etc that are fixed
* in an irg. Instead, the corresponding nodes of the new irg are returned.
* Note further, that the new nodes have no block.
*/
static void copy_irn_to_irg(ir_node *n, ir_graph *irg)
{
/* do not copy standard nodes */
ir_node *nn = NULL;
switch (get_irn_opcode(n)) {
case iro_NoMem:
nn = get_irg_no_mem(irg);
break;
case iro_Block: {
ir_graph *old_irg = get_irn_irg(n);
if (n == get_irg_start_block(old_irg))
nn = get_irg_start_block(irg);
else if (n == get_irg_end_block(old_irg))
nn = get_irg_end_block(irg);
break;
}
case iro_Member: {
ir_graph *const old_irg = get_irn_irg(n);
ir_node *const old_ptr = get_Member_ptr(n);
if (old_ptr == get_irg_frame(old_irg)) {
dbg_info *const dbgi = get_irn_dbg_info(n);
ir_node *const block = get_irg_start_block(irg);
ir_entity *const ent = get_entity_link(get_Member_entity(n));
nn = new_rd_Member(dbgi, block, old_ptr, ent);
}
break;
}
case iro_Start:
nn = get_irg_start(irg);
break;
case iro_End:
nn = get_irg_end(irg);
break;
case iro_Proj: {
ir_graph *old_irg = get_irn_irg(n);
if (n == get_irg_frame(old_irg))
nn = get_irg_frame(irg);
else if (n == get_irg_initial_mem(old_irg))
nn = get_irg_initial_mem(irg);
else if (n == get_irg_args(old_irg))
nn = get_irg_args(irg);
break;
}
}
if (nn) {
set_irn_link(n, nn);
return;
}
nn = new_ir_node(get_irn_dbg_info(n),
irg,
NULL, /* no block yet, will be set later */
get_irn_op(n),
get_irn_mode(n),
get_irn_arity(n),
get_irn_in(n));
/* Copy the attributes. These might point to additional data. If this
was allocated on the old obstack the pointers now are dangling. This
frees e.g. the memory of the graph_arr allocated in new_immBlock. */
copy_node_attr(irg, n, nn);
set_irn_link(n, nn);
}
/*
* Optimize the frame type of an irg by removing
* never touched entities.
*/
void opt_frame_irg(ir_graph *irg)
{
ir_type *frame_tp = get_irg_frame_type(irg);
ir_entity *ent, *list;
ir_node *frame, *sel;
size_t i, n = get_class_n_members(frame_tp);
int o;
if (n <= 0)
return;
assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
irp_reserve_resources(irp, IRP_RESOURCE_ENTITY_LINK);
/* clear all entity links */
for (i = n; i > 0;) {
ent = get_class_member(frame_tp, --i);
set_entity_link(ent, NULL);
}
/* look for uses */
frame = get_irg_frame(irg);
/* mark all used entities */
for (o = get_irn_n_outs(frame) - 1; o >= 0; --o) {
sel = get_irn_out(frame, o);
if (is_Sel(sel)) {
ent = get_Sel_entity(sel);
/* only entities on the frame */
if (get_entity_owner(ent) == frame_tp)
set_entity_link(ent, ent);
}
}
/* link unused ones */
list = NULL;
for (i = n; i > 0;) {
ent = get_class_member(frame_tp, --i);
/* beware of inner functions: those are NOT unused */
if (get_entity_link(ent) == NULL && !is_method_entity(ent)) {
set_entity_link(ent, list);
list = ent;
}
}
if (list != NULL) {
/* delete list members */
for (ent = list; ent; ent = list) {
list = (ir_entity*)get_entity_link(ent);
free_entity(ent);
}
/* we changed the frame type, its layout should be redefined */
set_type_state(frame_tp, layout_undefined);
}
irp_free_resources(irp, IRP_RESOURCE_ENTITY_LINK);
/* we changed the type, this affects none of the currently known graph
* properties, but I don't use ALL because I don't know if someone adds
* type-based properties at some point */
confirm_irg_properties(irg,
IR_GRAPH_PROPERTIES_CONTROL_FLOW
| IR_GRAPH_PROPERTY_NO_BADS
| IR_GRAPH_PROPERTY_NO_TUPLES
| IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES
| IR_GRAPH_PROPERTY_CONSISTENT_OUTS
| IR_GRAPH_PROPERTY_CONSISTENT_ENTITY_USAGE
| IR_GRAPH_PROPERTY_MANY_RETURNS);
}
