X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=182fc994ae174d580684c169c160b186636df881;hb=9f7a1e686bde4ec490e4983a6f4cf204528b90cd;hp=99a09a4bc2cc135e153b737658db47fb1a2b39f7;hpb=f99cb544404632798272f958e389176d585c9e73;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 99a09a4bc..b36d7c223 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.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,73 +23,74 @@ * @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 +#include "pset_new.h" #include "ident.h" #include "irnode_t.h" #include "irgraph_t.h" #include "irmode_t.h" -#include "typegmod.h" #include "irbackedge_t.h" #include "irdump.h" #include "irop_t.h" #include "irprog_t.h" #include "iredgekinds.h" #include "iredges_t.h" +#include "ircons.h" +#include "error.h" #include "irhooks.h" #include "irtools.h" +#include "util.h" + +#include "beinfo.h" /* some constants fixing the positions of nodes predecessors in the in array */ -#define CALL_PARAM_OFFSET 2 -#define FUNCCALL_PARAM_OFFSET 1 -#define SEL_INDEX_OFFSET 2 -#define RETURN_RESULT_OFFSET 1 /* mem is not a result */ +#define CALL_PARAM_OFFSET (n_Call_max+1) +#define BUILTIN_PARAM_OFFSET (n_Builtin_max+1) +#define SEL_INDEX_OFFSET (n_Sel_max+1) +#define RETURN_RESULT_OFFSET (n_Return_max+1) #define END_KEEPALIVE_OFFSET 0 -static const char *pnc_name_arr [] = { - "pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le", - "pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg", - "pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule", - "pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True" +static const char *relation_names [] = { + "false", + "equal", + "less", + "less_equal", + "greater", + "greater_equal", + "less_greater", + "less_equal_greater", + "unordered", + "unordered_equal", + "unordered_less", + "unordered_less_equal", + "unordered_greater", + "unordered_greater_equal", + "not_equal", + "true" }; -/** - * returns the pnc name from an pnc constant - */ -const char *get_pnc_string(int pnc) { - return pnc_name_arr[pnc]; +const char *get_relation_string(ir_relation relation) +{ + assert(relation < (ir_relation)ARRAY_SIZE(relation_names)); + return relation_names[relation]; } -/* - * Calculates the negated (Complement(R)) pnc condition. - */ -int get_negated_pnc(int pnc, ir_mode *mode) { - pnc ^= pn_Cmp_True; - - /* do NOT add the Uo bit for non-floating point values */ - if (! mode_is_float(mode)) - pnc &= ~pn_Cmp_Uo; - - return pnc; +ir_relation get_negated_relation(ir_relation relation) +{ + return relation ^ ir_relation_true; } -/* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */ -int -get_inversed_pnc(int pnc) { - int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt); - int lesser = pnc & pn_Cmp_Lt; - int greater = pnc & pn_Cmp_Gt; - - code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0); - +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); return code; } @@ -107,7 +108,8 @@ unsigned firm_add_node_size = 0; /* register new space for every node */ -unsigned register_additional_node_data(unsigned size) { +unsigned firm_register_additional_node_data(unsigned size) +{ assert(!forbid_new_data && "Too late to register additional node data"); if (forbid_new_data) @@ -117,31 +119,43 @@ unsigned register_additional_node_data(unsigned size) { } -void -init_irnode(void) { +void init_irnode(void) +{ /* Forbid the addition of new data to an ir node. */ forbid_new_data = 1; } +struct struct_align { + char c; + struct s { + int i; + float f; + double d; + } 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 **in) +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) { ir_node *res; - size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size; + unsigned align = offsetof(struct struct_align, s) - 1; + unsigned add_node_size = (firm_add_node_size + align) & ~align; + size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size; char *p; int i; - assert(irg && op && mode); - p = obstack_alloc(irg->obst, node_size); + assert(irg); + assert(op); + assert(mode); + p = (char*)obstack_alloc(irg->obst, node_size); memset(p, 0, node_size); - res = (ir_node *)(p + firm_add_node_size); + res = (ir_node *)(p + add_node_size); res->kind = k_ir_node; res->op = op; @@ -154,20 +168,25 @@ new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mo if (arity < 0) { res->in = NEW_ARR_F(ir_node *, 1); /* 1: space for block */ } else { - res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1)); + /* not nice but necessary: End and Sync must always have a flexible array */ + if (op == op_End || op == op_Sync) + res->in = NEW_ARR_F(ir_node *, (arity+1)); + else + res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1)); memcpy(&res->in[1], in, sizeof(ir_node *) * arity); } - res->in[0] = block; + res->in[0] = block; set_irn_dbg_info(res, db); - res->out = NULL; - -#ifdef DEBUG_libfirm + res->out = NULL; res->node_nr = get_irp_new_node_nr(); -#endif - for (i = 0; i < EDGE_KIND_LAST; ++i) + for (i = 0; i < EDGE_KIND_LAST; ++i) { INIT_LIST_HEAD(&res->edge_info[i].outs_head); + /* edges will be build immediately */ + res->edge_info[i].edges_built = 1; + res->edge_info[i].out_count = 0; + } /* don't put this into the for loop, arity is -1 for some nodes! */ edges_notify_edge(res, -1, res->in[0], NULL, irg); @@ -175,32 +194,23 @@ new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mo edges_notify_edge(res, i - 1, res->in[i], NULL, irg); hook_new_node(irg, res); + if (get_irg_phase_state(irg) == phase_backend) { + be_info_new_node(res); + } return res; } /*-- getting some parameters from ir_nodes --*/ -int -(is_ir_node)(const void *thing) { - return _is_ir_node(thing); -} - -int -(get_irn_intra_arity)(const ir_node *node) { - return _get_irn_intra_arity(node); -} - -int -(get_irn_inter_arity)(const ir_node *node) { - return _get_irn_inter_arity(node); +int (is_ir_node)(const void *thing) +{ + return is_ir_node_(thing); } -int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity; - -int -(get_irn_arity)(const ir_node *node) { - return _get_irn_arity(node); +int (get_irn_arity)(const ir_node *node) +{ + return get_irn_arity_(node); } /* Returns the array with ins. This array is shifted with respect to the @@ -209,110 +219,66 @@ int 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) { - assert(node); - if (get_interprocedural_view()) { /* handle Filter and Block specially */ - if (get_irn_opcode(node) == iro_Filter) { - assert(node->attr.filter.in_cg); - return node->attr.filter.in_cg; - } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { - return node->attr.block.in_cg; - } - /* else fall through */ - } +ir_node **get_irn_in(const ir_node *node) +{ return node->in; } -void -set_irn_in(ir_node *node, int arity, ir_node **in) { +void set_irn_in(ir_node *node, int arity, ir_node **in) +{ int i; - ir_node *** arr; - ir_graph *irg = current_ir_graph; - assert(node); - if (get_interprocedural_view()) { /* handle Filter and Block specially */ - if (get_irn_opcode(node) == iro_Filter) { - assert(node->attr.filter.in_cg); - arr = &node->attr.filter.in_cg; - } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { - arr = &node->attr.block.in_cg; - } else { - arr = &node->in; - } - } else { - arr = &node->in; - } + ir_node *** pOld_in; + ir_graph *irg = get_irn_irg(node); + + pOld_in = &node->in; + for (i = 0; i < arity; i++) { - if (i < ARR_LEN(*arr)-1) - edges_notify_edge(node, i, in[i], (*arr)[i+1], irg); + if (i < (int)ARR_LEN(*pOld_in)-1) + edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg); else - edges_notify_edge(node, i, in[i], NULL, irg); + edges_notify_edge(node, i, in[i], NULL, irg); } - for(;i < ARR_LEN(*arr)-1; i++) { - edges_notify_edge(node, i, NULL, (*arr)[i+1], irg); + for (;i < (int)ARR_LEN(*pOld_in)-1; i++) { + edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg); } - if (arity != ARR_LEN(*arr) - 1) { - ir_node * block = (*arr)[0]; - *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1); - (*arr)[0] = block; + if (arity != (int)ARR_LEN(*pOld_in) - 1) { + ir_node * block = (*pOld_in)[0]; + *pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1); + (*pOld_in)[0] = block; } fix_backedges(irg->obst, node); - memcpy((*arr) + 1, in, sizeof(ir_node *) * arity); -} - -ir_node * -(get_irn_intra_n)(const ir_node *node, int n) { - return _get_irn_intra_n (node, n); -} + memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity); -ir_node * -(get_irn_inter_n)(const ir_node *node, int n) { - return _get_irn_inter_n (node, n); + /* update irg flags */ + clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS | IR_GRAPH_STATE_CONSISTENT_LOOPINFO); } -ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n; - -ir_node * -(get_irn_n)(const ir_node *node, int n) { - return _get_irn_n(node, n); +ir_node *(get_irn_n)(const ir_node *node, int n) +{ + return get_irn_n_(node, n); } -void -set_irn_n (ir_node *node, int n, ir_node *in) { +void set_irn_n(ir_node *node, int n, ir_node *in) +{ + ir_graph *irg = get_irn_irg(node); assert(node && node->kind == k_ir_node); assert(-1 <= n); assert(n < get_irn_arity(node)); assert(in && in->kind == k_ir_node); - if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) { - /* Change block pred in both views! */ - node->in[n + 1] = in; - assert(node->attr.filter.in_cg); - node->attr.filter.in_cg[n + 1] = in; - return; - } - if (get_interprocedural_view()) { /* handle Filter and Block specially */ - if (get_irn_opcode(node) == iro_Filter) { - assert(node->attr.filter.in_cg); - node->attr.filter.in_cg[n + 1] = in; - return; - } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) { - node->attr.block.in_cg[n + 1] = in; - return; - } - /* else fall through */ - } - /* Call the hook */ hook_set_irn_n(node, n, in, node->in[n + 1]); /* Here, we rely on src and tgt being in the current ir graph */ - edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph); + edges_notify_edge(node, n, in, node->in[n + 1], irg); node->in[n + 1] = in; + + /* update irg flags */ + clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS | IR_GRAPH_STATE_CONSISTENT_LOOPINFO); } int add_irn_n(ir_node *node, ir_node *in) @@ -331,28 +297,36 @@ int add_irn_n(ir_node *node, ir_node *in) return pos; } -int -(get_irn_deps)(const ir_node *node) +void del_Sync_n(ir_node *n, int i) +{ + int arity = get_Sync_n_preds(n); + ir_node *last_pred = get_Sync_pred(n, arity - 1); + set_Sync_pred(n, i, last_pred); + edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n)); + ARR_SHRINKLEN(get_irn_in(n), arity); +} + +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) +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); + set_irn_dep_(node, pos, dep); } int 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); if (node->deps == NULL) { node->deps = NEW_ARR_F(ir_node *, 1); node->deps[0] = dep; @@ -360,11 +334,11 @@ int add_irn_dep(ir_node *node, ir_node *dep) int i, n; int first_zero = -1; - for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) { - if(node->deps[i] == NULL) + for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) { + if (node->deps[i] == NULL) first_zero = i; - if(node->deps[i] == dep) + if (node->deps[i] == dep) return i; } @@ -382,7 +356,8 @@ int add_irn_dep(ir_node *node, ir_node *dep) return res; } -void add_irn_deps(ir_node *tgt, ir_node *src) { +void add_irn_deps(ir_node *tgt, ir_node *src) +{ int i, n; for (i = 0, n = get_irn_deps(src); i < n; ++i) @@ -390,112 +365,94 @@ void add_irn_deps(ir_node *tgt, ir_node *src) { } -ir_mode * -(get_irn_mode)(const ir_node *node) { - return _get_irn_mode(node); -} - -void -(set_irn_mode)(ir_node *node, ir_mode *mode) { - _set_irn_mode(node, mode); -} - -modecode -get_irn_modecode(const ir_node *node) { - assert(node); - return node->mode->code; -} - -/** Gets the string representation of the mode .*/ -const char * -get_irn_modename(const ir_node *node) { - assert(node); - return get_mode_name(node->mode); +ir_mode *(get_irn_mode)(const ir_node *node) +{ + return get_irn_mode_(node); } -ident * -get_irn_modeident(const ir_node *node) { - assert(node); - return get_mode_ident(node->mode); +void (set_irn_mode)(ir_node *node, ir_mode *mode) +{ + set_irn_mode_(node, mode); } -ir_op * -(get_irn_op)(const ir_node *node) { - return _get_irn_op(node); +ir_op *(get_irn_op)(const ir_node *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); +void (set_irn_op)(ir_node *node, ir_op *op) +{ + set_irn_op_(node, op); } -ir_opcode -(get_irn_opcode)(const ir_node *node) { - return _get_irn_opcode(node); +unsigned (get_irn_opcode)(const ir_node *node) +{ + return get_irn_opcode_(node); } -const char * -get_irn_opname(const ir_node *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); } -ident * -get_irn_opident(const ir_node *node) { +ident *get_irn_opident(const ir_node *node) +{ assert(node); return node->op->name; } -unsigned long -(get_irn_visited)(const ir_node *node) { - return _get_irn_visited(node); +ir_visited_t (get_irn_visited)(const ir_node *node) +{ + return get_irn_visited_(node); } -void -(set_irn_visited)(ir_node *node, unsigned long visited) { - _set_irn_visited(node, visited); +void (set_irn_visited)(ir_node *node, ir_visited_t visited) +{ + set_irn_visited_(node, visited); } -void -(mark_irn_visited)(ir_node *node) { - _mark_irn_visited(node); +void (mark_irn_visited)(ir_node *node) +{ + mark_irn_visited_(node); } -int -(irn_not_visited)(const ir_node *node) { - return _irn_not_visited(node); +int (irn_visited)(const ir_node *node) +{ + return irn_visited_(node); } -int -(irn_visited)(const ir_node *node) { - return _irn_visited(node); +int (irn_visited_else_mark)(ir_node *node) +{ + return irn_visited_else_mark_(node); } -void -(set_irn_link)(ir_node *node, void *link) { - _set_irn_link(node, link); +void (set_irn_link)(ir_node *node, void *link) +{ + set_irn_link_(node, link); } -void * -(get_irn_link)(const ir_node *node) { - return _get_irn_link(node); +void *(get_irn_link)(const ir_node *node) +{ + return get_irn_link_(node); } -op_pin_state -(get_irn_pinned)(const ir_node *node) { - return _get_irn_pinned(node); +op_pin_state (get_irn_pinned)(const ir_node *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); +op_pin_state (is_irn_pinned_in_irg) (const ir_node *node) +{ + return is_irn_pinned_in_irg_(node); } -void set_irn_pinned(ir_node *node, op_pin_state state) { +void set_irn_pinned(ir_node *node, op_pin_state state) +{ /* due to optimization an opt may be turned into a Tuple */ - if (get_irn_op(node) == op_Tuple) + if (is_Tuple(node)) return; assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned); @@ -504,130 +461,33 @@ void set_irn_pinned(ir_node *node, op_pin_state state) { node->attr.except.pin_state = state; } -#ifdef DO_HEAPANALYSIS -/* Access the abstract interpretation information of a node. - Returns NULL if no such information is available. */ -struct abstval *get_irn_abst_value(ir_node *n) { - return n->av; -} -/* Set the abstract interpretation information of a node. */ -void set_irn_abst_value(ir_node *n, struct abstval *os) { - n->av = os; -} -struct section *firm_get_irn_section(ir_node *n) { - return n->sec; -} -void firm_set_irn_section(ir_node *n, struct section *s) { - n->sec = s; -} -#else -/* Dummies needed for firmjni. */ -struct abstval *get_irn_abst_value(ir_node *n) { return NULL; } -void set_irn_abst_value(ir_node *n, struct abstval *os) {} -struct section *firm_get_irn_section(ir_node *n) { return NULL; } -void firm_set_irn_section(ir_node *n, struct section *s) {} -#endif /* DO_HEAPANALYSIS */ - - /* Outputs a unique number for this node */ -long get_irn_node_nr(const ir_node *node) { +long get_irn_node_nr(const ir_node *node) +{ assert(node); -#ifdef DEBUG_libfirm return node->node_nr; -#else - return (long)PTR_TO_INT(node); -#endif -} - -const_attr -get_irn_const_attr(ir_node *node) { - assert(node->op == op_Const); - return node->attr.con; -} - -long -get_irn_proj_attr(ir_node *node) { - assert(node->op == op_Proj); - return node->attr.proj; -} - -alloc_attr -get_irn_alloc_attr(ir_node *node) { - assert(node->op == op_Alloc); - return node->attr.alloc; } -free_attr -get_irn_free_attr(ir_node *node) { - assert(node->op == op_Free); - return node->attr.free; -} - -symconst_attr -get_irn_symconst_attr(ir_node *node) { - assert(node->op == op_SymConst); - return node->attr.symc; -} - -ir_type * -get_irn_call_attr(ir_node *node) { - assert(node->op == op_Call); - return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp); -} - -sel_attr -get_irn_sel_attr(ir_node *node) { - assert(node->op == op_Sel); - return node->attr.sel; -} - -int -get_irn_phi0_attr(ir_node *node) { - assert(is_Phi0(node)); - return node->attr.phi0.pos; -} - -block_attr -get_irn_block_attr(ir_node *node) { - assert(node->op == op_Block); - return node->attr.block; -} - -load_attr -get_irn_load_attr(ir_node *node) { - assert(node->op == op_Load); - return node->attr.load; -} - -store_attr -get_irn_store_attr(ir_node *node) { - assert(node->op == op_Store); - return node->attr.store; -} - -except_attr -get_irn_except_attr(ir_node *node) { - assert(node->op == op_Div || node->op == op_Quot || - node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc); - return node->attr.except; -} - -void *(get_irn_generic_attr)(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) { +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) { +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) { +int get_irn_pred_pos(ir_node *node, ir_node *arg) +{ int i; for (i = get_irn_arity(node) - 1; i >= 0; i--) { if (get_irn_n(node, i) == arg) @@ -638,252 +498,224 @@ int get_irn_pred_pos(ir_node *node, ir_node *arg) { /** manipulate fields of individual nodes **/ -/* this works for all except Block */ -ir_node * -get_nodes_block(const ir_node *node) { - assert(node->op != op_Block); - assert(is_irn_pinned_in_irg(node) && "block info may be incorrect"); - return get_irn_n(node, -1); +ir_node *(get_nodes_block)(const ir_node *node) +{ + return get_nodes_block_(node); } -void -set_nodes_block(ir_node *node, ir_node *block) { +void set_nodes_block(ir_node *node, ir_node *block) +{ assert(node->op != op_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(ir_node *n) { +ir_type *is_frame_pointer(const ir_node *n) +{ if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) { ir_node *start = get_Proj_pred(n); - if (get_irn_op(start) == op_Start) { + if (is_Start(start)) { return get_irg_frame_type(get_irn_irg(start)); } } return NULL; } -/* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals) - * from Start. If so returns global type, else Null. */ -ir_type *is_globals_pointer(ir_node *n) { - if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) { - ir_node *start = get_Proj_pred(n); - if (get_irn_op(start) == op_Start) { - return get_glob_type(); - } - } - return NULL; -} - -/* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls) - * from Start. If so returns tls type, else Null. */ -ir_type *is_tls_pointer(ir_node *n) { - if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) { - ir_node *start = get_Proj_pred(n); - if (get_irn_op(start) == op_Start) { - return get_tls_type(); - } - } - return NULL; +ir_node **get_Block_cfgpred_arr(ir_node *node) +{ + assert(is_Block(node)); + return (ir_node **)&(get_irn_in(node)[1]); } -/* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base) - * from Start. If so returns 1, else 0. */ -int is_value_arg_pointer(ir_node *n) { - if ((get_irn_op(n) == op_Proj) && - (get_Proj_proj(n) == pn_Start_P_value_arg_base) && - (get_irn_op(get_Proj_pred(n)) == op_Start)) - return 1; - return 0; +int (get_Block_n_cfgpreds)(const ir_node *node) +{ + return get_Block_n_cfgpreds_(node); } -/* Returns an array with the predecessors of the Block. Depending on - the implementation of the graph data structure this can be a copy of - the internal representation of predecessors as well as the internal - array itself. Therefore writing to this array might obstruct the ir. */ -ir_node ** -get_Block_cfgpred_arr(ir_node *node) { - assert((node->op == op_Block)); - return (ir_node **)&(get_irn_in(node)[1]); +ir_node *(get_Block_cfgpred)(const ir_node *node, int pos) +{ + return get_Block_cfgpred_(node, pos); } -int -(get_Block_n_cfgpreds)(const ir_node *node) { - return _get_Block_n_cfgpreds(node); +void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) +{ + assert(is_Block(node)); + set_irn_n(node, pos, pred); } -ir_node * -(get_Block_cfgpred)(ir_node *node, int pos) { - return _get_Block_cfgpred(node, pos); -} +int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred) +{ + int i; -void -set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) { - assert(node->op == op_Block); - set_irn_n(node, pos, pred); + for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) { + if (get_Block_cfgpred_block(block, i) == pred) + return i; + } + return -1; } -ir_node * -(get_Block_cfgpred_block)(ir_node *node, int pos) { - return _get_Block_cfgpred_block(node, pos); +ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) +{ + return get_Block_cfgpred_block_(node, pos); } -int -get_Block_matured(ir_node *node) { - assert(node->op == op_Block); +int get_Block_matured(const ir_node *node) +{ + assert(is_Block(node)); return (int)node->attr.block.is_matured; } -void -set_Block_matured(ir_node *node, int matured) { - assert(node->op == op_Block); +void set_Block_matured(ir_node *node, int matured) +{ + assert(is_Block(node)); node->attr.block.is_matured = matured; } -unsigned long -(get_Block_block_visited)(const ir_node *node) { - return _get_Block_block_visited(node); +ir_visited_t (get_Block_block_visited)(const ir_node *node) +{ + return get_Block_block_visited_(node); } -void -(set_Block_block_visited)(ir_node *node, unsigned long visit) { - _set_Block_block_visited(node, visit); +void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) +{ + set_Block_block_visited_(node, visit); } -/* For this current_ir_graph must be set. */ -void -(mark_Block_block_visited)(ir_node *node) { - _mark_Block_block_visited(node); +void (mark_Block_block_visited)(ir_node *node) +{ + mark_Block_block_visited_(node); } -int -(Block_not_block_visited)(const ir_node *node) { - return _Block_not_block_visited(node); +int (Block_block_visited)(const ir_node *node) +{ + return 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; } -ir_node * -get_Block_graph_arr (ir_node *node, int pos) { - assert(node->op == op_Block); - return node->attr.block.graph_arr[pos+1]; +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; } -void -set_Block_graph_arr (ir_node *node, int pos, ir_node *value) { - assert(node->op == op_Block); - node->attr.block.graph_arr[pos+1] = value; +/* returns the graph of a Block. */ +ir_graph *(get_Block_irg)(const ir_node *block) +{ + return get_Block_irg_(block); } -void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[]) { - assert(node->op == op_Block); - if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) { - node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1); - node->attr.block.in_cg[0] = NULL; - node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity); - { - /* Fix backedge array. fix_backedges() operates depending on - interprocedural_view. */ - int ipv = get_interprocedural_view(); - set_interprocedural_view(1); - fix_backedges(current_ir_graph->obst, node); - set_interprocedural_view(ipv); - } - } - memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity); -} +ir_entity *create_Block_entity(ir_node *block) +{ + ir_entity *entity; + assert(is_Block(block)); -void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred) { - assert(node->op == op_Block && - node->attr.block.in_cg && - 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1); - node->attr.block.in_cg[pos + 1] = pred; -} + entity = block->attr.block.entity; + if (entity == NULL) { + ir_label_t nr; + ir_type *glob; -ir_node **get_Block_cg_cfgpred_arr(ir_node *node) { - assert(node->op == op_Block); - return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1; + glob = get_glob_type(); + entity = new_entity(glob, id_unique("block_%u"), get_code_type()); + 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; + } + return entity; } -int get_Block_cg_n_cfgpreds(ir_node *node) { - assert(node->op == op_Block); - return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1; +ir_entity *get_Block_entity(const ir_node *block) +{ + assert(is_Block(block)); + return block->attr.block.entity; } -ir_node *get_Block_cg_cfgpred(ir_node *node, int pos) { - assert(node->op == op_Block && node->attr.block.in_cg); - return node->attr.block.in_cg[pos + 1]; +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; } -void remove_Block_cg_cfgpred_arr(ir_node *node) { - assert(node->op == op_Block); - node->attr.block.in_cg = NULL; +int has_Block_entity(const ir_node *block) +{ + return block->attr.block.entity != NULL; } -ir_node *(set_Block_dead)(ir_node *block) { - return _set_Block_dead(block); +ir_node *(get_Block_phis)(const ir_node *block) +{ + return get_Block_phis_(block); } -int (is_Block_dead)(const ir_node *block) { - return _is_Block_dead(block); +void (set_Block_phis)(ir_node *block, ir_node *phi) +{ + set_Block_phis_(block, phi); } -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 (add_Block_phi)(ir_node *block, ir_node *phi) +{ + add_Block_phi_(block, phi); } -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; +/* Get the Block mark (single bit). */ +unsigned (get_Block_mark)(const ir_node *block) +{ + return get_Block_mark_(block); } -ir_node *get_Block_MacroBlock(const ir_node *block) { - assert(is_Block(block)); - return get_irn_n(block, -1); +/* Set the Block mark (single bit). */ +void (set_Block_mark)(ir_node *block, unsigned mark) +{ + set_Block_mark_(block, mark); } -int -get_End_n_keepalives(ir_node *end) { - assert(end->op == op_End); +int get_End_n_keepalives(const ir_node *end) +{ + assert(is_End(end)); return (get_irn_arity(end) - END_KEEPALIVE_OFFSET); } -ir_node * -get_End_keepalive(ir_node *end, int pos) { - assert(end->op == op_End); +ir_node *get_End_keepalive(const ir_node *end, int pos) +{ + assert(is_End(end)); return get_irn_n(end, pos + END_KEEPALIVE_OFFSET); } -void -add_End_keepalive(ir_node *end, ir_node *ka) { - assert(end->op == op_End); - assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!"); +void add_End_keepalive(ir_node *end, ir_node *ka) +{ + assert(is_End(end)); add_irn_n(end, ka); } -void -set_End_keepalive(ir_node *end, int pos, ir_node *ka) { - assert(end->op == op_End); +void set_End_keepalive(ir_node *end, int pos, ir_node *ka) +{ + assert(is_End(end)); 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[]) { - int i; +void set_End_keepalives(ir_node *end, int n, ir_node *in[]) +{ + size_t e; + int i; ir_graph *irg = get_irn_irg(end); /* notify that edges are deleted */ - for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) { - edges_notify_edge(end, i, NULL, end->in[i + 1], irg); + for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) { + edges_notify_edge(end, e, NULL, end->in[e + 1], irg); } ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET); @@ -891,583 +723,362 @@ void set_End_keepalives(ir_node *end, int n, ir_node *in[]) { end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i]; edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg); } + + /* update irg flags */ + clear_irg_state(irg, IR_GRAPH_STATE_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); - ir_node **in; - int i, idx; - - NEW_ARR_A(ir_node *, in, n); - - for (idx = i = 0; i < n; ++i) { - ir_node *old_ka = get_End_keepalive(end, i); - - /* skip irn */ - if (old_ka != irn) - in[idx++] = old_ka; +void remove_End_keepalive(ir_node *end, ir_node *irn) +{ + int n = get_End_n_keepalives(end); + int i, idx; + ir_graph *irg; + + idx = -1; + for (i = n -1; i >= 0; --i) { + ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i]; + + /* find irn */ + if (old_ka == irn) { + idx = i; + goto found; + } } + return; +found: + irg = get_irn_irg(end); + + /* remove the edge */ + edges_notify_edge(end, idx, NULL, irn, irg); + + if (idx != n - 1) { + /* exchange with the last one */ + ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1]; + edges_notify_edge(end, n - 1, NULL, old, irg); + end->in[1 + END_KEEPALIVE_OFFSET + idx] = old; + edges_notify_edge(end, idx, old, NULL, irg); + } + /* now n - 1 keeps, 1 block input */ + ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET); - /* set new keep-alives */ - set_End_keepalives(end, idx, in); -} - -void -free_End (ir_node *end) { - assert(end->op == op_End); - end->kind = k_BAD; - DEL_ARR_F(end->in); - end->in = NULL; /* @@@ make sure we get an error if we use the - in array afterwards ... */ + /* update irg flags */ + clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS); } -/* Return the target address of an IJmp */ -ir_node *get_IJmp_target(ir_node *ijmp) { - assert(ijmp->op == op_IJmp); - return get_irn_n(ijmp, 0); -} +/* remove Bads, NoMems and doublets from the keep-alive set */ +void remove_End_Bads_and_doublets(ir_node *end) +{ + pset_new_t keeps; + int idx, n = get_End_n_keepalives(end); + ir_graph *irg; + bool changed = false; -/** Sets the target address of an IJmp */ -void set_IJmp_target(ir_node *ijmp, ir_node *tgt) { - assert(ijmp->op == op_IJmp); - set_irn_n(ijmp, 0, tgt); -} + if (n <= 0) + return; -/* -> Implementing the case construct (which is where the constant Proj node is -> important) involves far more than simply determining the constant values. -> We could argue that this is more properly a function of the translator from -> Firm to the target machine. That could be done if there was some way of -> projecting "default" out of the Cond node. -I know it's complicated. -Basically there are two proglems: - - determining the gaps between the projs - - determining the biggest case constant to know the proj number for - the default node. -I see several solutions: -1. Introduce a ProjDefault node. Solves both problems. - This means to extend all optimizations executed during construction. -2. Give the Cond node for switch two flavors: - a) there are no gaps in the projs (existing flavor) - b) gaps may exist, default proj is still the Proj with the largest - projection number. This covers also the gaps. -3. Fix the semantic of the Cond to that of 2b) - -Solution 2 seems to be the best: -Computing the gaps in the Firm representation is not too hard, i.e., -libFIRM can implement a routine that transforms between the two -flavours. This is also possible for 1) but 2) does not require to -change any existing optimization. -Further it should be far simpler to determine the biggest constant than -to compute all gaps. -I don't want to choose 3) as 2a) seems to have advantages for -dataflow analysis and 3) does not allow to convert the representation to -2a). -*/ -ir_node * -get_Cond_selector(ir_node *node) { - assert(node->op == op_Cond); - return get_irn_n(node, 0); -} + irg = get_irn_irg(end); + pset_new_init(&keeps); -void -set_Cond_selector(ir_node *node, ir_node *selector) { - assert(node->op == op_Cond); - set_irn_n(node, 0, selector); -} + for (idx = n - 1; idx >= 0; --idx) { + ir_node *ka = get_End_keepalive(end, idx); -cond_kind -get_Cond_kind(ir_node *node) { - assert(node->op == op_Cond); - return node->attr.cond.kind; -} + if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) { + changed = true; + /* remove the edge */ + edges_notify_edge(end, idx, NULL, ka, irg); -void -set_Cond_kind(ir_node *node, cond_kind kind) { - assert(node->op == op_Cond); - node->attr.cond.kind = kind; -} + if (idx != n - 1) { + /* exchange with the last one */ + ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1]; + edges_notify_edge(end, n - 1, NULL, old, irg); + end->in[1 + END_KEEPALIVE_OFFSET + idx] = old; + edges_notify_edge(end, idx, old, NULL, irg); + } + --n; + } else { + pset_new_insert(&keeps, ka); + } + } + /* n keeps, 1 block input */ + ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET); -long -get_Cond_defaultProj(ir_node *node) { - assert(node->op == op_Cond); - return node->attr.cond.default_proj; -} + pset_new_destroy(&keeps); -ir_node * -get_Return_mem(ir_node *node) { - assert(node->op == op_Return); - return get_irn_n(node, 0); + if (changed) { + clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS); + } } -void -set_Return_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Return); - set_irn_n(node, 0, mem); +void free_End(ir_node *end) +{ + assert(is_End(end)); + end->kind = k_BAD; + DEL_ARR_F(end->in); + end->in = NULL; /* @@@ make sure we get an error if we use the + in array afterwards ... */ } -int -get_Return_n_ress(ir_node *node) { - assert(node->op == op_Return); - return (get_irn_arity(node) - RETURN_RESULT_OFFSET); +size_t get_Return_n_ress(const ir_node *node) +{ + assert(is_Return(node)); + return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET); } -ir_node ** -get_Return_res_arr (ir_node *node) { - assert((node->op == op_Return)); +ir_node **get_Return_res_arr(ir_node *node) +{ + assert(is_Return(node)); if (get_Return_n_ress(node) > 0) return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]); else return NULL; } -/* -void -set_Return_n_res(ir_node *node, int results) { - assert(node->op == op_Return); -} -*/ - -ir_node * -get_Return_res(ir_node *node, int pos) { - assert(node->op == op_Return); - assert(get_Return_n_ress(node) > pos); +ir_node *get_Return_res(const ir_node *node, int pos) +{ + assert(is_Return(node)); + assert(pos >= 0); + assert(get_Return_n_ress(node) > (size_t)pos); return get_irn_n(node, pos + RETURN_RESULT_OFFSET); } -void -set_Return_res(ir_node *node, int pos, ir_node *res){ - assert(node->op == op_Return); +void set_Return_res(ir_node *node, int pos, ir_node *res) +{ + assert(is_Return(node)); set_irn_n(node, pos + RETURN_RESULT_OFFSET, res); } -tarval *(get_Const_tarval)(const ir_node *node) { - return _get_Const_tarval(node); -} - -void -set_Const_tarval(ir_node *node, tarval *con) { - assert(node->op == op_Const); - node->attr.con.tv = con; +int (is_Const_null)(const ir_node *node) +{ + return is_Const_null_(node); } -cnst_classify_t (classify_Const)(ir_node *node) { - return _classify_Const(node); +int (is_Const_one)(const ir_node *node) +{ + return is_Const_one_(node); } - -/* The source language type. Must be an atomic type. Mode of type must - be mode of node. For tarvals from entities type must be pointer to - entity type. */ -ir_type * -get_Const_type(ir_node *node) { - assert(node->op == op_Const); - return node->attr.con.tp; +int (is_Const_all_one)(const ir_node *node) +{ + return is_Const_all_one_(node); } -void -set_Const_type(ir_node *node, ir_type *tp) { - assert(node->op == op_Const); - if (tp != firm_unknown_type) { - assert(is_atomic_type(tp)); - assert(get_type_mode(tp) == get_irn_mode(node)); - } - node->attr.con.tp = tp; -} -symconst_kind -get_SymConst_kind(const ir_node *node) { - assert(node->op == op_SymConst); - return node->attr.symc.num; +symconst_kind get_SymConst_kind(const ir_node *node) +{ + assert(is_SymConst(node)); + return node->attr.symc.kind; } -void -set_SymConst_kind(ir_node *node, symconst_kind num) { - assert(node->op == op_SymConst); - node->attr.symc.num = num; +void set_SymConst_kind(ir_node *node, symconst_kind kind) +{ + assert(is_SymConst(node)); + node->attr.symc.kind = kind; } -ir_type * -get_SymConst_type(ir_node *node) { - assert((node->op == op_SymConst) && +ir_type *get_SymConst_type(const ir_node *node) +{ + /* the cast here is annoying, but we have to compensate for + the skip_tip() */ + ir_node *irn = (ir_node *)node; + assert(is_SymConst(node) && (SYMCONST_HAS_TYPE(get_SymConst_kind(node)))); - return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p); + return irn->attr.symc.sym.type_p; } -void -set_SymConst_type(ir_node *node, ir_type *tp) { - assert((node->op == op_SymConst) && +void set_SymConst_type(ir_node *node, ir_type *tp) +{ + assert(is_SymConst(node) && (SYMCONST_HAS_TYPE(get_SymConst_kind(node)))); node->attr.symc.sym.type_p = tp; } -ident * -get_SymConst_name(const ir_node *node) { - assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node))); - return node->attr.symc.sym.ident_p; -} - -void -set_SymConst_name(ir_node *node, ident *name) { - assert(node->op == op_SymConst && SYMCONST_HAS_ID(get_SymConst_kind(node))); - node->attr.symc.sym.ident_p = name; -} - /* Only to access SymConst of kind symconst_addr_ent. Else assertion: */ -ir_entity *get_SymConst_entity(const ir_node *node) { - assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node))); +ir_entity *get_SymConst_entity(const ir_node *node) +{ + assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node))); return node->attr.symc.sym.entity_p; } -void set_SymConst_entity(ir_node *node, ir_entity *ent) { - assert(node->op == op_SymConst && SYMCONST_HAS_ENT(get_SymConst_kind(node))); +void set_SymConst_entity(ir_node *node, ir_entity *ent) +{ + assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node))); node->attr.symc.sym.entity_p = ent; } -ir_enum_const *get_SymConst_enum(const ir_node *node) { - assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node))); +ir_enum_const *get_SymConst_enum(const ir_node *node) +{ + assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node))); return node->attr.symc.sym.enum_p; } -void set_SymConst_enum(ir_node *node, ir_enum_const *ec) { - assert(node->op == op_SymConst && SYMCONST_HAS_ENUM(get_SymConst_kind(node))); +void set_SymConst_enum(ir_node *node, ir_enum_const *ec) +{ + assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node))); node->attr.symc.sym.enum_p = ec; } union symconst_symbol -get_SymConst_symbol(const ir_node *node) { - assert(node->op == op_SymConst); +get_SymConst_symbol(const ir_node *node) +{ + assert(is_SymConst(node)); return node->attr.symc.sym; } -void -set_SymConst_symbol(ir_node *node, union symconst_symbol sym) { - assert(node->op == op_SymConst); +void set_SymConst_symbol(ir_node *node, union symconst_symbol sym) +{ + assert(is_SymConst(node)); node->attr.symc.sym = sym; } -ir_type * -get_SymConst_value_type(ir_node *node) { - assert(node->op == op_SymConst); - if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp); - return node->attr.symc.tp; -} - -void -set_SymConst_value_type(ir_node *node, ir_type *tp) { - assert(node->op == op_SymConst); - node->attr.symc.tp = tp; -} - -ir_node * -get_Sel_mem(ir_node *node) { - assert(node->op == op_Sel); - return get_irn_n(node, 0); -} - -void -set_Sel_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Sel); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Sel_ptr(ir_node *node) { - assert(node->op == op_Sel); - return get_irn_n(node, 1); -} - -void -set_Sel_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_Sel); - set_irn_n(node, 1, ptr); -} - -int -get_Sel_n_indexs(ir_node *node) { - assert(node->op == op_Sel); +int get_Sel_n_indexs(const ir_node *node) +{ + assert(is_Sel(node)); return (get_irn_arity(node) - SEL_INDEX_OFFSET); } -ir_node ** -get_Sel_index_arr(ir_node *node) { - assert((node->op == op_Sel)); +ir_node **get_Sel_index_arr(ir_node *node) +{ + assert(is_Sel(node)); if (get_Sel_n_indexs(node) > 0) return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1]; else return NULL; } -ir_node * -get_Sel_index(ir_node *node, int pos) { - assert(node->op == op_Sel); +ir_node *get_Sel_index(const ir_node *node, int pos) +{ + assert(is_Sel(node)); return get_irn_n(node, pos + SEL_INDEX_OFFSET); } -void -set_Sel_index(ir_node *node, int pos, ir_node *index) { - assert(node->op == op_Sel); +void set_Sel_index(ir_node *node, int pos, ir_node *index) +{ + assert(is_Sel(node)); set_irn_n(node, pos + SEL_INDEX_OFFSET, index); } -ir_entity * -get_Sel_entity(ir_node *node) { - assert(node->op == op_Sel); - return node->attr.sel.ent; -} - -void -set_Sel_entity(ir_node *node, ir_entity *ent) { - assert(node->op == op_Sel); - node->attr.sel.ent = ent; -} - - -/* For unary and binary arithmetic operations the access to the - operands can be factored out. Left is the first, right the - second arithmetic value as listed in tech report 0999-33. - unops are: Minus, Abs, Not, Conv, Cast - binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl, - Shr, Shrs, Rotate, Cmp */ - - -ir_node * -get_Call_mem(ir_node *node) { - assert(node->op == op_Call); - return get_irn_n(node, 0); -} - -void -set_Call_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Call); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Call_ptr(ir_node *node) { - assert(node->op == op_Call); - return get_irn_n(node, 1); +ir_node **get_Call_param_arr(ir_node *node) +{ + assert(is_Call(node)); + return &get_irn_in(node)[CALL_PARAM_OFFSET + 1]; } -void -set_Call_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_Call); - set_irn_n(node, 1, ptr); +size_t get_Call_n_params(const ir_node *node) +{ + assert(is_Call(node)); + return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET); } -ir_node ** -get_Call_param_arr(ir_node *node) { - assert(node->op == op_Call); - return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1]; +ir_node *get_Call_param(const ir_node *node, int pos) +{ + assert(is_Call(node)); + return get_irn_n(node, pos + CALL_PARAM_OFFSET); } -int -get_Call_n_params(ir_node *node) { - assert(node->op == op_Call); - return (get_irn_arity(node) - CALL_PARAM_OFFSET); +void set_Call_param(ir_node *node, int pos, ir_node *param) +{ + assert(is_Call(node)); + set_irn_n(node, pos + CALL_PARAM_OFFSET, param); } -int -get_Call_arity(ir_node *node) { - assert(node->op == op_Call); - return get_Call_n_params(node); +ir_node **get_Builtin_param_arr(ir_node *node) +{ + assert(is_Builtin(node)); + return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1]; } -/* void -set_Call_arity(ir_node *node, ir_node *arity) { - assert(node->op == op_Call); +int get_Builtin_n_params(const ir_node *node) +{ + assert(is_Builtin(node)); + return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET); } -*/ -ir_node * -get_Call_param(ir_node *node, int pos) { - assert(node->op == op_Call); - return get_irn_n(node, pos + CALL_PARAM_OFFSET); +ir_node *get_Builtin_param(const ir_node *node, int pos) +{ + assert(is_Builtin(node)); + return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET); } -void -set_Call_param(ir_node *node, int pos, ir_node *param) { - assert(node->op == op_Call); - set_irn_n(node, pos + CALL_PARAM_OFFSET, param); +void set_Builtin_param(ir_node *node, int pos, ir_node *param) +{ + assert(is_Builtin(node)); + set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param); } -ir_type * -get_Call_type(ir_node *node) { - assert(node->op == op_Call); - return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp); +/* 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 + switch (kind) { + X(ir_bk_trap); + X(ir_bk_debugbreak); + X(ir_bk_return_address); + X(ir_bk_frame_address); + X(ir_bk_prefetch); + X(ir_bk_ffs); + X(ir_bk_clz); + X(ir_bk_ctz); + X(ir_bk_popcount); + X(ir_bk_parity); + X(ir_bk_bswap); + X(ir_bk_inport); + X(ir_bk_outport); + X(ir_bk_inner_trampoline); + } + return ""; +#undef X } -void -set_Call_type(ir_node *node, ir_type *tp) { - assert(node->op == op_Call); - assert((get_unknown_type() == tp) || is_Method_type(tp)); - node->attr.call.cld_tp = tp; -} -int Call_has_callees(ir_node *node) { - assert(node && node->op == op_Call); +int Call_has_callees(const ir_node *node) +{ + assert(is_Call(node)); return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) && (node->attr.call.callee_arr != NULL)); } -int get_Call_n_callees(ir_node * node) { - assert(node && node->op == op_Call && node->attr.call.callee_arr); +size_t get_Call_n_callees(const ir_node *node) +{ + assert(is_Call(node) && node->attr.call.callee_arr); return ARR_LEN(node->attr.call.callee_arr); } -ir_entity * get_Call_callee(ir_node * node, int pos) { - assert(pos >= 0 && pos < get_Call_n_callees(node)); +ir_entity *get_Call_callee(const ir_node *node, size_t pos) +{ + assert(pos < get_Call_n_callees(node)); return node->attr.call.callee_arr[pos]; } -void set_Call_callee_arr(ir_node * node, const int n, ir_entity ** arr) { - assert(node->op == op_Call); +void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr) +{ + ir_graph *irg = get_irn_irg(node); + + assert(is_Call(node)); if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) { - node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, current_ir_graph->obst, n); + node->attr.call.callee_arr = NEW_ARR_D(ir_entity *, irg->obst, n); } memcpy(node->attr.call.callee_arr, arr, n * sizeof(ir_entity *)); } -void remove_Call_callee_arr(ir_node * node) { - assert(node->op == op_Call); +void remove_Call_callee_arr(ir_node *node) +{ + assert(is_Call(node)); node->attr.call.callee_arr = NULL; } -ir_node * get_CallBegin_ptr(ir_node *node) { - assert(node->op == op_CallBegin); - return get_irn_n(node, 0); -} - -void set_CallBegin_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_CallBegin); - set_irn_n(node, 0, ptr); -} - -ir_node * get_CallBegin_call(ir_node *node) { - assert(node->op == op_CallBegin); - return node->attr.callbegin.call; -} - -void set_CallBegin_call(ir_node *node, ir_node *call) { - assert(node->op == op_CallBegin); - node->attr.callbegin.call = call; -} - - -#define BINOP(OP) \ -ir_node * get_##OP##_left(const ir_node *node) { \ - assert(node->op == op_##OP); \ - return get_irn_n(node, node->op->op_index); \ -} \ -void set_##OP##_left(ir_node *node, ir_node *left) { \ - assert(node->op == op_##OP); \ - set_irn_n(node, node->op->op_index, left); \ -} \ -ir_node *get_##OP##_right(const ir_node *node) { \ - assert(node->op == op_##OP); \ - return get_irn_n(node, node->op->op_index + 1); \ -} \ -void set_##OP##_right(ir_node *node, ir_node *right) { \ - assert(node->op == op_##OP); \ - set_irn_n(node, node->op->op_index + 1, right); \ -} - -#define UNOP(OP) \ -ir_node *get_##OP##_op(const ir_node *node) { \ - assert(node->op == op_##OP); \ - return get_irn_n(node, node->op->op_index); \ -} \ -void set_##OP##_op (ir_node *node, ir_node *op) { \ - assert(node->op == op_##OP); \ - set_irn_n(node, node->op->op_index, op); \ -} - -#define BINOP_MEM(OP) \ -BINOP(OP) \ - \ -ir_node * \ -get_##OP##_mem(ir_node *node) { \ - assert(node->op == op_##OP); \ - return get_irn_n(node, 0); \ -} \ - \ -void \ -set_##OP##_mem(ir_node *node, ir_node *mem) { \ - assert(node->op == op_##OP); \ - set_irn_n(node, 0, mem); \ -} - -#define DIVOP(OP) \ -BINOP_MEM(OP) \ - \ -ir_mode *get_##OP##_resmode(const ir_node *node) { \ - assert(node->op == op_##OP); \ - return node->attr.divmod.res_mode; \ -} \ - \ -void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \ - assert(node->op == op_##OP); \ - node->attr.divmod.res_mode = mode; \ -} - - -BINOP(Add) -BINOP(Sub) -UNOP(Minus) -BINOP(Mul) -DIVOP(Quot) -DIVOP(DivMod) -DIVOP(Div) -DIVOP(Mod) -UNOP(Abs) -BINOP(And) -BINOP(Or) -BINOP(Eor) -UNOP(Not) -BINOP(Shl) -BINOP(Shr) -BINOP(Shrs) -BINOP(Rot) -BINOP(Cmp) -UNOP(Conv) -UNOP(Cast) - -int get_Conv_strict(ir_node *node) { - assert(node->op == op_Conv); - return node->attr.conv.strict; -} - -void set_Conv_strict(ir_node *node, int strict_flag) { - assert(node->op == op_Conv); - node->attr.conv.strict = (char)strict_flag; -} - -ir_type * -get_Cast_type(ir_node *node) { - assert(node->op == op_Cast); - return node->attr.cast.totype; -} - -void -set_Cast_type(ir_node *node, ir_type *to_tp) { - assert(node->op == op_Cast); - node->attr.cast.totype = to_tp; -} - - /* Checks for upcast. * * Returns true if the Cast node casts a class type to a super type. */ -int is_Cast_upcast(ir_node *node) { +int is_Cast_upcast(ir_node *node) +{ ir_type *totype = get_Cast_type(node); ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node)); - ir_graph *myirg = get_irn_irg(node); - assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent); + assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent); assert(fromtype); while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) { @@ -1485,7 +1096,8 @@ int is_Cast_upcast(ir_node *node) { * * Returns true if the Cast node casts a class type to a sub type. */ -int is_Cast_downcast(ir_node *node) { +int is_Cast_downcast(ir_node *node) +{ ir_type *totype = get_Cast_type(node); ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node)); @@ -1503,861 +1115,260 @@ int is_Cast_downcast(ir_node *node) { return is_SubClass_of(totype, fromtype); } -int -(is_unop)(const ir_node *node) { - return _is_unop(node); -} - -ir_node * -get_unop_op(const ir_node *node) { - if (node->op->opar == oparity_unary) - return get_irn_n(node, node->op->op_index); - - assert(node->op->opar == oparity_unary); - return NULL; -} - -void -set_unop_op(ir_node *node, ir_node *op) { - if (node->op->opar == oparity_unary) - set_irn_n(node, node->op->op_index, op); - - assert(node->op->opar == oparity_unary); -} - -int -(is_binop)(const ir_node *node) { - return _is_binop(node); -} - -ir_node * -get_binop_left(const ir_node *node) { - assert(node->op->opar == oparity_binary); - return get_irn_n(node, node->op->op_index); -} - -void -set_binop_left(ir_node *node, ir_node *left) { - assert(node->op->opar == oparity_binary); - set_irn_n(node, node->op->op_index, left); -} - -ir_node * -get_binop_right(const ir_node *node) { - assert(node->op->opar == oparity_binary); - return get_irn_n(node, node->op->op_index + 1); -} - -void -set_binop_right(ir_node *node, ir_node *right) { - assert(node->op->opar == oparity_binary); - set_irn_n(node, node->op->op_index + 1, right); -} - -int is_Phi(const ir_node *n) { - ir_op *op; - - assert(n); - op = get_irn_op(n); - - if (op == op_Filter) return get_interprocedural_view(); - - if (op == op_Phi) - return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) || - (get_irn_arity(n) > 0)); - - return 0; -} - -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(node->op == op_Phi); - return (ir_node **)&(get_irn_in(node)[1]); -} - -int -get_Phi_n_preds(const ir_node *node) { - assert(is_Phi(node) || is_Phi0(node)); - return (get_irn_arity(node)); -} - -/* -void set_Phi_n_preds(ir_node *node, int n_preds) { - assert(node->op == op_Phi); -} -*/ - -ir_node * -get_Phi_pred(const ir_node *node, int pos) { - assert(is_Phi(node) || is_Phi0(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)); - set_irn_n(node, pos, pred); -} - - -int is_memop(ir_node *node) { - return ((get_irn_op(node) == op_Load) || (get_irn_op(node) == op_Store)); -} - -ir_node *get_memop_mem(ir_node *node) { - assert(is_memop(node)); - return get_irn_n(node, 0); -} - -void set_memop_mem(ir_node *node, ir_node *mem) { - assert(is_memop(node)); - set_irn_n(node, 0, mem); -} - -ir_node *get_memop_ptr(ir_node *node) { - assert(is_memop(node)); - return get_irn_n(node, 1); -} - -void set_memop_ptr(ir_node *node, ir_node *ptr) { - assert(is_memop(node)); - set_irn_n(node, 1, ptr); -} - -ir_node * -get_Load_mem(ir_node *node) { - assert(node->op == op_Load); - return get_irn_n(node, 0); -} - -void -set_Load_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Load); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Load_ptr(ir_node *node) { - assert(node->op == op_Load); - return get_irn_n(node, 1); -} - -void -set_Load_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_Load); - set_irn_n(node, 1, ptr); -} - -ir_mode * -get_Load_mode(ir_node *node) { - assert(node->op == op_Load); - return node->attr.load.load_mode; -} - -void -set_Load_mode(ir_node *node, ir_mode *mode) { - assert(node->op == op_Load); - node->attr.load.load_mode = mode; -} - -ir_volatility -get_Load_volatility(ir_node *node) { - assert(node->op == op_Load); - return node->attr.load.volatility; -} - -void -set_Load_volatility(ir_node *node, ir_volatility volatility) { - assert(node->op == op_Load); - node->attr.load.volatility = volatility; -} - - -ir_node * -get_Store_mem(ir_node *node) { - assert(node->op == op_Store); - return get_irn_n(node, 0); -} - -void -set_Store_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Store); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Store_ptr(ir_node *node) { - assert(node->op == op_Store); - return get_irn_n(node, 1); -} - -void -set_Store_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_Store); - set_irn_n(node, 1, ptr); -} - -ir_node * -get_Store_value(ir_node *node) { - assert(node->op == op_Store); - return get_irn_n(node, 2); -} - -void -set_Store_value(ir_node *node, ir_node *value) { - assert(node->op == op_Store); - set_irn_n(node, 2, value); -} - -ir_volatility -get_Store_volatility(ir_node *node) { - assert(node->op == op_Store); - return node->attr.store.volatility; -} - -void -set_Store_volatility(ir_node *node, ir_volatility volatility) { - assert(node->op == op_Store); - node->attr.store.volatility = volatility; -} - - -ir_node * -get_Alloc_mem(ir_node *node) { - assert(node->op == op_Alloc); - return get_irn_n(node, 0); -} - -void -set_Alloc_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Alloc); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Alloc_size(ir_node *node) { - assert(node->op == op_Alloc); - return get_irn_n(node, 1); -} - -void -set_Alloc_size(ir_node *node, ir_node *size) { - assert(node->op == op_Alloc); - set_irn_n(node, 1, size); -} - -ir_type * -get_Alloc_type(ir_node *node) { - assert(node->op == op_Alloc); - return node->attr.alloc.type = skip_tid(node->attr.alloc.type); -} - -void -set_Alloc_type(ir_node *node, ir_type *tp) { - assert(node->op == op_Alloc); - node->attr.alloc.type = tp; -} - -where_alloc -get_Alloc_where(ir_node *node) { - assert(node->op == op_Alloc); - return node->attr.alloc.where; -} - -void -set_Alloc_where(ir_node *node, where_alloc where) { - assert(node->op == op_Alloc); - node->attr.alloc.where = where; -} - - -ir_node * -get_Free_mem(ir_node *node) { - assert(node->op == op_Free); - return get_irn_n(node, 0); -} - -void -set_Free_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Free); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Free_ptr(ir_node *node) { - assert(node->op == op_Free); - return get_irn_n(node, 1); -} - -void -set_Free_ptr(ir_node *node, ir_node *ptr) { - assert(node->op == op_Free); - set_irn_n(node, 1, ptr); -} - -ir_node * -get_Free_size(ir_node *node) { - assert(node->op == op_Free); - return get_irn_n(node, 2); -} - -void -set_Free_size(ir_node *node, ir_node *size) { - assert(node->op == op_Free); - set_irn_n(node, 2, size); -} - -ir_type * -get_Free_type(ir_node *node) { - assert(node->op == op_Free); - return node->attr.free.type = skip_tid(node->attr.free.type); -} - -void -set_Free_type(ir_node *node, ir_type *tp) { - assert(node->op == op_Free); - node->attr.free.type = tp; -} - -where_alloc -get_Free_where(ir_node *node) { - assert(node->op == op_Free); - return node->attr.free.where; -} - -void -set_Free_where(ir_node *node, where_alloc where) { - assert(node->op == op_Free); - node->attr.free.where = where; -} - -ir_node **get_Sync_preds_arr(ir_node *node) { - assert(node->op == op_Sync); - return (ir_node **)&(get_irn_in(node)[1]); -} - -int get_Sync_n_preds(ir_node *node) { - assert(node->op == op_Sync); - return (get_irn_arity(node)); -} - -/* -void set_Sync_n_preds(ir_node *node, int n_preds) { - assert(node->op == op_Sync); -} -*/ - -ir_node *get_Sync_pred(ir_node *node, int pos) { - assert(node->op == op_Sync); - return get_irn_n(node, pos); -} - -void set_Sync_pred(ir_node *node, int pos, ir_node *pred) { - assert(node->op == op_Sync); - set_irn_n(node, pos, pred); -} - -/* Add a new Sync predecessor */ -void add_Sync_pred(ir_node *node, ir_node *pred) { - assert(node->op == op_Sync); - add_irn_n(node, pred); -} - -/* Returns the source language type of a Proj node. */ -ir_type *get_Proj_type(ir_node *n) { - ir_type *tp = firm_unknown_type; - ir_node *pred = get_Proj_pred(n); - - switch (get_irn_opcode(pred)) { - case iro_Proj: { - ir_node *pred_pred; - /* Deal with Start / Call here: we need to know the Proj Nr. */ - assert(get_irn_mode(pred) == mode_T); - pred_pred = get_Proj_pred(pred); - if (get_irn_op(pred_pred) == op_Start) { - ir_type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred))); - tp = get_method_param_type(mtp, get_Proj_proj(n)); - } else if (get_irn_op(pred_pred) == op_Call) { - ir_type *mtp = get_Call_type(pred_pred); - tp = get_method_res_type(mtp, get_Proj_proj(n)); - } - } break; - case iro_Start: break; - case iro_Call: break; - case iro_Load: { - ir_node *a = get_Load_ptr(pred); - if (is_Sel(a)) - tp = get_entity_type(get_Sel_entity(a)); - } break; - default: - break; - } - return tp; -} - -ir_node * -get_Proj_pred(const ir_node *node) { - assert(is_Proj(node)); - return get_irn_n(node, 0); -} - -void -set_Proj_pred(ir_node *node, ir_node *pred) { - assert(is_Proj(node)); - set_irn_n(node, 0, pred); -} - -long get_VProj_proj(const ir_node *node) -{ - return node->attr.proj; -} - -void set_VProj_proj(ir_node *node, long value) -{ - node->attr.proj = value; -} - -long -get_Proj_proj(const ir_node *node) { - assert(is_Proj(node)); - if (get_irn_opcode(node) == iro_Proj) { - return node->attr.proj; - } else { - assert(get_irn_opcode(node) == iro_Filter); - return node->attr.filter.proj; - } -} - -void -set_Proj_proj(ir_node *node, long proj) { - assert(node->op == op_Proj); - node->attr.proj = proj; -} - -ir_node ** -get_Tuple_preds_arr(ir_node *node) { - assert(node->op == op_Tuple); - return (ir_node **)&(get_irn_in(node)[1]); -} - -int -get_Tuple_n_preds(ir_node *node) { - assert(node->op == op_Tuple); - return (get_irn_arity(node)); -} - -/* -void -set_Tuple_n_preds(ir_node *node, int n_preds) { - assert(node->op == op_Tuple); -} -*/ - -ir_node * -get_Tuple_pred (ir_node *node, int pos) { - assert(node->op == op_Tuple); - return get_irn_n(node, pos); -} - -void -set_Tuple_pred(ir_node *node, int pos, ir_node *pred) { - assert(node->op == op_Tuple); - set_irn_n(node, pos, pred); -} - -ir_node * -get_Id_pred(ir_node *node) { - assert(node->op == op_Id); - return get_irn_n(node, 0); -} - -void -set_Id_pred(ir_node *node, ir_node *pred) { - assert(node->op == op_Id); - set_irn_n(node, 0, pred); -} - -ir_node *get_Confirm_value(ir_node *node) { - assert(node->op == op_Confirm); - return get_irn_n(node, 0); -} - -void set_Confirm_value(ir_node *node, ir_node *value) { - assert(node->op == op_Confirm); - set_irn_n(node, 0, value); -} - -ir_node *get_Confirm_bound(ir_node *node) { - assert(node->op == op_Confirm); - return get_irn_n(node, 1); -} - -void set_Confirm_bound(ir_node *node, ir_node *bound) { - assert(node->op == op_Confirm); - set_irn_n(node, 0, bound); -} - -pn_Cmp get_Confirm_cmp(ir_node *node) { - assert(node->op == op_Confirm); - return node->attr.confirm_cmp; -} - -void set_Confirm_cmp(ir_node *node, pn_Cmp cmp) { - assert(node->op == op_Confirm); - node->attr.confirm_cmp = cmp; -} - - -ir_node * -get_Filter_pred(ir_node *node) { - assert(node->op == op_Filter); - return node->in[1]; -} - -void -set_Filter_pred(ir_node *node, ir_node *pred) { - assert(node->op == op_Filter); - node->in[1] = pred; -} - -long -get_Filter_proj(ir_node *node) { - assert(node->op == op_Filter); - return node->attr.filter.proj; -} - -void -set_Filter_proj(ir_node *node, long proj) { - assert(node->op == op_Filter); - node->attr.filter.proj = proj; -} - -/* Don't use get_irn_arity, get_irn_n in implementation as access - shall work independent of view!!! */ -void set_Filter_cg_pred_arr(ir_node * node, int arity, ir_node ** in) { - assert(node->op == op_Filter); - if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) { - node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1); - node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity); - memset(node->attr.filter.backedge, 0, sizeof(int) * arity); - node->attr.filter.in_cg[0] = node->in[0]; - } - memcpy(node->attr.filter.in_cg + 1, in, sizeof(ir_node *) * arity); -} - -void set_Filter_cg_pred(ir_node * node, int pos, ir_node * pred) { - assert(node->op == op_Filter && node->attr.filter.in_cg && - 0 <= pos && pos < ARR_LEN(node->attr.filter.in_cg) - 1); - node->attr.filter.in_cg[pos + 1] = pred; -} - -int get_Filter_n_cg_preds(ir_node *node) { - assert(node->op == op_Filter && node->attr.filter.in_cg); - return (ARR_LEN(node->attr.filter.in_cg) - 1); -} - -ir_node *get_Filter_cg_pred(ir_node *node, int pos) { - int arity; - assert(node->op == op_Filter && node->attr.filter.in_cg && - 0 <= pos); - arity = ARR_LEN(node->attr.filter.in_cg); - assert(pos < arity - 1); - return node->attr.filter.in_cg[pos + 1]; -} - -/* Mux support */ -ir_node *get_Mux_sel(ir_node *node) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - return get_Psi_cond(node, 0); - } - assert(node->op == op_Mux); - return node->in[1]; -} - -void set_Mux_sel(ir_node *node, ir_node *sel) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - set_Psi_cond(node, 0, sel); - } else { - assert(node->op == op_Mux); - node->in[1] = sel; - } -} - -ir_node *get_Mux_false(ir_node *node) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - return get_Psi_default(node); - } - assert(node->op == op_Mux); - return node->in[2]; -} - -void set_Mux_false(ir_node *node, ir_node *ir_false) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - set_Psi_default(node, ir_false); - } else { - assert(node->op == op_Mux); - node->in[2] = ir_false; - } -} - -ir_node *get_Mux_true(ir_node *node) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - return get_Psi_val(node, 0); - } - assert(node->op == op_Mux); - return node->in[3]; -} - -void set_Mux_true(ir_node *node, ir_node *ir_true) { - if (node->op == op_Psi) { - assert(get_irn_arity(node) == 3); - set_Psi_val(node, 0, ir_true); - } else { - assert(node->op == op_Mux); - node->in[3] = ir_true; - } +int (is_unop)(const ir_node *node) +{ + return is_unop_(node); } -/* Psi support */ -ir_node *get_Psi_cond(ir_node *node, int pos) { - int num_conds = get_Psi_n_conds(node); - assert(node->op == op_Psi); - assert(pos < num_conds); - return get_irn_n(node, 2 * pos); -} +ir_node *get_unop_op(const ir_node *node) +{ + if (node->op->opar == oparity_unary) + return get_irn_n(node, node->op->op_index); -void set_Psi_cond(ir_node *node, int pos, ir_node *cond) { - int num_conds = get_Psi_n_conds(node); - assert(node->op == op_Psi); - assert(pos < num_conds); - set_irn_n(node, 2 * pos, cond); + assert(node->op->opar == oparity_unary); + return NULL; } -ir_node *get_Psi_val(ir_node *node, int pos) { - int num_vals = get_Psi_n_conds(node); - assert(node->op == op_Psi); - assert(pos < num_vals); - return get_irn_n(node, 2 * pos + 1); -} +void set_unop_op(ir_node *node, ir_node *op) +{ + if (node->op->opar == oparity_unary) + set_irn_n(node, node->op->op_index, op); -void set_Psi_val(ir_node *node, int pos, ir_node *val) { - int num_vals = get_Psi_n_conds(node); - assert(node->op == op_Psi); - assert(pos < num_vals); - set_irn_n(node, 2 * pos + 1, val); + assert(node->op->opar == oparity_unary); } -ir_node *get_Psi_default(ir_node *node) { - int def_pos = get_irn_arity(node) - 1; - assert(node->op == op_Psi); - return get_irn_n(node, def_pos); +int (is_binop)(const ir_node *node) +{ + return is_binop_(node); } -void set_Psi_default(ir_node *node, ir_node *val) { - int def_pos = get_irn_arity(node); - assert(node->op == op_Psi); - set_irn_n(node, def_pos, val); +ir_node *get_binop_left(const ir_node *node) +{ + assert(node->op->opar == oparity_binary); + return get_irn_n(node, node->op->op_index); } -int (get_Psi_n_conds)(ir_node *node) { - return _get_Psi_n_conds(node); +void set_binop_left(ir_node *node, ir_node *left) +{ + assert(node->op->opar == oparity_binary); + set_irn_n(node, node->op->op_index, left); } -/* CopyB support */ -ir_node *get_CopyB_mem(ir_node *node) { - assert(node->op == op_CopyB); - return get_irn_n(node, 0); +ir_node *get_binop_right(const ir_node *node) +{ + assert(node->op->opar == oparity_binary); + return get_irn_n(node, node->op->op_index + 1); } -void set_CopyB_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_CopyB); - set_irn_n(node, 0, mem); +void set_binop_right(ir_node *node, ir_node *right) +{ + assert(node->op->opar == oparity_binary); + set_irn_n(node, node->op->op_index + 1, right); } -ir_node *get_CopyB_dst(ir_node *node) { - assert(node->op == op_CopyB); - return get_irn_n(node, 1); -} +int is_Phi0(const ir_node *n) +{ + assert(n); -void set_CopyB_dst(ir_node *node, ir_node *dst) { - assert(node->op == op_CopyB); - set_irn_n(node, 1, dst); + 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_CopyB_src (ir_node *node) { - assert(node->op == op_CopyB); - return get_irn_n(node, 2); +ir_node **get_Phi_preds_arr(ir_node *node) +{ + assert(is_Phi(node)); + return (ir_node **)&(get_irn_in(node)[1]); } -void set_CopyB_src(ir_node *node, ir_node *src) { - assert(node->op == op_CopyB); - set_irn_n(node, 2, src); +int get_Phi_n_preds(const ir_node *node) +{ + assert(is_Phi(node) || is_Phi0(node)); + return (get_irn_arity(node)); } -ir_type *get_CopyB_type(ir_node *node) { - assert(node->op == op_CopyB); - return node->attr.copyb.data_type; +ir_node *get_Phi_pred(const ir_node *node, int pos) +{ + assert(is_Phi(node) || is_Phi0(node)); + return get_irn_n(node, pos); } -void set_CopyB_type(ir_node *node, ir_type *data_type) { - assert(node->op == op_CopyB && data_type); - node->attr.copyb.data_type = data_type; +void set_Phi_pred(ir_node *node, int pos, ir_node *pred) +{ + assert(is_Phi(node) || is_Phi0(node)); + set_irn_n(node, pos, pred); } +ir_node *(get_Phi_next)(const ir_node *phi) +{ + return get_Phi_next_(phi); +} -ir_type * -get_InstOf_type(ir_node *node) { - assert(node->op = op_InstOf); - return node->attr.instof.type; +void (set_Phi_next)(ir_node *phi, ir_node *next) +{ + set_Phi_next_(phi, next); } -void -set_InstOf_type(ir_node *node, ir_type *type) { - assert(node->op = op_InstOf); - node->attr.instof.type = type; +int is_memop(const ir_node *node) +{ + unsigned code = get_irn_opcode(node); + return (code == iro_Load || code == iro_Store); } -ir_node * -get_InstOf_store(ir_node *node) { - assert(node->op = op_InstOf); +ir_node *get_memop_mem(const ir_node *node) +{ + assert(is_memop(node)); + assert(n_Load_mem == 0 && n_Store_mem == 0); return get_irn_n(node, 0); } -void -set_InstOf_store(ir_node *node, ir_node *obj) { - assert(node->op = op_InstOf); - set_irn_n(node, 0, obj); +void set_memop_mem(ir_node *node, ir_node *mem) +{ + assert(is_memop(node)); + assert(n_Load_mem == 0 && n_Store_mem == 0); + set_irn_n(node, 0, mem); } -ir_node * -get_InstOf_obj(ir_node *node) { - assert(node->op = op_InstOf); +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_InstOf_obj(ir_node *node, ir_node *obj) { - assert(node->op = op_InstOf); - set_irn_n(node, 1, obj); +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); } -/* Returns the memory input of a Raise operation. */ -ir_node * -get_Raise_mem(ir_node *node) { - assert(node->op == op_Raise); - return get_irn_n(node, 0); + +ir_node **get_Sync_preds_arr(ir_node *node) +{ + assert(is_Sync(node)); + return (ir_node **)&(get_irn_in(node)[1]); } -void -set_Raise_mem(ir_node *node, ir_node *mem) { - assert(node->op == op_Raise); - set_irn_n(node, 0, mem); +int get_Sync_n_preds(const ir_node *node) +{ + assert(is_Sync(node)); + return (get_irn_arity(node)); } -ir_node * -get_Raise_exo_ptr(ir_node *node) { - assert(node->op == op_Raise); - return get_irn_n(node, 1); +/* +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)); + return get_irn_n(node, pos); } -void -set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr) { - assert(node->op == op_Raise); - set_irn_n(node, 1, exo_ptr); +void set_Sync_pred(ir_node *node, int pos, ir_node *pred) +{ + assert(is_Sync(node)); + set_irn_n(node, pos, pred); } -/* Bound support */ +/* Add a new Sync predecessor */ +void add_Sync_pred(ir_node *node, ir_node *pred) +{ + assert(is_Sync(node)); + add_irn_n(node, pred); +} -/* Returns the memory input of a Bound operation. */ -ir_node *get_Bound_mem(ir_node *bound) { - assert(bound->op == op_Bound); - return get_irn_n(bound, 0); +int (is_arg_Proj)(const ir_node *node) +{ + return is_arg_Proj_(node); } -void set_Bound_mem(ir_node *bound, ir_node *mem) { - assert(bound->op == op_Bound); - set_irn_n(bound, 0, mem); +int is_x_except_Proj(const ir_node *node) +{ + ir_node *pred; + if (!is_Proj(node)) + return false; + pred = get_Proj_pred(node); + if (!is_fragile_op(pred)) + return false; + return get_Proj_proj(node) == pred->op->pn_x_except; } -/* Returns the index input of a Bound operation. */ -ir_node *get_Bound_index(ir_node *bound) { - assert(bound->op == op_Bound); - return get_irn_n(bound, 1); +int is_x_regular_Proj(const ir_node *node) +{ + ir_node *pred; + if (!is_Proj(node)) + return false; + pred = get_Proj_pred(node); + if (!is_fragile_op(pred)) + return false; + return get_Proj_proj(node) == pred->op->pn_x_regular; } -void set_Bound_index(ir_node *bound, ir_node *idx) { - assert(bound->op == op_Bound); - set_irn_n(bound, 1, idx); +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; } -/* Returns the lower bound input of a Bound operation. */ -ir_node *get_Bound_lower(ir_node *bound) { - assert(bound->op == op_Bound); - return get_irn_n(bound, 2); +int ir_throws_exception(const ir_node *node) +{ + const except_attr *attr = &node->attr.except; + assert(is_fragile_op(node)); + return attr->throws_exception; } -void set_Bound_lower(ir_node *bound, ir_node *lower) { - assert(bound->op == op_Bound); - set_irn_n(bound, 2, lower); +ir_node **get_Tuple_preds_arr(ir_node *node) +{ + assert(is_Tuple(node)); + return (ir_node **)&(get_irn_in(node)[1]); } -/* Returns the upper bound input of a Bound operation. */ -ir_node *get_Bound_upper(ir_node *bound) { - assert(bound->op == op_Bound); - return get_irn_n(bound, 3); +int get_Tuple_n_preds(const ir_node *node) +{ + assert(is_Tuple(node)); + return get_irn_arity(node); } -void set_Bound_upper(ir_node *bound, ir_node *upper) { - assert(bound->op == op_Bound); - set_irn_n(bound, 3, upper); +ir_node *get_Tuple_pred(const ir_node *node, int pos) +{ + assert(is_Tuple(node)); + return get_irn_n(node, pos); } -/* Return the operand of a Pin node. */ -ir_node *get_Pin_op(const ir_node *pin) { - assert(pin->op == op_Pin); - return get_irn_n(pin, 0); +void set_Tuple_pred(ir_node *node, int pos, ir_node *pred) +{ + assert(is_Tuple(node)); + set_irn_n(node, pos, pred); } -void set_Pin_op(ir_node *pin, ir_node *node) { - assert(pin->op == op_Pin); - set_irn_n(pin, 0, node); +int get_ASM_n_input_constraints(const ir_node *node) +{ + assert(is_ASM(node)); + return ARR_LEN(node->attr.assem.input_constraints); } -/* Return the assembler text of an ASM pseudo node. */ -const char *get_ASM_text(const ir_node *node) { - assert(node->op == op_ASM); - return get_id_str(node->attr.asm.asm_text); +int 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) +{ + 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) { - /* - * Do not use get_nodes_Block() here, because this - * will check the pinned state. - * However even a 'wrong' block is always in the proper - * irg. - */ - if (! is_Block(node)) - node = get_irn_n(node, -1); - if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */ - node = get_irn_n(node, -1); - assert(get_irn_op(node) == op_Block); - return node->attr.block.irg; +ir_graph *(get_irn_irg)(const ir_node *node) +{ + return get_irn_irg_(node); } @@ -2365,8 +1376,8 @@ get_irn_irg(const ir_node *node) { /* Auxiliary routines */ /*----------------------------------------------------------------*/ -ir_node * -skip_Proj(ir_node *node) { +ir_node *skip_Proj(ir_node *node) +{ /* don't assert node !!! */ if (node == NULL) return NULL; @@ -2378,7 +1389,8 @@ skip_Proj(ir_node *node) { } const ir_node * -skip_Proj_const(const ir_node *node) { +skip_Proj_const(const ir_node *node) +{ /* don't assert node !!! */ if (node == NULL) return NULL; @@ -2389,31 +1401,22 @@ skip_Proj_const(const ir_node *node) { return node; } -ir_node * -skip_Tuple(ir_node *node) { +ir_node *skip_Tuple(ir_node *node) +{ ir_node *pred; - ir_op *op; - - if (!get_opt_normalize()) return node; restart: - if (get_irn_op(node) == op_Proj) { + if (is_Proj(node)) { pred = get_Proj_pred(node); - op = get_irn_op(pred); - /* - * Looks strange but calls get_irn_op() only once - * in most often cases. - */ - if (op == op_Proj) { /* nested Tuple ? */ + if (is_Proj(pred)) { /* nested Tuple ? */ pred = skip_Tuple(pred); - op = get_irn_op(pred); - if (op == op_Tuple) { + if (is_Tuple(pred)) { node = get_Tuple_pred(pred, get_Proj_proj(node)); goto restart; } - } else if (op == op_Tuple) { + } else if (is_Tuple(pred)) { node = get_Tuple_pred(pred, get_Proj_proj(node)); goto restart; } @@ -2422,23 +1425,43 @@ restart: } /* returns operand of node if node is a Cast */ -ir_node *skip_Cast(ir_node *node) { - if (get_irn_op(node) == op_Cast) +ir_node *skip_Cast(ir_node *node) +{ + if (is_Cast(node)) + return get_Cast_op(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)) return get_Cast_op(node); return node; } +/* returns operand of node if node is a Pin */ +ir_node *skip_Pin(ir_node *node) +{ + if (is_Pin(node)) + return get_Pin_op(node); + return node; +} + /* returns operand of node if node is a Confirm */ -ir_node *skip_Confirm(ir_node *node) { - if (get_irn_op(node) == op_Confirm) +ir_node *skip_Confirm(ir_node *node) +{ + if (is_Confirm(node)) return get_Confirm_value(node); return node; } /* skip all high-level ops */ -ir_node *skip_HighLevel(ir_node *node) { - if (is_op_highlevel(get_irn_op(node))) - return get_irn_n(node, 0); +ir_node *skip_HighLevel_ops(ir_node *node) +{ + while (is_op_highlevel(get_irn_op(node))) { + node = get_irn_n(node, 0); + } return node; } @@ -2449,11 +1472,9 @@ ir_node *skip_HighLevel(ir_node *node) { * * Note: This function takes 10% of mostly ANY the compiler run, so it's * a little bit "hand optimized". - * - * Moreover, it CANNOT be switched off using get_opt_normalize() ... */ -ir_node * -skip_Id(ir_node *node) { +ir_node *skip_Id(ir_node *node) +{ ir_node *pred; /* don't assert node !!! */ @@ -2475,7 +1496,7 @@ skip_Id(ir_node *node) { node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */ res = skip_Id(rem_pred); - if (res->op == op_Id) /* self-loop */ return node; + if (is_Id(res)) /* self-loop */ return node; node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */ return res; @@ -2484,352 +1505,132 @@ skip_Id(ir_node *node) { } } -void skip_Id_and_store(ir_node **node) { - ir_node *n = *node; - - if (!n || (n->op != op_Id)) return; - - /* Don't use get_Id_pred(): We get into an endless loop for - self-referencing Ids. */ - *node = skip_Id(n); -} - -int -(is_Bad)(const ir_node *node) { - return _is_Bad(node); -} - -int -(is_NoMem)(const ir_node *node) { - return _is_NoMem(node); -} - -int -(is_Mod)(const ir_node *node) { - return _is_Mod(node); -} - -int -(is_Div)(const ir_node *node) { - return _is_Div(node); -} - -int -(is_DivMod)(const ir_node *node) { - return _is_DivMod(node); -} - -int -(is_Quot)(const ir_node *node) { - return _is_Quot(node); -} - -int -(is_Add)(const ir_node *node) { - return _is_Add(node); -} - -int -(is_Sub)(const ir_node *node) { - return _is_Sub(node); -} - -int -(is_Start)(const ir_node *node) { - return _is_Start(node); -} - -int -(is_End)(const ir_node *node) { - return _is_End(node); -} - -int -(is_Const)(const ir_node *node) { - return _is_Const(node); -} - -int -(is_Conv)(const ir_node *node) { - return _is_Conv(node); -} - -int -(is_no_Block)(const ir_node *node) { - return _is_no_Block(node); -} - -int -(is_Block)(const ir_node *node) { - return _is_Block(node); -} - -/* returns true if node is an Unknown node. */ -int -(is_Unknown)(const ir_node *node) { - return _is_Unknown(node); -} - -/* returns true if node is a Return node. */ -int -(is_Return)(const ir_node *node) { - return _is_Return(node); -} - -/* returns true if node is a Call node. */ -int -(is_Call)(const ir_node *node) { - return _is_Call(node); -} - -/* returns true if node is a Sel node. */ -int -(is_Sel)(const ir_node *node) { - return _is_Sel(node); -} - -/* returns true if node is a Mux node or a Psi with only one condition. */ -int -(is_Mux)(const ir_node *node) { - return _is_Mux(node); -} - -/* returns true if node is a Load node. */ -int -(is_Load)(const ir_node *node) { - return _is_Load(node); -} - -/* returns true if node is a Load node. */ -int -(is_Store)(const ir_node *node) { - return _is_Store(node); -} - -/* returns true if node is a Sync node. */ -int -(is_Sync)(const ir_node *node) { - return _is_Sync(node); -} - -/* returns true if node is a Confirm node. */ -int -(is_Confirm)(const ir_node *node) { - return _is_Confirm(node); -} - -/* returns true if node is a Pin node. */ -int -(is_Pin)(const ir_node *node) { - return _is_Pin(node); -} - -/* returns true if node is a SymConst node. */ -int -(is_SymConst)(const ir_node *node) { - return _is_SymConst(node); -} - -/* returns true if node is a Cond node. */ -int -(is_Cond)(const ir_node *node) { - return _is_Cond(node); -} - -int -(is_CopyB)(const ir_node *node) { - return _is_CopyB(node); -} - -/* returns true if node is a Cmp node. */ -int -(is_Cmp)(const ir_node *node) { - return _is_Cmp(node); -} - -/* returns true if node is an Alloc node. */ -int -(is_Alloc)(const ir_node *node) { - return _is_Alloc(node); -} - -/* returns true if a node is a Jmp node. */ -int -(is_Jmp)(const ir_node *node) { - return _is_Jmp(node); -} - -/* returns true if a node is a Raise node. */ -int -(is_Raise)(const ir_node *node) { - return _is_Raise(node); +int (is_strictConv)(const ir_node *node) +{ + return is_strictConv_(node); } -int -is_Proj(const ir_node *node) { - assert(node); - return node->op == op_Proj || - (!get_interprocedural_view() && node->op == op_Filter); +/* 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); } /* Returns true if the operation manipulates control flow. */ -int -is_cfop(const ir_node *node) { - return is_cfopcode(get_irn_op(node)); +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)); } -/* Returns true if the operation manipulates interprocedural control flow: - CallBegin, EndReg, EndExcept */ -int is_ip_cfop(const ir_node *node) { - return is_ip_cfopcode(get_irn_op(node)); +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) { +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) { +ir_node *get_fragile_op_mem(ir_node *node) +{ assert(node && is_fragile_op(node)); - - switch (get_irn_opcode(node)) { - case iro_Call : - case iro_Quot : - case iro_DivMod: - case iro_Div : - case iro_Mod : - case iro_Load : - case iro_Store : - case iro_Alloc : - case iro_Bound : - return get_irn_n(node, 0); - case iro_Bad : - case iro_Unknown: - return node; - default: ; - assert(0 && "should not be reached"); - return NULL; - } -} - -/* Returns the result mode of a Div operation. */ -ir_mode *get_divop_resmod(const ir_node *node) { - switch (get_irn_opcode(node)) { - case iro_Quot : return get_Quot_resmode(node); - case iro_DivMod: return get_DivMod_resmode(node); - case iro_Div : return get_Div_resmode(node); - case iro_Mod : return get_Mod_resmode(node); - default: ; - assert(0 && "should not be reached"); - return NULL; - } + 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); +int (is_irn_forking)(const ir_node *node) +{ + return is_irn_forking_(node); } -/* Return the type associated with the value produced by n - * if the node remarks this type as it is the case for - * Cast, Const, SymConst and some Proj nodes. */ -ir_type *(get_irn_type)(ir_node *node) { - return _get_irn_type(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); } /* 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); +ir_type *(get_irn_type_attr)(ir_node *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); +ir_entity *(get_irn_entity_attr)(ir_node *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); +int (is_irn_constlike)(const ir_node *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); +int (is_irn_keep)(const ir_node *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); +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); +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); +int (is_irn_machine_operand)(const ir_node *node) +{ + return is_irn_machine_operand_(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); +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); +} /* Gets the string representation of the jump prediction .*/ -const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) { +const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) +{ +#define X(a) case a: return #a switch (pred) { - default: - case COND_JMP_PRED_NONE: return "no prediction"; - case COND_JMP_PRED_TRUE: return "true taken"; - case COND_JMP_PRED_FALSE: return "false taken"; - } -} - -/* Returns the conditional jump prediction of a Cond node. */ -cond_jmp_predicate (get_Cond_jmp_pred)(const ir_node *cond) { - return _get_Cond_jmp_pred(cond); -} - -/* Sets a new conditional jump prediction. */ -void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) { - _set_Cond_jmp_pred(cond, pred); -} - -/** the get_type operation must be always implemented and return a firm type */ -static ir_type *get_Default_type(ir_node *n) { - return get_unknown_type(); -} - -/* Sets the get_type operation for an ir_op_ops. */ -ir_op_ops *firm_set_default_get_type(ir_opcode code, ir_op_ops *ops) { - switch (code) { - case iro_Const: ops->get_type = get_Const_type; break; - case iro_SymConst: ops->get_type = get_SymConst_value_type; break; - case iro_Cast: ops->get_type = get_Cast_type; break; - case iro_Proj: ops->get_type = get_Proj_type; break; - default: - /* not allowed to be NULL */ - if (! ops->get_type) - ops->get_type = get_Default_type; - break; + X(COND_JMP_PRED_NONE); + X(COND_JMP_PRED_TRUE); + X(COND_JMP_PRED_FALSE); } - return ops; + return ""; +#undef X } /** Return the attribute type of a SymConst node if exists */ -static ir_type *get_SymConst_attr_type(ir_node *self) { +static ir_type *get_SymConst_attr_type(const ir_node *self) +{ symconst_kind kind = get_SymConst_kind(self); if (SYMCONST_HAS_TYPE(kind)) return get_SymConst_type(self); @@ -2837,7 +1638,8 @@ static ir_type *get_SymConst_attr_type(ir_node *self) { } /** Return the attribute entity of a SymConst node if exists */ -static ir_entity *get_SymConst_attr_entity(ir_node *self) { +static ir_entity *get_SymConst_attr_entity(const ir_node *self) +{ symconst_kind kind = get_SymConst_kind(self); if (SYMCONST_HAS_ENT(kind)) return get_SymConst_entity(self); @@ -2845,12 +1647,15 @@ static ir_entity *get_SymConst_attr_entity(ir_node *self) { } /** the get_type_attr operation must be always implemented */ -static ir_type *get_Null_type(ir_node *n) { +static ir_type *get_Null_type(const ir_node *n) +{ + (void) n; return firm_unknown_type; } /* Sets the get_type operation for an ir_op_ops. */ -ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) { +ir_op_ops *firm_set_default_get_type_attr(unsigned code, ir_op_ops *ops) +{ 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; @@ -2867,12 +1672,15 @@ ir_op_ops *firm_set_default_get_type_attr(ir_opcode code, ir_op_ops *ops) { } /** the get_entity_attr operation must be always implemented */ -static ir_entity *get_Null_ent(ir_node *n) { +static ir_entity *get_Null_ent(const ir_node *n) +{ + (void) n; return NULL; } /* Sets the get_type operation for an ir_op_ops. */ -ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *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; @@ -2885,23 +1693,49 @@ ir_op_ops *firm_set_default_get_entity_attr(ir_opcode code, ir_op_ops *ops) { return ops; } -#ifdef DEBUG_libfirm -void dump_irn(ir_node *n) { - int i, arity = get_irn_arity(n); - printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n); - if (!is_Block(n)) { - ir_node *pred = get_irn_n(n, -1); - printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)), - get_irn_node_nr(pred), (void *)pred); - } - printf(" preds: \n"); - for (i = 0; i < arity; ++i) { - ir_node *pred = get_irn_n(n, i); - printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)), - get_irn_node_nr(pred), (void *)pred); +/* Sets the debug information of a node. */ +void (set_irn_dbg_info)(ir_node *n, dbg_info *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); +} + +/* + * Calculate a hash value of a node. + */ +unsigned firm_default_hash(const ir_node *node) +{ + unsigned h; + int i, irn_arity; + + /* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */ + h = irn_arity = get_irn_arity(node); + + /* 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); } + + /* ...mode,... */ + h = 9*h + HASH_PTR(get_irn_mode(node)); + /* ...and code */ + h = 9*h + HASH_PTR(get_irn_op(node)); + + return h; } -#else /* DEBUG_libfirm */ -void dump_irn(ir_node *n) {} -#endif /* DEBUG_libfirm */ +/* include generated code */ +#include "gen_irnode.c.inl"