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 /** if this flag is set, verify entity types in Load & Store nodes */
26 static int vrfy_entities = 0;
28 node_verification_t opt_do_node_verification = NODE_VERIFICATION_ON;
29 const char *firm_vrfy_failure_msg;
31 /* enable verification of Load/Store entities */
32 void vrfy_enable_entity_tests(int enable) {
33 vrfy_entities = enable;
37 * little helper for NULL modes
39 static const char *get_mode_name_ex(ir_mode *mode) {
42 return get_mode_name(mode);
45 void do_node_verification(node_verification_t mode) {
46 opt_do_node_verification = mode;
49 /** the last IRG, on which a verify error was found */
50 static ir_graph *last_irg_error = NULL;
53 * print the name of the entity of an verification failure
55 static void show_entity_failure(ir_node *node)
57 ir_graph *irg = get_irn_irg(node);
59 if (last_irg_error == irg)
64 if (irg == get_const_code_irg()) {
65 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
68 entity *ent = get_irg_entity(irg);
71 type *ent_type = get_entity_owner(ent);
74 if (ent_type == get_glob_type())
75 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
77 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
80 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
84 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
90 * Prints a failure for a Node
92 static void show_node_failure(ir_node *n)
94 show_entity_failure(n);
95 fprintf(stderr, " node %ld %s%s\n" ,
97 get_irn_opname(n), get_irn_modename(n)
102 * Prints a failure message for a binop
104 static void show_binop_failure(ir_node *n, const char *text)
106 ir_node *left = get_binop_left(n);
107 ir_node *right = get_binop_right(n);
109 show_entity_failure(n);
110 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
112 get_irn_opname(n), get_irn_modename(n),
113 get_irn_opname(left), get_irn_modename(left),
114 get_irn_opname(right), get_irn_modename(right),
119 * Prints a failure message for an unop
121 static void show_unop_failure(ir_node *n, const char *text)
123 ir_node *op = get_unop_op(n);
125 show_entity_failure(n);
126 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
128 get_irn_opname(n), get_irn_modename(n),
129 get_irn_opname(op), get_irn_modename(op),
134 * Prints a failure message for an op with 3 operands
136 static void show_triop_failure(ir_node *n, const char *text)
138 ir_node *op0 = get_irn_n(n, 0);
139 ir_node *op1 = get_irn_n(n, 1);
140 ir_node *op2 = get_irn_n(n, 2);
142 show_entity_failure(n);
143 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
145 get_irn_opname(n), get_irn_modename(n),
146 get_irn_opname(op0), get_irn_modename(op0),
147 get_irn_opname(op1), get_irn_modename(op1),
148 get_irn_opname(op2), get_irn_modename(op2),
153 * Prints a failure message for a proj
155 static void show_proj_failure(ir_node *n)
157 ir_node *op = get_Proj_pred(n);
158 int proj = get_Proj_proj(n);
160 show_entity_failure(n);
161 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
163 get_irn_opname(n), get_irn_modename(n), proj,
164 get_irn_opname(op), get_irn_modename(op));
168 * Prints a failure message for a proj from Start
170 static void show_proj_mode_failure(ir_node *n, type *ty)
172 long proj = get_Proj_proj(n);
173 ir_mode *m = get_type_mode(ty);
175 show_entity_failure(n);
176 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
181 get_mode_name_ex(m));
185 * Prints a failure message for a proj
187 static void show_proj_failure_ent(ir_node *n, entity *ent)
189 ir_node *op = get_Proj_pred(n);
190 int proj = get_Proj_proj(n);
191 ir_mode *m = get_type_mode(get_entity_type(ent));
193 show_entity_failure(n);
194 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
196 get_irn_opname(n), get_irn_modename(n), proj,
197 get_irn_opname(op), get_irn_modename(op),
198 get_entity_name(ent), get_type_name(get_entity_type(ent)),
199 get_mode_name_ex(m));
203 * Show a node and a graph
205 static void show_node_on_graph(ir_graph *irg, ir_node *n)
207 entity *ent = get_irg_entity(irg);
210 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of entity %s, node %ld %s%s\n",
211 get_entity_name(ent),
212 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
214 fprintf(stderr, "\nFIRM: irn_vrfy_irg() of graph %p, node %ld %s%s\n",
216 get_irn_node_nr(n), get_irn_opname(n), get_irn_modename(n));
222 static void show_call_param(ir_node *n, type *mt)
226 show_entity_failure(n);
227 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
228 for (i = 0; i < get_method_n_params(mt); ++i) {
229 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
231 fprintf(stderr, ") != CALL(");
233 for (i = 0; i < get_Call_n_params(n); ++i) {
234 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
236 fprintf(stderr, ")\n");
243 static void show_return_modes(ir_graph *irg, ir_node *n, type *mt, int i)
245 entity *ent = get_irg_entity(irg);
247 show_entity_failure(n);
248 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
249 get_irn_node_nr(n), get_entity_name(ent),
250 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
251 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
256 * Show return number of results
258 static void show_return_nres(ir_graph *irg, ir_node *n, type *mt)
260 entity *ent = get_irg_entity(irg);
262 show_entity_failure(n);
263 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
264 get_irn_node_nr(n), get_entity_name(ent),
265 get_Return_n_ress(n), get_method_n_ress(mt));
271 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
273 show_entity_failure(phi);
274 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
275 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
276 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
282 static void show_phi_inputs(ir_node *phi, ir_node *block)
284 show_entity_failure(phi);
285 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
286 get_irn_node_nr(phi), get_irn_arity(phi),
287 get_irn_node_nr(block), get_irn_arity(block));
290 /** If the address is Sel or SymConst, return the entity. */
291 static entity *get_ptr_entity(ir_node *ptr) {
292 if (get_irn_op(ptr) == op_Sel) {
293 return get_Sel_entity(ptr);
294 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
295 return get_SymConst_entity(ptr);
301 * verify a Proj(Start) node
303 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
304 ir_mode *mode = get_irn_mode(p);
305 long proj = get_Proj_proj(p);
309 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
310 (proj == pn_Start_M && mode == mode_M) ||
311 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
312 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
313 (proj == pn_Start_T_args && mode == mode_T) ||
314 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
315 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
317 "wrong Proj from Start", 0,
318 show_proj_failure(p);
324 * verify a Proj(Cond) node
326 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
327 ir_mode *mode = get_irn_mode(p);
328 long proj = get_Proj_proj(p);
332 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
333 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
334 is_Bad(get_Cond_selector(pred)) /* rare */
336 "wrong Proj from Cond", 0,
337 show_proj_failure(p);
343 * verify a Proj(Raise) node
345 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
346 ir_mode *mode = get_irn_mode(p);
347 long proj = get_Proj_proj(p);
350 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
351 "wrong Proj from Raise", 0,
352 show_proj_failure(p);
358 * verify a Proj(InstOf) node
360 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
361 ir_mode *mode = get_irn_mode(p);
362 long proj = get_Proj_proj(p);
365 (proj >= 0 && mode == mode_X),
366 "wrong Proj from InstOf", 0,
367 show_proj_failure(p);
373 * verify a Proj(Call) node
375 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
376 ir_mode *mode = get_irn_mode(p);
377 long proj = get_Proj_proj(p);
380 ((proj == pn_Call_M_regular && mode == mode_M) ||
381 (proj == pn_Call_X_except && mode == mode_X) ||
382 (proj == pn_Call_T_result && mode == mode_T) ||
383 (proj == pn_Call_M_except && mode == mode_M) ||
384 (proj == pn_Call_P_value_res_base && mode == mode_P)),
385 "wrong Proj from Call", 0,
386 show_proj_failure(p);
388 if (proj == pn_Call_X_except)
390 get_irn_op(get_Call_mem(n)) != op_NoMem,
391 "Exception Proj from FunctionCall", 0);
392 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
394 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
395 "Memory Proj from FunctionCall", 0);
400 * verify a Proj(Quot) node
402 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
403 ir_mode *mode = get_irn_mode(p);
404 long proj = get_Proj_proj(p);
407 ((proj == pn_Quot_M && mode == mode_M) ||
408 (proj == pn_Quot_X_except && mode == mode_X) ||
409 (proj == pn_Quot_res && mode_is_float(mode))),
410 "wrong Proj from Quot", 0,
411 show_proj_failure(p);
413 if (proj == pn_Quot_X_except)
415 get_irn_pinned(n) == op_pin_state_pinned,
416 "Exception Proj from unpinned Quot", 0);
417 else if (proj == pn_Quot_M)
419 get_irn_pinned(n) == op_pin_state_pinned,
420 "Memory Proj from unpinned Quot", 0);
425 * verify a Proj(DivMod) node
427 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
428 ir_mode *mode = get_irn_mode(p);
429 long proj = get_Proj_proj(p);
432 ((proj == pn_DivMod_M && mode == mode_M) ||
433 (proj == pn_DivMod_X_except && mode == mode_X) ||
434 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
435 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
436 "wrong Proj from DivMod", 0,
437 show_proj_failure(p);
439 if (proj == pn_DivMod_X_except)
441 get_irn_pinned(n) == op_pin_state_pinned,
442 "Exception Proj from unpinned DivMod", 0);
443 else if (proj == pn_DivMod_M)
445 get_irn_pinned(n) == op_pin_state_pinned,
446 "Memory Proj from unpinned DivMod", 0);
451 * verify a Proj(Div) node
453 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
454 ir_mode *mode = get_irn_mode(p);
455 long proj = get_Proj_proj(p);
458 ((proj == pn_Div_M && mode == mode_M) ||
459 (proj == pn_Div_X_except && mode == mode_X) ||
460 (proj == pn_Div_res && mode_is_int(mode))),
461 "wrong Proj from Div", 0,
462 show_proj_failure(p);
464 if (proj == pn_Div_X_except)
466 get_irn_pinned(n) == op_pin_state_pinned,
467 "Exception Proj from unpinned Div", 0);
468 else if (proj == pn_Div_M)
470 get_irn_pinned(n) == op_pin_state_pinned,
471 "Memory Proj from unpinned Div", 0);
476 * verify a Proj(Mod) node
478 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
479 ir_mode *mode = get_irn_mode(p);
480 long proj = get_Proj_proj(p);
483 ((proj == pn_Mod_M && mode == mode_M) ||
484 (proj == pn_Mod_X_except && mode == mode_X) ||
485 (proj == pn_Mod_res && mode_is_int(mode))),
486 "wrong Proj from Mod", 0,
487 show_proj_failure(p);
489 if (proj == pn_Mod_X_except)
491 get_irn_pinned(n) == op_pin_state_pinned,
492 "Exception Proj from unpinned Mod", 0);
493 else if (proj == pn_Mod_M)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Memory Proj from unpinned Div", 0);
501 * verify a Proj(Cmp) node
503 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
504 ir_mode *mode = get_irn_mode(p);
505 long proj = get_Proj_proj(p);
508 (proj >= 0 && proj <= 15 && mode == mode_b),
509 "wrong Proj from Cmp", 0,
510 show_proj_failure(p);
516 * verify a Proj(Load) node
518 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
519 ir_mode *mode = get_irn_mode(p);
520 long proj = get_Proj_proj(p);
522 if (proj == pn_Load_res) {
523 ir_node *ptr = get_Load_ptr(n);
524 entity *ent = get_ptr_entity(ptr);
526 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
527 /* do NOT check this for lowered phases, see comment on Store */
529 (mode == get_type_mode(get_entity_type(ent))),
530 "wrong data Proj from Load, entity type_mode failed", 0,
531 show_proj_failure_ent(p, ent);
536 mode_is_data(mode) && mode == get_Load_mode(n),
537 "wrong data Proj from Load", 0,
538 show_proj_failure(p);
544 ((proj == pn_Load_M && mode == mode_M) ||
545 (proj == pn_Load_X_except && mode == mode_X)),
546 "wrong Proj from Load", 0,
547 show_proj_failure(p);
550 if (proj == pn_Load_X_except)
552 get_irn_pinned(n) == op_pin_state_pinned,
553 "Exception Proj from unpinned Load", 0);
558 * verify a Proj(Store) node
560 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
561 ir_mode *mode = get_irn_mode(p);
562 long proj = get_Proj_proj(p);
565 ((proj == pn_Store_M && mode == mode_M) ||
566 (proj == pn_Store_X_except && mode == mode_X)),
567 "wrong Proj from Store", 0,
568 show_proj_failure(p);
570 if (proj == pn_Store_X_except)
572 get_irn_pinned(n) == op_pin_state_pinned,
573 "Exception Proj from unpinned Store", 0);
578 * verify a Proj(Alloc) node
580 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
581 ir_mode *mode = get_irn_mode(p);
582 long proj = get_Proj_proj(p);
586 (proj == pn_Alloc_M && mode == mode_M) ||
587 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
588 (proj == pn_Alloc_res && mode_is_reference(mode))
590 "wrong Proj from Alloc", 0,
591 show_proj_failure(p);
597 * verify a Proj(Proj) node
599 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
600 ir_mode *mode = get_irn_mode(p);
601 long proj = get_Proj_proj(p);
602 long nr = get_Proj_proj(pred);
603 type *mt; /* A method type */
605 pred = skip_Id(get_Proj_pred(pred));
606 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
608 switch (get_irn_opcode(pred)) {
610 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
612 if (nr == pn_Start_T_args) {
614 (proj >= 0 && mode_is_data(mode)),
615 "wrong Proj from Proj from Start", 0);
617 (proj < get_method_n_params(mt)),
618 "More Projs for args than args in type", 0
620 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
621 /* value argument */ break;
624 (mode == get_type_mode(get_method_param_type(mt, proj))),
625 "Mode of Proj from Start doesn't match mode of param type.", 0,
626 show_proj_mode_failure(p, get_method_param_type(mt, proj));
629 else if (nr == pn_Start_P_value_arg_base) {
631 (proj >= 0 && mode_is_reference(mode)),
632 "wrong Proj from Proj from Start", 0
635 (proj < get_method_n_params(mt)),
636 "More Projs for args than args in type", 0
644 (proj >= 0 && mode_is_data(mode)),
645 "wrong Proj from Proj from Call", 0);
646 mt = get_Call_type(pred);
648 (proj < get_method_n_ress(mt)),
649 "More Projs for results than results in type.", 0);
650 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
651 /* value result */ break;
654 (mode == get_type_mode(get_method_res_type(mt, proj))),
655 "Mode of Proj from Call doesn't match mode of result type.", 0);
664 /* hmm, optimization did not remove it */
668 ASSERT_AND_RET(0, "Unknown opcode", 0);
674 * verify a Proj(Tuple) node
676 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
682 * verify a Proj(CallBegin) node
684 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
689 * verify a Proj(EndReg) node
691 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
692 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
693 "EndReg may only appear if ip view is constructed.", 0);
698 * verify a Proj(EndExcept) node
700 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
701 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
702 "EndExcept may only appear if ip view is constructed.", 0);
710 verify_node_Proj(ir_node *p, ir_graph *irg) {
714 pred = skip_Id(get_Proj_pred(p));
715 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
717 op = get_irn_op(pred);
719 if (op->verify_proj_node)
720 return op->verify_proj_node(pred, p);
727 * verify a Block node
729 static int verify_node_Block(ir_node *n, ir_graph *irg) {
732 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
733 ir_node *pred = get_Block_cfgpred(n, i);
737 (get_irn_mode(pred) == mode_X)
741 /* End block may only have Return, Raise or fragile ops as preds. */
742 if (n == get_irg_end_block(irg))
743 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
744 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
745 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
746 break; /* We can not test properly. How many tuples are there? */
747 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
749 (get_irn_op(pred) == op_Raise) ||
750 is_fragile_op(pred) ),
751 "End Block node", 0);
753 /* irg attr must == graph we are in. */
754 if (! get_interprocedural_view()) {
755 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
761 * verify a Start node
763 static int verify_node_Start(ir_node *n, ir_graph *irg) {
764 ir_mode *mymode = get_irn_mode(n);
767 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
768 mymode == mode_T, "Start node", 0
776 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
777 ir_mode *mymode = get_irn_mode(n);
781 mymode == mode_X, "Jmp node", 0
787 * verify an IJmp node
789 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
790 ir_mode *mymode = get_irn_mode(n);
791 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
794 /* IJmp: BB x ref --> X */
795 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
801 * verify a Break node
803 static int verify_node_Break(ir_node *n, ir_graph *irg) {
804 ir_mode *mymode = get_irn_mode(n);
806 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
807 "Break may only appear if ip view is constructed.", 0);
810 mymode == mode_X, "Break node", 0
818 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
819 ir_mode *mymode = get_irn_mode(n);
820 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
823 /* Cond: BB x b --> X x X */
824 (op1mode == mode_b ||
825 /* Cond: BB x int --> X^n */
826 mode_is_int(op1mode) ), "Cond node", 0
828 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
833 * verify a Return node
835 static int verify_node_Return(ir_node *n, ir_graph *irg) {
837 ir_mode *mymode = get_irn_mode(n);
838 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
841 /* Return: BB x M x data1 x ... x datan --> X */
843 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
845 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
846 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
848 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
849 /* Compare returned results with result types of method type */
850 mt = get_entity_type(get_irg_entity(irg));
851 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
852 "Number of results for Return doesn't match number of results in type.", 0,
853 show_return_nres(irg, n, mt););
854 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
855 type *res_type = get_method_res_type(mt, i);
857 if (is_atomic_type(res_type)) {
859 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
860 "Mode of result for Return doesn't match mode of result type.", 0,
861 show_return_modes(irg, n, mt, i);
866 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
867 "Mode of result for Return doesn't match mode of result type.", 0,
868 show_return_modes(irg, n, mt, i);
876 * verify a Raise node
878 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
879 ir_mode *mymode = get_irn_mode(n);
880 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
881 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
884 /* Sel: BB x M x ref --> X x M */
885 op1mode == mode_M && mode_is_reference(op2mode) &&
886 mymode == mode_T, "Raise node", 0
892 * verify a Const node
894 static int verify_node_Const(ir_node *n, ir_graph *irg) {
895 ir_mode *mymode = get_irn_mode(n);
898 /* Const: BB --> data */
899 (mode_is_data(mymode) ||
900 mymode == mode_b) /* we want boolean constants for static evaluation */
901 ,"Const node", 0 /* of Cmp. */
907 * verify a SymConst node
909 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
910 ir_mode *mymode = get_irn_mode(n);
912 if (get_SymConst_kind(n) == symconst_addr_ent) {
913 entity *ent = get_SymConst_entity(n);
914 if (is_Method_type(get_entity_type(ent)) &&
915 get_irn_irg(n) != get_const_code_irg()) {
917 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
918 "A constant must address an existing method.", 0);
923 /* SymConst: BB --> int*/
924 (mode_is_int(mymode) ||
925 /* SymConst: BB --> ref */
926 mode_is_reference(mymode))
927 ,"SymConst node", 0);
934 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
936 ir_mode *mymode = get_irn_mode(n);
937 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
938 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
942 /* Sel: BB x M x ref x int^n --> ref */
943 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
944 "Sel node", 0, show_node_failure(n)
947 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
948 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
950 ent = get_Sel_entity(n);
951 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
956 * verify an InstOf node
958 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
959 ir_mode *mymode = get_irn_mode(n);
960 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
962 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
963 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
970 static int verify_node_Call(ir_node *n, ir_graph *irg) {
971 ir_mode *mymode = get_irn_mode(n);
972 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
973 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
977 /* Call: BB x M x ref x data1 x ... x datan
978 --> M x datan+1 x ... x data n+m */
979 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
981 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
983 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
984 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
985 "Call node with wrong memory input", 0 );
987 mt = get_Call_type(n);
988 if(get_unknown_type() == mt) {
992 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
993 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
996 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
997 /* Compare arguments of node with those of type */
999 if (get_method_variadicity(mt) == variadicity_variadic) {
1001 get_Call_n_params(n) >= get_method_n_params(mt),
1002 "Number of args for Call doesn't match number of args in variadic type.",
1004 fprintf(stderr, "Call has %d params, method %s type %d\n",
1005 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1010 get_Call_n_params(n) == get_method_n_params(mt),
1011 "Number of args for Call doesn't match number of args in non variadic type.",
1015 for (i = 0; i < get_method_n_params(mt); i++) {
1016 type *t = get_method_param_type(mt, i);
1018 if (is_atomic_type(t)) {
1020 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1021 "Mode of arg for Call doesn't match mode of arg type.", 0,
1022 show_call_param(n, mt);
1026 /* call with a compound type, mode must be reference */
1028 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1029 "Mode of arg for Call doesn't match mode of arg type.", 0,
1030 show_call_param(n, mt);
1036 if (Call_has_callees(n)) {
1037 for (i = 0; i < get_Call_n_callees(n); i++) {
1038 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1046 * verify an Add node
1048 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1049 ir_mode *mymode = get_irn_mode(n);
1050 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1051 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1055 /* common Add: BB x numP x numP --> numP */
1056 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1057 /* Pointer Add: BB x ref x int --> ref */
1058 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1059 /* Pointer Add: BB x int x ref --> ref */
1060 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1063 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1064 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1065 "/* Pointer Add: BB x int x ref --> ref */");
1073 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1074 ir_mode *mymode = get_irn_mode(n);
1075 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1076 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1079 /* common Sub: BB x numP x numP --> numP */
1080 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1081 /* Pointer Sub: BB x ref x int --> ref */
1082 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1083 /* Pointer Sub: BB x int x ref --> ref */
1084 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1085 /* Pointer Sub: BB x ref x ref --> int */
1086 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1088 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1089 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1090 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1091 "/* Pointer Sub: BB x ref x ref --> int */" );
1097 * verify a Minus node
1099 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1100 ir_mode *mymode = get_irn_mode(n);
1101 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1104 /* Minus: BB x num --> num */
1105 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1106 show_unop_failure(n , "/* Minus: BB x num --> num */");
1114 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1115 ir_mode *mymode = get_irn_mode(n);
1116 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1117 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1120 /* Mul: BB x int1 x int1 --> int2 */
1121 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1122 /* Mul: BB x float x float --> float */
1123 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1125 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1126 "/* Mul: BB x float x float --> float */");
1132 * verify a Quot node
1134 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1135 ir_mode *mymode = get_irn_mode(n);
1136 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1137 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1138 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1141 /* Quot: BB x M x float x float --> M x X x float */
1142 op1mode == mode_M && op2mode == op3mode &&
1143 get_mode_sort(op2mode) == irms_float_number &&
1146 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1152 * verify a DivMod node
1154 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1155 ir_mode *mymode = get_irn_mode(n);
1156 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1157 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1158 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1161 /* DivMod: BB x M x int x int --> M x X x int x int */
1162 op1mode == mode_M &&
1163 mode_is_int(op2mode) &&
1164 op3mode == op2mode &&
1174 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1175 ir_mode *mymode = get_irn_mode(n);
1176 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1177 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1178 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1181 /* Div: BB x M x int x int --> M x X x int */
1182 op1mode == mode_M &&
1183 op2mode == op3mode &&
1184 mode_is_int(op2mode) &&
1194 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1195 ir_mode *mymode = get_irn_mode(n);
1196 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1197 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1198 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1201 /* Mod: BB x M x int x int --> M x X x int */
1202 op1mode == mode_M &&
1203 op2mode == op3mode &&
1204 mode_is_int(op2mode) &&
1212 * verify an Abs node
1214 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1215 ir_mode *mymode = get_irn_mode(n);
1216 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1219 /* Abs: BB x num --> num */
1220 op1mode == mymode &&
1221 mode_is_num (op1mode),
1223 show_unop_failure(n, "/* Abs: BB x num --> num */");
1229 * verify a logical And, Or, Eor node
1231 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1232 ir_mode *mymode = get_irn_mode(n);
1233 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1234 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1237 /* And or Or or Eor: BB x int x int --> int */
1238 mode_is_int(mymode) &&
1239 op2mode == op1mode &&
1241 "And, Or or Eor node", 0,
1242 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1247 #define verify_node_And verify_node_Logic
1248 #define verify_node_Or verify_node_Logic
1249 #define verify_node_Eor verify_node_Logic
1254 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1255 ir_mode *mymode = get_irn_mode(n);
1256 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1259 /* Not: BB x int --> int */
1260 mode_is_int(mymode) &&
1263 show_unop_failure(n, "/* Not: BB x int --> int */");
1271 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1272 ir_mode *mymode = get_irn_mode(n);
1273 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1274 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1277 /* Cmp: BB x datab x datab --> b16 */
1278 mode_is_data (op1mode) &&
1279 op2mode == op1mode &&
1282 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1288 * verify a Shift node
1290 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1291 ir_mode *mymode = get_irn_mode(n);
1292 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1293 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1296 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1297 mode_is_int(op1mode) &&
1298 mode_is_int(op2mode) &&
1299 !mode_is_signed(op2mode) &&
1301 "Shl, Shr or Shrs node", 0,
1302 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1307 #define verify_node_Shl verify_node_Shift
1308 #define verify_node_Shr verify_node_Shift
1309 #define verify_node_Shrs verify_node_Shift
1314 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1315 ir_mode *mymode = get_irn_mode(n);
1316 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1317 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1320 /* Rot: BB x int x int --> int */
1321 mode_is_int(op1mode) &&
1322 mode_is_int(op2mode) &&
1325 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1331 * verify a Conv node
1333 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1334 ir_mode *mymode = get_irn_mode(n);
1335 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1338 /* Conv: BB x datab1 --> datab2 */
1339 mode_is_datab(op1mode) && mode_is_data(mymode),
1341 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1347 * verify a Cast node
1349 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1350 ir_mode *mymode = get_irn_mode(n);
1351 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1354 /* Conv: BB x datab1 --> datab2 */
1355 mode_is_data(op1mode) && op1mode == mymode,
1357 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1365 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1366 ir_mode *mymode = get_irn_mode(n);
1367 ir_node *block = get_nodes_block(n);
1370 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1371 /* a Phi node MUST have the same number of inputs as its block */
1373 get_irn_arity(n) == get_irn_arity(block),
1374 "wrong number of inputs in Phi node", 0,
1375 show_phi_inputs(n, block);
1379 /* Phi: BB x dataM^n --> dataM */
1380 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1381 ir_node *pred = get_irn_n(n, i);
1382 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1384 get_irn_mode(pred) == mymode,
1386 show_phi_failure(n, pred, i);
1389 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1394 * verify a Filter node
1396 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1397 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1398 "Filter may only appear if ip view is constructed.", 0);
1399 /* We should further do tests as for Proj and Phi. */
1404 * verify a Load node
1406 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1407 ir_mode *mymode = get_irn_mode(n);
1408 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1409 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1412 /* Load: BB x M x ref --> M x X x data */
1413 op1mode == mode_M && mode_is_reference(op2mode),
1416 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1419 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1420 * (Proj (Proj))) sometimes ...
1422 * interprete.c:ai_eval seems to assume that this happens, too
1424 * obset.c:get_abstval_any can't deal with this if the load has
1428 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1429 assert ((NULL != ent) || (mymode != mode_T));
1437 * verify a Store node
1439 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1442 ir_mode *mymode = get_irn_mode(n);
1443 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1444 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1445 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1448 /* Store: BB x M x ref x data --> M x X */
1449 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1452 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1454 target = get_ptr_entity(get_Store_ptr(n));
1455 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1457 * If lowered code, any Sels that add 0 may be removed, causing
1458 * an direct access to entities of array or compound type.
1459 * Prevent this by checking the phase.
1461 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1469 * verify an Alloc node
1471 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1472 ir_mode *mymode = get_irn_mode(n);
1473 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1474 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1477 /* Alloc: BB x M x int_u --> M x X x ref */
1478 op1mode == mode_M &&
1479 mode_is_int(op2mode) &&
1480 !mode_is_signed(op2mode) &&
1483 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1489 * verify a Free node
1491 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1492 ir_mode *mymode = get_irn_mode(n);
1493 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1494 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1495 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1498 /* Free: BB x M x ref x int_u --> M */
1499 op1mode == mode_M && mode_is_reference(op2mode) &&
1500 mode_is_int(op3mode) &&
1501 !mode_is_signed(op3mode) &&
1504 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1510 * verify a Sync node
1512 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1514 ir_mode *mymode = get_irn_mode(n);
1516 /* Sync: BB x M^n --> M */
1517 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1518 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1520 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1525 * verify a Confirm node
1527 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1528 ir_mode *mymode = get_irn_mode(n);
1529 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1530 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1533 /* Confirm: BB x T x T --> T */
1534 op1mode == mymode &&
1537 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1545 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1546 ir_mode *mymode = get_irn_mode(n);
1547 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1548 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1549 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1552 /* Mux: BB x b x numP x numP --> numP */
1553 op1mode == mode_b &&
1554 op2mode == mymode &&
1555 op3mode == mymode &&
1556 mode_is_numP(mymode),
1562 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1567 if (!opt_do_node_verification) return 1;
1569 if (! get_interprocedural_view()) {
1571 * do NOT check placement in interprocedural view, as we don't always know
1572 * the "right" graph ...
1575 node_is_in_irgs_storage(irg, n),
1576 "Node is not stored on proper IR graph!", 0,
1577 show_node_on_graph(irg, n);
1579 assert(get_irn_irg(n) == irg);
1584 /* We don't want to test nodes whose predecessors are Bad,
1585 as we would have to special case that for each operation. */
1586 if (op != op_Phi && op != op_Block)
1587 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1588 if (is_Bad(get_irn_n(n, i)))
1592 if (op->verify_node)
1593 return op->verify_node(n, irg);
1599 int irn_vrfy(ir_node *n)
1602 #ifdef DEBUG_libfirm
1603 res = irn_vrfy_irg(n, current_ir_graph);
1608 /*-----------------------------------------------------------------*/
1609 /* Verify the whole graph. */
1610 /*-----------------------------------------------------------------*/
1612 /* This *is* used, except gcc doesn't notice that */
1613 static void vrfy_wrap(ir_node *node, void *env)
1617 *res = irn_vrfy(node);
1620 int irg_vrfy(ir_graph *irg)
1623 #ifdef DEBUG_libfirm
1626 rem = current_ir_graph;
1627 current_ir_graph = irg;
1628 last_irg_error = NULL;
1630 assert(get_irg_pinned(irg) == op_pin_state_pinned);
1632 irg_walk_graph(irg, vrfy_wrap, NULL, &res);
1634 current_ir_graph = rem;
1636 if (opt_do_node_verification == NODE_VERIFICATION_REPORT && ! res) {
1637 entity *ent = get_irg_entity(current_ir_graph);
1640 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1642 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1649 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1652 node_verification_t old = opt_do_node_verification;
1654 firm_vrfy_failure_msg = NULL;
1655 opt_do_node_verification = NODE_VERIFICATION_ERROR_ONLY;
1656 res = irn_vrfy_irg(n, irg);
1657 opt_do_node_verification = old;
1658 *bad_string = firm_vrfy_failure_msg;
1664 typedef struct _vrfy_bad_env_t {
1669 static void check_bads(ir_node *node, void *env)
1671 vrfy_bad_env_t *venv = env;
1672 int i, arity = get_irn_arity(node);
1674 if (is_Block(node)) {
1675 if ((venv->flags & BAD_CF) == 0) {
1677 /* check for Bad Block predecessor */
1678 for (i = 0; i < arity; ++i) {
1679 ir_node *pred = get_irn_n(node, i);
1682 venv->res |= BAD_CF;
1684 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1685 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1687 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1688 assert(0 && "Bad CF detected");
1695 if ((venv->flags & BAD_BLOCK) == 0) {
1697 /* check for Bad Block */
1698 if (is_Bad(get_nodes_block(node))) {
1699 venv->res |= BAD_BLOCK;
1701 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1702 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1704 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1705 assert(0 && "Bad CF detected");
1710 if ((venv->flags & TUPLE) == 0) {
1711 if (get_irn_op(node) == op_Tuple) {
1714 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1715 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1717 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1718 assert(0 && "Tuple detected");
1723 for (i = 0; i < arity; ++i) {
1724 ir_node *pred = get_irn_n(node, i);
1727 /* check for Phi with Bad inputs */
1728 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1729 if (venv->flags & BAD_CF)
1732 venv->res |= BAD_CF;
1734 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1735 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1737 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1738 assert(0 && "Bad CF detected");
1743 /* Bad node input */
1744 if ((venv->flags & BAD_DF) == 0) {
1745 venv->res |= BAD_DF;
1747 if (opt_do_node_verification == NODE_VERIFICATION_REPORT) {
1748 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1750 if (opt_do_node_verification == NODE_VERIFICATION_ON) {
1751 assert(0 && "Bad NON-CF detected");
1760 * verify occurance of bad nodes
1762 int irg_vrfy_bads(ir_graph *irg, int flags)
1769 irg_walk_graph(irg, check_bads, NULL, &env);
1775 * set the default verify operation
1777 void firm_set_default_verifyer(ir_op *op)
1781 op->verify_node = verify_node_##a; \
1829 op->verify_node = NULL;
1835 op->verify_proj_node = verify_node_Proj_##a; \
1858 op->verify_proj_node = NULL;