X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=502c6330157232183f6ab7708b7772da6f6e13ea;hb=53db8c6b991513550a39ed328d664746fe78f8af;hp=5a8a7b26f4d925e1a806eea7cd24d860b45c3f4e;hpb=d01eb713204e91d6deea2affb17189e1eaafd1b2;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 5a8a7b26f..502c63301 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.c @@ -30,6 +30,7 @@ #include "iredges_t.h" #include "irhooks.h" +#include "irtools.h" /* some constants fixing the positions of nodes predecessors in the in array */ @@ -40,10 +41,10 @@ #define END_KEEPALIVE_OFFSET 0 static const char *pnc_name_arr [] = { - "False", "Eq", "Lt", "Le", - "Gt", "Ge", "Lg", "Leg", "Uo", - "Ue", "Ul", "Ule", "Ug", "Uge", - "Ne", "True" + "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" }; /** @@ -158,16 +159,16 @@ new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mo #if FIRM_EDGES_INPLACE { - int i, n; - int not_a_block = is_no_Block(res); + int i; + int is_bl = is_Block(res); INIT_LIST_HEAD(&res->edge_info.outs_head); - if(!not_a_block) + if(is_bl) INIT_LIST_HEAD(&res->attr.block.succ_head); - for (i = 0, n = arity + not_a_block; i < n; ++i) - edges_notify_edge(res, i - not_a_block, res->in[i], NULL, irg); + for (i = is_bl; i <= arity; ++i) + edges_notify_edge(res, i - 1, res->in[i], NULL, irg); } #endif @@ -225,6 +226,7 @@ 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) { @@ -241,20 +243,20 @@ set_irn_in (ir_node *node, int arity, ir_node **in) { for (i = 0; i < arity; i++) { if (i < ARR_LEN(*arr)-1) - edges_notify_edge(node, i, in[i], (*arr)[i+1], current_ir_graph); + edges_notify_edge(node, i, in[i], (*arr)[i+1], irg); else - edges_notify_edge(node, i, in[i], NULL, current_ir_graph); + 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], current_ir_graph); + edges_notify_edge(node, i, NULL, (*arr)[i+1], irg); } if (arity != ARR_LEN(*arr) - 1) { ir_node * block = (*arr)[0]; - *arr = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1); + *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1); (*arr)[0] = block; } - fix_backedges(current_ir_graph->obst, node); + fix_backedges(irg->obst, node); memcpy((*arr) + 1, in, sizeof(ir_node *) * arity); } @@ -465,13 +467,12 @@ void firm_set_irn_section(ir_node *n, struct section *s) {} /* 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)node; + return (long)PTR_TO_INT(node); #endif } @@ -510,7 +511,7 @@ get_irn_symconst_attr (ir_node *node) return node->attr.i; } -type * +ir_type * get_irn_call_attr (ir_node *node) { assert (node->op == op_Call); @@ -583,7 +584,7 @@ set_nodes_block (ir_node *node, ir_node *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. */ -type *is_frame_pointer(ir_node *n) { +ir_type *is_frame_pointer(ir_node *n) { if ((get_irn_op(n) == op_Proj) && (get_Proj_proj(n) == pn_Start_P_frame_base)) { ir_node *start = get_Proj_pred(n); @@ -596,7 +597,7 @@ type *is_frame_pointer(ir_node *n) { /* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals) * from Start. If so returns global type, else Null. */ -type *is_globals_pointer(ir_node *n) { +ir_type *is_globals_pointer(ir_node *n) { if ((get_irn_op(n) == op_Proj) && (get_Proj_proj(n) == pn_Start_P_globals)) { ir_node *start = get_Proj_pred(n); @@ -630,12 +631,12 @@ get_Block_cfgpred_arr (ir_node *node) int (get_Block_n_cfgpreds)(ir_node *node) { - return get_Block_n_cfgpreds(node); + return _get_Block_n_cfgpreds(node); } ir_node * (get_Block_cfgpred)(ir_node *node, int pos) { - return get_Block_cfgpred(node, pos); + return _get_Block_cfgpred(node, pos); } void @@ -748,22 +749,19 @@ int (is_Block_dead)(const ir_node *block) { } ir_extblk *get_Block_extbb(const ir_node *block) { + ir_extblk *res; assert(is_Block(block)); - return block->attr.block.extblk; + res = block->attr.block.extblk; + assert(res == NULL || is_ir_extbb(res)); + return res; } void set_Block_extbb(ir_node *block, ir_extblk *extblk) { assert(is_Block(block)); + assert(extblk == NULL || is_ir_extbb(extblk)); block->attr.block.extblk = extblk; } -void -set_Start_irg(ir_node *node, ir_graph *irg) { - assert(node->op == op_Start); - assert(is_ir_graph(irg)); - assert(0 && " Why set irg? -- use set_irn_irg"); -} - int get_End_n_keepalives(ir_node *end) { assert (end->op == op_End); @@ -918,30 +916,6 @@ set_Return_res (ir_node *node, int pos, ir_node *res){ set_irn_n(node, pos + RETURN_RESULT_OFFSET, res); } -ir_node * -get_Raise_mem (ir_node *node) { - assert (node->op == op_Raise); - return get_irn_n(node, 0); -} - -void -set_Raise_mem (ir_node *node, ir_node *mem) { - assert (node->op == op_Raise); - set_irn_n(node, 0, mem); -} - -ir_node * -get_Raise_exo_ptr (ir_node *node) { - assert (node->op == op_Raise); - return get_irn_n(node, 1); -} - -void -set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) { - assert (node->op == op_Raise); - set_irn_n(node, 1, exo_ptr); -} - tarval *(get_Const_tarval)(ir_node *node) { return _get_Const_tarval(node); } @@ -961,14 +935,14 @@ cnst_classify_t (classify_Const)(ir_node *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. */ -type * +ir_type * get_Const_type (ir_node *node) { assert (node->op == op_Const); return node->attr.con.tp; } void -set_Const_type (ir_node *node, type *tp) { +set_Const_type (ir_node *node, ir_type *tp) { assert (node->op == op_Const); if (tp != firm_unknown_type) { assert (is_atomic_type(tp)); @@ -990,7 +964,7 @@ set_SymConst_kind (ir_node *node, symconst_kind num) { node->attr.i.num = num; } -type * +ir_type * get_SymConst_type (ir_node *node) { assert ( (node->op == op_SymConst) && ( get_SymConst_kind(node) == symconst_type_tag @@ -999,7 +973,7 @@ get_SymConst_type (ir_node *node) { } void -set_SymConst_type (ir_node *node, type *tp) { +set_SymConst_type (ir_node *node, ir_type *tp) { assert ( (node->op == op_SymConst) && ( get_SymConst_kind(node) == symconst_type_tag || get_SymConst_kind(node) == symconst_size)); @@ -1047,7 +1021,7 @@ set_SymConst_symbol (ir_node *node, union symconst_symbol sym) { node->attr.i.sym = sym; } -type * +ir_type * get_SymConst_value_type (ir_node *node) { assert (node->op == op_SymConst); if (node->attr.i.tp) node->attr.i.tp = skip_tid(node->attr.i.tp); @@ -1055,7 +1029,7 @@ get_SymConst_value_type (ir_node *node) { } void -set_SymConst_value_type (ir_node *node, type *tp) { +set_SymConst_value_type (ir_node *node, ir_type *tp) { assert (node->op == op_SymConst); node->attr.i.tp = tp; } @@ -1124,42 +1098,6 @@ set_Sel_entity (ir_node *node, entity *ent) { node->attr.s.ent = ent; } -type * -get_InstOf_ent (ir_node *node) { - assert (node->op = op_InstOf); - return (node->attr.io.ent); -} - -void -set_InstOf_ent (ir_node *node, type *ent) { - assert (node->op = op_InstOf); - node->attr.io.ent = ent; -} - -ir_node * -get_InstOf_store (ir_node *node) { - assert (node->op = op_InstOf); - 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); -} - -ir_node * -get_InstOf_obj (ir_node *node) { - assert (node->op = op_InstOf); - 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); -} - /* For unary and binary arithmetic operations the access to the operands can be factored out. Left is the first, right the @@ -1229,14 +1167,14 @@ set_Call_param (ir_node *node, int pos, ir_node *param) { set_irn_n(node, pos + CALL_PARAM_OFFSET, param); } -type * +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); } void -set_Call_type (ir_node *node, type *tp) { +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; @@ -1390,14 +1328,14 @@ BINOP(Cmp) UNOP(Conv) UNOP(Cast) -type * +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, type *to_tp) { +set_Cast_type (ir_node *node, ir_type *to_tp) { assert (node->op == op_Cast); node->attr.cast.totype = to_tp; } @@ -1408,8 +1346,8 @@ set_Cast_type (ir_node *node, type *to_tp) { * Returns true if the Cast node casts a class type to a super type. */ int is_Cast_upcast(ir_node *node) { - type *totype = get_Cast_type(node); - type *fromtype = get_irn_typeinfo_type(get_Cast_op(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); @@ -1431,8 +1369,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) { - type *totype = get_Cast_type(node); - type *fromtype = get_irn_typeinfo_type(get_Cast_op(node)); + ir_type *totype = get_Cast_type(node); + ir_type *fromtype = get_irn_typeinfo_type(get_Cast_op(node)); assert(get_irg_typeinfo_state(get_irn_irg(node)) == ir_typeinfo_consistent); assert(fromtype); @@ -1709,14 +1647,14 @@ set_Alloc_size (ir_node *node, ir_node *size) { set_irn_n(node, 1, size); } -type * +ir_type * get_Alloc_type (ir_node *node) { assert (node->op == op_Alloc); return node->attr.a.type = skip_tid(node->attr.a.type); } void -set_Alloc_type (ir_node *node, type *tp) { +set_Alloc_type (ir_node *node, ir_type *tp) { assert (node->op == op_Alloc); node->attr.a.type = tp; } @@ -1770,14 +1708,14 @@ set_Free_size (ir_node *node, ir_node *size) { set_irn_n(node, 2, size); } -type * +ir_type * get_Free_type (ir_node *node) { assert (node->op == op_Free); return node->attr.f.type = skip_tid(node->attr.f.type); } void -set_Free_type (ir_node *node, type *tp) { +set_Free_type (ir_node *node, ir_type *tp) { assert (node->op == op_Free); node->attr.f.type = tp; } @@ -1825,9 +1763,9 @@ set_Sync_pred (ir_node *node, int pos, ir_node *pred) { set_irn_n(node, pos, pred); } -type *get_Proj_type(ir_node *n) +ir_type *get_Proj_type(ir_node *n) { - type *tp = NULL; + ir_type *tp = NULL; ir_node *pred = get_Proj_pred(n); switch (get_irn_opcode(pred)) { @@ -1837,10 +1775,10 @@ type *get_Proj_type(ir_node *n) assert(get_irn_mode(pred) == mode_T); pred_pred = get_Proj_pred(pred); if (get_irn_op(pred_pred) == op_Start) { - type *mtp = get_entity_type(get_irg_entity(get_irn_irg(pred_pred))); + 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) { - type *mtp = get_Call_type(pred_pred); + ir_type *mtp = get_Call_type(pred_pred); tp = get_method_res_type(mtp, get_Proj_proj(n)); } } break; @@ -1848,7 +1786,7 @@ type *get_Proj_type(ir_node *n) case iro_Call: break; case iro_Load: { ir_node *a = get_Load_ptr(pred); - if (get_irn_op(a) == op_Sel) + if (is_Sel(a)) tp = get_entity_type(get_Sel_entity(a)); } break; default: @@ -2009,30 +1947,105 @@ ir_node *get_Filter_cg_pred(ir_node *node, int pos) { /* 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) { - assert(node->op == op_Mux); - node->in[1] = 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) { - assert(node->op == op_Mux); - node->in[2] = 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) { - assert(node->op == op_Mux); - node->in[3] = 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; + } +} + +/* 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 node->in[1 + 2 * pos]; +} + +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); + node->in[1 + 2 * pos] = cond; +} + +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 node->in[1 + 2 * pos + 1]; +} + +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); + node->in[1 + 2 * pos + 1] = val; +} + +ir_node *get_Psi_default(ir_node *node) { + int def_pos = get_irn_arity(node); + assert(node->op == op_Psi); + return node->in[def_pos]; +} + +void set_Psi_default(ir_node *node, ir_node *val) { + int def_pos = get_irn_arity(node); + assert(node->op == op_Psi); + node->in[def_pos] = node; +} + +int (get_Psi_n_conds)(ir_node *node) { + return _get_Psi_n_conds(node); } /* CopyB support */ @@ -2066,17 +2079,125 @@ void set_CopyB_src (ir_node *node, ir_node *src) { set_irn_n(node, 2, src); } -type *get_CopyB_type(ir_node *node) { +ir_type *get_CopyB_type(ir_node *node) { assert (node->op == op_CopyB); return node->attr.copyb.data_type; } -void set_CopyB_type(ir_node *node, type *data_type) { +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; } +ir_type * +get_InstOf_type (ir_node *node) { + assert (node->op = op_InstOf); + return node->attr.io.type; +} + +void +set_InstOf_type (ir_node *node, ir_type *type) { + assert (node->op = op_InstOf); + node->attr.io.type = type; +} + +ir_node * +get_InstOf_store (ir_node *node) { + assert (node->op = op_InstOf); + 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); +} + +ir_node * +get_InstOf_obj (ir_node *node) { + assert (node->op = op_InstOf); + 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); +} + +/* 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); +} + +void +set_Raise_mem (ir_node *node, ir_node *mem) { + assert (node->op == op_Raise); + set_irn_n(node, 0, mem); +} + +ir_node * +get_Raise_exo_ptr (ir_node *node) { + assert (node->op == op_Raise); + return get_irn_n(node, 1); +} + +void +set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) { + assert (node->op == op_Raise); + set_irn_n(node, 1, exo_ptr); +} + +/* Bound support */ + +/* 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); +} + +void set_Bound_mem (ir_node *bound, ir_node *mem) { + assert (bound->op == op_Bound); + set_irn_n(bound, 0, mem); +} + +/* 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); +} + +void set_Bound_index(ir_node *bound, ir_node *idx) { + assert (bound->op == op_Bound); + set_irn_n(bound, 1, idx); +} + +/* 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); +} + +void set_Bound_lower(ir_node *bound, ir_node *lower) { + assert (bound->op == op_Bound); + set_irn_n(bound, 2, lower); +} + +/* 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); +} + +void set_Bound_upper(ir_node *bound, ir_node *upper) { + assert (bound->op == op_Bound); + set_irn_n(bound, 3, upper); +} + +/* returns the graph of a node */ ir_graph * get_irn_irg(const ir_node *node) { /* @@ -2165,14 +2286,15 @@ ir_node *skip_HighLevel(ir_node *node) { #if 0 /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity - than any other approach, as Id chains are resolved and all point to the real node, or - all id's are self loops. */ + * than any other approach, as Id chains are resolved and all point to the real node, or + * all id's are self loops. + * + * Moreover, it CANNOT be switched off using get_opt_normalize() ... + */ ir_node * skip_Id (ir_node *node) { /* don't assert node !!! */ - if (!get_opt_normalize()) return node; - /* Don't use get_Id_pred: We get into an endless loop for self-referencing Ids. */ if (node && (node->op == op_Id) && (node != node->in[0+1])) { @@ -2193,8 +2315,14 @@ skip_Id (ir_node *node) { } #else /* This should compact Id-cycles to self-cycles. It has the same (or less?) complexity - than any other approach, as Id chains are resolved and all point to the real node, or - all id's are self loops. */ + * than any other approach, as Id chains are resolved and all point to the real node, or + * all id's are self loops. + * + * Note: This function takes 10% of mostly ANY the compiler run, so it's + * a little bit "hand optimized". + * + * Moreover, it CANNOT be switched off using get_opt_normalize() ... + */ ir_node * skip_Id (ir_node *node) { ir_node *pred; @@ -2202,9 +2330,7 @@ skip_Id (ir_node *node) { if (!node || (node->op != op_Id)) return node; - if (!get_opt_normalize()) return node; - - /* Don't use get_Id_pred: We get into an endless loop for + /* Don't use get_Id_pred(): We get into an endless loop for self-referencing Ids. */ pred = node->in[0+1]; @@ -2230,6 +2356,16 @@ skip_Id (ir_node *node) { } #endif +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); @@ -2250,12 +2386,36 @@ int return _is_Block(node); } -/* returns true if node is a Unknown 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); +} + int is_Proj (const ir_node *node) { assert(node); @@ -2310,15 +2470,37 @@ int (is_irn_forking)(const ir_node *node) { return _is_irn_forking(node); } -type *(get_irn_type)(ir_node *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); } +/* Return the type attribute of a node n (SymConst, Call, Alloc, Free, + Cast) or NULL.*/ +ir_type *(get_irn_type_attr)(ir_node *node) { + return _get_irn_type_attr(node); +} + +/* Return the entity attribute of a node n (SymConst, Sel) or NULL. */ +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); } +/* + * 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); +} + /* Gets the string representation of the jump prediction .*/ const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) { @@ -2340,9 +2522,9 @@ 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 */ -static type *get_Null_type(ir_node *n) { - return NULL; +/** 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. */ @@ -2356,7 +2538,66 @@ ir_op_ops *firm_set_default_get_type(opcode code, ir_op_ops *ops) default: /* not allowed to be NULL */ if (! ops->get_type) - ops->get_type = get_Null_type; + ops->get_type = get_Default_type; + break; + } + return ops; +} + +/** Return the attribute type of a SymConst node if exists */ +static ir_type *get_SymConst_attr_type(ir_node *self) { + symconst_kind kind = get_SymConst_kind(self); + if (kind == symconst_type_tag || kind == symconst_size) + return get_SymConst_type(self); + return NULL; +} + +/** Return the attribute entity of a SymConst node if exists */ +static entity *get_SymConst_attr_entity(ir_node *self) { + symconst_kind kind = get_SymConst_kind(self); + if (kind == symconst_addr_ent) + return get_SymConst_entity(self); + return NULL; +} + +/** the get_type_attr operation must be always implemented */ +static ir_type *get_Null_type(ir_node *n) { + return firm_unknown_type; +} + +/* Sets the get_type operation for an ir_op_ops. */ +ir_op_ops *firm_set_default_get_type_attr(opcode 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; + case iro_Alloc: ops->get_type_attr = get_Alloc_type; break; + case iro_Free: ops->get_type_attr = get_Free_type; break; + case iro_Cast: ops->get_type_attr = get_Cast_type; break; + default: + /* not allowed to be NULL */ + if (! ops->get_type_attr) + ops->get_type_attr = get_Null_type; + break; + } + return ops; +} + +/** the get_entity_attr operation must be always implemented */ +static entity *get_Null_ent(ir_node *n) { + return NULL; +} + +/* Sets the get_type operation for an ir_op_ops. */ +ir_op_ops *firm_set_default_get_entity_attr(opcode code, ir_op_ops *ops) +{ + switch (code) { + case iro_SymConst: ops->get_entity_attr = get_SymConst_attr_entity; break; + case iro_Sel: ops->get_entity_attr = get_Sel_entity; break; + default: + /* not allowed to be NULL */ + if (! ops->get_entity_attr) + ops->get_entity_attr = get_Null_ent; break; } return ops;