#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 BUILDIN_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)
+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;
}
/**
* 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;
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);
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 (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
-
int (get_irn_arity)(const ir_node *node)
{
return _get_irn_arity(node);
consecutive. */
ir_node **get_irn_in(const ir_node *node)
{
- assert(node);
-#ifdef INTERPROCEDURAL_VIEW
- 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 */
- }
-#endif /* INTERPROCEDURAL_VIEW */
return node->in;
}
ir_node *** pOld_in;
ir_graph *irg = get_irn_irg(node);
- assert(node);
-#ifdef INTERPROCEDURAL_VIEW
- if (get_interprocedural_view()) { /* handle Filter and Block specially */
- ir_opcode code = get_irn_opcode(node);
- if (code == iro_Filter) {
- assert(node->attr.filter.in_cg);
- pOld_in = &node->attr.filter.in_cg;
- } else if (code == iro_Block && node->attr.block.in_cg) {
- pOld_in = &node->attr.block.in_cg;
- } else {
- pOld_in = &node->in;
- }
- } else
-#endif /* INTERPROCEDURAL_VIEW */
- pOld_in = &node->in;
+ pOld_in = &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;
fix_backedges(irg->obst, node);
memcpy((*pOld_in) + 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);
-}
-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);
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);
-#ifdef INTERPROCEDURAL_VIEW
- 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 */
- }
-#endif /* INTERPROCEDURAL_VIEW */
-
/* 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)
_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);
return node->node_nr;
}
-const_attr *get_irn_const_attr(ir_node *node)
-{
- assert(is_Const(node));
- return &node->attr.con;
-}
-
-long get_irn_proj_attr(ir_node *node)
-{
- /* BEWARE: check for true Proj node here, no Filter */
- assert(node->op == op_Proj);
- return node->attr.proj;
-}
-
-alloc_attr *get_irn_alloc_attr(ir_node *node)
-{
- assert(is_Alloc(node));
- return &node->attr.alloc;
-}
-
-free_attr *get_irn_free_attr(ir_node *node)
-{
- assert(is_Free(node));
- return &node->attr.free;
-}
-
-symconst_attr *get_irn_symconst_attr(ir_node *node)
-{
- assert(is_SymConst(node));
- return &node->attr.symc;
-}
-
-call_attr *get_irn_call_attr(ir_node *node)
-{
- assert(is_Call(node));
- return &node->attr.call;
-}
-
-sel_attr *get_irn_sel_attr(ir_node *node)
-{
- assert(is_Sel(node));
- return &node->attr.sel;
-}
-
-phi_attr *get_irn_phi_attr(ir_node *node)
-{
- return &node->attr.phi;
-}
-
-block_attr *get_irn_block_attr(ir_node *node)
-{
- assert(is_Block(node));
- return &node->attr.block;
-}
-
-load_attr *get_irn_load_attr(ir_node *node)
-{
- assert(is_Load(node));
- return &node->attr.load;
-}
-
-store_attr *get_irn_store_attr(ir_node *node)
-{
- assert(is_Store(node));
- 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 || node->op == op_Bound);
- return &node->attr.except;
-}
-
-divmod_attr *get_irn_divmod_attr(ir_node *node)
-{
- assert(node->op == op_Div || node->op == op_Quot ||
- node->op == op_DivMod || node->op == op_Mod);
- return &node->attr.divmod;
-}
-
-builtin_attr *get_irn_builtin_attr(ir_node *node)
-{
- assert(is_Builtin(node));
- return &node->attr.builtin;
-}
-
void *(get_irn_generic_attr)(ir_node *node)
{
assert(is_ir_node(node));
/** manipulate fields of individual nodes **/
-/* this works for all except Block */
-ir_node *get_nodes_block(const ir_node *node)
+ir_node *(get_nodes_block)(const ir_node *node)
{
- assert(node->op != op_Block);
- return get_irn_n(node, -1);
+ return _get_nodes_block(node);
}
void set_nodes_block(ir_node *node, ir_node *block)
set_irn_n(node, -1, block);
}
-/* this works for all except Block */
-ir_node *get_nodes_MacroBlock(const ir_node *node)
-{
- assert(node->op != op_Block);
- return get_Block_MacroBlock(get_irn_n(node, -1));
-}
-
/* 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(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));
_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);
return _Block_block_visited(node);
}
-#ifdef INTERPROCEDURAL_VIEW
-void set_Block_cg_cfgpred_arr(ir_node *node, int arity, ir_node *in[])
-{
- assert(is_Block(node));
- 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);
-}
-
-void set_Block_cg_cfgpred(ir_node *node, int pos, ir_node *pred)
-{
- assert(is_Block(node) && node->attr.block.in_cg &&
- 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
- node->attr.block.in_cg[pos + 1] = pred;
-}
-
-ir_node **get_Block_cg_cfgpred_arr(ir_node *node)
-{
- assert(is_Block(node));
- return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
-}
-
-int get_Block_cg_n_cfgpreds(const ir_node *node)
-{
- assert(is_Block(node));
- return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
-}
-
-ir_node *get_Block_cg_cfgpred(const ir_node *node, int pos)
-{
- assert(is_Block(node) && node->attr.block.in_cg);
- return node->attr.block.in_cg[pos + 1];
-}
-
-void remove_Block_cg_cfgpred_arr(ir_node *node)
-{
- assert(is_Block(node));
- node->attr.block.in_cg = NULL;
-}
-#endif /* INTERPROCEDURAL_VIEW */
-
-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;
block->attr.block.extblk = extblk;
}
-/* Returns the macro block header of a block.*/
-ir_node *get_Block_MacroBlock(const ir_node *block)
-{
- ir_node *mbh;
- assert(is_Block(block));
- mbh = get_irn_n(block, -1);
- /* once macro block header is respected by all optimizations,
- this assert can be removed */
- assert(mbh != NULL);
- return mbh;
-}
-
-/* Sets the macro block header of a block. */
-void set_Block_MacroBlock(ir_node *block, ir_node *mbh)
-{
- assert(is_Block(block));
- mbh = skip_Id(mbh);
- assert(is_Block(mbh));
- set_irn_n(block, -1, mbh);
-}
-
-/* returns the macro block header of a node. */
-ir_node *get_irn_MacroBlock(const ir_node *n)
-{
- if (! is_Block(n)) {
- n = get_nodes_block(n);
- /* if the Block is Bad, do NOT try to get it's MB, it will fail. */
- if (is_Bad(n))
- return (ir_node *)n;
- }
- return get_Block_MacroBlock(n);
-}
-
/* returns the graph of a Block. */
ir_graph *(get_Block_irg)(const ir_node *block)
{
/* 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);
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 */
}
/* now n - 1 keeps, 1 block input */
ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
+
+ /* update irg flags */
+ clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
}
/* remove Bads, NoMems and doublets from the keep-alive set */
pset_new_t keeps;
int idx, n = get_End_n_keepalives(end);
ir_graph *irg;
+ bool changed = false;
if (n <= 0)
return;
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);
ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
pset_new_destroy(&keeps);
+
+ if (changed) {
+ clear_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_OUTS);
+ }
}
void free_End(ir_node *end)
in array afterwards ... */
}
-/* Return the target address of an IJmp */
-ir_node *get_IJmp_target(const ir_node *ijmp)
-{
- assert(is_IJmp(ijmp));
- return get_irn_n(ijmp, 0);
-}
-
-/** Sets the target address of an IJmp */
-void set_IJmp_target(ir_node *ijmp, ir_node *tgt)
-{
- assert(is_IJmp(ijmp));
- set_irn_n(ijmp, 0, tgt);
-}
-
-ir_node *get_Cond_selector(const ir_node *node)
-{
- assert(is_Cond(node));
- return get_irn_n(node, 0);
-}
-
-void set_Cond_selector(ir_node *node, ir_node *selector)
-{
- assert(is_Cond(node));
- set_irn_n(node, 0, selector);
-}
-
-long get_Cond_default_proj(const ir_node *node)
-{
- assert(is_Cond(node));
- return node->attr.cond.default_proj;
-}
-
-void set_Cond_default_proj(ir_node *node, long defproj)
-{
- assert(is_Cond(node));
- node->attr.cond.default_proj = defproj;
-}
-
-ir_node *get_Return_mem(const ir_node *node)
-{
- assert(is_Return(node));
- return get_irn_n(node, 0);
-}
-
-void set_Return_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Return(node));
- set_irn_n(node, 0, mem);
-}
-
-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)
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);
}
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(is_Const(node));
- node->attr.con.tv = con;
-}
-
int (is_Const_null)(const ir_node *node)
{
return _is_Const_null(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(is_Const(node));
- return node->attr.con.tp;
-}
-
-void set_Const_type(ir_node *node, ir_type *tp)
-{
- assert(is_Const(node));
- 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)
{
node->attr.symc.sym = sym;
}
-ir_type *get_SymConst_value_type(ir_node *node)
-{
- assert(is_SymConst(node));
- return node->attr.symc.tp;
-}
-
-void set_SymConst_value_type(ir_node *node, ir_type *tp)
-{
- assert(is_SymConst(node));
- node->attr.symc.tp = tp;
-}
-
-ir_node *get_Sel_mem(const ir_node *node)
-{
- assert(is_Sel(node));
- return get_irn_n(node, 0);
-}
-
-void set_Sel_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Sel(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Sel_ptr(const ir_node *node)
-{
- assert(is_Sel(node));
- return get_irn_n(node, 1);
-}
-
-void set_Sel_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Sel(node));
- set_irn_n(node, 1, ptr);
-}
-
int get_Sel_n_indexs(const ir_node *node)
{
assert(is_Sel(node));
set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
}
-ir_entity *get_Sel_entity(const ir_node *node)
-{
- assert(is_Sel(node));
- return node->attr.sel.entity;
-}
-
-/* need a version without const to prevent warning */
-static ir_entity *_get_Sel_entity(ir_node *node)
+ir_node **get_Call_param_arr(ir_node *node)
{
- return get_Sel_entity(node);
+ assert(is_Call(node));
+ return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
}
-void set_Sel_entity(ir_node *node, ir_entity *ent)
+size_t get_Call_n_params(const ir_node *node)
{
- assert(is_Sel(node));
- node->attr.sel.entity = ent;
+ assert(is_Call(node));
+ return (size_t) (get_irn_arity(node) - CALL_PARAM_OFFSET);
}
-
-/* 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(const ir_node *node)
+ir_node *get_Call_param(const ir_node *node, int pos)
{
assert(is_Call(node));
- return get_irn_n(node, 0);
+ return get_irn_n(node, pos + CALL_PARAM_OFFSET);
}
-void set_Call_mem(ir_node *node, ir_node *mem)
+void set_Call_param(ir_node *node, int pos, ir_node *param)
{
assert(is_Call(node));
- set_irn_n(node, 0, mem);
+ set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
}
-ir_node *get_Call_ptr(const ir_node *node)
+ir_node **get_Builtin_param_arr(ir_node *node)
{
- assert(is_Call(node));
- return get_irn_n(node, 1);
+ assert(is_Builtin(node));
+ return &get_irn_in(node)[BUILTIN_PARAM_OFFSET + 1];
}
-void set_Call_ptr(ir_node *node, ir_node *ptr)
+int get_Builtin_n_params(const ir_node *node)
{
- assert(is_Call(node));
- set_irn_n(node, 1, ptr);
+ assert(is_Builtin(node));
+ return (get_irn_arity(node) - BUILTIN_PARAM_OFFSET);
}
-ir_node **get_Call_param_arr(ir_node *node)
+ir_node *get_Builtin_param(const ir_node *node, int pos)
{
- assert(is_Call(node));
- return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
-}
-
-int get_Call_n_params(const ir_node *node)
-{
- assert(is_Call(node));
- return (get_irn_arity(node) - CALL_PARAM_OFFSET);
-}
-
-ir_node *get_Call_param(const ir_node *node, int pos)
-{
- assert(is_Call(node));
- return get_irn_n(node, pos + 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);
-}
-
-ir_type *get_Call_type(ir_node *node)
-{
- assert(is_Call(node));
- return node->attr.call.type;
-}
-
-void set_Call_type(ir_node *node, ir_type *tp)
-{
- assert(is_Call(node));
- assert((get_unknown_type() == tp) || is_Method_type(tp));
- node->attr.call.type = tp;
-}
-
-unsigned get_Call_tail_call(const ir_node *node)
-{
- assert(is_Call(node));
- return node->attr.call.tail_call;
-}
-
-void set_Call_tail_call(ir_node *node, unsigned tail_call)
-{
- assert(is_Call(node));
- node->attr.call.tail_call = tail_call != 0;
-}
-
-ir_node *get_Builtin_mem(const ir_node *node)
-{
- assert(is_Builtin(node));
- return get_irn_n(node, 0);
-}
-
-void set_Builtin_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Builtin(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_builtin_kind get_Builtin_kind(const ir_node *node)
-{
- assert(is_Builtin(node));
- return node->attr.builtin.kind;
-}
-
-void set_Builtin_kind(ir_node *node, ir_builtin_kind kind)
-{
- assert(is_Builtin(node));
- node->attr.builtin.kind = kind;
-}
-
-ir_node **get_Builtin_param_arr(ir_node *node)
-{
- assert(is_Builtin(node));
- return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
-}
-
-int get_Builtin_n_params(const ir_node *node)
-{
- assert(is_Builtin(node));
- return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
-}
-
-ir_node *get_Builtin_param(const ir_node *node, int pos)
-{
- assert(is_Builtin(node));
- return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
+ assert(is_Builtin(node));
+ return get_irn_n(node, pos + BUILTIN_PARAM_OFFSET);
}
void set_Builtin_param(ir_node *node, int pos, ir_node *param)
{
assert(is_Builtin(node));
- set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
-}
-
-ir_type *get_Builtin_type(ir_node *node)
-{
- assert(is_Builtin(node));
- return node->attr.builtin.type;
-}
-
-void set_Builtin_type(ir_node *node, ir_type *tp)
-{
- assert(is_Builtin(node));
- assert((get_unknown_type() == tp) || is_Method_type(tp));
- node->attr.builtin.type = tp;
+ set_irn_n(node, pos + BUILTIN_PARAM_OFFSET, param);
}
/* 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;
+#define X(a) case a: return #a
switch (kind) {
X(ir_bk_trap);
X(ir_bk_debugbreak);
(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);
+
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 *));
}
node->attr.call.callee_arr = NULL;
}
-ir_node *get_CallBegin_ptr(const ir_node *node)
-{
- assert(is_CallBegin(node));
- return get_irn_n(node, 0);
-}
-
-void set_CallBegin_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_CallBegin(node));
- set_irn_n(node, 0, ptr);
-}
-
-ir_node *get_CallBegin_call(const ir_node *node)
-{
- assert(is_CallBegin(node));
- return node->attr.callbegin.call;
-}
-
-void set_CallBegin_call(ir_node *node, ir_node *call)
-{
- assert(is_CallBegin(node));
- node->attr.callbegin.call = call;
-}
-
-/*
- * Returns non-zero if a Call is surely a self-recursive Call.
- * Beware: if this functions returns 0, the call might be self-recursive!
- */
-int is_self_recursive_Call(const ir_node *call)
-{
- const ir_node *callee = get_Call_ptr(call);
-
- if (is_SymConst_addr_ent(callee)) {
- const ir_entity *ent = get_SymConst_entity(callee);
- const ir_graph *irg = get_entity_irg(ent);
- if (irg == get_irn_irg(call))
- return 1;
- }
- return 0;
-}
-
-#define BINOP(OP) \
-ir_node * get_##OP##_left(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index); \
-} \
-void set_##OP##_left(ir_node *node, ir_node *left) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index, left); \
-} \
-ir_node *get_##OP##_right(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index + 1); \
-} \
-void set_##OP##_right(ir_node *node, ir_node *right) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index + 1, right); \
-}
-
-#define UNOP(OP) \
-ir_node *get_##OP##_op(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, node->op->op_index); \
-} \
-void set_##OP##_op(ir_node *node, ir_node *op) { \
- assert(is_##OP(node)); \
- set_irn_n(node, node->op->op_index, op); \
-}
-
-#define BINOP_MEM(OP) \
-BINOP(OP) \
- \
-ir_node * \
-get_##OP##_mem(const ir_node *node) { \
- assert(is_##OP(node)); \
- return get_irn_n(node, 0); \
-} \
- \
-void \
-set_##OP##_mem(ir_node *node, ir_node *mem) { \
- assert(is_##OP(node)); \
- set_irn_n(node, 0, mem); \
-}
-
-#define DIVOP(OP) \
-BINOP_MEM(OP) \
- \
-ir_mode *get_##OP##_resmode(const ir_node *node) { \
- assert(is_##OP(node)); \
- return node->attr.divmod.resmode; \
-} \
- \
-void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
- assert(is_##OP(node)); \
- node->attr.divmod.resmode = mode; \
-}
-
-
-BINOP(Add)
-BINOP(Borrow)
-BINOP(Carry)
-BINOP(Sub)
-UNOP(Minus)
-BINOP(Mul)
-BINOP(Mulh)
-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(Rotl)
-BINOP(Cmp)
-UNOP(Conv)
-UNOP(Cast)
-
-int get_Div_no_remainder(const ir_node *node)
-{
- assert(is_Div(node));
- return node->attr.divmod.no_remainder;
-}
-
-void set_Div_no_remainder(ir_node *node, int no_remainder)
-{
- assert(is_Div(node));
- node->attr.divmod.no_remainder = no_remainder;
-}
-
-int get_Conv_strict(const ir_node *node)
-{
- assert(is_Conv(node));
- return node->attr.conv.strict;
-}
-
-void set_Conv_strict(ir_node *node, int strict_flag)
-{
- assert(is_Conv(node));
- node->attr.conv.strict = (char)strict_flag;
-}
-
-ir_type *get_Cast_type(ir_node *node)
-{
- assert(is_Cast(node));
- return node->attr.cast.type;
-}
-
-void set_Cast_type(ir_node *node, ir_type *to_tp)
-{
- assert(is_Cast(node));
- node->attr.cast.type = to_tp;
-}
-
-
/* Checks for upcast.
*
* Returns true if the Cast node casts a class type to a super type.
ir_node **get_Phi_preds_arr(ir_node *node)
{
- assert(node->op == op_Phi);
+ assert(is_Phi(node));
return (ir_node **)&(get_irn_in(node)[1]);
}
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));
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_node *get_Load_mem(const ir_node *node)
-{
- assert(is_Load(node));
- return get_irn_n(node, 0);
-}
-
-void set_Load_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Load(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Load_ptr(const ir_node *node)
-{
- assert(is_Load(node));
- return get_irn_n(node, 1);
-}
-
-void set_Load_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Load(node));
- set_irn_n(node, 1, ptr);
-}
-
-ir_mode *get_Load_mode(const ir_node *node)
-{
- assert(is_Load(node));
- return node->attr.load.mode;
-}
-
-void set_Load_mode(ir_node *node, ir_mode *mode)
-{
- assert(is_Load(node));
- node->attr.load.mode = mode;
-}
-
-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_node *get_Store_mem(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 0);
-}
-
-void set_Store_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Store(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Store_ptr(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 1);
-}
-
-void set_Store_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Store(node));
- set_irn_n(node, 1, ptr);
-}
-
-ir_node *get_Store_value(const ir_node *node)
-{
- assert(is_Store(node));
- return get_irn_n(node, 2);
-}
-
-void set_Store_value(ir_node *node, ir_node *value)
-{
- assert(is_Store(node));
- set_irn_n(node, 2, value);
-}
-
-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_Alloc_mem(const ir_node *node)
-{
- assert(is_Alloc(node));
- return get_irn_n(node, 0);
-}
-
-void set_Alloc_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Alloc(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Alloc_count(const ir_node *node)
-{
- assert(is_Alloc(node));
- return get_irn_n(node, 1);
-}
-
-void set_Alloc_count(ir_node *node, ir_node *count)
-{
- assert(is_Alloc(node));
- set_irn_n(node, 1, count);
-}
-
-ir_type *get_Alloc_type(ir_node *node)
-{
- assert(is_Alloc(node));
- return node->attr.alloc.type;
-}
-
-void set_Alloc_type(ir_node *node, ir_type *tp)
-{
- assert(is_Alloc(node));
- node->attr.alloc.type = tp;
-}
-
-ir_where_alloc get_Alloc_where(const ir_node *node)
-{
- assert(is_Alloc(node));
- return node->attr.alloc.where;
-}
-
-void set_Alloc_where(ir_node *node, ir_where_alloc where)
-{
- assert(is_Alloc(node));
- node->attr.alloc.where = where;
-}
-
-
-ir_node *get_Free_mem(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 0);
-}
-
-void set_Free_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Free(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Free_ptr(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 1);
-}
-
-void set_Free_ptr(ir_node *node, ir_node *ptr)
-{
- assert(is_Free(node));
- set_irn_n(node, 1, ptr);
-}
-
-ir_node *get_Free_size(const ir_node *node)
-{
- assert(is_Free(node));
- return get_irn_n(node, 2);
-}
-
-void set_Free_size(ir_node *node, ir_node *size)
-{
- assert(is_Free(node));
- set_irn_n(node, 2, size);
-}
-
-ir_type *get_Free_type(ir_node *node)
-{
- assert(is_Free(node));
- return node->attr.free.type;
-}
-
-void set_Free_type(ir_node *node, ir_type *tp)
-{
- assert(is_Free(node));
- node->attr.free.type = tp;
-}
-
-ir_where_alloc get_Free_where(const ir_node *node)
-{
- assert(is_Free(node));
- return node->attr.free.where;
-}
-
-void set_Free_where(ir_node *node, ir_where_alloc where)
-{
- assert(is_Free(node));
- node->attr.free.where = where;
-}
ir_node **get_Sync_preds_arr(ir_node *node)
{
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 (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;
-}
-
-ir_node *get_Proj_pred(const ir_node *node)
+int (is_arg_Proj)(const ir_node *node)
{
- assert(is_Proj(node));
- return get_irn_n(node, 0);
+ return _is_arg_Proj(node);
}
-void set_Proj_pred(ir_node *node, ir_node *pred)
+int is_x_except_Proj(const ir_node *node)
{
- assert(is_Proj(node));
- set_irn_n(node, 0, pred);
+ 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;
}
-long get_Proj_proj(const ir_node *node)
+int is_x_regular_Proj(const ir_node *node)
{
-#ifdef INTERPROCEDURAL_VIEW
- ir_opcode code = get_irn_opcode(node);
-
- if (code == iro_Proj) {
- return node->attr.proj;
- }
- else {
- assert(code == iro_Filter);
- return node->attr.filter.proj;
- }
-#else
- assert(is_Proj(node));
- return node->attr.proj;
-#endif /* INTERPROCEDURAL_VIEW */
+ 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_Proj_proj(ir_node *node, long proj)
+void ir_set_throws_exception(ir_node *node, int throws_exception)
{
-#ifdef INTERPROCEDURAL_VIEW
- ir_opcode code = get_irn_opcode(node);
-
- if (code == iro_Proj) {
- node->attr.proj = proj;
- }
- else {
- assert(code == iro_Filter);
- node->attr.filter.proj = proj;
- }
-#else
- assert(is_Proj(node));
- node->attr.proj = proj;
-#endif /* INTERPROCEDURAL_VIEW */
+ except_attr *attr = &node->attr.except;
+ assert(is_fragile_op(node));
+ attr->throws_exception = throws_exception;
}
-/* Returns non-zero if a node is a routine parameter. */
-int (is_arg_Proj)(const ir_node *node)
+int ir_throws_exception(const ir_node *node)
{
- return _is_arg_Proj(node);
+ const except_attr *attr = &node->attr.except;
+ assert(is_fragile_op(node));
+ return attr->throws_exception;
}
ir_node **get_Tuple_preds_arr(ir_node *node)
return get_irn_arity(node);
}
-/*
-void set_Tuple_n_preds(ir_node *node, int n_preds)
-{
- assert(is_Tuple(node));
-}
-*/
-
ir_node *get_Tuple_pred(const ir_node *node, int pos)
{
assert(is_Tuple(node));
set_irn_n(node, pos, pred);
}
-ir_node *get_Id_pred(const ir_node *node)
-{
- assert(is_Id(node));
- return get_irn_n(node, 0);
-}
-
-void set_Id_pred(ir_node *node, ir_node *pred)
-{
- assert(is_Id(node));
- set_irn_n(node, 0, pred);
-}
-
-ir_node *get_Confirm_value(const ir_node *node)
-{
- assert(is_Confirm(node));
- return get_irn_n(node, 0);
-}
-
-void set_Confirm_value(ir_node *node, ir_node *value)
-{
- assert(is_Confirm(node));
- set_irn_n(node, 0, value);
-}
-
-ir_node *get_Confirm_bound(const ir_node *node)
-{
- assert(is_Confirm(node));
- return get_irn_n(node, 1);
-}
-
-void set_Confirm_bound(ir_node *node, ir_node *bound)
-{
- assert(is_Confirm(node));
- set_irn_n(node, 0, bound);
-}
-
-pn_Cmp get_Confirm_cmp(const ir_node *node)
-{
- assert(is_Confirm(node));
- return node->attr.confirm.cmp;
-}
-
-void set_Confirm_cmp(ir_node *node, pn_Cmp cmp)
-{
- assert(is_Confirm(node));
- node->attr.confirm.cmp = cmp;
-}
-
-ir_node *get_Filter_pred(ir_node *node)
-{
- assert(is_Filter(node));
- return node->in[1];
-}
-
-void set_Filter_pred(ir_node *node, ir_node *pred)
-{
- assert(is_Filter(node));
- node->in[1] = pred;
-}
-
-long get_Filter_proj(ir_node *node)
-{
- assert(is_Filter(node));
- return node->attr.filter.proj;
-}
-
-void set_Filter_proj(ir_node *node, long proj)
-{
- assert(is_Filter(node));
- 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(is_Filter(node));
- if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
- ir_graph *irg = get_irn_irg(node);
- node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
- node->attr.filter.backedge = new_backedge_arr(irg->obst, 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(is_Filter(node) && 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(is_Filter(node) && 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(is_Filter(node) && 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(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[1];
-}
-
-void set_Mux_sel(ir_node *node, ir_node *sel)
-{
- assert(is_Mux(node));
- node->in[1] = sel;
-}
-
-ir_node *get_Mux_false(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[2];
-}
-
-void set_Mux_false(ir_node *node, ir_node *ir_false)
-{
- assert(is_Mux(node));
- node->in[2] = ir_false;
-}
-
-ir_node *get_Mux_true(const ir_node *node)
-{
- assert(is_Mux(node));
- return node->in[3];
-}
-
-void set_Mux_true(ir_node *node, ir_node *ir_true)
-{
- assert(is_Mux(node));
- node->in[3] = ir_true;
-}
-
-/* CopyB support */
-ir_node *get_CopyB_mem(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 0);
-}
-
-void set_CopyB_mem(ir_node *node, ir_node *mem)
-{
- assert(node->op == op_CopyB);
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_CopyB_dst(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 1);
-}
-
-void set_CopyB_dst(ir_node *node, ir_node *dst)
-{
- assert(is_CopyB(node));
- set_irn_n(node, 1, dst);
-}
-
-ir_node *get_CopyB_src(const ir_node *node)
-{
- assert(is_CopyB(node));
- return get_irn_n(node, 2);
-}
-
-void set_CopyB_src(ir_node *node, ir_node *src)
-{
- assert(is_CopyB(node));
- set_irn_n(node, 2, src);
-}
-
-ir_type *get_CopyB_type(ir_node *node)
-{
- assert(is_CopyB(node));
- return node->attr.copyb.type;
-}
-
-void set_CopyB_type(ir_node *node, ir_type *data_type)
-{
- assert(is_CopyB(node) && data_type);
- node->attr.copyb.type = data_type;
-}
-
-
-ir_type *get_InstOf_type(ir_node *node)
-{
- assert(node->op == op_InstOf);
- return node->attr.instof.type;
-}
-
-void set_InstOf_type(ir_node *node, ir_type *type)
-{
- assert(node->op == op_InstOf);
- node->attr.instof.type = type;
-}
-
-ir_node *get_InstOf_store(const 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(const 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(const ir_node *node)
-{
- assert(is_Raise(node));
- return get_irn_n(node, 0);
-}
-
-void set_Raise_mem(ir_node *node, ir_node *mem)
-{
- assert(is_Raise(node));
- set_irn_n(node, 0, mem);
-}
-
-ir_node *get_Raise_exo_ptr(const ir_node *node)
-{
- assert(is_Raise(node));
- return get_irn_n(node, 1);
-}
-
-void set_Raise_exo_ptr(ir_node *node, ir_node *exo_ptr)
-{
- assert(is_Raise(node));
- set_irn_n(node, 1, exo_ptr);
-}
-
-/* Bound support */
-
-/* Returns the memory input of a Bound operation. */
-ir_node *get_Bound_mem(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 0);
-}
-
-void set_Bound_mem(ir_node *bound, ir_node *mem)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 0, mem);
-}
-
-/* Returns the index input of a Bound operation. */
-ir_node *get_Bound_index(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 1);
-}
-
-void set_Bound_index(ir_node *bound, ir_node *idx)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 1, idx);
-}
-
-/* Returns the lower bound input of a Bound operation. */
-ir_node *get_Bound_lower(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 2);
-}
-
-void set_Bound_lower(ir_node *bound, ir_node *lower)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 2, lower);
-}
-
-/* Returns the upper bound input of a Bound operation. */
-ir_node *get_Bound_upper(const ir_node *bound)
-{
- assert(is_Bound(bound));
- return get_irn_n(bound, 3);
-}
-
-void set_Bound_upper(ir_node *bound, ir_node *upper)
-{
- assert(is_Bound(bound));
- set_irn_n(bound, 3, upper);
-}
-
-/* Return the operand of a Pin node. */
-ir_node *get_Pin_op(const ir_node *pin)
-{
- assert(is_Pin(pin));
- return get_irn_n(pin, 0);
-}
-
-void set_Pin_op(ir_node *pin, ir_node *node)
-{
- assert(is_Pin(pin));
- set_irn_n(pin, 0, node);
-}
-
-/* Return the assembler text of an ASM pseudo node. */
-ident *get_ASM_text(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.asm_text;
-}
-
-/* Return the number of input constraints for an ASM node. */
int get_ASM_n_input_constraints(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.inputs);
-}
-
-/* Return the input constraints for an ASM node. This is a flexible array. */
-const ir_asm_constraint *get_ASM_input_constraints(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.inputs;
+ return ARR_LEN(node->attr.assem.input_constraints);
}
-/* Return the number of output constraints for an ASM node. */
int get_ASM_n_output_constraints(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.outputs);
-}
-
-/* Return the output constraints for an ASM node. */
-const ir_asm_constraint *get_ASM_output_constraints(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.outputs;
+ return ARR_LEN(node->attr.assem.output_constraints);
}
-/* Return the number of clobbered registers for an ASM node. */
int get_ASM_n_clobbers(const ir_node *node)
{
assert(is_ASM(node));
- return ARR_LEN(node->attr.assem.clobber);
-}
-
-/* Return the list of clobbered registers for an ASM node. */
-ident **get_ASM_clobbers(const ir_node *node)
-{
- assert(is_ASM(node));
- return node->attr.assem.clobber;
+ return ARR_LEN(node->attr.assem.clobbers);
}
/* returns the graph of a node */
ir_node *skip_Tuple(ir_node *node)
{
ir_node *pred;
- ir_op *op;
restart:
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);
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;
}
*
* 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)
{
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;
return _is_strictConv(node);
}
-int (is_no_Block)(const ir_node *node)
-{
- return _is_no_Block(node);
-}
-
/* Returns true if node is a SymConst node with kind symconst_addr_ent. */
int (is_SymConst_addr_ent)(const ir_node *node)
{
/* Returns true if the operation manipulates control flow. */
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)
+int is_unknown_jump(const ir_node *node)
{
- return is_ip_cfopcode(get_irn_op(node));
+ return is_op_unknown_jump(get_irn_op(node));
}
/* Returns true if the operation can change the control flow because
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. */
_copy_node_attr(irg, old_node, new_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)
/* Gets the string representation of the jump prediction .*/
const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
{
-#define X(a) case a: return #a;
+#define X(a) case a: return #a
switch (pred) {
X(COND_JMP_PRED_NONE);
X(COND_JMP_PRED_TRUE);
#undef X
}
-/* 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)
-{
- (void) 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;
- }
- return ops;
-}
-
/** 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 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))
}
/** 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;
}
/** 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;
+ case iro_Sel: ops->get_entity_attr = get_Sel_entity; break;
default:
/* not allowed to be NULL */
if (! ops->get_entity_attr)
return _get_irn_dbg_info(n);
}
-/* checks whether a node represents a global address */
-int is_Global(const ir_node *node)
-{
- return is_SymConst_addr_ent(node);
-}
-
-/* returns the entity of a global address */
-ir_entity *get_Global_entity(const ir_node *node)
-{
- return get_SymConst_entity(node);
-}
-
/*
* Calculate a hash value of a node.
*/
int i, irn_arity;
/* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
- h = irn_arity = get_irn_intra_arity(node);
+ 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_intra_n(node, i);
+ ir_node *pred = get_irn_n(node, i);
if (is_irn_cse_neutral(pred))
h *= 9;
else
h = 9*h + HASH_PTR(get_irn_op(node));
return h;
-} /* firm_default_hash */
+}
/* include generated code */
#include "gen_irnode.c.inl"