-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer, Goetz Lindenmaier
-**
-*/
+/*
+ * Project: libFIRM
+ * File name: ir/ir/irnode.c
+ * Purpose: Representation of an intermediate operation.
+ * Author: Martin Trapp, Christian Schaefer
+ * Modified by: Goetz Lindenmaier
+ * Created:
+ * CVS-ID: $Id$
+ * Copyright: (c) 1998-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
+
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
+
+#ifdef HAVE_STRING_H
+# include <string.h>
+#endif
+
+#include "ident.h"
+#include "irnode_t.h"
+#include "irgraph_t.h"
+#include "irmode_t.h"
+#include "typegmod.h"
+#include "irbackedge_t.h"
+#include "irdump.h"
+#include "irop_t.h"
+#include "irprog_t.h"
+#include "iredges_t.h"
+
+#include "irhooks.h"
+#include "irtools.h"
+
+/* some constants fixing the positions of nodes predecessors
+ in the in array */
+#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 [] = {
+ "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"
+};
+
+/**
+ * returns the pnc name from an pnc constant
+ */
+const char *get_pnc_string(int pnc) {
+ return pnc_name_arr[pnc];
+}
-#include "irnode.h"
-//#include "irnode2.h"
-#include "array.h"
+/*
+ * Calculates the negated (Complement(R)) pnc condition.
+ */
+int get_negated_pnc(int pnc, ir_mode *mode) {
+ pnc ^= pn_Cmp_True;
-static char *pnc_name_arr [] = {"False", "Eq", "Lt", "Le",
- "Gt", "Ge", "Lg", "Leg", "Uo",
- "Ue", "Ul", "Ule", "Ug", "Uge",
- "Ne", "True" };
+ /* do NOT add the Uo bit for non-floating point values */
+ if (! mode_is_float(mode))
+ pnc &= ~pn_Cmp_Uo;
-inline char *get_pnc_string(int pnc) {
- return pnc_name_arr[pnc];
+ return pnc;
}
-
+/* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
int
-get_negated_pnc(int pnc) {
- switch (pnc) {
- case False: return True; break;
- case Eq: return Ne; break;
- case Lt: return Uge; break;
- case Le: return Ug; break;
- case Gt: return Ule; break;
- case Ge: return Ul; break;
- case Lg: return Ue; break;
- case Leg: return Uo; break;
- case Uo: return Leg; break;
- case Ue: return Lg; break;
- case Ul: return Ge; break;
- case Ule: return Gt; break;
- case Ug: return Le; break;
- case Uge: return Lt; break;
- case Ne: return Eq; break;
- case True: return False; break;
- }
- return 99; /* to shut up gcc */
+get_inversed_pnc(int pnc) {
+ int code = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
+ int lesser = pnc & pn_Cmp_Lt;
+ int greater = pnc & pn_Cmp_Gt;
+
+ code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
+
+ return code;
}
-static char *pns_name_arr [] = {"initial_exec", "global_store",
- "frame_base", "globals", "args"};
+const char *pns_name_arr [] = {
+ "initial_exec", "global_store",
+ "frame_base", "globals", "args"
+};
+
+const char *symconst_name_arr [] = {
+ "type_tag", "size", "addr_name", "addr_ent"
+};
+
+/**
+ * Indicates, whether additional data can be registered to ir nodes.
+ * If set to 1, this is not possible anymore.
+ */
+static int forbid_new_data = 0;
-static char *symconst_name_arr [] = {"type_tag", "size", "linkage_ptr_info"};
+/**
+ * The amount of additional space for custom data to be allocated upon
+ * creating a new node.
+ */
+unsigned firm_add_node_size = 0;
+/* register new space for every node */
+unsigned register_additional_node_data(unsigned size) {
+ assert(!forbid_new_data && "Too late to register additional node data");
+
+ if (forbid_new_data)
+ return 0;
+
+ return firm_add_node_size += size;
+}
+
void
-init_irnode (void)
-{
+init_irnode(void) {
+ /* Forbid the addition of new data to an ir node. */
+ forbid_new_data = 1;
}
-/* I didn't manage to place this here as it causes cyclic inclusion
- of header files/a cyclic dependency between ir_graph and ir_node. */
-/* irnode constructor */
-/* create a new irnode in irg, with an op, mode, arity and */
-/* some incoming irnodes */
-/* this constructor is used in every specified irnode constructor */
-inline ir_node *
-new_ir_node (ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
- int arity, ir_node **in)
+/*
+ * irnode constructor.
+ * Create a new irnode in irg, with an op, mode, arity and
+ * some incoming irnodes.
+ * 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_node *res;
- int node_size = offsetof (ir_node, attr) + op->attr_size;
-
- res = (ir_node *) obstack_alloc (irg->obst, node_size);
-
- res->kind = k_ir_node;
- res->op = op;
- res->mode = mode;
- res->visit = 0;
- res->link = NULL;
+ size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
+ char *p;
+
+ assert(irg && op && mode);
+ p = obstack_alloc (irg->obst, node_size);
+ memset(p, 0, node_size);
+ res = (ir_node *) (p + firm_add_node_size);
+
+ res->kind = k_ir_node;
+ res->op = op;
+ res->mode = mode;
+ res->visited = 0;
+ res->link = NULL;
if (arity < 0) {
- res->in = NEW_ARR_F (ir_node *, 1);
+ res->in = NEW_ARR_F (ir_node *, 1); /* 1: space for block */
} else {
res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
}
+
res->in[0] = block;
+ set_irn_dbg_info(res, db);
+ res->out = NULL;
+
+#ifdef DEBUG_libfirm
+ res->node_nr = get_irp_new_node_nr();
+#endif
+
+#if FIRM_EDGES_INPLACE
+ {
+ int i;
+ int is_bl = is_Block(res);
+
+ INIT_LIST_HEAD(&res->edge_info.outs_head);
+ if(is_bl)
+ INIT_LIST_HEAD(&res->attr.block.succ_head);
+
+
+ for (i = is_bl; i <= arity; ++i)
+ edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
+ }
+#endif
+
+ hook_new_node(irg, res);
+
return res;
}
+/*-- getting some parameters from ir_nodes --*/
-/* IR-Nodes with attributes */
int
-ir_node_print (XP_PAR1, const xprintf_info *info ATTRIBUTE((unused)), XP_PARN)
-{
- int printed = 0;
- ir_node *np = XP_GETARG (ir_node *, 0);
+(is_ir_node)(const void *thing) {
+ return _is_ir_node(thing);
+}
- if (!np) {
- XPS ("<null ir_node>");
- return printed;
- }
+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);
+}
- XPF1 ("%I", get_irn_op(np)->name);
+int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
- switch (get_irn_opcode (np)) { /* node label */
- case iro_Const:
- XPF1 ("%I", get_irn_mode(np)->name);
- XPS (" : ");
- XPF1 ("%v", get_irn_const_attr);
- break;
- case iro_Proj:
- if (get_irn_modecode (np) == irm_b) {
- XPC (" ");
- XP (pnc_name_arr[get_irn_proj_attr(np)]);
- } else if (get_irn_opcode (get_irn_in (np)[1]) == iro_Start) {
- XPC (" ");
- XP (pns_name_arr[get_irn_proj_attr(np)]);
+int
+(get_irn_arity)(const ir_node *node) {
+ return _get_irn_arity(node);
+}
+
+/* Returns the array with ins. This array is shifted with respect to the
+ array accessed by get_irn_n: The block operand is at position 0 not -1.
+ (@@@ This should be changed.)
+ The order of the predecessors in this array is not guaranteed, except that
+ lists of operands as predecessors of Block or arguments of a Call are
+ consecutive. */
+ir_node **
+get_irn_in (const ir_node *node) {
+ assert(node);
+ 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 */
+ }
+ return node->in;
+}
+
+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) {
+ assert(node->attr.filter.in_cg);
+ arr = &node->attr.filter.in_cg;
+ } else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
+ arr = &node->attr.block.in_cg;
} else {
- XPF1 ("%I", get_irn_mode(np)->name);
- XPC (" ");
- XPF1 ("%d", get_irn_proj_attr(np));
+ arr = &node->in;
}
- break;
- case iro_SymConst:
- XPF1 ("%I", get_irn_mode(np)->name);
- XPC (" ");
- XP (symconst_name_arr[get_irn_symconst_attr(np).num]);
- XPF1 (" %#N", get_class_ident((type_class *)get_SymConst_type(np)));
- break;
- case iro_Start: /* don't dump mode of these */
- case iro_Cond:
- case iro_Block:
- case iro_Call:
- case iro_Jmp:
- case iro_Return:
- case iro_End:
- break;
- default:
- XPF1 ("%I", get_irn_mode(np)->name);
+ } else {
+ arr = &node->in;
}
- return printed;
+ for (i = 0; i < arity; i++) {
+ if (i < ARR_LEN(*arr)-1)
+ edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
+ else
+ 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], irg);
+ }
+
+ if (arity != ARR_LEN(*arr) - 1) {
+ ir_node * block = (*arr)[0];
+ *arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
+ (*arr)[0] = block;
+ }
+ fix_backedges(irg->obst, node);
+
+ memcpy((*arr) + 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);
+}
-/** getting some parameters from ir_nodes **/
+ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
-/* returns the number of predecessors without the block predecessor. */
-inline int
-get_irn_arity (ir_node *node)
-{
- // printf("called for node %s\n", ID_TO_STR(node->op->name));
- // if (get_irn_opcode(node) == iro_Block) return (ARR_LEN((node)->in));
- return (ARR_LEN((node)->in)-1);
+ir_node *
+(get_irn_n)(const ir_node *node, int n) {
+ return _get_irn_n(node, n);
}
-/* returns the array with ins */
-inline ir_node **
-get_irn_in (ir_node *node)
-{
- assert (node);
- return ((node)->in);
+void
+set_irn_n (ir_node *node, int n, ir_node *in) {
+ assert(node && node->kind == k_ir_node);
+ assert(-1 <= n);
+ assert(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;
+ 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 */
+ }
+
+ /* 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);
+
+ node->in[n + 1] = in;
+}
+
+ir_mode *
+(get_irn_mode)(const ir_node *node) {
+ return _get_irn_mode(node);
}
-/* to iterate through the predecessors without touching the array */
-/* To iterate over the operands iterate from 0 to i < get_irn_arity(),
- to iterate includind the Block predecessor iterate from i = -1 to
- i < get_irn_arity.
- Don't know how to iterate if it is a block ?? */
-inline ir_node *
-get_irn_n (ir_node *node, int n)
+void
+(set_irn_mode)(ir_node *node, ir_mode *mode)
{
- assert (node);
- // assert (get_irn_arity (node) > n);
- return skip_nop(node->in[n+1]);
+ _set_irn_mode(node, mode);
}
-inline void
-set_irn_n (ir_node *node, int n, ir_node *in)
+modecode
+get_irn_modecode (const ir_node *node)
{
assert (node);
- assert (get_irn_arity (node) > n);
- node->in[n+1] = in;
+ return node->mode->code;
}
-inline ir_mode *
-get_irn_mode (ir_node *node)
+/** Gets the string representation of the mode .*/
+const char *
+get_irn_modename (const ir_node *node)
{
- assert (node);
- return node->mode;
+ assert(node);
+ return get_mode_name(node->mode);
}
-inline modecode
-get_irn_modecode (ir_node *node)
+ident *
+get_irn_modeident (const ir_node *node)
{
- assert (node);
- return node->mode->code;
+ assert(node);
+ return get_mode_ident(node->mode);
}
-inline ir_op *
-get_irn_op (ir_node *node)
+ir_op *
+(get_irn_op)(const ir_node *node)
{
- assert (node);
- return node->op;
+ return _get_irn_op(node);
}
/* should be private to the library: */
-inline void
+void
set_irn_op (ir_node *node, ir_op *op)
{
assert (node);
node->op = op;
}
-inline opcode
-get_irn_opcode (ir_node *node)
+opcode
+(get_irn_opcode)(const ir_node *node)
{
- assert (node);
- return node->op->code;
+ return _get_irn_opcode(node);
}
-inline void
-set_irn_link (ir_node *node, ir_node *link) {
- assert (node);
- node->link = link;
+const char *
+get_irn_opname (const ir_node *node)
+{
+ assert(node);
+ if ((get_irn_op((ir_node *)node) == op_Phi) &&
+ (get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
+ (get_irn_arity((ir_node *)node) == 0)) return "Phi0";
+ return get_id_str(node->op->name);
}
-inline ir_node *
-get_irn_link (ir_node *node) {
- assert (node);
- return node->link;
+ident *
+get_irn_opident (const ir_node *node)
+{
+ assert(node);
+ return node->op->name;
+}
+
+unsigned long
+(get_irn_visited)(const ir_node *node)
+{
+ return _get_irn_visited(node);
+}
+
+void
+(set_irn_visited)(ir_node *node, unsigned long visited)
+{
+ _set_irn_visited(node, visited);
+}
+
+void
+(mark_irn_visited)(ir_node *node) {
+ _mark_irn_visited(node);
+}
+
+int
+(irn_not_visited)(const ir_node *node) {
+ return _irn_not_visited(node);
+}
+
+int
+(irn_visited)(const ir_node *node) {
+ return _irn_visited(node);
+}
+
+void
+(set_irn_link)(ir_node *node, void *link) {
+ _set_irn_link(node, link);
+}
+
+void *
+(get_irn_link)(const ir_node *node) {
+ return _get_irn_link(node);
+}
+
+op_pin_state
+(get_irn_pinned)(const ir_node *node) {
+ return _get_irn_pinned(node);
+}
+
+op_pin_state
+(is_irn_pinned_in_irg) (const ir_node *node) {
+ return _is_irn_pinned_in_irg(node);
+}
+
+void set_irn_pinned(ir_node *node, op_pin_state state) {
+ /* due to optimization an opt may be turned into a Tuple */
+ if (get_irn_op(node) == op_Tuple)
+ return;
+
+ 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;
+}
+
+#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;
+}
+#else
+/* Dummies needed for firmjni. */
+struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
+void set_irn_abst_value(ir_node *n, struct abstval *os) {}
+struct section *firm_get_irn_section(ir_node *n) { return NULL; }
+void firm_set_irn_section(ir_node *n, struct section *s) {}
+#endif /* DO_HEAPANALYSIS */
+
+
+/* Outputs a unique number for this node */
+long get_irn_node_nr(const ir_node *node) {
+ assert(node);
+#ifdef DEBUG_libfirm
+ return node->node_nr;
+#else
+ return (long)PTR_TO_INT(node);
+#endif
}
-inline tarval *
+const_attr
get_irn_const_attr (ir_node *node)
{
assert (node->op == op_Const);
return node->attr.con;
}
-inline long
+long
get_irn_proj_attr (ir_node *node)
{
assert (node->op == op_Proj);
return node->attr.proj;
}
-inline alloc_attr
+alloc_attr
get_irn_alloc_attr (ir_node *node)
{
assert (node->op == op_Alloc);
return node->attr.a;
}
-inline type *
+free_attr
get_irn_free_attr (ir_node *node)
{
assert (node->op == op_Free);
return node->attr.f;
}
-inline symconst_attr
+symconst_attr
get_irn_symconst_attr (ir_node *node)
{
assert (node->op == op_SymConst);
return node->attr.i;
}
-inline type_method *
+ir_type *
get_irn_call_attr (ir_node *node)
{
assert (node->op == op_Call);
- return node->attr.call;
+ return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
}
-inline sel_attr
+sel_attr
get_irn_sel_attr (ir_node *node)
{
assert (node->op == op_Sel);
return node->attr.s;
}
-inline int
+int
get_irn_phi_attr (ir_node *node)
{
assert (node->op == op_Phi);
return node->attr.phi0_pos;
}
-inline block_attr
+block_attr
get_irn_block_attr (ir_node *node)
{
assert (node->op == op_Block);
return node->attr.block;
}
+load_attr
+get_irn_load_attr (ir_node *node)
+{
+ assert (node->op == op_Load);
+ return node->attr.load;
+}
+
+store_attr
+get_irn_store_attr (ir_node *node)
+{
+ assert (node->op == op_Store);
+ 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);
+ return node->attr.except;
+}
+
+void *
+get_irn_generic_attr (ir_node *node) {
+ return &node->attr;
+}
+
/** manipulate fields of individual nodes **/
/* this works for all except Block */
ir_node *
-get_nodes_Block (ir_node *node) {
+get_nodes_block (const ir_node *node) {
assert (!(node->op == op_Block));
+ assert (is_irn_pinned_in_irg(node) && "block info may be incorrect");
return get_irn_n(node, -1);
}
-inline void
-set_nodes_Block (ir_node *node, ir_node *block) {
+void
+set_nodes_block (ir_node *node, ir_node *block) {
assert (!(node->op == op_Block));
set_irn_n(node, -1, block);
}
-inline int
-get_Block_n_cfgpreds (ir_node *node) {
- assert ((node->op == op_Block));
- return (get_irn_arity(node));
+/* 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(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);
+ if (get_irn_op(start) == op_Start) {
+ return get_irg_frame_type(get_irn_irg(start));
+ }
+ }
+ return NULL;
}
-/*
-inline void
-set_Block_n_cfgpreds (ir_node *node, int n_preds) {
+/* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
+ * from Start. If so returns global type, else Null. */
+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);
+ if (get_irn_op(start) == op_Start) {
+ return get_glob_type();
+ }
+ }
+ return NULL;
+}
+
+/* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
+ * from Start. If so returns 1, else 0. */
+int is_value_arg_pointer(ir_node *n) {
+ if ((get_irn_op(n) == op_Proj) &&
+ (get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
+ (get_irn_op(get_Proj_pred(n)) == op_Start))
+ return 1;
+ return 0;
+}
+
+/* Returns an array with the predecessors of the Block. Depending on
+ the implementation of the graph data structure this can be a copy of
+ the internal representation of predecessors as well as the internal
+ array itself. Therefore writing to this array might obstruct the ir. */
+ir_node **
+get_Block_cfgpred_arr (ir_node *node)
+{
assert ((node->op == op_Block));
+ return (ir_node **)&(get_irn_in(node)[1]);
}
-*/
-inline ir_node *
-get_Block_cfgpred (ir_node *node, int pos) {
- assert (node->op == op_Block);
- return get_irn_n(node, pos);
+int
+(get_Block_n_cfgpreds)(ir_node *node) {
+ return _get_Block_n_cfgpreds(node);
+}
+
+ir_node *
+(get_Block_cfgpred)(ir_node *node, int pos) {
+ return _get_Block_cfgpred(node, pos);
}
-inline void
+void
set_Block_cfgpred (ir_node *node, int pos, ir_node *pred) {
assert (node->op == op_Block);
set_irn_n(node, pos, pred);
}
-inline bool
+ir_node *
+(get_Block_cfgpred_block)(ir_node *node, int pos) {
+ return _get_Block_cfgpred_block(node, pos);
+}
+
+int
get_Block_matured (ir_node *node) {
assert (node->op == op_Block);
- return node->attr.block.matured;
+ return (int)node->attr.block.matured;
}
-inline void
-set_Block_matured (ir_node *node, bool matured) {
+void
+set_Block_matured (ir_node *node, int matured) {
assert (node->op == op_Block);
node->attr.block.matured = matured;
}
-inline unsigned long
-get_Block_block_visit (ir_node *node) {
- assert (node->op == op_Block);
- return node->attr.block.block_visit;
+
+unsigned long
+(get_Block_block_visited)(ir_node *node) {
+ return _get_Block_block_visited(node);
}
-inline void
-set_Block_block_visit (ir_node *node, unsigned long visit) {
- assert (node->op == op_Block);
- node->attr.block.block_visit = visit;
+void
+(set_Block_block_visited)(ir_node *node, unsigned long visit) {
+ _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);
}
-inline ir_node *
+int
+(Block_not_block_visited)(ir_node *node) {
+ return _Block_not_block_visited(node);
+}
+
+ir_node *
get_Block_graph_arr (ir_node *node, int pos) {
assert (node->op == op_Block);
return node->attr.block.graph_arr[pos+1];
}
-inline void
+void
set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
assert (node->op == op_Block);
node->attr.block.graph_arr[pos+1] = value;
}
-inline ir_node *
-get_Cond_selector (ir_node *node) {
- assert (node->op == op_Cond);
- return get_irn_n(node, 0);
+void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
+ assert(node->op == op_Block);
+ 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);
}
-inline void
-set_Cond_selector (ir_node *node, ir_node *selector) {
- assert (node->op == op_Cond);
- set_irn_n(node, 0, selector);
+void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
+ assert(node->op == op_Block &&
+ node->attr.block.in_cg &&
+ 0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
+ node->attr.block.in_cg[pos + 1] = pred;
}
-inline ir_node *
-get_Return_mem (ir_node *node) {
- assert (node->op == op_Cond);
- return get_irn_n(node, 0);
+ir_node ** get_Block_cg_cfgpred_arr(ir_node * node) {
+ assert(node->op == op_Block);
+ return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg + 1;
}
-inline void
-set_Return_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Return);
- set_irn_n(node, 0, mem);
+int get_Block_cg_n_cfgpreds(ir_node * node) {
+ assert(node->op == op_Block);
+ return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
}
-inline int
-get_Return_n_res (ir_node *node) {
- assert (node->op == op_Return);
- return (get_irn_arity(node) - 1);
+ir_node * get_Block_cg_cfgpred(ir_node * node, int pos) {
+ assert(node->op == op_Block && node->attr.block.in_cg);
+ return node->attr.block.in_cg[pos + 1];
}
-/*
-inline void
-set_Return_n_res (ir_node *node, int results) {
- assert (node->op == op_Return);
+void remove_Block_cg_cfgpred_arr(ir_node * node) {
+ assert(node->op == op_Block);
+ node->attr.block.in_cg = NULL;
}
-*/
-inline ir_node *
-get_Return_res (ir_node *node, int pos) {
- assert (node->op == op_Return);
- return get_irn_n(node, pos+1);
+ir_node *(set_Block_dead)(ir_node *block) {
+ return _set_Block_dead(block);
}
-inline void
-set_Return_res (ir_node *node, int pos, ir_node *res){
- assert (node->op == op_Raise);
- set_irn_n(node, pos+1, res);
+int (is_Block_dead)(const ir_node *block) {
+ return _is_Block_dead(block);
}
-inline ir_node *
-get_Raise_mem (ir_node *node) {
- assert (node->op == op_Return);
- return get_irn_n(node, 0);
+ir_extblk *get_Block_extbb(const ir_node *block) {
+ ir_extblk *res;
+ assert(is_Block(block));
+ res = block->attr.block.extblk;
+ assert(res == NULL || is_ir_extbb(res));
+ return res;
}
-inline void
-set_Raise_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Raise);
- set_irn_n(node, 0, mem);
+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;
}
-inline ir_node *
-get_Raise_exo_ptr (ir_node *node) {
- assert (node->op == op_Raise);
- return get_irn_n(node, 1);
+int
+get_End_n_keepalives(ir_node *end) {
+ assert (end->op == op_End);
+ return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
}
-inline void
-set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) {
- assert (node->op == op_Raise);
- set_irn_n(node, 1, exo_ptr);
+ir_node *
+get_End_keepalive(ir_node *end, int pos) {
+ assert (end->op == op_End);
+ return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
}
-inline tarval *get_Const_tarval (ir_node *node) {
- assert (node->op == op_Const);
- return get_irn_const_attr(node);
+void
+add_End_keepalive (ir_node *end, ir_node *ka) {
+ assert (end->op == op_End);
+ ARR_APP1 (ir_node *, end->in, ka);
}
-inline void
-set_Const_tarval (ir_node *node, tarval *con) {
- assert (node->op == op_Const);
- node->attr.con = con;
+void
+set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
+ assert (end->op == op_End);
+ set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
}
-inline symconst_kind
-get_SymConst_kind (ir_node *node) {
- assert (node->op == op_SymConst);
- return node->attr.i.num;
+void
+free_End (ir_node *end) {
+ assert (end->op == op_End);
+ end->kind = k_BAD;
+ DEL_ARR_F(end->in); /* GL @@@ tut nicht ! */
+ end->in = NULL; /* @@@ make sure we get an error if we use the
+ in array afterwards ... */
}
-inline void
-set_SymConst_kind (ir_node *node, symconst_kind num) {
- assert (node->op == op_SymConst);
- node->attr.i.num = num;
+/* Return the target address of an IJmp */
+ir_node *get_IJmp_target(ir_node *ijmp) {
+ assert(ijmp->op == op_IJmp);
+ return get_irn_n(ijmp, 0);
}
-inline type *
-get_SymConst_type (ir_node *node) {
- assert ( (node->op == op_SymConst)
- && ( get_SymConst_kind(node) == type_tag
- || get_SymConst_kind(node) == size));
- return node->attr.i.tori.typ;
+/** Sets the target address of an IJmp */
+void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
+ assert(ijmp->op == op_IJmp);
+ set_irn_n(ijmp, 0, tgt);
}
-inline void
-set_SymConst_type (ir_node *node, type *type) {
- assert ( (node->op == op_SymConst)
- && ( get_SymConst_kind(node) == type_tag
- || get_SymConst_kind(node) == size));
- node->attr.i.tori.typ = type;
+/*
+> Implementing the case construct (which is where the constant Proj node is
+> important) involves far more than simply determining the constant values.
+> We could argue that this is more properly a function of the translator from
+> Firm to the target machine. That could be done if there was some way of
+> projecting "default" out of the Cond node.
+I know it's complicated.
+Basically there are two proglems:
+ - determining the gaps between the projs
+ - determining the biggest case constant to know the proj number for
+ the default node.
+I see several solutions:
+1. Introduce a ProjDefault node. Solves both problems.
+ This means to extend all optimizations executed during construction.
+2. Give the Cond node for switch two flavors:
+ a) there are no gaps in the projs (existing flavor)
+ b) gaps may exist, default proj is still the Proj with the largest
+ projection number. This covers also the gaps.
+3. Fix the semantic of the Cond to that of 2b)
+
+Solution 2 seems to be the best:
+Computing the gaps in the Firm representation is not too hard, i.e.,
+libFIRM can implement a routine that transforms between the two
+flavours. This is also possible for 1) but 2) does not require to
+change any existing optimization.
+Further it should be far simpler to determine the biggest constant than
+to compute all gaps.
+I don't want to choose 3) as 2a) seems to have advantages for
+dataflow analysis and 3) does not allow to convert the representation to
+2a).
+*/
+ir_node *
+get_Cond_selector (ir_node *node) {
+ assert (node->op == op_Cond);
+ return get_irn_n(node, 0);
}
-inline ident *
-get_SymConst_ptrinfo (ir_node *node) {
- assert ( (node->op == op_SymConst)
- && (get_SymConst_kind(node) == linkage_ptr_info));
- return node->attr.i.tori.ptrinfo;
+void
+set_Cond_selector (ir_node *node, ir_node *selector) {
+ assert (node->op == op_Cond);
+ set_irn_n(node, 0, selector);
+}
+cond_kind
+get_Cond_kind (ir_node *node) {
+ assert (node->op == op_Cond);
+ return node->attr.c.kind;
+}
+void
+set_Cond_kind (ir_node *node, cond_kind kind) {
+ assert (node->op == op_Cond);
+ node->attr.c.kind = kind;
}
-inline void
-set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo) {
- assert ( (node->op == op_SymConst)
- && (get_SymConst_kind(node) == linkage_ptr_info));
- node->attr.i.tori.ptrinfo = ptrinfo;
+long
+get_Cond_defaultProj (ir_node *node) {
+ assert (node->op == op_Cond);
+ return node->attr.c.default_proj;
}
-inline ir_node *
-get_Sel_mem (ir_node *node) {
- assert (node->op == op_Sel);
+ir_node *
+get_Return_mem (ir_node *node) {
+ assert (node->op == op_Return);
return get_irn_n(node, 0);
}
-inline void
+void
+set_Return_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Return);
+ set_irn_n(node, 0, mem);
+}
+
+int
+get_Return_n_ress (ir_node *node) {
+ assert (node->op == op_Return);
+ return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
+}
+
+ir_node **
+get_Return_res_arr (ir_node *node)
+{
+ assert ((node->op == op_Return));
+ if (get_Return_n_ress(node) > 0)
+ return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
+ else
+ return NULL;
+}
+
+/*
+void
+set_Return_n_res (ir_node *node, int results) {
+ assert (node->op == op_Return);
+}
+*/
+
+ir_node *
+get_Return_res (ir_node *node, int pos) {
+ assert (node->op == op_Return);
+ assert (get_Return_n_ress(node) > pos);
+ return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
+}
+
+void
+set_Return_res (ir_node *node, int pos, ir_node *res){
+ assert (node->op == op_Return);
+ set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
+}
+
+tarval *(get_Const_tarval)(ir_node *node) {
+ return _get_Const_tarval(node);
+}
+
+void
+set_Const_tarval (ir_node *node, tarval *con) {
+ assert (node->op == op_Const);
+ node->attr.con.tv = con;
+}
+
+cnst_classify_t (classify_Const)(ir_node *node)
+{
+ return _classify_Const(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 (node->op == op_Const);
+ return node->attr.con.tp;
+}
+
+void
+set_Const_type (ir_node *node, ir_type *tp) {
+ assert (node->op == op_Const);
+ 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) {
+ assert (node->op == op_SymConst);
+ return node->attr.i.num;
+}
+
+void
+set_SymConst_kind (ir_node *node, symconst_kind num) {
+ assert (node->op == op_SymConst);
+ node->attr.i.num = num;
+}
+
+ir_type *
+get_SymConst_type (ir_node *node) {
+ assert ( (node->op == op_SymConst)
+ && ( get_SymConst_kind(node) == symconst_type_tag
+ || get_SymConst_kind(node) == symconst_size));
+ return node->attr.i.sym.type_p = skip_tid(node->attr.i.sym.type_p);
+}
+
+void
+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));
+ node->attr.i.sym.type_p = tp;
+}
+
+ident *
+get_SymConst_name (ir_node *node) {
+ assert ( (node->op == op_SymConst)
+ && (get_SymConst_kind(node) == symconst_addr_name));
+ return node->attr.i.sym.ident_p;
+}
+
+void
+set_SymConst_name (ir_node *node, ident *name) {
+ assert ( (node->op == op_SymConst)
+ && (get_SymConst_kind(node) == symconst_addr_name));
+ node->attr.i.sym.ident_p = name;
+}
+
+
+/* Only to access SymConst of kind symconst_addr_ent. Else assertion: */
+entity *get_SymConst_entity (ir_node *node) {
+ assert ( (node->op == op_SymConst)
+ && (get_SymConst_kind (node) == symconst_addr_ent));
+ return node->attr.i.sym.entity_p;
+}
+
+void set_SymConst_entity (ir_node *node, entity *ent) {
+ assert ( (node->op == op_SymConst)
+ && (get_SymConst_kind(node) == symconst_addr_ent));
+ node->attr.i.sym.entity_p = ent;
+}
+
+union symconst_symbol
+get_SymConst_symbol (ir_node *node) {
+ assert (node->op == op_SymConst);
+ return node->attr.i.sym;
+}
+
+void
+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;
+}
+
+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);
+ return node->attr.i.tp;
+}
+
+void
+set_SymConst_value_type (ir_node *node, ir_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);
+ return get_irn_n(node, 0);
+}
+
+void
set_Sel_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_Sel);
set_irn_n(node, 0, mem);
}
-inline ir_node *
+ir_node *
get_Sel_ptr (ir_node *node) {
assert (node->op == op_Sel);
return get_irn_n(node, 1);
}
-inline void
+void
set_Sel_ptr (ir_node *node, ir_node *ptr) {
assert (node->op == op_Sel);
set_irn_n(node, 1, ptr);
}
-inline int
-get_Sel_n_index (ir_node *node) {
+int
+get_Sel_n_indexs (ir_node *node) {
assert (node->op == op_Sel);
- return (get_irn_arity(node) - 2);
+ return (get_irn_arity(node) - SEL_INDEX_OFFSET);
}
-/*
-inline void
-set_Sel_n_index (ir_node *node, int n_index) {
- assert (node->op == op_Sel);
+ir_node **
+get_Sel_index_arr (ir_node *node)
+{
+ assert ((node->op == op_Sel));
+ if (get_Sel_n_indexs(node) > 0)
+ return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
+ else
+ return NULL;
}
-*/
-inline ir_node *
+ir_node *
get_Sel_index (ir_node *node, int pos) {
assert (node->op == op_Sel);
- return get_irn_n(node, pos+2);
+ return get_irn_n(node, pos + SEL_INDEX_OFFSET);
}
-inline void
+void
set_Sel_index (ir_node *node, int pos, ir_node *index) {
assert (node->op == op_Sel);
- set_irn_n(node, pos+2, index);
+ set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
}
-inline entity *
+entity *
get_Sel_entity (ir_node *node) {
assert (node->op == op_Sel);
return node->attr.s.ent;
}
-inline void
+void
set_Sel_entity (ir_node *node, entity *ent) {
assert (node->op == op_Sel);
node->attr.s.ent = ent;
}
-inline linkage_type *
-get_Sel_linkage_type (ir_node *node) {
- assert (node->op == op_Sel);
- return node->attr.s.ltyp;
-}
-inline void
-set_Sel_linkage_type (ir_node *node, linkage_type *lt) {
- assert (node->op == op_Sel);
- node->attr.s.ltyp = lt;
-}
+/* 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 */
-inline ir_node *
+
+ir_node *
get_Call_mem (ir_node *node) {
assert (node->op == op_Call);
return get_irn_n(node, 0);
}
-inline void
+void
set_Call_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_Call);
set_irn_n(node, 0, mem);
}
-inline ir_node *
+ir_node *
get_Call_ptr (ir_node *node) {
assert (node->op == op_Call);
return get_irn_n(node, 1);
}
-inline void
+void
set_Call_ptr (ir_node *node, ir_node *ptr) {
assert (node->op == op_Call);
set_irn_n(node, 1, ptr);
}
-inline int
+ir_node **
+get_Call_param_arr (ir_node *node) {
+ assert (node->op == op_Call);
+ return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
+}
+
+int
+get_Call_n_params (ir_node *node) {
+ assert (node->op == op_Call);
+ return (get_irn_arity(node) - CALL_PARAM_OFFSET);
+}
+
+int
get_Call_arity (ir_node *node) {
assert (node->op == op_Call);
- return (get_irn_arity(node) - 2);
+ return get_Call_n_params(node);
}
-/* inline void
+/* void
set_Call_arity (ir_node *node, ir_node *arity) {
assert (node->op == op_Call);
}
*/
-inline ir_node *
+ir_node *
get_Call_param (ir_node *node, int pos) {
assert (node->op == op_Call);
- return get_irn_n(node, pos+1);
+ return get_irn_n(node, pos + CALL_PARAM_OFFSET);
}
-inline void
+void
set_Call_param (ir_node *node, int pos, ir_node *param) {
assert (node->op == op_Call);
- set_irn_n(node, pos+1, param);
+ set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
}
-inline type_method *
+ir_type *
get_Call_type (ir_node *node) {
assert (node->op == op_Call);
- return node->attr.call;
+ return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
}
-inline void
-set_Call_type (ir_node *node, type_method *type) {
+void
+set_Call_type (ir_node *node, ir_type *tp) {
assert (node->op == op_Call);
- node->attr.call = type;
-}
-
-/* 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
- binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
- Shr, Shrs, Rotate, Cmp */
-
-int
-is_unop (ir_node *node) {
- return ( node->op == op_Minus ||
- node->op == op_Abs ||
- node->op == op_Not ||
- node->op == op_Conv );
-}
-
-inline ir_node *
-get_unop_op (ir_node *node) {
- assert ( node->op == op_Minus ||
- node->op == op_Abs ||
- node->op == op_Not ||
- node->op == op_Conv );
- switch (get_irn_opcode (node)) {
- case iro_Minus: return get_Minus_op(node); break;
- case iro_Abs: return get_Abs_op(node); break;
- case iro_Not: return get_Not_op(node); break;
- case iro_Conv: return get_Conv_op(node); break;
- default: return NULL;
- }
-}
-
-inline void
-set_unop_op (ir_node *node, ir_node *op) {
- assert (node->op == op_Minus ||
- node->op == op_Abs ||
- node->op == op_Not ||
- node->op == op_Conv );
- switch (get_irn_opcode (node)) {
- case iro_Minus: set_Minus_op(node, op); break;
- case iro_Abs: set_Abs_op(node, op); break;
- case iro_Not: set_Not_op(node, op); break;
- case iro_Conv: set_Conv_op(node, op); break;
- default: ;
- }
-
-}
-
-int
-is_binop (ir_node *node) {
- return (node->op == op_Add ||
- node->op == op_Sub ||
- node->op == op_Mul ||
- node->op == op_Quot ||
- node->op == op_DivMod ||
- node->op == op_Div ||
- node->op == op_Mod ||
- node->op == op_And ||
- node->op == op_Or ||
- node->op == op_Eor ||
- node->op == op_Shl ||
- node->op == op_Shr ||
- node->op == op_Shrs ||
- node->op == op_Rot ||
- node->op == op_Cmp );
-}
-
-inline ir_node *
-get_binop_left (ir_node *node) {
- assert (node->op == op_Add ||
- node->op == op_Sub ||
- node->op == op_Mul ||
- node->op == op_Quot ||
- node->op == op_DivMod ||
- node->op == op_Div ||
- node->op == op_Mod ||
- node->op == op_And ||
- node->op == op_Or ||
- node->op == op_Eor ||
- node->op == op_Shl ||
- node->op == op_Shr ||
- node->op == op_Shrs ||
- node->op == op_Rot ||
- node->op == op_Cmp );
-
- switch (get_irn_opcode (node)) {
- case iro_Add : return get_Add_left(node); break;
- case iro_Sub : return get_Sub_left(node); break;
- case iro_Mul : return get_Mul_left(node); break;
- case iro_Quot : return get_Quot_left(node); break;
- case iro_DivMod: return get_DivMod_left(node); break;
- case iro_Div : return get_Div_left(node); break;
- case iro_Mod : return get_Mod_left(node); break;
- case iro_And : return get_And_left(node); break;
- case iro_Or : return get_Or_left(node); break;
- case iro_Eor : return get_Eor_left(node); break;
- case iro_Shl : return get_Shl_left(node); break;
- case iro_Shr : return get_Shr_left(node); break;
- case iro_Shrs : return get_Shrs_left(node); break;
- case iro_Rot : return get_Rot_left(node); break;
- case iro_Cmp : return get_Cmp_left(node); break;
- default: return NULL;
- };
-}
-
-inline void
-set_binop_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Add ||
- node->op == op_Sub ||
- node->op == op_Mul ||
- node->op == op_Quot ||
- node->op == op_DivMod ||
- node->op == op_Div ||
- node->op == op_Mod ||
- node->op == op_And ||
- node->op == op_Or ||
- node->op == op_Eor ||
- node->op == op_Shl ||
- node->op == op_Shr ||
- node->op == op_Shrs ||
- node->op == op_Rot ||
- node->op == op_Cmp );
-
- switch (get_irn_opcode (node)) {
- case iro_Add : set_Add_left(node, left); break;
- case iro_Sub : set_Sub_left(node, left); break;
- case iro_Mul : set_Mul_left(node, left); break;
- case iro_Quot : set_Quot_left(node, left); break;
- case iro_DivMod: set_DivMod_left(node, left); break;
- case iro_Div : set_Div_left(node, left); break;
- case iro_Mod : set_Mod_left(node, left); break;
- case iro_And : set_And_left(node, left); break;
- case iro_Or : set_Or_left(node, left); break;
- case iro_Eor : set_Eor_left(node, left); break;
- case iro_Shl : set_Shl_left(node, left); break;
- case iro_Shr : set_Shr_left(node, left); break;
- case iro_Shrs : set_Shrs_left(node, left); break;
- case iro_Rot : set_Rot_left(node, left); break;
- case iro_Cmp : set_Cmp_left(node, left); break;
- default: ;
- };
-}
-
-inline ir_node *
-get_binop_right (ir_node *node) {
- assert (node->op == op_Add ||
- node->op == op_Sub ||
- node->op == op_Mul ||
- node->op == op_Quot ||
- node->op == op_DivMod ||
- node->op == op_Div ||
- node->op == op_Mod ||
- node->op == op_And ||
- node->op == op_Or ||
- node->op == op_Eor ||
- node->op == op_Shl ||
- node->op == op_Shr ||
- node->op == op_Shrs ||
- node->op == op_Rot ||
- node->op == op_Cmp );
-
- switch (get_irn_opcode (node)) {
- case iro_Add : return get_Add_right(node); break;
- case iro_Sub : return get_Sub_right(node); break;
- case iro_Mul : return get_Mul_right(node); break;
- case iro_Quot : return get_Quot_right(node); break;
- case iro_DivMod: return get_DivMod_right(node); break;
- case iro_Div : return get_Div_right(node); break;
- case iro_Mod : return get_Mod_right(node); break;
- case iro_And : return get_And_right(node); break;
- case iro_Or : return get_Or_right(node); break;
- case iro_Eor : return get_Eor_right(node); break;
- case iro_Shl : return get_Shl_right(node); break;
- case iro_Shr : return get_Shr_right(node); break;
- case iro_Shrs : return get_Shrs_right(node); break;
- case iro_Rot : return get_Rot_right(node); break;
- case iro_Cmp : return get_Cmp_right(node); break;
- default: return NULL;
- };
-}
-
-inline void
-set_binop_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Add ||
- node->op == op_Sub ||
- node->op == op_Mul ||
- node->op == op_Quot ||
- node->op == op_DivMod ||
- node->op == op_Div ||
- node->op == op_Mod ||
- node->op == op_And ||
- node->op == op_Or ||
- node->op == op_Eor ||
- node->op == op_Shl ||
- node->op == op_Shr ||
- node->op == op_Shrs ||
- node->op == op_Rot ||
- node->op == op_Cmp );
-
- switch (get_irn_opcode (node)) {
- case iro_Add : set_Add_right(node, right); break;
- case iro_Sub : set_Sub_right(node, right); break;
- case iro_Mul : set_Mul_right(node, right); break;
- case iro_Quot : set_Quot_right(node, right); break;
- case iro_DivMod: set_DivMod_right(node, right); break;
- case iro_Div : set_Div_right(node, right); break;
- case iro_Mod : set_Mod_right(node, right); break;
- case iro_And : set_And_right(node, right); break;
- case iro_Or : set_Or_right(node, right); break;
- case iro_Eor : set_Eor_right(node, right); break;
- case iro_Shl : set_Shl_right(node, right); break;
- case iro_Shr : set_Shr_right(node, right); break;
- case iro_Shrs : set_Shrs_right(node, right); break;
- case iro_Rot : set_Rot_right(node, right); break;
- case iro_Cmp : set_Cmp_right(node, right); break;
- default: ;
- };
-}
-
-inline ir_node *
-get_Add_left (ir_node *node) {
- assert (node->op == op_Add);
- return get_irn_n(node, 0);
-}
-
-inline void
-set_Add_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Add);
- set_irn_n(node, 0, left);
-}
-
-inline ir_node *
-get_Add_right (ir_node *node) {
- assert (node->op == op_Add);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_Add_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Add);
- set_irn_n(node, 1, right);
+ assert ((get_unknown_type() == tp) || is_Method_type(tp));
+ node->attr.call.cld_tp = tp;
}
-inline ir_node *
-get_Sub_left (ir_node *node) {
- assert (node->op == op_Sub);
- return get_irn_n(node, 0);
-}
-
-inline void
-set_Sub_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Sub);
- set_irn_n(node, 0, left);
+int Call_has_callees(ir_node *node) {
+ assert(node && node->op == op_Call);
+ return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
+ (node->attr.call.callee_arr != NULL));
}
-inline ir_node *
-get_Sub_right (ir_node *node) {
- assert (node->op == op_Sub);
- return get_irn_n(node, 1);
+int get_Call_n_callees(ir_node * node) {
+ assert(node && node->op == op_Call && node->attr.call.callee_arr);
+ return ARR_LEN(node->attr.call.callee_arr);
}
-inline void
-set_Sub_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Sub);
- set_irn_n(node, 1, right);
+entity * get_Call_callee(ir_node * node, int pos) {
+ assert(pos >= 0 && pos < get_Call_n_callees(node));
+ return node->attr.call.callee_arr[pos];
}
-
-inline ir_node *
-get_Minus_op (ir_node *node) {
- assert (node->op == op_Minus);
- return get_irn_n(node, 0);
+void set_Call_callee_arr(ir_node * node, const int n, entity ** arr) {
+ assert(node->op == op_Call);
+ 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 *));
}
-inline void
-set_Minus_op (ir_node *node, ir_node *op) {
- assert (node->op == op_Minus);
- set_irn_n(node, 0, op);
+void remove_Call_callee_arr(ir_node * node) {
+ assert(node->op == op_Call);
+ node->attr.call.callee_arr = NULL;
}
-
-inline ir_node *
-get_Mul_left (ir_node *node) {
- assert (node->op == op_Mul);
+ir_node * get_CallBegin_ptr (ir_node *node) {
+ assert(node->op == op_CallBegin);
return get_irn_n(node, 0);
}
+void set_CallBegin_ptr (ir_node *node, ir_node *ptr) {
+ assert(node->op == op_CallBegin);
+ set_irn_n(node, 0, ptr);
+}
+ir_node * get_CallBegin_call (ir_node *node) {
+ assert(node->op == op_CallBegin);
+ return node->attr.callbegin.call;
+}
+void set_CallBegin_call (ir_node *node, ir_node *call) {
+ assert(node->op == op_CallBegin);
+ node->attr.callbegin.call = call;
+}
+
+
+#define BINOP(OP) \
+ir_node * get_##OP##_left(ir_node *node) { \
+ assert(node->op == op_##OP); \
+ return get_irn_n(node, node->op->op_index); \
+} \
+void set_##OP##_left(ir_node *node, ir_node *left) { \
+ assert(node->op == op_##OP); \
+ set_irn_n(node, node->op->op_index, left); \
+} \
+ir_node *get_##OP##_right(ir_node *node) { \
+ assert(node->op == op_##OP); \
+ return get_irn_n(node, node->op->op_index + 1); \
+} \
+void set_##OP##_right(ir_node *node, ir_node *right) { \
+ assert(node->op == op_##OP); \
+ set_irn_n(node, node->op->op_index + 1, right); \
+}
+
+#define UNOP(OP) \
+ir_node *get_##OP##_op(ir_node *node) { \
+ assert(node->op == op_##OP); \
+ return get_irn_n(node, node->op->op_index); \
+} \
+void set_##OP##_op (ir_node *node, ir_node *op) { \
+ assert(node->op == op_##OP); \
+ set_irn_n(node, node->op->op_index, op); \
+}
+
+BINOP(Add)
+BINOP(Sub)
+UNOP(Minus)
+BINOP(Mul)
+BINOP(Quot)
-inline void
-set_Mul_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Mul);
- set_irn_n(node, 0, left);
-}
-
-inline ir_node *
-get_Mul_right (ir_node *node) {
- assert (node->op == op_Mul);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_Mul_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Mul);
- set_irn_n(node, 1, right);
-}
-
-inline ir_node *
-get_Quot_left (ir_node *node) {
- assert (node->op == op_Quot);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_Quot_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Quot);
- set_irn_n(node, 1, left);
-}
-
-inline ir_node *
-get_Quot_right (ir_node *node) {
- assert (node->op == op_Quot);
- return get_irn_n(node, 2);
-}
-
-inline void
-set_Quot_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Quot);
- set_irn_n(node, 2, right);
-}
-
-inline ir_node *
+ir_node *
get_Quot_mem (ir_node *node) {
assert (node->op == op_Quot);
return get_irn_n(node, 0);
}
-inline void
+void
set_Quot_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_Quot);
set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_DivMod_left (ir_node *node) {
- assert (node->op == op_DivMod);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_DivMod_left (ir_node *node, ir_node *left) {
- assert (node->op == op_DivMod);
- set_irn_n(node, 1, left);
-}
-
-inline ir_node *
-get_DivMod_right (ir_node *node) {
- assert (node->op == op_DivMod);
- return get_irn_n(node, 2);
-}
-
-inline void
-set_DivMod_right (ir_node *node, ir_node *right) {
- assert (node->op == op_DivMod);
- set_irn_n(node, 2, right);
-}
+BINOP(DivMod)
-inline ir_node *
+ir_node *
get_DivMod_mem (ir_node *node) {
assert (node->op == op_DivMod);
return get_irn_n(node, 0);
}
-inline void
+void
set_DivMod_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_DivMod);
set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_Div_left (ir_node *node) {
- assert (node->op == op_Div);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_Div_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Div);
- set_irn_n(node, 1, left);
-}
-
-inline ir_node *
-get_Div_right (ir_node *node) {
- assert (node->op == op_Div);
- return get_irn_n(node, 2);
-}
-
-inline void
-set_Div_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Div);
- set_irn_n(node, 2, right);
-}
+BINOP(Div)
-inline ir_node *
+ir_node *
get_Div_mem (ir_node *node) {
assert (node->op == op_Div);
return get_irn_n(node, 0);
}
-inline void
+void
set_Div_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_Div);
set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_Mod_left (ir_node *node) {
- assert (node->op == op_Mod);
- return get_irn_n(node, 1);
-}
-
-inline void
-set_Mod_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Mod);
- set_irn_n(node, 1, left);
-}
-
-inline ir_node *
-get_Mod_right (ir_node *node) {
- assert (node->op == op_Mod);
- return get_irn_n(node, 2);
-}
-
-inline void
-set_Mod_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Mod);
- set_irn_n(node, 2, right);
-}
+BINOP(Mod)
-inline ir_node *
+ir_node *
get_Mod_mem (ir_node *node) {
assert (node->op == op_Mod);
return get_irn_n(node, 0);
}
-inline void
+void
set_Mod_mem (ir_node *node, ir_node *mem) {
assert (node->op == op_Mod);
set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_Abs_op (ir_node *node) {
- assert (node->op == op_Abs);
- return get_irn_n(node, 0);
-}
+UNOP(Abs)
+BINOP(And)
+BINOP(Or)
+BINOP(Eor)
+UNOP(Not)
+BINOP(Shl)
+BINOP(Shr)
+BINOP(Shrs)
+BINOP(Rot)
+BINOP(Cmp)
+UNOP(Conv)
+UNOP(Cast)
-inline void
-set_Abs_op (ir_node *node, ir_node *op) {
- assert (node->op == op_Abs);
- set_irn_n(node, 0, op);
+ir_type *
+get_Cast_type (ir_node *node) {
+ assert (node->op == op_Cast);
+ return node->attr.cast.totype;
}
-inline ir_node *
-get_And_left (ir_node *node) {
- assert (node->op == op_And);
- return get_irn_n(node, 0);
+void
+set_Cast_type (ir_node *node, ir_type *to_tp) {
+ assert (node->op == op_Cast);
+ node->attr.cast.totype = to_tp;
}
-inline void
-set_And_left (ir_node *node, ir_node *left) {
- assert (node->op == op_And);
- set_irn_n(node, 0, left);
-}
-inline ir_node *
-get_And_right (ir_node *node) {
- assert (node->op == op_And);
- return get_irn_n(node, 1);
-}
+/* Checks for upcast.
+ *
+ * Returns true if the Cast node casts a class type to a super type.
+ */
+int is_Cast_upcast(ir_node *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);
-inline void
-set_And_right (ir_node *node, ir_node *right) {
- assert (node->op == op_And);
- set_irn_n(node, 1, right);
-}
+ assert(get_irg_typeinfo_state(myirg) == ir_typeinfo_consistent);
+ assert(fromtype);
-inline ir_node *
-get_Or_left (ir_node *node) {
- assert (node->op == op_Or);
+ while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
+ totype = get_pointer_points_to_type(totype);
+ fromtype = get_pointer_points_to_type(fromtype);
+ }
+
+ assert(fromtype);
+
+ if (!is_Class_type(totype)) return 0;
+ return is_SubClass_of(fromtype, totype);
+}
+
+/* Checks for downcast.
+ *
+ * Returns true if the Cast node casts a class type to a sub type.
+ */
+int is_Cast_downcast(ir_node *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);
+
+ while (is_Pointer_type(totype) && is_Pointer_type(fromtype)) {
+ totype = get_pointer_points_to_type(totype);
+ fromtype = get_pointer_points_to_type(fromtype);
+ }
+
+ assert(fromtype);
+
+ if (!is_Class_type(totype)) return 0;
+ return is_SubClass_of(totype, fromtype);
+}
+
+int
+(is_unop)(const ir_node *node) {
+ return _is_unop(node);
+}
+
+ir_node *
+get_unop_op (ir_node *node) {
+ if (node->op->opar == oparity_unary)
+ return get_irn_n(node, node->op->op_index);
+
+ assert(node->op->opar == oparity_unary);
+ return NULL;
+}
+
+void
+set_unop_op (ir_node *node, ir_node *op) {
+ if (node->op->opar == oparity_unary)
+ set_irn_n(node, node->op->op_index, op);
+
+ assert(node->op->opar == oparity_unary);
+}
+
+int
+(is_binop)(const ir_node *node) {
+ return _is_binop(node);
+}
+
+ir_node *
+get_binop_left (ir_node *node) {
+ if (node->op->opar == oparity_binary)
+ return get_irn_n(node, node->op->op_index);
+
+ assert(node->op->opar == oparity_binary);
+ return NULL;
+}
+
+void
+set_binop_left (ir_node *node, ir_node *left) {
+ if (node->op->opar == oparity_binary)
+ set_irn_n(node, node->op->op_index, left);
+
+ assert (node->op->opar == oparity_binary);
+}
+
+ir_node *
+get_binop_right (ir_node *node) {
+ if (node->op->opar == oparity_binary)
+ return get_irn_n(node, node->op->op_index + 1);
+
+ assert(node->op->opar == oparity_binary);
+ return NULL;
+}
+
+void
+set_binop_right (ir_node *node, ir_node *right) {
+ if (node->op->opar == oparity_binary)
+ set_irn_n(node, node->op->op_index + 1, right);
+
+ assert (node->op->opar == oparity_binary);
+}
+
+int is_Phi (const ir_node *n) {
+ ir_op *op;
+
+ assert(n);
+ op = get_irn_op(n);
+
+ if (op == op_Filter) return get_interprocedural_view();
+
+ if (op == op_Phi)
+ return ((get_irg_phase_state(get_irn_irg(n)) != phase_building) ||
+ (get_irn_arity(n) > 0));
+
+ return 0;
+}
+
+int is_Phi0 (const ir_node *n) {
+ assert(n);
+
+ return ((get_irn_op(n) == op_Phi) &&
+ (get_irn_arity(n) == 0) &&
+ (get_irg_phase_state(get_irn_irg(n)) == phase_building));
+}
+
+ir_node **
+get_Phi_preds_arr (ir_node *node) {
+ assert (node->op == op_Phi);
+ return (ir_node **)&(get_irn_in(node)[1]);
+}
+
+int
+get_Phi_n_preds (ir_node *node) {
+ assert (is_Phi(node) || is_Phi0(node));
+ 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 (ir_node *node, int pos) {
+ assert (is_Phi(node) || is_Phi0(node));
+ return get_irn_n(node, pos);
+}
+
+void
+set_Phi_pred (ir_node *node, int pos, ir_node *pred) {
+ assert (is_Phi(node) || is_Phi0(node));
+ 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);
+ return get_irn_n(node, 0);
+}
+
+void
+set_Load_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Load);
+ set_irn_n(node, 0, mem);
+}
+
+ir_node *
+get_Load_ptr (ir_node *node) {
+ assert (node->op == op_Load);
+ return get_irn_n(node, 1);
+}
+
+void
+set_Load_ptr (ir_node *node, ir_node *ptr) {
+ assert (node->op == op_Load);
+ set_irn_n(node, 1, ptr);
+}
+
+ir_mode *
+get_Load_mode (ir_node *node) {
+ assert (node->op == op_Load);
+ return node->attr.load.load_mode;
+}
+
+void
+set_Load_mode (ir_node *node, ir_mode *mode) {
+ assert (node->op == op_Load);
+ node->attr.load.load_mode = mode;
+}
+
+ent_volatility
+get_Load_volatility (ir_node *node) {
+ assert (node->op == op_Load);
+ return node->attr.load.volatility;
+}
+
+void
+set_Load_volatility (ir_node *node, ent_volatility volatility) {
+ assert (node->op == op_Load);
+ node->attr.load.volatility = volatility;
+}
+
+
+ir_node *
+get_Store_mem (ir_node *node) {
+ assert (node->op == op_Store);
+ return get_irn_n(node, 0);
+}
+
+void
+set_Store_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Store);
+ set_irn_n(node, 0, mem);
+}
+
+ir_node *
+get_Store_ptr (ir_node *node) {
+ assert (node->op == op_Store);
+ return get_irn_n(node, 1);
+}
+
+void
+set_Store_ptr (ir_node *node, ir_node *ptr) {
+ assert (node->op == op_Store);
+ set_irn_n(node, 1, ptr);
+}
+
+ir_node *
+get_Store_value (ir_node *node) {
+ assert (node->op == op_Store);
+ return get_irn_n(node, 2);
+}
+
+void
+set_Store_value (ir_node *node, ir_node *value) {
+ assert (node->op == op_Store);
+ set_irn_n(node, 2, value);
+}
+
+ent_volatility
+get_Store_volatility (ir_node *node) {
+ assert (node->op == op_Store);
+ return node->attr.store.volatility;
+}
+
+void
+set_Store_volatility (ir_node *node, ent_volatility volatility) {
+ assert (node->op == op_Store);
+ node->attr.store.volatility = volatility;
+}
+
+
+ir_node *
+get_Alloc_mem (ir_node *node) {
+ assert (node->op == op_Alloc);
+ return get_irn_n(node, 0);
+}
+
+void
+set_Alloc_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Alloc);
+ set_irn_n(node, 0, mem);
+}
+
+ir_node *
+get_Alloc_size (ir_node *node) {
+ assert (node->op == op_Alloc);
+ return get_irn_n(node, 1);
+}
+
+void
+set_Alloc_size (ir_node *node, ir_node *size) {
+ assert (node->op == op_Alloc);
+ set_irn_n(node, 1, size);
+}
+
+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, ir_type *tp) {
+ assert (node->op == op_Alloc);
+ node->attr.a.type = tp;
+}
+
+where_alloc
+get_Alloc_where (ir_node *node) {
+ assert (node->op == op_Alloc);
+ return node->attr.a.where;
+}
+
+void
+set_Alloc_where (ir_node *node, where_alloc where) {
+ assert (node->op == op_Alloc);
+ node->attr.a.where = where;
+}
+
+
+ir_node *
+get_Free_mem (ir_node *node) {
+ assert (node->op == op_Free);
+ return get_irn_n(node, 0);
+}
+
+void
+set_Free_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Free);
+ set_irn_n(node, 0, mem);
+}
+
+ir_node *
+get_Free_ptr (ir_node *node) {
+ assert (node->op == op_Free);
+ return get_irn_n(node, 1);
+}
+
+void
+set_Free_ptr (ir_node *node, ir_node *ptr) {
+ assert (node->op == op_Free);
+ set_irn_n(node, 1, ptr);
+}
+
+ir_node *
+get_Free_size (ir_node *node) {
+ assert (node->op == op_Free);
+ return get_irn_n(node, 2);
+}
+
+void
+set_Free_size (ir_node *node, ir_node *size) {
+ assert (node->op == op_Free);
+ set_irn_n(node, 2, size);
+}
+
+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, ir_type *tp) {
+ assert (node->op == op_Free);
+ node->attr.f.type = tp;
+}
+
+where_alloc
+get_Free_where (ir_node *node) {
+ assert (node->op == op_Free);
+ return node->attr.f.where;
+}
+
+void
+set_Free_where (ir_node *node, where_alloc where) {
+ assert (node->op == op_Free);
+ node->attr.f.where = where;
+}
+
+ir_node **
+get_Sync_preds_arr (ir_node *node) {
+ assert (node->op == op_Sync);
+ return (ir_node **)&(get_irn_in(node)[1]);
+}
+
+int
+get_Sync_n_preds (ir_node *node) {
+ assert (node->op == op_Sync);
+ return (get_irn_arity(node));
+}
+
+/*
+void
+set_Sync_n_preds (ir_node *node, int n_preds) {
+ assert (node->op == op_Sync);
+}
+*/
+
+ir_node *
+get_Sync_pred (ir_node *node, int pos) {
+ assert (node->op == op_Sync);
+ return get_irn_n(node, pos);
+}
+
+void
+set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
+ assert (node->op == op_Sync);
+ set_irn_n(node, pos, pred);
+}
+
+ir_type *get_Proj_type(ir_node *n)
+{
+ ir_type *tp = NULL;
+ 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 (get_irn_op(pred_pred) == op_Start) {
+ 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) {
+ 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) {
+ assert (is_Proj(node));
+ return get_irn_n(node, 0);
+}
+
+void
+set_Proj_pred (ir_node *node, ir_node *pred) {
+ assert (is_Proj(node));
+ set_irn_n(node, 0, pred);
+}
+
+long
+get_Proj_proj (const ir_node *node) {
+ assert (is_Proj(node));
+ if (get_irn_opcode(node) == iro_Proj) {
+ return node->attr.proj;
+ } else {
+ assert(get_irn_opcode(node) == iro_Filter);
+ return node->attr.filter.proj;
+ }
+}
+
+void
+set_Proj_proj (ir_node *node, long proj) {
+ assert (node->op == op_Proj);
+ node->attr.proj = proj;
+}
+
+ir_node **
+get_Tuple_preds_arr (ir_node *node) {
+ assert (node->op == op_Tuple);
+ return (ir_node **)&(get_irn_in(node)[1]);
+}
+
+int
+get_Tuple_n_preds (ir_node *node) {
+ assert (node->op == op_Tuple);
+ return (get_irn_arity(node));
+}
+
+/*
+void
+set_Tuple_n_preds (ir_node *node, int n_preds) {
+ assert (node->op == op_Tuple);
+}
+*/
+
+ir_node *
+get_Tuple_pred (ir_node *node, int pos) {
+ assert (node->op == op_Tuple);
+ return get_irn_n(node, pos);
+}
+
+void
+set_Tuple_pred (ir_node *node, int pos, ir_node *pred) {
+ assert (node->op == op_Tuple);
+ set_irn_n(node, pos, pred);
+}
+
+ir_node *
+get_Id_pred (ir_node *node) {
+ assert (node->op == op_Id);
return get_irn_n(node, 0);
}
-inline void
-set_Or_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Or);
- set_irn_n(node, 0, left);
+void
+set_Id_pred (ir_node *node, ir_node *pred) {
+ assert (node->op == op_Id);
+ set_irn_n(node, 0, pred);
}
-inline ir_node *
-get_Or_right (ir_node *node) {
- assert (node->op == op_Or);
+ir_node *get_Confirm_value (ir_node *node) {
+ assert (node->op == op_Confirm);
+ return get_irn_n(node, 0);
+}
+void set_Confirm_value (ir_node *node, ir_node *value) {
+ assert (node->op == op_Confirm);
+ set_irn_n(node, 0, value);
+}
+ir_node *get_Confirm_bound (ir_node *node) {
+ assert (node->op == op_Confirm);
return get_irn_n(node, 1);
}
+void set_Confirm_bound (ir_node *node, ir_node *bound) {
+ assert (node->op == op_Confirm);
+ set_irn_n(node, 0, bound);
+}
+pn_Cmp get_Confirm_cmp (ir_node *node) {
+ assert (node->op == op_Confirm);
+ return node->attr.confirm_cmp;
+}
+void set_Confirm_cmp (ir_node *node, pn_Cmp cmp) {
+ assert (node->op == op_Confirm);
+ node->attr.confirm_cmp = cmp;
+}
+
+
+ir_node *
+get_Filter_pred (ir_node *node) {
+ assert(node->op == op_Filter);
+ return node->in[1];
+}
+void
+set_Filter_pred (ir_node *node, ir_node *pred) {
+ assert(node->op == op_Filter);
+ node->in[1] = pred;
+}
+long
+get_Filter_proj(ir_node *node) {
+ assert(node->op == op_Filter);
+ return node->attr.filter.proj;
+}
+void
+set_Filter_proj (ir_node *node, long proj) {
+ assert(node->op == op_Filter);
+ 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(node->op == op_Filter);
+ if (node->attr.filter.in_cg == NULL || arity != ARR_LEN(node->attr.filter.in_cg) - 1) {
+ node->attr.filter.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
+ node->attr.filter.backedge = NEW_ARR_D (int, current_ir_graph->obst, arity);
+ memset(node->attr.filter.backedge, 0, sizeof(int) * 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(node->op == op_Filter && 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(node->op == op_Filter && 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(node->op == op_Filter && 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 (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) {
+ 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) {
+ 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) {
+ 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;
+ }
+}
-inline void
-set_Or_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Or);
- set_irn_n(node, 1, right);
+/* 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];
}
-inline ir_node *
-get_Eor_left (ir_node *node) {
- assert (node->op == op_Eor);
- return get_irn_n(node, 0);
+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;
}
-inline void
-set_Eor_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Eor);
- set_irn_n(node, 0, left);
+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];
}
-inline ir_node *
-get_Eor_right (ir_node *node) {
- assert (node->op == op_Eor);
- return get_irn_n(node, 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;
}
-inline void
-set_Eor_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Eor);
- set_irn_n(node, 1, right);
+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];
}
-
-inline ir_node *
-get_Not_op (ir_node *node) {
- assert (node->op == op_Not);
- return get_irn_n(node, 0);
+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;
}
-inline void
-set_Not_op (ir_node *node, ir_node *op) {
- assert (node->op == op_Not);
- set_irn_n(node, 0, op);
+int (get_Psi_n_conds)(ir_node *node) {
+ return _get_Psi_n_conds(node);
}
-
-inline ir_node *
-get_Shl_left (ir_node *node) {
- assert (node->op == op_Shl);
+/* CopyB support */
+ir_node *get_CopyB_mem (ir_node *node) {
+ assert (node->op == op_CopyB);
return get_irn_n(node, 0);
}
-inline void
-set_Shl_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Shl);
- set_irn_n(node, 0, left);
+void set_CopyB_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_CopyB);
+ set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_Shl_right (ir_node *node) {
- assert (node->op == op_Shl);
+ir_node *get_CopyB_dst (ir_node *node) {
+ assert (node->op == op_CopyB);
return get_irn_n(node, 1);
}
-inline void
-set_Shl_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Shl);
- set_irn_n(node, 1, right);
-}
-
-inline ir_node *
-get_Shr_left (ir_node *node) {
- assert (node->op == op_Shr);
- return get_irn_n(node, 0);
+void set_CopyB_dst (ir_node *node, ir_node *dst) {
+ assert (node->op == op_CopyB);
+ set_irn_n(node, 1, dst);
}
-inline void
-set_Shr_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Shr);
- set_irn_n(node, 0, left);
+ir_node *get_CopyB_src (ir_node *node) {
+ assert (node->op == op_CopyB);
+ return get_irn_n(node, 2);
}
-inline ir_node *
-get_Shr_right (ir_node *node) {
- assert (node->op == op_Shr);
- return get_irn_n(node, 1);
+void set_CopyB_src (ir_node *node, ir_node *src) {
+ assert (node->op == op_CopyB);
+ set_irn_n(node, 2, src);
}
-inline void
-set_Shr_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Shr);
- set_irn_n(node, 1, right);
+ir_type *get_CopyB_type(ir_node *node) {
+ assert (node->op == op_CopyB);
+ return node->attr.copyb.data_type;
}
-inline ir_node *
-get_Shrs_left (ir_node *node) {
- assert (node->op == op_Shrs);
- return get_irn_n(node, 0);
+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;
}
-inline void
-set_Shrs_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Shrs);
- set_irn_n(node, 0, left);
-}
-inline ir_node *
-get_Shrs_right (ir_node *node) {
- assert (node->op == op_Shrs);
- return get_irn_n(node, 1);
+ir_type *
+get_InstOf_type (ir_node *node) {
+ assert (node->op = op_InstOf);
+ return node->attr.io.type;
}
-inline void
-set_Shrs_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Shrs);
- set_irn_n(node, 1, right);
+void
+set_InstOf_type (ir_node *node, ir_type *type) {
+ assert (node->op = op_InstOf);
+ node->attr.io.type = type;
}
-inline ir_node *
-get_Rot_left (ir_node *node) {
- assert (node->op == op_Rot);
+ir_node *
+get_InstOf_store (ir_node *node) {
+ assert (node->op = op_InstOf);
return get_irn_n(node, 0);
}
-inline void
-set_Rot_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Rot);
- set_irn_n(node, 0, left);
+void
+set_InstOf_store (ir_node *node, ir_node *obj) {
+ assert (node->op = op_InstOf);
+ set_irn_n(node, 0, obj);
}
-inline ir_node *
-get_Rot_right (ir_node *node) {
- assert (node->op == op_Rot);
+ir_node *
+get_InstOf_obj (ir_node *node) {
+ assert (node->op = op_InstOf);
return get_irn_n(node, 1);
}
-inline void
-set_Rot_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Rot);
- set_irn_n(node, 1, right);
+void
+set_InstOf_obj (ir_node *node, ir_node *obj) {
+ assert (node->op = op_InstOf);
+ set_irn_n(node, 1, obj);
}
-inline ir_node *
-get_Cmp_left (ir_node *node) {
- assert (node->op == op_Cmp);
+/* 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);
}
-inline void
-set_Cmp_left (ir_node *node, ir_node *left) {
- assert (node->op == op_Cmp);
- set_irn_n(node, 0, left);
+void
+set_Raise_mem (ir_node *node, ir_node *mem) {
+ assert (node->op == op_Raise);
+ set_irn_n(node, 0, mem);
}
-inline ir_node *
-get_Cmp_right (ir_node *node) {
- assert (node->op == op_Cmp);
+ir_node *
+get_Raise_exo_ptr (ir_node *node) {
+ assert (node->op == op_Raise);
return get_irn_n(node, 1);
}
-inline void
-set_Cmp_right (ir_node *node, ir_node *right) {
- assert (node->op == op_Cmp);
- set_irn_n(node, 1, right);
+void
+set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) {
+ assert (node->op == op_Raise);
+ set_irn_n(node, 1, exo_ptr);
}
-inline ir_node *
-get_Conv_op (ir_node *node) {
- assert (node->op == op_Conv);
- return get_irn_n(node, 0);
-}
+/* Bound support */
-inline void
-set_Conv_op (ir_node *node, ir_node *op) {
- assert (node->op == op_Conv);
- set_irn_n(node, 0, op);
+/* 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);
}
-inline int
-get_Phi_n_preds (ir_node *node) {
- assert (node->op == op_Phi);
- return (get_irn_arity(node));
+void set_Bound_mem (ir_node *bound, ir_node *mem) {
+ assert (bound->op == op_Bound);
+ set_irn_n(bound, 0, mem);
}
-/*
-inline void set_Phi_n_preds (ir_node *node, int n_preds) {
- assert (node->op == op_Phi);
+/* 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);
}
-*/
-inline ir_node *
-get_Phi_pred (ir_node *node, int pos) {
- assert (node->op == op_Phi);
- return get_irn_n(node, pos);
+void set_Bound_index(ir_node *bound, ir_node *idx) {
+ assert (bound->op == op_Bound);
+ set_irn_n(bound, 1, idx);
}
-inline void
-set_Phi_pred (ir_node *node, int pos, ir_node *pred) {
- assert (node->op == op_Phi);
- set_irn_n(node, pos, pred);
+/* 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);
}
-inline ir_node *
-get_Load_mem (ir_node *node) {
- assert (node->op == op_Load);
- return get_irn_n(node, 0);
+void set_Bound_lower(ir_node *bound, ir_node *lower) {
+ assert (bound->op == op_Bound);
+ set_irn_n(bound, 2, lower);
}
-inline void
-set_Load_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Load);
- set_irn_n(node, 0, mem);
+/* 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);
}
-inline ir_node *
-get_Load_ptr (ir_node *node) {
- assert (node->op == op_Load);
- return get_irn_n(node, 1);
+void set_Bound_upper(ir_node *bound, ir_node *upper) {
+ assert (bound->op == op_Bound);
+ set_irn_n(bound, 3, upper);
}
-inline void
-set_Load_ptr (ir_node *node, ir_node *ptr) {
- assert (node->op == op_Load);
- set_irn_n(node, 1, ptr);
+/* returns the graph of a node */
+ir_graph *
+get_irn_irg(const ir_node *node) {
+ /*
+ * Do not use get_nodes_Block() here, because this
+ * will check the pinned state.
+ * However even a 'wrong' block is always in the proper
+ * irg.
+ */
+ if (! is_Block(node))
+ node = get_irn_n(node, -1);
+ if (is_Bad(node)) /* sometimes bad is predecessor of nodes instead of block: in case of optimization */
+ node = get_irn_n(node, -1);
+ assert(get_irn_op(node) == op_Block);
+ return node->attr.block.irg;
}
-inline
+
+/*----------------------------------------------------------------*/
+/* Auxiliary routines */
+/*----------------------------------------------------------------*/
+
ir_node *
-get_Store_mem (ir_node *node) {
- assert (node->op == op_Store);
- return get_irn_n(node, 0);
+skip_Proj (ir_node *node) {
+ /* don't assert node !!! */
+ if (node && is_Proj(node)) {
+ return get_Proj_pred(node);
+ } else {
+ return node;
+ }
}
-inline void
-set_Store_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Store);
- set_irn_n(node, 0, mem);
+ir_node *
+skip_Tuple (ir_node *node) {
+ ir_node *pred;
+ ir_op *op;
+
+ if (!get_opt_normalize()) return node;
+
+restart:
+ node = skip_Id(node);
+ if (get_irn_op(node) == op_Proj) {
+ pred = skip_Id(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 ? */
+ pred = skip_Id(skip_Tuple(pred));
+ op = get_irn_op(pred);
+
+ if (op == op_Tuple) {
+ node = get_Tuple_pred(pred, get_Proj_proj(node));
+ goto restart;
+ }
+ }
+ else if (op == op_Tuple) {
+ node = get_Tuple_pred(pred, get_Proj_proj(node));
+ goto restart;
+ }
+ }
+ return node;
}
-inline ir_node *
-get_Store_ptr (ir_node *node) {
- assert (node->op == op_Store);
- return get_irn_n(node, 1);
+/* 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 get_Cast_op(node);
+ return node;
}
-inline void
-set_Store_ptr (ir_node *node, ir_node *ptr) {
- assert (node->op == op_Store);
- set_irn_n(node, 1, ptr);
+/* returns operand of node if node is a Confirm */
+ir_node *skip_Confirm (ir_node *node) {
+ if (node && get_irn_op(node) == op_Confirm)
+ return get_Confirm_value(node);
+ return node;
}
-inline ir_node *
-get_Store_value (ir_node *node) {
- assert (node->op == op_Store);
- return get_irn_n(node, 2);
+/* skip all high-level ops */
+ir_node *skip_HighLevel(ir_node *node) {
+ if (node && is_op_highlevel(get_irn_op(node)))
+ return get_irn_n(node, 0);
+ return node;
}
-inline void
-set_Store_value (ir_node *node, ir_node *value) {
- assert (node->op == op_Store);
- set_irn_n(node, 2, value);
-}
+#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.
+ *
+ * Moreover, it CANNOT be switched off using get_opt_normalize() ...
+ */
+ir_node *
+skip_Id (ir_node *node) {
+ /* don't assert node !!! */
-inline ir_node *
-get_Alloc_mem (ir_node *node) {
- assert (node->op == op_Alloc);
- return get_irn_n(node, 0);
-}
+ /* 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])) {
+ ir_node *rem_pred = node->in[0+1];
+ ir_node *res;
-inline void
-set_Alloc_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Alloc);
- set_irn_n(node, 0, mem);
-}
+ assert (get_irn_arity (node) > 0);
-inline ir_node *
-get_Alloc_size (ir_node *node) {
- assert (node->op == op_Alloc);
- return get_irn_n(node, 1);
+ node->in[0+1] = node;
+ res = skip_Id(rem_pred);
+ if (res->op == op_Id) /* self-loop */ return node;
+
+ node->in[0+1] = res;
+ return res;
+ } else {
+ return 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.
+ *
+ * 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;
+ /* don't assert node !!! */
-inline void
-set_Allco_size (ir_node *node, ir_node *size) {
- assert (node->op == op_Alloc);
- set_irn_n(node, 1, size);
+ if (!node || (node->op != op_Id)) return node;
+
+ /* Don't use get_Id_pred(): We get into an endless loop for
+ self-referencing Ids. */
+ pred = node->in[0+1];
+
+ if (pred->op != op_Id) return pred;
+
+ if (node != pred) { /* not a self referencing Id. Resolve Id chain. */
+ ir_node *rem_pred, *res;
+
+ if (pred->op != op_Id) return pred; /* shortcut */
+ rem_pred = pred;
+
+ assert (get_irn_arity (node) > 0);
+
+ 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;
+
+ node->in[0+1] = res; /* Turn Id chain into Ids all referencing the chain end. */
+ return res;
+ } else {
+ return node;
+ }
}
+#endif
-inline type *
-get_Alloc_type (ir_node *node) {
- assert (node->op == op_Alloc);
- return node->attr.a.type;
+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);
}
-inline void
-set_Alloc_type (ir_node *node, type *type) {
- assert (node->op == op_Alloc);
- node->attr.a.type = type;
+int
+(is_Bad)(const ir_node *node) {
+ return _is_Bad(node);
}
-inline where_alloc
-get_Alloc_where (ir_node *node) {
- assert (node->op == op_Alloc);
- return node->attr.a.where;
+int
+(is_Const)(const ir_node *node) {
+ return _is_Const(node);
}
-inline void
-set_Alloc_where (ir_node *node, where_alloc where) {
- assert (node->op == op_Alloc);
- node->attr.a.where = where;
+int
+(is_no_Block)(const ir_node *node) {
+ return _is_no_Block(node);
}
+int
+(is_Block)(const ir_node *node) {
+ return _is_Block(node);
+}
-inline ir_node *
-get_Free_mem (ir_node *node) {
- assert (node->op == op_Free);
- return get_irn_n(node, 0);
+/* returns true if node is an Unknown node. */
+int
+(is_Unknown)(const ir_node *node) {
+ return _is_Unknown(node);
}
-inline void
-set_Free_mem (ir_node *node, ir_node *mem) {
- assert (node->op == op_Free);
- set_irn_n(node, 0, mem);
+/* returns true if node is a Return node. */
+int
+(is_Return)(const ir_node *node) {
+ return _is_Return(node);
}
-inline ir_node *
-get_Free_ptr (ir_node *node) {
- assert (node->op == op_Free);
- return get_irn_n(node, 1);
+/* returns true if node is a Call node. */
+int
+(is_Call)(const ir_node *node) {
+ return _is_Call(node);
}
-inline void
-set_Free_ptr (ir_node *node, ir_node *ptr) {
- assert (node->op == op_Free);
- set_irn_n(node, 1, ptr);
+/* returns true if node is a Sel node. */
+int
+(is_Sel)(const ir_node *node) {
+ return _is_Sel(node);
}
-inline ir_node *
-get_Free_size (ir_node *node) {
- assert (node->op == op_Free);
- return get_irn_n(node, 2);
+/* 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);
}
-inline void
-set_Free_size (ir_node *node, ir_node *size) {
- assert (node->op == op_Free);
- set_irn_n(node, 2, size);
+int
+is_Proj (const ir_node *node) {
+ assert(node);
+ return node->op == op_Proj
+ || (!get_interprocedural_view() && node->op == op_Filter);
}
-inline type *
-get_Free_type (ir_node *node) {
- assert (node->op == op_Free);
- return node->attr.f;
+/* Returns true if the operation manipulates control flow. */
+int
+is_cfop(const ir_node *node) {
+ return is_cfopcode(get_irn_op(node));
}
-inline void
-set_Free_type (ir_node *node, type *type) {
- assert (node->op == op_Free);
- node->attr.f = type;
+/* Returns true if the operation manipulates interprocedural control flow:
+ CallBegin, EndReg, EndExcept */
+int is_ip_cfop(const ir_node *node) {
+ return is_ip_cfopcode(get_irn_op(node));
}
-inline int
-get_Sync_n_preds (ir_node *node) {
- assert (node->op == op_Sync);
- return (get_irn_arity(node));
+/* Returns true if the operation can change the control flow because
+ of an exception. */
+int
+is_fragile_op(const ir_node *node) {
+ return is_op_fragile(get_irn_op(node));
}
-/*
-inline void
-set_Sync_n_preds (ir_node *node, int n_preds) {
- assert (node->op == op_Sync);
+/* Returns the memory operand of fragile operations. */
+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 :
+ return get_irn_n(node, 0);
+ case iro_Bad :
+ case iro_Unknown:
+ return node;
+ default: ;
+ assert(0 && "should not be reached");
+ return NULL;
+ }
}
-*/
-inline ir_node *
-get_Sync_pred (ir_node *node, int pos) {
- assert (node->op == op_Sync);
- return get_irn_n(node, pos);
+/* Returns true if the operation is a forking control flow operation. */
+int (is_irn_forking)(const ir_node *node) {
+ return _is_irn_forking(node);
}
-inline void
-set_Sync_pred (ir_node *node, int pos, ir_node *pred) {
- assert (node->op == op_Sync);
- set_irn_n(node, pos, pred);
+/* 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);
}
-inline ir_node *
-get_Proj_pred (ir_node *node) {
- assert (node->op == op_Proj);
- return get_irn_n(node, 0);
+/* 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);
}
-inline void
-set_Proj_pred (ir_node *node, ir_node *pred) {
- assert (node->op == op_Proj);
- set_irn_n(node, 0, pred);
+/* 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);
}
-inline long
-get_Proj_proj (ir_node *node) {
- assert (node->op == op_Proj);
- return node->attr.proj;
+/* Returns non-zero for constant-like nodes. */
+int (is_irn_constlike)(const ir_node *node) {
+ return _is_irn_constlike(node);
}
-inline void
-set_Proj_proj (ir_node *node, long proj) {
- assert (node->op == op_Proj);
- node->attr.proj = proj;
+/*
+ * 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);
}
-inline int
-get_Tuple_n_preds (ir_node *node) {
- assert (node->op == op_Tuple);
- return (get_irn_arity(node));
+/* Gets the string representation of the jump prediction .*/
+const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred)
+{
+ switch (pred) {
+ default:
+ case COND_JMP_PRED_NONE: return "no prediction";
+ case COND_JMP_PRED_TRUE: return "true taken";
+ case COND_JMP_PRED_FALSE: return "false taken";
+ }
}
-/*
-inline void
-set_Tuple_n_preds (ir_node *node, int n_preds) {
- assert (node->op == op_Tuple);
+/* Returns the conditional jump prediction of a Cond node. */
+cond_jmp_predicate (get_Cond_jmp_pred)(ir_node *cond) {
+ return _get_Cond_jmp_pred(cond);
}
-*/
-inline ir_node *
-get_Tuple_pred (ir_node *node, int pos) {
- assert (node->op == op_Tuple);
- return get_irn_n(node, pos);
+/* Sets a new conditional jump prediction. */
+void (set_Cond_jmp_pred)(ir_node *cond, cond_jmp_predicate pred) {
+ _set_Cond_jmp_pred(cond, pred);
}
-inline void
-set_Tuple_pred (ir_node *node, int pos, ir_node *pred) {
- assert (node->op == op_Tuple);
- set_irn_n(node, pos, pred);
+/** 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();
}
-inline ir_node *
-get_Id_pred (ir_node *node) {
- assert (node->op == op_Id);
- return get_irn_n(node, 0);
+/* Sets the get_type operation for an ir_op_ops. */
+ir_op_ops *firm_set_default_get_type(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;
}
-inline void
-set_Id_pred (ir_node *node, ir_node *pred) {
- assert (node->op == op_Id);
- set_irn_n(node, 0, pred);
+/** 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;
}
-/******************************************************************/
-/* Auxiliary routines */
-/******************************************************************/
+/** 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;
+}
-inline ir_node *
-skip_Proj (ir_node *node) {
- /* don't assert node !!! */
- if (node && (node->op == op_Proj)) {
- return get_Proj_pred(node);
- } else {
- return node;
- }
+/** the get_type_attr operation must be always implemented */
+static ir_type *get_Null_type(ir_node *n) {
+ return firm_unknown_type;
}
-inline ir_node *
-skip_nop (ir_node *node) {
- /* don't assert node !!! */
- if (node && (node->op == op_Id)) {
- return get_Id_pred(node);
- } else {
- return node;
+/* 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;
}
-inline int
-is_Bad (ir_node *node) {
- assert(node);
- if ((node) && get_irn_opcode(node) == iro_Bad)
- return 1;
- return 0;
+/** the get_entity_attr operation must be always implemented */
+static entity *get_Null_ent(ir_node *n) {
+ return NULL;
}
-inline int
-is_no_Block (ir_node *node) {
- assert(node);
- return (get_irn_opcode(node) != iro_Block);
+/* 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;
}
-/* Returns true if the operation manipulates control flow. */
-int
-is_cfop(ir_node *node) {
- return ( (get_irn_opcode(node) == iro_Start)
- || (get_irn_opcode(node) == iro_Jmp)
- || (get_irn_opcode(node) == iro_Cond)
- || (get_irn_opcode(node) == iro_Return)
- || (get_irn_opcode(node) == iro_Raise)
- || (get_irn_opcode(node) == iro_Bad));
+#ifdef DEBUG_libfirm
+void dump_irn (ir_node *n) {
+ int i, arity = get_irn_arity(n);
+ printf("%s%s: %ld (%p)\n", get_irn_opname(n), get_mode_name(get_irn_mode(n)), get_irn_node_nr(n), (void *)n);
+ if (!is_Block(n)) {
+ ir_node *pred = get_irn_n(n, -1);
+ printf(" block: %s%s: %ld (%p)\n", get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
+ get_irn_node_nr(pred), (void *)pred);
+ }
+ printf(" preds: \n");
+ for (i = 0; i < arity; ++i) {
+ ir_node *pred = get_irn_n(n, i);
+ printf(" %d: %s%s: %ld (%p)\n", i, get_irn_opname(pred), get_mode_name(get_irn_mode(pred)),
+ get_irn_node_nr(pred), (void *)pred);
+ }
}
-/* Returns true if the operation can change the control flow because
- of an exception. */
-int
-is_fragile_op(ir_node *node) {
- return ( (get_irn_opcode(node) == iro_Call)
- || (get_irn_opcode(node) == iro_Quot)
- || (get_irn_opcode(node) == iro_DivMod)
- || (get_irn_opcode(node) == iro_Div)
- || (get_irn_opcode(node) == iro_Mod)
- || (get_irn_opcode(node) == iro_Load)
- || (get_irn_opcode(node) == iro_Store)
- || (get_irn_opcode(node) == iro_Alloc)
- || (get_irn_opcode(node) == iro_Bad));
-}
+#else /* DEBUG_libfirm */
+void dump_irn (ir_node *n) {}
+#endif /* DEBUG_libfirm */