/*
- * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
/* move constants into start block */
new_node = get_new_node(node);
- if (is_irn_constlike(new_node)) {
+ if (is_irn_start_block_placed(new_node)) {
ir_graph *new_irg = (ir_graph *) env;
ir_node *start_block = get_irg_start_block(new_irg);
set_nodes_block(new_node, start_block);
for (i = 0; i < n_params; ++i) {
ir_type *p_type = get_method_param_type(call_type, i);
- if (is_compound_type(p_type))
+ if (is_compound_type(p_type) || is_Array_type(p_type))
return false;
}
for (i = 0; i < n_res; ++i) {
ir_type *r_type = get_method_res_type(call_type, i);
- if (is_compound_type(r_type))
+ if (is_compound_type(r_type) || is_Array_type(r_type))
return false;
}
}
/* Inlines a method at the given call site. */
-int inline_method(ir_node *call, ir_graph *called_graph)
+int inline_method(ir_node *const call, ir_graph *called_graph)
{
/* we cannot inline some types of calls */
if (! can_inline(call, called_graph))
set_optimize(0);
/* Handle graph state */
- assert(get_irg_phase_state(irg) != phase_building);
assert(get_irg_pinned(irg) == op_pin_state_pinned);
assert(get_irg_pinned(called_graph) == op_pin_state_pinned);
clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE
in[pn_Start_P_frame_base] = get_irg_frame(irg);
in[pn_Start_T_args] = new_r_Tuple(post_bl, n_params, args_in);
ir_node *pre_call = new_r_Tuple(post_bl, pn_Start_max+1, in);
- ir_node *post_call = call;
/* --
The new block gets the ins of the old block, pre_call and all its
/* build a Tuple for all results of the method.
* add Phi node if there was more than one Return. */
- turn_into_tuple(post_call, pn_Call_max+1);
/* First the Memory-Phi */
int n_mem_phi = 0;
for (int i = 0; i < arity; i++) {
cf_pred[n_mem_phi++] = new_r_Proj(ret, mode_M, 1);
}
}
- ir_node *phi = new_r_Phi(post_bl, n_mem_phi, cf_pred, mode_M);
- set_Tuple_pred(call, pn_Call_M, phi);
+ ir_node *const call_mem = new_r_Phi(post_bl, n_mem_phi, cf_pred, mode_M);
/* Conserve Phi-list for further inlinings -- but might be optimized */
- if (get_nodes_block(phi) == post_bl) {
- set_irn_link(phi, get_irn_link(post_bl));
- set_irn_link(post_bl, phi);
+ if (get_nodes_block(call_mem) == post_bl) {
+ set_irn_link(call_mem, get_irn_link(post_bl));
+ set_irn_link(post_bl, call_mem);
}
/* Now the real results */
+ ir_node *call_res;
if (n_res > 0) {
for (int j = 0; j < n_res; j++) {
ir_type *res_type = get_method_res_type(ctp, j);
n_ret++;
}
}
- if (n_ret > 0) {
- phi = new_r_Phi(post_bl, n_ret, cf_pred, res_mode);
- } else {
- phi = new_r_Bad(irg, res_mode);
- }
+ ir_node *const phi = n_ret > 0
+ ? new_r_Phi(post_bl, n_ret, cf_pred, res_mode)
+ : new_r_Bad(irg, res_mode);
res_pred[j] = phi;
/* Conserve Phi-list for further inlinings -- but might be optimized */
if (get_nodes_block(phi) == post_bl) {
set_Block_phis(post_bl, phi);
}
}
- ir_node *result_tuple = new_r_Tuple(post_bl, n_res, res_pred);
- set_Tuple_pred(call, pn_Call_T_result, result_tuple);
+ call_res = new_r_Tuple(post_bl, n_res, res_pred);
} else {
- set_Tuple_pred(call, pn_Call_T_result, new_r_Bad(irg, mode_T));
+ call_res = new_r_Bad(irg, mode_T);
}
/* handle the regular call */
- set_Tuple_pred(call, pn_Call_X_regular, new_r_Jmp(post_bl));
+ ir_node *const call_x_reg = new_r_Jmp(post_bl);
/* Finally the exception control flow.
We have two possible situations:
Second: There is no exception edge. Just add all inlined exception
branches to the End node.
*/
+ ir_node *call_x_exc;
if (exc_handling == exc_handler) {
int n_exc = 0;
for (int i = 0; i < arity; i++) {
if (n_exc > 0) {
if (n_exc == 1) {
/* simple fix */
- set_Tuple_pred(call, pn_Call_X_except, cf_pred[0]);
+ call_x_exc = cf_pred[0];
} else {
ir_node *block = new_r_Block(irg, n_exc, cf_pred);
- set_Tuple_pred(call, pn_Call_X_except, new_r_Jmp(block));
+ call_x_exc = new_r_Jmp(block);
}
} else {
- set_Tuple_pred(call, pn_Call_X_except, new_r_Bad(irg, mode_X));
+ call_x_exc = new_r_Bad(irg, mode_X);
}
} else {
/* assert(exc_handling == 1 || no exceptions. ) */
for (int i = 0; i < n_exc; ++i)
end_preds[main_end_bl_arity + i] = cf_pred[i];
set_irn_in(main_end_bl, n_exc + main_end_bl_arity, end_preds);
- set_Tuple_pred(call, pn_Call_X_except, new_r_Bad(irg, mode_X));
+ call_x_exc = new_r_Bad(irg, mode_X);
free(end_preds);
}
free(res_pred);
free(cf_pred);
+ ir_node *const call_in[] = {
+ [pn_Call_M] = call_mem,
+ [pn_Call_T_result] = call_res,
+ [pn_Call_X_regular] = call_x_reg,
+ [pn_Call_X_except] = call_x_exc,
+ };
+ turn_into_tuple(call, ARRAY_SIZE(call_in), call_in);
+
/* -- Turn CSE back on. -- */
set_optimize(rem_opt);
current_ir_graph = rem;
unsigned all_const:1; /**< Set if this call has only constant parameters. */
} call_entry;
-/**
- * environment for inlining small irgs
- */
-typedef struct inline_env_t {
- struct obstack obst; /**< An obstack where call_entries are allocated on. */
- list_head calls; /**< The call entry list. */
-} inline_env_t;
-
/**
* Returns the irg called from a Call node. If the irg is not
* known, NULL is returned.
return NULL;
}
-/**
- * Walker: Collect all calls to known graphs inside a graph.
- */
-static void collect_calls(ir_node *call, void *env)
-{
- (void) env;
- if (is_Call(call)) {
- ir_graph *called_irg = get_call_called_irg(call);
-
- if (called_irg != NULL) {
- /* The Call node calls a locally defined method. Remember to inline. */
- inline_env_t *ienv = (inline_env_t*)env;
- call_entry *entry = OALLOC(&ienv->obst, call_entry);
- entry->call = call;
- entry->callee = called_irg;
- entry->loop_depth = 0;
- entry->benefice = 0;
- entry->local_adr = 0;
- entry->all_const = 0;
-
- list_add_tail(&entry->list, &ienv->calls);
- }
- }
-}
-
-/**
- * Inlines all small methods at call sites where the called address comes
- * from a Const node that references the entity representing the called
- * method.
- * The size argument is a rough measure for the code size of the method:
- * Methods where the obstack containing the firm graph is smaller than
- * size are inlined.
- */
-void inline_small_irgs(ir_graph *irg, int size)
-{
- ir_graph *rem = current_ir_graph;
- inline_env_t env;
-
- current_ir_graph = irg;
- /* Handle graph state */
- assert(get_irg_phase_state(irg) != phase_building);
- free_callee_info(irg);
-
- /* Find Call nodes to inline.
- (We can not inline during a walk of the graph, as inlining the same
- method several times changes the visited flag of the walked graph:
- after the first inlining visited of the callee equals visited of
- the caller. With the next inlining both are increased.) */
- obstack_init(&env.obst);
- INIT_LIST_HEAD(&env.calls);
- irg_walk_graph(irg, NULL, collect_calls, &env);
-
- if (! list_empty(&env.calls)) {
- /* There are calls to inline */
- ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
- collect_phiprojs(irg);
-
- list_for_each_entry(call_entry, entry, &env.calls, list) {
- ir_graph *callee = entry->callee;
- ir_entity *called = get_irg_entity(callee);
- mtp_additional_properties props
- = get_entity_additional_properties(called);
-
- if (props & mtp_property_noinline)
- continue;
-
- if ((props & mtp_property_always_inline) ||
- _obstack_memory_used(callee->obst) - (int)obstack_room(callee->obst) < size) {
- inline_method(entry->call, callee);
- }
- }
- ir_free_resources(irg, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
- }
- obstack_free(&env.obst, NULL);
- current_ir_graph = rem;
-}
-
-typedef struct inline_small_irgs_pass_t {
- ir_graph_pass_t pass;
- int size;
-} inline_small_irgs_pass_t;
-
-/**
- * Wrapper to run inline_small_irgs() as a pass.
- */
-static int inline_small_irgs_wrapper(ir_graph *irg, void *context)
-{
- inline_small_irgs_pass_t *pass = (inline_small_irgs_pass_t*)context;
-
- inline_small_irgs(irg, pass->size);
- return 0;
-}
-
-/* create a pass for inline_small_irgs() */
-ir_graph_pass_t *inline_small_irgs_pass(const char *name, int size)
-{
- inline_small_irgs_pass_t *pass = XMALLOCZ(inline_small_irgs_pass_t);
-
- pass->size = size;
- return def_graph_pass_constructor(
- &pass->pass, name ? name : "inline_small_irgs", inline_small_irgs_wrapper);
-}
-
/**
* Environment for inlining irgs.
*/
}
}
-/**
- * Returns TRUE if the number of callers is 0 in the irg's environment,
- * hence this irg is a leaf.
- */
-inline static int is_leaf(ir_graph *irg)
-{
- inline_irg_env *env = (inline_irg_env*)get_irg_link(irg);
- return env->n_call_nodes == 0;
-}
-
-/**
- * Returns TRUE if the number of nodes in the callee is
- * smaller then size in the irg's environment.
- */
-inline static int is_smaller(ir_graph *callee, unsigned size)
-{
- inline_irg_env *env = (inline_irg_env*)get_irg_link(callee);
- return env->n_nodes < size;
-}
-
/**
* Duplicate a call entry.
*
return nentry;
}
-/**
- * Append all call nodes of the source environment to the nodes of in the destination
- * environment.
- *
- * @param dst destination environment
- * @param src source environment
- * @param loop_depth the loop depth of the call that is replaced by the src list
- */
-static void append_call_list(inline_irg_env *dst, inline_irg_env *src, int loop_depth)
-{
- call_entry *nentry;
-
- /* Note that the src list points to Call nodes in the inlined graph, but
- we need Call nodes in our graph. Luckily the inliner leaves this information
- in the link field. */
- list_for_each_entry(call_entry, entry, &src->calls, list) {
- nentry = duplicate_call_entry(entry, (ir_node*)get_irn_link(entry->call), loop_depth);
- list_add_tail(&nentry->list, &dst->calls);
- }
- dst->n_call_nodes += src->n_call_nodes;
- dst->n_nodes += src->n_nodes;
-}
-
-/*
- * Inlines small leaf methods at call sites where the called address comes
- * from a Const node that references the entity representing the called
- * method.
- * The size argument is a rough measure for the code size of the method:
- * Methods where the obstack containing the firm graph is smaller than
- * size are inlined.
- */
-void inline_leaf_functions(unsigned maxsize, unsigned leafsize,
- unsigned size, int ignore_runtime)
-{
- inline_irg_env *env;
- ir_graph *irg;
- size_t i, n_irgs;
- ir_graph *rem;
- int did_inline;
- wenv_t wenv;
- pmap *copied_graphs;
- pmap_entry *pm_entry;
-
- rem = current_ir_graph;
- obstack_init(&temp_obst);
-
- /* a map for the copied graphs, used to inline recursive calls */
- copied_graphs = pmap_create();
-
- /* extend all irgs by a temporary data structure for inlining. */
- n_irgs = get_irp_n_irgs();
- for (i = 0; i < n_irgs; ++i)
- set_irg_link(get_irp_irg(i), alloc_inline_irg_env());
-
- /* Pre-compute information in temporary data structure. */
- wenv.ignore_runtime = ignore_runtime;
- wenv.ignore_callers = 0;
- for (i = 0; i < n_irgs; ++i) {
- ir_graph *irg = get_irp_irg(i);
-
- assert(get_irg_phase_state(irg) != phase_building);
- free_callee_info(irg);
-
- assure_irg_properties(irg,
- IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
- wenv.x = (inline_irg_env*)get_irg_link(irg);
- irg_walk_graph(irg, NULL, collect_calls2, &wenv);
- confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_ALL);
- }
-
- /* -- and now inline. -- */
-
- /* Inline leafs recursively -- we might construct new leafs. */
- do {
- did_inline = 0;
-
- for (i = 0; i < n_irgs; ++i) {
- int phiproj_computed = 0;
-
- current_ir_graph = get_irp_irg(i);
- env = (inline_irg_env*)get_irg_link(current_ir_graph);
-
- ir_reserve_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
- list_for_each_entry_safe(call_entry, entry, next, &env->calls, list) {
- if (env->n_nodes > maxsize)
- break;
-
- ir_node *call = entry->call;
- ir_graph *callee = entry->callee;
- ir_entity *called = get_irg_entity(callee);
- mtp_additional_properties props
- = get_entity_additional_properties(called);
- if (props & mtp_property_noinline)
- continue;
-
- if (is_leaf(callee) && (
- is_smaller(callee, leafsize) || (props & mtp_property_always_inline))) {
- if (!phiproj_computed) {
- phiproj_computed = 1;
- collect_phiprojs(current_ir_graph);
- }
- did_inline = inline_method(call, callee);
-
- if (did_inline) {
- inline_irg_env *callee_env = (inline_irg_env*)get_irg_link(callee);
-
- /* call was inlined, Phi/Projs for current graph must be recomputed */
- phiproj_computed = 0;
-
- /* Do some statistics */
- env->got_inline = 1;
- --env->n_call_nodes;
- env->n_nodes += callee_env->n_nodes;
- --callee_env->n_callers;
-
- /* remove this call from the list */
- list_del(&entry->list);
- continue;
- }
- }
- }
- ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
- }
- } while (did_inline);
-
- /* inline other small functions. */
- for (i = 0; i < n_irgs; ++i) {
- int phiproj_computed = 0;
-
- current_ir_graph = get_irp_irg(i);
- env = (inline_irg_env*)get_irg_link(current_ir_graph);
-
- ir_reserve_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
-
- /* note that the list of possible calls is updated during the process */
- list_for_each_entry_safe(call_entry, entry, next, &env->calls, list) {
- ir_node *call = entry->call;
- ir_graph *callee = entry->callee;
- ir_entity *called = get_irg_entity(callee);
-
- mtp_additional_properties props = get_entity_additional_properties(called);
- if (props & mtp_property_noinline)
- continue;
-
- ir_graph *calleee = pmap_get(ir_graph, copied_graphs, callee);
- if (calleee != NULL) {
- /*
- * Remap callee if we have a copy.
- * FIXME: Should we do this only for recursive Calls ?
- */
- callee = calleee;
- }
-
- if ((props & mtp_property_always_inline) ||
- (is_smaller(callee, size) && env->n_nodes < maxsize) /* small function */) {
- if (current_ir_graph == callee) {
- /*
- * Recursive call: we cannot directly inline because we cannot walk
- * the graph and change it. So we have to make a copy of the graph
- * first.
- */
-
- inline_irg_env *callee_env;
- ir_graph *copy;
-
- ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
-
- /*
- * No copy yet, create one.
- * Note that recursive methods are never leafs, so it is sufficient
- * to test this condition here.
- */
- copy = create_irg_copy(callee);
-
- /* create_irg_copy() destroys the Proj links, recompute them */
- phiproj_computed = 0;
-
- ir_reserve_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
-
- /* allocate new environment */
- callee_env = alloc_inline_irg_env();
- set_irg_link(copy, callee_env);
-
- assure_irg_properties(copy,
- IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
- wenv.x = callee_env;
- wenv.ignore_callers = 1;
- irg_walk_graph(copy, NULL, collect_calls2, &wenv);
-
- /*
- * Enter the entity of the original graph. This is needed
- * for inline_method(). However, note that ent->irg still points
- * to callee, NOT to copy.
- */
- set_irg_entity(copy, get_irg_entity(callee));
-
- pmap_insert(copied_graphs, callee, copy);
- callee = copy;
-
- /* we have only one caller: the original graph */
- callee_env->n_callers = 1;
- callee_env->n_callers_orig = 1;
- }
- if (! phiproj_computed) {
- phiproj_computed = 1;
- collect_phiprojs(current_ir_graph);
- }
- did_inline = inline_method(call, callee);
- if (did_inline) {
- inline_irg_env *callee_env = (inline_irg_env *)get_irg_link(callee);
-
- /* call was inlined, Phi/Projs for current graph must be recomputed */
- phiproj_computed = 0;
-
- /* callee was inline. Append its call list. */
- env->got_inline = 1;
- --env->n_call_nodes;
- append_call_list(env, callee_env, entry->loop_depth);
- --callee_env->n_callers;
-
- /* after we have inlined callee, all called methods inside callee
- are now called once more */
- list_for_each_entry(call_entry, centry, &callee_env->calls, list) {
- inline_irg_env *penv = (inline_irg_env*)get_irg_link(centry->callee);
- ++penv->n_callers;
- }
-
- /* remove this call from the list */
- list_del(&entry->list);
- continue;
- }
- }
- }
- ir_free_resources(current_ir_graph, IR_RESOURCE_IRN_LINK|IR_RESOURCE_PHI_LIST);
- }
-
- for (i = 0; i < n_irgs; ++i) {
- irg = get_irp_irg(i);
- env = (inline_irg_env*)get_irg_link(irg);
-
- if (env->got_inline) {
- optimize_graph_df(irg);
- optimize_cf(irg);
- }
- if (env->got_inline || (env->n_callers_orig != env->n_callers)) {
- DB((dbg, LEVEL_1, "Nodes:%3d ->%3d, calls:%3d ->%3d, callers:%3d ->%3d, -- %s\n",
- env->n_nodes_orig, env->n_nodes, env->n_call_nodes_orig, env->n_call_nodes,
- env->n_callers_orig, env->n_callers,
- get_entity_name(get_irg_entity(irg))));
- }
- }
-
- /* kill the copied graphs: we don't need them anymore */
- foreach_pmap(copied_graphs, pm_entry) {
- ir_graph *copy = (ir_graph*)pm_entry->value;
-
- /* reset the entity, otherwise it will be deleted in the next step ... */
- set_irg_entity(copy, NULL);
- free_ir_graph(copy);
- }
- pmap_destroy(copied_graphs);
-
- obstack_free(&temp_obst, NULL);
- current_ir_graph = rem;
-}
-
-typedef struct inline_leaf_functions_pass_t {
- ir_prog_pass_t pass;
- unsigned maxsize;
- unsigned leafsize;
- unsigned size;
- int ignore_runtime;
-} inline_leaf_functions_pass_t;
-
-/**
- * Wrapper to run inline_leaf_functions() as a ir_prog pass.
- */
-static int inline_leaf_functions_wrapper(ir_prog *irp, void *context)
-{
- inline_leaf_functions_pass_t *pass = (inline_leaf_functions_pass_t*)context;
-
- (void)irp;
- inline_leaf_functions(
- pass->maxsize, pass->leafsize,
- pass->size, pass->ignore_runtime);
- return 0;
-}
-
-/* create a pass for inline_leaf_functions() */
-ir_prog_pass_t *inline_leaf_functions_pass(
- const char *name, unsigned maxsize, unsigned leafsize,
- unsigned size, int ignore_runtime)
-{
- inline_leaf_functions_pass_t *pass = XMALLOCZ(inline_leaf_functions_pass_t);
-
- pass->maxsize = maxsize;
- pass->leafsize = leafsize;
- pass->size = size;
- pass->ignore_runtime = ignore_runtime;
-
- return def_prog_pass_constructor(
- &pass->pass,
- name ? name : "inline_leaf_functions",
- inline_leaf_functions_wrapper);
-}
-
/**
* Calculate the parameter weights for transmitting the address of a local variable.
*/
projects / libfirm / blobdiff