res = (ir_node *) obstack_alloc (irg->obst, node_size);
memset((void *)res, 0, node_size);
- res->kind = k_ir_node;
- res->op = op;
- res->mode = mode;
+ res->kind = k_ir_node;
+ res->op = op;
+ res->mode = mode;
res->visited = 0;
- res->link = NULL;
+ res->link = NULL;
if (arity < 0) {
res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
} else {
return __get_irn_inter_arity(node);
}
+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);
ir_node **
get_irn_in (const ir_node *node) {
assert(node);
- if (interprocedural_view) { /* handle Filter and Block specially */
+ 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;
set_irn_in (ir_node *node, int arity, ir_node **in) {
ir_node *** arr;
assert(node);
- if (interprocedural_view) { /* handle Filter and Block specially */
+ 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;
return __get_irn_inter_n (node, n);
}
+ir_node *(*__get_irn_n)(ir_node *node, int n) = __get_irn_intra_n;
+
ir_node *
(get_irn_n)(ir_node *node, int n) {
- return __get_irn_n (node, n);
+ return __get_irn_n(node, n);
}
void
node->attr.filter.in_cg[n + 1] = in;
return;
}
- if (interprocedural_view) { /* handle Filter and Block specially */
+ 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;
if (get_irn_op(node) == op_Tuple)
return;
- assert(node && get_op_pinned(get_irn_op(node)) == op_pin_state_exc_pinned);
+ assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
assert(state == op_pin_state_pinned || state == op_pin_state_floats);
node->attr.except.pin_state = state;
return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
}
-type *
-get_irn_funccall_attr (ir_node *node)
-{
- assert (node->op == op_FuncCall);
- return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
-}
-
sel_attr
get_irn_sel_attr (ir_node *node)
{
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_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
return node->attr.except;
}
ir_node *
get_Block_cfgpred (ir_node *node, int pos) {
- assert(node);
- assert (node->op == op_Block);
assert(-1 <= pos && pos < get_irn_arity(node));
+ assert(node->op == op_Block);
return get_irn_n(node, pos);
}
{
/* Fix backedge array. fix_backedges operates depending on
interprocedural_view. */
- bool ipv = interprocedural_view;
- interprocedural_view = true;
+ int ipv = get_interprocedural_view();
+ set_interprocedural_view(true);
fix_backedges(current_ir_graph->obst, node);
- interprocedural_view = ipv;
+ set_interprocedural_view(ipv);
}
}
memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
assert (is_atomic_type(tp));
assert (get_type_mode(tp) == get_irn_mode(node));
}
-
node->attr.con.tp = tp;
}
node->attr.i.sym.entity_p = ent;
}
-
union symconst_symbol
get_SymConst_symbol (ir_node *node) {
assert (node->op == op_SymConst);
node->attr.i.sym = sym;
}
+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);
+ return node->attr.i.tp;
+}
+
+void
+set_SymConst_value_type (ir_node *node, type *tp) {
+ assert (node->op == op_SymConst);
+ node->attr.i.tp = tp;
+}
+
ir_node *
get_Sel_mem (ir_node *node) {
assert (node->op == op_Sel);
void
set_Call_type (ir_node *node, type *tp) {
assert (node->op == op_Call);
- assert (is_method_type(tp));
+ assert ((get_unknown_type() == tp) || is_method_type(tp));
node->attr.call.cld_tp = tp;
}
node->attr.callbegin.call = call;
}
-ir_node *
-get_FuncCall_ptr (ir_node *node) {
- assert (node->op == op_FuncCall);
- return get_irn_n(node, 0);
-}
-
-void
-set_FuncCall_ptr (ir_node *node, ir_node *ptr) {
- assert (node->op == op_FuncCall);
- set_irn_n(node, 0, ptr);
-}
-
-ir_node **
-get_FuncCall_param_arr (ir_node *node) {
- assert (node->op == op_FuncCall);
- 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) - FUNCCALL_PARAM_OFFSET);
-}
-
-int
-get_FuncCall_arity (ir_node *node) {
- assert (node->op == op_FuncCall);
- return get_FuncCall_n_params(node);
-}
-
-/* void
-set_FuncCall_arity (ir_node *node, ir_node *arity) {
- assert (node->op == op_FuncCall);
-}
-*/
-
-ir_node *
-get_FuncCall_param (ir_node *node, int pos) {
- assert (node->op == op_FuncCall);
- 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 + FUNCCALL_PARAM_OFFSET, param);
-}
-
-type *
-get_FuncCall_type (ir_node *node) {
- assert (node->op == op_FuncCall);
- return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
-}
-
-void
-set_FuncCall_type (ir_node *node, type *tp) {
- assert (node->op == op_FuncCall);
- assert (is_method_type(tp));
- node->attr.call.cld_tp = tp;
-}
-
-int FuncCall_has_callees(ir_node *node) {
- 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) {
- assert(node->op == op_FuncCall && node->attr.call.callee_arr);
- return ARR_LEN(node->attr.call.callee_arr);
-}
-
-entity * get_FuncCall_callee(ir_node * node, int pos) {
- assert(node->op == op_FuncCall && node->attr.call.callee_arr);
- return node->attr.call.callee_arr[pos];
-}
-
-void set_FuncCall_callee_arr(ir_node * node, int n, entity ** arr) {
- assert(node->op == op_FuncCall);
- if (node->attr.call.callee_arr == NULL || get_Call_n_callees(node) != n) {
- node->attr.call.callee_arr = NEW_ARR_D(entity *, current_ir_graph->obst, n);
- }
- memcpy(node->attr.call.callee_arr, arr, n * sizeof(entity *));
-}
-
-void remove_FuncCall_callee_arr(ir_node * node) {
- assert(node->op == op_FuncCall);
- node->attr.call.callee_arr = NULL;
-}
-
#define BINOP(OP) \
ir_node * get_##OP##_left(ir_node *node) { \
}
int
-is_unop (ir_node *node) {
- return (node->op->opar == oparity_unary);
+(is_unop)(const ir_node *node) {
+ return __is_unop(node);
}
ir_node *
}
int
-is_binop (ir_node *node) {
- return (node->op->opar == oparity_binary);
+(is_binop)(const ir_node *node) {
+ return __is_binop(node);
}
ir_node *
assert(n);
op = get_irn_op(n);
- if (op == op_Filter) return interprocedural_view;
+ if (op == op_Filter) return get_interprocedural_view();
if (op == op_Phi)
return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
#endif
int
-is_Bad (ir_node *node) {
- assert(node);
- if ((node) && get_irn_opcode(node) == iro_Bad)
- return 1;
- return 0;
+(is_Bad)(const ir_node *node) {
+ return __is_Bad(node);
}
int
-is_no_Block (ir_node *node) {
- assert(node);
- return (get_irn_opcode(node) != iro_Block);
+(is_no_Block)(const ir_node *node) {
+ return __is_no_Block(node);
}
int
-is_Block (ir_node *node) {
- assert(node);
- return (get_irn_opcode(node) == iro_Block);
+(is_Block)(const ir_node *node) {
+ return __is_Block(node);
}
/* returns true if node is a Unknown node. */
int
-is_Unknown (ir_node *node) {
+is_Unknown (const ir_node *node) {
assert(node);
- return (get_irn_opcode(node) == iro_Unknown);
+ return (get_irn_op(node) == op_Unknown);
}
int
is_Proj (const ir_node *node) {
assert(node);
return node->op == op_Proj
- || (!interprocedural_view && node->op == op_Filter);
+ || (!get_interprocedural_view() && node->op == op_Filter);
}
/* Returns true if the operation manipulates control flow. */
int
-is_cfop(ir_node *node) {
+is_cfop(const ir_node *node) {
return is_cfopcode(get_irn_op(node));
}
/* Returns true if the operation manipulates interprocedural control flow:
CallBegin, EndReg, EndExcept */
-int is_ip_cfop(ir_node *node) {
+int is_ip_cfop(const ir_node *node) {
return is_ip_cfopcode(get_irn_op(node));
}
/* Returns true if the operation can change the control flow because
of an exception. */
int
-is_fragile_op(ir_node *node) {
+is_fragile_op(const ir_node *node) {
return is_op_fragile(get_irn_op(node));
}
/* Returns true if the operation is a forking control flow operation. */
int
-is_forking_op(ir_node *node) {
+is_forking_op(const ir_node *node) {
return is_op_forking(get_irn_op(node));
}
projects / libfirm / blobdiff