3 * File name: ir/ir/irvrfy.c
4 * Purpose: Check irnodes for correctness.
5 * Author: Christian Schaefer
6 * Modified by: Goetz Lindenmaier. Till Riedel. Michael Beck.
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
19 # include "irgraph_t.h"
20 # include "ircgcons.h"
21 # include "irvrfy_t.h"
25 # include "irprintf.h"
28 /** if this flag is set, verify entity types in Load & Store nodes */
29 static int vrfy_entities = 0;
31 node_verification_t opt_do_node_verification = NODE_VERIFICATION_ON;
32 const char *firm_vrfy_failure_msg;
34 /* enable verification of Load/Store entities */
35 void vrfy_enable_entity_tests(int enable) {
36 vrfy_entities = enable;
40 * little helper for NULL modes
42 static const char *get_mode_name_ex(ir_mode *mode) {
45 return get_mode_name(mode);
48 void do_node_verification(node_verification_t mode) {
49 opt_do_node_verification = mode;
52 /** the last IRG, on which a verify error was found */
53 static ir_graph *last_irg_error = NULL;
56 * print the name of the entity of an verification failure
58 static void show_entity_failure(ir_node *node)
60 ir_graph *irg = get_irn_irg(node);
62 if (last_irg_error == irg)
67 if (irg == get_const_code_irg()) {
68 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
71 entity *ent = get_irg_entity(irg);
74 type *ent_type = get_entity_owner(ent);
77 if (ent_type == get_glob_type())
78 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
80 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
83 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
87 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
93 * Prints a failure for a Node
95 static void show_node_failure(ir_node *n)
97 show_entity_failure(n);
98 fprintf(stderr, " node %ld %s%s\n" ,
100 get_irn_opname(n), get_irn_modename(n)
105 * Prints a failure message for a binop
107 static void show_binop_failure(ir_node *n, const char *text)
109 ir_node *left = get_binop_left(n);
110 ir_node *right = get_binop_right(n);
112 show_entity_failure(n);
113 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
115 get_irn_opname(n), get_irn_modename(n),
116 get_irn_opname(left), get_irn_modename(left),
117 get_irn_opname(right), get_irn_modename(right),
122 * Prints a failure message for an unop
124 static void show_unop_failure(ir_node *n, const char *text)
126 ir_node *op = get_unop_op(n);
128 show_entity_failure(n);
129 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
131 get_irn_opname(n), get_irn_modename(n),
132 get_irn_opname(op), get_irn_modename(op),
137 * Prints a failure message for an op with 3 operands
139 static void show_triop_failure(ir_node *n, const char *text)
141 ir_node *op0 = get_irn_n(n, 0);
142 ir_node *op1 = get_irn_n(n, 1);
143 ir_node *op2 = get_irn_n(n, 2);
145 show_entity_failure(n);
146 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
148 get_irn_opname(n), get_irn_modename(n),
149 get_irn_opname(op0), get_irn_modename(op0),
150 get_irn_opname(op1), get_irn_modename(op1),
151 get_irn_opname(op2), get_irn_modename(op2),
156 * Prints a failure message for a proj
158 static void show_proj_failure(ir_node *n)
160 ir_node *op = get_Proj_pred(n);
161 int proj = get_Proj_proj(n);
163 show_entity_failure(n);
164 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
166 get_irn_opname(n), get_irn_modename(n), proj,
167 get_irn_opname(op), get_irn_modename(op));
171 * Prints a failure message for a proj from Start
173 static void show_proj_mode_failure(ir_node *n, type *ty)
175 long proj = get_Proj_proj(n);
176 ir_mode *m = get_type_mode(ty);
178 show_entity_failure(n);
179 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
184 get_mode_name_ex(m));
188 * Prints a failure message for a proj
190 static void show_proj_failure_ent(ir_node *n, entity *ent)
192 ir_node *op = get_Proj_pred(n);
193 int proj = get_Proj_proj(n);
194 ir_mode *m = get_type_mode(get_entity_type(ent));
196 show_entity_failure(n);
197 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
199 get_irn_opname(n), get_irn_modename(n), proj,
200 get_irn_opname(op), get_irn_modename(op),
201 get_entity_name(ent), get_type_name(get_entity_type(ent)),
202 get_mode_name_ex(m));
206 * Show a node and a graph
208 static void show_node_on_graph(ir_graph *irg, ir_node *n)
210 entity *ent = get_irg_entity(irg);
213 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of entity %s, node %ld %s%s\n",
214 get_entity_name(ent),
215 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
217 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of graph %p, node %ld %s%s\n",
219 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
225 static void show_call_param(ir_node *n, type *mt)
229 show_entity_failure(n);
230 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
231 for (i = 0; i < get_method_n_params(mt); ++i) {
232 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
234 fprintf(stderr, ") != CALL(");
236 for (i = 0; i < get_Call_n_params(n); ++i) {
237 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
239 fprintf(stderr, ")\n");
246 static void show_return_modes(ir_graph *irg, ir_node *n, type *mt, int i)
248 entity *ent = get_irg_entity(irg);
250 show_entity_failure(n);
251 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
252 get_irn_node_nr(n), get_entity_name(ent),
253 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
254 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
259 * Show return number of results
261 static void show_return_nres(ir_graph *irg, ir_node *n, type *mt)
263 entity *ent = get_irg_entity(irg);
265 show_entity_failure(n);
266 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
267 get_irn_node_nr(n), get_entity_name(ent),
268 get_Return_n_ress(n), get_method_n_ress(mt));
274 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
276 show_entity_failure(phi);
277 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
278 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
279 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
285 static void show_phi_inputs(ir_node *phi, ir_node *block)
287 show_entity_failure(phi);
288 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
289 get_irn_node_nr(phi), get_irn_arity(phi),
290 get_irn_node_nr(block), get_irn_arity(block));
293 /** If the address is Sel or SymConst, return the entity. */
294 static entity *get_ptr_entity(ir_node *ptr) {
295 if (get_irn_op(ptr) == op_Sel) {
296 return get_Sel_entity(ptr);
297 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
298 return get_SymConst_entity(ptr);
304 * verify a Proj(Start) node
306 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
307 ir_mode *mode = get_irn_mode(p);
308 long proj = get_Proj_proj(p);
312 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
313 (proj == pn_Start_M && mode == mode_M) ||
314 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
315 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
316 (proj == pn_Start_T_args && mode == mode_T) ||
317 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
318 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
320 "wrong Proj from Start", 0,
321 show_proj_failure(p);
327 * verify a Proj(Cond) node
329 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
330 ir_mode *mode = get_irn_mode(p);
331 long proj = get_Proj_proj(p);
335 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
336 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
337 is_Bad(get_Cond_selector(pred)) /* rare */
339 "wrong Proj from Cond", 0,
340 show_proj_failure(p);
346 * verify a Proj(Raise) node
348 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
349 ir_mode *mode = get_irn_mode(p);
350 long proj = get_Proj_proj(p);
353 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
354 "wrong Proj from Raise", 0,
355 show_proj_failure(p);
361 * verify a Proj(InstOf) node
363 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
364 ir_mode *mode = get_irn_mode(p);
365 long proj = get_Proj_proj(p);
368 (proj >= 0 && mode == mode_X),
369 "wrong Proj from InstOf", 0,
370 show_proj_failure(p);
376 * verify a Proj(Call) node
378 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
379 ir_mode *mode = get_irn_mode(p);
380 long proj = get_Proj_proj(p);
383 ((proj == pn_Call_M_regular && mode == mode_M) ||
384 (proj == pn_Call_X_except && mode == mode_X) ||
385 (proj == pn_Call_T_result && mode == mode_T) ||
386 (proj == pn_Call_M_except && mode == mode_M) ||
387 (proj == pn_Call_P_value_res_base && mode == mode_P)),
388 "wrong Proj from Call", 0,
389 show_proj_failure(p);
391 if (proj == pn_Call_X_except)
393 get_irn_op(get_Call_mem(n)) != op_NoMem,
394 "Exception Proj from FunctionCall", 0);
395 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
397 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
398 "Memory Proj from FunctionCall", 0);
403 * verify a Proj(Quot) node
405 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
406 ir_mode *mode = get_irn_mode(p);
407 long proj = get_Proj_proj(p);
410 ((proj == pn_Quot_M && mode == mode_M) ||
411 (proj == pn_Quot_X_except && mode == mode_X) ||
412 (proj == pn_Quot_res && mode_is_float(mode))),
413 "wrong Proj from Quot", 0,
414 show_proj_failure(p);
416 if (proj == pn_Quot_X_except)
418 get_irn_pinned(n) == op_pin_state_pinned,
419 "Exception Proj from unpinned Quot", 0);
420 else if (proj == pn_Quot_M)
422 get_irn_pinned(n) == op_pin_state_pinned,
423 "Memory Proj from unpinned Quot", 0);
428 * verify a Proj(DivMod) node
430 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
431 ir_mode *mode = get_irn_mode(p);
432 long proj = get_Proj_proj(p);
435 ((proj == pn_DivMod_M && mode == mode_M) ||
436 (proj == pn_DivMod_X_except && mode == mode_X) ||
437 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
438 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
439 "wrong Proj from DivMod", 0,
440 show_proj_failure(p);
442 if (proj == pn_DivMod_X_except)
444 get_irn_pinned(n) == op_pin_state_pinned,
445 "Exception Proj from unpinned DivMod", 0);
446 else if (proj == pn_DivMod_M)
448 get_irn_pinned(n) == op_pin_state_pinned,
449 "Memory Proj from unpinned DivMod", 0);
454 * verify a Proj(Div) node
456 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
457 ir_mode *mode = get_irn_mode(p);
458 long proj = get_Proj_proj(p);
461 ((proj == pn_Div_M && mode == mode_M) ||
462 (proj == pn_Div_X_except && mode == mode_X) ||
463 (proj == pn_Div_res && mode_is_int(mode))),
464 "wrong Proj from Div", 0,
465 show_proj_failure(p);
467 if (proj == pn_Div_X_except)
469 get_irn_pinned(n) == op_pin_state_pinned,
470 "Exception Proj from unpinned Div", 0);
471 else if (proj == pn_Div_M)
473 get_irn_pinned(n) == op_pin_state_pinned,
474 "Memory Proj from unpinned Div", 0);
479 * verify a Proj(Mod) node
481 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
482 ir_mode *mode = get_irn_mode(p);
483 long proj = get_Proj_proj(p);
486 ((proj == pn_Mod_M && mode == mode_M) ||
487 (proj == pn_Mod_X_except && mode == mode_X) ||
488 (proj == pn_Mod_res && mode_is_int(mode))),
489 "wrong Proj from Mod", 0,
490 show_proj_failure(p);
492 if (proj == pn_Mod_X_except)
494 get_irn_pinned(n) == op_pin_state_pinned,
495 "Exception Proj from unpinned Mod", 0);
496 else if (proj == pn_Mod_M)
498 get_irn_pinned(n) == op_pin_state_pinned,
499 "Memory Proj from unpinned Div", 0);
504 * verify a Proj(Cmp) node
506 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
507 ir_mode *mode = get_irn_mode(p);
508 long proj = get_Proj_proj(p);
511 (proj >= 0 && proj <= 15 && mode == mode_b),
512 "wrong Proj from Cmp", 0,
513 show_proj_failure(p);
519 * verify a Proj(Load) node
521 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
522 ir_mode *mode = get_irn_mode(p);
523 long proj = get_Proj_proj(p);
525 if (proj == pn_Load_res) {
526 ir_node *ptr = get_Load_ptr(n);
527 entity *ent = get_ptr_entity(ptr);
529 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
530 /* do NOT check this for lowered phases, see comment on Store */
532 (mode == get_type_mode(get_entity_type(ent))),
533 "wrong data Proj from Load, entity type_mode failed", 0,
534 show_proj_failure_ent(p, ent);
539 mode_is_data(mode) && mode == get_Load_mode(n),
540 "wrong data Proj from Load", 0,
541 show_proj_failure(p);
547 ((proj == pn_Load_M && mode == mode_M) ||
548 (proj == pn_Load_X_except && mode == mode_X)),
549 "wrong Proj from Load", 0,
550 show_proj_failure(p);
553 if (proj == pn_Load_X_except)
555 get_irn_pinned(n) == op_pin_state_pinned,
556 "Exception Proj from unpinned Load", 0);
561 * verify a Proj(Store) node
563 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
564 ir_mode *mode = get_irn_mode(p);
565 long proj = get_Proj_proj(p);
568 ((proj == pn_Store_M && mode == mode_M) ||
569 (proj == pn_Store_X_except && mode == mode_X)),
570 "wrong Proj from Store", 0,
571 show_proj_failure(p);
573 if (proj == pn_Store_X_except)
575 get_irn_pinned(n) == op_pin_state_pinned,
576 "Exception Proj from unpinned Store", 0);
581 * verify a Proj(Alloc) node
583 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
584 ir_mode *mode = get_irn_mode(p);
585 long proj = get_Proj_proj(p);
589 (proj == pn_Alloc_M && mode == mode_M) ||
590 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
591 (proj == pn_Alloc_res && mode_is_reference(mode))
593 "wrong Proj from Alloc", 0,
594 show_proj_failure(p);
600 * verify a Proj(Proj) node
602 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
603 ir_mode *mode = get_irn_mode(p);
604 long proj = get_Proj_proj(p);
605 long nr = get_Proj_proj(pred);
606 type *mt; /* A method type */
608 pred = skip_Id(get_Proj_pred(pred));
609 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
611 switch (get_irn_opcode(pred)) {
613 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
615 if (nr == pn_Start_T_args) {
617 (proj >= 0 && mode_is_data(mode)),
618 "wrong Proj from Proj from Start", 0);
620 (proj < get_method_n_params(mt)),
621 "More Projs for args than args in type", 0
623 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
624 /* value argument */ break;
627 (mode == get_type_mode(get_method_param_type(mt, proj))),
628 "Mode of Proj from Start doesn't match mode of param type.", 0,
629 show_proj_mode_failure(p, get_method_param_type(mt, proj));
632 else if (nr == pn_Start_P_value_arg_base) {
634 (proj >= 0 && mode_is_reference(mode)),
635 "wrong Proj from Proj from Start", 0
638 (proj < get_method_n_params(mt)),
639 "More Projs for args than args in type", 0
647 (proj >= 0 && mode_is_data(mode)),
648 "wrong Proj from Proj from Call", 0);
649 mt = get_Call_type(pred);
651 (proj < get_method_n_ress(mt)),
652 "More Projs for results than results in type.", 0);
653 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
654 /* value result */ break;
657 (mode == get_type_mode(get_method_res_type(mt, proj))),
658 "Mode of Proj from Call doesn't match mode of result type.", 0);
667 /* hmm, optimization did not remove it */
671 ASSERT_AND_RET(0, "Unknown opcode", 0);
677 * verify a Proj(Tuple) node
679 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
685 * verify a Proj(CallBegin) node
687 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
692 * verify a Proj(EndReg) node
694 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
695 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
696 "EndReg may only appear if ip view is constructed.", 0);
701 * verify a Proj(EndExcept) node
703 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
704 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
705 "EndExcept may only appear if ip view is constructed.", 0);
713 verify_node_Proj(ir_node *p, ir_graph *irg) {
717 pred = skip_Id(get_Proj_pred(p));
718 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
720 op = get_irn_op(pred);
722 if (op->verify_proj_node)
723 return op->verify_proj_node(pred, p);
730 * verify a Block node
732 static int verify_node_Block(ir_node *n, ir_graph *irg) {
735 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
736 ir_node *pred = get_Block_cfgpred(n, i);
740 (get_irn_mode(pred) == mode_X)
744 /* End block may only have Return, Raise or fragile ops as preds. */
745 if (n == get_irg_end_block(irg))
746 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
747 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
748 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
749 break; /* We can not test properly. How many tuples are there? */
750 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
752 (get_irn_op(pred) == op_Raise) ||
753 is_fragile_op(pred) ),
754 "End Block node", 0);
756 /* irg attr must == graph we are in. */
757 if (! get_interprocedural_view()) {
758 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
764 * verify a Start node
766 static int verify_node_Start(ir_node *n, ir_graph *irg) {
767 ir_mode *mymode = get_irn_mode(n);
770 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
771 mymode == mode_T, "Start node", 0
779 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
780 ir_mode *mymode = get_irn_mode(n);
784 mymode == mode_X, "Jmp node", 0
790 * verify an IJmp node
792 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
793 ir_mode *mymode = get_irn_mode(n);
794 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
797 /* IJmp: BB x ref --> X */
798 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
804 * verify a Break node
806 static int verify_node_Break(ir_node *n, ir_graph *irg) {
807 ir_mode *mymode = get_irn_mode(n);
809 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
810 "Break may only appear if ip view is constructed.", 0);
813 mymode == mode_X, "Break node", 0
821 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
822 ir_mode *mymode = get_irn_mode(n);
823 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
826 /* Cond: BB x b --> X x X */
827 (op1mode == mode_b ||
828 /* Cond: BB x int --> X^n */
829 mode_is_int(op1mode) ), "Cond node", 0
831 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
833 if (op1mode == mode_b && get_irg_outs_state(irg) == outs_consistent &&
834 !is_Block_dead(get_nodes_block(n))) {
835 /* we have consistent outs, check for the right number of Proj's */
837 get_irn_n_outs(n) == 2,
838 "Live binary Cond node must have 2 successors", 0);
844 * verify a Return node
846 static int verify_node_Return(ir_node *n, ir_graph *irg) {
848 ir_mode *mymode = get_irn_mode(n);
849 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
852 /* Return: BB x M x data1 x ... x datan --> X */
854 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
856 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
857 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
859 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
860 /* Compare returned results with result types of method type */
861 mt = get_entity_type(get_irg_entity(irg));
862 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
863 "Number of results for Return doesn't match number of results in type.", 0,
864 show_return_nres(irg, n, mt););
865 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
866 type *res_type = get_method_res_type(mt, i);
868 if (is_atomic_type(res_type)) {
870 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
871 "Mode of result for Return doesn't match mode of result type.", 0,
872 show_return_modes(irg, n, mt, i);
877 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
878 "Mode of result for Return doesn't match mode of result type.", 0,
879 show_return_modes(irg, n, mt, i);
887 * verify a Raise node
889 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
890 ir_mode *mymode = get_irn_mode(n);
891 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
892 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
895 /* Sel: BB x M x ref --> X x M */
896 op1mode == mode_M && mode_is_reference(op2mode) &&
897 mymode == mode_T, "Raise node", 0
903 * verify a Const node
905 static int verify_node_Const(ir_node *n, ir_graph *irg) {
906 ir_mode *mymode = get_irn_mode(n);
909 /* Const: BB --> data */
910 (mode_is_data(mymode) ||
911 mymode == mode_b) /* we want boolean constants for static evaluation */
912 ,"Const node", 0 /* of Cmp. */
918 * verify a SymConst node
920 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
921 ir_mode *mymode = get_irn_mode(n);
923 if (get_SymConst_kind(n) == symconst_addr_ent) {
924 entity *ent = get_SymConst_entity(n);
925 if (is_Method_type(get_entity_type(ent)) &&
926 get_irn_irg(n) != get_const_code_irg()) {
928 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
929 "A constant must address an existing method.", 0);
934 /* SymConst: BB --> int*/
935 (mode_is_int(mymode) ||
936 /* SymConst: BB --> ref */
937 mode_is_reference(mymode))
938 ,"SymConst node", 0);
945 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
947 ir_mode *mymode = get_irn_mode(n);
948 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
949 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
953 /* Sel: BB x M x ref x int^n --> ref */
954 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
955 "Sel node", 0, show_node_failure(n)
958 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
959 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
961 ent = get_Sel_entity(n);
962 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
967 * verify an InstOf node
969 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
970 ir_mode *mymode = get_irn_mode(n);
971 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
973 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
974 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
981 static int verify_node_Call(ir_node *n, ir_graph *irg) {
982 ir_mode *mymode = get_irn_mode(n);
983 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
984 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
988 /* Call: BB x M x ref x data1 x ... x datan
989 --> M x datan+1 x ... x data n+m */
990 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
992 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
994 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
995 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
996 "Call node with wrong memory input", 0 );
998 mt = get_Call_type(n);
999 if(get_unknown_type() == mt) {
1003 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1004 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1007 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1008 /* Compare arguments of node with those of type */
1010 if (get_method_variadicity(mt) == variadicity_variadic) {
1012 get_Call_n_params(n) >= get_method_n_params(mt),
1013 "Number of args for Call doesn't match number of args in variadic type.",
1015 fprintf(stderr, "Call has %d params, method %s type %d\n",
1016 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1021 get_Call_n_params(n) == get_method_n_params(mt),
1022 "Number of args for Call doesn't match number of args in non variadic type.",
1026 for (i = 0; i < get_method_n_params(mt); i++) {
1027 type *t = get_method_param_type(mt, i);
1029 if (is_atomic_type(t)) {
1031 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1032 "Mode of arg for Call doesn't match mode of arg type.", 0,
1033 show_call_param(n, mt);
1037 /* call with a compound type, mode must be reference */
1039 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1040 "Mode of arg for Call doesn't match mode of arg type.", 0,
1041 show_call_param(n, mt);
1047 if (Call_has_callees(n)) {
1048 for (i = 0; i < get_Call_n_callees(n); i++) {
1049 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1057 * verify an Add node
1059 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1060 ir_mode *mymode = get_irn_mode(n);
1061 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1062 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1066 /* common Add: BB x numP x numP --> numP */
1067 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1068 /* Pointer Add: BB x ref x int --> ref */
1069 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1070 /* Pointer Add: BB x int x ref --> ref */
1071 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1074 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1075 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1076 "/* Pointer Add: BB x int x ref --> ref */");
1084 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1085 ir_mode *mymode = get_irn_mode(n);
1086 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1087 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1090 /* common Sub: BB x numP x numP --> numP */
1091 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1092 /* Pointer Sub: BB x ref x int --> ref */
1093 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1094 /* Pointer Sub: BB x int x ref --> ref */
1095 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1096 /* Pointer Sub: BB x ref x ref --> int */
1097 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1099 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1100 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1101 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1102 "/* Pointer Sub: BB x ref x ref --> int */" );
1108 * verify a Minus node
1110 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1111 ir_mode *mymode = get_irn_mode(n);
1112 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1115 /* Minus: BB x num --> num */
1116 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1117 show_unop_failure(n , "/* Minus: BB x num --> num */");
1125 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1126 ir_mode *mymode = get_irn_mode(n);
1127 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1128 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1131 /* Mul: BB x int1 x int1 --> int2 */
1132 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1133 /* Mul: BB x float x float --> float */
1134 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1136 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1137 "/* Mul: BB x float x float --> float */");
1143 * verify a Quot node
1145 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1146 ir_mode *mymode = get_irn_mode(n);
1147 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1148 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1149 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1152 /* Quot: BB x M x float x float --> M x X x float */
1153 op1mode == mode_M && op2mode == op3mode &&
1154 get_mode_sort(op2mode) == irms_float_number &&
1157 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1163 * verify a DivMod node
1165 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1166 ir_mode *mymode = get_irn_mode(n);
1167 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1168 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1169 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1172 /* DivMod: BB x M x int x int --> M x X x int x int */
1173 op1mode == mode_M &&
1174 mode_is_int(op2mode) &&
1175 op3mode == op2mode &&
1185 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1186 ir_mode *mymode = get_irn_mode(n);
1187 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1188 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1189 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1192 /* Div: BB x M x int x int --> M x X x int */
1193 op1mode == mode_M &&
1194 op2mode == op3mode &&
1195 mode_is_int(op2mode) &&
1205 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1206 ir_mode *mymode = get_irn_mode(n);
1207 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1208 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1209 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1212 /* Mod: BB x M x int x int --> M x X x int */
1213 op1mode == mode_M &&
1214 op2mode == op3mode &&
1215 mode_is_int(op2mode) &&
1223 * verify an Abs node
1225 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1226 ir_mode *mymode = get_irn_mode(n);
1227 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1230 /* Abs: BB x num --> num */
1231 op1mode == mymode &&
1232 mode_is_num (op1mode),
1234 show_unop_failure(n, "/* Abs: BB x num --> num */");
1240 * verify a logical And, Or, Eor node
1242 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1243 ir_mode *mymode = get_irn_mode(n);
1244 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1245 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1248 /* And or Or or Eor: BB x int x int --> int */
1249 mode_is_int(mymode) &&
1250 op2mode == op1mode &&
1252 "And, Or or Eor node", 0,
1253 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1258 #define verify_node_And verify_node_Logic
1259 #define verify_node_Or verify_node_Logic
1260 #define verify_node_Eor verify_node_Logic
1265 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1266 ir_mode *mymode = get_irn_mode(n);
1267 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1270 /* Not: BB x int --> int */
1271 mode_is_int(mymode) &&
1274 show_unop_failure(n, "/* Not: BB x int --> int */");
1282 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1283 ir_mode *mymode = get_irn_mode(n);
1284 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1285 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1288 /* Cmp: BB x datab x datab --> b16 */
1289 mode_is_data (op1mode) &&
1290 op2mode == op1mode &&
1293 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1299 * verify a Shift node
1301 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1302 ir_mode *mymode = get_irn_mode(n);
1303 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1304 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1307 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1308 mode_is_int(op1mode) &&
1309 mode_is_int(op2mode) &&
1310 !mode_is_signed(op2mode) &&
1312 "Shl, Shr or Shrs node", 0,
1313 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1318 #define verify_node_Shl verify_node_Shift
1319 #define verify_node_Shr verify_node_Shift
1320 #define verify_node_Shrs verify_node_Shift
1325 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1326 ir_mode *mymode = get_irn_mode(n);
1327 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1328 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1331 /* Rot: BB x int x int --> int */
1332 mode_is_int(op1mode) &&
1333 mode_is_int(op2mode) &&
1336 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1342 * verify a Conv node
1344 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1345 ir_mode *mymode = get_irn_mode(n);
1346 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1349 /* Conv: BB x datab1 --> datab2 */
1350 mode_is_datab(op1mode) && mode_is_data(mymode),
1352 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1358 * verify a Cast node
1360 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1361 ir_mode *mymode = get_irn_mode(n);
1362 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1365 /* Conv: BB x datab1 --> datab2 */
1366 mode_is_data(op1mode) && op1mode == mymode,
1368 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1376 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1377 ir_mode *mymode = get_irn_mode(n);
1378 ir_node *block = get_nodes_block(n);
1381 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1382 /* a Phi node MUST have the same number of inputs as its block */
1384 get_irn_arity(n) == get_irn_arity(block),
1385 "wrong number of inputs in Phi node", 0,
1386 show_phi_inputs(n, block);
1390 /* Phi: BB x dataM^n --> dataM */
1391 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1392 ir_node *pred = get_irn_n(n, i);
1393 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1395 get_irn_mode(pred) == mymode,
1397 show_phi_failure(n, pred, i);
1400 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1405 * verify a Filter node
1407 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1408 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1409 "Filter may only appear if ip view is constructed.", 0);
1410 /* We should further do tests as for Proj and Phi. */
1415 * verify a Load node
1417 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1418 ir_mode *mymode = get_irn_mode(n);
1419 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1420 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1423 /* Load: BB x M x ref --> M x X x data */
1424 op1mode == mode_M && mode_is_reference(op2mode),
1427 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1430 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1431 * (Proj (Proj))) sometimes ...
1433 * interprete.c:ai_eval seems to assume that this happens, too
1435 * obset.c:get_abstval_any can't deal with this if the load has
1439 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1440 assert ((NULL != ent) || (mymode != mode_T));
1448 * verify a Store node
1450 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1453 ir_mode *mymode = get_irn_mode(n);
1454 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1455 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1456 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1459 /* Store: BB x M x ref x data --> M x X */
1460 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1463 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1465 target = get_ptr_entity(get_Store_ptr(n));
1466 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1468 * If lowered code, any Sels that add 0 may be removed, causing
1469 * an direct access to entities of array or compound type.
1470 * Prevent this by checking the phase.
1472 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1480 * verify an Alloc node
1482 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1485 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1488 /* Alloc: BB x M x int_u --> M x X x ref */
1489 op1mode == mode_M &&
1490 mode_is_int(op2mode) &&
1491 !mode_is_signed(op2mode) &&
1494 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1500 * verify a Free node
1502 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1503 ir_mode *mymode = get_irn_mode(n);
1504 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1505 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1506 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1509 /* Free: BB x M x ref x int_u --> M */
1510 op1mode == mode_M && mode_is_reference(op2mode) &&
1511 mode_is_int(op3mode) &&
1512 !mode_is_signed(op3mode) &&
1515 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1521 * verify a Sync node
1523 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1525 ir_mode *mymode = get_irn_mode(n);
1527 /* Sync: BB x M^n --> M */
1528 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1529 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1531 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1536 * verify a Confirm node
1538 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1539 ir_mode *mymode = get_irn_mode(n);
1540 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1541 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1544 /* Confirm: BB x T x T --> T */
1545 op1mode == mymode &&
1548 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1556 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1557 ir_mode *mymode = get_irn_mode(n);
1558 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1559 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1560 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1563 /* Mux: BB x b x numP x numP --> numP */
1564 op1mode == mode_b &&
1565 op2mode == mymode &&
1566 op3mode == mymode &&
1567 mode_is_numP(mymode),
1575 * For each usage of a node, it is checked, if the block of the
1576 * node dominates the block of the usage (for phis: the predecessor
1577 * block of the phi for the corresponding edge).
1579 static int check_dominance_for_node(ir_node *use)
1581 /* This won't work for blocks and the end node */
1582 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1584 ir_node *bl = get_nodes_block(use);
1586 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1587 ir_node *def = get_irn_n(use, i);
1588 ir_node *def_bl = get_nodes_block(def);
1589 ir_node *use_bl = bl;
1591 /* ignore dead definition blocks, will be removed */
1592 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1596 use_bl = get_Block_cfgpred_block(bl, i);
1598 /* ignore dead use blocks, will be removed */
1599 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1603 block_dominates(def_bl, use_bl),
1604 "the definition of a value used violates the dominance property", 0,
1606 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1607 current_ir_graph, def_bl, def, use_bl, use, i
1615 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1620 if (!opt_do_node_verification)
1623 if (!get_interprocedural_view()) {
1625 * do NOT check placement in interprocedural view, as we don't always know
1626 * the "right" graph ...
1629 node_is_in_irgs_storage(irg, n),
1630 "Node is not stored on proper IR graph!", 0,
1631 show_node_on_graph(irg, n);
1633 assert(get_irn_irg(n) == irg);
1638 /* We don't want to test nodes whose predecessors are Bad,
1639 as we would have to special case that for each operation. */
1640 if (op != op_Phi && op != op_Block)
1641 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1642 if (is_Bad(get_irn_n(n, i)))
1646 if (op->verify_node)
1647 return op->verify_node(n, irg);
1653 int irn_vrfy(ir_node *n)
1656 #ifdef DEBUG_libfirm
1657 res = irn_vrfy_irg(n, current_ir_graph);
1662 /*-----------------------------------------------------------------*/
1663 /* Verify the whole graph. */
1664 /*-----------------------------------------------------------------*/
1666 #ifdef DEBUG_libfirm
1668 * Walker to check every node
1670 static void vrfy_wrap(ir_node *node, void *env) {
1672 *res = irn_vrfy(node);
1676 * Walker to check every node including SSA property.
1677 * Only called if dominance info is available.
1679 static void vrfy_wrap_ssa(ir_node *node, void *env)
1683 *res = irn_vrfy(node);
1685 *res = check_dominance_for_node(node);
1688 #endif /* DEBUG_libfirm */
1691 * Calls irn_vrfy for each node in irg.
1692 * Graph must be in state "op_pin_state_pinned".
1693 * If dominance info is available, check the SSA property.
1695 int irg_verify(ir_graph *irg, unsigned flags)
1698 #ifdef DEBUG_libfirm
1701 rem = current_ir_graph;
1702 current_ir_graph = irg;
1703 last_irg_error = NULL;
1705 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1707 if (flags & VRFY_ENFORCE_SSA)
1712 get_irg_dom_state(irg) == dom_consistent &&
1713 get_irg_pinned(irg) == op_pin_state_pinned ?
1714 vrfy_wrap_ssa : vrfy_wrap,
1718 current_ir_graph = rem;
1720 if (opt_do_node_verification == NODE_VERIFICATION_REPORT && ! res) {
1721 entity *ent = get_irg_entity(current_ir_graph);
1724 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1726 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1728 #endif /* DEBUG_libfirm */
1733 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1736 node_verification_t old = opt_do_node_verification;
1738 firm_vrfy_failure_msg = NULL;
1739 opt_do_node_verification = NODE_VERIFICATION_ERROR_ONLY;
1740 res = irn_vrfy_irg(n, irg);
1741 if (! res && get_irg_dom_state(irg) == dom_consistent &&
1742 get_irg_pinned(irg) == op_pin_state_pinned)
1743 res = check_dominance_for_node(n);
1744 opt_do_node_verification = old;
1745 *bad_string = firm_vrfy_failure_msg;
1751 typedef struct _vrfy_bad_env_t {
1757 * Pre-Walker: check Bad predecessors of node.
1759 static void check_bads(ir_node *node, void *env)
1761 vrfy_bad_env_t *venv = env;
1762 int i, arity = get_irn_arity(node);
1764 if (is_Block(node)) {
1765 if ((venv->flags & BAD_CF) == 0) {
1767 /* check for Bad Block predecessor */
1768 for (i = 0; i < arity; ++i) {
1769 ir_node *pred = get_irn_n(node, i);
1772 venv->res |= BAD_CF;
1774 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1775 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1777 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1778 assert(0 && "Bad CF detected");
1785 if ((venv->flags & BAD_BLOCK) == 0) {
1787 /* check for Bad Block */
1788 if (is_Bad(get_nodes_block(node))) {
1789 venv->res |= BAD_BLOCK;
1791 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1792 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1794 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1795 assert(0 && "Bad CF detected");
1800 if ((venv->flags & TUPLE) == 0) {
1801 if (get_irn_op(node) == op_Tuple) {
1804 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1805 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1807 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1808 assert(0 && "Tuple detected");
1813 for (i = 0; i < arity; ++i) {
1814 ir_node *pred = get_irn_n(node, i);
1817 /* check for Phi with Bad inputs */
1818 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1819 if (venv->flags & BAD_CF)
1822 venv->res |= BAD_CF;
1824 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1825 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1827 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1828 assert(0 && "Bad CF detected");
1833 /* Bad node input */
1834 if ((venv->flags & BAD_DF) == 0) {
1835 venv->res |= BAD_DF;
1837 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1838 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1840 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1841 assert(0 && "Bad NON-CF detected");
1850 * verify occurance of bad nodes
1852 int irg_vrfy_bads(ir_graph *irg, int flags)
1859 irg_walk_graph(irg, check_bads, NULL, &env);
1865 * set the default verify operation
1867 void firm_set_default_verifyer(ir_op *op)
1871 op->verify_node = verify_node_##a; \
1919 op->verify_node = NULL;
1925 op->verify_proj_node = verify_node_Proj_##a; \
1948 op->verify_proj_node = NULL;