2 * This file is part of libFirm.
3 * Copyright (C) 2012 University of Karlsruhe.
8 * @brief Check irnodes for correctness.
9 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
16 #include "irgraph_t.h"
17 #include "irverify_t.h"
25 #include "irnodeset.h"
28 const char *firm_verify_failure_msg;
33 * little helper for NULL modes
35 static const char *get_mode_name_ex(ir_mode *mode)
39 return get_mode_name(mode);
42 /** the last IRG, on which a verification error was found */
43 static ir_graph *last_irg_error = NULL;
46 * print the name of the entity of an verification failure
48 * @param node the node caused the failure
50 static void show_entity_failure(const ir_node *node)
52 ir_graph *irg = get_irn_irg(node);
54 if (last_irg_error == irg)
59 if (irg == get_const_code_irg()) {
60 fprintf(stderr, "\nFIRM: irn_verify_irg() <of CONST_CODE_IRG> failed\n");
62 ir_entity *ent = get_irg_entity(irg);
65 ir_type *ent_type = get_entity_owner(ent);
66 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n", ent_type, get_entity_name(ent));
68 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
73 static const char *get_irn_modename(const ir_node *node)
75 ir_mode *mode = get_irn_mode(node);
76 return get_mode_name(mode);
80 * Prints a failure for a Node
82 static void show_node_failure(const ir_node *n)
84 show_entity_failure(n);
85 fprintf(stderr, " node %ld %s%s\n" ,
87 get_irn_opname(n), get_irn_modename(n)
92 * Prints a failure message for a binop
94 static void show_binop_failure(const ir_node *n, const char *text)
96 ir_node *left = get_binop_left(n);
97 ir_node *right = get_binop_right(n);
99 show_entity_failure(n);
100 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
102 get_irn_opname(n), get_irn_modename(n),
103 get_irn_opname(left), get_irn_modename(left),
104 get_irn_opname(right), get_irn_modename(right),
109 * Prints a failure message for an unop
111 static void show_unop_failure(const ir_node *n, const char *text)
113 ir_node *op = get_unop_op(n);
115 show_entity_failure(n);
116 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
118 get_irn_opname(n), get_irn_modename(n),
119 get_irn_opname(op), get_irn_modename(op),
124 * Prints a failure message for an op with 3 operands
126 static void show_triop_failure(const ir_node *n, const char *text)
128 ir_node *op0 = get_irn_n(n, 0);
129 ir_node *op1 = get_irn_n(n, 1);
130 ir_node *op2 = get_irn_n(n, 2);
132 show_entity_failure(n);
133 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
135 get_irn_opname(n), get_irn_modename(n),
136 get_irn_opname(op0), get_irn_modename(op0),
137 get_irn_opname(op1), get_irn_modename(op1),
138 get_irn_opname(op2), get_irn_modename(op2),
143 * Prints a failure message for a proj
145 static void show_proj_failure(const ir_node *n)
147 ir_node *op = get_Proj_pred(n);
148 int proj = get_Proj_proj(n);
150 show_entity_failure(n);
151 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
153 get_irn_opname(n), get_irn_modename(n), proj,
154 get_irn_opname(op), get_irn_modename(op));
158 * Prints a failure message for a proj from Start
160 static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
162 long proj = get_Proj_proj(n);
163 ir_mode *m = get_type_mode(ty);
165 ir_print_type(type_name, sizeof(type_name), ty);
167 show_entity_failure(n);
168 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
173 get_mode_name_ex(m));
177 * Show a node and a graph
179 static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
181 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
185 * Show call parameters
187 static void show_call_param(const ir_node *n, ir_type *mt)
190 ir_print_type(type_name, sizeof(type_name), mt);
192 show_entity_failure(n);
193 fprintf(stderr, " Call type-check failed: %s(", type_name);
194 size_t n_method_params = get_method_n_params(mt);
195 for (size_t i = 0; i < n_method_params; ++i) {
196 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
198 fprintf(stderr, ") != CALL(");
200 int n_params = get_Call_n_params(n);
201 for (int i = 0; i < n_params; ++i) {
202 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
204 fprintf(stderr, ")\n");
210 static void show_return_modes(const ir_graph *irg, const ir_node *n,
213 ir_entity *ent = get_irg_entity(irg);
215 show_entity_failure(n);
216 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
217 get_irn_node_nr(n), get_entity_name(ent),
218 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
219 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
224 * Show return number of results
226 static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
228 ir_entity *ent = get_irg_entity(irg);
230 show_entity_failure(n);
231 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
232 get_irn_node_nr(n), get_entity_name(ent),
233 (unsigned long) get_Return_n_ress(n),
234 (unsigned long) get_method_n_ress(mt));
240 static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
243 show_entity_failure(phi);
244 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
245 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
246 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
252 static void show_phi_inputs(const ir_node *phi, const ir_node *block)
254 show_entity_failure(phi);
255 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
256 get_irn_node_nr(phi), get_irn_arity(phi),
257 get_irn_node_nr(block), get_irn_arity(block));
260 #endif /* #ifndef NDEBUG */
263 * verify a Proj(Start) node
265 static int verify_node_Proj_Start(const ir_node *p)
267 ir_mode *mode = get_irn_mode(p);
268 long proj = get_Proj_proj(p);
272 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
273 (proj == pn_Start_M && mode == mode_M) ||
274 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
275 (proj == pn_Start_T_args && mode == mode_T)
277 "wrong Proj from Start", 0,
278 show_proj_failure(p);
284 * verify a Proj(Cond) node
286 static int verify_node_Proj_Cond(const ir_node *p)
288 ir_mode *mode = get_irn_mode(p);
289 long proj = get_Proj_proj(p);
292 mode == mode_X && (proj == pn_Cond_false || proj == pn_Cond_true),
293 "wrong Proj from Cond", 0,
294 show_proj_failure(p);
299 static int verify_node_Proj_Switch(const ir_node *p)
301 ir_mode *mode = get_irn_mode(p);
302 long pn = get_Proj_proj(p);
303 ir_node *pred = get_Proj_pred(p);
305 mode == mode_X && (pn >= 0 && pn < (long)get_Switch_n_outs(pred)),
306 "wrong Proj from Switch", 0,
307 show_proj_failure(p);
313 * verify a Proj(Raise) node
315 static int verify_node_Proj_Raise(const ir_node *p)
317 ir_mode *mode = get_irn_mode(p);
318 long proj = get_Proj_proj(p);
321 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
322 "wrong Proj from Raise", 0,
323 show_proj_failure(p);
329 * verify a Proj(InstOf) node
331 static int verify_node_Proj_InstOf(const ir_node *p)
333 ir_mode *mode = get_irn_mode(p);
334 long proj = get_Proj_proj(p);
338 (proj == pn_InstOf_M && mode == mode_M) ||
339 (proj == pn_InstOf_X_regular && mode == mode_X) ||
340 (proj == pn_InstOf_X_except && mode == mode_X) ||
341 (proj == pn_InstOf_res && mode_is_reference(mode))
343 "wrong Proj from InstOf", 0,
344 show_proj_failure(p);
350 * verify a Proj(Call) node
352 static int verify_node_Proj_Call(const ir_node *p)
354 ir_mode *mode = get_irn_mode(p);
355 ir_node *n = get_Proj_pred(p);
356 long proj = get_Proj_proj(p);
360 (proj == pn_Call_M && mode == mode_M) ||
361 (proj == pn_Call_X_regular && mode == mode_X) ||
362 (proj == pn_Call_X_except && mode == mode_X) ||
363 (proj == pn_Call_T_result && mode == mode_T)
365 "wrong Proj from Call", 0,
366 show_proj_failure(p);
368 /* if we have exception flow, we must have a real Memory input */
369 if (proj == pn_Call_X_regular)
371 !is_NoMem(get_Call_mem(n)),
372 "Regular Proj from FunctionCall", 0);
373 else if (proj == pn_Call_X_except)
375 !is_NoMem(get_Call_mem(n)),
376 "Exception Proj from FunctionCall", 0);
381 * verify a Proj(Div) node
383 static int verify_node_Proj_Div(const ir_node *p)
385 ir_mode *mode = get_irn_mode(p);
386 ir_node *n = get_Proj_pred(p);
387 long proj = get_Proj_proj(p);
391 (proj == pn_Div_M && mode == mode_M) ||
392 (proj == pn_Div_X_regular && mode == mode_X) ||
393 (proj == pn_Div_X_except && mode == mode_X) ||
394 (proj == pn_Div_res && mode == get_Div_resmode(n))
396 "wrong Proj from Div", 0,
397 show_proj_failure(p);
399 if (proj == pn_Div_X_regular)
401 get_irn_pinned(n) == op_pin_state_pinned,
402 "Regular Proj from unpinned Div", 0);
403 else if (proj == pn_Div_X_except)
405 get_irn_pinned(n) == op_pin_state_pinned,
406 "Exception Proj from unpinned Div", 0);
407 else if (proj == pn_Div_M)
409 get_irn_pinned(n) == op_pin_state_pinned,
410 "Memory Proj from unpinned Div", 0);
415 * verify a Proj(Mod) node
417 static int verify_node_Proj_Mod(const ir_node *p)
419 ir_mode *mode = get_irn_mode(p);
420 ir_node *n = get_Proj_pred(p);
421 long proj = get_Proj_proj(p);
425 (proj == pn_Mod_M && mode == mode_M) ||
426 (proj == pn_Mod_X_regular && mode == mode_X) ||
427 (proj == pn_Mod_X_except && mode == mode_X) ||
428 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
430 "wrong Proj from Mod", 0,
431 show_proj_failure(p);
433 if (proj == pn_Mod_X_regular)
435 get_irn_pinned(n) == op_pin_state_pinned,
436 "Regular Proj from unpinned Mod", 0);
437 else if (proj == pn_Mod_X_except)
439 get_irn_pinned(n) == op_pin_state_pinned,
440 "Exception Proj from unpinned Mod", 0);
441 else if (proj == pn_Mod_M)
443 get_irn_pinned(n) == op_pin_state_pinned,
444 "Memory Proj from unpinned Div", 0);
449 * verify a Proj(Load) node
451 static int verify_node_Proj_Load(const ir_node *p)
453 ir_mode *mode = get_irn_mode(p);
454 ir_node *n = get_Proj_pred(p);
455 long proj = get_Proj_proj(p);
457 if (proj == pn_Load_res) {
459 mode_is_data(mode) && mode == get_Load_mode(n),
460 "wrong data Proj from Load", 0,
461 show_proj_failure(p);
466 (proj == pn_Load_M && mode == mode_M) ||
467 (proj == pn_Load_X_regular && mode == mode_X) ||
468 (proj == pn_Load_X_except && mode == mode_X)
470 "wrong Proj from Load", 0,
471 show_proj_failure(p);
474 if (proj == pn_Load_X_regular) {
476 get_irn_pinned(n) == op_pin_state_pinned,
477 "Regular Proj from unpinned Load", 0);
478 } else if (proj == pn_Load_X_except) {
480 get_irn_pinned(n) == op_pin_state_pinned,
481 "Exception Proj from unpinned Load", 0);
487 * verify a Proj(Store) node
489 static int verify_node_Proj_Store(const ir_node *p)
491 ir_mode *mode = get_irn_mode(p);
492 ir_node *n = get_Proj_pred(p);
493 long proj = get_Proj_proj(p);
497 (proj == pn_Store_M && mode == mode_M) ||
498 (proj == pn_Store_X_regular && mode == mode_X) ||
499 (proj == pn_Store_X_except && mode == mode_X)
501 "wrong Proj from Store", 0,
502 show_proj_failure(p);
504 if (proj == pn_Store_X_regular) {
506 get_irn_pinned(n) == op_pin_state_pinned,
507 "Regular Proj from unpinned Store", 0);
508 } else if (proj == pn_Store_X_except) {
510 get_irn_pinned(n) == op_pin_state_pinned,
511 "Exception Proj from unpinned Store", 0);
517 * verify a Proj(Alloc) node
519 static int verify_node_Proj_Alloc(const ir_node *p)
521 ir_mode *mode = get_irn_mode(p);
522 long proj = get_Proj_proj(p);
526 (proj == pn_Alloc_M && mode == mode_M) ||
527 (proj == pn_Alloc_X_regular && mode == mode_X) ||
528 (proj == pn_Alloc_X_except && mode == mode_X) ||
529 (proj == pn_Alloc_res && mode_is_reference(mode))
531 "wrong Proj from Alloc", 0,
532 show_proj_failure(p);
538 * verify a Proj(Proj) node
540 static int verify_node_Proj_Proj(const ir_node *p)
542 ir_mode *mode = get_irn_mode(p);
543 ir_node *pred = get_Proj_pred(p);
544 long proj = get_Proj_proj(p);
545 long nr = get_Proj_proj(pred);
546 ir_type *mt; /* A method type */
548 pred = skip_Id(get_Proj_pred(pred));
549 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
551 switch (get_irn_opcode(pred)) {
553 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
555 if (nr == pn_Start_T_args) {
557 (proj >= 0 && mode_is_datab(mode)),
558 "wrong Proj from Proj from Start", 0);
560 (proj < (int)get_method_n_params(mt)),
561 "More Projs for args than args in type", 0
563 ir_type *param_type = get_method_param_type(mt, proj);
564 if (mode_is_reference(mode) && (is_compound_type(param_type) || is_Array_type(param_type)))
565 /* value argument */ break;
567 if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
569 (mode == get_type_mode(param_type)),
570 "Mode of Proj from Start doesn't match mode of param type.", 0,
571 show_proj_mode_failure(p, get_method_param_type(mt, proj));
580 (proj >= 0 && mode_is_datab(mode)),
581 "wrong Proj from Proj from Call", 0);
582 mt = get_Call_type(pred);
583 ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
584 "wrong call type on call", 0);
586 (proj < (int)get_method_n_ress(mt)),
587 "More Projs for results than results in type.", 0);
588 ir_type *res_type = get_method_res_type(mt, proj);
590 if ((mode_is_reference(mode)) &&
591 (is_compound_type(res_type) || is_Array_type(res_type)))
595 (mode == get_type_mode(get_method_res_type(mt, proj))),
596 "Mode of Proj from Call doesn't match mode of result type.", 0);
605 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
612 * verify a Proj(Tuple) node
614 static int verify_node_Proj_Tuple(const ir_node *p)
622 * verify a Proj(CopyB) node
624 static int verify_node_Proj_CopyB(const ir_node *p)
626 ir_mode *mode = get_irn_mode(p);
627 ir_node *n = get_Proj_pred(p);
628 long proj = get_Proj_proj(p);
632 (proj == pn_CopyB_M && mode == mode_M) ||
633 (proj == pn_CopyB_X_regular && mode == mode_X) ||
634 (proj == pn_CopyB_X_except && mode == mode_X)
636 "wrong Proj from CopyB", 0,
637 show_proj_failure(p);
639 if (proj == pn_CopyB_X_regular)
641 get_irn_pinned(n) == op_pin_state_pinned,
642 "Regular Proj from unpinned CopyB", 0);
643 else if (proj == pn_CopyB_X_except)
645 get_irn_pinned(n) == op_pin_state_pinned,
646 "Exception Proj from unpinned CopyB", 0);
650 static int verify_node_Proj_fragile(const ir_node *node)
652 ir_node *pred = get_Proj_pred(node);
653 int throws_exception = ir_throws_exception(pred);
654 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
655 && (!is_x_regular_Proj(node) || throws_exception),
656 "X_except und X_regular Proj only allowed when throws_exception is set",
664 static int verify_node_Proj(const ir_node *p)
666 ir_graph *irg = get_irn_irg(p);
670 pred = skip_Id(get_Proj_pred(p));
671 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
672 ASSERT_AND_RET(get_irg_pinned(irg) == op_pin_state_floats || get_nodes_block(pred) == get_nodes_block(p), "Proj must be in same block as its predecessor", 0);
674 if (is_fragile_op(pred)) {
675 int res = verify_node_Proj_fragile(p);
680 op = get_irn_op(pred);
681 if (op->ops.verify_proj_node)
682 return op->ops.verify_proj_node(p);
689 * verify a Block node
691 static int verify_node_Block(const ir_node *n)
693 ir_graph *irg = get_irn_irg(n);
696 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
697 ir_node *pred = get_Block_cfgpred(n, i);
698 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
699 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
700 "Block node must have a mode_X predecessor", 0);
701 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
704 if (n == get_irg_start_block(irg)) {
705 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
708 if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
709 /* End block may only have Return, Raise or fragile ops as preds. */
710 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
711 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
712 if (is_Proj(pred) || is_Tuple(pred))
713 break; /* We can not test properly. How many tuples are there? */
721 "End Block node", 0);
724 /* irg attr must == graph we are in. */
725 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
730 * verify a Start node
732 static int verify_node_Start(const ir_node *n)
734 ir_mode *mymode = get_irn_mode(n);
737 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
738 mymode == mode_T, "Start node", 0
746 static int verify_node_Jmp(const ir_node *n)
748 ir_mode *mymode = get_irn_mode(n);
752 mymode == mode_X, "Jmp node", 0
758 * verify an IJmp node
760 static int verify_node_IJmp(const ir_node *n)
762 ir_mode *mymode = get_irn_mode(n);
763 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
766 /* IJmp: BB x ref --> X */
767 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
775 static int verify_node_Cond(const ir_node *n)
777 ir_mode *mymode = get_irn_mode(n);
778 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
780 ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
781 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
785 static int verify_switch_table(const ir_node *n)
787 const ir_switch_table *table = get_Switch_table(n);
788 unsigned n_outs = get_Switch_n_outs(n);
789 ir_node *selector = get_Switch_selector(n);
790 ir_mode *mode = get_irn_mode(selector);
794 ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
796 n_entries = ir_switch_table_get_n_entries(table);
797 for (e = 0; e < n_entries; ++e) {
798 const ir_switch_table_entry *entry
799 = ir_switch_table_get_entry_const(table, e);
802 ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
803 "switch table entry without min+max value", 0);
804 ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
805 get_tarval_mode(entry->max) == mode,
806 "switch table entry with wrong modes", 0);
807 ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
808 "switch table entry without min+max value", 0);
809 ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
810 "switch table entry with invalid proj number", 0);
815 static int verify_node_Switch(const ir_node *n)
817 ir_mode *mymode = get_irn_mode(n);
818 ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
819 if (!verify_switch_table(n))
822 ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
823 ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
828 * verify a Return node
830 static int verify_node_Return(const ir_node *n)
832 ir_graph *irg = get_irn_irg(n);
833 ir_mode *mymode = get_irn_mode(n);
834 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
838 /* Return: BB x M x data1 x ... x datan --> X */
840 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
842 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
843 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
845 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
846 /* Compare returned results with result types of method type */
847 mt = get_entity_type(get_irg_entity(irg));
848 ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
849 "Number of results for Return doesn't match number of results in type.", 0,
850 show_return_nres(irg, n, mt););
851 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
852 ir_type *res_type = get_method_res_type(mt, i);
854 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
855 if (is_atomic_type(res_type)) {
857 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
858 "Mode of result for Return doesn't match mode of result type.", 0,
859 show_return_modes(irg, n, mt, i);
863 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
864 "Mode of result for Return doesn't match mode of result type.", 0,
865 show_return_modes(irg, n, mt, i);
874 * verify a Raise node
876 static int verify_node_Raise(const ir_node *n)
878 ir_mode *mymode = get_irn_mode(n);
879 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
880 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
883 /* Sel: BB x M x ref --> X x M */
884 op1mode == mode_M && mode_is_reference(op2mode) &&
885 mymode == mode_T, "Raise node", 0
891 * verify a Const node
893 static int verify_node_Const(const ir_node *n)
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. */
904 /* the modes of the constant and teh tarval must match */
905 mymode == get_tarval_mode(get_Const_tarval(n)),
906 "Const node, tarval and node mode mismatch", 0
912 * verify a SymConst node
914 static int verify_node_SymConst(const ir_node *n)
916 ir_mode *mymode = get_irn_mode(n);
919 /* SymConst: BB --> int*/
920 (mode_is_int(mymode) ||
921 /* SymConst: BB --> ref */
922 mode_is_reference(mymode))
923 ,"SymConst node", 0);
924 if (SYMCONST_HAS_ENT(get_SymConst_kind(n))) {
925 ir_entity *ent = get_SymConst_entity(n);
926 /* the is_method_entity(ent) exception is for nested functions... */
927 ASSERT_AND_RET_DBG((get_entity_owner(ent)->flags & tf_segment)
928 || is_method_entity(ent),
929 "SymConst node with non-segment entity", 0,
930 show_node_failure(n););
938 static int verify_node_Sel(const ir_node *n)
941 ir_mode *mymode = get_irn_mode(n);
942 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
943 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
947 /* Sel: BB x M x ref x int^n --> ref */
948 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
949 "Sel node", 0, show_node_failure(n);
952 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
953 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
955 ent = get_Sel_entity(n);
956 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
957 ASSERT_AND_RET_DBG(!(get_entity_owner(ent)->flags & tf_segment),
958 "Sel node with global entity", 0, show_node_failure(n););
963 * verify an InstOf node
965 static int verify_node_InstOf(const ir_node *n)
967 ir_mode *mymode = get_irn_mode(n);
968 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
970 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
971 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
976 * Check if the pinned state is right.
978 static int verify_right_pinned(const ir_node *n)
982 if (get_irn_pinned(n) == op_pin_state_pinned)
984 mem = get_Call_mem(n);
986 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
987 if (is_NoMem(mem) || is_Pin(mem))
995 static int verify_node_Call(const ir_node *n)
997 ir_graph *irg = get_irn_irg(n);
998 ir_mode *mymode = get_irn_mode(n);
999 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1000 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1005 /* Call: BB x M x ref x data1 x ... x datan
1006 --> M x datan+1 x ... x data n+m */
1007 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1009 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1010 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1012 mt = get_Call_type(n);
1013 if (get_unknown_type() == mt) {
1017 n_params = get_Call_n_params(n);
1018 for (i = 0; i < n_params; ++i) {
1019 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1022 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1023 /* Compare arguments of node with those of type */
1025 if (get_method_variadicity(mt) == variadicity_variadic) {
1027 (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
1028 "Number of args for Call doesn't match number of args in variadic type.",
1030 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1031 n, get_Call_n_params(n), get_method_n_params(mt));
1035 (size_t)get_Call_n_params(n) == get_method_n_params(mt),
1036 "Number of args for Call doesn't match number of args in non variadic type.",
1038 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1039 n, get_Call_n_params(n), get_method_n_params(mt));
1043 for (i = 0; i < get_method_n_params(mt); i++) {
1044 ir_type *t = get_method_param_type(mt, i);
1046 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1047 if (is_atomic_type(t)) {
1049 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1050 "Mode of arg for Call doesn't match mode of arg type.", 0,
1051 show_call_param(n, mt);
1054 /* call with a compound type, mode must be reference */
1056 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1057 "Mode of arg for Call doesn't match mode of arg type.", 0,
1058 show_call_param(n, mt);
1068 * verify an Add node
1070 static int verify_node_Add(const ir_node *n)
1072 ir_mode *mymode = get_irn_mode(n);
1073 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1074 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1078 /* common Add: BB x numP x numP --> numP */
1079 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1080 /* Pointer Add: BB x ref x int --> ref */
1081 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1082 /* Pointer Add: BB x int x ref --> ref */
1083 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1086 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1087 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1088 "/* Pointer Add: BB x int x ref --> ref */");
1096 static int verify_node_Sub(const ir_node *n)
1098 ir_mode *mymode = get_irn_mode(n);
1099 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1100 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1104 /* common Sub: BB x numP x numP --> numP */
1105 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1106 /* Pointer Sub: BB x ref x int --> ref */
1107 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1108 /* Pointer Sub: BB x ref x ref --> int */
1109 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1112 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1113 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1114 "/* Pointer Sub: BB x ref x ref --> int */" );
1120 * verify a Minus node
1122 static int verify_node_Minus(const ir_node *n)
1124 ir_mode *mymode = get_irn_mode(n);
1125 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1128 /* Minus: BB x num --> num */
1129 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1130 show_unop_failure(n , "/* Minus: BB x num --> num */");
1138 static int verify_node_Mul(const ir_node *n)
1140 ir_mode *mymode = get_irn_mode(n);
1141 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1142 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1146 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1147 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1148 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1149 /* Mul: BB x float x float --> float */
1150 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1153 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1154 "/* Mul: BB x float x float --> float */");
1160 * verify a Mulh node
1162 static int verify_node_Mulh(const ir_node *n)
1164 ir_mode *mymode = get_irn_mode(n);
1165 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1166 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1170 /* Mulh: BB x int x int --> int */
1171 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1174 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1182 static int verify_node_Div(const ir_node *n)
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));
1188 ir_mode *resmode = get_Div_resmode(n);
1191 /* Div: BB x M x num x num --> M x X x num */
1192 op1mode == mode_M &&
1193 op2mode == resmode &&
1194 op3mode == resmode &&
1195 mode_is_num(resmode) &&
1205 static int verify_node_Mod(const ir_node *n)
1207 ir_mode *mymode = get_irn_mode(n);
1208 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1209 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1210 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1211 ir_mode *resmode = get_Mod_resmode(n);
1214 /* Mod: BB x M x int x int --> M x X x int */
1215 op1mode == mode_M &&
1216 op2mode == resmode &&
1217 op3mode == resmode &&
1218 mode_is_int(resmode) &&
1226 * verify a logical And, Or, Eor node
1228 static int verify_node_Logic(const ir_node *n)
1230 ir_mode *mymode = get_irn_mode(n);
1231 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1232 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1235 /* And or Or or Eor: BB x int x int --> int */
1236 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1237 op2mode == op1mode &&
1239 "And, Or or Eor node", 0,
1240 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1245 static int verify_node_And(const ir_node *n)
1247 return verify_node_Logic(n);
1250 static int verify_node_Or(const ir_node *n)
1252 return verify_node_Logic(n);
1255 static int verify_node_Eor(const ir_node *n)
1257 return verify_node_Logic(n);
1263 static int verify_node_Not(const ir_node *n)
1265 ir_mode *mymode = get_irn_mode(n);
1266 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1269 /* Not: BB x int --> int */
1270 (mode_is_int(mymode) || mymode == mode_b) &&
1273 show_unop_failure(n, "/* Not: BB x int --> int */");
1281 static int verify_node_Cmp(const ir_node *n)
1283 ir_mode *mymode = get_irn_mode(n);
1284 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1285 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1288 /* Cmp: BB x datab x datab --> b16 */
1289 mode_is_datab(op1mode) &&
1290 op2mode == op1mode &&
1293 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1299 * verify a Shift node
1301 static int verify_node_Shift(const ir_node *n)
1303 ir_mode *mymode = get_irn_mode(n);
1304 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1305 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1308 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1309 mode_is_int(op1mode) &&
1310 mode_is_int(op2mode) &&
1311 !mode_is_signed(op2mode) &&
1313 "Shl, Shr or Shrs node", 0,
1314 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1319 static int verify_node_Shl(const ir_node *n)
1321 return verify_node_Shift(n);
1324 static int verify_node_Shr(const ir_node *n)
1326 return verify_node_Shift(n);
1329 static int verify_node_Shrs(const ir_node *n)
1331 return verify_node_Shift(n);
1335 * verify a Rotl node
1337 static int verify_node_Rotl(const ir_node *n)
1339 ir_mode *mymode = get_irn_mode(n);
1340 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1341 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1344 /* Rotl: BB x int x int --> int */
1345 mode_is_int(op1mode) &&
1346 mode_is_int(op2mode) &&
1349 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1355 * verify a Conv node
1357 static int verify_node_Conv(const ir_node *n)
1359 ir_mode *mymode = get_irn_mode(n);
1360 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1362 ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
1364 show_unop_failure(n, "/* Conv: BB x data --> data */");
1372 static int verify_node_Phi(const ir_node *n)
1374 ir_mode *mymode = get_irn_mode(n);
1375 ir_node *block = get_nodes_block(n);
1378 /* a Phi node MUST have the same number of inputs as its block
1379 * Exception is a phi with 0 inputs which is used when (re)constructing the
1382 && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
1383 && get_irn_arity(n) > 0) {
1385 get_irn_arity(n) == get_irn_arity(block),
1386 "wrong number of inputs in Phi node", 0,
1387 show_phi_inputs(n, block);
1391 /* Phi: BB x dataM^n --> dataM */
1392 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1393 ir_node *pred = get_Phi_pred(n, i);
1394 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1395 "Phi node", 0, show_phi_failure(n, pred, i);
1398 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1404 * verify a Load node
1406 static int verify_node_Load(const ir_node *n)
1408 ir_graph *irg = get_irn_irg(n);
1409 ir_mode *mymode = get_irn_mode(n);
1410 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1411 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1413 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1414 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1415 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1417 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1423 * verify a Store node
1425 static int verify_node_Store(const ir_node *n)
1427 ir_graph *irg = get_irn_irg(n);
1429 ir_mode *mymode = get_irn_mode(n);
1430 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1431 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1432 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1434 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1435 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1436 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1438 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1444 * verify an Alloc node
1446 static int verify_node_Alloc(const ir_node *n)
1448 ir_mode *mymode = get_irn_mode(n);
1449 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1450 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1453 /* Alloc: BB x M x int_u --> M x X x ref */
1454 op1mode == mode_M &&
1455 mode_is_int(op2mode) &&
1456 !mode_is_signed(op2mode) &&
1459 show_node_failure(n);
1465 * verify a Free node
1467 static int verify_node_Free(const ir_node *n)
1469 ir_mode *mymode = get_irn_mode(n);
1470 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1471 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1472 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1475 /* Free: BB x M x ref x int_u --> M */
1476 op1mode == mode_M && mode_is_reference(op2mode) &&
1477 mode_is_int(op3mode) &&
1478 !mode_is_signed(op3mode) &&
1481 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1487 * verify a Sync node
1489 static int verify_node_Sync(const ir_node *n)
1492 ir_mode *mymode = get_irn_mode(n);
1494 /* Sync: BB x M^n --> M */
1495 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1496 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1498 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1503 * verify a Confirm node
1505 static int verify_node_Confirm(const ir_node *n)
1507 ir_mode *mymode = get_irn_mode(n);
1508 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1509 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1512 /* Confirm: BB x T x T --> T */
1513 op1mode == mymode &&
1516 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1524 static int verify_node_Mux(const ir_node *n)
1526 ir_mode *mymode = get_irn_mode(n);
1527 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1528 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1529 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1532 /* Mux: BB x b x datab x datab --> datab */
1533 op1mode == mode_b &&
1534 op2mode == mymode &&
1535 op3mode == mymode &&
1536 mode_is_datab(mymode),
1543 * verify a CopyB node
1545 static int verify_node_CopyB(const ir_node *n)
1547 ir_graph *irg = get_irn_irg(n);
1548 ir_mode *mymode = get_irn_mode(n);
1549 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1550 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1551 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1552 ir_type *t = get_CopyB_type(n);
1554 /* CopyB: BB x M x ref x ref --> M x X */
1555 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1556 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1557 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1562 is_compound_type(t) || is_Array_type(t),
1563 "CopyB node should copy compound types only", 0 );
1565 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1566 This should happen RARELY, as CopyB COPIES MEMORY */
1567 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
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 * @return non-zero on success, 0 on dominance error
1579 static int check_dominance_for_node(const ir_node *use)
1581 /* This won't work for blocks and the end node */
1582 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1584 ir_node *bl = get_nodes_block(use);
1586 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1587 ir_node *def = get_irn_n(use, i);
1588 ir_node *def_bl = get_nodes_block(def);
1589 ir_node *use_bl = bl;
1592 /* we have no dominance relation for unreachable blocks, so we can't
1593 * check the dominance property there */
1594 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1600 use_bl = get_Block_cfgpred_block(bl, i);
1603 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1606 irg = get_irn_irg(use);
1608 block_dominates(def_bl, use_bl),
1609 "the definition of a value used violates the dominance property", 0,
1611 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1612 irg, def_bl, def, use_bl, use, i
1620 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1624 if (!get_node_verification_mode())
1628 * do NOT check placement in interprocedural view, as we don't always
1629 * know the "right" graph ...
1633 /* this is an expensive check for large graphs (it has a quadratic
1634 * runtime but with a small constant); so do NOT run it in release mode
1637 node_is_in_irgs_storage(irg, n),
1638 "Node is not stored on proper IR graph!", 0,
1639 show_node_on_graph(irg, n);
1642 assert(get_irn_irg(n) == irg);
1644 unsigned idx = get_irn_idx(n);
1645 ir_node *node_from_map = get_idx_irn(irg, idx);
1646 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1647 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1653 if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
1654 op_pin_state state = get_irn_pinned(n);
1656 state == op_pin_state_floats ||
1657 state == op_pin_state_pinned,
1658 "invalid pin state", 0,
1659 ir_printf("node %+F", n);
1661 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1662 && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
1663 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1664 "block input is not a block", 0,
1665 ir_printf("node %+F", n);
1670 !is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
1671 "node should be in start block", 0,
1672 ir_printf("node %+F", n);
1675 if (op->ops.verify_node)
1676 return op->ops.verify_node(n);
1682 int irn_verify(const ir_node *n)
1684 #ifdef DEBUG_libfirm
1685 return irn_verify_irg(n, get_irn_irg(n));
1692 /*-----------------------------------------------------------------*/
1693 /* Verify the whole graph. */
1694 /*-----------------------------------------------------------------*/
1696 #ifdef DEBUG_libfirm
1698 * Walker to check every node
1700 static void verify_wrap(ir_node *node, void *env)
1702 int *res = (int*)env;
1703 *res = irn_verify_irg(node, get_irn_irg(node));
1707 * Walker to check every node including SSA property.
1708 * Only called if dominance info is available.
1710 static void verify_wrap_ssa(ir_node *node, void *env)
1712 int *res = (int*)env;
1714 *res = irn_verify_irg(node, get_irn_irg(node));
1716 *res = check_dominance_for_node(node);
1720 #endif /* DEBUG_libfirm */
1722 typedef struct check_cfg_env_t {
1723 pmap *branch_nodes; /**< map blocks to their branching nodes,
1724 map mode_X nodes to the blocks they branch to */
1726 ir_nodeset_t reachable_blocks;
1727 ir_nodeset_t kept_nodes;
1728 ir_nodeset_t true_projs;
1729 ir_nodeset_t false_projs;
1732 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1738 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1739 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1740 ir_printf("block %+F\n", block);
1743 n_cfgpreds = get_Block_n_cfgpreds(block);
1744 branch_nodes = env->branch_nodes;
1745 for (i = 0; i < n_cfgpreds; ++i) {
1746 /* check that each mode_X node is only connected
1748 ir_node *branch = get_Block_cfgpred(block, i);
1749 ir_node *former_dest;
1750 ir_node *former_branch;
1751 ir_node *branch_proj;
1752 ir_node *branch_block;
1753 branch = skip_Tuple(branch);
1756 former_dest = pmap_get(ir_node, branch_nodes, branch);
1757 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1758 "Multiple users on mode_X node", 0,
1759 ir_printf("node %+F\n", branch);
1761 pmap_insert(branch_nodes, branch, (void*)block);
1763 /* check that there's only 1 branching instruction in each block */
1764 branch_block = get_nodes_block(branch);
1765 branch_proj = branch;
1766 if (is_Proj(branch)) {
1767 branch = skip_Proj(branch);
1769 former_branch = pmap_get(ir_node, branch_nodes, branch_block);
1771 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1772 "Multiple branching nodes in a block", 0,
1773 ir_printf("nodes %+F,%+F in block %+F\n",
1774 branch, former_branch, branch_block);
1776 pmap_insert(branch_nodes, branch_block, branch);
1778 if (is_Cond(branch)) {
1779 long pn = get_Proj_proj(branch_proj);
1780 if (pn == pn_Cond_true)
1781 ir_nodeset_insert(&env->true_projs, branch);
1782 if (pn == pn_Cond_false)
1783 ir_nodeset_insert(&env->false_projs, branch);
1784 } else if (is_Switch(branch)) {
1785 long pn = get_Proj_proj(branch_proj);
1786 if (pn == pn_Switch_default)
1787 ir_nodeset_insert(&env->true_projs, branch);
1794 static void check_cfg_walk_func(ir_node *node, void *data)
1796 check_cfg_env_t *env = (check_cfg_env_t*)data;
1797 if (!is_Block(node))
1799 env->res &= check_block_cfg(node, env);
1802 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1804 ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
1805 ASSERT_AND_RET_DBG(branch != NULL
1806 || ir_nodeset_contains(&env->kept_nodes, block)
1807 || block == get_irg_end_block(get_irn_irg(block)),
1808 "block contains no cfop", 0,
1809 ir_printf("block %+F\n", block);
1814 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1816 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1817 "Cond node lacks true proj", 0,
1818 ir_printf("Cond %+F\n", cond);
1820 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1821 "Cond node lacks false proj", 0,
1822 ir_printf("Cond %+F\n", cond);
1827 static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
1829 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
1830 "Switch node lacks default Proj", 0,
1831 ir_printf("Switch %+F\n", sw);
1836 static void assert_branch(ir_node *node, void *data)
1838 check_cfg_env_t *env = (check_cfg_env_t*)data;
1839 if (is_Block(node)) {
1840 env->res &= verify_block_branch(node, env);
1841 } else if (is_Cond(node)) {
1842 env->res &= verify_cond_projs(node, env);
1843 } else if (is_Switch(node)) {
1844 env->res &= verify_switch_projs(node, env);
1848 static void collect_reachable_blocks(ir_node *block, void *data)
1850 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1851 ir_nodeset_insert(reachable_blocks, block);
1855 * Checks CFG well-formedness
1857 static int check_cfg(ir_graph *irg)
1859 check_cfg_env_t env;
1860 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1862 ir_nodeset_init(&env.reachable_blocks);
1863 ir_nodeset_init(&env.true_projs);
1864 ir_nodeset_init(&env.false_projs);
1866 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1867 &env.reachable_blocks);
1869 /* note that we do not use irg_walk_block because it will miss these
1870 * invalid blocks without a jump instruction which we want to detect
1872 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1874 ir_nodeset_init(&env.kept_nodes);
1876 ir_node *end = get_irg_end(irg);
1877 int arity = get_irn_arity(end);
1879 for (i = 0; i < arity; ++i) {
1880 ir_node *n = get_irn_n(end, i);
1881 ir_nodeset_insert(&env.kept_nodes, n);
1884 irg_walk_graph(irg, assert_branch, NULL, &env);
1886 ir_nodeset_destroy(&env.false_projs);
1887 ir_nodeset_destroy(&env.true_projs);
1888 ir_nodeset_destroy(&env.kept_nodes);
1889 ir_nodeset_destroy(&env.reachable_blocks);
1890 pmap_destroy(env.branch_nodes);
1894 int irg_verify(ir_graph *irg, unsigned flags)
1897 #ifdef DEBUG_libfirm
1898 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1901 last_irg_error = NULL;
1904 if (pinned && !check_cfg(irg))
1907 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
1912 pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
1913 ? verify_wrap_ssa : verify_wrap,
1918 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1919 ir_entity *ent = get_irg_entity(irg);
1922 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1924 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1930 #endif /* DEBUG_libfirm */
1935 typedef struct pass_t {
1936 ir_graph_pass_t pass;
1941 * Wrapper to irg_verify to be run as an ir_graph pass.
1943 static int irg_verify_wrapper(ir_graph *irg, void *context)
1945 pass_t *pass = (pass_t*)context;
1946 irg_verify(irg, pass->flags);
1947 /* do NOT rerun the pass if verify is ok :-) */
1951 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1953 pass_t *pass = XMALLOCZ(pass_t);
1955 def_graph_pass_constructor(
1956 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1958 /* neither dump for verify */
1959 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1960 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1962 pass->flags = flags;
1966 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
1967 const char **bad_string)
1970 firm_verification_t old = get_node_verification_mode();
1972 firm_verify_failure_msg = NULL;
1973 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1974 res = irn_verify_irg(n, irg);
1975 if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
1976 get_irg_pinned(irg) == op_pin_state_pinned)
1977 res = check_dominance_for_node(n);
1978 do_node_verification(old);
1979 *bad_string = firm_verify_failure_msg;
1984 typedef struct verify_bad_env_t {
1990 * Pre-Walker: check Bad predecessors of node.
1992 static void check_bads(ir_node *node, void *env)
1994 verify_bad_env_t *venv = (verify_bad_env_t*)env;
1995 int i, arity = get_irn_arity(node);
1996 ir_graph *irg = get_irn_irg(node);
1998 if (is_Block(node)) {
1999 if ((venv->flags & BAD_CF) == 0) {
2001 /* check for Bad Block predecessor */
2002 for (i = 0; i < arity; ++i) {
2003 ir_node *pred = get_irn_n(node, i);
2006 venv->res |= BAD_CF;
2008 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2009 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2011 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2012 dump_ir_graph(irg, "assert");
2013 assert(0 && "Bad CF detected");
2019 if ((venv->flags & BAD_BLOCK) == 0) {
2021 /* check for Bad Block */
2022 if (is_Bad(get_nodes_block(node))) {
2023 venv->res |= BAD_BLOCK;
2025 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2026 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2028 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2029 dump_ir_graph(irg, "assert");
2030 assert(0 && "Bad CF detected");
2035 if ((venv->flags & TUPLE) == 0) {
2036 if (is_Tuple(node)) {
2039 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2040 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2042 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2043 dump_ir_graph(irg, "assert");
2044 assert(0 && "Tuple detected");
2049 for (i = 0; i < arity; ++i) {
2050 ir_node *pred = get_irn_n(node, i);
2053 /* check for Phi with Bad inputs */
2054 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2055 if (venv->flags & BAD_CF)
2058 venv->res |= BAD_CF;
2060 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2061 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2063 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2064 dump_ir_graph(irg, "assert");
2065 assert(0 && "Bad CF detected");
2070 /* Bad node input */
2071 if ((venv->flags & BAD_DF) == 0) {
2072 venv->res |= BAD_DF;
2074 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2075 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2077 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2078 dump_ir_graph(irg, "assert");
2079 assert(0 && "Bad NON-CF detected");
2087 int irg_verify_bads(ir_graph *irg, int flags)
2089 verify_bad_env_t env;
2094 irg_walk_graph(irg, check_bads, NULL, &env);
2099 static void register_verify_node_func(ir_op *op, verify_node_func func)
2101 op->ops.verify_node = func;
2104 static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
2106 op->ops.verify_proj_node = func;
2109 void ir_register_verify_node_ops(void)
2111 register_verify_node_func(op_Add, verify_node_Add);
2112 register_verify_node_func(op_Alloc, verify_node_Alloc);
2113 register_verify_node_func(op_And, verify_node_And);
2114 register_verify_node_func(op_Block, verify_node_Block);
2115 register_verify_node_func(op_Call, verify_node_Call);
2116 register_verify_node_func(op_Cmp, verify_node_Cmp);
2117 register_verify_node_func(op_Cond, verify_node_Cond);
2118 register_verify_node_func(op_Confirm, verify_node_Confirm);
2119 register_verify_node_func(op_Const, verify_node_Const);
2120 register_verify_node_func(op_Conv, verify_node_Conv);
2121 register_verify_node_func(op_CopyB, verify_node_CopyB);
2122 register_verify_node_func(op_Div, verify_node_Div);
2123 register_verify_node_func(op_Eor, verify_node_Eor);
2124 register_verify_node_func(op_Free, verify_node_Free);
2125 register_verify_node_func(op_IJmp, verify_node_IJmp);
2126 register_verify_node_func(op_InstOf, verify_node_InstOf);
2127 register_verify_node_func(op_Jmp, verify_node_Jmp);
2128 register_verify_node_func(op_Load, verify_node_Load);
2129 register_verify_node_func(op_Minus, verify_node_Minus);
2130 register_verify_node_func(op_Mod, verify_node_Mod);
2131 register_verify_node_func(op_Mul, verify_node_Mul);
2132 register_verify_node_func(op_Mulh, verify_node_Mulh);
2133 register_verify_node_func(op_Mux, verify_node_Mux);
2134 register_verify_node_func(op_Not, verify_node_Not);
2135 register_verify_node_func(op_Or, verify_node_Or);
2136 register_verify_node_func(op_Phi, verify_node_Phi);
2137 register_verify_node_func(op_Proj, verify_node_Proj);
2138 register_verify_node_func(op_Raise, verify_node_Raise);
2139 register_verify_node_func(op_Return, verify_node_Return);
2140 register_verify_node_func(op_Rotl, verify_node_Rotl);
2141 register_verify_node_func(op_Sel, verify_node_Sel);
2142 register_verify_node_func(op_Shl, verify_node_Shl);
2143 register_verify_node_func(op_Shr, verify_node_Shr);
2144 register_verify_node_func(op_Shrs, verify_node_Shrs);
2145 register_verify_node_func(op_Start, verify_node_Start);
2146 register_verify_node_func(op_Store, verify_node_Store);
2147 register_verify_node_func(op_Sub, verify_node_Sub);
2148 register_verify_node_func(op_Switch, verify_node_Switch);
2149 register_verify_node_func(op_SymConst, verify_node_SymConst);
2150 register_verify_node_func(op_Sync, verify_node_Sync);
2152 register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
2153 register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
2154 register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
2155 register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);
2156 register_verify_node_func_proj(op_Div, verify_node_Proj_Div);
2157 register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
2158 register_verify_node_func_proj(op_Load, verify_node_Proj_Load);
2159 register_verify_node_func_proj(op_Mod, verify_node_Proj_Mod);
2160 register_verify_node_func_proj(op_Proj, verify_node_Proj_Proj);
2161 register_verify_node_func_proj(op_Raise, verify_node_Proj_Raise);
2162 register_verify_node_func_proj(op_Start, verify_node_Proj_Start);
2163 register_verify_node_func_proj(op_Store, verify_node_Proj_Store);
2164 register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
2165 register_verify_node_func_proj(op_Tuple, verify_node_Proj_Tuple);