X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=84d149ecb25ec54e9239bb705cbe1460b5816d35;hb=62038ec14e9c072a91b13270058bb18958027aa8;hp=7a6fb311851603c2a0e18d749e9f0c9a02bccaf7;hpb=b7dd849f8dd4bf73629adffec3fbe19bed0e458b;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 7a6fb3118..84d149ecb 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.c @@ -21,7 +21,6 @@ * @file * @brief Representation of an intermediate operation. * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck - * @version $Id$ */ #include "config.h" @@ -90,7 +89,8 @@ ir_relation get_inversed_relation(ir_relation relation) ir_relation code = relation & ~(ir_relation_less|ir_relation_greater); bool less = relation & ir_relation_less; bool greater = relation & ir_relation_greater; - code |= (less ? ir_relation_greater : 0) | (greater ? ir_relation_less : 0); + code |= (less ? ir_relation_greater : ir_relation_false) + | (greater ? ir_relation_less : ir_relation_false); return code; } @@ -100,14 +100,9 @@ ir_relation get_inversed_relation(ir_relation relation) */ static int forbid_new_data = 0; -/** - * The amount of additional space for custom data to be allocated upon - * creating a new node. - */ unsigned firm_add_node_size = 0; -/* register new space for every node */ unsigned firm_register_additional_node_data(unsigned size) { assert(!forbid_new_data && "Too late to register additional node data"); @@ -134,12 +129,6 @@ struct struct_align { } s; }; -/* - * irnode constructor. - * Create a new irnode in irg, with an op, mode, arity and - * some incoming irnodes. - * If arity is negative, a node with a dynamic array is created. - */ ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode, int arity, ir_node *const *in) { @@ -195,30 +184,22 @@ ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, hook_new_node(irg, res); if (get_irg_phase_state(irg) == phase_backend) { - be_info_new_node(res); + be_info_new_node(irg, res); } return res; } -/*-- getting some parameters from ir_nodes --*/ - int (is_ir_node)(const void *thing) { - return _is_ir_node(thing); + return is_ir_node_(thing); } int (get_irn_arity)(const ir_node *node) { - return _get_irn_arity(node); + return get_irn_arity_(node); } -/* Returns the array with ins. This array is shifted with respect to the - array accessed by get_irn_n: The block operand is at position 0 not -1. - (@@@ This should be changed.) - The order of the predecessors in this array is not guaranteed, except that - lists of operands as predecessors of Block or arguments of a Call are - consecutive. */ ir_node **get_irn_in(const ir_node *node) { return node->in; @@ -232,6 +213,13 @@ void set_irn_in(ir_node *node, int arity, ir_node **in) pOld_in = &node->in; +#ifndef NDEBUG + assert(node != NULL && node->kind == k_ir_node); + assert(arity >= 0); + for (i = 0; i < arity; ++i) { + assert(in[i] != NULL && in[0]->kind == k_ir_node); + } +#endif for (i = 0; i < arity; i++) { if (i < (int)ARR_LEN(*pOld_in)-1) @@ -253,13 +241,12 @@ void set_irn_in(ir_node *node, int arity, ir_node **in) memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity); /* update irg flags */ - set_irg_outs_inconsistent(irg); - set_irg_loopinfo_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO); } ir_node *(get_irn_n)(const ir_node *node, int n) { - return _get_irn_n(node, n); + return get_irn_n_(node, n); } void set_irn_n(ir_node *node, int n, ir_node *in) @@ -279,8 +266,7 @@ void set_irn_n(ir_node *node, int n, ir_node *in) node->in[n + 1] = in; /* update irg flags */ - set_irg_outs_inconsistent(irg); - set_irg_loopinfo_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO); } int add_irn_n(ir_node *node, ir_node *in) @@ -310,52 +296,58 @@ void del_Sync_n(ir_node *n, int i) int (get_irn_deps)(const ir_node *node) { - return _get_irn_deps(node); + return get_irn_deps_(node); } ir_node *(get_irn_dep)(const ir_node *node, int pos) { - return _get_irn_dep(node, pos); + return get_irn_dep_(node, pos); } -void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) +void set_irn_dep(ir_node *node, int pos, ir_node *dep) { - _set_irn_dep(node, pos, dep); + ir_node *old; + ir_graph *irg; + + assert(node->deps && "dependency array node yet allocated. use add_irn_dep()"); + assert(pos >= 0 && pos < (int)ARR_LEN(node->deps) && "dependency index out of range"); + assert(dep != NULL); + old = node->deps[pos]; + node->deps[pos] = dep; + irg = get_irn_irg(node); + if (edges_activated_kind(irg, EDGE_KIND_DEP)) + edges_notify_edge_kind(node, pos, dep, old, EDGE_KIND_DEP, irg); } -int add_irn_dep(ir_node *node, ir_node *dep) +void add_irn_dep(ir_node *node, ir_node *dep) { - int res = 0; - - /* DEP edges are only allowed in backend phase */ - assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend); + ir_graph *irg; + assert(dep != NULL); if (node->deps == NULL) { - node->deps = NEW_ARR_F(ir_node *, 1); - node->deps[0] = dep; - } else { - int i, n; - int first_zero = -1; - - for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) { - if (node->deps[i] == NULL) - first_zero = i; + node->deps = NEW_ARR_F(ir_node *, 0); + } + ARR_APP1(ir_node*, node->deps, dep); + irg = get_irn_irg(node); + if (edges_activated_kind(irg, EDGE_KIND_DEP)) + edges_notify_edge_kind(node, ARR_LEN(node->deps)-1, dep, NULL, EDGE_KIND_DEP, irg); +} - if (node->deps[i] == dep) - return i; - } +void delete_irn_dep(ir_node *node, ir_node *dep) +{ + size_t i; + size_t n_deps; + if (node->deps == NULL) + return; - if (first_zero >= 0) { - node->deps[first_zero] = dep; - res = first_zero; - } else { - ARR_APP1(ir_node *, node->deps, dep); - res = n; + n_deps = ARR_LEN(node->deps); + for (i = 0; i < n_deps; ++i) { + if (node->deps[i] == dep) { + set_irn_dep(node, i, node->deps[n_deps-1]); + edges_notify_edge(node, i, NULL, dep, get_irn_irg(node)); + ARR_SHRINKLEN(node->deps, n_deps-1); + break; } } - - edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node)); - - return res; } void add_irn_deps(ir_node *tgt, ir_node *src) @@ -369,34 +361,31 @@ void add_irn_deps(ir_node *tgt, ir_node *src) ir_mode *(get_irn_mode)(const ir_node *node) { - return _get_irn_mode(node); + return get_irn_mode_(node); } void (set_irn_mode)(ir_node *node, ir_mode *mode) { - _set_irn_mode(node, mode); + set_irn_mode_(node, mode); } ir_op *(get_irn_op)(const ir_node *node) { - return _get_irn_op(node); + return get_irn_op_(node); } -/* should be private to the library: */ void (set_irn_op)(ir_node *node, ir_op *op) { - _set_irn_op(node, op); + set_irn_op_(node, op); } unsigned (get_irn_opcode)(const ir_node *node) { - return _get_irn_opcode(node); + return get_irn_opcode_(node); } const char *get_irn_opname(const ir_node *node) { - assert(node); - if (is_Phi0(node)) return "Phi0"; return get_id_str(node->op->name); } @@ -408,47 +397,47 @@ ident *get_irn_opident(const ir_node *node) ir_visited_t (get_irn_visited)(const ir_node *node) { - return _get_irn_visited(node); + return get_irn_visited_(node); } void (set_irn_visited)(ir_node *node, ir_visited_t visited) { - _set_irn_visited(node, visited); + set_irn_visited_(node, visited); } void (mark_irn_visited)(ir_node *node) { - _mark_irn_visited(node); + mark_irn_visited_(node); } int (irn_visited)(const ir_node *node) { - return _irn_visited(node); + return irn_visited_(node); } int (irn_visited_else_mark)(ir_node *node) { - return _irn_visited_else_mark(node); + return irn_visited_else_mark_(node); } void (set_irn_link)(ir_node *node, void *link) { - _set_irn_link(node, link); + set_irn_link_(node, link); } void *(get_irn_link)(const ir_node *node) { - return _get_irn_link(node); + return get_irn_link_(node); } op_pin_state (get_irn_pinned)(const ir_node *node) { - return _get_irn_pinned(node); + return get_irn_pinned_(node); } op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) { - return _is_irn_pinned_in_irg(node); + return is_irn_pinned_in_irg_(node); } void set_irn_pinned(ir_node *node, op_pin_state state) @@ -463,7 +452,6 @@ void set_irn_pinned(ir_node *node, op_pin_state state) node->attr.except.pin_state = state; } -/* Outputs a unique number for this node */ long get_irn_node_nr(const ir_node *node) { assert(node); @@ -473,19 +461,19 @@ long get_irn_node_nr(const ir_node *node) void *(get_irn_generic_attr)(ir_node *node) { assert(is_ir_node(node)); - return _get_irn_generic_attr(node); + return get_irn_generic_attr_(node); } const void *(get_irn_generic_attr_const)(const ir_node *node) { assert(is_ir_node(node)); - return _get_irn_generic_attr_const(node); + return get_irn_generic_attr_const_(node); } unsigned (get_irn_idx)(const ir_node *node) { assert(is_ir_node(node)); - return _get_irn_idx(node); + return get_irn_idx_(node); } int get_irn_pred_pos(ir_node *node, ir_node *arg) @@ -498,11 +486,9 @@ int get_irn_pred_pos(ir_node *node, ir_node *arg) return -1; } -/** manipulate fields of individual nodes **/ - ir_node *(get_nodes_block)(const ir_node *node) { - return _get_nodes_block(node); + return get_nodes_block_(node); } void set_nodes_block(ir_node *node, ir_node *block) @@ -511,8 +497,6 @@ void set_nodes_block(ir_node *node, ir_node *block) set_irn_n(node, -1, block); } -/* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base) - * from Start. If so returns frame type, else Null. */ ir_type *is_frame_pointer(const ir_node *n) { if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) { @@ -532,12 +516,12 @@ ir_node **get_Block_cfgpred_arr(ir_node *node) int (get_Block_n_cfgpreds)(const ir_node *node) { - return _get_Block_n_cfgpreds(node); + return get_Block_n_cfgpreds_(node); } ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) { - return _get_Block_cfgpred(node, pos); + return get_Block_cfgpred_(node, pos); } void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) @@ -559,7 +543,7 @@ int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred) ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) { - return _get_Block_cfgpred_block(node, pos); + return get_Block_cfgpred_block_(node, pos); } int get_Block_matured(const ir_node *node) @@ -576,44 +560,27 @@ void set_Block_matured(ir_node *node, int matured) ir_visited_t (get_Block_block_visited)(const ir_node *node) { - return _get_Block_block_visited(node); + return get_Block_block_visited_(node); } void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) { - _set_Block_block_visited(node, visit); + set_Block_block_visited_(node, visit); } void (mark_Block_block_visited)(ir_node *node) { - _mark_Block_block_visited(node); + mark_Block_block_visited_(node); } int (Block_block_visited)(const ir_node *node) { - return _Block_block_visited(node); -} - -ir_extblk *get_Block_extbb(const ir_node *block) -{ - ir_extblk *res; - assert(is_Block(block)); - res = block->attr.block.extblk; - assert(res == NULL || is_ir_extbb(res)); - return res; -} - -void set_Block_extbb(ir_node *block, ir_extblk *extblk) -{ - assert(is_Block(block)); - assert(extblk == NULL || is_ir_extbb(extblk)); - block->attr.block.extblk = extblk; + return Block_block_visited_(node); } -/* returns the graph of a Block. */ ir_graph *(get_Block_irg)(const ir_node *block) { - return _get_Block_irg(block); + return get_Block_irg_(block); } ir_entity *create_Block_entity(ir_node *block) @@ -623,15 +590,10 @@ ir_entity *create_Block_entity(ir_node *block) entity = block->attr.block.entity; if (entity == NULL) { - ir_label_t nr; - ir_type *glob; - - glob = get_glob_type(); - entity = new_entity(glob, id_unique("block_%u"), get_code_type()); + ir_label_t nr = get_irp_next_label_nr(); + entity = new_label_entity(nr); set_entity_visibility(entity, ir_visibility_local); set_entity_linkage(entity, IR_LINKAGE_CONSTANT); - nr = get_irp_next_label_nr(); - set_entity_label(entity, nr); set_entity_compiler_generated(entity, 1); block->attr.block.entity = entity; @@ -639,49 +601,29 @@ ir_entity *create_Block_entity(ir_node *block) return entity; } -ir_entity *get_Block_entity(const ir_node *block) -{ - assert(is_Block(block)); - return block->attr.block.entity; -} - -void set_Block_entity(ir_node *block, ir_entity *entity) -{ - assert(is_Block(block)); - assert(get_entity_type(entity) == get_code_type()); - block->attr.block.entity = entity; -} - -int has_Block_entity(const ir_node *block) -{ - return block->attr.block.entity != NULL; -} - ir_node *(get_Block_phis)(const ir_node *block) { - return _get_Block_phis(block); + return get_Block_phis_(block); } void (set_Block_phis)(ir_node *block, ir_node *phi) { - _set_Block_phis(block, phi); + set_Block_phis_(block, phi); } void (add_Block_phi)(ir_node *block, ir_node *phi) { - _add_Block_phi(block, phi); + add_Block_phi_(block, phi); } -/* Get the Block mark (single bit). */ unsigned (get_Block_mark)(const ir_node *block) { - return _get_Block_mark(block); + return get_Block_mark_(block); } -/* Set the Block mark (single bit). */ void (set_Block_mark)(ir_node *block, unsigned mark) { - _set_Block_mark(block, mark); + set_Block_mark_(block, mark); } int get_End_n_keepalives(const ir_node *end) @@ -708,7 +650,6 @@ void set_End_keepalive(ir_node *end, int pos, ir_node *ka) set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka); } -/* Set new keep-alives */ void set_End_keepalives(ir_node *end, int n, ir_node *in[]) { size_t e; @@ -727,10 +668,9 @@ void set_End_keepalives(ir_node *end, int n, ir_node *in[]) } /* update irg flags */ - set_irg_outs_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS); } -/* Set new keep-alives from old keep-alives, skipping irn */ void remove_End_keepalive(ir_node *end, ir_node *irn) { int n = get_End_n_keepalives(end); @@ -765,10 +705,9 @@ found: ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET); /* update irg flags */ - set_irg_outs_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS); } -/* remove Bads, NoMems and doublets from the keep-alive set */ void remove_End_Bads_and_doublets(ir_node *end) { pset_new_t keeps; @@ -808,7 +747,7 @@ void remove_End_Bads_and_doublets(ir_node *end) pset_new_destroy(&keeps); if (changed) { - set_irg_outs_inconsistent(irg); + clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS); } } @@ -852,17 +791,17 @@ void set_Return_res(ir_node *node, int pos, ir_node *res) int (is_Const_null)(const ir_node *node) { - return _is_Const_null(node); + return is_Const_null_(node); } int (is_Const_one)(const ir_node *node) { - return _is_Const_one(node); + return is_Const_one_(node); } int (is_Const_all_one)(const ir_node *node) { - return _is_Const_all_one(node); + return is_Const_all_one_(node); } @@ -896,8 +835,6 @@ void set_SymConst_type(ir_node *node, ir_type *tp) node->attr.symc.sym.type_p = tp; } - -/* Only to access SymConst of kind symconst_addr_ent. Else assertion: */ ir_entity *get_SymConst_entity(const ir_node *node) { assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node))); @@ -1010,7 +947,6 @@ void set_Builtin_param(ir_node *node, int pos, ir_node *param) set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param); } -/* Returns a human readable string for the ir_builtin_kind. */ const char *get_builtin_kind_name(ir_builtin_kind kind) { #define X(a) case a: return #a @@ -1071,27 +1007,6 @@ void remove_Call_callee_arr(ir_node *node) node->attr.call.callee_arr = NULL; } -/* - * Returns non-zero if a Call is surely a self-recursive Call. - * Beware: if this functions returns 0, the call might be self-recursive! - */ -int is_self_recursive_Call(const ir_node *call) -{ - const ir_node *callee = get_Call_ptr(call); - - if (is_SymConst_addr_ent(callee)) { - const ir_entity *ent = get_SymConst_entity(callee); - const ir_graph *irg = get_entity_irg(ent); - if (irg == get_irn_irg(call)) - return 1; - } - return 0; -} - -/* Checks for upcast. - * - * Returns true if the Cast node casts a class type to a super type. - */ int is_Cast_upcast(ir_node *node) { ir_type *totype = get_Cast_type(node); @@ -1111,10 +1026,6 @@ int is_Cast_upcast(ir_node *node) return is_SubClass_of(fromtype, totype); } -/* Checks for downcast. - * - * Returns true if the Cast node casts a class type to a sub type. - */ int is_Cast_downcast(ir_node *node) { ir_type *totype = get_Cast_type(node); @@ -1136,7 +1047,7 @@ int is_Cast_downcast(ir_node *node) int (is_unop)(const ir_node *node) { - return _is_unop(node); + return is_unop_(node); } ir_node *get_unop_op(const ir_node *node) @@ -1158,7 +1069,7 @@ void set_unop_op(ir_node *node, ir_node *op) int (is_binop)(const ir_node *node) { - return _is_binop(node); + return is_binop_(node); } ir_node *get_binop_left(const ir_node *node) @@ -1185,15 +1096,6 @@ void set_binop_right(ir_node *node, ir_node *right) set_irn_n(node, node->op->op_index + 1, right); } -int is_Phi0(const ir_node *n) -{ - assert(n); - - return ((get_irn_op(n) == op_Phi) && - (get_irn_arity(n) == 0) && - (get_irg_phase_state(get_irn_irg(n)) == phase_building)); -} - ir_node **get_Phi_preds_arr(ir_node *node) { assert(is_Phi(node)); @@ -1202,67 +1104,51 @@ ir_node **get_Phi_preds_arr(ir_node *node) int get_Phi_n_preds(const ir_node *node) { - assert(is_Phi(node) || is_Phi0(node)); - return (get_irn_arity(node)); + assert(is_Phi(node)); + return get_irn_arity(node); } ir_node *get_Phi_pred(const ir_node *node, int pos) { - assert(is_Phi(node) || is_Phi0(node)); + assert(is_Phi(node)); return get_irn_n(node, pos); } void set_Phi_pred(ir_node *node, int pos, ir_node *pred) { - assert(is_Phi(node) || is_Phi0(node)); + assert(is_Phi(node)); set_irn_n(node, pos, pred); } ir_node *(get_Phi_next)(const ir_node *phi) { - return _get_Phi_next(phi); + return get_Phi_next_(phi); } void (set_Phi_next)(ir_node *phi, ir_node *next) { - _set_Phi_next(phi, next); + set_Phi_next_(phi, next); } int is_memop(const ir_node *node) { - unsigned code = get_irn_opcode(node); - return (code == iro_Load || code == iro_Store); + return is_op_uses_memory(get_irn_op(node)); } ir_node *get_memop_mem(const ir_node *node) { + const ir_op *op = get_irn_op(node); assert(is_memop(node)); - assert(n_Load_mem == 0 && n_Store_mem == 0); - return get_irn_n(node, 0); + return get_irn_n(node, op->memory_index); } void set_memop_mem(ir_node *node, ir_node *mem) { + const ir_op *op = get_irn_op(node); assert(is_memop(node)); - assert(n_Load_mem == 0 && n_Store_mem == 0); - set_irn_n(node, 0, mem); -} - -ir_node *get_memop_ptr(const ir_node *node) -{ - assert(is_memop(node)); - assert(n_Load_mem == 1 && n_Store_mem == 1); - return get_irn_n(node, 1); -} - -void set_memop_ptr(ir_node *node, ir_node *ptr) -{ - assert(is_memop(node)); - assert(n_Load_mem == 1 && n_Store_mem == 1); - set_irn_n(node, 1, ptr); + set_irn_n(node, op->memory_index, mem); } - ir_node **get_Sync_preds_arr(ir_node *node) { assert(is_Sync(node)); @@ -1275,13 +1161,6 @@ int get_Sync_n_preds(const ir_node *node) return (get_irn_arity(node)); } -/* -void set_Sync_n_preds(ir_node *node, int n_preds) -{ - assert(is_Sync(node)); -} -*/ - ir_node *get_Sync_pred(const ir_node *node, int pos) { assert(is_Sync(node)); @@ -1294,7 +1173,6 @@ void set_Sync_pred(ir_node *node, int pos, ir_node *pred) set_irn_n(node, pos, pred); } -/* Add a new Sync predecessor */ void add_Sync_pred(ir_node *node, ir_node *pred) { assert(is_Sync(node)); @@ -1303,7 +1181,7 @@ void add_Sync_pred(ir_node *node, ir_node *pred) int (is_arg_Proj)(const ir_node *node) { - return _is_arg_Proj(node); + return is_arg_Proj_(node); } int is_x_except_Proj(const ir_node *node) @@ -1328,6 +1206,20 @@ int is_x_regular_Proj(const ir_node *node) return get_Proj_proj(node) == pred->op->pn_x_regular; } +void ir_set_throws_exception(ir_node *node, int throws_exception) +{ + except_attr *attr = &node->attr.except; + assert(is_fragile_op(node)); + attr->throws_exception = throws_exception; +} + +int ir_throws_exception(const ir_node *node) +{ + const except_attr *attr = &node->attr.except; + assert(is_fragile_op(node)); + return attr->throws_exception; +} + ir_node **get_Tuple_preds_arr(ir_node *node) { assert(is_Tuple(node)); @@ -1352,35 +1244,29 @@ void set_Tuple_pred(ir_node *node, int pos, ir_node *pred) set_irn_n(node, pos, pred); } -int get_ASM_n_input_constraints(const ir_node *node) +size_t get_ASM_n_input_constraints(const ir_node *node) { assert(is_ASM(node)); return ARR_LEN(node->attr.assem.input_constraints); } -int get_ASM_n_output_constraints(const ir_node *node) +size_t get_ASM_n_output_constraints(const ir_node *node) { assert(is_ASM(node)); return ARR_LEN(node->attr.assem.output_constraints); } -int get_ASM_n_clobbers(const ir_node *node) +size_t get_ASM_n_clobbers(const ir_node *node) { assert(is_ASM(node)); return ARR_LEN(node->attr.assem.clobbers); } -/* returns the graph of a node */ ir_graph *(get_irn_irg)(const ir_node *node) { - return _get_irn_irg(node); + return get_irn_irg_(node); } - -/*----------------------------------------------------------------*/ -/* Auxiliary routines */ -/*----------------------------------------------------------------*/ - ir_node *skip_Proj(ir_node *node) { /* don't assert node !!! */ @@ -1429,7 +1315,6 @@ restart: return node; } -/* returns operand of node if node is a Cast */ ir_node *skip_Cast(ir_node *node) { if (is_Cast(node)) @@ -1437,7 +1322,6 @@ ir_node *skip_Cast(ir_node *node) return node; } -/* returns operand of node if node is a Cast */ const ir_node *skip_Cast_const(const ir_node *node) { if (is_Cast(node)) @@ -1445,7 +1329,6 @@ const ir_node *skip_Cast_const(const ir_node *node) return node; } -/* returns operand of node if node is a Pin */ ir_node *skip_Pin(ir_node *node) { if (is_Pin(node)) @@ -1453,7 +1336,6 @@ ir_node *skip_Pin(ir_node *node) return node; } -/* returns operand of node if node is a Confirm */ ir_node *skip_Confirm(ir_node *node) { if (is_Confirm(node)) @@ -1461,7 +1343,6 @@ ir_node *skip_Confirm(ir_node *node) return node; } -/* skip all high-level ops */ ir_node *skip_HighLevel_ops(ir_node *node) { while (is_op_highlevel(get_irn_op(node))) { @@ -1471,15 +1352,15 @@ ir_node *skip_HighLevel_ops(ir_node *node) } -/* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity - * than any other approach, as Id chains are resolved and all point to the real node, or - * all id's are self loops. - * - * Note: This function takes 10% of mostly ANY the compiler run, so it's - * a little bit "hand optimized". - */ ir_node *skip_Id(ir_node *node) { + /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity + * than any other approach, as Id chains are resolved and all point to the real node, or + * all id's are self loops. + * + * Note: This function takes 10% of mostly ANY the compiler run, so it's + * a little bit "hand optimized". + */ ir_node *pred; /* don't assert node !!! */ @@ -1512,18 +1393,19 @@ ir_node *skip_Id(ir_node *node) int (is_strictConv)(const ir_node *node) { - return _is_strictConv(node); + return is_strictConv_(node); } -/* Returns true if node is a SymConst node with kind symconst_addr_ent. */ int (is_SymConst_addr_ent)(const ir_node *node) { - return _is_SymConst_addr_ent(node); + return is_SymConst_addr_ent_(node); } -/* Returns true if the operation manipulates control flow. */ int is_cfop(const ir_node *node) { + if (is_fragile_op(node) && ir_throws_exception(node)) + return true; + return is_op_cfopcode(get_irn_op(node)); } @@ -1532,92 +1414,51 @@ int is_unknown_jump(const ir_node *node) return is_op_unknown_jump(get_irn_op(node)); } -/* Returns true if the operation can change the control flow because - of an exception. */ int is_fragile_op(const ir_node *node) { return is_op_fragile(get_irn_op(node)); } -/* Returns the memory operand of fragile operations. */ -ir_node *get_fragile_op_mem(ir_node *node) -{ - assert(node && is_fragile_op(node)); - return get_irn_n(node, node->op->fragile_mem_index); -} - -/* Returns true if the operation is a forking control flow operation. */ int (is_irn_forking)(const ir_node *node) { - return _is_irn_forking(node); + return is_irn_forking_(node); } void (copy_node_attr)(ir_graph *irg, const ir_node *old_node, ir_node *new_node) { - _copy_node_attr(irg, old_node, new_node); + copy_node_attr_(irg, old_node, new_node); } -/* Return the type attribute of a node n (SymConst, Call, Alloc, Free, - Cast) or NULL.*/ ir_type *(get_irn_type_attr)(ir_node *node) { - return _get_irn_type_attr(node); + return get_irn_type_attr_(node); } -/* Return the entity attribute of a node n (SymConst, Sel) or NULL. */ ir_entity *(get_irn_entity_attr)(ir_node *node) { - return _get_irn_entity_attr(node); + return get_irn_entity_attr_(node); } -/* Returns non-zero for constant-like nodes. */ int (is_irn_constlike)(const ir_node *node) { - return _is_irn_constlike(node); + return is_irn_constlike_(node); } -/* - * Returns non-zero for nodes that are allowed to have keep-alives and - * are neither Block nor PhiM. - */ int (is_irn_keep)(const ir_node *node) { - return _is_irn_keep(node); + return is_irn_keep_(node); } -/* - * Returns non-zero for nodes that are always placed in the start block. - */ int (is_irn_start_block_placed)(const ir_node *node) { - return _is_irn_start_block_placed(node); -} - -/* Returns non-zero for nodes that are machine operations. */ -int (is_irn_machine_op)(const ir_node *node) -{ - return _is_irn_machine_op(node); -} - -/* Returns non-zero for nodes that are machine operands. */ -int (is_irn_machine_operand)(const ir_node *node) -{ - return _is_irn_machine_operand(node); + return is_irn_start_block_placed_(node); } -/* Returns non-zero for nodes that have the n'th user machine flag set. */ -int (is_irn_machine_user)(const ir_node *node, unsigned n) -{ - return _is_irn_machine_user(node, n); -} - -/* Returns non-zero for nodes that are CSE neutral to its users. */ int (is_irn_cse_neutral)(const ir_node *node) { - return _is_irn_cse_neutral(node); + return is_irn_cse_neutral_(node); } -/* Gets the string representation of the jump prediction .*/ const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) { #define X(a) case a: return #a @@ -1648,108 +1489,93 @@ static ir_entity *get_SymConst_attr_entity(const ir_node *self) return NULL; } -/** the get_type_attr operation must be always implemented */ -static ir_type *get_Null_type(const ir_node *n) +static void register_get_type_func(ir_op *op, get_type_attr_func func) { - (void) n; - return firm_unknown_type; + op->ops.get_type_attr = func; } -/* Sets the get_type operation for an ir_op_ops. */ -ir_op_ops *firm_set_default_get_type_attr(unsigned code, ir_op_ops *ops) +static void register_get_entity_func(ir_op *op, get_entity_attr_func func) { - switch (code) { - case iro_SymConst: ops->get_type_attr = get_SymConst_attr_type; break; - case iro_Call: ops->get_type_attr = get_Call_type; break; - case iro_Alloc: ops->get_type_attr = get_Alloc_type; break; - case iro_Free: ops->get_type_attr = get_Free_type; break; - case iro_Cast: ops->get_type_attr = get_Cast_type; break; - default: - /* not allowed to be NULL */ - if (! ops->get_type_attr) - ops->get_type_attr = get_Null_type; - break; - } - return ops; + op->ops.get_entity_attr = func; } -/** the get_entity_attr operation must be always implemented */ -static ir_entity *get_Null_ent(const ir_node *n) +void ir_register_getter_ops(void) { - (void) n; - return NULL; -} + register_get_type_func(op_Alloc, get_Alloc_type); + register_get_type_func(op_Builtin, get_Builtin_type); + register_get_type_func(op_Call, get_Call_type); + register_get_type_func(op_Cast, get_Cast_type); + register_get_type_func(op_CopyB, get_CopyB_type); + register_get_type_func(op_Free, get_Free_type); + register_get_type_func(op_InstOf, get_InstOf_type); + register_get_type_func(op_SymConst, get_SymConst_attr_type); -/* Sets the get_type operation for an ir_op_ops. */ -ir_op_ops *firm_set_default_get_entity_attr(unsigned code, ir_op_ops *ops) -{ - switch (code) { - case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break; - case iro_Sel: ops->get_entity_attr = get_Sel_entity; break; - default: - /* not allowed to be NULL */ - if (! ops->get_entity_attr) - ops->get_entity_attr = get_Null_ent; - break; - } - return ops; + register_get_entity_func(op_SymConst, get_SymConst_attr_entity); + register_get_entity_func(op_Sel, get_Sel_entity); + register_get_entity_func(op_Block, get_Block_entity); } -/* Sets the debug information of a node. */ void (set_irn_dbg_info)(ir_node *n, dbg_info *db) { - _set_irn_dbg_info(n, db); + set_irn_dbg_info_(n, db); } -/** - * Returns the debug information of an node. - * - * @param n The node. - */ dbg_info *(get_irn_dbg_info)(const ir_node *n) { - return _get_irn_dbg_info(n); + return get_irn_dbg_info_(n); } -/* checks whether a node represents a global address */ -int is_Global(const ir_node *node) +ir_switch_table *ir_new_switch_table(ir_graph *irg, size_t n_entries) { - return is_SymConst_addr_ent(node); + struct obstack *obst = get_irg_obstack(irg); + ir_switch_table *res = OALLOCFZ(obst, ir_switch_table, entries, n_entries); + res->n_entries = n_entries; + return res; } -/* returns the entity of a global address */ -ir_entity *get_Global_entity(const ir_node *node) +void ir_switch_table_set(ir_switch_table *table, size_t n, + ir_tarval *min, ir_tarval *max, long pn) { - return get_SymConst_entity(node); + ir_switch_table_entry *entry = ir_switch_table_get_entry(table, n); + entry->min = min; + entry->max = max; + entry->pn = pn; } -/* - * Calculate a hash value of a node. - */ -unsigned firm_default_hash(const ir_node *node) +size_t (ir_switch_table_get_n_entries)(const ir_switch_table *table) { - unsigned h; - int i, irn_arity; + return ir_switch_table_get_n_entries_(table); +} - /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */ - h = irn_arity = get_irn_arity(node); +ir_tarval *ir_switch_table_get_max(const ir_switch_table *table, size_t e) +{ + return ir_switch_table_get_entry_const(table, e)->max; +} - /* consider all in nodes... except the block if not a control flow. */ - for (i = is_cfop(node) ? -1 : 0; i < irn_arity; ++i) { - ir_node *pred = get_irn_n(node, i); - if (is_irn_cse_neutral(pred)) - h *= 9; - else - h = 9*h + HASH_PTR(pred); - } +ir_tarval *ir_switch_table_get_min(const ir_switch_table *table, size_t e) +{ + return ir_switch_table_get_entry_const(table, e)->min; +} - /* ...mode,... */ - h = 9*h + HASH_PTR(get_irn_mode(node)); - /* ...and code */ - h = 9*h + HASH_PTR(get_irn_op(node)); +long ir_switch_table_get_pn(const ir_switch_table *table, size_t e) +{ + return ir_switch_table_get_entry_const(table, e)->pn; +} - return h; -} /* firm_default_hash */ +ir_switch_table *ir_switch_table_duplicate(ir_graph *irg, + const ir_switch_table *table) +{ + size_t n_entries = ir_switch_table_get_n_entries(table); + size_t e; + ir_switch_table *res = ir_new_switch_table(irg, n_entries); + for (e = 0; e < n_entries; ++e) { + const ir_switch_table_entry *entry + = ir_switch_table_get_entry_const(table, e); + ir_switch_table_entry *new_entry = ir_switch_table_get_entry(res, e); + *new_entry = *entry; + } + return res; +} /* include generated code */ #include "gen_irnode.c.inl"