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"
26 /** if this flag is set, verify entity types in Load & Store nodes */
27 static int vrfy_entities = 0;
29 node_verification_t opt_do_node_verification = NODE_VERIFICATION_ON;
30 const char *firm_vrfy_failure_msg;
32 /* enable verification of Load/Store entities */
33 void vrfy_enable_entity_tests(int enable) {
34 vrfy_entities = enable;
38 * little helper for NULL modes
40 static const char *get_mode_name_ex(ir_mode *mode) {
43 return get_mode_name(mode);
46 void do_node_verification(node_verification_t mode) {
47 opt_do_node_verification = mode;
50 /** the last IRG, on which a verify error was found */
51 static ir_graph *last_irg_error = NULL;
54 * print the name of the entity of an verification failure
56 static void show_entity_failure(ir_node *node)
58 ir_graph *irg = get_irn_irg(node);
60 if (last_irg_error == irg)
65 if (irg == get_const_code_irg()) {
66 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
69 entity *ent = get_irg_entity(irg);
72 type *ent_type = get_entity_owner(ent);
75 if (ent_type == get_glob_type())
76 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
78 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
81 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
85 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
91 * Prints a failure for a Node
93 static void show_node_failure(ir_node *n)
95 show_entity_failure(n);
96 fprintf(stderr, " node %ld %s%s\n" ,
98 get_irn_opname(n), get_irn_modename(n)
103 * Prints a failure message for a binop
105 static void show_binop_failure(ir_node *n, const char *text)
107 ir_node *left = get_binop_left(n);
108 ir_node *right = get_binop_right(n);
110 show_entity_failure(n);
111 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
113 get_irn_opname(n), get_irn_modename(n),
114 get_irn_opname(left), get_irn_modename(left),
115 get_irn_opname(right), get_irn_modename(right),
120 * Prints a failure message for an unop
122 static void show_unop_failure(ir_node *n, const char *text)
124 ir_node *op = get_unop_op(n);
126 show_entity_failure(n);
127 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
129 get_irn_opname(n), get_irn_modename(n),
130 get_irn_opname(op), get_irn_modename(op),
135 * Prints a failure message for an op with 3 operands
137 static void show_triop_failure(ir_node *n, const char *text)
139 ir_node *op0 = get_irn_n(n, 0);
140 ir_node *op1 = get_irn_n(n, 1);
141 ir_node *op2 = get_irn_n(n, 2);
143 show_entity_failure(n);
144 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
146 get_irn_opname(n), get_irn_modename(n),
147 get_irn_opname(op0), get_irn_modename(op0),
148 get_irn_opname(op1), get_irn_modename(op1),
149 get_irn_opname(op2), get_irn_modename(op2),
154 * Prints a failure message for a proj
156 static void show_proj_failure(ir_node *n)
158 ir_node *op = get_Proj_pred(n);
159 int proj = get_Proj_proj(n);
161 show_entity_failure(n);
162 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
164 get_irn_opname(n), get_irn_modename(n), proj,
165 get_irn_opname(op), get_irn_modename(op));
169 * Prints a failure message for a proj from Start
171 static void show_proj_mode_failure(ir_node *n, type *ty)
173 long proj = get_Proj_proj(n);
174 ir_mode *m = get_type_mode(ty);
176 show_entity_failure(n);
177 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
182 get_mode_name_ex(m));
186 * Prints a failure message for a proj
188 static void show_proj_failure_ent(ir_node *n, entity *ent)
190 ir_node *op = get_Proj_pred(n);
191 int proj = get_Proj_proj(n);
192 ir_mode *m = get_type_mode(get_entity_type(ent));
194 show_entity_failure(n);
195 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
197 get_irn_opname(n), get_irn_modename(n), proj,
198 get_irn_opname(op), get_irn_modename(op),
199 get_entity_name(ent), get_type_name(get_entity_type(ent)),
200 get_mode_name_ex(m));
204 * Show a node and a graph
206 static void show_node_on_graph(ir_graph *irg, ir_node *n)
208 entity *ent = get_irg_entity(irg);
211 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of entity %s, node %ld %s%s\n",
212 get_entity_name(ent),
213 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
215 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of graph %p, node %ld %s%s\n",
217 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
223 static void show_call_param(ir_node *n, type *mt)
227 show_entity_failure(n);
228 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
229 for (i = 0; i < get_method_n_params(mt); ++i) {
230 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
232 fprintf(stderr, ") != CALL(");
234 for (i = 0; i < get_Call_n_params(n); ++i) {
235 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
237 fprintf(stderr, ")\n");
244 static void show_return_modes(ir_graph *irg, ir_node *n, type *mt, int i)
246 entity *ent = get_irg_entity(irg);
248 show_entity_failure(n);
249 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
250 get_irn_node_nr(n), get_entity_name(ent),
251 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
252 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
257 * Show return number of results
259 static void show_return_nres(ir_graph *irg, ir_node *n, type *mt)
261 entity *ent = get_irg_entity(irg);
263 show_entity_failure(n);
264 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
265 get_irn_node_nr(n), get_entity_name(ent),
266 get_Return_n_ress(n), get_method_n_ress(mt));
272 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
274 show_entity_failure(phi);
275 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
276 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
277 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
283 static void show_phi_inputs(ir_node *phi, ir_node *block)
285 show_entity_failure(phi);
286 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
287 get_irn_node_nr(phi), get_irn_arity(phi),
288 get_irn_node_nr(block), get_irn_arity(block));
291 /** If the address is Sel or SymConst, return the entity. */
292 static entity *get_ptr_entity(ir_node *ptr) {
293 if (get_irn_op(ptr) == op_Sel) {
294 return get_Sel_entity(ptr);
295 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
296 return get_SymConst_entity(ptr);
302 * verify a Proj(Start) node
304 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
305 ir_mode *mode = get_irn_mode(p);
306 long proj = get_Proj_proj(p);
310 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
311 (proj == pn_Start_M && mode == mode_M) ||
312 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
313 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
314 (proj == pn_Start_T_args && mode == mode_T) ||
315 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
316 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
318 "wrong Proj from Start", 0,
319 show_proj_failure(p);
325 * verify a Proj(Cond) node
327 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
328 ir_mode *mode = get_irn_mode(p);
329 long proj = get_Proj_proj(p);
333 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
334 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
335 is_Bad(get_Cond_selector(pred)) /* rare */
337 "wrong Proj from Cond", 0,
338 show_proj_failure(p);
344 * verify a Proj(Raise) node
346 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
347 ir_mode *mode = get_irn_mode(p);
348 long proj = get_Proj_proj(p);
351 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
352 "wrong Proj from Raise", 0,
353 show_proj_failure(p);
359 * verify a Proj(InstOf) node
361 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
362 ir_mode *mode = get_irn_mode(p);
363 long proj = get_Proj_proj(p);
366 (proj >= 0 && mode == mode_X),
367 "wrong Proj from InstOf", 0,
368 show_proj_failure(p);
374 * verify a Proj(Call) node
376 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
377 ir_mode *mode = get_irn_mode(p);
378 long proj = get_Proj_proj(p);
381 ((proj == pn_Call_M_regular && mode == mode_M) ||
382 (proj == pn_Call_X_except && mode == mode_X) ||
383 (proj == pn_Call_T_result && mode == mode_T) ||
384 (proj == pn_Call_M_except && mode == mode_M) ||
385 (proj == pn_Call_P_value_res_base && mode == mode_P)),
386 "wrong Proj from Call", 0,
387 show_proj_failure(p);
389 if (proj == pn_Call_X_except)
391 get_irn_op(get_Call_mem(n)) != op_NoMem,
392 "Exception Proj from FunctionCall", 0);
393 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
395 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
396 "Memory Proj from FunctionCall", 0);
401 * verify a Proj(Quot) node
403 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
404 ir_mode *mode = get_irn_mode(p);
405 long proj = get_Proj_proj(p);
408 ((proj == pn_Quot_M && mode == mode_M) ||
409 (proj == pn_Quot_X_except && mode == mode_X) ||
410 (proj == pn_Quot_res && mode_is_float(mode))),
411 "wrong Proj from Quot", 0,
412 show_proj_failure(p);
414 if (proj == pn_Quot_X_except)
416 get_irn_pinned(n) == op_pin_state_pinned,
417 "Exception Proj from unpinned Quot", 0);
418 else if (proj == pn_Quot_M)
420 get_irn_pinned(n) == op_pin_state_pinned,
421 "Memory Proj from unpinned Quot", 0);
426 * verify a Proj(DivMod) node
428 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
429 ir_mode *mode = get_irn_mode(p);
430 long proj = get_Proj_proj(p);
433 ((proj == pn_DivMod_M && mode == mode_M) ||
434 (proj == pn_DivMod_X_except && mode == mode_X) ||
435 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
436 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
437 "wrong Proj from DivMod", 0,
438 show_proj_failure(p);
440 if (proj == pn_DivMod_X_except)
442 get_irn_pinned(n) == op_pin_state_pinned,
443 "Exception Proj from unpinned DivMod", 0);
444 else if (proj == pn_DivMod_M)
446 get_irn_pinned(n) == op_pin_state_pinned,
447 "Memory Proj from unpinned DivMod", 0);
452 * verify a Proj(Div) node
454 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
455 ir_mode *mode = get_irn_mode(p);
456 long proj = get_Proj_proj(p);
459 ((proj == pn_Div_M && mode == mode_M) ||
460 (proj == pn_Div_X_except && mode == mode_X) ||
461 (proj == pn_Div_res && mode_is_int(mode))),
462 "wrong Proj from Div", 0,
463 show_proj_failure(p);
465 if (proj == pn_Div_X_except)
467 get_irn_pinned(n) == op_pin_state_pinned,
468 "Exception Proj from unpinned Div", 0);
469 else if (proj == pn_Div_M)
471 get_irn_pinned(n) == op_pin_state_pinned,
472 "Memory Proj from unpinned Div", 0);
477 * verify a Proj(Mod) node
479 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
480 ir_mode *mode = get_irn_mode(p);
481 long proj = get_Proj_proj(p);
484 ((proj == pn_Mod_M && mode == mode_M) ||
485 (proj == pn_Mod_X_except && mode == mode_X) ||
486 (proj == pn_Mod_res && mode_is_int(mode))),
487 "wrong Proj from Mod", 0,
488 show_proj_failure(p);
490 if (proj == pn_Mod_X_except)
492 get_irn_pinned(n) == op_pin_state_pinned,
493 "Exception Proj from unpinned Mod", 0);
494 else if (proj == pn_Mod_M)
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Memory Proj from unpinned Div", 0);
502 * verify a Proj(Cmp) node
504 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
505 ir_mode *mode = get_irn_mode(p);
506 long proj = get_Proj_proj(p);
509 (proj >= 0 && proj <= 15 && mode == mode_b),
510 "wrong Proj from Cmp", 0,
511 show_proj_failure(p);
517 * verify a Proj(Load) node
519 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
520 ir_mode *mode = get_irn_mode(p);
521 long proj = get_Proj_proj(p);
523 if (proj == pn_Load_res) {
524 ir_node *ptr = get_Load_ptr(n);
525 entity *ent = get_ptr_entity(ptr);
527 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
528 /* do NOT check this for lowered phases, see comment on Store */
530 (mode == get_type_mode(get_entity_type(ent))),
531 "wrong data Proj from Load, entity type_mode failed", 0,
532 show_proj_failure_ent(p, ent);
537 mode_is_data(mode) && mode == get_Load_mode(n),
538 "wrong data Proj from Load", 0,
539 show_proj_failure(p);
545 ((proj == pn_Load_M && mode == mode_M) ||
546 (proj == pn_Load_X_except && mode == mode_X)),
547 "wrong Proj from Load", 0,
548 show_proj_failure(p);
551 if (proj == pn_Load_X_except)
553 get_irn_pinned(n) == op_pin_state_pinned,
554 "Exception Proj from unpinned Load", 0);
559 * verify a Proj(Store) node
561 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
562 ir_mode *mode = get_irn_mode(p);
563 long proj = get_Proj_proj(p);
566 ((proj == pn_Store_M && mode == mode_M) ||
567 (proj == pn_Store_X_except && mode == mode_X)),
568 "wrong Proj from Store", 0,
569 show_proj_failure(p);
571 if (proj == pn_Store_X_except)
573 get_irn_pinned(n) == op_pin_state_pinned,
574 "Exception Proj from unpinned Store", 0);
579 * verify a Proj(Alloc) node
581 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
582 ir_mode *mode = get_irn_mode(p);
583 long proj = get_Proj_proj(p);
587 (proj == pn_Alloc_M && mode == mode_M) ||
588 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
589 (proj == pn_Alloc_res && mode_is_reference(mode))
591 "wrong Proj from Alloc", 0,
592 show_proj_failure(p);
598 * verify a Proj(Proj) node
600 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
601 ir_mode *mode = get_irn_mode(p);
602 long proj = get_Proj_proj(p);
603 long nr = get_Proj_proj(pred);
604 type *mt; /* A method type */
606 pred = skip_Id(get_Proj_pred(pred));
607 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
609 switch (get_irn_opcode(pred)) {
611 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
613 if (nr == pn_Start_T_args) {
615 (proj >= 0 && mode_is_data(mode)),
616 "wrong Proj from Proj from Start", 0);
618 (proj < get_method_n_params(mt)),
619 "More Projs for args than args in type", 0
621 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
622 /* value argument */ break;
625 (mode == get_type_mode(get_method_param_type(mt, proj))),
626 "Mode of Proj from Start doesn't match mode of param type.", 0,
627 show_proj_mode_failure(p, get_method_param_type(mt, proj));
630 else if (nr == pn_Start_P_value_arg_base) {
632 (proj >= 0 && mode_is_reference(mode)),
633 "wrong Proj from Proj from Start", 0
636 (proj < get_method_n_params(mt)),
637 "More Projs for args than args in type", 0
645 (proj >= 0 && mode_is_data(mode)),
646 "wrong Proj from Proj from Call", 0);
647 mt = get_Call_type(pred);
649 (proj < get_method_n_ress(mt)),
650 "More Projs for results than results in type.", 0);
651 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
652 /* value result */ break;
655 (mode == get_type_mode(get_method_res_type(mt, proj))),
656 "Mode of Proj from Call doesn't match mode of result type.", 0);
665 /* hmm, optimization did not remove it */
669 ASSERT_AND_RET(0, "Unknown opcode", 0);
675 * verify a Proj(Tuple) node
677 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
683 * verify a Proj(CallBegin) node
685 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
690 * verify a Proj(EndReg) node
692 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
693 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
694 "EndReg may only appear if ip view is constructed.", 0);
699 * verify a Proj(EndExcept) node
701 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
702 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
703 "EndExcept may only appear if ip view is constructed.", 0);
711 verify_node_Proj(ir_node *p, ir_graph *irg) {
715 pred = skip_Id(get_Proj_pred(p));
716 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
718 op = get_irn_op(pred);
720 if (op->verify_proj_node)
721 return op->verify_proj_node(pred, p);
728 * verify a Block node
730 static int verify_node_Block(ir_node *n, ir_graph *irg) {
733 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
734 ir_node *pred = get_Block_cfgpred(n, i);
738 (get_irn_mode(pred) == mode_X)
742 /* End block may only have Return, Raise or fragile ops as preds. */
743 if (n == get_irg_end_block(irg))
744 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
745 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
746 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
747 break; /* We can not test properly. How many tuples are there? */
748 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
750 (get_irn_op(pred) == op_Raise) ||
751 is_fragile_op(pred) ),
752 "End Block node", 0);
754 /* irg attr must == graph we are in. */
755 if (! get_interprocedural_view()) {
756 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
762 * verify a Start node
764 static int verify_node_Start(ir_node *n, ir_graph *irg) {
765 ir_mode *mymode = get_irn_mode(n);
768 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
769 mymode == mode_T, "Start node", 0
777 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
778 ir_mode *mymode = get_irn_mode(n);
782 mymode == mode_X, "Jmp node", 0
788 * verify an IJmp node
790 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
791 ir_mode *mymode = get_irn_mode(n);
792 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
795 /* IJmp: BB x ref --> X */
796 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
802 * verify a Break node
804 static int verify_node_Break(ir_node *n, ir_graph *irg) {
805 ir_mode *mymode = get_irn_mode(n);
807 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
808 "Break may only appear if ip view is constructed.", 0);
811 mymode == mode_X, "Break node", 0
819 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
820 ir_mode *mymode = get_irn_mode(n);
821 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
824 /* Cond: BB x b --> X x X */
825 (op1mode == mode_b ||
826 /* Cond: BB x int --> X^n */
827 mode_is_int(op1mode) ), "Cond node", 0
829 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
834 * verify a Return node
836 static int verify_node_Return(ir_node *n, ir_graph *irg) {
838 ir_mode *mymode = get_irn_mode(n);
839 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
842 /* Return: BB x M x data1 x ... x datan --> X */
844 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
846 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
847 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
849 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
850 /* Compare returned results with result types of method type */
851 mt = get_entity_type(get_irg_entity(irg));
852 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
853 "Number of results for Return doesn't match number of results in type.", 0,
854 show_return_nres(irg, n, mt););
855 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
856 type *res_type = get_method_res_type(mt, i);
858 if (is_atomic_type(res_type)) {
860 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
861 "Mode of result for Return doesn't match mode of result type.", 0,
862 show_return_modes(irg, n, mt, i);
867 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
868 "Mode of result for Return doesn't match mode of result type.", 0,
869 show_return_modes(irg, n, mt, i);
877 * verify a Raise node
879 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
880 ir_mode *mymode = get_irn_mode(n);
881 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
882 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
885 /* Sel: BB x M x ref --> X x M */
886 op1mode == mode_M && mode_is_reference(op2mode) &&
887 mymode == mode_T, "Raise node", 0
893 * verify a Const node
895 static int verify_node_Const(ir_node *n, ir_graph *irg) {
896 ir_mode *mymode = get_irn_mode(n);
899 /* Const: BB --> data */
900 (mode_is_data(mymode) ||
901 mymode == mode_b) /* we want boolean constants for static evaluation */
902 ,"Const node", 0 /* of Cmp. */
908 * verify a SymConst node
910 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
911 ir_mode *mymode = get_irn_mode(n);
913 if (get_SymConst_kind(n) == symconst_addr_ent) {
914 entity *ent = get_SymConst_entity(n);
915 if (is_Method_type(get_entity_type(ent)) &&
916 get_irn_irg(n) != get_const_code_irg()) {
918 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
919 "A constant must address an existing method.", 0);
924 /* SymConst: BB --> int*/
925 (mode_is_int(mymode) ||
926 /* SymConst: BB --> ref */
927 mode_is_reference(mymode))
928 ,"SymConst node", 0);
935 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
937 ir_mode *mymode = get_irn_mode(n);
938 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
939 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
943 /* Sel: BB x M x ref x int^n --> ref */
944 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
945 "Sel node", 0, show_node_failure(n)
948 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
949 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
951 ent = get_Sel_entity(n);
952 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
957 * verify an InstOf node
959 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
960 ir_mode *mymode = get_irn_mode(n);
961 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
963 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
964 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
971 static int verify_node_Call(ir_node *n, ir_graph *irg) {
972 ir_mode *mymode = get_irn_mode(n);
973 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
974 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
978 /* Call: BB x M x ref x data1 x ... x datan
979 --> M x datan+1 x ... x data n+m */
980 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
982 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
984 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
985 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
986 "Call node with wrong memory input", 0 );
988 mt = get_Call_type(n);
989 if(get_unknown_type() == mt) {
993 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
994 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
997 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
998 /* Compare arguments of node with those of type */
1000 if (get_method_variadicity(mt) == variadicity_variadic) {
1002 get_Call_n_params(n) >= get_method_n_params(mt),
1003 "Number of args for Call doesn't match number of args in variadic type.",
1005 fprintf(stderr, "Call has %d params, method %s type %d\n",
1006 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1011 get_Call_n_params(n) == get_method_n_params(mt),
1012 "Number of args for Call doesn't match number of args in non variadic type.",
1016 for (i = 0; i < get_method_n_params(mt); i++) {
1017 type *t = get_method_param_type(mt, i);
1019 if (is_atomic_type(t)) {
1021 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1022 "Mode of arg for Call doesn't match mode of arg type.", 0,
1023 show_call_param(n, mt);
1027 /* call with a compound type, mode must be reference */
1029 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1030 "Mode of arg for Call doesn't match mode of arg type.", 0,
1031 show_call_param(n, mt);
1037 if (Call_has_callees(n)) {
1038 for (i = 0; i < get_Call_n_callees(n); i++) {
1039 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1047 * verify an Add node
1049 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1050 ir_mode *mymode = get_irn_mode(n);
1051 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1052 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1056 /* common Add: BB x numP x numP --> numP */
1057 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1058 /* Pointer Add: BB x ref x int --> ref */
1059 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1060 /* Pointer Add: BB x int x ref --> ref */
1061 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1064 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1065 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1066 "/* Pointer Add: BB x int x ref --> ref */");
1074 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1075 ir_mode *mymode = get_irn_mode(n);
1076 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1077 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1080 /* common Sub: BB x numP x numP --> numP */
1081 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1082 /* Pointer Sub: BB x ref x int --> ref */
1083 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1084 /* Pointer Sub: BB x int x ref --> ref */
1085 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1086 /* Pointer Sub: BB x ref x ref --> int */
1087 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1089 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1090 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1091 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1092 "/* Pointer Sub: BB x ref x ref --> int */" );
1098 * verify a Minus node
1100 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1101 ir_mode *mymode = get_irn_mode(n);
1102 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1105 /* Minus: BB x num --> num */
1106 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1107 show_unop_failure(n , "/* Minus: BB x num --> num */");
1115 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1116 ir_mode *mymode = get_irn_mode(n);
1117 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1118 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1121 /* Mul: BB x int1 x int1 --> int2 */
1122 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1123 /* Mul: BB x float x float --> float */
1124 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1126 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1127 "/* Mul: BB x float x float --> float */");
1133 * verify a Quot node
1135 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1136 ir_mode *mymode = get_irn_mode(n);
1137 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1138 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1139 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1142 /* Quot: BB x M x float x float --> M x X x float */
1143 op1mode == mode_M && op2mode == op3mode &&
1144 get_mode_sort(op2mode) == irms_float_number &&
1147 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1153 * verify a DivMod node
1155 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1156 ir_mode *mymode = get_irn_mode(n);
1157 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1158 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1159 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1162 /* DivMod: BB x M x int x int --> M x X x int x int */
1163 op1mode == mode_M &&
1164 mode_is_int(op2mode) &&
1165 op3mode == op2mode &&
1175 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1176 ir_mode *mymode = get_irn_mode(n);
1177 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1178 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1179 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1182 /* Div: BB x M x int x int --> M x X x int */
1183 op1mode == mode_M &&
1184 op2mode == op3mode &&
1185 mode_is_int(op2mode) &&
1195 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1196 ir_mode *mymode = get_irn_mode(n);
1197 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1198 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1199 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1202 /* Mod: BB x M x int x int --> M x X x int */
1203 op1mode == mode_M &&
1204 op2mode == op3mode &&
1205 mode_is_int(op2mode) &&
1213 * verify an Abs node
1215 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1216 ir_mode *mymode = get_irn_mode(n);
1217 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1220 /* Abs: BB x num --> num */
1221 op1mode == mymode &&
1222 mode_is_num (op1mode),
1224 show_unop_failure(n, "/* Abs: BB x num --> num */");
1230 * verify a logical And, Or, Eor node
1232 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1233 ir_mode *mymode = get_irn_mode(n);
1234 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1235 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1238 /* And or Or or Eor: BB x int x int --> int */
1239 mode_is_int(mymode) &&
1240 op2mode == op1mode &&
1242 "And, Or or Eor node", 0,
1243 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1248 #define verify_node_And verify_node_Logic
1249 #define verify_node_Or verify_node_Logic
1250 #define verify_node_Eor verify_node_Logic
1255 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1256 ir_mode *mymode = get_irn_mode(n);
1257 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1260 /* Not: BB x int --> int */
1261 mode_is_int(mymode) &&
1264 show_unop_failure(n, "/* Not: BB x int --> int */");
1272 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1273 ir_mode *mymode = get_irn_mode(n);
1274 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1275 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1278 /* Cmp: BB x datab x datab --> b16 */
1279 mode_is_data (op1mode) &&
1280 op2mode == op1mode &&
1283 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1289 * verify a Shift node
1291 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1292 ir_mode *mymode = get_irn_mode(n);
1293 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1294 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1297 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1298 mode_is_int(op1mode) &&
1299 mode_is_int(op2mode) &&
1300 !mode_is_signed(op2mode) &&
1302 "Shl, Shr or Shrs node", 0,
1303 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1308 #define verify_node_Shl verify_node_Shift
1309 #define verify_node_Shr verify_node_Shift
1310 #define verify_node_Shrs verify_node_Shift
1315 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1316 ir_mode *mymode = get_irn_mode(n);
1317 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1318 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1321 /* Rot: BB x int x int --> int */
1322 mode_is_int(op1mode) &&
1323 mode_is_int(op2mode) &&
1326 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1332 * verify a Conv node
1334 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1335 ir_mode *mymode = get_irn_mode(n);
1336 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1339 /* Conv: BB x datab1 --> datab2 */
1340 mode_is_datab(op1mode) && mode_is_data(mymode),
1342 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1348 * verify a Cast node
1350 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1351 ir_mode *mymode = get_irn_mode(n);
1352 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1355 /* Conv: BB x datab1 --> datab2 */
1356 mode_is_data(op1mode) && op1mode == mymode,
1358 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1366 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1367 ir_mode *mymode = get_irn_mode(n);
1368 ir_node *block = get_nodes_block(n);
1371 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1372 /* a Phi node MUST have the same number of inputs as its block */
1374 get_irn_arity(n) == get_irn_arity(block),
1375 "wrong number of inputs in Phi node", 0,
1376 show_phi_inputs(n, block);
1380 /* Phi: BB x dataM^n --> dataM */
1381 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1382 ir_node *pred = get_irn_n(n, i);
1383 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1385 get_irn_mode(pred) == mymode,
1387 show_phi_failure(n, pred, i);
1390 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1395 * verify a Filter node
1397 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1398 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1399 "Filter may only appear if ip view is constructed.", 0);
1400 /* We should further do tests as for Proj and Phi. */
1405 * verify a Load node
1407 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1408 ir_mode *mymode = get_irn_mode(n);
1409 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1410 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1413 /* Load: BB x M x ref --> M x X x data */
1414 op1mode == mode_M && mode_is_reference(op2mode),
1417 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1420 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1421 * (Proj (Proj))) sometimes ...
1423 * interprete.c:ai_eval seems to assume that this happens, too
1425 * obset.c:get_abstval_any can't deal with this if the load has
1429 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1430 assert ((NULL != ent) || (mymode != mode_T));
1438 * verify a Store node
1440 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1443 ir_mode *mymode = get_irn_mode(n);
1444 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1445 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1446 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1449 /* Store: BB x M x ref x data --> M x X */
1450 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1453 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1455 target = get_ptr_entity(get_Store_ptr(n));
1456 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1458 * If lowered code, any Sels that add 0 may be removed, causing
1459 * an direct access to entities of array or compound type.
1460 * Prevent this by checking the phase.
1462 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1470 * verify an Alloc node
1472 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1473 ir_mode *mymode = get_irn_mode(n);
1474 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1475 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1478 /* Alloc: BB x M x int_u --> M x X x ref */
1479 op1mode == mode_M &&
1480 mode_is_int(op2mode) &&
1481 !mode_is_signed(op2mode) &&
1484 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1490 * verify a Free node
1492 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1493 ir_mode *mymode = get_irn_mode(n);
1494 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1495 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1496 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1499 /* Free: BB x M x ref x int_u --> M */
1500 op1mode == mode_M && mode_is_reference(op2mode) &&
1501 mode_is_int(op3mode) &&
1502 !mode_is_signed(op3mode) &&
1505 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1511 * verify a Sync node
1513 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1515 ir_mode *mymode = get_irn_mode(n);
1517 /* Sync: BB x M^n --> M */
1518 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1519 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1521 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1526 * verify a Confirm node
1528 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1529 ir_mode *mymode = get_irn_mode(n);
1530 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1531 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1534 /* Confirm: BB x T x T --> T */
1535 op1mode == mymode &&
1538 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1546 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1547 ir_mode *mymode = get_irn_mode(n);
1548 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1549 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1550 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1553 /* Mux: BB x b x numP x numP --> numP */
1554 op1mode == mode_b &&
1555 op2mode == mymode &&
1556 op3mode == mymode &&
1557 mode_is_numP(mymode),
1565 * For each usage of a node, it is checked, if the block of the
1566 * node dominates the block of the usage (for phis: the predecessor
1567 * block of the phi for the corresponding edge).
1569 static int check_dominance_for_node(ir_node *irn)
1571 /* This won't work for blocks and the end node */
1572 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
1574 ir_node *bl = get_nodes_block(irn);
1576 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
1577 ir_node *op = get_irn_n(irn, i);
1578 ir_node *def_bl = get_nodes_block(op);
1579 ir_node *use_bl = bl;
1582 use_bl = get_Block_cfgpred_block(bl, i);
1584 ASSERT_AND_RET(block_dominates(def_bl, use_bl),
1585 "the definition of a value used violates the dominance property", 0);
1593 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1598 if (!opt_do_node_verification)
1601 if (!get_interprocedural_view()) {
1603 * do NOT check placement in interprocedural view, as we don't always know
1604 * the "right" graph ...
1607 node_is_in_irgs_storage(irg, n),
1608 "Node is not stored on proper IR graph!", 0,
1609 show_node_on_graph(irg, n);
1611 assert(get_irn_irg(n) == irg);
1616 /* We don't want to test nodes whose predecessors are Bad,
1617 as we would have to special case that for each operation. */
1618 if (op != op_Phi && op != op_Block)
1619 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1620 if (is_Bad(get_irn_n(n, i)))
1625 * Check, if the dominance property is fulfilled
1626 * for all operands of the node.
1628 if(get_irg_dom_state(irg) == dom_consistent)
1629 check_dominance_for_node(n);
1631 if (op->verify_node)
1632 return op->verify_node(n, irg);
1638 int irn_vrfy(ir_node *n)
1641 #ifdef DEBUG_libfirm
1642 res = irn_vrfy_irg(n, current_ir_graph);
1647 /*-----------------------------------------------------------------*/
1648 /* Verify the whole graph. */
1649 /*-----------------------------------------------------------------*/
1651 /* This *is* used, except gcc doesn't notice that */
1652 static void vrfy_wrap(ir_node *node, void *env)
1656 *res = irn_vrfy(node);
1659 int irg_vrfy(ir_graph *irg)
1662 #ifdef DEBUG_libfirm
1665 rem = current_ir_graph;
1666 current_ir_graph = irg;
1667 last_irg_error = NULL;
1669 assert(get_irg_pinned(irg) == op_pin_state_pinned);
1671 irg_walk_graph(irg, vrfy_wrap, NULL, &res);
1673 current_ir_graph = rem;
1675 if (opt_do_node_verification == NODE_VERIFICATION_REPORT && ! res) {
1676 entity *ent = get_irg_entity(current_ir_graph);
1679 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1681 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1684 if(get_irg_dom_state(irg) == dom_consistent) {
1693 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1696 node_verification_t old = opt_do_node_verification;
1698 firm_vrfy_failure_msg = NULL;
1699 opt_do_node_verification = NODE_VERIFICATION_ERROR_ONLY;
1700 res = irn_vrfy_irg(n, irg);
1701 opt_do_node_verification = old;
1702 *bad_string = firm_vrfy_failure_msg;
1708 typedef struct _vrfy_bad_env_t {
1713 static void check_bads(ir_node *node, void *env)
1715 vrfy_bad_env_t *venv = env;
1716 int i, arity = get_irn_arity(node);
1718 if (is_Block(node)) {
1719 if ((venv->flags & BAD_CF) == 0) {
1721 /* check for Bad Block predecessor */
1722 for (i = 0; i < arity; ++i) {
1723 ir_node *pred = get_irn_n(node, i);
1726 venv->res |= BAD_CF;
1728 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1729 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1731 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1732 assert(0 && "Bad CF detected");
1739 if ((venv->flags & BAD_BLOCK) == 0) {
1741 /* check for Bad Block */
1742 if (is_Bad(get_nodes_block(node))) {
1743 venv->res |= BAD_BLOCK;
1745 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1746 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1748 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1749 assert(0 && "Bad CF detected");
1754 if ((venv->flags & TUPLE) == 0) {
1755 if (get_irn_op(node) == op_Tuple) {
1758 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1759 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1761 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1762 assert(0 && "Tuple detected");
1767 for (i = 0; i < arity; ++i) {
1768 ir_node *pred = get_irn_n(node, i);
1771 /* check for Phi with Bad inputs */
1772 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1773 if (venv->flags & BAD_CF)
1776 venv->res |= BAD_CF;
1778 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1779 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1781 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1782 assert(0 && "Bad CF detected");
1787 /* Bad node input */
1788 if ((venv->flags & BAD_DF) == 0) {
1789 venv->res |= BAD_DF;
1791 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1792 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1794 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1795 assert(0 && "Bad NON-CF detected");
1804 * verify occurance of bad nodes
1806 int irg_vrfy_bads(ir_graph *irg, int flags)
1813 irg_walk_graph(irg, check_bads, NULL, &env);
1819 * set the default verify operation
1821 void firm_set_default_verifyer(ir_op *op)
1825 op->verify_node = verify_node_##a; \
1873 op->verify_node = NULL;
1879 op->verify_proj_node = verify_node_Proj_##a; \
1902 op->verify_proj_node = NULL;