X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgraph.c;h=af159cfff7def021d181646f7a98dc638ef211ee;hb=0f234e2d94155d13c0e4727871125beda0eaa66d;hp=0686a1cd33680b3ac8f5a46863bb4250a28b344b;hpb=443730f33bedbae60304c7773d6b14062eceaa6d;p=libfirm diff --git a/ir/ir/irgraph.c b/ir/ir/irgraph.c index 0686a1cd3..af159cfff 100644 --- a/ir/ir/irgraph.c +++ b/ir/ir/irgraph.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -23,13 +23,9 @@ * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck * @version $Id$ */ -#ifdef HAVE_CONFIG_H -# include "config.h" -#endif +#include "config.h" -#ifdef HAVE_STRING_H -# include -#endif +#include #ifdef HAVE_STDDEF_H # include #endif @@ -38,6 +34,7 @@ #include "ircons_t.h" #include "irgraph_t.h" #include "irprog_t.h" +#include "irgraph_t.h" #include "irnode_t.h" #include "iropt_t.h" #include "irflag_t.h" @@ -47,6 +44,7 @@ #include "irhooks.h" #include "irtools.h" #include "irgwalk.h" +#include "irbackedge_t.h" #include "iredges_t.h" #include "type_t.h" #include "irmemory.h" @@ -74,7 +72,7 @@ void set_current_ir_graph(ir_graph *graph) { current_ir_graph = graph; } - +#ifdef INTERPROCEDURAL_VIEW int firm_interprocedural_view = 0; int (get_interprocedural_view)(void) { @@ -94,6 +92,7 @@ void (set_interprocedural_view)(int state) { _get_irn_n = _get_irn_intra_n; } } +#endif /** contains the suffix for frame type names */ static ident *frame_type_suffix = NULL; @@ -112,11 +111,19 @@ void firm_init_irgraph(void) { * @return Memory for a new graph. */ static ir_graph *alloc_graph(void) { - size_t size = sizeof(ir_graph) + additional_graph_data_size; - char *ptr = xmalloc(size); + ir_graph *res; + size_t size = sizeof(ir_graph) + additional_graph_data_size; + char *ptr = xmalloc(size); memset(ptr, 0, size); - return (ir_graph *) (ptr + additional_graph_data_size); + res = (ir_graph *)(ptr + additional_graph_data_size); + res->kind = k_ir_graph; + + /* initialize the idx->node map. */ + res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE); + memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0])); + + return res; } /** @@ -124,15 +131,40 @@ static ir_graph *alloc_graph(void) { */ static void free_graph(ir_graph *irg) { char *ptr = (char *)irg; + int i; + + for (i = 0; i < EDGE_KIND_LAST; ++i) + edges_deactivate_kind(irg, i); + DEL_ARR_F(irg->idx_irn_map); free(ptr - additional_graph_data_size); } -#if USE_EXPLICIT_PHI_IN_STACK -/* really defined in ircons.c */ -typedef struct Phi_in_stack Phi_in_stack; -Phi_in_stack *new_Phi_in_stack(); -void free_Phi_in_stack(Phi_in_stack *s); -#endif +/** + * Set the number of locals for a given graph. + * + * @param irg the graph + * @param n_loc number of locals + */ +void irg_set_nloc(ir_graph *res, int n_loc) { + assert(res->phase_state == phase_building); + + if (get_opt_precise_exc_context()) { + res->n_loc = n_loc + 1 + 1; /* number of local variables that are never + dereferenced in this graph plus one for + the store plus one for links to fragile + operations. n_loc is not the number of + parameters to the procedure! */ + } else { + res->n_loc = n_loc + 1; /* number of local variables that are never + dereferenced in this graph plus one for + the store. This is not the number of parameters + to the procedure! */ + } + if (res->loc_descriptions) { + xfree(res->loc_descriptions); + res->loc_descriptions = NULL; + } +} /* Allocates a list of nodes: - The start block containing a start node and Proj nodes for it's four @@ -146,17 +178,9 @@ void free_Phi_in_stack(Phi_in_stack *s); ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { ir_graph *res; ir_node *first_block; - ir_node *end, *start, *start_block, *initial_mem, *projX; + ir_node *end, *start, *start_block, *initial_mem, *projX, *bad; res = alloc_graph(); - res->kind = k_ir_graph; - - //edges_init_graph_kind(res, EDGE_KIND_NORMAL); - //edges_init_graph_kind(res, EDGE_KIND_BLOCK); - - /* initialize the idx->node map. */ - res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE); - memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0])); /* inform statistics here, as blocks will be already build on this graph */ hook_new_graph(res, ent); @@ -164,18 +188,12 @@ ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { current_ir_graph = res; /*-- initialized for each graph. --*/ - if (get_opt_precise_exc_context()) { - res->n_loc = n_loc + 1 + 1; /* number of local variables that are never - dereferenced in this graph plus one for - the store plus one for links to fragile - operations. n_loc is not the number of - parameters to the procedure! */ - } else { - res->n_loc = n_loc + 1; /* number of local variables that are never - dereferenced in this graph plus one for - the store. This is not the number of parameters - to the procedure! */ - } + res->kind = k_ir_graph; + res->obst = XMALLOC(struct obstack); + obstack_init(res->obst); + + res->phase_state = phase_building; + irg_set_nloc(res, n_loc); /* descriptions will be allocated on demand */ res->loc_descriptions = NULL; @@ -183,25 +201,17 @@ ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { res->visited = 0; /* visited flag, for the ir walker */ res->block_visited = 0; /* visited flag, for the 'block'-walker */ -#if USE_EXPLICIT_PHI_IN_STACK - res->Phi_in_stack = new_Phi_in_stack(); /* A stack needed for automatic Phi - generation */ -#endif - res->kind = k_ir_graph; - res->obst = xmalloc (sizeof(*res->obst)); - obstack_init(res->obst); res->extbb_obst = NULL; res->last_node_idx = 0; - res->value_table = new_identities (); /* value table for global value - numbering for optimizing use in iropt.c */ + res->value_table = new_identities(); /* value table for global value + numbering for optimizing use in iropt.c */ res->outs = NULL; res->inline_property = irg_inline_any; res->additional_properties = mtp_property_inherited; /* inherited from type */ - res->phase_state = phase_building; res->irg_pinned_state = op_pin_state_pinned; res->outs_state = outs_none; res->dom_state = dom_none; @@ -214,7 +224,7 @@ ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { res->extblk_state = ir_extblk_info_none; res->execfreq_state = exec_freq_none; res->fp_model = fp_model_precise; - res->adr_taken_state = ir_address_taken_not_computed; + res->entity_usage_state = ir_entity_usage_not_computed; res->mem_disambig_opt = aa_opt_inherited; /*-- Type information for the procedure of the graph --*/ @@ -222,52 +232,50 @@ ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { set_entity_irg(ent, res); /*-- a class type so that it can contain "inner" methods as in Pascal. --*/ - res->frame_type = new_type_frame(mangle(get_entity_ident(ent), frame_type_suffix)); + res->frame_type = new_type_frame(); /* the Anchor node must be created first */ res->anchor = new_Anchor(res); /*-- Nodes needed in every graph --*/ set_irg_end_block (res, new_immBlock()); + set_cur_block(get_irg_end_block(res)); end = new_End(); set_irg_end (res, end); set_irg_end_reg (res, end); set_irg_end_except(res, end); start_block = new_immBlock(); + set_cur_block(start_block); set_irg_start_block(res, start_block); - set_irg_bad (res, new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL)); + bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL); + bad->attr.irg.irg = res; + set_irg_bad (res, bad); set_irg_no_mem (res, new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL)); start = new_Start(); set_irg_start (res, start); /* Proj results of start node */ projX = new_Proj(start, mode_X, pn_Start_X_initial_exec); + set_irg_initial_exec (res, projX); set_irg_frame (res, new_Proj(start, mode_P_data, pn_Start_P_frame_base)); - set_irg_globals (res, new_Proj(start, mode_P_data, pn_Start_P_globals)); set_irg_tls (res, new_Proj(start, mode_P_data, pn_Start_P_tls)); set_irg_args (res, new_Proj(start, mode_T, pn_Start_T_args)); - set_irg_value_param_base(res, new_Proj(start, mode_P_data, pn_Start_P_value_arg_base)); initial_mem = new_Proj(start, mode_M, pn_Start_M); set_irg_initial_mem(res, initial_mem); - add_immBlock_pred(start_block, projX); set_store(initial_mem); + res->index = get_irp_new_irg_idx(); #ifdef DEBUG_libfirm res->graph_nr = get_irp_new_node_nr(); #endif - res->proj_args = NULL; - /* - * The code generation needs it. leave it in now. - * Use of this edge is matter of discussion, unresolved. Also possible: - * add_immBlock_pred(res->start_block, res->start_block), but invalid typed. - */ mature_immBlock(res->current_block); /*-- Make a block to start with --*/ first_block = new_immBlock(); + set_cur_block(first_block); add_immBlock_pred(first_block, projX); res->method_execution_frequency = -1.0; @@ -276,9 +284,7 @@ ir_graph *new_r_ir_graph(ir_entity *ent, int n_loc) { return res; } - -ir_graph * -new_ir_graph(ir_entity *ent, int n_loc) { +ir_graph *new_ir_graph(ir_entity *ent, int n_loc) { ir_graph *res = new_r_ir_graph(ent, n_loc); add_irp_irg(res); /* remember this graph global. */ return res; @@ -286,29 +292,27 @@ new_ir_graph(ir_entity *ent, int n_loc) { /* Make a rudimentary IR graph for the constant code. Must look like a correct irg, spare everything else. */ -ir_graph *new_const_code_irg(void) { - ir_graph *res; - ir_node *end, *start_block, *start, *projX; - - res = alloc_graph(); - - /* initialize the idx->node map. */ - res->idx_irn_map = NEW_ARR_F(ir_node *, INITIAL_IDX_IRN_MAP_SIZE); - memset(res->idx_irn_map, 0, INITIAL_IDX_IRN_MAP_SIZE * sizeof(res->idx_irn_map[0])); +ir_graph *new_const_code_irg(void) +{ + ir_graph *res = alloc_graph(); + ir_node *bad; + ir_node *body_block; + ir_node *end; + ir_node *end_block; + ir_node *no_mem; + ir_node *projX; + ir_node *start_block; + ir_node *start; /* inform statistics here, as blocks will be already build on this graph */ hook_new_graph(res, NULL); - current_ir_graph = res; - res->n_loc = 1; /* Only the memory. */ - res->visited = 0; /* visited flag, for the ir walker */ + current_ir_graph = res; + res->n_loc = 1; /* Only the memory. */ + res->visited = 0; /* visited flag, for the ir walker */ res->block_visited = 0; /* visited flag, for the 'block'-walker */ -#if USE_EXPLICIT_PHI_IN_STACK - res->Phi_in_stack = NULL; -#endif - res->kind = k_ir_graph; - res->obst = xmalloc (sizeof(*res->obst)); - obstack_init (res->obst); + res->obst = XMALLOC(struct obstack); + obstack_init(res->obst); res->extbb_obst = NULL; res->last_node_idx = 0; @@ -318,55 +322,203 @@ ir_graph *new_const_code_irg(void) { res->extblk_state = ir_extblk_info_none; res->fp_model = fp_model_precise; - res->value_table = new_identities (); /* value table for global value - numbering for optimizing use in - iropt.c */ - res->ent = NULL; + /* value table for global value numbering for optimizing use in iropt.c */ + res->value_table = new_identities(); + res->ent = NULL; res->frame_type = NULL; /* the Anchor node must be created first */ res->anchor = new_Anchor(res); /* -- The end block -- */ - set_irg_end_block (res, new_immBlock()); + end_block = new_immBlock(); + set_irg_end_block(res, end_block); + set_cur_block(end_block); end = new_End(); set_irg_end (res, end); set_irg_end_reg (res, end); set_irg_end_except(res, end); - mature_immBlock(get_cur_block()); /* mature the end block */ + mature_immBlock(end_block); /* -- The start block -- */ start_block = new_immBlock(); + set_cur_block(start_block); set_irg_start_block(res, start_block); - set_irg_bad (res, new_ir_node (NULL, res, start_block, op_Bad, mode_T, 0, NULL)); - set_irg_no_mem (res, new_ir_node (NULL, res, start_block, op_NoMem, mode_M, 0, NULL)); - start = new_Start(); - set_irg_start (res, start); + bad = new_ir_node(NULL, res, start_block, op_Bad, mode_T, 0, NULL); + bad->attr.irg.irg = res; + set_irg_bad(res, bad); + no_mem = new_ir_node(NULL, res, start_block, op_NoMem, mode_M, 0, NULL); + set_irg_no_mem(res, no_mem); + start = new_Start(); + set_irg_start(res, start); /* Proj results of start node */ set_irg_initial_mem(res, new_Proj(start, mode_M, pn_Start_M)); projX = new_Proj(start, mode_X, pn_Start_X_initial_exec); - add_immBlock_pred(start_block, projX); - mature_immBlock (start_block); /* mature the start block */ + mature_immBlock(start_block); - add_immBlock_pred(new_immBlock(), projX); - mature_immBlock (get_cur_block()); /* mature the 'body' block for expressions */ + body_block = new_immBlock(); + add_immBlock_pred(body_block, projX); + mature_immBlock(body_block); /* mature the 'body' block for expressions */ + set_cur_block(body_block); /* Set the visited flag high enough that the blocks will never be visited. */ - set_irn_visited(get_cur_block(), -1); - set_Block_block_visited(get_cur_block(), -1); + set_irn_visited(body_block, -1); + set_Block_block_visited(body_block, -1); set_Block_block_visited(start_block, -1); set_irn_visited(start_block, -1); - set_irn_visited(get_irg_bad(res), -1); - set_irn_visited(get_irg_no_mem(res), -1); + set_irn_visited(bad, -1); + set_irn_visited(no_mem, -1); res->phase_state = phase_high; return res; } -/* Defined in iropt.c */ -void del_identities (pset *value_table); +/** + * 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 *n, void *env) { + ir_graph *irg = env; + ir_op *op = get_irn_op(n); + ir_node *nn; + + nn = new_ir_node(get_irn_dbg_info(n), + irg, + NULL, /* no block yet, will be set later */ + op, + get_irn_mode(n), + get_irn_arity(n), + get_irn_in(n) + 1); + + + /* 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(n, nn); + new_backedge_info(nn); + set_irn_link(n, nn); + + /* fix the irg for Blocks: as Bad nodes are NOT copied, no + need t fix them */ + if (is_Block(nn)) + nn->attr.block.irg.irg = irg; + + /* fix access to entities on the stack frame */ + if (is_Sel(nn)) { + ir_entity *ent = get_Sel_entity(nn); + ir_type *tp = get_entity_owner(ent); + + if (is_frame_type(tp)) { + /* replace by the copied entity */ + ent = get_entity_link(ent); + + assert(is_entity(ent)); + assert(get_entity_owner(ent) == get_irg_frame_type(irg)); + set_Sel_entity(nn, ent); + } + } +} + +/** + * Post-walker: Set the predecessors of the copied nodes. + * The copied nodes are set as link of their original nodes. The links of + * "irn" predecessors are the predecessors of copied node. + */ +static void set_all_preds(ir_node *irn, void *env) { + int i; + ir_node *nn, *pred; + (void) env; + + nn = get_irn_link(irn); + + if (is_Block(irn)) { + ir_node *mbh = get_Block_MacroBlock(irn); + set_Block_MacroBlock(nn, get_irn_link(mbh)); + for (i = get_Block_n_cfgpreds(irn) - 1; i >= 0; i--) { + pred = get_Block_cfgpred(irn, i); + set_Block_cfgpred(nn, i, get_irn_link(pred)); + } + } else { + /* First we set the block our copy if it is not a block.*/ + set_nodes_block(nn, get_irn_link(get_nodes_block(irn))); + for (i = get_irn_arity(irn) - 1; i >= 0; i--) { + pred = get_irn_n(irn, i); + set_irn_n(nn, i, get_irn_link(pred)); + } + } +} + +#define NN(irn) get_irn_link(irn) + +/* + * Create a new graph that is a copy of a given one. + */ +ir_graph *create_irg_copy(ir_graph *irg) { + ir_graph *res; + + res = alloc_graph(); + + res->n_loc = 0; + res->visited = 0; /* visited flag, for the ir walker */ + res->block_visited = 0; /* visited flag, for the 'block'-walker */ + res->obst = XMALLOC(struct obstack); + obstack_init(res->obst); + res->extbb_obst = NULL; + + res->last_node_idx = 0; + + res->phase_state = irg->phase_state; + res->irg_pinned_state = irg->irg_pinned_state; + res->extblk_state = ir_extblk_info_none; + res->fp_model = irg->fp_model; + + res->value_table = new_identities(); + + /* clone the frame type here for safety */ + irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK); + res->frame_type = clone_frame_type(irg->frame_type); + + res->phase_state = irg->phase_state; + + ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK); + + /* copy all nodes from the graph irg to the new graph res */ + irg_walk_anchors(irg, copy_all_nodes, set_all_preds, res); + + /* copy the Anchor node */ + res->anchor = NN(irg->anchor); + + /* -- The end block -- */ + set_irg_end_block (res, NN(get_irg_end_block(irg))); + set_irg_end (res, NN(get_irg_end(irg))); + set_irg_end_reg (res, NN(get_irg_end_reg(irg))); + set_irg_end_except(res, NN(get_irg_end_except(irg))); + + /* -- The start block -- */ + set_irg_start_block(res, NN(get_irg_start_block(irg))); + set_irg_bad (res, NN(get_irg_bad(irg))); + set_irg_no_mem (res, NN(get_irg_no_mem(irg))); + set_irg_start (res, NN(get_irg_start(irg))); + + /* Proj results of start node */ + set_irg_initial_mem(res, NN(get_irg_initial_mem(irg))); + + /* Copy the node count estimation. Would be strange if this + is different from the original one. */ + res->estimated_node_count = irg->estimated_node_count; + + ir_free_resources(irg, IR_RESOURCE_IRN_LINK); + irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK); + + return res; +} +#undef NN + /* Frees the passed irgraph. Deallocates all nodes in this graph and the ir_graph structure. @@ -375,26 +527,26 @@ void del_identities (pset *value_table); inefficient search, call remove_irp_irg by hand). Does not free types, entities or modes that are used only by this graph, nor the entity standing for this graph. */ -void free_ir_graph (ir_graph *irg) { +void free_ir_graph(ir_graph *irg) +{ assert(is_ir_graph(irg)); + edges_deactivate(irg); + hook_free_graph(irg); - if (irg->outs_state != outs_none) free_irg_outs(irg); - if (irg->frame_type) free_type(irg->frame_type); - if (irg->value_table) del_identities(irg->value_table); + if (irg->outs_state != outs_none) + free_irg_outs(irg); + if (irg->frame_type) + free_type(irg->frame_type); + if (irg->value_table) + del_identities(irg->value_table); if (irg->ent) { - ir_peculiarity pec = get_entity_peculiarity (irg->ent); - set_entity_peculiarity (irg->ent, peculiarity_description); set_entity_irg(irg->ent, NULL); /* not set in const code irg */ - set_entity_peculiarity (irg->ent, pec); } free_End(get_irg_end(irg)); obstack_free(irg->obst,NULL); free(irg->obst); -#if USE_EXPLICIT_PHI_IN_STACK - free_Phi_in_stack(irg->Phi_in_stack); -#endif if (irg->loc_descriptions) free(irg->loc_descriptions); irg->kind = k_BAD; @@ -411,14 +563,23 @@ int return _is_ir_graph(thing); } -/* Outputs a unique number for this node */ -long get_irg_graph_nr(ir_graph *irg) { - assert(irg); #ifdef DEBUG_libfirm +/* Outputs a unique number for this node */ +long get_irg_graph_nr(const ir_graph *irg) { return irg->graph_nr; +} #else - return (long)PTR_TO_INT(irg); +long get_irg_graph_nr(const ir_graph *irg) { + return PTR_TO_INT(irg); +} #endif + +int get_irg_idx(const ir_graph *irg) { + return irg->index; +} + +ir_node *(get_idx_irn)(ir_graph *irg, unsigned idx) { + return _get_idx_irn(irg, idx); } ir_node * @@ -478,28 +639,28 @@ ir_node * void (set_irg_end_except)(ir_graph *irg, ir_node *node) { - assert(get_irn_op(node) == op_EndExcept || get_irn_op(node) == op_End); + assert(get_irn_op(node) == op_EndExcept || is_End(node)); _set_irg_end_except(irg, node); } ir_node * -(get_irg_frame)(const ir_graph *irg) { - return _get_irg_frame(irg); +(get_irg_initial_exec)(const ir_graph *irg) { + return _get_irg_initial_exec(irg); } void -(set_irg_frame)(ir_graph *irg, ir_node *node) { - _set_irg_frame(irg, node); +(set_irg_initial_exec)(ir_graph *irg, ir_node *node) { + _set_irg_initial_exec(irg, node); } ir_node * -(get_irg_globals)(const ir_graph *irg) { - return _get_irg_globals(irg); +(get_irg_frame)(const ir_graph *irg) { + return _get_irg_frame(irg); } void -(set_irg_globals)(ir_graph *irg, ir_node *node) { - _set_irg_globals(irg, node); +(set_irg_frame)(ir_graph *irg, ir_node *node) { + _set_irg_frame(irg, node); } ir_node * @@ -532,26 +693,6 @@ void _set_irg_args(irg, node); } -ir_node * -(get_irg_value_param_base)(const ir_graph *irg) { - return _get_irg_value_param_base(irg); -} - -void -(set_irg_value_param_base)(ir_graph *irg, ir_node *node) { - _set_irg_value_param_base(irg, node); -} - -ir_node ** -(get_irg_proj_args) (const ir_graph *irg) { - return _get_irg_proj_args (irg); -} - -void -(set_irg_proj_args) (ir_graph *irg, ir_node **nodes) { - _set_irg_proj_args (irg, nodes); -} - ir_node * (get_irg_bad)(const ir_graph *irg) { return _get_irg_bad(irg); @@ -602,6 +743,13 @@ void _set_irg_frame_type(irg, ftp); } +/* Returns the value parameter type of an IR graph. */ +ir_type *get_irg_value_param_type(ir_graph *irg) { + ir_entity *ent = get_irg_entity(irg); + ir_type *mtp = get_entity_type(ent); + return get_method_value_param_type(mtp); +} + int get_irg_n_locs(ir_graph *irg) { if (get_opt_precise_exc_context()) @@ -770,60 +918,57 @@ void * return _get_irg_link(irg); } -/** maximum visited flag content of all ir_graph visited fields. */ -static unsigned long max_irg_visited = 0; - -unsigned long +ir_visited_t (get_irg_visited)(const ir_graph *irg) { return _get_irg_visited(irg); } -void -set_irg_visited(ir_graph *irg, unsigned long visited) { +/** maximum visited flag content of all ir_graph visited fields. */ +static ir_visited_t max_irg_visited = 0; + +void set_irg_visited(ir_graph *irg, ir_visited_t visited) +{ irg->visited = visited; if (irg->visited > max_irg_visited) { max_irg_visited = irg->visited; } } -void -inc_irg_visited(ir_graph *irg) { - if (++irg->visited > max_irg_visited) { +void inc_irg_visited(ir_graph *irg) +{ + ++irg->visited; + if (irg->visited > max_irg_visited) { max_irg_visited = irg->visited; } } -unsigned long -get_max_irg_visited(void) { - /* - int i; - for(i = 0; i < get_irp_n_irgs(); i++) - assert(max_irg_visited >= get_irg_visited(get_irp_irg(i))); - */ +ir_visited_t get_max_irg_visited(void) +{ return max_irg_visited; } -void set_max_irg_visited(int val) { +void set_max_irg_visited(int val) +{ max_irg_visited = val; } -unsigned long -inc_max_irg_visited(void) { - /* +ir_visited_t inc_max_irg_visited(void) +{ +#ifndef NDEBUG int i; for(i = 0; i < get_irp_n_irgs(); i++) - assert(max_irg_visited >= get_irg_visited(get_irp_irg(i))); - */ + assert(max_irg_visited >= get_irg_visited(get_irp_irg(i))); +#endif return ++max_irg_visited; } -unsigned long +ir_visited_t (get_irg_block_visited)(const ir_graph *irg) { return _get_irg_block_visited(irg); } void -(set_irg_block_visited)(ir_graph *irg, unsigned long visited) { +(set_irg_block_visited)(ir_graph *irg, ir_visited_t visited) { _set_irg_block_visited(irg, visited); } @@ -870,7 +1015,7 @@ void set_irg_loc_description(ir_graph *irg, int n, void *description) { assert(0 <= n && n < irg->n_loc); if (! irg->loc_descriptions) - irg->loc_descriptions = xcalloc(sizeof(*irg->loc_descriptions), irg->n_loc); + irg->loc_descriptions = XMALLOCNZ(void*, irg->n_loc); irg->loc_descriptions[n] = description; } @@ -882,50 +1027,21 @@ void *get_irg_loc_description(ir_graph *irg, int n) { } #ifndef NDEBUG -void set_using_block_visited(ir_graph *irg) { - assert(irg->using_block_visited == 0); - irg->using_block_visited = 1; +void ir_reserve_resources(ir_graph *irg, ir_resources_t resources) { + assert((resources & ~IR_RESOURCE_LOCAL_MASK) == 0); + assert((irg->reserved_resources & resources) == 0); + irg->reserved_resources |= resources; } -void clear_using_block_visited(ir_graph *irg) { - assert(irg->using_block_visited == 1); - irg->using_block_visited = 0; +void ir_free_resources(ir_graph *irg, ir_resources_t resources) { + assert((irg->reserved_resources & resources) == resources); + irg->reserved_resources &= ~resources; } -int using_block_visited(const ir_graph *irg) { - return irg->using_block_visited; +ir_resources_t ir_resources_reserved(const ir_graph *irg) { + return irg->reserved_resources; } - - -void set_using_visited(ir_graph *irg) { - assert(irg->using_visited == 0); - irg->using_visited = 1; -} - -void clear_using_visited(ir_graph *irg) { - assert(irg->using_visited == 1); - irg->using_visited = 0; -} - -int using_visited(const ir_graph *irg) { - return irg->using_visited; -} - - -void set_using_irn_link(ir_graph *irg) { - assert(irg->using_irn_link == 0); - irg->using_irn_link = 1; -} - -void clear_using_irn_link(ir_graph *irg) { - assert(irg->using_irn_link == 1); - irg->using_irn_link = 0; -} - -int using_irn_link(const ir_graph *irg) { - return irg->using_irn_link; -} -#endif +#endif /* NDEBUG */ /* Returns a estimated node count of the irg. */ unsigned (get_irg_estimated_node_cnt)(const ir_graph *irg) { @@ -946,3 +1062,18 @@ size_t register_additional_graph_data(size_t size) { return additional_graph_data_size += size; } + +void (set_irg_state)(ir_graph *irg, ir_graph_state_t state) +{ + _set_irg_state(irg, state); +} + +void (clear_irg_state)(ir_graph *irg, ir_graph_state_t state) +{ + _clear_irg_state(irg, state); +} + +int (is_irg_state)(const ir_graph *irg, ir_graph_state_t state) +{ + return _is_irg_state(irg, state); +}