X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firvrfy.c;h=7e7ffd33c147a5f11952e4a9df4c0fc377142ac8;hb=b22c964ef444b645e15f23c60bf3a02d95f85a27;hp=0bfe01eba787b8cba46fc473bcb90dd878862f37;hpb=ad7dcd5e09ab2e082a395b7b26de2074b9be9320;p=libfirm diff --git a/ir/ir/irvrfy.c b/ir/ir/irvrfy.c index 0bfe01eba..7e7ffd33c 100644 --- a/ir/ir/irvrfy.c +++ b/ir/ir/irvrfy.c @@ -300,6 +300,7 @@ static int verify_node_Proj_Start(ir_node *n, ir_node *p) { (proj == pn_Start_M && mode == mode_M) || (proj == pn_Start_P_frame_base && mode_is_reference(mode)) || (proj == pn_Start_P_globals && mode_is_reference(mode)) || + (proj == pn_Start_P_tls && mode_is_reference(mode)) || (proj == pn_Start_T_args && mode == mode_T) || (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) || (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */ @@ -655,7 +656,8 @@ static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) { break; default: - ASSERT_AND_RET(0, "Unknown opcode", 0); + /* ASSERT_AND_RET(0, "Unknown opcode", 0); */ + break; } return 1; } @@ -701,8 +703,9 @@ static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) { long proj = get_Proj_proj(p); ASSERT_AND_RET_DBG( - ((proj == pn_CopyB_M && mode == mode_M) || - (proj == pn_CopyB_X_except && mode == mode_X)), + ((proj == pn_CopyB_M_regular && mode == mode_M) || + (proj == pn_CopyB_X_except && mode == mode_X) || + (proj == pn_CopyB_M_except && mode == mode_M)), "wrong Proj from CopyB", 0, show_proj_failure(p); ); @@ -775,7 +778,7 @@ static int verify_node_Block(ir_node *n, ir_graph *irg) { ir_node *pred = skip_Proj(get_Block_cfgpred(n, i)); if (is_Proj(pred) || get_irn_op(pred) == op_Tuple) break; /* We can not test properly. How many tuples are there? */ - ASSERT_AND_RET(((get_irn_op(pred) == op_Return) || + ASSERT_AND_RET((is_Return(pred) || is_Bad(pred) || (get_irn_op(pred) == op_Raise) || is_fragile_op(pred) ), @@ -1272,7 +1275,7 @@ static int verify_node_Logic(ir_node *n, ir_graph *irg) { ASSERT_AND_RET_DBG( /* And or Or or Eor: BB x int x int --> int */ - mode_is_int(mymode) && + (mode_is_int(mymode) || mymode == mode_b) && op2mode == op1mode && mymode == op2mode, "And, Or or Eor node", 0, @@ -1424,6 +1427,28 @@ static int verify_node_Phi(ir_node *n, ir_graph *irg) { ); } ASSERT_AND_RET( mode_is_dataM(mymode), "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; + 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)) + ); + } + } + } return 1; } @@ -1655,11 +1680,13 @@ static int verify_node_Bound(ir_node *n, ir_graph *irg) { return 1; } -/* +/** * Check dominance. * For each usage of a node, it is checked, if the block of the * node dominates the block of the usage (for phis: the predecessor * block of the phi for the corresponding edge). + * + * @return non-zero on success, 0 on dominance error */ static int check_dominance_for_node(ir_node *use) { @@ -1717,6 +1744,11 @@ int irn_vrfy_irg(ir_node *n, ir_graph *irg) show_node_on_graph(irg, n); ); assert(get_irn_irg(n) == 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, node_from_map, node_from_map)); + } } op = get_irn_op(n); @@ -1824,7 +1856,7 @@ int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) firm_vrfy_failure_msg = NULL; do_node_verification(FIRM_VERIFICATION_ERROR_ONLY); res = irn_vrfy_irg(n, irg); - if (! res && get_irg_dom_state(irg) == dom_consistent && + if (res && get_irg_dom_state(irg) == dom_consistent && get_irg_pinned(irg) == op_pin_state_pinned) res = check_dominance_for_node(n); do_node_verification(old);