X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=19a36e91df995829de00602db843aeda2350f560;hb=ef3f4288a57fc536e74087390be6d0f33771511d;hp=b0d062fc5f4d173a32049ada3b64bcd29d336865;hpb=b597c7fd473086ca6374b2abbdf129f595c156d0;p=libfirm

diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c
index b0d062fc5..19a36e91d 100644
--- a/ir/ir/irnode.c
+++ b/ir/ir/irnode.c
@@ -23,14 +23,11 @@
  * @author  Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
  * @version $Id$
  */
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+#include "config.h"
 
-#ifdef HAVE_STRING_H
-# include <string.h>
-#endif
+#include <string.h>
 
+#include "pset_new.h"
 #include "ident.h"
 #include "irnode_t.h"
 #include "irgraph_t.h"
@@ -46,10 +43,12 @@
 #include "irhooks.h"
 #include "irtools.h"
 
+#include "beinfo.h"
+
 /* some constants fixing the positions of nodes predecessors
    in the in array */
 #define CALL_PARAM_OFFSET     2
-#define FUNCCALL_PARAM_OFFSET 1
+#define BUILDIN_PARAM_OFFSET  1
 #define SEL_INDEX_OFFSET      2
 #define RETURN_RESULT_OFFSET  1  /* mem is not a result */
 #define END_KEEPALIVE_OFFSET  0
@@ -164,13 +163,10 @@ new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mod
 		memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
 	}
 
-	res->in[0] = block;
+	res->in[0]   = block;
 	set_irn_dbg_info(res, db);
-	res->out = NULL;
-
-#ifdef DEBUG_libfirm
+	res->out     = NULL;
 	res->node_nr = get_irp_new_node_nr();
-#endif
 
 	for (i = 0; i < EDGE_KIND_LAST; ++i)
 		INIT_LIST_HEAD(&res->edge_info[i].outs_head);
@@ -181,6 +177,9 @@ new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mod
 		edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
 
 	hook_new_node(irg, res);
+	if (get_irg_phase_state(irg) == phase_backend) {
+		be_info_new_node(res);
+	}
 
 	return res;
 }
@@ -270,11 +269,11 @@ void set_irn_in(ir_node *node, int arity, ir_node **in) {
 }
 
 ir_node *(get_irn_intra_n)(const ir_node *node, int n) {
-	return _get_irn_intra_n (node, 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);
+	return _get_irn_inter_n(node, n);
 }
 
 ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
@@ -289,6 +288,7 @@ void set_irn_n(ir_node *node, int n, ir_node *in) {
 	assert(n < get_irn_arity(node));
 	assert(in && in->kind == k_ir_node);
 
+#ifdef INTERPROCEDURAL_VIEW
 	if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
 		/* Change block pred in both views! */
 		node->in[n + 1] = in;
@@ -296,7 +296,6 @@ void set_irn_n(ir_node *node, int n, ir_node *in) {
 		node->attr.filter.in_cg[n + 1] = in;
 		return;
 	}
-#ifdef INTERPROCEDURAL_VIEW
 	if (get_interprocedural_view()) { /* handle Filter and Block specially */
 		if (get_irn_opcode(node) == iro_Filter) {
 			assert(node->attr.filter.in_cg);
@@ -405,11 +404,6 @@ void (set_irn_mode)(ir_node *node, ir_mode *mode) {
 	_set_irn_mode(node, mode);
 }
 
-ir_modecode get_irn_modecode(const ir_node *node) {
-	assert(node);
-	return node->mode->code;
-}
-
 /** Gets the string representation of the mode .*/
 const char *get_irn_modename(const ir_node *node) {
 	assert(node);
@@ -445,11 +439,11 @@ ident *get_irn_opident(const ir_node *node) {
 	return node->op->name;
 }
 
-unsigned long (get_irn_visited)(const ir_node *node) {
+ir_visited_t (get_irn_visited)(const ir_node *node) {
 	return _get_irn_visited(node);
 }
 
-void (set_irn_visited)(ir_node *node, unsigned long visited) {
+void (set_irn_visited)(ir_node *node, ir_visited_t visited) {
 	_set_irn_visited(node, visited);
 }
 
@@ -457,14 +451,14 @@ 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);
 }
 
+int (irn_visited_else_mark)(ir_node *node) {
+	return _irn_visited_else_mark(node);
+}
+
 void (set_irn_link)(ir_node *node, void *link) {
 	_set_irn_link(node, link);
 }
@@ -483,7 +477,7 @@ op_pin_state (is_irn_pinned_in_irg) (const ir_node *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)
+	if (is_Tuple(node))
 		return;
 
 	assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
@@ -492,51 +486,10 @@ void set_irn_pinned(ir_node *node, op_pin_state state) {
 	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) {
-	(void) n;
-	return NULL;
-}
-void set_irn_abst_value(ir_node *n, struct abstval *os) {
-	(void) n;
-	(void) os;
-}
-struct section *firm_get_irn_section(ir_node *n) {
-	(void) n;
-	return NULL;
-}
-void firm_set_irn_section(ir_node *n, struct section *s) {
-	(void) n;
-	(void) 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
 }
 
 const_attr *get_irn_const_attr(ir_node *node) {
@@ -565,9 +518,9 @@ symconst_attr *get_irn_symconst_attr(ir_node *node) {
 	return &node->attr.symc;
 }
 
-ir_type *get_irn_call_attr(ir_node *node) {
+call_attr *get_irn_call_attr(ir_node *node) {
 	assert(is_Call(node));
-	return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
+	return &node->attr.call;
 }
 
 sel_attr *get_irn_sel_attr(ir_node *node) {
@@ -606,6 +559,11 @@ divmod_attr *get_irn_divmod_attr(ir_node *node) {
 	return &node->attr.divmod;
 }
 
+builtin_attr *get_irn_builtin_attr(ir_node *node) {
+	assert(is_Builtin(node));
+	return &node->attr.builtin;
+}
+
 void *(get_irn_generic_attr)(ir_node *node) {
 	assert(is_ir_node(node));
 	return _get_irn_generic_attr(node);
@@ -673,20 +631,6 @@ ir_type *is_tls_pointer(const ir_node *n) {
 	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(const ir_node *n) {
-	if (is_Proj(n) &&
-		(get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
-		is_Start(get_Proj_pred(n)))
-		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(is_Block(node));
 	return (ir_node **)&(get_irn_in(node)[1]);
@@ -705,6 +649,16 @@ void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
 	set_irn_n(node, pos, pred);
 }
 
+int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred) {
+	int i;
+
+	for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
+		if (get_Block_cfgpred_block(block, i) == pred)
+			return i;
+	}
+	return -1;
+}
+
 ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos) {
 	return _get_Block_cfgpred_block(node, pos);
 }
@@ -719,11 +673,11 @@ void set_Block_matured(ir_node *node, int matured) {
 	node->attr.block.is_matured = matured;
 }
 
-unsigned long (get_Block_block_visited)(const ir_node *node) {
+ir_visited_t (get_Block_block_visited)(const ir_node *node) {
 	return _get_Block_block_visited(node);
 }
 
-void (set_Block_block_visited)(ir_node *node, unsigned long visit) {
+void (set_Block_block_visited)(ir_node *node, ir_visited_t visit) {
 	_set_Block_block_visited(node, visit);
 }
 
@@ -732,10 +686,6 @@ void (mark_Block_block_visited)(ir_node *node) {
 	_mark_Block_block_visited(node);
 }
 
-int (Block_not_block_visited)(const ir_node *node) {
-	return _Block_not_block_visited(node);
-}
-
 int (Block_block_visited)(const ir_node *node) {
 	return _Block_block_visited(node);
 }
@@ -832,6 +782,7 @@ ir_node *get_Block_MacroBlock(const ir_node *block) {
 /* Sets the macro block header of a block. */
 void set_Block_MacroBlock(ir_node *block, ir_node *mbh) {
 	assert(is_Block(block));
+	mbh = skip_Id(mbh);
 	assert(is_Block(mbh));
 	set_irn_n(block, -1, mbh);
 }
@@ -848,25 +799,46 @@ ir_node *get_irn_MacroBlock(const ir_node *n) {
 }
 
 /* returns the graph of a Block. */
-ir_graph *get_Block_irg(const ir_node *block) {
-	assert(is_Block(block));
-	return block->attr.block.irg;
+ir_graph *(get_Block_irg)(const ir_node *block) {
+	return _get_Block_irg(block);
 }
 
-int has_Block_label(const ir_node *block) {
+ir_entity *create_Block_entity(ir_node *block) {
+	ir_entity *entity;
 	assert(is_Block(block));
-	return block->attr.block.has_label;
+
+	entity = block->attr.block.entity;
+	if (entity == NULL) {
+		ir_label_t  nr;
+		ir_type   *glob;
+
+		glob = get_glob_type();
+		entity = new_entity(glob, id_unique("block_%u"), get_code_type());
+		nr = get_irp_next_label_nr();
+		set_entity_label(entity, nr);
+		set_entity_compiler_generated(entity, 1);
+		set_entity_allocation(entity, allocation_static);
+
+		block->attr.block.entity = entity;
+	}
+	return entity;
 }
 
-ir_label_t get_Block_label(const ir_node *block) {
+ir_entity *get_Block_entity(const ir_node *block) {
 	assert(is_Block(block));
-	return block->attr.block.label;
+	return block->attr.block.entity;
 }
 
-void set_Block_label(ir_node *block, ir_label_t label) {
+void set_Block_entity(ir_node *block, ir_entity *entity)
+{
 	assert(is_Block(block));
-	block->attr.block.has_label = 1;
-	block->attr.block.label = label;
+	assert(get_entity_type(entity) == get_code_type());
+	block->attr.block.entity = entity;
+}
+
+int has_Block_entity(const ir_node *block)
+{
+	return block->attr.block.entity != NULL;
 }
 
 ir_node *(get_Block_phis)(const ir_node *block) {
@@ -902,12 +874,7 @@ ir_node *get_End_keepalive(const ir_node *end, int pos) {
 }
 
 void add_End_keepalive(ir_node *end, ir_node *ka) {
-	ir_graph *irg = get_irn_irg(end);
 	assert(is_End(end));
-
-	if (get_irg_phase_state(irg) == phase_building) {
-		assert((is_Phi(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
-	}
 	add_irn_n(end, ka);
 }
 
@@ -963,11 +930,48 @@ found:
 		end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
 		edges_notify_edge(end, idx, old, NULL, irg);
 	}
+	/* now n - 1 keeps, 1 block input */
 	ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
 }
 
-void
-free_End(ir_node *end) {
+/* remove Bads, NoMems and doublets from the keep-alive set */
+void remove_End_Bads_and_doublets(ir_node *end) {
+	pset_new_t keeps;
+	int        idx, n = get_End_n_keepalives(end);
+	ir_graph   *irg;
+
+	if (n <= 0)
+		return;
+
+	irg = get_irn_irg(end);
+	pset_new_init(&keeps);
+
+	for (idx = n - 1; idx >= 0; --idx) {
+		ir_node *ka = get_End_keepalive(end, idx);
+
+		if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
+			/* remove the edge */
+			edges_notify_edge(end, idx, NULL, ka, irg);
+
+			if (idx != n - 1) {
+				/* exchange with the last one */
+				ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
+				edges_notify_edge(end, n - 1, NULL, old, irg);
+				end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
+				edges_notify_edge(end, idx, old, NULL, irg);
+			}
+			--n;
+		} else {
+			pset_new_insert(&keeps, ka);
+		}
+	}
+	/* n keeps, 1 block input */
+	ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
+
+	pset_new_destroy(&keeps);
+}
+
+void free_End(ir_node *end) {
 	assert(is_End(end));
 	end->kind = k_BAD;
 	DEL_ARR_F(end->in);
@@ -1018,6 +1022,18 @@ 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).
 */
+
+const char *get_cond_kind_name(cond_kind kind)
+{
+#define X(a)    case a: return #a;
+	switch (kind) {
+		X(dense);
+		X(fragmentary);
+	}
+	return "<unknown>";
+#undef X
+}
+
 ir_node *
 get_Cond_selector(const ir_node *node) {
 	assert(is_Cond(node));
@@ -1043,11 +1059,16 @@ set_Cond_kind(ir_node *node, cond_kind kind) {
 }
 
 long
-get_Cond_defaultProj(const ir_node *node) {
+get_Cond_default_proj(const ir_node *node) {
 	assert(is_Cond(node));
 	return node->attr.cond.default_proj;
 }
 
+void set_Cond_default_proj(ir_node *node, long defproj) {
+	assert(is_Cond(node));
+	node->attr.cond.default_proj = defproj;
+}
+
 ir_node *
 get_Return_mem(const ir_node *node) {
 	assert(is_Return(node));
@@ -1124,7 +1145,6 @@ int (is_Const_all_one)(const ir_node *node) {
 ir_type *
 get_Const_type(ir_node *node) {
 	assert(is_Const(node));
-	node->attr.con.tp = skip_tid(node->attr.con.tp);
 	return node->attr.con.tp;
 }
 
@@ -1158,7 +1178,7 @@ get_SymConst_type(const ir_node *node) {
 	ir_node *irn = (ir_node *)node;
 	assert(is_SymConst(node) &&
 	       (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
-	return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
+	return irn->attr.symc.sym.type_p;
 }
 
 void
@@ -1214,20 +1234,9 @@ set_SymConst_symbol(ir_node *node, union symconst_symbol sym) {
 	node->attr.symc.sym = sym;
 }
 
-ir_label_t get_SymConst_label(const ir_node *node) {
-	assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
-	return node->attr.symc.sym.label;
-}
-
-void set_SymConst_label(ir_node *node, ir_label_t label) {
-	assert(is_SymConst(node) && SYMCONST_HAS_LABEL(get_SymConst_kind(node)));
-	node->attr.symc.sym.label = label;
-}
-
 ir_type *
 get_SymConst_value_type(ir_node *node) {
 	assert(is_SymConst(node));
-	if (node->attr.symc.tp) node->attr.symc.tp = skip_tid(node->attr.symc.tp);
 	return node->attr.symc.tp;
 }
 
@@ -1291,7 +1300,7 @@ set_Sel_index(ir_node *node, int pos, ir_node *index) {
 ir_entity *
 get_Sel_entity(const ir_node *node) {
 	assert(is_Sel(node));
-	return node->attr.sel.ent;
+	return node->attr.sel.entity;
 }
 
 /* need a version without const to prevent warning */
@@ -1302,7 +1311,7 @@ static ir_entity *_get_Sel_entity(ir_node *node) {
 void
 set_Sel_entity(ir_node *node, ir_entity *ent) {
 	assert(is_Sel(node));
-	node->attr.sel.ent = ent;
+	node->attr.sel.entity = ent;
 }
 
 
@@ -1350,18 +1359,6 @@ get_Call_n_params(const ir_node *node)  {
 	return (get_irn_arity(node) - CALL_PARAM_OFFSET);
 }
 
-int
-get_Call_arity(const ir_node *node) {
-	assert(is_Call(node));
-	return get_Call_n_params(node);
-}
-
-/* void
-set_Call_arity(ir_node *node, ir_node *arity) {
-	assert(is_Call(node));
-}
-*/
-
 ir_node *
 get_Call_param(const ir_node *node, int pos) {
 	assert(is_Call(node));
@@ -1377,16 +1374,113 @@ set_Call_param(ir_node *node, int pos, ir_node *param) {
 ir_type *
 get_Call_type(ir_node *node) {
 	assert(is_Call(node));
-	return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
+	return node->attr.call.type;
 }
 
 void
 set_Call_type(ir_node *node, ir_type *tp) {
 	assert(is_Call(node));
 	assert((get_unknown_type() == tp) || is_Method_type(tp));
-	node->attr.call.cld_tp = tp;
+	node->attr.call.type = tp;
+}
+
+unsigned
+get_Call_tail_call(const ir_node *node) {
+	assert(is_Call(node));
+	return node->attr.call.tail_call;
+}
+
+void
+set_Call_tail_call(ir_node *node, unsigned tail_call) {
+	assert(is_Call(node));
+	node->attr.call.tail_call = tail_call != 0;
+}
+
+ir_node *
+get_Builtin_mem(const ir_node *node) {
+	assert(is_Builtin(node));
+	return get_irn_n(node, 0);
+}
+
+void
+set_Builin_mem(ir_node *node, ir_node *mem) {
+	assert(is_Builtin(node));
+	set_irn_n(node, 0, mem);
+}
+
+ir_builtin_kind
+get_Builtin_kind(const ir_node *node) {
+	assert(is_Builtin(node));
+	return node->attr.builtin.kind;
+}
+
+void
+set_Builtin_kind(ir_node *node, ir_builtin_kind kind) {
+	assert(is_Builtin(node));
+	node->attr.builtin.kind = kind;
+}
+
+ir_node **
+get_Builtin_param_arr(ir_node *node) {
+	assert(is_Builtin(node));
+	return &get_irn_in(node)[BUILDIN_PARAM_OFFSET + 1];
+}
+
+int
+get_Builtin_n_params(const ir_node *node)  {
+	assert(is_Builtin(node));
+	return (get_irn_arity(node) - BUILDIN_PARAM_OFFSET);
+}
+
+ir_node *
+get_Builtin_param(const ir_node *node, int pos) {
+	assert(is_Builtin(node));
+	return get_irn_n(node, pos + BUILDIN_PARAM_OFFSET);
+}
+
+void
+set_Builtin_param(ir_node *node, int pos, ir_node *param) {
+	assert(is_Builtin(node));
+	set_irn_n(node, pos + BUILDIN_PARAM_OFFSET, param);
+}
+
+ir_type *
+get_Builtin_type(ir_node *node) {
+	assert(is_Builtin(node));
+	return node->attr.builtin.type;
+}
+
+void
+set_Builtin_type(ir_node *node, ir_type *tp) {
+	assert(is_Builtin(node));
+	assert((get_unknown_type() == tp) || is_Method_type(tp));
+	node->attr.builtin.type = tp;
+}
+
+/* Returns a human readable string for the ir_builtin_kind. */
+const char *get_builtin_kind_name(ir_builtin_kind kind) {
+#define X(a)    case a: return #a;
+	switch (kind) {
+		X(ir_bk_trap);
+		X(ir_bk_debugbreak);
+		X(ir_bk_return_address);
+		X(ir_bk_frame_address);
+		X(ir_bk_prefetch);
+		X(ir_bk_ffs);
+		X(ir_bk_clz);
+		X(ir_bk_ctz);
+		X(ir_bk_popcount);
+		X(ir_bk_parity);
+		X(ir_bk_bswap);
+		X(ir_bk_inport);
+		X(ir_bk_outport);
+		X(ir_bk_inner_trampoline);
+	}
+	return "<unknown>";
+#undef X
 }
 
+
 int Call_has_callees(const ir_node *node) {
 	assert(is_Call(node));
 	return ((get_irg_callee_info_state(get_irn_irg(node)) != irg_callee_info_none) &&
@@ -1500,16 +1594,17 @@ BINOP_MEM(OP)                                           \
                                                         \
 ir_mode *get_##OP##_resmode(const ir_node *node) {      \
   assert(is_##OP(node));                                \
-  return node->attr.divmod.res_mode;                    \
+  return node->attr.divmod.resmode;                     \
 }                                                       \
                                                         \
 void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
   assert(is_##OP(node));                                \
-  node->attr.divmod.res_mode = mode;                    \
+  node->attr.divmod.resmode = mode;                     \
 }
 
 
 BINOP(Add)
+BINOP(Borrow)
 BINOP(Carry)
 BINOP(Sub)
 UNOP(Minus)
@@ -1532,11 +1627,16 @@ BINOP(Cmp)
 UNOP(Conv)
 UNOP(Cast)
 
-int is_Div_remainderless(const ir_node *node) {
+int get_Div_no_remainder(const ir_node *node) {
 	assert(is_Div(node));
 	return node->attr.divmod.no_remainder;
 }
 
+void set_Div_no_remainder(ir_node *node, int no_remainder) {
+	assert(is_Div(node));
+	node->attr.divmod.no_remainder = no_remainder;
+}
+
 int get_Conv_strict(const ir_node *node) {
 	assert(is_Conv(node));
 	return node->attr.conv.strict;
@@ -1550,14 +1650,13 @@ void set_Conv_strict(ir_node *node, int strict_flag) {
 ir_type *
 get_Cast_type(ir_node *node) {
 	assert(is_Cast(node));
-	node->attr.cast.totype = skip_tid(node->attr.cast.totype);
-	return node->attr.cast.totype;
+	return node->attr.cast.type;
 }
 
 void
 set_Cast_type(ir_node *node, ir_type *to_tp) {
 	assert(is_Cast(node));
-	node->attr.cast.totype = to_tp;
+	node->attr.cast.type = to_tp;
 }
 
 
@@ -1656,11 +1755,6 @@ set_binop_right(ir_node *node, ir_node *right) {
 	set_irn_n(node, node->op->op_index + 1, right);
 }
 
-int
-(is_Phi)(const ir_node *n) {
-	return _is_Phi(n);
-}
-
 int is_Phi0(const ir_node *n) {
 	assert(n);
 
@@ -1759,13 +1853,13 @@ set_Load_ptr(ir_node *node, ir_node *ptr) {
 ir_mode *
 get_Load_mode(const ir_node *node) {
 	assert(is_Load(node));
-	return node->attr.load.load_mode;
+	return node->attr.load.mode;
 }
 
 void
 set_Load_mode(ir_node *node, ir_mode *mode) {
 	assert(is_Load(node));
-	node->attr.load.load_mode = mode;
+	node->attr.load.mode = mode;
 }
 
 ir_volatility
@@ -1881,7 +1975,7 @@ set_Alloc_size(ir_node *node, ir_node *size) {
 ir_type *
 get_Alloc_type(ir_node *node) {
 	assert(is_Alloc(node));
-	return node->attr.alloc.type = skip_tid(node->attr.alloc.type);
+	return node->attr.alloc.type;
 }
 
 void
@@ -1942,7 +2036,7 @@ set_Free_size(ir_node *node, ir_node *size) {
 ir_type *
 get_Free_type(ir_node *node) {
 	assert(is_Free(node));
-	return node->attr.free.type = skip_tid(node->attr.free.type);
+	return node->attr.free.type;
 }
 
 void
@@ -2275,19 +2369,19 @@ void set_CopyB_src(ir_node *node, ir_node *src) {
 
 ir_type *get_CopyB_type(ir_node *node) {
 	assert(is_CopyB(node));
-	return node->attr.copyb.data_type = skip_tid(node->attr.copyb.data_type);
+	return node->attr.copyb.type;
 }
 
 void set_CopyB_type(ir_node *node, ir_type *data_type) {
 	assert(is_CopyB(node) && data_type);
-	node->attr.copyb.data_type = data_type;
+	node->attr.copyb.type = data_type;
 }
 
 
 ir_type *
 get_InstOf_type(ir_node *node) {
 	assert(node->op == op_InstOf);
-	return node->attr.instof.type = skip_tid(node->attr.instof.type);
+	return node->attr.instof.type;
 }
 
 void
@@ -2455,10 +2549,8 @@ get_irn_irg(const ir_node *node) {
 	 */
 	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;
+	/* note that get_Block_irg() can handle Bad nodes */
+	return get_Block_irg(node);
 }
 
 
@@ -2495,10 +2587,8 @@ skip_Tuple(ir_node *node) {
   ir_node *pred;
   ir_op   *op;
 
-  if (!get_opt_normalize()) return node;
-
 restart:
-	if (get_irn_op(node) == op_Proj) {
+	if (is_Proj(node)) {
 	    pred = get_Proj_pred(node);
 	    op   = get_irn_op(pred);
 
@@ -2508,9 +2598,8 @@ restart:
 		 */
 		if (op == op_Proj) { /* nested Tuple ? */
 		    pred = skip_Tuple(pred);
-		    op   = get_irn_op(pred);
 
-			if (op == op_Tuple) {
+			if (is_Tuple(pred)) {
 				node = get_Tuple_pred(pred, get_Proj_proj(node));
 				goto restart;
 			}
@@ -2545,7 +2634,7 @@ ir_node *skip_Pin(ir_node *node) {
 
 /* returns operand of node if node is a Confirm */
 ir_node *skip_Confirm(ir_node *node) {
-	if (get_irn_op(node) == op_Confirm)
+	if (is_Confirm(node))
 		return get_Confirm_value(node);
 	return node;
 }
@@ -2610,298 +2699,22 @@ void skip_Id_and_store(ir_node **node) {
 	*node = skip_Id(n);
 }
 
-int
-(is_Bad)(const ir_node *node) {
-	return _is_Bad(node);
-}
-
-int
-(is_NoMem)(const ir_node *node) {
-	return _is_NoMem(node);
-}
-
-int
-(is_Minus)(const ir_node *node) {
-	return _is_Minus(node);
-}
-
-int
-(is_Abs)(const ir_node *node) {
-	return _is_Abs(node);
-}
-
-int
-(is_Mod)(const ir_node *node) {
-	return _is_Mod(node);
-}
-
-int
-(is_Div)(const ir_node *node) {
-	return _is_Div(node);
-}
-
-int
-(is_DivMod)(const ir_node *node) {
-	return _is_DivMod(node);
-}
-
-int
-(is_Quot)(const ir_node *node) {
-	return _is_Quot(node);
-}
-
-int
-(is_Add)(const ir_node *node) {
-	return _is_Add(node);
-}
-
-int
-(is_Carry)(const ir_node *node) {
-	return _is_Carry(node);
-}
-
-int
-(is_And)(const ir_node *node) {
-	return _is_And(node);
-}
-
-int
-(is_Or)(const ir_node *node) {
-	return _is_Or(node);
-}
-
-int
-(is_Eor)(const ir_node *node) {
-	return _is_Eor(node);
-}
-
-int
-(is_Sub)(const ir_node *node) {
-	return _is_Sub(node);
-}
-
-int
-(is_Shl)(const ir_node *node) {
-	return _is_Shl(node);
-}
-
-int
-(is_Shr)(const ir_node *node) {
-	return _is_Shr(node);
-}
-
-int
-(is_Shrs)(const ir_node *node) {
-	return _is_Shrs(node);
-}
-
-int
-(is_Rotl)(const ir_node *node) {
-	return _is_Rotl(node);
-}
-
-int
-(is_Not)(const ir_node *node) {
-	return _is_Not(node);
-}
-
-int
-(is_Id)(const ir_node *node) {
-	return _is_Id(node);
-}
-
-int
-(is_Tuple)(const ir_node *node) {
-	return _is_Tuple(node);
-}
-
-int
-(is_Bound)(const ir_node *node) {
-	return _is_Bound(node);
-}
-
-int
-(is_Start)(const ir_node *node) {
-  return _is_Start(node);
-}
-
-int
-(is_End)(const ir_node *node) {
-	return _is_End(node);
-}
-
-int
-(is_Const)(const ir_node *node) {
-	return _is_Const(node);
-}
-
-int
-(is_Conv)(const ir_node *node) {
-	return _is_Conv(node);
-}
-
 int
 (is_strictConv)(const ir_node *node) {
 	return _is_strictConv(node);
 }
 
-int
-(is_Cast)(const ir_node *node) {
-	return _is_Cast(node);
-}
-
 int
 (is_no_Block)(const ir_node *node) {
 	return _is_no_Block(node);
 }
 
-int
-(is_Block)(const ir_node *node) {
-	return _is_Block(node);
-}
-
-/* returns true if node is an Unknown node. */
-int
-(is_Unknown)(const ir_node *node) {
-	return _is_Unknown(node);
-}
-
-/* returns true if node is a Return node. */
-int
-(is_Return)(const ir_node *node) {
-	return _is_Return(node);
-}
-
-/* returns true if node is a Call node. */
-int
-(is_Call)(const ir_node *node) {
-	return _is_Call(node);
-}
-
-/* returns true if node is a CallBegin node. */
-int
-(is_CallBegin)(const ir_node *node) {
-	return _is_CallBegin(node);
-}
-
-/* returns true if node is a Sel node. */
-int
-(is_Sel)(const ir_node *node) {
-	return _is_Sel(node);
-}
-
-/* returns true if node is a Mux node. */
-int
-(is_Mux)(const ir_node *node) {
-	return _is_Mux(node);
-}
-
-/* returns true if node is a Load node. */
-int
-(is_Load)(const ir_node *node) {
-	return _is_Load(node);
-}
-
-/* returns true if node is a Load node. */
-int
-(is_Store)(const ir_node *node) {
-	return _is_Store(node);
-}
-
-/* returns true if node is a Sync node. */
-int
-(is_Sync)(const ir_node *node) {
-	return _is_Sync(node);
-}
-
-/* Returns true if node is a Confirm node. */
-int
-(is_Confirm)(const ir_node *node) {
-	return _is_Confirm(node);
-}
-
-/* Returns true if node is a Pin node. */
-int
-(is_Pin)(const ir_node *node) {
-	return _is_Pin(node);
-}
-
-/* Returns true if node is a SymConst node. */
-int
-(is_SymConst)(const ir_node *node) {
-	return _is_SymConst(node);
-}
-
 /* Returns true if node is a SymConst node with kind symconst_addr_ent. */
 int
 (is_SymConst_addr_ent)(const ir_node *node) {
 	return _is_SymConst_addr_ent(node);
 }
 
-/* Returns true if node is a Cond node. */
-int
-(is_Cond)(const ir_node *node) {
-	return _is_Cond(node);
-}
-
-int
-(is_CopyB)(const ir_node *node) {
-	return _is_CopyB(node);
-}
-
-/* returns true if node is a Cmp node. */
-int
-(is_Cmp)(const ir_node *node) {
-	return _is_Cmp(node);
-}
-
-/* returns true if node is an Alloc node. */
-int
-(is_Alloc)(const ir_node *node) {
-	return _is_Alloc(node);
-}
-
-/* returns true if node is a Free node. */
-int
-(is_Free)(const ir_node *node) {
-	return _is_Free(node);
-}
-
-/* returns true if a node is a Jmp node. */
-int
-(is_Jmp)(const ir_node *node) {
-	return _is_Jmp(node);
-}
-
-/* returns true if a node is a IJmp node. */
-int
-(is_IJmp)(const ir_node *node) {
-	return _is_IJmp(node);
-}
-
-/* returns true if a node is a Raise node. */
-int
-(is_Raise)(const ir_node *node) {
-	return _is_Raise(node);
-}
-
-/* returns true if a node is an ASM node. */
-int
-(is_ASM)(const ir_node *node) {
-	return _is_ASM(node);
-}
-
-int
-(is_Proj)(const ir_node *node) {
-	return _is_Proj(node);
-}
-
-/* Returns true if node is a Filter node. */
-int
-(is_Filter)(const ir_node *node) {
-	return _is_Filter(node);
-}
-
 /* Returns true if the operation manipulates control flow. */
 int is_cfop(const ir_node *node) {
 	return is_op_cfopcode(get_irn_op(node));
@@ -2935,7 +2748,7 @@ ir_node *get_fragile_op_mem(ir_node *node) {
 	case iro_Alloc :
 	case iro_Bound :
 	case iro_CopyB :
-		return get_irn_n(node, pn_Generic_M_regular);
+		return get_irn_n(node, pn_Generic_M);
 	case iro_Bad   :
 	case iro_Unknown:
 		return node;
@@ -2963,6 +2776,10 @@ int (is_irn_forking)(const ir_node *node) {
 	return _is_irn_forking(node);
 }
 
+void (copy_node_attr)(const ir_node *old_node, ir_node *new_node) {
+	_copy_node_attr(old_node, new_node);
+}
+
 /* Return the type associated with the value produced by n
  * if the node remarks this type as it is the case for
  * Cast, Const, SymConst and some Proj nodes. */
@@ -3019,12 +2836,14 @@ int (is_irn_machine_user)(const ir_node *node, unsigned n) {
 
 /* Gets the string representation of the jump prediction .*/
 const char *get_cond_jmp_predicate_name(cond_jmp_predicate pred) {
+#define X(a)    case a: return #a;
 	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";
+		X(COND_JMP_PRED_NONE);
+		X(COND_JMP_PRED_TRUE);
+		X(COND_JMP_PRED_FALSE);
 	}
+	return "<unknown>";
+#undef X
 }
 
 /* Returns the conditional jump prediction of a Cond node. */
@@ -3132,30 +2951,6 @@ dbg_info *(get_irn_dbg_info)(const ir_node *n) {
 	return _get_irn_dbg_info(n);
 }
 
-#if 0 /* allow the global pointer */
-
-/* checks whether a node represents a global address */
-int is_Global(const ir_node *node) {
-	ir_node *ptr;
-
-	if (is_SymConst_addr_ent(node))
-		return 1;
-	if (! is_Sel(node))
-		return 0;
-
-	ptr = get_Sel_ptr(node);
-	return is_globals_pointer(ptr) != NULL;
-}
-
-/* returns the entity of a global address */
-ir_entity *get_Global_entity(const ir_node *node) {
-	if (is_SymConst(node))
-		return get_SymConst_entity(node);
-	else
-		return get_Sel_entity(node);
-}
-#else
-
 /* checks whether a node represents a global address */
 int is_Global(const ir_node *node) {
 	return is_SymConst_addr_ent(node);
@@ -3165,7 +2960,6 @@ int is_Global(const ir_node *node) {
 ir_entity *get_Global_entity(const ir_node *node) {
 	return get_SymConst_entity(node);
 }
-#endif
 
 /*
  * Calculate a hash value of a node.
@@ -3189,3 +2983,6 @@ unsigned firm_default_hash(const ir_node *node) {
 
 	return h;
 }  /* firm_default_hash */
+
+/* include generated code */
+#include "gen_irnode.c.inl"