X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=224f1fdccd3702b4c71b6fd8f553883af13eba2e;hb=16d8de24b7945a58705aa754530955768ca35486;hp=5fe1675e63e9e2b17ba5caefe8e900aa97f5596d;hpb=c9bea48f570667bbc5d50504a8e6372260d73145;p=libfirm diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c index 5fe1675e6..224f1fdcc 100644 --- a/ir/ir/irnode.c +++ b/ir/ir/irnode.c @@ -29,10 +29,11 @@ /* some constants fixing the positions of nodes predecessors in the in array */ -#define CALL_PARAM_OFFSET 2 -#define SEL_INDEX_OFFSET 2 -#define RETURN_RESULT_OFFSET 1 /* mem is not a result */ -#define END_KEEPALIVE_OFFSET 0 +#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 END_KEEPALIVE_OFFSET 0 static const char *pnc_name_arr [] = { "False", "Eq", "Lt", "Le", @@ -222,7 +223,8 @@ ir_node * void set_irn_n (ir_node *node, int n, ir_node *in) { - assert(node && -1 <= n && n < get_irn_arity(node)); + assert(node && node->kind == k_ir_node && -1 <= n && 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; @@ -351,6 +353,26 @@ void * return __get_irn_link(node); } + +#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; +} +#endif /* DO_HEAPANALYSIS */ + + /* Outputs a unique number for this node */ long get_irn_node_nr(const ir_node *node) { @@ -436,13 +458,13 @@ get_irn_block_attr (ir_node *node) /* this works for all except Block */ ir_node * -get_nodes_Block (ir_node *node) { +get_nodes_block (ir_node *node) { assert (!(node->op == op_Block)); return get_irn_n(node, -1); } void -set_nodes_Block (ir_node *node, ir_node *block) { +set_nodes_block (ir_node *node, ir_node *block) { assert (!(node->op == op_Block)); set_irn_n(node, -1, block); } @@ -580,12 +602,12 @@ get_Block_handler (ir_node *block) { / * handler handling for Nodes * / void set_Node_handler (ir_node *node, ir_node *handler) { - set_Block_handler (get_nodes_Block (node), handler); + set_Block_handler (get_nodes_block (node), handler); } ir_node * get_Node_handler (ir_node *node) { - return (get_Block_handler (get_nodes_Block (node))); + return (get_Block_handler (get_nodes_block (node))); } / * exc_t handling for Blocks * / @@ -601,11 +623,11 @@ exc_t get_Block_exc (ir_node *block) { / * exc_t handling for Nodes * / void set_Node_exc (ir_node *node, exc_t exc) { - set_Block_exc (get_nodes_Block (node), exc); + set_Block_exc (get_nodes_block (node), exc); } exc_t get_Node_exc (ir_node *node) { - return (get_Block_exc (get_nodes_Block (node))); + return (get_Block_exc (get_nodes_block (node))); } */ @@ -654,12 +676,6 @@ void remove_Block_cg_cfgpred_arr(ir_node * node) { node->attr.block.in_cg = NULL; } -/* Start references the irg it is in. */ -ir_graph * -get_Start_irg(ir_node *node) { - return get_irn_irg(node); -} - void set_Start_irg(ir_node *node, ir_graph *irg) { assert(node->op == op_Start); @@ -700,13 +716,6 @@ free_End (ir_node *end) { in array afterwards ... */ } -ir_graph *get_EndReg_irg (ir_node *end) { - return get_irn_irg(end); -} - -ir_graph *get_EndExcept_irg (ir_node *end) { - return get_irn_irg(end); -} /* > Implementing the case construct (which is where the constant Proj node is @@ -868,10 +877,6 @@ set_Const_type (ir_node *node, type *tp) { if (tp != unknown_type) { assert (is_atomic_type(tp)); assert (get_type_mode(tp) == get_irn_mode(node)); - assert (!tarval_is_entity(get_Const_tarval(node)) || - (is_pointer_type(tp) && - (get_pointer_points_to_type(tp) == - get_entity_type(get_tarval_entity(get_Const_tarval(node)))))); } node->attr.con.tp = tp; @@ -935,14 +940,14 @@ void set_SymConst_entity (ir_node *node, entity *ent) { } -symconst_symbol -get_SymConst_type_or_id (ir_node *node) { +union symconst_symbol +get_SymConst_symbol (ir_node *node) { assert (node->op == op_SymConst); return node->attr.i.sym; } void -set_SymConst_type_or_id (ir_node *node, symconst_symbol sym) { +set_SymConst_symbol (ir_node *node, union symconst_symbol sym) { assert (node->op == op_SymConst); //memcpy (&(node->attr.i.sym), sym, sizeof(type_or_id)); node->attr.i.sym = sym; @@ -1131,7 +1136,9 @@ set_Call_type (ir_node *node, type *tp) { } int Call_has_callees(ir_node *node) { - return (node->attr.call.callee_arr != NULL); + + 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) { @@ -1165,9 +1172,6 @@ void set_CallBegin_ptr (ir_node *node, ir_node *ptr) { assert(node->op == op_CallBegin); set_irn_n(node, 0, ptr); } -ir_graph * get_CallBegin_irg (ir_node *node) { - return get_irn_irg(node); -} ir_node * get_CallBegin_call (ir_node *node) { assert(node->op == op_CallBegin); return node->attr.callbegin.call; @@ -1192,13 +1196,13 @@ set_FuncCall_ptr (ir_node *node, ir_node *ptr) { ir_node ** get_FuncCall_param_arr (ir_node *node) { assert (node->op == op_FuncCall); - return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET]; + return (ir_node **)&get_irn_in(node)[FUNCCALL_PARAM_OFFSET]; } int get_FuncCall_n_params (ir_node *node) { assert (node->op == op_FuncCall); - return (get_irn_arity(node) - CALL_PARAM_OFFSET); + return (get_irn_arity(node) - FUNCCALL_PARAM_OFFSET); } int @@ -1216,13 +1220,13 @@ set_FuncCall_arity (ir_node *node, ir_node *arity) { ir_node * get_FuncCall_param (ir_node *node, int pos) { assert (node->op == op_FuncCall); - return get_irn_n(node, pos + CALL_PARAM_OFFSET); + return get_irn_n(node, pos + FUNCCALL_PARAM_OFFSET); } void set_FuncCall_param (ir_node *node, int pos, ir_node *param) { assert (node->op == op_FuncCall); - set_irn_n(node, pos + CALL_PARAM_OFFSET, param); + set_irn_n(node, pos + FUNCCALL_PARAM_OFFSET, param); } type * @@ -1239,7 +1243,8 @@ set_FuncCall_type (ir_node *node, type *tp) { } int FuncCall_has_callees(ir_node *node) { - return (node->attr.call.callee_arr != NULL); + return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) && + (node->attr.call.callee_arr != NULL)); } int get_FuncCall_n_callees(ir_node * node) { @@ -1493,6 +1498,31 @@ set_Phi_pred (ir_node *node, int pos, ir_node *pred) { 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); @@ -1864,11 +1894,11 @@ skip_Tuple (ir_node *node) { if (!get_opt_normalize()) return node; - node = skip_nop(node); + node = skip_Id(node); if (get_irn_op(node) == op_Proj) { - pred = skip_nop(get_Proj_pred(node)); + pred = skip_Id(get_Proj_pred(node)); if (get_irn_op(pred) == op_Proj) /* nested Tuple ? */ - pred = skip_nop(skip_Tuple(pred)); + pred = skip_Id(skip_Tuple(pred)); if (get_irn_op(pred) == op_Tuple) return get_Tuple_pred(pred, get_Proj_proj(node)); } @@ -1878,7 +1908,7 @@ skip_Tuple (ir_node *node) { /** returns operand of node if node is a Cast */ ir_node *skip_Cast (ir_node *node) { if (node && get_irn_op(node) == op_Cast) { - return skip_nop(get_irn_n(node, 0)); + return skip_Id(get_irn_n(node, 0)); } else { return node; } @@ -1889,7 +1919,7 @@ ir_node *skip_Cast (ir_node *node) { than any other approach, as Id chains are resolved and all point to the real node, or all id's are self loops. */ ir_node * -skip_nop (ir_node *node) { +skip_Id (ir_node *node) { /* don't assert node !!! */ if (!get_opt_normalize()) return node; @@ -1903,7 +1933,7 @@ skip_nop (ir_node *node) { assert (get_irn_arity (node) > 0); node->in[0+1] = node; - res = skip_nop(rem_pred); + res = skip_Id(rem_pred); if (res->op == op_Id) /* self-loop */ return node; node->in[0+1] = res; @@ -1917,7 +1947,7 @@ skip_nop (ir_node *node) { than any other approach, as Id chains are resolved and all point to the real node, or all id's are self loops. */ ir_node * -skip_nop (ir_node *node) { +skip_Id (ir_node *node) { ir_node *pred; /* don't assert node !!! */ @@ -1940,7 +1970,7 @@ skip_nop (ir_node *node) { assert (get_irn_arity (node) > 0); node->in[0+1] = node; /* turn us into a self referencing Id: shorten Id cycles. */ - res = skip_nop(rem_pred); + res = skip_Id(rem_pred); if (res->op == op_Id) /* self-loop */ return node; node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */ @@ -1951,11 +1981,6 @@ skip_nop (ir_node *node) { } #endif -ir_node * -skip_Id (ir_node *node) { - return skip_nop(node); -} - int is_Bad (ir_node *node) { assert(node); @@ -2002,10 +2027,6 @@ int is_ip_cfop(ir_node *node) { return is_ip_cfopcode(get_irn_op(node)); } -ir_graph *get_ip_cfop_irg(ir_node *n) { - return get_irn_irg(n); -} - /* Returns true if the operation can change the control flow because of an exception. */ int