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"
27 /** if this flag is set, verify entity types in Load & Store nodes */
28 static int vrfy_entities = 0;
30 node_verification_t opt_do_node_verification = NODE_VERIFICATION_ON;
31 const char *firm_vrfy_failure_msg;
33 /* enable verification of Load/Store entities */
34 void vrfy_enable_entity_tests(int enable) {
35 vrfy_entities = enable;
39 * little helper for NULL modes
41 static const char *get_mode_name_ex(ir_mode *mode) {
44 return get_mode_name(mode);
47 void do_node_verification(node_verification_t mode) {
48 opt_do_node_verification = mode;
51 /** the last IRG, on which a verify error was found */
52 static ir_graph *last_irg_error = NULL;
55 * print the name of the entity of an verification failure
57 static void show_entity_failure(ir_node *node)
59 ir_graph *irg = get_irn_irg(node);
61 if (last_irg_error == irg)
66 if (irg == get_const_code_irg()) {
67 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
70 entity *ent = get_irg_entity(irg);
73 type *ent_type = get_entity_owner(ent);
76 if (ent_type == get_glob_type())
77 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
79 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
82 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
86 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
92 * Prints a failure for a Node
94 static void show_node_failure(ir_node *n)
96 show_entity_failure(n);
97 fprintf(stderr, " node %ld %s%s\n" ,
99 get_irn_opname(n), get_irn_modename(n)
104 * Prints a failure message for a binop
106 static void show_binop_failure(ir_node *n, const char *text)
108 ir_node *left = get_binop_left(n);
109 ir_node *right = get_binop_right(n);
111 show_entity_failure(n);
112 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
114 get_irn_opname(n), get_irn_modename(n),
115 get_irn_opname(left), get_irn_modename(left),
116 get_irn_opname(right), get_irn_modename(right),
121 * Prints a failure message for an unop
123 static void show_unop_failure(ir_node *n, const char *text)
125 ir_node *op = get_unop_op(n);
127 show_entity_failure(n);
128 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
130 get_irn_opname(n), get_irn_modename(n),
131 get_irn_opname(op), get_irn_modename(op),
136 * Prints a failure message for an op with 3 operands
138 static void show_triop_failure(ir_node *n, const char *text)
140 ir_node *op0 = get_irn_n(n, 0);
141 ir_node *op1 = get_irn_n(n, 1);
142 ir_node *op2 = get_irn_n(n, 2);
144 show_entity_failure(n);
145 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
147 get_irn_opname(n), get_irn_modename(n),
148 get_irn_opname(op0), get_irn_modename(op0),
149 get_irn_opname(op1), get_irn_modename(op1),
150 get_irn_opname(op2), get_irn_modename(op2),
155 * Prints a failure message for a proj
157 static void show_proj_failure(ir_node *n)
159 ir_node *op = get_Proj_pred(n);
160 int proj = get_Proj_proj(n);
162 show_entity_failure(n);
163 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
165 get_irn_opname(n), get_irn_modename(n), proj,
166 get_irn_opname(op), get_irn_modename(op));
170 * Prints a failure message for a proj from Start
172 static void show_proj_mode_failure(ir_node *n, type *ty)
174 long proj = get_Proj_proj(n);
175 ir_mode *m = get_type_mode(ty);
177 show_entity_failure(n);
178 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
183 get_mode_name_ex(m));
187 * Prints a failure message for a proj
189 static void show_proj_failure_ent(ir_node *n, entity *ent)
191 ir_node *op = get_Proj_pred(n);
192 int proj = get_Proj_proj(n);
193 ir_mode *m = get_type_mode(get_entity_type(ent));
195 show_entity_failure(n);
196 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
198 get_irn_opname(n), get_irn_modename(n), proj,
199 get_irn_opname(op), get_irn_modename(op),
200 get_entity_name(ent), get_type_name(get_entity_type(ent)),
201 get_mode_name_ex(m));
205 * Show a node and a graph
207 static void show_node_on_graph(ir_graph *irg, ir_node *n)
209 entity *ent = get_irg_entity(irg);
212 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of entity %s, node %ld %s%s\n",
213 get_entity_name(ent),
214 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
216 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of graph %p, node %ld %s%s\n",
218 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
224 static void show_call_param(ir_node *n, type *mt)
228 show_entity_failure(n);
229 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
230 for (i = 0; i < get_method_n_params(mt); ++i) {
231 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
233 fprintf(stderr, ") != CALL(");
235 for (i = 0; i < get_Call_n_params(n); ++i) {
236 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
238 fprintf(stderr, ")\n");
245 static void show_return_modes(ir_graph *irg, ir_node *n, type *mt, int i)
247 entity *ent = get_irg_entity(irg);
249 show_entity_failure(n);
250 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
251 get_irn_node_nr(n), get_entity_name(ent),
252 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
253 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
258 * Show return number of results
260 static void show_return_nres(ir_graph *irg, ir_node *n, type *mt)
262 entity *ent = get_irg_entity(irg);
264 show_entity_failure(n);
265 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
266 get_irn_node_nr(n), get_entity_name(ent),
267 get_Return_n_ress(n), get_method_n_ress(mt));
273 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
275 show_entity_failure(phi);
276 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
277 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
278 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
284 static void show_phi_inputs(ir_node *phi, ir_node *block)
286 show_entity_failure(phi);
287 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
288 get_irn_node_nr(phi), get_irn_arity(phi),
289 get_irn_node_nr(block), get_irn_arity(block));
292 /** If the address is Sel or SymConst, return the entity. */
293 static entity *get_ptr_entity(ir_node *ptr) {
294 if (get_irn_op(ptr) == op_Sel) {
295 return get_Sel_entity(ptr);
296 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
297 return get_SymConst_entity(ptr);
303 * verify a Proj(Start) node
305 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
306 ir_mode *mode = get_irn_mode(p);
307 long proj = get_Proj_proj(p);
311 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
312 (proj == pn_Start_M && mode == mode_M) ||
313 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
314 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
315 (proj == pn_Start_T_args && mode == mode_T) ||
316 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
317 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
319 "wrong Proj from Start", 0,
320 show_proj_failure(p);
326 * verify a Proj(Cond) node
328 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
329 ir_mode *mode = get_irn_mode(p);
330 long proj = get_Proj_proj(p);
334 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
335 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
336 is_Bad(get_Cond_selector(pred)) /* rare */
338 "wrong Proj from Cond", 0,
339 show_proj_failure(p);
345 * verify a Proj(Raise) node
347 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
348 ir_mode *mode = get_irn_mode(p);
349 long proj = get_Proj_proj(p);
352 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
353 "wrong Proj from Raise", 0,
354 show_proj_failure(p);
360 * verify a Proj(InstOf) node
362 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
363 ir_mode *mode = get_irn_mode(p);
364 long proj = get_Proj_proj(p);
367 (proj >= 0 && mode == mode_X),
368 "wrong Proj from InstOf", 0,
369 show_proj_failure(p);
375 * verify a Proj(Call) node
377 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
378 ir_mode *mode = get_irn_mode(p);
379 long proj = get_Proj_proj(p);
382 ((proj == pn_Call_M_regular && mode == mode_M) ||
383 (proj == pn_Call_X_except && mode == mode_X) ||
384 (proj == pn_Call_T_result && mode == mode_T) ||
385 (proj == pn_Call_M_except && mode == mode_M) ||
386 (proj == pn_Call_P_value_res_base && mode == mode_P)),
387 "wrong Proj from Call", 0,
388 show_proj_failure(p);
390 if (proj == pn_Call_X_except)
392 get_irn_op(get_Call_mem(n)) != op_NoMem,
393 "Exception Proj from FunctionCall", 0);
394 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
396 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
397 "Memory Proj from FunctionCall", 0);
402 * verify a Proj(Quot) node
404 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
405 ir_mode *mode = get_irn_mode(p);
406 long proj = get_Proj_proj(p);
409 ((proj == pn_Quot_M && mode == mode_M) ||
410 (proj == pn_Quot_X_except && mode == mode_X) ||
411 (proj == pn_Quot_res && mode_is_float(mode))),
412 "wrong Proj from Quot", 0,
413 show_proj_failure(p);
415 if (proj == pn_Quot_X_except)
417 get_irn_pinned(n) == op_pin_state_pinned,
418 "Exception Proj from unpinned Quot", 0);
419 else if (proj == pn_Quot_M)
421 get_irn_pinned(n) == op_pin_state_pinned,
422 "Memory Proj from unpinned Quot", 0);
427 * verify a Proj(DivMod) node
429 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
430 ir_mode *mode = get_irn_mode(p);
431 long proj = get_Proj_proj(p);
434 ((proj == pn_DivMod_M && mode == mode_M) ||
435 (proj == pn_DivMod_X_except && mode == mode_X) ||
436 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
437 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
438 "wrong Proj from DivMod", 0,
439 show_proj_failure(p);
441 if (proj == pn_DivMod_X_except)
443 get_irn_pinned(n) == op_pin_state_pinned,
444 "Exception Proj from unpinned DivMod", 0);
445 else if (proj == pn_DivMod_M)
447 get_irn_pinned(n) == op_pin_state_pinned,
448 "Memory Proj from unpinned DivMod", 0);
453 * verify a Proj(Div) node
455 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
456 ir_mode *mode = get_irn_mode(p);
457 long proj = get_Proj_proj(p);
460 ((proj == pn_Div_M && mode == mode_M) ||
461 (proj == pn_Div_X_except && mode == mode_X) ||
462 (proj == pn_Div_res && mode_is_int(mode))),
463 "wrong Proj from Div", 0,
464 show_proj_failure(p);
466 if (proj == pn_Div_X_except)
468 get_irn_pinned(n) == op_pin_state_pinned,
469 "Exception Proj from unpinned Div", 0);
470 else if (proj == pn_Div_M)
472 get_irn_pinned(n) == op_pin_state_pinned,
473 "Memory Proj from unpinned Div", 0);
478 * verify a Proj(Mod) node
480 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
481 ir_mode *mode = get_irn_mode(p);
482 long proj = get_Proj_proj(p);
485 ((proj == pn_Mod_M && mode == mode_M) ||
486 (proj == pn_Mod_X_except && mode == mode_X) ||
487 (proj == pn_Mod_res && mode_is_int(mode))),
488 "wrong Proj from Mod", 0,
489 show_proj_failure(p);
491 if (proj == pn_Mod_X_except)
493 get_irn_pinned(n) == op_pin_state_pinned,
494 "Exception Proj from unpinned Mod", 0);
495 else if (proj == pn_Mod_M)
497 get_irn_pinned(n) == op_pin_state_pinned,
498 "Memory Proj from unpinned Div", 0);
503 * verify a Proj(Cmp) node
505 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
506 ir_mode *mode = get_irn_mode(p);
507 long proj = get_Proj_proj(p);
510 (proj >= 0 && proj <= 15 && mode == mode_b),
511 "wrong Proj from Cmp", 0,
512 show_proj_failure(p);
518 * verify a Proj(Load) node
520 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
521 ir_mode *mode = get_irn_mode(p);
522 long proj = get_Proj_proj(p);
524 if (proj == pn_Load_res) {
525 ir_node *ptr = get_Load_ptr(n);
526 entity *ent = get_ptr_entity(ptr);
528 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
529 /* do NOT check this for lowered phases, see comment on Store */
531 (mode == get_type_mode(get_entity_type(ent))),
532 "wrong data Proj from Load, entity type_mode failed", 0,
533 show_proj_failure_ent(p, ent);
538 mode_is_data(mode) && mode == get_Load_mode(n),
539 "wrong data Proj from Load", 0,
540 show_proj_failure(p);
546 ((proj == pn_Load_M && mode == mode_M) ||
547 (proj == pn_Load_X_except && mode == mode_X)),
548 "wrong Proj from Load", 0,
549 show_proj_failure(p);
552 if (proj == pn_Load_X_except)
554 get_irn_pinned(n) == op_pin_state_pinned,
555 "Exception Proj from unpinned Load", 0);
560 * verify a Proj(Store) node
562 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
563 ir_mode *mode = get_irn_mode(p);
564 long proj = get_Proj_proj(p);
567 ((proj == pn_Store_M && mode == mode_M) ||
568 (proj == pn_Store_X_except && mode == mode_X)),
569 "wrong Proj from Store", 0,
570 show_proj_failure(p);
572 if (proj == pn_Store_X_except)
574 get_irn_pinned(n) == op_pin_state_pinned,
575 "Exception Proj from unpinned Store", 0);
580 * verify a Proj(Alloc) node
582 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
583 ir_mode *mode = get_irn_mode(p);
584 long proj = get_Proj_proj(p);
588 (proj == pn_Alloc_M && mode == mode_M) ||
589 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
590 (proj == pn_Alloc_res && mode_is_reference(mode))
592 "wrong Proj from Alloc", 0,
593 show_proj_failure(p);
599 * verify a Proj(Proj) node
601 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
602 ir_mode *mode = get_irn_mode(p);
603 long proj = get_Proj_proj(p);
604 long nr = get_Proj_proj(pred);
605 type *mt; /* A method type */
607 pred = skip_Id(get_Proj_pred(pred));
608 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
610 switch (get_irn_opcode(pred)) {
612 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
614 if (nr == pn_Start_T_args) {
616 (proj >= 0 && mode_is_data(mode)),
617 "wrong Proj from Proj from Start", 0);
619 (proj < get_method_n_params(mt)),
620 "More Projs for args than args in type", 0
622 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
623 /* value argument */ break;
626 (mode == get_type_mode(get_method_param_type(mt, proj))),
627 "Mode of Proj from Start doesn't match mode of param type.", 0,
628 show_proj_mode_failure(p, get_method_param_type(mt, proj));
631 else if (nr == pn_Start_P_value_arg_base) {
633 (proj >= 0 && mode_is_reference(mode)),
634 "wrong Proj from Proj from Start", 0
637 (proj < get_method_n_params(mt)),
638 "More Projs for args than args in type", 0
646 (proj >= 0 && mode_is_data(mode)),
647 "wrong Proj from Proj from Call", 0);
648 mt = get_Call_type(pred);
650 (proj < get_method_n_ress(mt)),
651 "More Projs for results than results in type.", 0);
652 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
653 /* value result */ break;
656 (mode == get_type_mode(get_method_res_type(mt, proj))),
657 "Mode of Proj from Call doesn't match mode of result type.", 0);
666 /* hmm, optimization did not remove it */
670 ASSERT_AND_RET(0, "Unknown opcode", 0);
676 * verify a Proj(Tuple) node
678 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
684 * verify a Proj(CallBegin) node
686 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
691 * verify a Proj(EndReg) node
693 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
694 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
695 "EndReg may only appear if ip view is constructed.", 0);
700 * verify a Proj(EndExcept) node
702 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
703 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
704 "EndExcept may only appear if ip view is constructed.", 0);
712 verify_node_Proj(ir_node *p, ir_graph *irg) {
716 pred = skip_Id(get_Proj_pred(p));
717 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
719 op = get_irn_op(pred);
721 if (op->verify_proj_node)
722 return op->verify_proj_node(pred, p);
729 * verify a Block node
731 static int verify_node_Block(ir_node *n, ir_graph *irg) {
734 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
735 ir_node *pred = get_Block_cfgpred(n, i);
739 (get_irn_mode(pred) == mode_X)
743 /* End block may only have Return, Raise or fragile ops as preds. */
744 if (n == get_irg_end_block(irg))
745 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
746 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
747 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
748 break; /* We can not test properly. How many tuples are there? */
749 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
751 (get_irn_op(pred) == op_Raise) ||
752 is_fragile_op(pred) ),
753 "End Block node", 0);
755 /* irg attr must == graph we are in. */
756 if (! get_interprocedural_view()) {
757 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
763 * verify a Start node
765 static int verify_node_Start(ir_node *n, ir_graph *irg) {
766 ir_mode *mymode = get_irn_mode(n);
769 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
770 mymode == mode_T, "Start node", 0
778 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
779 ir_mode *mymode = get_irn_mode(n);
783 mymode == mode_X, "Jmp node", 0
789 * verify an IJmp node
791 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
792 ir_mode *mymode = get_irn_mode(n);
793 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
796 /* IJmp: BB x ref --> X */
797 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
803 * verify a Break node
805 static int verify_node_Break(ir_node *n, ir_graph *irg) {
806 ir_mode *mymode = get_irn_mode(n);
808 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
809 "Break may only appear if ip view is constructed.", 0);
812 mymode == mode_X, "Break node", 0
820 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
821 ir_mode *mymode = get_irn_mode(n);
822 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
825 /* Cond: BB x b --> X x X */
826 (op1mode == mode_b ||
827 /* Cond: BB x int --> X^n */
828 mode_is_int(op1mode) ), "Cond node", 0
830 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
832 if (op1mode == mode_b && get_irg_outs_state(irg) == outs_consistent) {
833 /* we have consistent outs, check for the right number of Proj's */
835 get_irn_n_outs(n) == 2,
836 "BinaryCond node must have 2 successors", 0);
842 * verify a Return node
844 static int verify_node_Return(ir_node *n, ir_graph *irg) {
846 ir_mode *mymode = get_irn_mode(n);
847 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
850 /* Return: BB x M x data1 x ... x datan --> X */
852 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
854 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
855 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
857 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
858 /* Compare returned results with result types of method type */
859 mt = get_entity_type(get_irg_entity(irg));
860 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
861 "Number of results for Return doesn't match number of results in type.", 0,
862 show_return_nres(irg, n, mt););
863 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
864 type *res_type = get_method_res_type(mt, i);
866 if (is_atomic_type(res_type)) {
868 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
869 "Mode of result for Return doesn't match mode of result type.", 0,
870 show_return_modes(irg, n, mt, i);
875 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
876 "Mode of result for Return doesn't match mode of result type.", 0,
877 show_return_modes(irg, n, mt, i);
885 * verify a Raise node
887 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
888 ir_mode *mymode = get_irn_mode(n);
889 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
890 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
893 /* Sel: BB x M x ref --> X x M */
894 op1mode == mode_M && mode_is_reference(op2mode) &&
895 mymode == mode_T, "Raise node", 0
901 * verify a Const node
903 static int verify_node_Const(ir_node *n, ir_graph *irg) {
904 ir_mode *mymode = get_irn_mode(n);
907 /* Const: BB --> data */
908 (mode_is_data(mymode) ||
909 mymode == mode_b) /* we want boolean constants for static evaluation */
910 ,"Const node", 0 /* of Cmp. */
916 * verify a SymConst node
918 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
919 ir_mode *mymode = get_irn_mode(n);
921 if (get_SymConst_kind(n) == symconst_addr_ent) {
922 entity *ent = get_SymConst_entity(n);
923 if (is_Method_type(get_entity_type(ent)) &&
924 get_irn_irg(n) != get_const_code_irg()) {
926 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
927 "A constant must address an existing method.", 0);
932 /* SymConst: BB --> int*/
933 (mode_is_int(mymode) ||
934 /* SymConst: BB --> ref */
935 mode_is_reference(mymode))
936 ,"SymConst node", 0);
943 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
945 ir_mode *mymode = get_irn_mode(n);
946 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
947 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
951 /* Sel: BB x M x ref x int^n --> ref */
952 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
953 "Sel node", 0, show_node_failure(n)
956 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
957 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
959 ent = get_Sel_entity(n);
960 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
965 * verify an InstOf node
967 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
968 ir_mode *mymode = get_irn_mode(n);
969 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
971 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
972 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
979 static int verify_node_Call(ir_node *n, ir_graph *irg) {
980 ir_mode *mymode = get_irn_mode(n);
981 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
982 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
986 /* Call: BB x M x ref x data1 x ... x datan
987 --> M x datan+1 x ... x data n+m */
988 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
990 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
992 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
993 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
994 "Call node with wrong memory input", 0 );
996 mt = get_Call_type(n);
997 if(get_unknown_type() == mt) {
1001 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1002 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1005 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1006 /* Compare arguments of node with those of type */
1008 if (get_method_variadicity(mt) == variadicity_variadic) {
1010 get_Call_n_params(n) >= get_method_n_params(mt),
1011 "Number of args for Call doesn't match number of args in variadic type.",
1013 fprintf(stderr, "Call has %d params, method %s type %d\n",
1014 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1019 get_Call_n_params(n) == get_method_n_params(mt),
1020 "Number of args for Call doesn't match number of args in non variadic type.",
1024 for (i = 0; i < get_method_n_params(mt); i++) {
1025 type *t = get_method_param_type(mt, i);
1027 if (is_atomic_type(t)) {
1029 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1030 "Mode of arg for Call doesn't match mode of arg type.", 0,
1031 show_call_param(n, mt);
1035 /* call with a compound type, mode must be reference */
1037 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1038 "Mode of arg for Call doesn't match mode of arg type.", 0,
1039 show_call_param(n, mt);
1045 if (Call_has_callees(n)) {
1046 for (i = 0; i < get_Call_n_callees(n); i++) {
1047 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1055 * verify an Add node
1057 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1058 ir_mode *mymode = get_irn_mode(n);
1059 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1060 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1064 /* common Add: BB x numP x numP --> numP */
1065 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1066 /* Pointer Add: BB x ref x int --> ref */
1067 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1068 /* Pointer Add: BB x int x ref --> ref */
1069 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1072 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1073 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1074 "/* Pointer Add: BB x int x ref --> ref */");
1082 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1083 ir_mode *mymode = get_irn_mode(n);
1084 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1085 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1088 /* common Sub: BB x numP x numP --> numP */
1089 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1090 /* Pointer Sub: BB x ref x int --> ref */
1091 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1092 /* Pointer Sub: BB x int x ref --> ref */
1093 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1094 /* Pointer Sub: BB x ref x ref --> int */
1095 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1097 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1098 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1099 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1100 "/* Pointer Sub: BB x ref x ref --> int */" );
1106 * verify a Minus node
1108 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1109 ir_mode *mymode = get_irn_mode(n);
1110 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1113 /* Minus: BB x num --> num */
1114 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1115 show_unop_failure(n , "/* Minus: BB x num --> num */");
1123 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1124 ir_mode *mymode = get_irn_mode(n);
1125 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1126 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1129 /* Mul: BB x int1 x int1 --> int2 */
1130 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1131 /* Mul: BB x float x float --> float */
1132 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1134 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1135 "/* Mul: BB x float x float --> float */");
1141 * verify a Quot node
1143 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1144 ir_mode *mymode = get_irn_mode(n);
1145 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1146 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1147 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1150 /* Quot: BB x M x float x float --> M x X x float */
1151 op1mode == mode_M && op2mode == op3mode &&
1152 get_mode_sort(op2mode) == irms_float_number &&
1155 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1161 * verify a DivMod node
1163 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1164 ir_mode *mymode = get_irn_mode(n);
1165 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1166 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1167 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1170 /* DivMod: BB x M x int x int --> M x X x int x int */
1171 op1mode == mode_M &&
1172 mode_is_int(op2mode) &&
1173 op3mode == op2mode &&
1183 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1184 ir_mode *mymode = get_irn_mode(n);
1185 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1186 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1187 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1190 /* Div: BB x M x int x int --> M x X x int */
1191 op1mode == mode_M &&
1192 op2mode == op3mode &&
1193 mode_is_int(op2mode) &&
1203 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1204 ir_mode *mymode = get_irn_mode(n);
1205 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1206 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1207 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1210 /* Mod: BB x M x int x int --> M x X x int */
1211 op1mode == mode_M &&
1212 op2mode == op3mode &&
1213 mode_is_int(op2mode) &&
1221 * verify an Abs node
1223 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1224 ir_mode *mymode = get_irn_mode(n);
1225 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1228 /* Abs: BB x num --> num */
1229 op1mode == mymode &&
1230 mode_is_num (op1mode),
1232 show_unop_failure(n, "/* Abs: BB x num --> num */");
1238 * verify a logical And, Or, Eor node
1240 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1241 ir_mode *mymode = get_irn_mode(n);
1242 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1243 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1246 /* And or Or or Eor: BB x int x int --> int */
1247 mode_is_int(mymode) &&
1248 op2mode == op1mode &&
1250 "And, Or or Eor node", 0,
1251 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1256 #define verify_node_And verify_node_Logic
1257 #define verify_node_Or verify_node_Logic
1258 #define verify_node_Eor verify_node_Logic
1263 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1264 ir_mode *mymode = get_irn_mode(n);
1265 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1268 /* Not: BB x int --> int */
1269 mode_is_int(mymode) &&
1272 show_unop_failure(n, "/* Not: BB x int --> int */");
1280 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1281 ir_mode *mymode = get_irn_mode(n);
1282 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1283 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1286 /* Cmp: BB x datab x datab --> b16 */
1287 mode_is_data (op1mode) &&
1288 op2mode == op1mode &&
1291 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1297 * verify a Shift node
1299 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1300 ir_mode *mymode = get_irn_mode(n);
1301 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1302 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1305 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1306 mode_is_int(op1mode) &&
1307 mode_is_int(op2mode) &&
1308 !mode_is_signed(op2mode) &&
1310 "Shl, Shr or Shrs node", 0,
1311 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1316 #define verify_node_Shl verify_node_Shift
1317 #define verify_node_Shr verify_node_Shift
1318 #define verify_node_Shrs verify_node_Shift
1323 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1324 ir_mode *mymode = get_irn_mode(n);
1325 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1326 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1329 /* Rot: BB x int x int --> int */
1330 mode_is_int(op1mode) &&
1331 mode_is_int(op2mode) &&
1334 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1340 * verify a Conv node
1342 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1343 ir_mode *mymode = get_irn_mode(n);
1344 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1347 /* Conv: BB x datab1 --> datab2 */
1348 mode_is_datab(op1mode) && mode_is_data(mymode),
1350 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1356 * verify a Cast node
1358 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1359 ir_mode *mymode = get_irn_mode(n);
1360 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1363 /* Conv: BB x datab1 --> datab2 */
1364 mode_is_data(op1mode) && op1mode == mymode,
1366 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1374 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1375 ir_mode *mymode = get_irn_mode(n);
1376 ir_node *block = get_nodes_block(n);
1379 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1380 /* a Phi node MUST have the same number of inputs as its block */
1382 get_irn_arity(n) == get_irn_arity(block),
1383 "wrong number of inputs in Phi node", 0,
1384 show_phi_inputs(n, block);
1388 /* Phi: BB x dataM^n --> dataM */
1389 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1390 ir_node *pred = get_irn_n(n, i);
1391 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1393 get_irn_mode(pred) == mymode,
1395 show_phi_failure(n, pred, i);
1398 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1403 * verify a Filter node
1405 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1406 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1407 "Filter may only appear if ip view is constructed.", 0);
1408 /* We should further do tests as for Proj and Phi. */
1413 * verify a Load node
1415 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1416 ir_mode *mymode = get_irn_mode(n);
1417 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1418 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1421 /* Load: BB x M x ref --> M x X x data */
1422 op1mode == mode_M && mode_is_reference(op2mode),
1425 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1428 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1429 * (Proj (Proj))) sometimes ...
1431 * interprete.c:ai_eval seems to assume that this happens, too
1433 * obset.c:get_abstval_any can't deal with this if the load has
1437 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1438 assert ((NULL != ent) || (mymode != mode_T));
1446 * verify a Store node
1448 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1451 ir_mode *mymode = get_irn_mode(n);
1452 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1453 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1454 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1457 /* Store: BB x M x ref x data --> M x X */
1458 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1461 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1463 target = get_ptr_entity(get_Store_ptr(n));
1464 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1466 * If lowered code, any Sels that add 0 may be removed, causing
1467 * an direct access to entities of array or compound type.
1468 * Prevent this by checking the phase.
1470 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1478 * verify an Alloc node
1480 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1481 ir_mode *mymode = get_irn_mode(n);
1482 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1483 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1486 /* Alloc: BB x M x int_u --> M x X x ref */
1487 op1mode == mode_M &&
1488 mode_is_int(op2mode) &&
1489 !mode_is_signed(op2mode) &&
1492 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1498 * verify a Free node
1500 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1501 ir_mode *mymode = get_irn_mode(n);
1502 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1503 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1504 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1507 /* Free: BB x M x ref x int_u --> M */
1508 op1mode == mode_M && mode_is_reference(op2mode) &&
1509 mode_is_int(op3mode) &&
1510 !mode_is_signed(op3mode) &&
1513 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1519 * verify a Sync node
1521 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1523 ir_mode *mymode = get_irn_mode(n);
1525 /* Sync: BB x M^n --> M */
1526 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1527 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1529 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1534 * verify a Confirm node
1536 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1537 ir_mode *mymode = get_irn_mode(n);
1538 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1539 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1542 /* Confirm: BB x T x T --> T */
1543 op1mode == mymode &&
1546 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1554 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1555 ir_mode *mymode = get_irn_mode(n);
1556 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1557 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1558 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1561 /* Mux: BB x b x numP x numP --> numP */
1562 op1mode == mode_b &&
1563 op2mode == mymode &&
1564 op3mode == mymode &&
1565 mode_is_numP(mymode),
1573 * For each usage of a node, it is checked, if the block of the
1574 * node dominates the block of the usage (for phis: the predecessor
1575 * block of the phi for the corresponding edge).
1577 static int check_dominance_for_node(ir_node *use)
1579 /* This won't work for blocks and the end node */
1580 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1582 ir_node *bl = get_nodes_block(use);
1584 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1585 ir_node *def = get_irn_n(use, i);
1586 ir_node *def_bl = get_nodes_block(def);
1587 ir_node *use_bl = bl;
1589 /* ignore dead definition blocks, will be removed */
1590 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1594 use_bl = get_Block_cfgpred_block(bl, i);
1596 /* ignore dead use blocks, will be removed */
1597 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1601 block_dominates(def_bl, use_bl),
1602 "the definition of a value used violates the dominance property", 0,
1604 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1605 current_ir_graph, def_bl, def, use_bl, use, i
1613 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1618 if (!opt_do_node_verification)
1621 if (!get_interprocedural_view()) {
1623 * do NOT check placement in interprocedural view, as we don't always know
1624 * the "right" graph ...
1627 node_is_in_irgs_storage(irg, n),
1628 "Node is not stored on proper IR graph!", 0,
1629 show_node_on_graph(irg, n);
1631 assert(get_irn_irg(n) == irg);
1636 /* We don't want to test nodes whose predecessors are Bad,
1637 as we would have to special case that for each operation. */
1638 if (op != op_Phi && op != op_Block)
1639 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1640 if (is_Bad(get_irn_n(n, i)))
1644 if (op->verify_node)
1645 return op->verify_node(n, irg);
1651 int irn_vrfy(ir_node *n)
1654 #ifdef DEBUG_libfirm
1655 res = irn_vrfy_irg(n, current_ir_graph);
1660 /*-----------------------------------------------------------------*/
1661 /* Verify the whole graph. */
1662 /*-----------------------------------------------------------------*/
1664 #ifdef DEBUG_libfirm
1666 * Walker to check every node
1668 static void vrfy_wrap(ir_node *node, void *env) {
1670 *res = irn_vrfy(node);
1674 * Walker to check every node including SSA property.
1675 * Only called if dominance info is available.
1677 static void vrfy_wrap_ssa(ir_node *node, void *env)
1681 *res = irn_vrfy(node);
1683 *res = check_dominance_for_node(node);
1686 #endif /* DEBUG_libfirm */
1689 * Calls irn_vrfy for each node in irg.
1690 * Graph must be in state "op_pin_state_pinned".
1691 * If dominance info is available, check the SSA property.
1693 int irg_verify(ir_graph *irg, unsigned flags)
1696 #ifdef DEBUG_libfirm
1699 rem = current_ir_graph;
1700 current_ir_graph = irg;
1701 last_irg_error = NULL;
1703 assert(get_irg_pinned(irg) == op_pin_state_pinned);
1705 if (flags & VRFY_ENFORCE_SSA)
1710 get_irg_dom_state(irg) == dom_consistent &&
1711 get_irg_pinned(irg) == op_pin_state_pinned ?
1712 vrfy_wrap_ssa : vrfy_wrap,
1716 current_ir_graph = rem;
1718 if (opt_do_node_verification == NODE_VERIFICATION_REPORT && ! res) {
1719 entity *ent = get_irg_entity(current_ir_graph);
1722 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1724 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1726 #endif /* DEBUG_libfirm */
1731 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1734 node_verification_t old = opt_do_node_verification;
1736 firm_vrfy_failure_msg = NULL;
1737 opt_do_node_verification = NODE_VERIFICATION_ERROR_ONLY;
1738 res = irn_vrfy_irg(n, irg);
1739 if (! res && get_irg_dom_state(irg) == dom_consistent &&
1740 get_irg_pinned(irg) == op_pin_state_pinned)
1741 res = check_dominance_for_node(n);
1742 opt_do_node_verification = old;
1743 *bad_string = firm_vrfy_failure_msg;
1749 typedef struct _vrfy_bad_env_t {
1755 * Pre-Walker: check Bad predecessors of node.
1757 static void check_bads(ir_node *node, void *env)
1759 vrfy_bad_env_t *venv = env;
1760 int i, arity = get_irn_arity(node);
1762 if (is_Block(node)) {
1763 if ((venv->flags & BAD_CF) == 0) {
1765 /* check for Bad Block predecessor */
1766 for (i = 0; i < arity; ++i) {
1767 ir_node *pred = get_irn_n(node, i);
1770 venv->res |= BAD_CF;
1772 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1773 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1775 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1776 assert(0 && "Bad CF detected");
1783 if ((venv->flags & BAD_BLOCK) == 0) {
1785 /* check for Bad Block */
1786 if (is_Bad(get_nodes_block(node))) {
1787 venv->res |= BAD_BLOCK;
1789 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1790 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1792 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1793 assert(0 && "Bad CF detected");
1798 if ((venv->flags & TUPLE) == 0) {
1799 if (get_irn_op(node) == op_Tuple) {
1802 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1803 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1805 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1806 assert(0 && "Tuple detected");
1811 for (i = 0; i < arity; ++i) {
1812 ir_node *pred = get_irn_n(node, i);
1815 /* check for Phi with Bad inputs */
1816 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1817 if (venv->flags & BAD_CF)
1820 venv->res |= BAD_CF;
1822 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1823 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1825 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1826 assert(0 && "Bad CF detected");
1831 /* Bad node input */
1832 if ((venv->flags & BAD_DF) == 0) {
1833 venv->res |= BAD_DF;
1835 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1836 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1838 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1839 assert(0 && "Bad NON-CF detected");
1848 * verify occurance of bad nodes
1850 int irg_vrfy_bads(ir_graph *irg, int flags)
1857 irg_walk_graph(irg, check_bads, NULL, &env);
1863 * set the default verify operation
1865 void firm_set_default_verifyer(ir_op *op)
1869 op->verify_node = verify_node_##a; \
1917 op->verify_node = NULL;
1923 op->verify_proj_node = verify_node_Proj_##a; \
1946 op->verify_proj_node = NULL;