X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firverify.c;h=4f6001acb2119b4ae93e96a3dc47da759cf25c04;hb=25313dd42cf428b81b32ca83296ef3dfac9702b7;hp=5814d2d0e7b3a6cb31fcd32b1f497fa8a3f513a0;hpb=5413681e89d04862a1b7d4837049a42c0ea4230b;p=libfirm

diff --git a/ir/ir/irverify.c b/ir/ir/irverify.c
index 5814d2d0e..4f6001acb 100644
--- a/ir/ir/irverify.c
+++ b/ir/ir/irverify.c
@@ -1,30 +1,16 @@
 /*
- * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
- *
  * This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
  * @file
  * @brief    Check irnodes for correctness.
  * @author   Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
- * @version  $Id$
  */
 #include "config.h"
 
+#include "irnode_t.h"
 #include "irprog.h"
 #include "irop_t.h"
 #include "irgraph_t.h"
@@ -36,18 +22,11 @@
 #include "irouts.h"
 #include "irflag_t.h"
 #include "irpass_t.h"
-
-/** if this flag is set, verify entity types in Load & Store nodes */
-static int verify_entities = 0;
+#include "irnodeset.h"
+#include "ircons.h"
 
 const char *firm_verify_failure_msg;
 
-/* enable verification of Load/Store entities */
-void verify_enable_entity_tests(int enable)
-{
-	verify_entities = enable;
-}
-
 #ifndef NDEBUG
 
 /**
@@ -68,7 +47,7 @@ static ir_graph *last_irg_error = NULL;
  *
  * @param node  the node caused the failure
  */
-static void show_entity_failure(ir_node *node)
+static void show_entity_failure(const ir_node *node)
 {
 	ir_graph *irg = get_irn_irg(node);
 
@@ -84,13 +63,7 @@ static void show_entity_failure(ir_node *node)
 
 		if (ent) {
 			ir_type *ent_type = get_entity_owner(ent);
-
-			if (ent_type) {
-				ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n",
-				           ent_type, get_entity_name(ent));
-			} else {
-				fprintf(stderr, "\nFIRM: irn_verify_irg() <NULL>::%s failed\n", get_entity_name(ent));
-			}
+			ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n", ent_type, get_entity_name(ent));
 		} else {
 			fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
 		}
@@ -106,7 +79,7 @@ static const char *get_irn_modename(const ir_node *node)
 /**
  * Prints a failure for a Node
  */
-static void show_node_failure(ir_node *n)
+static void show_node_failure(const ir_node *n)
 {
 	show_entity_failure(n);
 	fprintf(stderr, "  node %ld %s%s\n" ,
@@ -118,7 +91,7 @@ static void show_node_failure(ir_node *n)
 /**
  * Prints a failure message for a binop
  */
-static void show_binop_failure(ir_node *n, const char *text)
+static void show_binop_failure(const ir_node *n, const char *text)
 {
 	ir_node *left  = get_binop_left(n);
 	ir_node *right = get_binop_right(n);
@@ -135,7 +108,7 @@ static void show_binop_failure(ir_node *n, const char *text)
 /**
  * Prints a failure message for an unop
  */
-static void show_unop_failure(ir_node *n, const char *text)
+static void show_unop_failure(const ir_node *n, const char *text)
 {
 	ir_node *op  = get_unop_op(n);
 
@@ -150,7 +123,7 @@ static void show_unop_failure(ir_node *n, const char *text)
 /**
  * Prints a failure message for an op with 3 operands
  */
-static void show_triop_failure(ir_node *n, const char *text)
+static void show_triop_failure(const ir_node *n, const char *text)
 {
 	ir_node *op0  = get_irn_n(n, 0);
 	ir_node *op1  = get_irn_n(n, 1);
@@ -169,7 +142,7 @@ static void show_triop_failure(ir_node *n, const char *text)
 /**
  * Prints a failure message for a proj
  */
-static void show_proj_failure(ir_node *n)
+static void show_proj_failure(const ir_node *n)
 {
 	ir_node *op  = get_Proj_pred(n);
 	int proj     = get_Proj_proj(n);
@@ -184,7 +157,7 @@ static void show_proj_failure(ir_node *n)
 /**
  * Prints a failure message for a proj from Start
  */
-static void show_proj_mode_failure(ir_node *n, ir_type *ty)
+static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
 {
 	long proj  = get_Proj_proj(n);
 	ir_mode *m = get_type_mode(ty);
@@ -200,30 +173,10 @@ static void show_proj_mode_failure(ir_node *n, ir_type *ty)
 		get_mode_name_ex(m));
 }
 
-/**
- * Prints a failure message for a proj
- */
-static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
-{
-	ir_node *op  = get_Proj_pred(n);
-	int proj     = get_Proj_proj(n);
-	ir_mode *m   = get_type_mode(get_entity_type(ent));
-	char type_name[256];
-	ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
-
-	show_entity_failure(n);
-	fprintf(stderr, "  node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
-		get_irn_node_nr(n),
-		get_irn_opname(n), get_irn_modename(n), proj,
-		get_irn_opname(op), get_irn_modename(op),
-		get_entity_name(ent), type_name,
-		get_mode_name_ex(m));
-}
-
 /**
  * Show a node and a graph
  */
-static void show_node_on_graph(ir_graph *irg, ir_node *n)
+static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
 {
 	ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
 }
@@ -231,20 +184,21 @@ static void show_node_on_graph(ir_graph *irg, ir_node *n)
 /**
  * Show call parameters
  */
-static void show_call_param(ir_node *n, ir_type *mt)
+static void show_call_param(const ir_node *n, ir_type *mt)
 {
-	size_t i;
 	char type_name[256];
 	ir_print_type(type_name, sizeof(type_name), mt);
 
 	show_entity_failure(n);
 	fprintf(stderr, "  Call type-check failed: %s(", type_name);
-	for (i = 0; i < get_method_n_params(mt); ++i) {
+	size_t n_method_params = get_method_n_params(mt);
+	for (size_t i = 0; i < n_method_params; ++i) {
 		fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
 	}
 	fprintf(stderr, ") != CALL(");
 
-	for (i = 0; i < get_Call_n_params(n); ++i) {
+	int n_params = get_Call_n_params(n);
+	for (int i = 0; i < n_params; ++i) {
 		fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
 	}
 	fprintf(stderr, ")\n");
@@ -253,7 +207,8 @@ static void show_call_param(ir_node *n, ir_type *mt)
 /**
  * Show return modes
  */
-static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
+static void show_return_modes(const ir_graph *irg, const ir_node *n,
+                              ir_type *mt, int i)
 {
 	ir_entity *ent = get_irg_entity(irg);
 
@@ -268,7 +223,7 @@ static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
 /**
  * Show return number of results
  */
-static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
+static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
 {
 	ir_entity *ent = get_irg_entity(irg);
 
@@ -282,7 +237,7 @@ static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
 /**
  * Show Phi input
  */
-static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
+static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
 {
 	(void) pos;
 	show_entity_failure(phi);
@@ -294,7 +249,7 @@ static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
 /**
  * Show Phi inputs
  */
-static void show_phi_inputs(ir_node *phi, ir_node *block)
+static void show_phi_inputs(const ir_node *phi, const ir_node *block)
 {
 	show_entity_failure(phi);
 	fprintf(stderr, "  Phi node %ld has %d inputs, its Block %ld has %d\n",
@@ -304,36 +259,19 @@ static void show_phi_inputs(ir_node *phi, ir_node *block)
 
 #endif /* #ifndef NDEBUG */
 
-/**
- * If the address is Sel or SymConst, return the entity.
- *
- * @param ptr  the node representing the address
- */
-static ir_entity *get_ptr_entity(ir_node *ptr)
-{
-	if (is_Sel(ptr)) {
-		return get_Sel_entity(ptr);
-	} else if (is_SymConst_addr_ent(ptr)) {
-		return get_SymConst_entity(ptr);
-	}
-	return NULL;
-}
-
 /**
  * verify a Proj(Start) node
  */
-static int verify_node_Proj_Start(ir_node *n, ir_node *p)
+static int verify_node_Proj_Start(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
 	long proj     = get_Proj_proj(p);
-	(void) n;
 
 	ASSERT_AND_RET_DBG(
 		(
 			(proj == pn_Start_X_initial_exec && mode == mode_X) ||
 			(proj == pn_Start_M              && mode == mode_M) ||
 			(proj == pn_Start_P_frame_base   && mode_is_reference(mode)) ||
-			(proj == pn_Start_P_tls          && mode_is_reference(mode)) ||
 			(proj == pn_Start_T_args         && mode == mode_T)
 		),
 		"wrong Proj from Start", 0,
@@ -345,31 +283,39 @@ static int verify_node_Proj_Start(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Cond) node
  */
-static int verify_node_Proj_Cond(ir_node *pred, ir_node *p)
+static int verify_node_Proj_Cond(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
-	long proj     = get_Proj_proj(p);
+	long     proj = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
-		(
-			(proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) ||   /* compare */
-			(mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) ||             /* switch */
-			is_Bad(get_Cond_selector(pred))                                                       /* rare */
-		),
+		mode == mode_X && (proj == pn_Cond_false || proj == pn_Cond_true),
 		"wrong Proj from Cond", 0,
 		show_proj_failure(p);
 	);
 	return 1;
 }
 
+static int verify_node_Proj_Switch(const ir_node *p)
+{
+	ir_mode *mode = get_irn_mode(p);
+	long     pn   = get_Proj_proj(p);
+	ir_node *pred = get_Proj_pred(p);
+	ASSERT_AND_RET_DBG(
+		mode == mode_X && (pn >= 0 && pn < (long)get_Switch_n_outs(pred)),
+		"wrong Proj from Switch", 0,
+		show_proj_failure(p);
+	);
+	return 1;
+}
+
 /**
  * verify a Proj(Raise) node
  */
-static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
+static int verify_node_Proj_Raise(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
 	long proj     = get_Proj_proj(p);
-	(void) n;
 
 	ASSERT_AND_RET_DBG(
 		((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
@@ -382,11 +328,10 @@ static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
 /**
  * verify a Proj(InstOf) node
  */
-static int verify_node_Proj_InstOf(ir_node *n, ir_node *p)
+static int verify_node_Proj_InstOf(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
 	long proj     = get_Proj_proj(p);
-	(void) n;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -404,9 +349,10 @@ static int verify_node_Proj_InstOf(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Call) node
  */
-static int verify_node_Proj_Call(ir_node *n, ir_node *p)
+static int verify_node_Proj_Call(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
@@ -414,8 +360,7 @@ static int verify_node_Proj_Call(ir_node *n, ir_node *p)
 			(proj == pn_Call_M                && mode == mode_M) ||
 			(proj == pn_Call_X_regular        && mode == mode_X) ||
 			(proj == pn_Call_X_except         && mode == mode_X) ||
-			(proj == pn_Call_T_result         && mode == mode_T) ||
-			(proj == pn_Call_P_value_res_base && mode_is_reference(mode))
+			(proj == pn_Call_T_result         && mode == mode_T)
 		),
 		"wrong Proj from Call", 0,
 		show_proj_failure(p);
@@ -435,9 +380,10 @@ static int verify_node_Proj_Call(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Div) node
  */
-static int verify_node_Proj_Div(ir_node *n, ir_node *p)
+static int verify_node_Proj_Div(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
@@ -445,7 +391,7 @@ static int verify_node_Proj_Div(ir_node *n, ir_node *p)
 			(proj == pn_Div_M         && mode == mode_M) ||
 			(proj == pn_Div_X_regular && mode == mode_X) ||
 			(proj == pn_Div_X_except  && mode == mode_X) ||
-			(proj == pn_Div_res       && mode_is_data(mode) && mode == get_Div_resmode(n))
+			(proj == pn_Div_res       && mode == get_Div_resmode(n))
 		),
 		"wrong Proj from Div", 0,
 		show_proj_failure(p);
@@ -468,9 +414,10 @@ static int verify_node_Proj_Div(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Mod) node
  */
-static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
+static int verify_node_Proj_Mod(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
@@ -501,33 +448,19 @@ static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Load) node
  */
-static int verify_node_Proj_Load(ir_node *n, ir_node *p)
+static int verify_node_Proj_Load(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	if (proj == pn_Load_res) {
-		ir_node   *ptr = get_Load_ptr(n);
-		ir_entity *ent = get_ptr_entity(ptr);
-		ir_graph  *irg = get_irn_irg(n);
-
-		if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
-			/* do NOT check this for lowered phases, see comment on Store */
-			ASSERT_AND_RET_DBG(
-				(mode == get_type_mode(get_entity_type(ent))),
-				"wrong data Proj from Load, entity type_mode failed", 0,
-				show_proj_failure_ent(p, ent);
-			);
-		}
-		else {
-			ASSERT_AND_RET_DBG(
-				mode_is_data(mode) && mode == get_Load_mode(n),
-				"wrong data Proj from Load", 0,
-				show_proj_failure(p);
-			);
-		}
-	}
-	else {
+		ASSERT_AND_RET_DBG(
+			mode_is_data(mode) && mode == get_Load_mode(n),
+			"wrong data Proj from Load", 0,
+			show_proj_failure(p);
+		);
+	} else {
 		ASSERT_AND_RET_DBG(
 			(
 				(proj == pn_Load_M         && mode == mode_M) ||
@@ -553,9 +486,10 @@ static int verify_node_Proj_Load(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Store) node
  */
-static int verify_node_Proj_Store(ir_node *n, ir_node *p)
+static int verify_node_Proj_Store(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
@@ -582,11 +516,10 @@ static int verify_node_Proj_Store(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Alloc) node
  */
-static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
+static int verify_node_Proj_Alloc(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
 	long proj     = get_Proj_proj(p);
-	(void) n;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -604,19 +537,18 @@ static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
 /**
  * verify a Proj(Proj) node
  */
-static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
+static int verify_node_Proj_Proj(const ir_node *p)
 {
-	ir_mode *mode = get_irn_mode(p);
-	long proj     = get_Proj_proj(p);
-	long nr       = get_Proj_proj(pred);
-	ir_type *mt; /* A method type */
-
-	pred = skip_Id(get_Proj_pred(pred));
-	ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
+	ir_mode *mode     = get_irn_mode(p);
+	ir_node *pred     = get_Proj_pred(p);
+	ir_node *predpred = get_Proj_pred(pred);
+	long     proj     = get_Proj_proj(p);
+	long     nr       = get_Proj_proj(pred);
 
-	switch (get_irn_opcode(pred)) {
-	case iro_Start:
-		mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
+	switch (get_irn_opcode(predpred)) {
+	case iro_Start:;
+		ir_graph *irg = get_irn_irg(p);
+		ir_type  *mt  = get_entity_type(get_irg_entity(irg));
 
 		if (nr == pn_Start_T_args) {
 			ASSERT_AND_RET(
@@ -626,12 +558,10 @@ static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
 				(proj < (int)get_method_n_params(mt)),
 				"More Projs for args than args in type", 0
 				);
-			if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
-				/* value argument */ break;
-
-			if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
+			ir_type *param_type = get_method_param_type(mt, proj);
+			if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 				ASSERT_AND_RET_DBG(
-						(mode == get_type_mode(get_method_param_type(mt, proj))),
+						(mode == get_type_mode(param_type)),
 						"Mode of Proj from Start doesn't match mode of param type.", 0,
 						show_proj_mode_failure(p, get_method_param_type(mt, proj));
 						);
@@ -644,16 +574,19 @@ static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
 			ASSERT_AND_RET(
 				(proj >= 0 && mode_is_datab(mode)),
 				"wrong Proj from Proj from Call", 0);
-			mt = get_Call_type(pred);
-			ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
+			mt = get_Call_type(predpred);
+			ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
 					"wrong call type on call", 0);
 			ASSERT_AND_RET(
 				(proj < (int)get_method_n_ress(mt)),
 				"More Projs for results than results in type.", 0);
-			if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
-				/* value result */ break;
+			ir_type *res_type = get_method_res_type(mt, proj);
+			/* value result */
+			if ((mode_is_reference(mode)) &&
+				(is_compound_type(res_type) || is_Array_type(res_type)))
+				break;
 
-				ASSERT_AND_RET(
+			ASSERT_AND_RET(
 				(mode == get_type_mode(get_method_res_type(mt, proj))),
 				"Mode of Proj from Call doesn't match mode of result type.", 0);
 		}
@@ -663,10 +596,6 @@ static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
 		/* We don't test */
 		break;
 
-	case iro_Bad:
-		/* hmm, optimization did not remove it */
-		break;
-
 	default:
 		/* ASSERT_AND_RET(0, "Unknown opcode", 0); */
 		break;
@@ -677,9 +606,8 @@ static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
 /**
  * verify a Proj(Tuple) node
  */
-static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
+static int verify_node_Proj_Tuple(const ir_node *p)
 {
-	(void) n;
 	(void) p;
 	/* We don't test */
 	return 1;
@@ -688,9 +616,10 @@ static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
 /**
  * verify a Proj(CopyB) node
  */
-static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
+static int verify_node_Proj_CopyB(const ir_node *p)
 {
 	ir_mode *mode = get_irn_mode(p);
+	ir_node *n    = get_Proj_pred(p);
 	long proj     = get_Proj_proj(p);
 
 	ASSERT_AND_RET_DBG(
@@ -713,35 +642,23 @@ static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
 	return 1;
 }
 
-/**
- * verify a Proj(Bound) node
- */
-static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
+static int verify_node_Proj_fragile(const ir_node *node)
 {
-	ir_mode *mode = get_irn_mode(p);
-	long proj     = get_Proj_proj(p);
-
-	/* ignore Bound checks of Bad */
-	if (is_Bad(get_Bound_index(n)))
-		return 1;
-	ASSERT_AND_RET_DBG(
-		(
-			(proj == pn_Bound_M         && mode == mode_M) ||
-			(proj == pn_Bound_X_regular && mode == mode_X) ||
-			(proj == pn_Bound_X_except  && mode == mode_X) ||
-			(proj == pn_Bound_res       && mode == get_irn_mode(get_Bound_index(n)))
-		),
-		"wrong Proj from Bound", 0,
-		show_proj_failure(p);
-	);
+	ir_node *pred             = get_Proj_pred(node);
+	int      throws_exception = ir_throws_exception(pred);
+	ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
+	    && (!is_x_regular_Proj(node) || throws_exception),
+	    "X_except und X_regular Proj only allowed when throws_exception is set",
+	    0);
 	return 1;
 }
 
 /**
  * verify a Proj node
  */
-static int verify_node_Proj(ir_node *p, ir_graph *irg)
+static int verify_node_Proj(const ir_node *p)
 {
+	ir_graph *irg = get_irn_irg(p);
 	ir_node *pred;
 	ir_op *op;
 
@@ -749,10 +666,15 @@ static int verify_node_Proj(ir_node *p, ir_graph *irg)
 	ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
 	ASSERT_AND_RET(get_irg_pinned(irg) == op_pin_state_floats || get_nodes_block(pred) == get_nodes_block(p), "Proj must be in same block as its predecessor", 0);
 
-	op = get_irn_op(pred);
+	if (is_fragile_op(pred)) {
+		int res = verify_node_Proj_fragile(p);
+		if (res != 1)
+			return res;
+	}
 
+	op = get_irn_op(pred);
 	if (op->ops.verify_proj_node)
-		return op->ops.verify_proj_node(pred, p);
+		return op->ops.verify_proj_node(p);
 
 	/* all went ok */
 	return 1;
@@ -761,22 +683,24 @@ static int verify_node_Proj(ir_node *p, ir_graph *irg)
 /**
  * verify a Block node
  */
-static int verify_node_Block(ir_node *n, ir_graph *irg)
+static int verify_node_Block(const ir_node *n)
 {
+	ir_graph *irg = get_irn_irg(n);
 	int i;
 
 	for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
-		ir_node *pred = get_Block_cfgpred(n, i);
-		ASSERT_AND_RET(
-			is_Bad(pred) || (get_irn_mode(pred) == mode_X),
+		ir_node *pred         = get_Block_cfgpred(n, i);
+		ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
+		ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
 			"Block node must have a mode_X predecessor", 0);
+		ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
 	}
 
 	if (n == get_irg_start_block(irg)) {
 		ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
 	}
 
-	if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
+	if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 		/* End block may only have Return, Raise or fragile ops as preds. */
 		for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
 			ir_node *pred =  skip_Proj(get_Block_cfgpred(n, i));
@@ -791,18 +715,18 @@ static int verify_node_Block(ir_node *n, ir_graph *irg)
 				),
 				"End Block node", 0);
 		}
-		/*  irg attr must == graph we are in. */
-		ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
-		return 1;
+	}
+	/*  irg attr must == graph we are in. */
+	ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
+	return 1;
 }
 
 /**
  * verify a Start node
  */
-static int verify_node_Start(ir_node *n, ir_graph *irg)
+static int verify_node_Start(const ir_node *n)
 {
 	ir_mode *mymode = get_irn_mode(n);
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* Start: BB --> X x M x ref x data1 x ... x datan x ref */
@@ -814,10 +738,9 @@ static int verify_node_Start(ir_node *n, ir_graph *irg)
 /**
  * verify a Jmp node
  */
-static int verify_node_Jmp(ir_node *n, ir_graph *irg)
+static int verify_node_Jmp(const ir_node *n)
 {
 	ir_mode *mymode = get_irn_mode(n);
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* Jmp: BB --> X */
@@ -829,11 +752,10 @@ static int verify_node_Jmp(ir_node *n, ir_graph *irg)
 /**
  * verify an IJmp node
  */
-static int verify_node_IJmp(ir_node *n, ir_graph *irg)
+static int verify_node_IJmp(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* IJmp: BB x ref --> X */
@@ -845,32 +767,68 @@ static int verify_node_IJmp(ir_node *n, ir_graph *irg)
 /**
  * verify a Cond node
  */
-static int verify_node_Cond(ir_node *n, ir_graph *irg)
+static int verify_node_Cond(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
-	(void) irg;
 
-	ASSERT_AND_RET(
-		/* Cond: BB x b --> X x X */
-		(op1mode == mode_b ||
-		/* Cond: BB x int --> X^n */
-		mode_is_int(op1mode) ),  "Cond node", 0
-		);
+	ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
 	ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
+	return 1;
+}
+
+static int verify_switch_table(const ir_node *n)
+{
+	const ir_switch_table *table     = get_Switch_table(n);
+	unsigned               n_outs    = get_Switch_n_outs(n);
+	ir_node               *selector  = get_Switch_selector(n);
+	ir_mode               *mode      = get_irn_mode(selector);
+	size_t                 n_entries;
+	size_t                 e;
+
+	ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
+
+	n_entries = ir_switch_table_get_n_entries(table);
+	for (e = 0; e < n_entries; ++e) {
+		const ir_switch_table_entry *entry
+			= ir_switch_table_get_entry_const(table, e);
+		if (entry->pn == 0)
+			continue;
+		ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
+		               "switch table entry without min+max value", 0);
+		ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
+		               get_tarval_mode(entry->max) == mode,
+		               "switch table entry with wrong modes", 0);
+		ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
+		               "switch table entry without min+max value", 0);
+		ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
+					   "switch table entry with invalid proj number", 0);
+	}
+	return 1;
+}
+
+static int verify_node_Switch(const ir_node *n)
+{
+	ir_mode *mymode  = get_irn_mode(n);
+	ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
+	if (!verify_switch_table(n))
+		return 0;
 
+	ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
+	ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
 	return 1;
 }
 
 /**
  * verify a Return node
  */
-static int verify_node_Return(ir_node *n, ir_graph *irg)
+static int verify_node_Return(const ir_node *n)
 {
-	int i;
-	ir_mode *mymode   = get_irn_mode(n);
-	ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
-	ir_type *mt;
+	ir_graph *irg      = get_irn_irg(n);
+	ir_mode  *mymode   = get_irn_mode(n);
+	ir_mode  *mem_mode = get_irn_mode(get_Return_mem(n));
+	ir_type  *mt;
+	int       i;
 
 	/* Return: BB x M x data1 x ... x datan --> X */
 
@@ -882,13 +840,13 @@ static int verify_node_Return(ir_node *n, ir_graph *irg)
 	ASSERT_AND_RET( mymode == mode_X, "Result X", 0 );   /* result X */
 	/* Compare returned results with result types of method type */
 	mt = get_entity_type(get_irg_entity(irg));
-	ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
+	ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
 		"Number of results for Return doesn't match number of results in type.", 0,
 		show_return_nres(irg, n, mt););
 	for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
 		ir_type *res_type = get_method_res_type(mt, i);
 
-		if (get_irg_phase_state(irg) != phase_backend) {
+		if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 			if (is_atomic_type(res_type)) {
 				ASSERT_AND_RET_DBG(
 					get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
@@ -910,12 +868,11 @@ static int verify_node_Return(ir_node *n, ir_graph *irg)
 /**
  * verify a Raise node
  */
-static int verify_node_Raise(ir_node *n, ir_graph *irg)
+static int verify_node_Raise(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* Sel: BB x M x ref --> X x M */
@@ -928,10 +885,9 @@ static int verify_node_Raise(ir_node *n, ir_graph *irg)
 /**
  * verify a Const node
  */
-static int verify_node_Const(ir_node *n, ir_graph *irg)
+static int verify_node_Const(const ir_node *n)
 {
 	ir_mode *mymode = get_irn_mode(n);
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* Const: BB --> data */
@@ -950,10 +906,9 @@ static int verify_node_Const(ir_node *n, ir_graph *irg)
 /**
  * verify a SymConst node
  */
-static int verify_node_SymConst(ir_node *n, ir_graph *irg)
+static int verify_node_SymConst(const ir_node *n)
 {
 	ir_mode *mymode = get_irn_mode(n);
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* SymConst: BB --> int*/
@@ -961,43 +916,51 @@ static int verify_node_SymConst(ir_node *n, ir_graph *irg)
 		/* SymConst: BB --> ref */
 		mode_is_reference(mymode))
 		,"SymConst node", 0);
+	if (SYMCONST_HAS_ENT(get_SymConst_kind(n))) {
+		ir_entity *ent = get_SymConst_entity(n);
+		/* the is_method_entity(ent) exception is for nested functions... */
+		ASSERT_AND_RET_DBG((get_entity_owner(ent)->flags & tf_segment)
+		                   || is_method_entity(ent),
+		                   "SymConst node with non-segment entity", 0,
+		                   show_node_failure(n););
+	}
 	return 1;
 }
 
 /**
  * verify a Sel node
  */
-static int verify_node_Sel(ir_node *n, ir_graph *irg)
+static int verify_node_Sel(const ir_node *n)
 {
 	int i;
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
 	ir_entity *ent;
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Sel: BB x M x ref x int^n --> ref */
 		(op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
-		"Sel node", 0, show_node_failure(n)
+		"Sel node", 0, show_node_failure(n);
 	);
 
 	for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
-		ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
+		ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
 	}
 	ent = get_Sel_entity(n);
-	ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
+	ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
+	ASSERT_AND_RET_DBG(!(get_entity_owner(ent)->flags & tf_segment),
+	                   "Sel node with global entity", 0, show_node_failure(n););
 	return 1;
 }
 
 /**
  * verify an InstOf node
  */
-static int verify_node_InstOf(ir_node *n, ir_graph *irg)
+static int verify_node_InstOf(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
-	(void) irg;
 
 	ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
 	ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
@@ -1007,7 +970,7 @@ static int verify_node_InstOf(ir_node *n, ir_graph *irg)
 /**
  * Check if the pinned state is right.
  */
-static int verify_right_pinned(ir_node *n)
+static int verify_right_pinned(const ir_node *n)
 {
 	ir_node *mem;
 
@@ -1024,15 +987,15 @@ static int verify_right_pinned(ir_node *n)
 /**
  * verify a Call node
  */
-static int verify_node_Call(ir_node *n, ir_graph *irg)
+static int verify_node_Call(const ir_node *n)
 {
-	ir_mode *mymode  = get_irn_mode(n);
-	ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
-	ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
-	ir_type *mt;
-	size_t i;
-	size_t n_params;
-	(void) irg;
+	ir_graph *irg     = get_irn_irg(n);
+	ir_mode  *mymode  = get_irn_mode(n);
+	ir_mode  *op1mode = get_irn_mode(get_Call_mem(n));
+	ir_mode  *op2mode = get_irn_mode(get_Call_ptr(n));
+	ir_type  *mt;
+	size_t    i;
+	size_t    n_params;
 
 	/* Call: BB x M x ref x data1 x ... x datan
 	--> M x datan+1 x ... x data n+m */
@@ -1056,7 +1019,7 @@ static int verify_node_Call(ir_node *n, ir_graph *irg)
 
 	if (get_method_variadicity(mt) == variadicity_variadic) {
 		ASSERT_AND_RET_DBG(
-			get_Call_n_params(n) >= get_method_n_params(mt),
+			(size_t)get_Call_n_params(n) >= get_method_n_params(mt),
 			"Number of args for Call doesn't match number of args in variadic type.",
 			0,
 			ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
@@ -1064,7 +1027,7 @@ static int verify_node_Call(ir_node *n, ir_graph *irg)
 		);
 	} else {
 		ASSERT_AND_RET_DBG(
-			get_Call_n_params(n) == get_method_n_params(mt),
+			(size_t)get_Call_n_params(n) == get_method_n_params(mt),
 			"Number of args for Call doesn't match number of args in non variadic type.",
 			0,
 			ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
@@ -1075,7 +1038,7 @@ static int verify_node_Call(ir_node *n, ir_graph *irg)
 	for (i = 0; i < get_method_n_params(mt); i++) {
 		ir_type *t = get_method_param_type(mt, i);
 
-		if (get_irg_phase_state(irg) != phase_backend) {
+		if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 			if (is_atomic_type(t)) {
 				ASSERT_AND_RET_DBG(
 					get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
@@ -1093,25 +1056,17 @@ static int verify_node_Call(ir_node *n, ir_graph *irg)
 		}
 	}
 
-#if 0
-	if (Call_has_callees(n)) {
-		for (i = 0; i < get_Call_n_callees(n); i++) {
-			ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
-		}
-	}
-#endif
 	return 1;
 }
 
 /**
  * verify an Add node
  */
-static int verify_node_Add(ir_node *n, ir_graph *irg)
+static int verify_node_Add(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Add_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Add_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -1133,12 +1088,11 @@ static int verify_node_Add(ir_node *n, ir_graph *irg)
 /**
  * verify a Sub node
  */
-static int verify_node_Sub(ir_node *n, ir_graph *irg)
+static int verify_node_Sub(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -1160,11 +1114,10 @@ static int verify_node_Sub(ir_node *n, ir_graph *irg)
 /**
  * verify a Minus node
  */
-static int verify_node_Minus(ir_node *n, ir_graph *irg)
+static int verify_node_Minus(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Minus: BB x num --> num */
@@ -1177,12 +1130,11 @@ static int verify_node_Minus(ir_node *n, ir_graph *irg)
 /**
  * verify a Mul node
  */
-static int verify_node_Mul(ir_node *n, ir_graph *irg)
+static int verify_node_Mul(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -1202,12 +1154,11 @@ static int verify_node_Mul(ir_node *n, ir_graph *irg)
 /**
  * verify a Mulh node
  */
-static int verify_node_Mulh(ir_node *n, ir_graph *irg)
+static int verify_node_Mulh(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		(
@@ -1223,19 +1174,20 @@ static int verify_node_Mulh(ir_node *n, ir_graph *irg)
 /**
  * verify a Div node
  */
-static int verify_node_Div(ir_node *n, ir_graph *irg)
+static int verify_node_Div(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Div_left(n));
 	ir_mode *op3mode = get_irn_mode(get_Div_right(n));
-	(void) irg;
+	ir_mode *resmode = get_Div_resmode(n);
 
 	ASSERT_AND_RET(
-		/* Div: BB x M x data x data --> M x X x data */
-		op1mode == mode_M &&
-		op2mode == op3mode &&
-		mode_is_data(op2mode) &&
+		/* Div: BB x M x num x num --> M x X x num */
+		op1mode == mode_M    &&
+		op2mode == resmode   &&
+		op3mode == resmode   &&
+		mode_is_num(resmode) &&
 		mymode == mode_T,
 		"Div node", 0
 		);
@@ -1245,19 +1197,20 @@ static int verify_node_Div(ir_node *n, ir_graph *irg)
 /**
  * verify a Mod node
  */
-static int verify_node_Mod(ir_node *n, ir_graph *irg)
+static int verify_node_Mod(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
 	ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
-	(void) irg;
+	ir_mode *resmode = get_Mod_resmode(n);
 
 	ASSERT_AND_RET(
 		/* Mod: BB x M x int x int --> M x X x int */
-		op1mode == mode_M &&
-		op2mode == op3mode &&
-		mode_is_int(op2mode) &&
+		op1mode == mode_M    &&
+		op2mode == resmode   &&
+		op3mode == resmode   &&
+		mode_is_int(resmode) &&
 		mymode == mode_T,
 		"Mod node", 0
 		);
@@ -1267,12 +1220,11 @@ static int verify_node_Mod(ir_node *n, ir_graph *irg)
 /**
  * verify a logical And, Or, Eor node
  */
-static int verify_node_Logic(ir_node *n, ir_graph *irg)
+static int verify_node_Logic(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_binop_left(n));
 	ir_mode *op2mode = get_irn_mode(get_binop_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* And or Or or Eor: BB x int x int --> int */
@@ -1285,18 +1237,28 @@ static int verify_node_Logic(ir_node *n, ir_graph *irg)
 	return 1;
 }
 
-#define verify_node_And   verify_node_Logic
-#define verify_node_Or    verify_node_Logic
-#define verify_node_Eor   verify_node_Logic
+static int verify_node_And(const ir_node *n)
+{
+	return verify_node_Logic(n);
+}
+
+static int verify_node_Or(const ir_node *n)
+{
+	return verify_node_Logic(n);
+}
+
+static int verify_node_Eor(const ir_node *n)
+{
+	return verify_node_Logic(n);
+}
 
 /**
  * verify a Not node
  */
-static int verify_node_Not(ir_node *n, ir_graph *irg)
+static int verify_node_Not(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Not_op(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Not: BB x int --> int */
@@ -1311,12 +1273,11 @@ static int verify_node_Not(ir_node *n, ir_graph *irg)
 /**
  * verify a Cmp node
  */
-static int verify_node_Cmp(ir_node *n, ir_graph *irg)
+static int verify_node_Cmp(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Cmp: BB x datab x datab --> b16 */
@@ -1332,12 +1293,11 @@ static int verify_node_Cmp(ir_node *n, ir_graph *irg)
 /**
  * verify a Shift node
  */
-static int verify_node_Shift(ir_node *n, ir_graph *irg)
+static int verify_node_Shift(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_binop_left(n));
 	ir_mode *op2mode = get_irn_mode(get_binop_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Shl, Shr or Shrs: BB x int x int_u --> int */
@@ -1351,19 +1311,29 @@ static int verify_node_Shift(ir_node *n, ir_graph *irg)
 	return 1;
 }
 
-#define verify_node_Shl   verify_node_Shift
-#define verify_node_Shr   verify_node_Shift
-#define verify_node_Shrs  verify_node_Shift
+static int verify_node_Shl(const ir_node *n)
+{
+	return verify_node_Shift(n);
+}
+
+static int verify_node_Shr(const ir_node *n)
+{
+	return verify_node_Shift(n);
+}
+
+static int verify_node_Shrs(const ir_node *n)
+{
+	return verify_node_Shift(n);
+}
 
 /**
  * verify a Rotl node
  */
-static int verify_node_Rotl(ir_node *n, ir_graph *irg)
+static int verify_node_Rotl(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
 	ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Rotl: BB x int x int --> int */
@@ -1379,35 +1349,14 @@ static int verify_node_Rotl(ir_node *n, ir_graph *irg)
 /**
  * verify a Conv node
  */
-static int verify_node_Conv(ir_node *n, ir_graph *irg)
+static int verify_node_Conv(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
-	(void) irg;
 
-	ASSERT_AND_RET_DBG(
-		is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
-		(mode_is_datab(op1mode) && mode_is_data(mymode)),
+	ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
 		"Conv node", 0,
-		show_unop_failure(n, "/* Conv: BB x datab --> data */");
-	);
-	return 1;
-}
-
-/**
- * verify a Cast node
- */
-static int verify_node_Cast(ir_node *n, ir_graph *irg)
-{
-	ir_mode *mymode  = get_irn_mode(n);
-	ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
-	(void) irg;
-
-	ASSERT_AND_RET_DBG(
-		/* Conv: BB x datab1 --> datab2 */
-		mode_is_data(op1mode) && op1mode == mymode,
-		"Cast node", 0,
-		show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
+		show_unop_failure(n, "/* Conv: BB x data --> data */");
 	);
 	return 1;
 }
@@ -1415,17 +1364,18 @@ static int verify_node_Cast(ir_node *n, ir_graph *irg)
 /**
  * verify a Phi node
  */
-static int verify_node_Phi(ir_node *n, ir_graph *irg)
+static int verify_node_Phi(const ir_node *n)
 {
 	ir_mode *mymode = get_irn_mode(n);
 	ir_node *block  = get_nodes_block(n);
 	int i;
-	(void) irg;
 
 	/* a Phi node MUST have the same number of inputs as its block
 	 * Exception is a phi with 0 inputs which is used when (re)constructing the
 	 * SSA form */
-	if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
+	if (! is_Bad(block)
+	    && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
+	    && get_irn_arity(n) > 0) {
 		ASSERT_AND_RET_DBG(
 			get_irn_arity(n) == get_irn_arity(block),
 			"wrong number of inputs in Phi node", 0,
@@ -1436,83 +1386,40 @@ static int verify_node_Phi(ir_node *n, ir_graph *irg)
 	/* Phi: BB x dataM^n --> dataM */
 	for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
 		ir_node *pred = get_Phi_pred(n, i);
-		if (!is_Bad(pred)) {
-			ASSERT_AND_RET_DBG(
-				get_irn_mode(pred) == mymode,
-				"Phi node", 0,
-				show_phi_failure(n, pred, i);
-			);
-		}
+		ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
+		                   "Phi node", 0, show_phi_failure(n, pred, i);
+		);
 	}
 	ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
 
-	if (mymode == mode_M) {
-		for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
-			int j;
-			ir_node *pred_i = get_Phi_pred(n, i);
-
-			if (is_Bad(pred_i))
-				continue;
-			for (j = i - 1; j >= 0; --j) {
-				ir_node *pred_j = get_Phi_pred(n, j);
-
-				if (is_Bad(pred_j))
-					continue;
-#if 0
-				/* currently this checks fails for blocks with exception
-				   outputs (and these are NOT basic blocks).  So it is disabled yet. */
-				ASSERT_AND_RET_DBG(
-					(pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
-					"At least two different PhiM predecessors are in the same block",
-					0,
-					ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
-				);
-#endif
-			}
-		}
-	}
 	return 1;
 }
 
 /**
  * verify a Load node
  */
-static int verify_node_Load(ir_node *n, ir_graph *irg)
+static int verify_node_Load(const ir_node *n)
 {
-	ir_mode *mymode  = get_irn_mode(n);
-	ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
-	ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
+	ir_graph *irg     = get_irn_irg(n);
+	ir_mode  *mymode  = get_irn_mode(n);
+	ir_mode  *op1mode = get_irn_mode(get_Load_mem(n));
+	ir_mode  *op2mode = get_irn_mode(get_Load_ptr(n));
 
 	ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
-	if (get_irg_phase_state(irg) != phase_backend) {
+	if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 		ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
 	}
 	ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
 
-	/*
-	 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
-	 * (Proj (Proj))) sometimes ...
-
-	 * interprete.c:ai_eval seems to assume that this happens, too
-
-	 * obset.c:get_abstval_any can't deal with this if the load has
-	 * mode_T
-	 *
-	  {
-	  ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
-	  assert ((NULL != ent) || (mymode != mode_T));
-	  }
-	 */
-
 	return 1;
 }
 
 /**
  * verify a Store node
  */
-static int verify_node_Store(ir_node *n, ir_graph *irg)
+static int verify_node_Store(const ir_node *n)
 {
-	ir_entity *target;
+	ir_graph  *irg = get_irn_irg(n);
 
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
@@ -1520,34 +1427,22 @@ static int verify_node_Store(ir_node *n, ir_graph *irg)
 	ir_mode *op3mode = get_irn_mode(get_Store_value(n));
 
 	ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
-	if (get_irg_phase_state(irg) != phase_backend) {
+	if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 		ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
 	}
 	ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
 
-	target = get_ptr_entity(get_Store_ptr(n));
-	if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
-		/*
-		 * If lowered code, any Sels that add 0 may be removed, causing
-		 * an direct access to entities of array or compound type.
-		 * Prevent this by checking the phase.
-		 */
-		ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
-			"Store node", 0);
-	}
-
 	return 1;
 }
 
 /**
  * verify an Alloc node
  */
-static int verify_node_Alloc(ir_node *n, ir_graph *irg)
+static int verify_node_Alloc(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Alloc: BB x M x int_u --> M x X x ref */
@@ -1564,13 +1459,12 @@ static int verify_node_Alloc(ir_node *n, ir_graph *irg)
 /**
  * verify a Free node
  */
-static int verify_node_Free(ir_node *n, ir_graph *irg)
+static int verify_node_Free(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
 	ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
-	ir_mode *op3mode = get_irn_mode(get_Free_size(n));
-	(void) irg;
+	ir_mode *op3mode = get_irn_mode(get_Free_count(n));
 
 	ASSERT_AND_RET_DBG(
 		/* Free: BB x M x ref x int_u --> M */
@@ -1587,16 +1481,15 @@ static int verify_node_Free(ir_node *n, ir_graph *irg)
 /**
  * verify a Sync node
  */
-static int verify_node_Sync(ir_node *n, ir_graph *irg)
+static int verify_node_Sync(const ir_node *n)
 {
 	int i;
 	ir_mode *mymode  = get_irn_mode(n);
-	(void) irg;
 
 	/* Sync: BB x M^n --> M */
 	for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
 		ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
-	};
+	}
 	ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
 	return 1;
 }
@@ -1604,12 +1497,11 @@ static int verify_node_Sync(ir_node *n, ir_graph *irg)
 /**
  * verify a Confirm node
  */
-static int verify_node_Confirm(ir_node *n, ir_graph *irg)
+static int verify_node_Confirm(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
 	ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
-	(void) irg;
 
 	ASSERT_AND_RET_DBG(
 		/* Confirm: BB x T x T --> T */
@@ -1624,13 +1516,12 @@ static int verify_node_Confirm(ir_node *n, ir_graph *irg)
 /**
  * verify a Mux node
  */
-static int verify_node_Mux(ir_node *n, ir_graph *irg)
+static int verify_node_Mux(const ir_node *n)
 {
 	ir_mode *mymode  = get_irn_mode(n);
 	ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
 	ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
 	ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
-	(void) irg;
 
 	ASSERT_AND_RET(
 		/* Mux: BB x b x datab x datab --> datab */
@@ -1646,17 +1537,18 @@ static int verify_node_Mux(ir_node *n, ir_graph *irg)
 /**
  * verify a CopyB node
  */
-static int verify_node_CopyB(ir_node *n, ir_graph *irg)
+static int verify_node_CopyB(const ir_node *n)
 {
-	ir_mode *mymode  = get_irn_mode(n);
-	ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
-	ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
-	ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
-	ir_type *t = get_CopyB_type(n);
+	ir_graph *irg     = get_irn_irg(n);
+	ir_mode  *mymode  = get_irn_mode(n);
+	ir_mode  *op1mode = get_irn_mode(get_CopyB_mem(n));
+	ir_mode  *op2mode = get_irn_mode(get_CopyB_dst(n));
+	ir_mode  *op3mode = get_irn_mode(get_CopyB_src(n));
+	ir_type  *t = get_CopyB_type(n);
 
 	/* CopyB: BB x M x ref x ref --> M x X */
 	ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
-	if (get_irg_phase_state(irg) != phase_backend) {
+	if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
 		ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
 			"CopyB node", 0 );
 	}
@@ -1671,29 +1563,6 @@ static int verify_node_CopyB(ir_node *n, ir_graph *irg)
 	return 1;
 }
 
-/**
- * verify a Bound node
- */
-static int verify_node_Bound(ir_node *n, ir_graph *irg)
-{
-	ir_mode *mymode  = get_irn_mode(n);
-	ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
-	ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
-	ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
-	ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
-	(void) irg;
-
-	/* Bound: BB x M x int x int x int --> M x X */
-	ASSERT_AND_RET(
-		mymode == mode_T &&
-		op1mode == mode_M &&
-		op2mode == op3mode &&
-		op3mode == op4mode &&
-		mode_is_int(op3mode),
-		"Bound node", 0 );
-	return 1;
-}
-
 /**
  * Check dominance.
  * For each usage of a node, it is checked, if the block of the
@@ -1702,7 +1571,7 @@ static int verify_node_Bound(ir_node *n, ir_graph *irg)
  *
  * @return non-zero on success, 0 on dominance error
  */
-static int check_dominance_for_node(ir_node *use)
+static int check_dominance_for_node(const ir_node *use)
 {
 	/* This won't work for blocks and the end node */
 	if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
@@ -1710,20 +1579,23 @@ static int check_dominance_for_node(ir_node *use)
 		ir_node *bl = get_nodes_block(use);
 
 		for (i = get_irn_arity(use) - 1; i >= 0; --i) {
-			ir_node *def    = get_irn_n(use, i);
-			ir_node *def_bl = get_nodes_block(def);
-			ir_node *use_bl = bl;
+			ir_node  *def    = get_irn_n(use, i);
+			ir_node  *def_bl = get_nodes_block(def);
+			ir_node  *use_bl = bl;
 			ir_graph *irg;
 
-			/* ignore dead definition blocks, will be removed */
-			if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
+			/* we have no dominance relation for unreachable blocks, so we can't
+			 * check the dominance property there */
+			if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
 				continue;
 
-			if (is_Phi(use))
+			if (is_Phi(use)) {
+				if (is_Bad(def))
+					continue;
 				use_bl = get_Block_cfgpred_block(bl, i);
+			}
 
-			/* ignore dead use blocks, will be removed */
-			if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
+			if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
 				continue;
 
 			irg = get_irn_irg(use);
@@ -1740,10 +1612,8 @@ static int check_dominance_for_node(ir_node *use)
 	return 1;
 }
 
-/* Tests the modes of n and its predecessors. */
-int irn_verify_irg(ir_node *n, ir_graph *irg)
+int irn_verify_irg(const ir_node *n, ir_graph *irg)
 {
-	int i;
 	ir_op *op;
 
 	if (!get_node_verification_mode())
@@ -1769,37 +1639,42 @@ int irn_verify_irg(ir_node *n, ir_graph *irg)
 		unsigned idx           = get_irn_idx(n);
 		ir_node *node_from_map = get_idx_irn(irg, idx);
 		ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
-			ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
+			ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
+		);
 	}
 
 	op = get_irn_op(n);
 
-	/* We don't want to test nodes whose predecessors are Bad,
-	   as we would have to special case that for each operation. */
-	if (op != op_Phi && op != op_Block) {
-		for (i = get_irn_arity(n) - 1; i >= 0; --i) {
-			if (is_Bad(get_irn_n(n, i)))
-				return 1;
-		}
-	}
-
-	if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
+	if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
 		op_pin_state state = get_irn_pinned(n);
 		ASSERT_AND_RET_DBG(
 			state == op_pin_state_floats ||
 			state == op_pin_state_pinned,
 			"invalid pin state", 0,
-			ir_printf("node %+F", n));
+			ir_printf("node %+F", n);
+		);
+	} else if (!is_Block(n) && is_irn_pinned_in_irg(n)
+	           && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
+		ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
+				"block input is not a block", 0,
+				ir_printf("node %+F", n);
+		);
 	}
 
+	ASSERT_AND_RET_DBG(
+		!is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
+		"node should be in start block", 0,
+		ir_printf("node %+F", n);
+	);
+
 	if (op->ops.verify_node)
-		return op->ops.verify_node(n, irg);
+		return op->ops.verify_node(n);
 
 	/* All went ok */
 	return 1;
 }
 
-int irn_verify(ir_node *n)
+int irn_verify(const ir_node *n)
 {
 #ifdef DEBUG_libfirm
 	return irn_verify_irg(n, get_irn_irg(n));
@@ -1839,30 +1714,200 @@ static void verify_wrap_ssa(ir_node *node, void *env)
 
 #endif /* DEBUG_libfirm */
 
-/*
- * Calls irn_verify for each node in irg.
- * Graph must be in state "op_pin_state_pinned".
- * If dominance info is available, check the SSA property.
+typedef struct check_cfg_env_t {
+	pmap *branch_nodes; /**< map blocks to their branching nodes,
+	                         map mode_X nodes to the blocks they branch to */
+	int   res;
+	ir_nodeset_t reachable_blocks;
+	ir_nodeset_t kept_nodes;
+	ir_nodeset_t true_projs;
+	ir_nodeset_t false_projs;
+} check_cfg_env_t;
+
+static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
+{
+	pmap *branch_nodes;
+	int   n_cfgpreds;
+	int   i;
+
+	ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
+	                   "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
+	                   ir_printf("block %+F\n", block);
+	);
+
+	n_cfgpreds   = get_Block_n_cfgpreds(block);
+	branch_nodes = env->branch_nodes;
+	for (i = 0; i < n_cfgpreds; ++i) {
+		/* check that each mode_X node is only connected
+		 * to 1 user */
+		ir_node *branch = get_Block_cfgpred(block, i);
+		ir_node *former_dest;
+		ir_node *former_branch;
+		ir_node *branch_proj;
+		ir_node *branch_block;
+		branch = skip_Tuple(branch);
+		if (is_Bad(branch))
+			continue;
+		former_dest = pmap_get(ir_node, branch_nodes, branch);
+		ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
+						   "Multiple users on mode_X node", 0,
+						   ir_printf("node %+F\n", branch);
+		);
+		pmap_insert(branch_nodes, branch, (void*)block);
+
+		/* check that there's only 1 branching instruction in each block */
+		branch_block = get_nodes_block(branch);
+		branch_proj  = branch;
+		if (is_Proj(branch)) {
+			branch = skip_Proj(branch);
+		}
+		former_branch = pmap_get(ir_node, branch_nodes, branch_block);
+
+		ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
+						   "Multiple branching nodes in a block", 0,
+						   ir_printf("nodes %+F,%+F in block %+F\n",
+									 branch, former_branch, branch_block);
+		);
+		pmap_insert(branch_nodes, branch_block, branch);
+
+		if (is_Cond(branch)) {
+			long pn = get_Proj_proj(branch_proj);
+			if (pn == pn_Cond_true)
+				ir_nodeset_insert(&env->true_projs, branch);
+			if (pn == pn_Cond_false)
+				ir_nodeset_insert(&env->false_projs, branch);
+		} else if (is_Switch(branch)) {
+			long pn = get_Proj_proj(branch_proj);
+			if (pn == pn_Switch_default)
+				ir_nodeset_insert(&env->true_projs, branch);
+		}
+	}
+
+	return 1;
+}
+
+static void check_cfg_walk_func(ir_node *node, void *data)
+{
+	check_cfg_env_t *env = (check_cfg_env_t*)data;
+	if (!is_Block(node))
+		return;
+	env->res &= check_block_cfg(node, env);
+}
+
+static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
+{
+	ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
+	ASSERT_AND_RET_DBG(branch != NULL
+	                   || ir_nodeset_contains(&env->kept_nodes, block)
+	                   || block == get_irg_end_block(get_irn_irg(block)),
+	                   "block contains no cfop", 0,
+	                   ir_printf("block %+F\n", block);
+	);
+	return 1;
+}
+
+static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
+{
+	ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
+					   "Cond node lacks true proj", 0,
+					   ir_printf("Cond %+F\n", cond);
+	);
+	ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
+					   "Cond node lacks false proj", 0,
+					   ir_printf("Cond %+F\n", cond);
+	);
+	return 1;
+}
+
+static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
+{
+	ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
+					   "Switch node lacks default Proj", 0,
+					   ir_printf("Switch %+F\n", sw);
+	);
+	return 1;
+}
+
+static void assert_branch(ir_node *node, void *data)
+{
+	check_cfg_env_t *env = (check_cfg_env_t*)data;
+	if (is_Block(node)) {
+		env->res &= verify_block_branch(node, env);
+	} else if (is_Cond(node)) {
+		env->res &= verify_cond_projs(node, env);
+	} else if (is_Switch(node)) {
+		env->res &= verify_switch_projs(node, env);
+	}
+}
+
+static void collect_reachable_blocks(ir_node *block, void *data)
+{
+	ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
+	ir_nodeset_insert(reachable_blocks, block);
+}
+
+/**
+ * Checks CFG well-formedness
  */
+static int check_cfg(ir_graph *irg)
+{
+	check_cfg_env_t env;
+	env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
+	env.res          = 1;
+	ir_nodeset_init(&env.reachable_blocks);
+	ir_nodeset_init(&env.true_projs);
+	ir_nodeset_init(&env.false_projs);
+
+	irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
+	                     &env.reachable_blocks);
+
+	/* note that we do not use irg_walk_block because it will miss these
+	 * invalid blocks without a jump instruction which we want to detect
+	 * here */
+	irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
+
+	ir_nodeset_init(&env.kept_nodes);
+	{
+		ir_node *end   = get_irg_end(irg);
+		int      arity = get_irn_arity(end);
+		int      i;
+		for (i = 0; i < arity; ++i) {
+			ir_node *n = get_irn_n(end, i);
+			ir_nodeset_insert(&env.kept_nodes, n);
+		}
+	}
+	irg_walk_graph(irg, assert_branch, NULL, &env);
+
+	ir_nodeset_destroy(&env.false_projs);
+	ir_nodeset_destroy(&env.true_projs);
+	ir_nodeset_destroy(&env.kept_nodes);
+	ir_nodeset_destroy(&env.reachable_blocks);
+	pmap_destroy(env.branch_nodes);
+	return env.res;
+}
+
 int irg_verify(ir_graph *irg, unsigned flags)
 {
 	int res = 1;
 #ifdef DEBUG_libfirm
+	int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
 
 #ifndef NDEBUG
-    last_irg_error = NULL;
+	last_irg_error = NULL;
 #endif /* NDEBUG */
 
-	assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
+	if (pinned && !check_cfg(irg))
+		res = 0;
 
-	if (flags & VERIFY_ENFORCE_SSA)
+	if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
 		compute_doms(irg);
 
 	irg_walk_anchors(
 		irg,
-		get_irg_dom_state(irg) == dom_consistent &&
-		get_irg_pinned(irg) == op_pin_state_pinned ? verify_wrap_ssa : verify_wrap,
-		NULL, &res
+		pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
+			? verify_wrap_ssa : verify_wrap,
+		NULL,
+		&res
 	);
 
 	if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
@@ -1898,7 +1943,6 @@ static int irg_verify_wrapper(ir_graph *irg, void *context)
 	return 0;
 }
 
-/* Creates an ir_graph pass for irg_verify(). */
 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
 {
 	pass_t *pass = XMALLOCZ(pass_t);
@@ -1914,8 +1958,8 @@ ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
 	return &pass->pass;
 }
 
-/* create a verify pass */
-int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
+int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
+                        const char **bad_string)
 {
 	int res;
 	firm_verification_t old = get_node_verification_mode();
@@ -1923,7 +1967,7 @@ int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
 	firm_verify_failure_msg = NULL;
 	do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
 	res = irn_verify_irg(n, irg);
-	if (res && get_irg_dom_state(irg) == dom_consistent &&
+	if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
 	    get_irg_pinned(irg) == op_pin_state_pinned)
 		res = check_dominance_for_node(n);
 	do_node_verification(old);
@@ -1960,7 +2004,7 @@ static void check_bads(ir_node *node, void *env)
 						fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
 					}
 					if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
-						dump_ir_graph(irg, "-assert");
+						dump_ir_graph(irg, "assert");
 						assert(0 && "Bad CF detected");
 					}
 				}
@@ -1977,7 +2021,7 @@ static void check_bads(ir_node *node, void *env)
 					fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
 				}
 				if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
-					dump_ir_graph(irg, "-assert");
+					dump_ir_graph(irg, "assert");
 					assert(0 && "Bad CF detected");
 				}
 			}
@@ -1991,7 +2035,7 @@ static void check_bads(ir_node *node, void *env)
 					fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
 				}
 				if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
-					dump_ir_graph(irg, "-assert");
+					dump_ir_graph(irg, "assert");
 					assert(0 && "Tuple detected");
 				}
 			}
@@ -2012,7 +2056,7 @@ static void check_bads(ir_node *node, void *env)
 							fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
 						}
 						if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
-							dump_ir_graph(irg, "-assert");
+							dump_ir_graph(irg, "assert");
 							assert(0 && "Bad CF detected");
 						}
 					}
@@ -2026,7 +2070,7 @@ static void check_bads(ir_node *node, void *env)
 						fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
 					}
 					if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
-						dump_ir_graph(irg, "-assert");
+						dump_ir_graph(irg, "assert");
 						assert(0 && "Bad NON-CF detected");
 					}
 				}
@@ -2035,9 +2079,6 @@ static void check_bads(ir_node *node, void *env)
 	}
 }
 
-/*
- * verify occurrence of bad nodes
- */
 int irg_verify_bads(ir_graph *irg, int flags)
 {
 	verify_bad_env_t env;
@@ -2050,85 +2091,71 @@ int irg_verify_bads(ir_graph *irg, int flags)
 	return env.res;
 }
 
-/*
- * set the default verify operation
- */
-void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
-{
-#define CASE(a)                           \
-   case iro_##a:                          \
-     ops->verify_node  = verify_node_##a; \
-     break
-
-	switch (code) {
-	CASE(Proj);
-	CASE(Block);
-	CASE(Start);
-	CASE(Jmp);
-	CASE(IJmp);
-	CASE(Cond);
-	CASE(Return);
-	CASE(Raise);
-	CASE(Const);
-	CASE(SymConst);
-	CASE(Sel);
-	CASE(InstOf);
-	CASE(Call);
-	CASE(Add);
-	CASE(Sub);
-	CASE(Minus);
-	CASE(Mul);
-	CASE(Mulh);
-	CASE(Div);
-	CASE(Mod);
-	CASE(And);
-	CASE(Or);
-	CASE(Eor);
-	CASE(Not);
-	CASE(Cmp);
-	CASE(Shl);
-	CASE(Shr);
-	CASE(Shrs);
-	CASE(Rotl);
-	CASE(Conv);
-	CASE(Cast);
-	CASE(Phi);
-	CASE(Load);
-	CASE(Store);
-	CASE(Alloc);
-	CASE(Free);
-	CASE(Sync);
-	CASE(Confirm);
-	CASE(Mux);
-	CASE(CopyB);
-	CASE(Bound);
-	default:
-		/* leave NULL */;
-	}
-#undef CASE
-
-#define CASE(a)                          \
-   case iro_##a:                         \
-     ops->verify_proj_node  = verify_node_Proj_##a; \
-     break
-
-	switch (code) {
-	CASE(Start);
-	CASE(Cond);
-	CASE(Raise);
-	CASE(InstOf);
-	CASE(Call);
-	CASE(Div);
-	CASE(Mod);
-	CASE(Load);
-	CASE(Store);
-	CASE(Alloc);
-	CASE(Proj);
-	CASE(Tuple);
-	CASE(CopyB);
-	CASE(Bound);
-	default:
-		/* leave NULL */;
-	}
-#undef CASE
+static void register_verify_node_func(ir_op *op, verify_node_func func)
+{
+	op->ops.verify_node = func;
+}
+
+static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
+{
+	op->ops.verify_proj_node = func;
+}
+
+void ir_register_verify_node_ops(void)
+{
+	register_verify_node_func(op_Add,      verify_node_Add);
+	register_verify_node_func(op_Alloc,    verify_node_Alloc);
+	register_verify_node_func(op_And,      verify_node_And);
+	register_verify_node_func(op_Block,    verify_node_Block);
+	register_verify_node_func(op_Call,     verify_node_Call);
+	register_verify_node_func(op_Cmp,      verify_node_Cmp);
+	register_verify_node_func(op_Cond,     verify_node_Cond);
+	register_verify_node_func(op_Confirm,  verify_node_Confirm);
+	register_verify_node_func(op_Const,    verify_node_Const);
+	register_verify_node_func(op_Conv,     verify_node_Conv);
+	register_verify_node_func(op_CopyB,    verify_node_CopyB);
+	register_verify_node_func(op_Div,      verify_node_Div);
+	register_verify_node_func(op_Eor,      verify_node_Eor);
+	register_verify_node_func(op_Free,     verify_node_Free);
+	register_verify_node_func(op_IJmp,     verify_node_IJmp);
+	register_verify_node_func(op_InstOf,   verify_node_InstOf);
+	register_verify_node_func(op_Jmp,      verify_node_Jmp);
+	register_verify_node_func(op_Load,     verify_node_Load);
+	register_verify_node_func(op_Minus,    verify_node_Minus);
+	register_verify_node_func(op_Mod,      verify_node_Mod);
+	register_verify_node_func(op_Mul,      verify_node_Mul);
+	register_verify_node_func(op_Mulh,     verify_node_Mulh);
+	register_verify_node_func(op_Mux,      verify_node_Mux);
+	register_verify_node_func(op_Not,      verify_node_Not);
+	register_verify_node_func(op_Or,       verify_node_Or);
+	register_verify_node_func(op_Phi,      verify_node_Phi);
+	register_verify_node_func(op_Proj,     verify_node_Proj);
+	register_verify_node_func(op_Raise,    verify_node_Raise);
+	register_verify_node_func(op_Return,   verify_node_Return);
+	register_verify_node_func(op_Rotl,     verify_node_Rotl);
+	register_verify_node_func(op_Sel,      verify_node_Sel);
+	register_verify_node_func(op_Shl,      verify_node_Shl);
+	register_verify_node_func(op_Shr,      verify_node_Shr);
+	register_verify_node_func(op_Shrs,     verify_node_Shrs);
+	register_verify_node_func(op_Start,    verify_node_Start);
+	register_verify_node_func(op_Store,    verify_node_Store);
+	register_verify_node_func(op_Sub,      verify_node_Sub);
+	register_verify_node_func(op_Switch,   verify_node_Switch);
+	register_verify_node_func(op_SymConst, verify_node_SymConst);
+	register_verify_node_func(op_Sync,     verify_node_Sync);
+
+	register_verify_node_func_proj(op_Alloc,  verify_node_Proj_Alloc);
+	register_verify_node_func_proj(op_Call,   verify_node_Proj_Call);
+	register_verify_node_func_proj(op_Cond,   verify_node_Proj_Cond);
+	register_verify_node_func_proj(op_CopyB,  verify_node_Proj_CopyB);
+	register_verify_node_func_proj(op_Div,    verify_node_Proj_Div);
+	register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
+	register_verify_node_func_proj(op_Load,   verify_node_Proj_Load);
+	register_verify_node_func_proj(op_Mod,    verify_node_Proj_Mod);
+	register_verify_node_func_proj(op_Proj,   verify_node_Proj_Proj);
+	register_verify_node_func_proj(op_Raise,  verify_node_Proj_Raise);
+	register_verify_node_func_proj(op_Start,  verify_node_Proj_Start);
+	register_verify_node_func_proj(op_Store,  verify_node_Proj_Store);
+	register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
+	register_verify_node_func_proj(op_Tuple,  verify_node_Proj_Tuple);
 }