3 * File name: ir/ir/irvrfy.c
4 * Purpose: Check irnodes for correctness.
5 * Author: Christian Schaefer
6 * Modified by: Goetz Lindenmaier. Till Riedel
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 /** if this flag is set, verify entity types in Load & Store nodes */
26 static int vrfy_entities = 0;
28 /* @@@ replace use of array "in" by access functions. */
29 ir_node **get_irn_in(ir_node *node);
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 a Break node
792 static int verify_node_Break(ir_node *n, ir_graph *irg) {
793 ir_mode *mymode = get_irn_mode(n);
795 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
796 "Break may only appear if ip view is constructed.", 0);
799 mymode == mode_X, "Break node", 0
807 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
808 ir_mode *mymode = get_irn_mode(n);
809 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
812 /* Cond: BB x b --> X x X */
813 (op1mode == mode_b ||
814 /* Cond: BB x int --> X^n */
815 mode_is_int(op1mode) ), "Cond node", 0
817 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
822 * verify a Return node
824 static int verify_node_Return(ir_node *n, ir_graph *irg) {
826 ir_mode *mymode = get_irn_mode(n);
827 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
830 /* Return: BB x M x data1 x ... x datan --> X */
832 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
834 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
835 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
837 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
838 /* Compare returned results with result types of method type */
839 mt = get_entity_type(get_irg_entity(irg));
840 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
841 "Number of results for Return doesn't match number of results in type.", 0,
842 show_return_nres(irg, n, mt););
843 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
844 type *res_type = get_method_res_type(mt, i);
846 if (is_atomic_type(res_type)) {
848 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
849 "Mode of result for Return doesn't match mode of result type.", 0,
850 show_return_modes(irg, n, mt, i);
855 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
856 "Mode of result for Return doesn't match mode of result type.", 0,
857 show_return_modes(irg, n, mt, i);
865 * verify a Raise node
867 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
868 ir_mode *mymode = get_irn_mode(n);
869 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
870 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
873 /* Sel: BB x M x ref --> X x M */
874 op1mode == mode_M && mode_is_reference(op2mode) &&
875 mymode == mode_T, "Raise node", 0
881 * verify a Const node
883 static int verify_node_Const(ir_node *n, ir_graph *irg) {
884 ir_mode *mymode = get_irn_mode(n);
887 /* Const: BB --> data */
888 (mode_is_data(mymode) ||
889 mymode == mode_b) /* we want boolean constants for static evaluation */
890 ,"Const node", 0 /* of Cmp. */
896 * verify a SymConst node
898 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
899 ir_mode *mymode = get_irn_mode(n);
901 if (get_SymConst_kind(n) == symconst_addr_ent) {
902 entity *ent = get_SymConst_entity(n);
903 if (is_Method_type(get_entity_type(ent)) &&
904 get_irn_irg(n) != get_const_code_irg()) {
906 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
907 "A constant must address an existing method.", 0);
912 /* SymConst: BB --> int*/
913 (mode_is_int(mymode) ||
914 /* SymConst: BB --> ref */
915 mode_is_reference(mymode))
916 ,"SymConst node", 0);
923 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
925 ir_mode *mymode = get_irn_mode(n);
926 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
927 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
931 /* Sel: BB x M x ref x int^n --> ref */
932 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
933 "Sel node", 0, show_node_failure(n)
936 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
937 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
939 ent = get_Sel_entity(n);
940 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
945 * verify an InstOf node
947 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
948 ir_mode *mymode = get_irn_mode(n);
949 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
951 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
952 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
959 static int verify_node_Call(ir_node *n, ir_graph *irg) {
960 ir_mode *mymode = get_irn_mode(n);
961 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
962 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
966 /* Call: BB x M x ref x data1 x ... x datan
967 --> M x datan+1 x ... x data n+m */
968 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
970 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
972 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
973 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
974 "Call node with wrong memory input", 0 );
976 mt = get_Call_type(n);
977 if(get_unknown_type() == mt) {
981 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
982 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
985 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
986 /* Compare arguments of node with those of type */
988 if (get_method_variadicity(mt) == variadicity_variadic) {
990 get_Call_n_params(n) >= get_method_n_params(mt),
991 "Number of args for Call doesn't match number of args in variadic type.",
993 fprintf(stderr, "Call has %d params, method %s type %d\n",
994 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
999 get_Call_n_params(n) == get_method_n_params(mt),
1000 "Number of args for Call doesn't match number of args in non variadic type.",
1004 for (i = 0; i < get_method_n_params(mt); i++) {
1005 type *t = get_method_param_type(mt, i);
1007 if (is_atomic_type(t)) {
1009 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1010 "Mode of arg for Call doesn't match mode of arg type.", 0,
1011 show_call_param(n, mt);
1015 /* call with a compound type, mode must be reference */
1017 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1018 "Mode of arg for Call doesn't match mode of arg type.", 0,
1019 show_call_param(n, mt);
1025 if (Call_has_callees(n)) {
1026 for (i = 0; i < get_Call_n_callees(n); i++) {
1027 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1035 * verify an Add node
1037 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1038 ir_mode *mymode = get_irn_mode(n);
1039 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1040 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1044 /* common Add: BB x numP x numP --> numP */
1045 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1046 /* Pointer Add: BB x ref x int --> ref */
1047 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1048 /* Pointer Add: BB x int x ref --> ref */
1049 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1052 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1053 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1054 "/* Pointer Add: BB x int x ref --> ref */");
1062 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1063 ir_mode *mymode = get_irn_mode(n);
1064 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1065 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1068 /* common Sub: BB x numP x numP --> numP */
1069 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1070 /* Pointer Sub: BB x ref x int --> ref */
1071 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1072 /* Pointer Sub: BB x int x ref --> ref */
1073 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1074 /* Pointer Sub: BB x ref x ref --> int */
1075 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1077 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1078 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1079 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1080 "/* Pointer Sub: BB x ref x ref --> int */" );
1086 * verify a Minus node
1088 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1089 ir_mode *mymode = get_irn_mode(n);
1090 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1093 /* Minus: BB x num --> num */
1094 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1095 show_unop_failure(n , "/* Minus: BB x num --> num */");
1103 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1104 ir_mode *mymode = get_irn_mode(n);
1105 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1106 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1109 /* Mul: BB x int1 x int1 --> int2 */
1110 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1111 /* Mul: BB x float x float --> float */
1112 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1114 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1115 "/* Mul: BB x float x float --> float */");
1121 * verify a Quot node
1123 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1124 ir_mode *mymode = get_irn_mode(n);
1125 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1126 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1127 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1130 /* Quot: BB x M x float x float --> M x X x float */
1131 op1mode == mode_M && op2mode == op3mode &&
1132 get_mode_sort(op2mode) == irms_float_number &&
1135 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1141 * verify a DivMod node
1143 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1144 ir_mode *mymode = get_irn_mode(n);
1145 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1146 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1147 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1150 /* DivMod: BB x M x int x int --> M x X x int x int */
1151 op1mode == mode_M &&
1152 mode_is_int(op2mode) &&
1153 op3mode == op2mode &&
1163 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1164 ir_mode *mymode = get_irn_mode(n);
1165 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1166 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1167 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1170 /* Div: BB x M x int x int --> M x X x int */
1171 op1mode == mode_M &&
1172 op2mode == op3mode &&
1173 mode_is_int(op2mode) &&
1183 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1184 ir_mode *mymode = get_irn_mode(n);
1185 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1186 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1187 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1190 /* Mod: BB x M x int x int --> M x X x int */
1191 op1mode == mode_M &&
1192 op2mode == op3mode &&
1193 mode_is_int(op2mode) &&
1201 * verify an Abs node
1203 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1204 ir_mode *mymode = get_irn_mode(n);
1205 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1208 /* Abs: BB x num --> num */
1209 op1mode == mymode &&
1210 mode_is_num (op1mode),
1212 show_unop_failure(n, "/* Abs: BB x num --> num */");
1218 * verify a logical And, Or, Eor node
1220 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1221 ir_mode *mymode = get_irn_mode(n);
1222 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1223 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1226 /* And or Or or Eor: BB x int x int --> int */
1227 mode_is_int(mymode) &&
1228 op2mode == op1mode &&
1230 "And, Or or Eor node", 0,
1231 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1236 #define verify_node_And verify_node_Logic
1237 #define verify_node_Or verify_node_Logic
1238 #define verify_node_Eor verify_node_Logic
1243 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1244 ir_mode *mymode = get_irn_mode(n);
1245 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1248 /* Not: BB x int --> int */
1249 mode_is_int(mymode) &&
1252 show_unop_failure(n, "/* Not: BB x int --> int */");
1260 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1261 ir_mode *mymode = get_irn_mode(n);
1262 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1263 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1266 /* Cmp: BB x datab x datab --> b16 */
1267 mode_is_data (op1mode) &&
1268 op2mode == op1mode &&
1271 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1277 * verify a Shift node
1279 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1280 ir_mode *mymode = get_irn_mode(n);
1281 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1282 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1285 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1286 mode_is_int(op1mode) &&
1287 mode_is_int(op2mode) &&
1288 !mode_is_signed(op2mode) &&
1290 "Shl, Shr or Shrs node", 0,
1291 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1296 #define verify_node_Shl verify_node_Shift
1297 #define verify_node_Shr verify_node_Shift
1298 #define verify_node_Shrs verify_node_Shift
1303 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1304 ir_mode *mymode = get_irn_mode(n);
1305 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1306 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1309 /* Rot: BB x int x int --> int */
1310 mode_is_int(op1mode) &&
1311 mode_is_int(op2mode) &&
1314 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1320 * verify a Conv node
1322 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1323 ir_mode *mymode = get_irn_mode(n);
1324 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1327 /* Conv: BB x datab1 --> datab2 */
1328 mode_is_datab(op1mode) && mode_is_data(mymode),
1330 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1336 * verify a Cast node
1338 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1339 ir_mode *mymode = get_irn_mode(n);
1340 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1343 /* Conv: BB x datab1 --> datab2 */
1344 mode_is_data(op1mode) && op1mode == mymode,
1346 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1354 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1355 ir_mode *mymode = get_irn_mode(n);
1356 ir_node *block = get_nodes_block(n);
1359 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1360 /* a Phi node MUST have the same number of inputs as its block */
1362 get_irn_arity(n) == get_irn_arity(block),
1363 "wrong number of inputs in Phi node", 0,
1364 show_phi_inputs(n, block);
1368 /* Phi: BB x dataM^n --> dataM */
1369 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1370 ir_node *pred = get_irn_n(n, i);
1371 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1373 get_irn_mode(pred) == mymode,
1375 show_phi_failure(n, pred, i);
1378 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1383 * verify a Filter node
1385 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1386 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1387 "Filter may only appear if ip view is constructed.", 0);
1388 /* We should further do tests as for Proj and Phi. */
1393 * verify a Load node
1395 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1396 ir_mode *mymode = get_irn_mode(n);
1397 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1398 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1401 /* Load: BB x M x ref --> M x X x data */
1402 op1mode == mode_M && mode_is_reference(op2mode),
1405 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1408 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1409 * (Proj (Proj))) sometimes ...
1411 * interprete.c:ai_eval seems to assume that this happens, too
1413 * obset.c:get_abstval_any can't deal with this if the load has
1417 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1418 assert ((NULL != ent) || (mymode != mode_T));
1426 * verify a Store node
1428 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1431 ir_mode *mymode = get_irn_mode(n);
1432 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1433 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1434 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1437 /* Store: BB x M x ref x data --> M x X */
1438 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1441 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1443 target = get_ptr_entity(get_Store_ptr(n));
1444 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1446 * If lowered code, any Sels that add 0 may be removed, causing
1447 * an direct access to entities of array or compound type.
1448 * Prevent this by checking the phase.
1450 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1458 * verify an Alloc node
1460 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1461 ir_mode *mymode = get_irn_mode(n);
1462 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1463 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1466 /* Alloc: BB x M x int_u --> M x X x ref */
1467 op1mode == mode_M &&
1468 mode_is_int(op2mode) &&
1469 !mode_is_signed(op2mode) &&
1472 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1478 * verify a Free node
1480 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1481 ir_mode *mymode = get_irn_mode(n);
1482 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1483 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1484 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1487 /* Free: BB x M x ref x int_u --> M */
1488 op1mode == mode_M && mode_is_reference(op2mode) &&
1489 mode_is_int(op3mode) &&
1490 !mode_is_signed(op3mode) &&
1493 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1499 * verify a Sync node
1501 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1503 ir_mode *mymode = get_irn_mode(n);
1505 /* Sync: BB x M^n --> M */
1506 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1507 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1509 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1514 * verify a Confirm node
1516 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1517 ir_mode *mymode = get_irn_mode(n);
1518 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1519 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1522 /* Confirm: BB x T x T --> T */
1523 op1mode == mymode &&
1526 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1534 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1535 ir_mode *mymode = get_irn_mode(n);
1536 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1537 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1538 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1541 /* Mux: BB x b x numP x numP --> numP */
1542 op1mode == mode_b &&
1543 op2mode == mymode &&
1544 op3mode == mymode &&
1545 mode_is_numP(mymode),
1551 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1556 if (!opt_do_node_verification) return 1;
1558 if (! get_interprocedural_view()) {
1560 * do NOT check placement in interprocedural view, as we don't always know
1561 * the "right" graph ...
1564 node_is_in_irgs_storage(irg, n),
1565 "Node is not stored on proper IR graph!", 0,
1566 show_node_on_graph(irg, n);
1568 assert(get_irn_irg(n) == irg);
1573 /* We don't want to test nodes whose predecessors are Bad,
1574 as we would have to special case that for each operation. */
1575 if (op != op_Phi && op != op_Block)
1576 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1577 if (is_Bad(get_irn_n(n, i)))
1581 if (op->verify_node)
1582 return op->verify_node(n, irg);
1588 int irn_vrfy(ir_node *n)
1591 #ifdef DEBUG_libfirm
1592 res = irn_vrfy_irg(n, current_ir_graph);
1597 /*-----------------------------------------------------------------*/
1598 /* Verify the whole graph. */
1599 /*-----------------------------------------------------------------*/
1601 /* This *is* used, except gcc doesn't notice that */
1602 static void vrfy_wrap(ir_node *node, void *env)
1606 *res = irn_vrfy(node);
1609 int irg_vrfy(ir_graph *irg)
1612 #ifdef DEBUG_libfirm
1615 rem = current_ir_graph;
1616 current_ir_graph = irg;
1617 last_irg_error = NULL;
1619 assert(get_irg_pinned(irg) == op_pin_state_pinned);
1621 irg_walk_graph(irg, vrfy_wrap, NULL, &res);
1623 current_ir_graph = rem;
1625 if (opt_do_node_verification == NODE_VERIFICATION_REPORT && ! res) {
1626 entity *ent = get_irg_entity(current_ir_graph);
1629 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1631 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1638 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1641 node_verification_t old = opt_do_node_verification;
1643 firm_vrfy_failure_msg = NULL;
1644 opt_do_node_verification = NODE_VERIFICATION_ERROR_ONLY;
1645 res = irn_vrfy_irg(n, irg);
1646 opt_do_node_verification = old;
1647 *bad_string = firm_vrfy_failure_msg;
1653 typedef struct _vrfy_bad_env_t {
1658 static void check_bads(ir_node *node, void *env)
1660 vrfy_bad_env_t *venv = env;
1661 int i, arity = get_irn_arity(node);
1663 if (is_Block(node)) {
1664 if ((venv->flags & BAD_CF) == 0) {
1666 /* check for Bad Block predecessor */
1667 for (i = 0; i < arity; ++i) {
1668 ir_node *pred = get_irn_n(node, i);
1671 venv->res |= BAD_CF;
1673 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1674 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1676 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1677 assert(0 && "Bad CF detected");
1684 if ((venv->flags & BAD_BLOCK) == 0) {
1686 /* check for Bad Block */
1687 if (is_Bad(get_nodes_block(node))) {
1688 venv->res |= BAD_BLOCK;
1690 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1691 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1693 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1694 assert(0 && "Bad CF detected");
1699 if ((venv->flags & TUPLE) == 0) {
1700 if (get_irn_op(node) == op_Tuple) {
1703 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1704 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1706 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1707 assert(0 && "Tuple detected");
1712 for (i = 0; i < arity; ++i) {
1713 ir_node *pred = get_irn_n(node, i);
1716 /* check for Phi with Bad inputs */
1717 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1718 if (venv->flags & BAD_CF)
1721 venv->res |= BAD_CF;
1723 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1724 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1726 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1727 assert(0 && "Bad CF detected");
1732 /* Bad node input */
1733 if ((venv->flags & BAD_DF) == 0) {
1734 venv->res |= BAD_DF;
1736 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1737 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1739 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1740 assert(0 && "Bad NON-CF detected");
1749 * verify occurance of bad nodes
1751 int irg_vrfy_bads(ir_graph *irg, int flags)
1758 irg_walk_graph(irg, check_bads, NULL, &env);
1764 * set the default verify operation
1766 void firm_set_default_verifyer(ir_op *op)
1770 op->verify_node = verify_node_##a; \
1817 op->verify_node = NULL;
1823 op->verify_proj_node = verify_node_Proj_##a; \
1846 op->verify_proj_node = NULL;