2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
30 #include "irgraph_t.h"
31 #include "irverify_t.h"
39 #include "irnodeset.h"
42 const char *firm_verify_failure_msg;
47 * little helper for NULL modes
49 static const char *get_mode_name_ex(ir_mode *mode)
53 return get_mode_name(mode);
56 /** the last IRG, on which a verification error was found */
57 static ir_graph *last_irg_error = NULL;
60 * print the name of the entity of an verification failure
62 * @param node the node caused the failure
64 static void show_entity_failure(const ir_node *node)
66 ir_graph *irg = get_irn_irg(node);
68 if (last_irg_error == irg)
73 if (irg == get_const_code_irg()) {
74 fprintf(stderr, "\nFIRM: irn_verify_irg() <of CONST_CODE_IRG> failed\n");
76 ir_entity *ent = get_irg_entity(irg);
79 ir_type *ent_type = get_entity_owner(ent);
82 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n",
83 ent_type, get_entity_name(ent));
85 fprintf(stderr, "\nFIRM: irn_verify_irg() <NULL>::%s failed\n", get_entity_name(ent));
88 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
93 static const char *get_irn_modename(const ir_node *node)
95 ir_mode *mode = get_irn_mode(node);
96 return get_mode_name(mode);
100 * Prints a failure for a Node
102 static void show_node_failure(const ir_node *n)
104 show_entity_failure(n);
105 fprintf(stderr, " node %ld %s%s\n" ,
107 get_irn_opname(n), get_irn_modename(n)
112 * Prints a failure message for a binop
114 static void show_binop_failure(const ir_node *n, const char *text)
116 ir_node *left = get_binop_left(n);
117 ir_node *right = get_binop_right(n);
119 show_entity_failure(n);
120 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
122 get_irn_opname(n), get_irn_modename(n),
123 get_irn_opname(left), get_irn_modename(left),
124 get_irn_opname(right), get_irn_modename(right),
129 * Prints a failure message for an unop
131 static void show_unop_failure(const ir_node *n, const char *text)
133 ir_node *op = get_unop_op(n);
135 show_entity_failure(n);
136 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
138 get_irn_opname(n), get_irn_modename(n),
139 get_irn_opname(op), get_irn_modename(op),
144 * Prints a failure message for an op with 3 operands
146 static void show_triop_failure(const ir_node *n, const char *text)
148 ir_node *op0 = get_irn_n(n, 0);
149 ir_node *op1 = get_irn_n(n, 1);
150 ir_node *op2 = get_irn_n(n, 2);
152 show_entity_failure(n);
153 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
155 get_irn_opname(n), get_irn_modename(n),
156 get_irn_opname(op0), get_irn_modename(op0),
157 get_irn_opname(op1), get_irn_modename(op1),
158 get_irn_opname(op2), get_irn_modename(op2),
163 * Prints a failure message for a proj
165 static void show_proj_failure(const ir_node *n)
167 ir_node *op = get_Proj_pred(n);
168 int proj = get_Proj_proj(n);
170 show_entity_failure(n);
171 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
173 get_irn_opname(n), get_irn_modename(n), proj,
174 get_irn_opname(op), get_irn_modename(op));
178 * Prints a failure message for a proj from Start
180 static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
182 long proj = get_Proj_proj(n);
183 ir_mode *m = get_type_mode(ty);
185 ir_print_type(type_name, sizeof(type_name), ty);
187 show_entity_failure(n);
188 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
193 get_mode_name_ex(m));
197 * Show a node and a graph
199 static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
201 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
205 * Show call parameters
207 static void show_call_param(const ir_node *n, ir_type *mt)
210 ir_print_type(type_name, sizeof(type_name), mt);
212 show_entity_failure(n);
213 fprintf(stderr, " Call type-check failed: %s(", type_name);
214 size_t n_method_params = get_method_n_params(mt);
215 for (size_t i = 0; i < n_method_params; ++i) {
216 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
218 fprintf(stderr, ") != CALL(");
220 int n_params = get_Call_n_params(n);
221 for (int i = 0; i < n_params; ++i) {
222 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
224 fprintf(stderr, ")\n");
230 static void show_return_modes(const ir_graph *irg, const ir_node *n,
233 ir_entity *ent = get_irg_entity(irg);
235 show_entity_failure(n);
236 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
237 get_irn_node_nr(n), get_entity_name(ent),
238 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
239 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
244 * Show return number of results
246 static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
248 ir_entity *ent = get_irg_entity(irg);
250 show_entity_failure(n);
251 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
252 get_irn_node_nr(n), get_entity_name(ent),
253 (unsigned long) get_Return_n_ress(n),
254 (unsigned long) get_method_n_ress(mt));
260 static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
263 show_entity_failure(phi);
264 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
265 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
266 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
272 static void show_phi_inputs(const ir_node *phi, const ir_node *block)
274 show_entity_failure(phi);
275 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
276 get_irn_node_nr(phi), get_irn_arity(phi),
277 get_irn_node_nr(block), get_irn_arity(block));
280 #endif /* #ifndef NDEBUG */
283 * verify a Proj(Start) node
285 static int verify_node_Proj_Start(const ir_node *p)
287 ir_mode *mode = get_irn_mode(p);
288 long proj = get_Proj_proj(p);
292 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
293 (proj == pn_Start_M && mode == mode_M) ||
294 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
295 (proj == pn_Start_T_args && mode == mode_T)
297 "wrong Proj from Start", 0,
298 show_proj_failure(p);
304 * verify a Proj(Cond) node
306 static int verify_node_Proj_Cond(const ir_node *p)
308 ir_mode *mode = get_irn_mode(p);
309 long proj = get_Proj_proj(p);
312 mode == mode_X && (proj == pn_Cond_false || proj == pn_Cond_true),
313 "wrong Proj from Cond", 0,
314 show_proj_failure(p);
319 static int verify_node_Proj_Switch(const ir_node *p)
321 ir_mode *mode = get_irn_mode(p);
322 long pn = get_Proj_proj(p);
323 ir_node *pred = get_Proj_pred(p);
325 mode == mode_X && (pn >= 0 && pn < (long)get_Switch_n_outs(pred)),
326 "wrong Proj from Switch", 0,
327 show_proj_failure(p);
333 * verify a Proj(Raise) node
335 static int verify_node_Proj_Raise(const ir_node *p)
337 ir_mode *mode = get_irn_mode(p);
338 long proj = get_Proj_proj(p);
341 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
342 "wrong Proj from Raise", 0,
343 show_proj_failure(p);
349 * verify a Proj(InstOf) node
351 static int verify_node_Proj_InstOf(const ir_node *p)
353 ir_mode *mode = get_irn_mode(p);
354 long proj = get_Proj_proj(p);
358 (proj == pn_InstOf_M && mode == mode_M) ||
359 (proj == pn_InstOf_X_regular && mode == mode_X) ||
360 (proj == pn_InstOf_X_except && mode == mode_X) ||
361 (proj == pn_InstOf_res && mode_is_reference(mode))
363 "wrong Proj from InstOf", 0,
364 show_proj_failure(p);
370 * verify a Proj(Call) node
372 static int verify_node_Proj_Call(const ir_node *p)
374 ir_mode *mode = get_irn_mode(p);
375 ir_node *n = get_Proj_pred(p);
376 long proj = get_Proj_proj(p);
380 (proj == pn_Call_M && mode == mode_M) ||
381 (proj == pn_Call_X_regular && mode == mode_X) ||
382 (proj == pn_Call_X_except && mode == mode_X) ||
383 (proj == pn_Call_T_result && mode == mode_T)
385 "wrong Proj from Call", 0,
386 show_proj_failure(p);
388 /* if we have exception flow, we must have a real Memory input */
389 if (proj == pn_Call_X_regular)
391 !is_NoMem(get_Call_mem(n)),
392 "Regular Proj from FunctionCall", 0);
393 else if (proj == pn_Call_X_except)
395 !is_NoMem(get_Call_mem(n)),
396 "Exception Proj from FunctionCall", 0);
401 * verify a Proj(Div) node
403 static int verify_node_Proj_Div(const ir_node *p)
405 ir_mode *mode = get_irn_mode(p);
406 ir_node *n = get_Proj_pred(p);
407 long proj = get_Proj_proj(p);
411 (proj == pn_Div_M && mode == mode_M) ||
412 (proj == pn_Div_X_regular && mode == mode_X) ||
413 (proj == pn_Div_X_except && mode == mode_X) ||
414 (proj == pn_Div_res && mode == get_Div_resmode(n))
416 "wrong Proj from Div", 0,
417 show_proj_failure(p);
419 if (proj == pn_Div_X_regular)
421 get_irn_pinned(n) == op_pin_state_pinned,
422 "Regular Proj from unpinned Div", 0);
423 else if (proj == pn_Div_X_except)
425 get_irn_pinned(n) == op_pin_state_pinned,
426 "Exception Proj from unpinned Div", 0);
427 else if (proj == pn_Div_M)
429 get_irn_pinned(n) == op_pin_state_pinned,
430 "Memory Proj from unpinned Div", 0);
435 * verify a Proj(Mod) node
437 static int verify_node_Proj_Mod(const ir_node *p)
439 ir_mode *mode = get_irn_mode(p);
440 ir_node *n = get_Proj_pred(p);
441 long proj = get_Proj_proj(p);
445 (proj == pn_Mod_M && mode == mode_M) ||
446 (proj == pn_Mod_X_regular && mode == mode_X) ||
447 (proj == pn_Mod_X_except && mode == mode_X) ||
448 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
450 "wrong Proj from Mod", 0,
451 show_proj_failure(p);
453 if (proj == pn_Mod_X_regular)
455 get_irn_pinned(n) == op_pin_state_pinned,
456 "Regular Proj from unpinned Mod", 0);
457 else if (proj == pn_Mod_X_except)
459 get_irn_pinned(n) == op_pin_state_pinned,
460 "Exception Proj from unpinned Mod", 0);
461 else if (proj == pn_Mod_M)
463 get_irn_pinned(n) == op_pin_state_pinned,
464 "Memory Proj from unpinned Div", 0);
469 * verify a Proj(Load) node
471 static int verify_node_Proj_Load(const ir_node *p)
473 ir_mode *mode = get_irn_mode(p);
474 ir_node *n = get_Proj_pred(p);
475 long proj = get_Proj_proj(p);
477 if (proj == pn_Load_res) {
479 mode_is_data(mode) && mode == get_Load_mode(n),
480 "wrong data Proj from Load", 0,
481 show_proj_failure(p);
486 (proj == pn_Load_M && mode == mode_M) ||
487 (proj == pn_Load_X_regular && mode == mode_X) ||
488 (proj == pn_Load_X_except && mode == mode_X)
490 "wrong Proj from Load", 0,
491 show_proj_failure(p);
494 if (proj == pn_Load_X_regular) {
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Regular Proj from unpinned Load", 0);
498 } else if (proj == pn_Load_X_except) {
500 get_irn_pinned(n) == op_pin_state_pinned,
501 "Exception Proj from unpinned Load", 0);
507 * verify a Proj(Store) node
509 static int verify_node_Proj_Store(const ir_node *p)
511 ir_mode *mode = get_irn_mode(p);
512 ir_node *n = get_Proj_pred(p);
513 long proj = get_Proj_proj(p);
517 (proj == pn_Store_M && mode == mode_M) ||
518 (proj == pn_Store_X_regular && mode == mode_X) ||
519 (proj == pn_Store_X_except && mode == mode_X)
521 "wrong Proj from Store", 0,
522 show_proj_failure(p);
524 if (proj == pn_Store_X_regular) {
526 get_irn_pinned(n) == op_pin_state_pinned,
527 "Regular Proj from unpinned Store", 0);
528 } else if (proj == pn_Store_X_except) {
530 get_irn_pinned(n) == op_pin_state_pinned,
531 "Exception Proj from unpinned Store", 0);
537 * verify a Proj(Alloc) node
539 static int verify_node_Proj_Alloc(const ir_node *p)
541 ir_mode *mode = get_irn_mode(p);
542 long proj = get_Proj_proj(p);
546 (proj == pn_Alloc_M && mode == mode_M) ||
547 (proj == pn_Alloc_X_regular && mode == mode_X) ||
548 (proj == pn_Alloc_X_except && mode == mode_X) ||
549 (proj == pn_Alloc_res && mode_is_reference(mode))
551 "wrong Proj from Alloc", 0,
552 show_proj_failure(p);
558 * verify a Proj(Proj) node
560 static int verify_node_Proj_Proj(const ir_node *p)
562 ir_mode *mode = get_irn_mode(p);
563 ir_node *pred = get_Proj_pred(p);
564 long proj = get_Proj_proj(p);
565 long nr = get_Proj_proj(pred);
566 ir_type *mt; /* A method type */
568 pred = skip_Id(get_Proj_pred(pred));
569 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
571 switch (get_irn_opcode(pred)) {
573 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
575 if (nr == pn_Start_T_args) {
577 (proj >= 0 && mode_is_datab(mode)),
578 "wrong Proj from Proj from Start", 0);
580 (proj < (int)get_method_n_params(mt)),
581 "More Projs for args than args in type", 0
583 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
584 /* value argument */ break;
586 if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
588 (mode == get_type_mode(get_method_param_type(mt, proj))),
589 "Mode of Proj from Start doesn't match mode of param type.", 0,
590 show_proj_mode_failure(p, get_method_param_type(mt, proj));
599 (proj >= 0 && mode_is_datab(mode)),
600 "wrong Proj from Proj from Call", 0);
601 mt = get_Call_type(pred);
602 ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
603 "wrong call type on call", 0);
605 (proj < (int)get_method_n_ress(mt)),
606 "More Projs for results than results in type.", 0);
607 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
608 /* value result */ break;
611 (mode == get_type_mode(get_method_res_type(mt, proj))),
612 "Mode of Proj from Call doesn't match mode of result type.", 0);
621 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
628 * verify a Proj(Tuple) node
630 static int verify_node_Proj_Tuple(const ir_node *p)
638 * verify a Proj(CopyB) node
640 static int verify_node_Proj_CopyB(const ir_node *p)
642 ir_mode *mode = get_irn_mode(p);
643 ir_node *n = get_Proj_pred(p);
644 long proj = get_Proj_proj(p);
648 (proj == pn_CopyB_M && mode == mode_M) ||
649 (proj == pn_CopyB_X_regular && mode == mode_X) ||
650 (proj == pn_CopyB_X_except && mode == mode_X)
652 "wrong Proj from CopyB", 0,
653 show_proj_failure(p);
655 if (proj == pn_CopyB_X_regular)
657 get_irn_pinned(n) == op_pin_state_pinned,
658 "Regular Proj from unpinned CopyB", 0);
659 else if (proj == pn_CopyB_X_except)
661 get_irn_pinned(n) == op_pin_state_pinned,
662 "Exception Proj from unpinned CopyB", 0);
666 static int verify_node_Proj_fragile(const ir_node *node)
668 ir_node *pred = get_Proj_pred(node);
669 int throws_exception = ir_throws_exception(pred);
670 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
671 && (!is_x_regular_Proj(node) || throws_exception),
672 "X_except und X_regular Proj only allowed when throws_exception is set",
680 static int verify_node_Proj(const ir_node *p)
682 ir_graph *irg = get_irn_irg(p);
686 pred = skip_Id(get_Proj_pred(p));
687 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
688 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);
690 if (is_fragile_op(pred)) {
691 int res = verify_node_Proj_fragile(p);
696 op = get_irn_op(pred);
697 if (op->ops.verify_proj_node)
698 return op->ops.verify_proj_node(p);
705 * verify a Block node
707 static int verify_node_Block(const ir_node *n)
709 ir_graph *irg = get_irn_irg(n);
712 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
713 ir_node *pred = get_Block_cfgpred(n, i);
714 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
715 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
716 "Block node must have a mode_X predecessor", 0);
717 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
720 if (n == get_irg_start_block(irg)) {
721 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
724 if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
725 /* End block may only have Return, Raise or fragile ops as preds. */
726 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
727 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
728 if (is_Proj(pred) || is_Tuple(pred))
729 break; /* We can not test properly. How many tuples are there? */
737 "End Block node", 0);
740 /* irg attr must == graph we are in. */
741 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
746 * verify a Start node
748 static int verify_node_Start(const ir_node *n)
750 ir_mode *mymode = get_irn_mode(n);
753 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
754 mymode == mode_T, "Start node", 0
762 static int verify_node_Jmp(const ir_node *n)
764 ir_mode *mymode = get_irn_mode(n);
768 mymode == mode_X, "Jmp node", 0
774 * verify an IJmp node
776 static int verify_node_IJmp(const ir_node *n)
778 ir_mode *mymode = get_irn_mode(n);
779 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
782 /* IJmp: BB x ref --> X */
783 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
791 static int verify_node_Cond(const ir_node *n)
793 ir_mode *mymode = get_irn_mode(n);
794 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
796 ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
797 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
801 static int verify_switch_table(const ir_node *n)
803 const ir_switch_table *table = get_Switch_table(n);
804 unsigned n_outs = get_Switch_n_outs(n);
805 ir_node *selector = get_Switch_selector(n);
806 ir_mode *mode = get_irn_mode(selector);
810 ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
812 n_entries = ir_switch_table_get_n_entries(table);
813 for (e = 0; e < n_entries; ++e) {
814 const ir_switch_table_entry *entry
815 = ir_switch_table_get_entry_const(table, e);
818 ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
819 "switch table entry without min+max value", 0);
820 ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
821 get_tarval_mode(entry->max) == mode,
822 "switch table entry with wrong modes", 0);
823 ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
824 "switch table entry without min+max value", 0);
825 ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
826 "switch table entry with invalid proj number", 0);
831 static int verify_node_Switch(const ir_node *n)
833 ir_mode *mymode = get_irn_mode(n);
834 ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
835 if (!verify_switch_table(n))
838 ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
839 ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
844 * verify a Return node
846 static int verify_node_Return(const ir_node *n)
848 ir_graph *irg = get_irn_irg(n);
849 ir_mode *mymode = get_irn_mode(n);
850 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
854 /* Return: BB x M x data1 x ... x datan --> X */
856 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
858 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
859 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
861 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
862 /* Compare returned results with result types of method type */
863 mt = get_entity_type(get_irg_entity(irg));
864 ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
865 "Number of results for Return doesn't match number of results in type.", 0,
866 show_return_nres(irg, n, mt););
867 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
868 ir_type *res_type = get_method_res_type(mt, i);
870 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
871 if (is_atomic_type(res_type)) {
873 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
874 "Mode of result for Return doesn't match mode of result type.", 0,
875 show_return_modes(irg, n, mt, i);
879 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
880 "Mode of result for Return doesn't match mode of result type.", 0,
881 show_return_modes(irg, n, mt, i);
890 * verify a Raise node
892 static int verify_node_Raise(const ir_node *n)
894 ir_mode *mymode = get_irn_mode(n);
895 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
896 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
899 /* Sel: BB x M x ref --> X x M */
900 op1mode == mode_M && mode_is_reference(op2mode) &&
901 mymode == mode_T, "Raise node", 0
907 * verify a Const node
909 static int verify_node_Const(const ir_node *n)
911 ir_mode *mymode = get_irn_mode(n);
914 /* Const: BB --> data */
915 (mode_is_data(mymode) ||
916 mymode == mode_b) /* we want boolean constants for static evaluation */
917 ,"Const node", 0 /* of Cmp. */
920 /* the modes of the constant and teh tarval must match */
921 mymode == get_tarval_mode(get_Const_tarval(n)),
922 "Const node, tarval and node mode mismatch", 0
928 * verify a SymConst node
930 static int verify_node_SymConst(const ir_node *n)
932 ir_mode *mymode = get_irn_mode(n);
935 /* SymConst: BB --> int*/
936 (mode_is_int(mymode) ||
937 /* SymConst: BB --> ref */
938 mode_is_reference(mymode))
939 ,"SymConst node", 0);
940 if (SYMCONST_HAS_ENT(get_SymConst_kind(n))) {
941 ir_entity *ent = get_SymConst_entity(n);
942 /* the is_method_entity(ent) exception is for nested functions... */
943 ASSERT_AND_RET_DBG((get_entity_owner(ent)->flags & tf_segment)
944 || is_method_entity(ent),
945 "SymConst node with frame entity", 0,
946 show_node_failure(n););
954 static int verify_node_Sel(const ir_node *n)
957 ir_mode *mymode = get_irn_mode(n);
958 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
959 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
963 /* Sel: BB x M x ref x int^n --> ref */
964 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
965 "Sel node", 0, show_node_failure(n);
968 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
969 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
971 ent = get_Sel_entity(n);
972 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
973 ASSERT_AND_RET_DBG(!(get_entity_owner(ent)->flags & tf_segment),
974 "Sel node with global entity", 0, show_node_failure(n););
979 * verify an InstOf node
981 static int verify_node_InstOf(const ir_node *n)
983 ir_mode *mymode = get_irn_mode(n);
984 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
986 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
987 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
992 * Check if the pinned state is right.
994 static int verify_right_pinned(const ir_node *n)
998 if (get_irn_pinned(n) == op_pin_state_pinned)
1000 mem = get_Call_mem(n);
1002 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1003 if (is_NoMem(mem) || is_Pin(mem))
1009 * verify a Call node
1011 static int verify_node_Call(const ir_node *n)
1013 ir_graph *irg = get_irn_irg(n);
1014 ir_mode *mymode = get_irn_mode(n);
1015 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1016 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1021 /* Call: BB x M x ref x data1 x ... x datan
1022 --> M x datan+1 x ... x data n+m */
1023 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1025 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1026 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1028 mt = get_Call_type(n);
1029 if (get_unknown_type() == mt) {
1033 n_params = get_Call_n_params(n);
1034 for (i = 0; i < n_params; ++i) {
1035 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1038 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1039 /* Compare arguments of node with those of type */
1041 if (get_method_variadicity(mt) == variadicity_variadic) {
1043 (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
1044 "Number of args for Call doesn't match number of args in variadic type.",
1046 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1047 n, get_Call_n_params(n), get_method_n_params(mt));
1051 (size_t)get_Call_n_params(n) == get_method_n_params(mt),
1052 "Number of args for Call doesn't match number of args in non variadic type.",
1054 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1055 n, get_Call_n_params(n), get_method_n_params(mt));
1059 for (i = 0; i < get_method_n_params(mt); i++) {
1060 ir_type *t = get_method_param_type(mt, i);
1062 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1063 if (is_atomic_type(t)) {
1065 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1066 "Mode of arg for Call doesn't match mode of arg type.", 0,
1067 show_call_param(n, mt);
1070 /* call with a compound type, mode must be reference */
1072 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1073 "Mode of arg for Call doesn't match mode of arg type.", 0,
1074 show_call_param(n, mt);
1084 * verify an Add node
1086 static int verify_node_Add(const ir_node *n)
1088 ir_mode *mymode = get_irn_mode(n);
1089 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1090 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1094 /* common Add: BB x numP x numP --> numP */
1095 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1096 /* Pointer Add: BB x ref x int --> ref */
1097 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1098 /* Pointer Add: BB x int x ref --> ref */
1099 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1102 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1103 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1104 "/* Pointer Add: BB x int x ref --> ref */");
1112 static int verify_node_Sub(const ir_node *n)
1114 ir_mode *mymode = get_irn_mode(n);
1115 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1116 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1120 /* common Sub: BB x numP x numP --> numP */
1121 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1122 /* Pointer Sub: BB x ref x int --> ref */
1123 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1124 /* Pointer Sub: BB x ref x ref --> int */
1125 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1128 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1129 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1130 "/* Pointer Sub: BB x ref x ref --> int */" );
1136 * verify a Minus node
1138 static int verify_node_Minus(const ir_node *n)
1140 ir_mode *mymode = get_irn_mode(n);
1141 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1144 /* Minus: BB x num --> num */
1145 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1146 show_unop_failure(n , "/* Minus: BB x num --> num */");
1154 static int verify_node_Mul(const ir_node *n)
1156 ir_mode *mymode = get_irn_mode(n);
1157 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1158 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1162 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1163 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1164 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1165 /* Mul: BB x float x float --> float */
1166 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1169 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1170 "/* Mul: BB x float x float --> float */");
1176 * verify a Mulh node
1178 static int verify_node_Mulh(const ir_node *n)
1180 ir_mode *mymode = get_irn_mode(n);
1181 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1182 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1186 /* Mulh: BB x int x int --> int */
1187 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1190 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1198 static int verify_node_Div(const ir_node *n)
1200 ir_mode *mymode = get_irn_mode(n);
1201 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1202 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1203 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1204 ir_mode *resmode = get_Div_resmode(n);
1207 /* Div: BB x M x num x num --> M x X x num */
1208 op1mode == mode_M &&
1209 op2mode == resmode &&
1210 op3mode == resmode &&
1211 mode_is_num(resmode) &&
1221 static int verify_node_Mod(const ir_node *n)
1223 ir_mode *mymode = get_irn_mode(n);
1224 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1225 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1226 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1227 ir_mode *resmode = get_Mod_resmode(n);
1230 /* Mod: BB x M x int x int --> M x X x int */
1231 op1mode == mode_M &&
1232 op2mode == resmode &&
1233 op3mode == resmode &&
1234 mode_is_int(resmode) &&
1242 * verify a logical And, Or, Eor node
1244 static int verify_node_Logic(const ir_node *n)
1246 ir_mode *mymode = get_irn_mode(n);
1247 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1248 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1251 /* And or Or or Eor: BB x int x int --> int */
1252 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1253 op2mode == op1mode &&
1255 "And, Or or Eor node", 0,
1256 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1261 static int verify_node_And(const ir_node *n)
1263 return verify_node_Logic(n);
1266 static int verify_node_Or(const ir_node *n)
1268 return verify_node_Logic(n);
1271 static int verify_node_Eor(const ir_node *n)
1273 return verify_node_Logic(n);
1279 static int verify_node_Not(const ir_node *n)
1281 ir_mode *mymode = get_irn_mode(n);
1282 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1285 /* Not: BB x int --> int */
1286 (mode_is_int(mymode) || mymode == mode_b) &&
1289 show_unop_failure(n, "/* Not: BB x int --> int */");
1297 static int verify_node_Cmp(const ir_node *n)
1299 ir_mode *mymode = get_irn_mode(n);
1300 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1301 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1304 /* Cmp: BB x datab x datab --> b16 */
1305 mode_is_datab(op1mode) &&
1306 op2mode == op1mode &&
1309 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1315 * verify a Shift node
1317 static int verify_node_Shift(const ir_node *n)
1319 ir_mode *mymode = get_irn_mode(n);
1320 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1321 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1324 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1325 mode_is_int(op1mode) &&
1326 mode_is_int(op2mode) &&
1327 !mode_is_signed(op2mode) &&
1329 "Shl, Shr or Shrs node", 0,
1330 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1335 static int verify_node_Shl(const ir_node *n)
1337 return verify_node_Shift(n);
1340 static int verify_node_Shr(const ir_node *n)
1342 return verify_node_Shift(n);
1345 static int verify_node_Shrs(const ir_node *n)
1347 return verify_node_Shift(n);
1351 * verify a Rotl node
1353 static int verify_node_Rotl(const ir_node *n)
1355 ir_mode *mymode = get_irn_mode(n);
1356 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1357 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1360 /* Rotl: BB x int x int --> int */
1361 mode_is_int(op1mode) &&
1362 mode_is_int(op2mode) &&
1365 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1371 * verify a Conv node
1373 static int verify_node_Conv(const ir_node *n)
1375 ir_mode *mymode = get_irn_mode(n);
1376 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1378 ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
1380 show_unop_failure(n, "/* Conv: BB x data --> data */");
1388 static int verify_node_Phi(const ir_node *n)
1390 ir_mode *mymode = get_irn_mode(n);
1391 ir_node *block = get_nodes_block(n);
1394 /* a Phi node MUST have the same number of inputs as its block
1395 * Exception is a phi with 0 inputs which is used when (re)constructing the
1398 && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
1399 && get_irn_arity(n) > 0) {
1401 get_irn_arity(n) == get_irn_arity(block),
1402 "wrong number of inputs in Phi node", 0,
1403 show_phi_inputs(n, block);
1407 /* Phi: BB x dataM^n --> dataM */
1408 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1409 ir_node *pred = get_Phi_pred(n, i);
1410 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1411 "Phi node", 0, show_phi_failure(n, pred, i);
1414 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1420 * verify a Load node
1422 static int verify_node_Load(const ir_node *n)
1424 ir_graph *irg = get_irn_irg(n);
1425 ir_mode *mymode = get_irn_mode(n);
1426 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1427 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1429 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1430 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1431 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1433 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1439 * verify a Store node
1441 static int verify_node_Store(const ir_node *n)
1443 ir_graph *irg = get_irn_irg(n);
1445 ir_mode *mymode = get_irn_mode(n);
1446 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1447 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1448 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1450 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1451 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1452 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1454 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1460 * verify an Alloc node
1462 static int verify_node_Alloc(const ir_node *n)
1464 ir_mode *mymode = get_irn_mode(n);
1465 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1466 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1469 /* Alloc: BB x M x int_u --> M x X x ref */
1470 op1mode == mode_M &&
1471 mode_is_int(op2mode) &&
1472 !mode_is_signed(op2mode) &&
1475 show_node_failure(n);
1481 * verify a Free node
1483 static int verify_node_Free(const ir_node *n)
1485 ir_mode *mymode = get_irn_mode(n);
1486 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1487 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1488 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1491 /* Free: BB x M x ref x int_u --> M */
1492 op1mode == mode_M && mode_is_reference(op2mode) &&
1493 mode_is_int(op3mode) &&
1494 !mode_is_signed(op3mode) &&
1497 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1503 * verify a Sync node
1505 static int verify_node_Sync(const ir_node *n)
1508 ir_mode *mymode = get_irn_mode(n);
1510 /* Sync: BB x M^n --> M */
1511 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1512 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1514 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1519 * verify a Confirm node
1521 static int verify_node_Confirm(const ir_node *n)
1523 ir_mode *mymode = get_irn_mode(n);
1524 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1525 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1528 /* Confirm: BB x T x T --> T */
1529 op1mode == mymode &&
1532 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1540 static int verify_node_Mux(const ir_node *n)
1542 ir_mode *mymode = get_irn_mode(n);
1543 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1544 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1545 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1548 /* Mux: BB x b x datab x datab --> datab */
1549 op1mode == mode_b &&
1550 op2mode == mymode &&
1551 op3mode == mymode &&
1552 mode_is_datab(mymode),
1559 * verify a CopyB node
1561 static int verify_node_CopyB(const ir_node *n)
1563 ir_graph *irg = get_irn_irg(n);
1564 ir_mode *mymode = get_irn_mode(n);
1565 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1566 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1567 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1568 ir_type *t = get_CopyB_type(n);
1570 /* CopyB: BB x M x ref x ref --> M x X */
1571 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1572 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1573 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1578 is_compound_type(t) || is_Array_type(t),
1579 "CopyB node should copy compound types only", 0 );
1581 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1582 This should happen RARELY, as CopyB COPIES MEMORY */
1583 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1589 * For each usage of a node, it is checked, if the block of the
1590 * node dominates the block of the usage (for phis: the predecessor
1591 * block of the phi for the corresponding edge).
1593 * @return non-zero on success, 0 on dominance error
1595 static int check_dominance_for_node(const ir_node *use)
1597 /* This won't work for blocks and the end node */
1598 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1600 ir_node *bl = get_nodes_block(use);
1602 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1603 ir_node *def = get_irn_n(use, i);
1604 ir_node *def_bl = get_nodes_block(def);
1605 ir_node *use_bl = bl;
1608 /* we have no dominance relation for unreachable blocks, so we can't
1609 * check the dominance property there */
1610 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1616 use_bl = get_Block_cfgpred_block(bl, i);
1619 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1622 irg = get_irn_irg(use);
1624 block_dominates(def_bl, use_bl),
1625 "the definition of a value used violates the dominance property", 0,
1627 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1628 irg, def_bl, def, use_bl, use, i
1636 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1640 if (!get_node_verification_mode())
1644 * do NOT check placement in interprocedural view, as we don't always
1645 * know the "right" graph ...
1649 /* this is an expensive check for large graphs (it has a quadratic
1650 * runtime but with a small constant); so do NOT run it in release mode
1653 node_is_in_irgs_storage(irg, n),
1654 "Node is not stored on proper IR graph!", 0,
1655 show_node_on_graph(irg, n);
1658 assert(get_irn_irg(n) == irg);
1660 unsigned idx = get_irn_idx(n);
1661 ir_node *node_from_map = get_idx_irn(irg, idx);
1662 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1663 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1669 if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
1670 op_pin_state state = get_irn_pinned(n);
1672 state == op_pin_state_floats ||
1673 state == op_pin_state_pinned,
1674 "invalid pin state", 0,
1675 ir_printf("node %+F", n);
1677 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1678 && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
1679 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1680 "block input is not a block", 0,
1681 ir_printf("node %+F", n);
1686 !is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
1687 "node should be in start block", 0,
1688 ir_printf("node %+F", n);
1691 if (op->ops.verify_node)
1692 return op->ops.verify_node(n);
1698 int irn_verify(const ir_node *n)
1700 #ifdef DEBUG_libfirm
1701 return irn_verify_irg(n, get_irn_irg(n));
1708 /*-----------------------------------------------------------------*/
1709 /* Verify the whole graph. */
1710 /*-----------------------------------------------------------------*/
1712 #ifdef DEBUG_libfirm
1714 * Walker to check every node
1716 static void verify_wrap(ir_node *node, void *env)
1718 int *res = (int*)env;
1719 *res = irn_verify_irg(node, get_irn_irg(node));
1723 * Walker to check every node including SSA property.
1724 * Only called if dominance info is available.
1726 static void verify_wrap_ssa(ir_node *node, void *env)
1728 int *res = (int*)env;
1730 *res = irn_verify_irg(node, get_irn_irg(node));
1732 *res = check_dominance_for_node(node);
1736 #endif /* DEBUG_libfirm */
1738 typedef struct check_cfg_env_t {
1739 pmap *branch_nodes; /**< map blocks to their branching nodes,
1740 map mode_X nodes to the blocks they branch to */
1742 ir_nodeset_t reachable_blocks;
1743 ir_nodeset_t kept_nodes;
1744 ir_nodeset_t true_projs;
1745 ir_nodeset_t false_projs;
1748 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1754 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1755 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1756 ir_printf("block %+F\n", block);
1759 n_cfgpreds = get_Block_n_cfgpreds(block);
1760 branch_nodes = env->branch_nodes;
1761 for (i = 0; i < n_cfgpreds; ++i) {
1762 /* check that each mode_X node is only connected
1764 ir_node *branch = get_Block_cfgpred(block, i);
1765 ir_node *former_dest;
1766 ir_node *former_branch;
1767 ir_node *branch_proj;
1768 ir_node *branch_block;
1769 branch = skip_Tuple(branch);
1772 former_dest = pmap_get(ir_node, branch_nodes, branch);
1773 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1774 "Multiple users on mode_X node", 0,
1775 ir_printf("node %+F\n", branch);
1777 pmap_insert(branch_nodes, branch, (void*)block);
1779 /* check that there's only 1 branching instruction in each block */
1780 branch_block = get_nodes_block(branch);
1781 branch_proj = branch;
1782 if (is_Proj(branch)) {
1783 branch = skip_Proj(branch);
1785 former_branch = pmap_get(ir_node, branch_nodes, branch_block);
1787 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1788 "Multiple branching nodes in a block", 0,
1789 ir_printf("nodes %+F,%+F in block %+F\n",
1790 branch, former_branch, branch_block);
1792 pmap_insert(branch_nodes, branch_block, branch);
1794 if (is_Cond(branch)) {
1795 long pn = get_Proj_proj(branch_proj);
1796 if (pn == pn_Cond_true)
1797 ir_nodeset_insert(&env->true_projs, branch);
1798 if (pn == pn_Cond_false)
1799 ir_nodeset_insert(&env->false_projs, branch);
1800 } else if (is_Switch(branch)) {
1801 long pn = get_Proj_proj(branch_proj);
1802 if (pn == pn_Switch_default)
1803 ir_nodeset_insert(&env->true_projs, branch);
1810 static void check_cfg_walk_func(ir_node *node, void *data)
1812 check_cfg_env_t *env = (check_cfg_env_t*)data;
1813 if (!is_Block(node))
1815 env->res &= check_block_cfg(node, env);
1818 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1820 ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
1821 ASSERT_AND_RET_DBG(branch != NULL
1822 || ir_nodeset_contains(&env->kept_nodes, block)
1823 || block == get_irg_end_block(get_irn_irg(block)),
1824 "block contains no cfop", 0,
1825 ir_printf("block %+F\n", block);
1830 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1832 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1833 "Cond node lacks true proj", 0,
1834 ir_printf("Cond %+F\n", cond);
1836 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1837 "Cond node lacks false proj", 0,
1838 ir_printf("Cond %+F\n", cond);
1843 static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
1845 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
1846 "Switch node lacks default Proj", 0,
1847 ir_printf("Switch %+F\n", sw);
1852 static void assert_branch(ir_node *node, void *data)
1854 check_cfg_env_t *env = (check_cfg_env_t*)data;
1855 if (is_Block(node)) {
1856 env->res &= verify_block_branch(node, env);
1857 } else if (is_Cond(node)) {
1858 env->res &= verify_cond_projs(node, env);
1859 } else if (is_Switch(node)) {
1860 env->res &= verify_switch_projs(node, env);
1864 static void collect_reachable_blocks(ir_node *block, void *data)
1866 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1867 ir_nodeset_insert(reachable_blocks, block);
1871 * Checks CFG well-formedness
1873 static int check_cfg(ir_graph *irg)
1875 check_cfg_env_t env;
1876 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1878 ir_nodeset_init(&env.reachable_blocks);
1879 ir_nodeset_init(&env.true_projs);
1880 ir_nodeset_init(&env.false_projs);
1882 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1883 &env.reachable_blocks);
1885 /* note that we do not use irg_walk_block because it will miss these
1886 * invalid blocks without a jump instruction which we want to detect
1888 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1890 ir_nodeset_init(&env.kept_nodes);
1892 ir_node *end = get_irg_end(irg);
1893 int arity = get_irn_arity(end);
1895 for (i = 0; i < arity; ++i) {
1896 ir_node *n = get_irn_n(end, i);
1897 ir_nodeset_insert(&env.kept_nodes, n);
1900 irg_walk_graph(irg, assert_branch, NULL, &env);
1902 ir_nodeset_destroy(&env.false_projs);
1903 ir_nodeset_destroy(&env.true_projs);
1904 ir_nodeset_destroy(&env.kept_nodes);
1905 ir_nodeset_destroy(&env.reachable_blocks);
1906 pmap_destroy(env.branch_nodes);
1910 int irg_verify(ir_graph *irg, unsigned flags)
1913 #ifdef DEBUG_libfirm
1914 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1917 last_irg_error = NULL;
1920 if (pinned && !check_cfg(irg))
1923 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
1928 pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
1929 ? verify_wrap_ssa : verify_wrap,
1934 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1935 ir_entity *ent = get_irg_entity(irg);
1938 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1940 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1946 #endif /* DEBUG_libfirm */
1951 typedef struct pass_t {
1952 ir_graph_pass_t pass;
1957 * Wrapper to irg_verify to be run as an ir_graph pass.
1959 static int irg_verify_wrapper(ir_graph *irg, void *context)
1961 pass_t *pass = (pass_t*)context;
1962 irg_verify(irg, pass->flags);
1963 /* do NOT rerun the pass if verify is ok :-) */
1967 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1969 pass_t *pass = XMALLOCZ(pass_t);
1971 def_graph_pass_constructor(
1972 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1974 /* neither dump for verify */
1975 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1976 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1978 pass->flags = flags;
1982 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
1983 const char **bad_string)
1986 firm_verification_t old = get_node_verification_mode();
1988 firm_verify_failure_msg = NULL;
1989 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1990 res = irn_verify_irg(n, irg);
1991 if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
1992 get_irg_pinned(irg) == op_pin_state_pinned)
1993 res = check_dominance_for_node(n);
1994 do_node_verification(old);
1995 *bad_string = firm_verify_failure_msg;
2000 typedef struct verify_bad_env_t {
2006 * Pre-Walker: check Bad predecessors of node.
2008 static void check_bads(ir_node *node, void *env)
2010 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2011 int i, arity = get_irn_arity(node);
2012 ir_graph *irg = get_irn_irg(node);
2014 if (is_Block(node)) {
2015 if ((venv->flags & BAD_CF) == 0) {
2017 /* check for Bad Block predecessor */
2018 for (i = 0; i < arity; ++i) {
2019 ir_node *pred = get_irn_n(node, i);
2022 venv->res |= BAD_CF;
2024 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2025 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2027 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2028 dump_ir_graph(irg, "assert");
2029 assert(0 && "Bad CF detected");
2035 if ((venv->flags & BAD_BLOCK) == 0) {
2037 /* check for Bad Block */
2038 if (is_Bad(get_nodes_block(node))) {
2039 venv->res |= BAD_BLOCK;
2041 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2042 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2044 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2045 dump_ir_graph(irg, "assert");
2046 assert(0 && "Bad CF detected");
2051 if ((venv->flags & TUPLE) == 0) {
2052 if (is_Tuple(node)) {
2055 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2056 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2058 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2059 dump_ir_graph(irg, "assert");
2060 assert(0 && "Tuple detected");
2065 for (i = 0; i < arity; ++i) {
2066 ir_node *pred = get_irn_n(node, i);
2069 /* check for Phi with Bad inputs */
2070 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2071 if (venv->flags & BAD_CF)
2074 venv->res |= BAD_CF;
2076 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2077 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2079 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2080 dump_ir_graph(irg, "assert");
2081 assert(0 && "Bad CF detected");
2086 /* Bad node input */
2087 if ((venv->flags & BAD_DF) == 0) {
2088 venv->res |= BAD_DF;
2090 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2091 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2093 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2094 dump_ir_graph(irg, "assert");
2095 assert(0 && "Bad NON-CF detected");
2103 int irg_verify_bads(ir_graph *irg, int flags)
2105 verify_bad_env_t env;
2110 irg_walk_graph(irg, check_bads, NULL, &env);
2115 static void register_verify_node_func(ir_op *op, verify_node_func func)
2117 op->ops.verify_node = func;
2120 static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
2122 op->ops.verify_proj_node = func;
2125 void ir_register_verify_node_ops(void)
2127 register_verify_node_func(op_Add, verify_node_Add);
2128 register_verify_node_func(op_Alloc, verify_node_Alloc);
2129 register_verify_node_func(op_And, verify_node_And);
2130 register_verify_node_func(op_Block, verify_node_Block);
2131 register_verify_node_func(op_Call, verify_node_Call);
2132 register_verify_node_func(op_Cmp, verify_node_Cmp);
2133 register_verify_node_func(op_Cond, verify_node_Cond);
2134 register_verify_node_func(op_Confirm, verify_node_Confirm);
2135 register_verify_node_func(op_Const, verify_node_Const);
2136 register_verify_node_func(op_Conv, verify_node_Conv);
2137 register_verify_node_func(op_CopyB, verify_node_CopyB);
2138 register_verify_node_func(op_Div, verify_node_Div);
2139 register_verify_node_func(op_Eor, verify_node_Eor);
2140 register_verify_node_func(op_Free, verify_node_Free);
2141 register_verify_node_func(op_IJmp, verify_node_IJmp);
2142 register_verify_node_func(op_InstOf, verify_node_InstOf);
2143 register_verify_node_func(op_Jmp, verify_node_Jmp);
2144 register_verify_node_func(op_Load, verify_node_Load);
2145 register_verify_node_func(op_Minus, verify_node_Minus);
2146 register_verify_node_func(op_Mod, verify_node_Mod);
2147 register_verify_node_func(op_Mul, verify_node_Mul);
2148 register_verify_node_func(op_Mulh, verify_node_Mulh);
2149 register_verify_node_func(op_Mux, verify_node_Mux);
2150 register_verify_node_func(op_Not, verify_node_Not);
2151 register_verify_node_func(op_Or, verify_node_Or);
2152 register_verify_node_func(op_Phi, verify_node_Phi);
2153 register_verify_node_func(op_Proj, verify_node_Proj);
2154 register_verify_node_func(op_Raise, verify_node_Raise);
2155 register_verify_node_func(op_Return, verify_node_Return);
2156 register_verify_node_func(op_Rotl, verify_node_Rotl);
2157 register_verify_node_func(op_Sel, verify_node_Sel);
2158 register_verify_node_func(op_Shl, verify_node_Shl);
2159 register_verify_node_func(op_Shr, verify_node_Shr);
2160 register_verify_node_func(op_Shrs, verify_node_Shrs);
2161 register_verify_node_func(op_Start, verify_node_Start);
2162 register_verify_node_func(op_Store, verify_node_Store);
2163 register_verify_node_func(op_Sub, verify_node_Sub);
2164 register_verify_node_func(op_Switch, verify_node_Switch);
2165 register_verify_node_func(op_SymConst, verify_node_SymConst);
2166 register_verify_node_func(op_Sync, verify_node_Sync);
2168 register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
2169 register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
2170 register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
2171 register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);
2172 register_verify_node_func_proj(op_Div, verify_node_Proj_Div);
2173 register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
2174 register_verify_node_func_proj(op_Load, verify_node_Proj_Load);
2175 register_verify_node_func_proj(op_Mod, verify_node_Proj_Mod);
2176 register_verify_node_func_proj(op_Proj, verify_node_Proj_Proj);
2177 register_verify_node_func_proj(op_Raise, verify_node_Proj_Raise);
2178 register_verify_node_func_proj(op_Start, verify_node_Proj_Start);
2179 register_verify_node_func_proj(op_Store, verify_node_Proj_Store);
2180 register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
2181 register_verify_node_func_proj(op_Tuple, verify_node_Proj_Tuple);