X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=d2762252a4e64041c827d6bae2b7d127bf45dbe8;hb=357886575cb0becb5bd9be376fde49b57edd5385;hp=3cb9e7639b57da1f2177e4cabcda3ca8f3d74aee;hpb=f8d7cadcac7404b56a67f0c6b6cd71a76cda9bd6;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 3cb9e7639..d2762252a 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.c @@ -43,6 +43,7 @@ #include "irhooks.h" #include "irtools.h" +#include "util.h" #include "beinfo.h" @@ -54,47 +55,43 @@ #define RETURN_RESULT_OFFSET 1 /* mem is not a result */ #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) +const char *get_relation_string(ir_relation relation) { - assert(pnc >= 0 && pnc < - (int) (sizeof(pnc_name_arr)/sizeof(pnc_name_arr[0]))); - return pnc_name_arr[pnc]; + assert(relation < (ir_relation)ARRAY_SIZE(relation_names)); + return relation_names[relation]; } -/* - * Calculates the negated (Complement(R)) pnc condition. - */ -pn_Cmp get_negated_pnc(long pnc, ir_mode *mode) +ir_relation get_negated_relation(ir_relation relation) { - 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 (pn_Cmp) pnc; + return relation ^ ir_relation_true; } -/* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */ -pn_Cmp get_inversed_pnc(long pnc) +ir_relation get_inversed_relation(ir_relation relation) { - long code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt); - long lesser = pnc & pn_Cmp_Lt; - long greater = pnc & pn_Cmp_Gt; - - code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0); - - return (pn_Cmp) code; + 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; } /** @@ -144,7 +141,7 @@ struct struct_align { * 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_mode *mode, int arity, ir_node *const *in) { ir_node *res; unsigned align = offsetof(struct struct_align, s) - 1; @@ -156,7 +153,7 @@ ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, assert(irg); assert(op); assert(mode); - p = obstack_alloc(irg->obst, node_size); + p = (char*)obstack_alloc(irg->obst, node_size); memset(p, 0, node_size); res = (ir_node *)(p + add_node_size); @@ -237,16 +234,16 @@ void set_irn_in(ir_node *node, int arity, ir_node **in) for (i = 0; i < arity; i++) { - if (i < ARR_LEN(*pOld_in)-1) + 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); } - for (;i < ARR_LEN(*pOld_in)-1; i++) { + for (;i < (int)ARR_LEN(*pOld_in)-1; i++) { edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg); } - if (arity != ARR_LEN(*pOld_in) - 1) { + 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; @@ -254,6 +251,10 @@ void set_irn_in(ir_node *node, int arity, ir_node **in) fix_backedges(irg->obst, node); memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity); + + /* update irg flags */ + set_irg_outs_inconsistent(irg); + set_irg_loopinfo_inconsistent(irg); } ir_node *(get_irn_n)(const ir_node *node, int n) @@ -276,6 +277,10 @@ void set_irn_n(ir_node *node, int n, ir_node *in) edges_notify_edge(node, n, in, node->in[n + 1], irg); node->in[n + 1] = in; + + /* update irg flags */ + set_irg_outs_inconsistent(irg); + set_irg_loopinfo_inconsistent(irg); } int add_irn_n(ir_node *node, ir_node *in) @@ -372,19 +377,6 @@ void (set_irn_mode)(ir_node *node, ir_mode *mode) _set_irn_mode(node, mode); } -/** Gets the string representation of the mode .*/ -const char *get_irn_modename(const ir_node *node) -{ - assert(node); - return get_mode_name(node->mode); -} - -ident *get_irn_modeident(const ir_node *node) -{ - assert(node); - return get_mode_ident(node->mode); -} - ir_op *(get_irn_op)(const ir_node *node) { return _get_irn_op(node); @@ -532,19 +524,6 @@ ir_type *is_frame_pointer(const ir_node *n) 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(const ir_node *n) -{ - if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_tls)) { - ir_node *start = get_Proj_pred(n); - if (is_Start(start)) { - return get_tls_type(); - } - } - return NULL; -} - ir_node **get_Block_cfgpred_arr(ir_node *node) { assert(is_Block(node)); @@ -615,16 +594,6 @@ int (Block_block_visited)(const ir_node *node) return _Block_block_visited(node); } -ir_node *(set_Block_dead)(ir_node *block) -{ - return _set_Block_dead(block); -} - -int (is_Block_dead)(const ir_node *block) -{ - return _is_Block_dead(block); -} - ir_extblk *get_Block_extbb(const ir_node *block) { ir_extblk *res; @@ -742,12 +711,13 @@ void set_End_keepalive(ir_node *end, int pos, ir_node *ka) /* Set new keep-alives */ void set_End_keepalives(ir_node *end, int n, ir_node *in[]) { - int i; + 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); @@ -755,6 +725,9 @@ 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 */ + set_irg_outs_inconsistent(irg); } /* Set new keep-alives from old keep-alives, skipping irn */ @@ -790,6 +763,9 @@ found: } /* now n - 1 keeps, 1 block input */ ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET); + + /* update irg flags */ + set_irg_outs_inconsistent(irg); } /* remove Bads, NoMems and doublets from the keep-alive set */ @@ -798,6 +774,7 @@ 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; if (n <= 0) return; @@ -809,6 +786,7 @@ void remove_End_Bads_and_doublets(ir_node *end) ir_node *ka = get_End_keepalive(end, idx); 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); @@ -828,6 +806,10 @@ void remove_End_Bads_and_doublets(ir_node *end) ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET); pset_new_destroy(&keeps); + + if (changed) { + set_irg_outs_inconsistent(irg); + } } void free_End(ir_node *end) @@ -839,10 +821,10 @@ void free_End(ir_node *end) in array afterwards ... */ } -int get_Return_n_ress(const ir_node *node) +size_t get_Return_n_ress(const ir_node *node) { assert(is_Return(node)); - return (get_irn_arity(node) - RETURN_RESULT_OFFSET); + return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET); } ir_node **get_Return_res_arr(ir_node *node) @@ -854,17 +836,11 @@ ir_node **get_Return_res_arr(ir_node *node) return NULL; } -/* -void set_Return_n_res(ir_node *node, int results) -{ - assert(is_Return(node)); -} -*/ - ir_node *get_Return_res(const ir_node *node, int pos) { assert(is_Return(node)); - assert(get_Return_n_ress(node) > pos); + assert(pos >= 0); + assert(get_Return_n_ress(node) > (size_t)pos); return get_irn_n(node, pos + RETURN_RESULT_OFFSET); } @@ -986,25 +962,16 @@ void set_Sel_index(ir_node *node, int pos, ir_node *index) set_irn_n(node, pos + SEL_INDEX_OFFSET, index); } - -/* 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_param_arr(ir_node *node) { assert(is_Call(node)); return &get_irn_in(node)[CALL_PARAM_OFFSET + 1]; } -int get_Call_n_params(const ir_node *node) +size_t get_Call_n_params(const ir_node *node) { assert(is_Call(node)); - return (get_irn_arity(node) - CALL_PARAM_OFFSET); + return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET); } ir_node *get_Call_param(const ir_node *node, int pos) @@ -1075,19 +1042,19 @@ int Call_has_callees(const ir_node *node) (node->attr.call.callee_arr != NULL)); } -int get_Call_n_callees(const ir_node *node) +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(const ir_node *node, int pos) +ir_entity *get_Call_callee(const ir_node *node, size_t pos) { - assert(pos >= 0 && pos < get_Call_n_callees(node)); + 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) +void set_Call_callee_arr(ir_node *node, size_t n, ir_entity ** arr) { ir_graph *irg = get_irn_irg(node); @@ -1263,83 +1230,38 @@ void (set_Phi_next)(ir_node *phi, ir_node *next) int is_memop(const ir_node *node) { - ir_opcode code = get_irn_opcode(node); + unsigned code = get_irn_opcode(node); return (code == iro_Load || code == iro_Store); } 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_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_memop_ptr(const ir_node *node) { assert(is_memop(node)); + assert(n_Load_mem == 1 && n_Store_mem == 1); return get_irn_n(node, 1); } void set_memop_ptr(ir_node *node, ir_node *ptr) { assert(is_memop(node)); + assert(n_Load_mem == 1 && n_Store_mem == 1); set_irn_n(node, 1, ptr); } -ir_volatility get_Load_volatility(const ir_node *node) -{ - assert(is_Load(node)); - return node->attr.load.volatility; -} - -void set_Load_volatility(ir_node *node, ir_volatility volatility) -{ - assert(is_Load(node)); - node->attr.load.volatility = volatility; -} - -ir_align get_Load_align(const ir_node *node) -{ - assert(is_Load(node)); - return node->attr.load.aligned; -} - -void set_Load_align(ir_node *node, ir_align align) -{ - assert(is_Load(node)); - node->attr.load.aligned = align; -} - - -ir_volatility get_Store_volatility(const ir_node *node) -{ - assert(is_Store(node)); - return node->attr.store.volatility; -} - -void set_Store_volatility(ir_node *node, ir_volatility volatility) -{ - assert(is_Store(node)); - node->attr.store.volatility = volatility; -} - -ir_align get_Store_align(const ir_node *node) -{ - assert(is_Store(node)); - return node->attr.store.aligned; -} - -void set_Store_align(ir_node *node, ir_align align) -{ - assert(is_Store(node)); - node->attr.store.aligned = align; -} - ir_node **get_Sync_preds_arr(ir_node *node) { @@ -1379,55 +1301,31 @@ void add_Sync_pred(ir_node *node, ir_node *pred) add_irn_n(node, pred); } -/* Returns the source language type of a Proj node. */ -ir_type *get_Proj_type(const 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 (is_Start(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 (is_Call(pred_pred)) { - 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; -} - -long get_Proj_proj(const ir_node *node) +int (is_arg_Proj)(const ir_node *node) { - assert(is_Proj(node)); - return node->attr.proj; + return _is_arg_Proj(node); } -void set_Proj_proj(ir_node *node, long proj) +int is_x_except_Proj(const ir_node *node) { - assert(is_Proj(node)); - node->attr.proj = proj; + 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; } -int (is_arg_Proj)(const ir_node *node) +int is_x_regular_Proj(const ir_node *node) { - return _is_arg_Proj(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; } ir_node **get_Tuple_preds_arr(ir_node *node) @@ -1629,6 +1527,11 @@ int is_cfop(const ir_node *node) return is_op_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) @@ -1640,38 +1543,7 @@ int is_fragile_op(const 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 : - case iro_CopyB : - return get_irn_n(node, pn_Generic_M); - case iro_Bad : - case iro_Unknown: - return node; - default: - panic("should not be reached"); - } -} - -/* 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: - panic("should not be reached"); - } + return get_irn_n(node, node->op->fragile_mem_index); } /* Returns true if the operation is a forking control flow operation. */ @@ -1784,7 +1656,7 @@ static ir_type *get_Null_type(const ir_node *n) } /* 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; @@ -1809,7 +1681,7 @@ static ir_entity *get_Null_ent(const ir_node *n) } /* 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;