X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firnode.c;h=61d73947b2dd95c657912fda7471467e5950ef85;hb=31ef53136fdb86d4a98919c2148c95cadea4ea81;hp=66eb23634904bb851c6026900235c5365b836b11;hpb=6f2933b9dd830b276ddf99bedcef41d7b70b9f42;p=libfirm

diff --git a/ir/ir/irnode.c b/ir/ir/irnode.c
index 66eb23634..61d73947b 100644
--- a/ir/ir/irnode.c
+++ b/ir/ir/irnode.c
@@ -138,7 +138,9 @@ new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mod
 	char *p;
 	int i;
 
-	assert(irg && op && mode);
+	assert(irg);
+	assert(op);
+	assert(mode);
 	p = obstack_alloc(irg->obst, node_size);
 	memset(p, 0, node_size);
 	res = (ir_node *)(p + firm_add_node_size);
@@ -356,6 +358,8 @@ void (set_irn_dep)(ir_node *node, int pos, ir_node *dep) {
 int add_irn_dep(ir_node *node, ir_node *dep) {
 	int res = 0;
 
+	/* DEP edges are only allowed in backend phase */
+	assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
 	if (node->deps == NULL) {
 		node->deps = NEW_ARR_F(ir_node *, 1);
 		node->deps[0] = dep;
@@ -441,11 +445,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);
 }
 
@@ -453,14 +457,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);
 }
@@ -479,7 +483,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);
@@ -715,11 +719,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);
 }
 
@@ -728,10 +732,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);
 }
@@ -899,7 +899,6 @@ ir_node *get_End_keepalive(const ir_node *end, int pos) {
 
 void add_End_keepalive(ir_node *end, ir_node *ka) {
 	assert(is_End(end));
-	assert((is_Phi(ka) || is_Proj(ka) || is_Block(ka) || is_irn_keep(ka)) && "Only Phi, Block or Keep nodes can be kept alive!");
 	add_irn_n(end, ka);
 }
 
@@ -1144,10 +1143,13 @@ set_SymConst_kind(ir_node *node, symconst_kind kind) {
 }
 
 ir_type *
-get_SymConst_type(ir_node *node) {
+get_SymConst_type(const ir_node *node) {
+	/* the cast here is annoying, but we have to compensate for
+	   the skip_tip() */
+	ir_node *irn = (ir_node *)node;
 	assert(is_SymConst(node) &&
 	       (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
-	return node->attr.symc.sym.type_p = skip_tid(node->attr.symc.sym.type_p);
+	return irn->attr.symc.sym.type_p = skip_tid(irn->attr.symc.sym.type_p);
 }
 
 void
@@ -1330,7 +1332,7 @@ set_Call_ptr(ir_node *node, ir_node *ptr) {
 ir_node **
 get_Call_param_arr(ir_node *node) {
 	assert(is_Call(node));
-	return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
+	return &get_irn_in(node)[CALL_PARAM_OFFSET + 1];
 }
 
 int
@@ -1499,6 +1501,7 @@ void set_##OP##_resmode(ir_node *node, ir_mode *mode) { \
 
 
 BINOP(Add)
+BINOP(Carry)
 BINOP(Sub)
 UNOP(Minus)
 BINOP(Mul)
@@ -2064,6 +2067,11 @@ set_Proj_proj(ir_node *node, long proj) {
 #endif /* INTERPROCEDURAL_VIEW */
 }
 
+/* Returns non-zero if a node is a routine parameter. */
+int (is_arg_Proj)(const ir_node *node) {
+	return _is_arg_Proj(node);
+}
+
 ir_node **
 get_Tuple_preds_arr(ir_node *node) {
 	assert(is_Tuple(node));
@@ -2196,101 +2204,33 @@ ir_node *get_Filter_cg_pred(ir_node *node, int pos) {
 
 /* Mux support */
 ir_node *get_Mux_sel(const ir_node *node) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		return get_Psi_cond(node, 0);
-	}
 	assert(is_Mux(node));
 	return node->in[1];
 }
 
 void set_Mux_sel(ir_node *node, ir_node *sel) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		set_Psi_cond(node, 0, sel);
-	} else {
-		assert(is_Mux(node));
-		node->in[1] = sel;
-	}
+	assert(is_Mux(node));
+	node->in[1] = sel;
 }
 
 ir_node *get_Mux_false(const ir_node *node) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		return get_Psi_default(node);
-	}
 	assert(is_Mux(node));
 	return node->in[2];
 }
 
 void set_Mux_false(ir_node *node, ir_node *ir_false) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		set_Psi_default(node, ir_false);
-	} else {
-		assert(is_Mux(node));
-		node->in[2] = ir_false;
-	}
+	assert(is_Mux(node));
+	node->in[2] = ir_false;
 }
 
 ir_node *get_Mux_true(const ir_node *node) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		return get_Psi_val(node, 0);
-	}
 	assert(is_Mux(node));
 	return node->in[3];
 }
 
 void set_Mux_true(ir_node *node, ir_node *ir_true) {
-	if (is_Psi(node)) {
-		assert(get_irn_arity(node) == 3);
-		set_Psi_val(node, 0, ir_true);
-	} else {
-		assert(is_Mux(node));
-		node->in[3] = ir_true;
-	}
-}
-
-/* Psi support */
-ir_node *get_Psi_cond(const ir_node *node, int pos) {
-	assert(is_Psi(node));
-	assert(pos < get_Psi_n_conds(node));
-	return get_irn_n(node, 2 * pos);
-}
-
-void set_Psi_cond(ir_node *node, int pos, ir_node *cond) {
-	assert(is_Psi(node));
-	assert(pos < get_Psi_n_conds(node));
-	set_irn_n(node, 2 * pos, cond);
-}
-
-ir_node *get_Psi_val(const ir_node *node, int pos) {
-	assert(is_Psi(node));
-	assert(pos < get_Psi_n_conds(node));
-	return get_irn_n(node, 2 * pos + 1);
-}
-
-void set_Psi_val(ir_node *node, int pos, ir_node *val) {
-	assert(is_Psi(node));
-	assert(pos < get_Psi_n_conds(node));
-	set_irn_n(node, 2 * pos + 1, val);
-}
-
-ir_node *get_Psi_default(const ir_node *node) {
-	int def_pos = get_irn_arity(node) - 1;
-	assert(is_Psi(node));
-	return get_irn_n(node, def_pos);
-}
-
-void set_Psi_default(ir_node *node, ir_node *val) {
-	int def_pos = get_irn_arity(node);
-	assert(is_Psi(node));
-	set_irn_n(node, def_pos, val);
-}
-
-int (get_Psi_n_conds)(const ir_node *node) {
-	return _get_Psi_n_conds(node);
+	assert(is_Mux(node));
+	node->in[3] = ir_true;
 }
 
 /* CopyB support */
@@ -2508,7 +2448,7 @@ get_irn_irg(const ir_node *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);
+	assert(is_Block(node));
 	return node->attr.block.irg;
 }
 
@@ -2575,14 +2515,28 @@ restart:
 
 /* returns operand of node if node is a Cast */
 ir_node *skip_Cast(ir_node *node) {
-	if (get_irn_op(node) == op_Cast)
+	if (is_Cast(node))
+		return get_Cast_op(node);
+	return node;
+}
+
+/* returns operand of node if node is a Cast */
+const ir_node *skip_Cast_const(const ir_node *node) {
+	if (is_Cast(node))
 		return get_Cast_op(node);
 	return node;
 }
 
+/* returns operand of node if node is a Pin */
+ir_node *skip_Pin(ir_node *node) {
+	if (is_Pin(node))
+		return get_Pin_op(node);
+	return 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;
 }
@@ -2692,6 +2646,11 @@ int
 	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);
@@ -2737,11 +2696,6 @@ int
 	return _is_Not(node);
 }
 
-int
-(is_Psi)(const ir_node *node) {
-	return _is_Psi(node);
-}
-
 int
 (is_Id)(const ir_node *node) {
 	return _is_Id(node);
@@ -2827,7 +2781,7 @@ int
 	return _is_Sel(node);
 }
 
-/* returns true if node is a Mux node or a Psi with only one condition. */
+/* returns true if node is a Mux node. */
 int
 (is_Mux)(const ir_node *node) {
 	return _is_Mux(node);
@@ -3204,23 +3158,25 @@ ir_entity *get_Global_entity(const ir_node *node) {
 }
 #endif
 
-#ifdef DEBUG_libfirm
-void dump_irn(const 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);
+/*
+ * Calculate a hash value of a node.
+ */
+unsigned firm_default_hash(const ir_node *node) {
+	unsigned h;
+	int i, irn_arity;
+
+	/* hash table value = 9*(9*(9*(9*(9*arity+in[0])+in[1])+ ...)+mode)+code */
+	h = irn_arity = get_irn_intra_arity(node);
+
+	/* consider all in nodes... except the block if not a control flow. */
+	for (i = is_cfop(node) ? -1 : 0;  i < irn_arity;  ++i) {
+		h = 9*h + HASH_PTR(get_irn_intra_n(node, i));
 	}
-}
 
-#else  /* DEBUG_libfirm */
-void dump_irn(const ir_node *n) { (void) n; }
-#endif /* DEBUG_libfirm */
+	/* ...mode,... */
+	h = 9*h + HASH_PTR(get_irn_mode(node));
+	/* ...and code */
+	h = 9*h + HASH_PTR(get_irn_op(node));
+
+	return h;
+}  /* firm_default_hash */