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);
80 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n", ent_type, get_entity_name(ent));
82 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
87 static const char *get_irn_modename(const ir_node *node)
89 ir_mode *mode = get_irn_mode(node);
90 return get_mode_name(mode);
94 * Prints a failure for a Node
96 static void show_node_failure(const ir_node *n)
98 show_entity_failure(n);
99 fprintf(stderr, " node %ld %s%s\n" ,
101 get_irn_opname(n), get_irn_modename(n)
106 * Prints a failure message for a binop
108 static void show_binop_failure(const ir_node *n, const char *text)
110 ir_node *left = get_binop_left(n);
111 ir_node *right = get_binop_right(n);
113 show_entity_failure(n);
114 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
116 get_irn_opname(n), get_irn_modename(n),
117 get_irn_opname(left), get_irn_modename(left),
118 get_irn_opname(right), get_irn_modename(right),
123 * Prints a failure message for an unop
125 static void show_unop_failure(const ir_node *n, const char *text)
127 ir_node *op = get_unop_op(n);
129 show_entity_failure(n);
130 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
132 get_irn_opname(n), get_irn_modename(n),
133 get_irn_opname(op), get_irn_modename(op),
138 * Prints a failure message for an op with 3 operands
140 static void show_triop_failure(const ir_node *n, const char *text)
142 ir_node *op0 = get_irn_n(n, 0);
143 ir_node *op1 = get_irn_n(n, 1);
144 ir_node *op2 = get_irn_n(n, 2);
146 show_entity_failure(n);
147 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
149 get_irn_opname(n), get_irn_modename(n),
150 get_irn_opname(op0), get_irn_modename(op0),
151 get_irn_opname(op1), get_irn_modename(op1),
152 get_irn_opname(op2), get_irn_modename(op2),
157 * Prints a failure message for a proj
159 static void show_proj_failure(const ir_node *n)
161 ir_node *op = get_Proj_pred(n);
162 int proj = get_Proj_proj(n);
164 show_entity_failure(n);
165 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
167 get_irn_opname(n), get_irn_modename(n), proj,
168 get_irn_opname(op), get_irn_modename(op));
172 * Prints a failure message for a proj from Start
174 static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
176 long proj = get_Proj_proj(n);
177 ir_mode *m = get_type_mode(ty);
179 ir_print_type(type_name, sizeof(type_name), ty);
181 show_entity_failure(n);
182 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
187 get_mode_name_ex(m));
191 * Show a node and a graph
193 static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
195 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
199 * Show call parameters
201 static void show_call_param(const ir_node *n, ir_type *mt)
204 ir_print_type(type_name, sizeof(type_name), mt);
206 show_entity_failure(n);
207 fprintf(stderr, " Call type-check failed: %s(", type_name);
208 size_t n_method_params = get_method_n_params(mt);
209 for (size_t i = 0; i < n_method_params; ++i) {
210 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
212 fprintf(stderr, ") != CALL(");
214 int n_params = get_Call_n_params(n);
215 for (int i = 0; i < n_params; ++i) {
216 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
218 fprintf(stderr, ")\n");
224 static void show_return_modes(const ir_graph *irg, const ir_node *n,
227 ir_entity *ent = get_irg_entity(irg);
229 show_entity_failure(n);
230 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
231 get_irn_node_nr(n), get_entity_name(ent),
232 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
233 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
238 * Show return number of results
240 static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
242 ir_entity *ent = get_irg_entity(irg);
244 show_entity_failure(n);
245 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
246 get_irn_node_nr(n), get_entity_name(ent),
247 (unsigned long) get_Return_n_ress(n),
248 (unsigned long) get_method_n_ress(mt));
254 static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
257 show_entity_failure(phi);
258 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
259 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
260 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
266 static void show_phi_inputs(const ir_node *phi, const ir_node *block)
268 show_entity_failure(phi);
269 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
270 get_irn_node_nr(phi), get_irn_arity(phi),
271 get_irn_node_nr(block), get_irn_arity(block));
274 #endif /* #ifndef NDEBUG */
277 * verify a Proj(Start) node
279 static int verify_node_Proj_Start(const ir_node *p)
281 ir_mode *mode = get_irn_mode(p);
282 long proj = get_Proj_proj(p);
286 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
287 (proj == pn_Start_M && mode == mode_M) ||
288 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
289 (proj == pn_Start_T_args && mode == mode_T)
291 "wrong Proj from Start", 0,
292 show_proj_failure(p);
298 * verify a Proj(Cond) node
300 static int verify_node_Proj_Cond(const ir_node *p)
302 ir_mode *mode = get_irn_mode(p);
303 long proj = get_Proj_proj(p);
306 mode == mode_X && (proj == pn_Cond_false || proj == pn_Cond_true),
307 "wrong Proj from Cond", 0,
308 show_proj_failure(p);
313 static int verify_node_Proj_Switch(const ir_node *p)
315 ir_mode *mode = get_irn_mode(p);
316 long pn = get_Proj_proj(p);
317 ir_node *pred = get_Proj_pred(p);
319 mode == mode_X && (pn >= 0 && pn < (long)get_Switch_n_outs(pred)),
320 "wrong Proj from Switch", 0,
321 show_proj_failure(p);
327 * verify a Proj(Raise) node
329 static int verify_node_Proj_Raise(const ir_node *p)
331 ir_mode *mode = get_irn_mode(p);
332 long proj = get_Proj_proj(p);
335 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
336 "wrong Proj from Raise", 0,
337 show_proj_failure(p);
343 * verify a Proj(InstOf) node
345 static int verify_node_Proj_InstOf(const ir_node *p)
347 ir_mode *mode = get_irn_mode(p);
348 long proj = get_Proj_proj(p);
352 (proj == pn_InstOf_M && mode == mode_M) ||
353 (proj == pn_InstOf_X_regular && mode == mode_X) ||
354 (proj == pn_InstOf_X_except && mode == mode_X) ||
355 (proj == pn_InstOf_res && mode_is_reference(mode))
357 "wrong Proj from InstOf", 0,
358 show_proj_failure(p);
364 * verify a Proj(Call) node
366 static int verify_node_Proj_Call(const ir_node *p)
368 ir_mode *mode = get_irn_mode(p);
369 ir_node *n = get_Proj_pred(p);
370 long proj = get_Proj_proj(p);
374 (proj == pn_Call_M && mode == mode_M) ||
375 (proj == pn_Call_X_regular && mode == mode_X) ||
376 (proj == pn_Call_X_except && mode == mode_X) ||
377 (proj == pn_Call_T_result && mode == mode_T)
379 "wrong Proj from Call", 0,
380 show_proj_failure(p);
382 /* if we have exception flow, we must have a real Memory input */
383 if (proj == pn_Call_X_regular)
385 !is_NoMem(get_Call_mem(n)),
386 "Regular Proj from FunctionCall", 0);
387 else if (proj == pn_Call_X_except)
389 !is_NoMem(get_Call_mem(n)),
390 "Exception Proj from FunctionCall", 0);
395 * verify a Proj(Div) node
397 static int verify_node_Proj_Div(const ir_node *p)
399 ir_mode *mode = get_irn_mode(p);
400 ir_node *n = get_Proj_pred(p);
401 long proj = get_Proj_proj(p);
405 (proj == pn_Div_M && mode == mode_M) ||
406 (proj == pn_Div_X_regular && mode == mode_X) ||
407 (proj == pn_Div_X_except && mode == mode_X) ||
408 (proj == pn_Div_res && mode == get_Div_resmode(n))
410 "wrong Proj from Div", 0,
411 show_proj_failure(p);
413 if (proj == pn_Div_X_regular)
415 get_irn_pinned(n) == op_pin_state_pinned,
416 "Regular Proj from unpinned Div", 0);
417 else if (proj == pn_Div_X_except)
419 get_irn_pinned(n) == op_pin_state_pinned,
420 "Exception Proj from unpinned Div", 0);
421 else if (proj == pn_Div_M)
423 get_irn_pinned(n) == op_pin_state_pinned,
424 "Memory Proj from unpinned Div", 0);
429 * verify a Proj(Mod) node
431 static int verify_node_Proj_Mod(const ir_node *p)
433 ir_mode *mode = get_irn_mode(p);
434 ir_node *n = get_Proj_pred(p);
435 long proj = get_Proj_proj(p);
439 (proj == pn_Mod_M && mode == mode_M) ||
440 (proj == pn_Mod_X_regular && mode == mode_X) ||
441 (proj == pn_Mod_X_except && mode == mode_X) ||
442 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
444 "wrong Proj from Mod", 0,
445 show_proj_failure(p);
447 if (proj == pn_Mod_X_regular)
449 get_irn_pinned(n) == op_pin_state_pinned,
450 "Regular Proj from unpinned Mod", 0);
451 else if (proj == pn_Mod_X_except)
453 get_irn_pinned(n) == op_pin_state_pinned,
454 "Exception Proj from unpinned Mod", 0);
455 else if (proj == pn_Mod_M)
457 get_irn_pinned(n) == op_pin_state_pinned,
458 "Memory Proj from unpinned Div", 0);
463 * verify a Proj(Load) node
465 static int verify_node_Proj_Load(const ir_node *p)
467 ir_mode *mode = get_irn_mode(p);
468 ir_node *n = get_Proj_pred(p);
469 long proj = get_Proj_proj(p);
471 if (proj == pn_Load_res) {
473 mode_is_data(mode) && mode == get_Load_mode(n),
474 "wrong data Proj from Load", 0,
475 show_proj_failure(p);
480 (proj == pn_Load_M && mode == mode_M) ||
481 (proj == pn_Load_X_regular && mode == mode_X) ||
482 (proj == pn_Load_X_except && mode == mode_X)
484 "wrong Proj from Load", 0,
485 show_proj_failure(p);
488 if (proj == pn_Load_X_regular) {
490 get_irn_pinned(n) == op_pin_state_pinned,
491 "Regular Proj from unpinned Load", 0);
492 } else if (proj == pn_Load_X_except) {
494 get_irn_pinned(n) == op_pin_state_pinned,
495 "Exception Proj from unpinned Load", 0);
501 * verify a Proj(Store) node
503 static int verify_node_Proj_Store(const ir_node *p)
505 ir_mode *mode = get_irn_mode(p);
506 ir_node *n = get_Proj_pred(p);
507 long proj = get_Proj_proj(p);
511 (proj == pn_Store_M && mode == mode_M) ||
512 (proj == pn_Store_X_regular && mode == mode_X) ||
513 (proj == pn_Store_X_except && mode == mode_X)
515 "wrong Proj from Store", 0,
516 show_proj_failure(p);
518 if (proj == pn_Store_X_regular) {
520 get_irn_pinned(n) == op_pin_state_pinned,
521 "Regular Proj from unpinned Store", 0);
522 } else if (proj == pn_Store_X_except) {
524 get_irn_pinned(n) == op_pin_state_pinned,
525 "Exception Proj from unpinned Store", 0);
531 * verify a Proj(Alloc) node
533 static int verify_node_Proj_Alloc(const ir_node *p)
535 ir_mode *mode = get_irn_mode(p);
536 long proj = get_Proj_proj(p);
540 (proj == pn_Alloc_M && mode == mode_M) ||
541 (proj == pn_Alloc_X_regular && mode == mode_X) ||
542 (proj == pn_Alloc_X_except && mode == mode_X) ||
543 (proj == pn_Alloc_res && mode_is_reference(mode))
545 "wrong Proj from Alloc", 0,
546 show_proj_failure(p);
552 * verify a Proj(Proj) node
554 static int verify_node_Proj_Proj(const ir_node *p)
556 ir_mode *mode = get_irn_mode(p);
557 ir_node *pred = get_Proj_pred(p);
558 long proj = get_Proj_proj(p);
559 long nr = get_Proj_proj(pred);
560 ir_type *mt; /* A method type */
562 pred = skip_Id(get_Proj_pred(pred));
563 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
565 switch (get_irn_opcode(pred)) {
567 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
569 if (nr == pn_Start_T_args) {
571 (proj >= 0 && mode_is_datab(mode)),
572 "wrong Proj from Proj from Start", 0);
574 (proj < (int)get_method_n_params(mt)),
575 "More Projs for args than args in type", 0
577 ir_type *param_type = get_method_param_type(mt, proj);
578 if (mode_is_reference(mode) && (is_compound_type(param_type) || is_Array_type(param_type)))
579 /* value argument */ break;
581 if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
583 (mode == get_type_mode(param_type)),
584 "Mode of Proj from Start doesn't match mode of param type.", 0,
585 show_proj_mode_failure(p, get_method_param_type(mt, proj));
594 (proj >= 0 && mode_is_datab(mode)),
595 "wrong Proj from Proj from Call", 0);
596 mt = get_Call_type(pred);
597 ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
598 "wrong call type on call", 0);
600 (proj < (int)get_method_n_ress(mt)),
601 "More Projs for results than results in type.", 0);
602 ir_type *res_type = get_method_res_type(mt, proj);
604 if ((mode_is_reference(mode)) &&
605 (is_compound_type(res_type) || is_Array_type(res_type)))
609 (mode == get_type_mode(get_method_res_type(mt, proj))),
610 "Mode of Proj from Call doesn't match mode of result type.", 0);
619 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
626 * verify a Proj(Tuple) node
628 static int verify_node_Proj_Tuple(const ir_node *p)
636 * verify a Proj(CopyB) node
638 static int verify_node_Proj_CopyB(const ir_node *p)
640 ir_mode *mode = get_irn_mode(p);
641 ir_node *n = get_Proj_pred(p);
642 long proj = get_Proj_proj(p);
646 (proj == pn_CopyB_M && mode == mode_M) ||
647 (proj == pn_CopyB_X_regular && mode == mode_X) ||
648 (proj == pn_CopyB_X_except && mode == mode_X)
650 "wrong Proj from CopyB", 0,
651 show_proj_failure(p);
653 if (proj == pn_CopyB_X_regular)
655 get_irn_pinned(n) == op_pin_state_pinned,
656 "Regular Proj from unpinned CopyB", 0);
657 else if (proj == pn_CopyB_X_except)
659 get_irn_pinned(n) == op_pin_state_pinned,
660 "Exception Proj from unpinned CopyB", 0);
664 static int verify_node_Proj_fragile(const ir_node *node)
666 ir_node *pred = get_Proj_pred(node);
667 int throws_exception = ir_throws_exception(pred);
668 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
669 && (!is_x_regular_Proj(node) || throws_exception),
670 "X_except und X_regular Proj only allowed when throws_exception is set",
678 static int verify_node_Proj(const ir_node *p)
680 ir_graph *irg = get_irn_irg(p);
684 pred = skip_Id(get_Proj_pred(p));
685 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
686 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);
688 if (is_fragile_op(pred)) {
689 int res = verify_node_Proj_fragile(p);
694 op = get_irn_op(pred);
695 if (op->ops.verify_proj_node)
696 return op->ops.verify_proj_node(p);
703 * verify a Block node
705 static int verify_node_Block(const ir_node *n)
707 ir_graph *irg = get_irn_irg(n);
710 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
711 ir_node *pred = get_Block_cfgpred(n, i);
712 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
713 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
714 "Block node must have a mode_X predecessor", 0);
715 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
718 if (n == get_irg_start_block(irg)) {
719 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
722 if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
723 /* End block may only have Return, Raise or fragile ops as preds. */
724 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
725 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
726 if (is_Proj(pred) || is_Tuple(pred))
727 break; /* We can not test properly. How many tuples are there? */
735 "End Block node", 0);
738 /* irg attr must == graph we are in. */
739 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
744 * verify a Start node
746 static int verify_node_Start(const ir_node *n)
748 ir_mode *mymode = get_irn_mode(n);
751 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
752 mymode == mode_T, "Start node", 0
760 static int verify_node_Jmp(const ir_node *n)
762 ir_mode *mymode = get_irn_mode(n);
766 mymode == mode_X, "Jmp node", 0
772 * verify an IJmp node
774 static int verify_node_IJmp(const ir_node *n)
776 ir_mode *mymode = get_irn_mode(n);
777 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
780 /* IJmp: BB x ref --> X */
781 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
789 static int verify_node_Cond(const ir_node *n)
791 ir_mode *mymode = get_irn_mode(n);
792 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
794 ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
795 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
799 static int verify_switch_table(const ir_node *n)
801 const ir_switch_table *table = get_Switch_table(n);
802 unsigned n_outs = get_Switch_n_outs(n);
803 ir_node *selector = get_Switch_selector(n);
804 ir_mode *mode = get_irn_mode(selector);
808 ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
810 n_entries = ir_switch_table_get_n_entries(table);
811 for (e = 0; e < n_entries; ++e) {
812 const ir_switch_table_entry *entry
813 = ir_switch_table_get_entry_const(table, e);
816 ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
817 "switch table entry without min+max value", 0);
818 ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
819 get_tarval_mode(entry->max) == mode,
820 "switch table entry with wrong modes", 0);
821 ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
822 "switch table entry without min+max value", 0);
823 ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
824 "switch table entry with invalid proj number", 0);
829 static int verify_node_Switch(const ir_node *n)
831 ir_mode *mymode = get_irn_mode(n);
832 ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
833 if (!verify_switch_table(n))
836 ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
837 ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
842 * verify a Return node
844 static int verify_node_Return(const ir_node *n)
846 ir_graph *irg = get_irn_irg(n);
847 ir_mode *mymode = get_irn_mode(n);
848 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
852 /* Return: BB x M x data1 x ... x datan --> X */
854 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
856 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
857 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
859 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
860 /* Compare returned results with result types of method type */
861 mt = get_entity_type(get_irg_entity(irg));
862 ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
863 "Number of results for Return doesn't match number of results in type.", 0,
864 show_return_nres(irg, n, mt););
865 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
866 ir_type *res_type = get_method_res_type(mt, i);
868 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
869 if (is_atomic_type(res_type)) {
871 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
872 "Mode of result for Return doesn't match mode of result type.", 0,
873 show_return_modes(irg, n, mt, i);
877 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
878 "Mode of result for Return doesn't match mode of result type.", 0,
879 show_return_modes(irg, n, mt, i);
888 * verify a Raise node
890 static int verify_node_Raise(const ir_node *n)
892 ir_mode *mymode = get_irn_mode(n);
893 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
894 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
897 /* Sel: BB x M x ref --> X x M */
898 op1mode == mode_M && mode_is_reference(op2mode) &&
899 mymode == mode_T, "Raise node", 0
905 * verify a Const node
907 static int verify_node_Const(const ir_node *n)
909 ir_mode *mymode = get_irn_mode(n);
912 /* Const: BB --> data */
913 (mode_is_data(mymode) ||
914 mymode == mode_b) /* we want boolean constants for static evaluation */
915 ,"Const node", 0 /* of Cmp. */
918 /* the modes of the constant and teh tarval must match */
919 mymode == get_tarval_mode(get_Const_tarval(n)),
920 "Const node, tarval and node mode mismatch", 0
926 * verify a SymConst node
928 static int verify_node_SymConst(const ir_node *n)
930 ir_mode *mymode = get_irn_mode(n);
933 /* SymConst: BB --> int*/
934 (mode_is_int(mymode) ||
935 /* SymConst: BB --> ref */
936 mode_is_reference(mymode))
937 ,"SymConst node", 0);
938 if (SYMCONST_HAS_ENT(get_SymConst_kind(n))) {
939 ir_entity *ent = get_SymConst_entity(n);
940 /* the is_method_entity(ent) exception is for nested functions... */
941 ASSERT_AND_RET_DBG((get_entity_owner(ent)->flags & tf_segment)
942 || is_method_entity(ent),
943 "SymConst node with non-segment entity", 0,
944 show_node_failure(n););
952 static int verify_node_Sel(const ir_node *n)
955 ir_mode *mymode = get_irn_mode(n);
956 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
957 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
961 /* Sel: BB x M x ref x int^n --> ref */
962 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
963 "Sel node", 0, show_node_failure(n);
966 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
967 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
969 ent = get_Sel_entity(n);
970 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
971 ASSERT_AND_RET_DBG(!(get_entity_owner(ent)->flags & tf_segment),
972 "Sel node with global entity", 0, show_node_failure(n););
977 * verify an InstOf node
979 static int verify_node_InstOf(const ir_node *n)
981 ir_mode *mymode = get_irn_mode(n);
982 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
984 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
985 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
990 * Check if the pinned state is right.
992 static int verify_right_pinned(const ir_node *n)
996 if (get_irn_pinned(n) == op_pin_state_pinned)
998 mem = get_Call_mem(n);
1000 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1001 if (is_NoMem(mem) || is_Pin(mem))
1007 * verify a Call node
1009 static int verify_node_Call(const ir_node *n)
1011 ir_graph *irg = get_irn_irg(n);
1012 ir_mode *mymode = get_irn_mode(n);
1013 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1014 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1019 /* Call: BB x M x ref x data1 x ... x datan
1020 --> M x datan+1 x ... x data n+m */
1021 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1023 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1024 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1026 mt = get_Call_type(n);
1027 if (get_unknown_type() == mt) {
1031 n_params = get_Call_n_params(n);
1032 for (i = 0; i < n_params; ++i) {
1033 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1036 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1037 /* Compare arguments of node with those of type */
1039 if (get_method_variadicity(mt) == variadicity_variadic) {
1041 (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
1042 "Number of args for Call doesn't match number of args in variadic type.",
1044 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1045 n, get_Call_n_params(n), get_method_n_params(mt));
1049 (size_t)get_Call_n_params(n) == get_method_n_params(mt),
1050 "Number of args for Call doesn't match number of args in non variadic type.",
1052 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1053 n, get_Call_n_params(n), get_method_n_params(mt));
1057 for (i = 0; i < get_method_n_params(mt); i++) {
1058 ir_type *t = get_method_param_type(mt, i);
1060 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1061 if (is_atomic_type(t)) {
1063 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1064 "Mode of arg for Call doesn't match mode of arg type.", 0,
1065 show_call_param(n, mt);
1068 /* call with a compound type, mode must be reference */
1070 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1071 "Mode of arg for Call doesn't match mode of arg type.", 0,
1072 show_call_param(n, mt);
1082 * verify an Add node
1084 static int verify_node_Add(const ir_node *n)
1086 ir_mode *mymode = get_irn_mode(n);
1087 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1088 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1092 /* common Add: BB x numP x numP --> numP */
1093 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1094 /* Pointer Add: BB x ref x int --> ref */
1095 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1096 /* Pointer Add: BB x int x ref --> ref */
1097 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1100 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1101 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1102 "/* Pointer Add: BB x int x ref --> ref */");
1110 static int verify_node_Sub(const ir_node *n)
1112 ir_mode *mymode = get_irn_mode(n);
1113 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1114 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1118 /* common Sub: BB x numP x numP --> numP */
1119 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1120 /* Pointer Sub: BB x ref x int --> ref */
1121 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1122 /* Pointer Sub: BB x ref x ref --> int */
1123 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1126 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1127 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1128 "/* Pointer Sub: BB x ref x ref --> int */" );
1134 * verify a Minus node
1136 static int verify_node_Minus(const ir_node *n)
1138 ir_mode *mymode = get_irn_mode(n);
1139 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1142 /* Minus: BB x num --> num */
1143 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1144 show_unop_failure(n , "/* Minus: BB x num --> num */");
1152 static int verify_node_Mul(const ir_node *n)
1154 ir_mode *mymode = get_irn_mode(n);
1155 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1156 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1160 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1161 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1162 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1163 /* Mul: BB x float x float --> float */
1164 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1167 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1168 "/* Mul: BB x float x float --> float */");
1174 * verify a Mulh node
1176 static int verify_node_Mulh(const ir_node *n)
1178 ir_mode *mymode = get_irn_mode(n);
1179 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1180 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1184 /* Mulh: BB x int x int --> int */
1185 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1188 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1196 static int verify_node_Div(const ir_node *n)
1198 ir_mode *mymode = get_irn_mode(n);
1199 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1200 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1201 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1202 ir_mode *resmode = get_Div_resmode(n);
1205 /* Div: BB x M x num x num --> M x X x num */
1206 op1mode == mode_M &&
1207 op2mode == resmode &&
1208 op3mode == resmode &&
1209 mode_is_num(resmode) &&
1219 static int verify_node_Mod(const ir_node *n)
1221 ir_mode *mymode = get_irn_mode(n);
1222 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1223 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1224 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1225 ir_mode *resmode = get_Mod_resmode(n);
1228 /* Mod: BB x M x int x int --> M x X x int */
1229 op1mode == mode_M &&
1230 op2mode == resmode &&
1231 op3mode == resmode &&
1232 mode_is_int(resmode) &&
1240 * verify a logical And, Or, Eor node
1242 static int verify_node_Logic(const ir_node *n)
1244 ir_mode *mymode = get_irn_mode(n);
1245 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1246 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1249 /* And or Or or Eor: BB x int x int --> int */
1250 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1251 op2mode == op1mode &&
1253 "And, Or or Eor node", 0,
1254 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1259 static int verify_node_And(const ir_node *n)
1261 return verify_node_Logic(n);
1264 static int verify_node_Or(const ir_node *n)
1266 return verify_node_Logic(n);
1269 static int verify_node_Eor(const ir_node *n)
1271 return verify_node_Logic(n);
1277 static int verify_node_Not(const ir_node *n)
1279 ir_mode *mymode = get_irn_mode(n);
1280 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1283 /* Not: BB x int --> int */
1284 (mode_is_int(mymode) || mymode == mode_b) &&
1287 show_unop_failure(n, "/* Not: BB x int --> int */");
1295 static int verify_node_Cmp(const ir_node *n)
1297 ir_mode *mymode = get_irn_mode(n);
1298 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1299 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1302 /* Cmp: BB x datab x datab --> b16 */
1303 mode_is_datab(op1mode) &&
1304 op2mode == op1mode &&
1307 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1313 * verify a Shift node
1315 static int verify_node_Shift(const ir_node *n)
1317 ir_mode *mymode = get_irn_mode(n);
1318 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1319 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1322 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1323 mode_is_int(op1mode) &&
1324 mode_is_int(op2mode) &&
1325 !mode_is_signed(op2mode) &&
1327 "Shl, Shr or Shrs node", 0,
1328 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1333 static int verify_node_Shl(const ir_node *n)
1335 return verify_node_Shift(n);
1338 static int verify_node_Shr(const ir_node *n)
1340 return verify_node_Shift(n);
1343 static int verify_node_Shrs(const ir_node *n)
1345 return verify_node_Shift(n);
1349 * verify a Rotl node
1351 static int verify_node_Rotl(const ir_node *n)
1353 ir_mode *mymode = get_irn_mode(n);
1354 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1355 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1358 /* Rotl: BB x int x int --> int */
1359 mode_is_int(op1mode) &&
1360 mode_is_int(op2mode) &&
1363 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1369 * verify a Conv node
1371 static int verify_node_Conv(const ir_node *n)
1373 ir_mode *mymode = get_irn_mode(n);
1374 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1376 ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
1378 show_unop_failure(n, "/* Conv: BB x data --> data */");
1386 static int verify_node_Phi(const ir_node *n)
1388 ir_mode *mymode = get_irn_mode(n);
1389 ir_node *block = get_nodes_block(n);
1392 /* a Phi node MUST have the same number of inputs as its block
1393 * Exception is a phi with 0 inputs which is used when (re)constructing the
1396 && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
1397 && get_irn_arity(n) > 0) {
1399 get_irn_arity(n) == get_irn_arity(block),
1400 "wrong number of inputs in Phi node", 0,
1401 show_phi_inputs(n, block);
1405 /* Phi: BB x dataM^n --> dataM */
1406 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1407 ir_node *pred = get_Phi_pred(n, i);
1408 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1409 "Phi node", 0, show_phi_failure(n, pred, i);
1412 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1418 * verify a Load node
1420 static int verify_node_Load(const ir_node *n)
1422 ir_graph *irg = get_irn_irg(n);
1423 ir_mode *mymode = get_irn_mode(n);
1424 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1425 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1427 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1428 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1429 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1431 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1437 * verify a Store node
1439 static int verify_node_Store(const ir_node *n)
1441 ir_graph *irg = get_irn_irg(n);
1443 ir_mode *mymode = get_irn_mode(n);
1444 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1445 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1446 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1448 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1449 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1450 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1452 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1458 * verify an Alloc node
1460 static int verify_node_Alloc(const ir_node *n)
1462 ir_mode *mymode = get_irn_mode(n);
1463 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1464 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1467 /* Alloc: BB x M x int_u --> M x X x ref */
1468 op1mode == mode_M &&
1469 mode_is_int(op2mode) &&
1470 !mode_is_signed(op2mode) &&
1473 show_node_failure(n);
1479 * verify a Free node
1481 static int verify_node_Free(const ir_node *n)
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1485 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1486 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1489 /* Free: BB x M x ref x int_u --> M */
1490 op1mode == mode_M && mode_is_reference(op2mode) &&
1491 mode_is_int(op3mode) &&
1492 !mode_is_signed(op3mode) &&
1495 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1501 * verify a Sync node
1503 static int verify_node_Sync(const ir_node *n)
1506 ir_mode *mymode = get_irn_mode(n);
1508 /* Sync: BB x M^n --> M */
1509 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1510 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1512 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1517 * verify a Confirm node
1519 static int verify_node_Confirm(const ir_node *n)
1521 ir_mode *mymode = get_irn_mode(n);
1522 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1523 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1526 /* Confirm: BB x T x T --> T */
1527 op1mode == mymode &&
1530 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1538 static int verify_node_Mux(const ir_node *n)
1540 ir_mode *mymode = get_irn_mode(n);
1541 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1542 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1543 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1546 /* Mux: BB x b x datab x datab --> datab */
1547 op1mode == mode_b &&
1548 op2mode == mymode &&
1549 op3mode == mymode &&
1550 mode_is_datab(mymode),
1557 * verify a CopyB node
1559 static int verify_node_CopyB(const ir_node *n)
1561 ir_graph *irg = get_irn_irg(n);
1562 ir_mode *mymode = get_irn_mode(n);
1563 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1564 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1565 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1566 ir_type *t = get_CopyB_type(n);
1568 /* CopyB: BB x M x ref x ref --> M x X */
1569 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1570 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1571 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1576 is_compound_type(t) || is_Array_type(t),
1577 "CopyB node should copy compound types only", 0 );
1579 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1580 This should happen RARELY, as CopyB COPIES MEMORY */
1581 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1587 * For each usage of a node, it is checked, if the block of the
1588 * node dominates the block of the usage (for phis: the predecessor
1589 * block of the phi for the corresponding edge).
1591 * @return non-zero on success, 0 on dominance error
1593 static int check_dominance_for_node(const ir_node *use)
1595 /* This won't work for blocks and the end node */
1596 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1598 ir_node *bl = get_nodes_block(use);
1600 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1601 ir_node *def = get_irn_n(use, i);
1602 ir_node *def_bl = get_nodes_block(def);
1603 ir_node *use_bl = bl;
1606 /* we have no dominance relation for unreachable blocks, so we can't
1607 * check the dominance property there */
1608 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1614 use_bl = get_Block_cfgpred_block(bl, i);
1617 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1620 irg = get_irn_irg(use);
1622 block_dominates(def_bl, use_bl),
1623 "the definition of a value used violates the dominance property", 0,
1625 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1626 irg, def_bl, def, use_bl, use, i
1634 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1638 if (!get_node_verification_mode())
1642 * do NOT check placement in interprocedural view, as we don't always
1643 * know the "right" graph ...
1647 /* this is an expensive check for large graphs (it has a quadratic
1648 * runtime but with a small constant); so do NOT run it in release mode
1651 node_is_in_irgs_storage(irg, n),
1652 "Node is not stored on proper IR graph!", 0,
1653 show_node_on_graph(irg, n);
1656 assert(get_irn_irg(n) == irg);
1658 unsigned idx = get_irn_idx(n);
1659 ir_node *node_from_map = get_idx_irn(irg, idx);
1660 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1661 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1667 if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
1668 op_pin_state state = get_irn_pinned(n);
1670 state == op_pin_state_floats ||
1671 state == op_pin_state_pinned,
1672 "invalid pin state", 0,
1673 ir_printf("node %+F", n);
1675 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1676 && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
1677 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1678 "block input is not a block", 0,
1679 ir_printf("node %+F", n);
1684 !is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
1685 "node should be in start block", 0,
1686 ir_printf("node %+F", n);
1689 if (op->ops.verify_node)
1690 return op->ops.verify_node(n);
1696 int irn_verify(const ir_node *n)
1698 #ifdef DEBUG_libfirm
1699 return irn_verify_irg(n, get_irn_irg(n));
1706 /*-----------------------------------------------------------------*/
1707 /* Verify the whole graph. */
1708 /*-----------------------------------------------------------------*/
1710 #ifdef DEBUG_libfirm
1712 * Walker to check every node
1714 static void verify_wrap(ir_node *node, void *env)
1716 int *res = (int*)env;
1717 *res = irn_verify_irg(node, get_irn_irg(node));
1721 * Walker to check every node including SSA property.
1722 * Only called if dominance info is available.
1724 static void verify_wrap_ssa(ir_node *node, void *env)
1726 int *res = (int*)env;
1728 *res = irn_verify_irg(node, get_irn_irg(node));
1730 *res = check_dominance_for_node(node);
1734 #endif /* DEBUG_libfirm */
1736 typedef struct check_cfg_env_t {
1737 pmap *branch_nodes; /**< map blocks to their branching nodes,
1738 map mode_X nodes to the blocks they branch to */
1740 ir_nodeset_t reachable_blocks;
1741 ir_nodeset_t kept_nodes;
1742 ir_nodeset_t true_projs;
1743 ir_nodeset_t false_projs;
1746 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1752 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1753 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1754 ir_printf("block %+F\n", block);
1757 n_cfgpreds = get_Block_n_cfgpreds(block);
1758 branch_nodes = env->branch_nodes;
1759 for (i = 0; i < n_cfgpreds; ++i) {
1760 /* check that each mode_X node is only connected
1762 ir_node *branch = get_Block_cfgpred(block, i);
1763 ir_node *former_dest;
1764 ir_node *former_branch;
1765 ir_node *branch_proj;
1766 ir_node *branch_block;
1767 branch = skip_Tuple(branch);
1770 former_dest = pmap_get(ir_node, branch_nodes, branch);
1771 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1772 "Multiple users on mode_X node", 0,
1773 ir_printf("node %+F\n", branch);
1775 pmap_insert(branch_nodes, branch, (void*)block);
1777 /* check that there's only 1 branching instruction in each block */
1778 branch_block = get_nodes_block(branch);
1779 branch_proj = branch;
1780 if (is_Proj(branch)) {
1781 branch = skip_Proj(branch);
1783 former_branch = pmap_get(ir_node, branch_nodes, branch_block);
1785 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1786 "Multiple branching nodes in a block", 0,
1787 ir_printf("nodes %+F,%+F in block %+F\n",
1788 branch, former_branch, branch_block);
1790 pmap_insert(branch_nodes, branch_block, branch);
1792 if (is_Cond(branch)) {
1793 long pn = get_Proj_proj(branch_proj);
1794 if (pn == pn_Cond_true)
1795 ir_nodeset_insert(&env->true_projs, branch);
1796 if (pn == pn_Cond_false)
1797 ir_nodeset_insert(&env->false_projs, branch);
1798 } else if (is_Switch(branch)) {
1799 long pn = get_Proj_proj(branch_proj);
1800 if (pn == pn_Switch_default)
1801 ir_nodeset_insert(&env->true_projs, branch);
1808 static void check_cfg_walk_func(ir_node *node, void *data)
1810 check_cfg_env_t *env = (check_cfg_env_t*)data;
1811 if (!is_Block(node))
1813 env->res &= check_block_cfg(node, env);
1816 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1818 ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
1819 ASSERT_AND_RET_DBG(branch != NULL
1820 || ir_nodeset_contains(&env->kept_nodes, block)
1821 || block == get_irg_end_block(get_irn_irg(block)),
1822 "block contains no cfop", 0,
1823 ir_printf("block %+F\n", block);
1828 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1830 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1831 "Cond node lacks true proj", 0,
1832 ir_printf("Cond %+F\n", cond);
1834 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1835 "Cond node lacks false proj", 0,
1836 ir_printf("Cond %+F\n", cond);
1841 static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
1843 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
1844 "Switch node lacks default Proj", 0,
1845 ir_printf("Switch %+F\n", sw);
1850 static void assert_branch(ir_node *node, void *data)
1852 check_cfg_env_t *env = (check_cfg_env_t*)data;
1853 if (is_Block(node)) {
1854 env->res &= verify_block_branch(node, env);
1855 } else if (is_Cond(node)) {
1856 env->res &= verify_cond_projs(node, env);
1857 } else if (is_Switch(node)) {
1858 env->res &= verify_switch_projs(node, env);
1862 static void collect_reachable_blocks(ir_node *block, void *data)
1864 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1865 ir_nodeset_insert(reachable_blocks, block);
1869 * Checks CFG well-formedness
1871 static int check_cfg(ir_graph *irg)
1873 check_cfg_env_t env;
1874 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1876 ir_nodeset_init(&env.reachable_blocks);
1877 ir_nodeset_init(&env.true_projs);
1878 ir_nodeset_init(&env.false_projs);
1880 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1881 &env.reachable_blocks);
1883 /* note that we do not use irg_walk_block because it will miss these
1884 * invalid blocks without a jump instruction which we want to detect
1886 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1888 ir_nodeset_init(&env.kept_nodes);
1890 ir_node *end = get_irg_end(irg);
1891 int arity = get_irn_arity(end);
1893 for (i = 0; i < arity; ++i) {
1894 ir_node *n = get_irn_n(end, i);
1895 ir_nodeset_insert(&env.kept_nodes, n);
1898 irg_walk_graph(irg, assert_branch, NULL, &env);
1900 ir_nodeset_destroy(&env.false_projs);
1901 ir_nodeset_destroy(&env.true_projs);
1902 ir_nodeset_destroy(&env.kept_nodes);
1903 ir_nodeset_destroy(&env.reachable_blocks);
1904 pmap_destroy(env.branch_nodes);
1908 int irg_verify(ir_graph *irg, unsigned flags)
1911 #ifdef DEBUG_libfirm
1912 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1915 last_irg_error = NULL;
1918 if (pinned && !check_cfg(irg))
1921 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
1926 pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
1927 ? verify_wrap_ssa : verify_wrap,
1932 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1933 ir_entity *ent = get_irg_entity(irg);
1936 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1938 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1944 #endif /* DEBUG_libfirm */
1949 typedef struct pass_t {
1950 ir_graph_pass_t pass;
1955 * Wrapper to irg_verify to be run as an ir_graph pass.
1957 static int irg_verify_wrapper(ir_graph *irg, void *context)
1959 pass_t *pass = (pass_t*)context;
1960 irg_verify(irg, pass->flags);
1961 /* do NOT rerun the pass if verify is ok :-) */
1965 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1967 pass_t *pass = XMALLOCZ(pass_t);
1969 def_graph_pass_constructor(
1970 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1972 /* neither dump for verify */
1973 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1974 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1976 pass->flags = flags;
1980 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
1981 const char **bad_string)
1984 firm_verification_t old = get_node_verification_mode();
1986 firm_verify_failure_msg = NULL;
1987 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1988 res = irn_verify_irg(n, irg);
1989 if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
1990 get_irg_pinned(irg) == op_pin_state_pinned)
1991 res = check_dominance_for_node(n);
1992 do_node_verification(old);
1993 *bad_string = firm_verify_failure_msg;
1998 typedef struct verify_bad_env_t {
2004 * Pre-Walker: check Bad predecessors of node.
2006 static void check_bads(ir_node *node, void *env)
2008 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2009 int i, arity = get_irn_arity(node);
2010 ir_graph *irg = get_irn_irg(node);
2012 if (is_Block(node)) {
2013 if ((venv->flags & BAD_CF) == 0) {
2015 /* check for Bad Block predecessor */
2016 for (i = 0; i < arity; ++i) {
2017 ir_node *pred = get_irn_n(node, i);
2020 venv->res |= BAD_CF;
2022 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2023 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2025 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2026 dump_ir_graph(irg, "assert");
2027 assert(0 && "Bad CF detected");
2033 if ((venv->flags & BAD_BLOCK) == 0) {
2035 /* check for Bad Block */
2036 if (is_Bad(get_nodes_block(node))) {
2037 venv->res |= BAD_BLOCK;
2039 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2040 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2042 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2043 dump_ir_graph(irg, "assert");
2044 assert(0 && "Bad CF detected");
2049 if ((venv->flags & TUPLE) == 0) {
2050 if (is_Tuple(node)) {
2053 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2054 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2056 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2057 dump_ir_graph(irg, "assert");
2058 assert(0 && "Tuple detected");
2063 for (i = 0; i < arity; ++i) {
2064 ir_node *pred = get_irn_n(node, i);
2067 /* check for Phi with Bad inputs */
2068 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2069 if (venv->flags & BAD_CF)
2072 venv->res |= BAD_CF;
2074 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2075 fprintf(stderr, "irg_verify_bads: Phi %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 CF detected");
2084 /* Bad node input */
2085 if ((venv->flags & BAD_DF) == 0) {
2086 venv->res |= BAD_DF;
2088 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2089 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2091 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2092 dump_ir_graph(irg, "assert");
2093 assert(0 && "Bad NON-CF detected");
2101 int irg_verify_bads(ir_graph *irg, int flags)
2103 verify_bad_env_t env;
2108 irg_walk_graph(irg, check_bads, NULL, &env);
2113 static void register_verify_node_func(ir_op *op, verify_node_func func)
2115 op->ops.verify_node = func;
2118 static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
2120 op->ops.verify_proj_node = func;
2123 void ir_register_verify_node_ops(void)
2125 register_verify_node_func(op_Add, verify_node_Add);
2126 register_verify_node_func(op_Alloc, verify_node_Alloc);
2127 register_verify_node_func(op_And, verify_node_And);
2128 register_verify_node_func(op_Block, verify_node_Block);
2129 register_verify_node_func(op_Call, verify_node_Call);
2130 register_verify_node_func(op_Cmp, verify_node_Cmp);
2131 register_verify_node_func(op_Cond, verify_node_Cond);
2132 register_verify_node_func(op_Confirm, verify_node_Confirm);
2133 register_verify_node_func(op_Const, verify_node_Const);
2134 register_verify_node_func(op_Conv, verify_node_Conv);
2135 register_verify_node_func(op_CopyB, verify_node_CopyB);
2136 register_verify_node_func(op_Div, verify_node_Div);
2137 register_verify_node_func(op_Eor, verify_node_Eor);
2138 register_verify_node_func(op_Free, verify_node_Free);
2139 register_verify_node_func(op_IJmp, verify_node_IJmp);
2140 register_verify_node_func(op_InstOf, verify_node_InstOf);
2141 register_verify_node_func(op_Jmp, verify_node_Jmp);
2142 register_verify_node_func(op_Load, verify_node_Load);
2143 register_verify_node_func(op_Minus, verify_node_Minus);
2144 register_verify_node_func(op_Mod, verify_node_Mod);
2145 register_verify_node_func(op_Mul, verify_node_Mul);
2146 register_verify_node_func(op_Mulh, verify_node_Mulh);
2147 register_verify_node_func(op_Mux, verify_node_Mux);
2148 register_verify_node_func(op_Not, verify_node_Not);
2149 register_verify_node_func(op_Or, verify_node_Or);
2150 register_verify_node_func(op_Phi, verify_node_Phi);
2151 register_verify_node_func(op_Proj, verify_node_Proj);
2152 register_verify_node_func(op_Raise, verify_node_Raise);
2153 register_verify_node_func(op_Return, verify_node_Return);
2154 register_verify_node_func(op_Rotl, verify_node_Rotl);
2155 register_verify_node_func(op_Sel, verify_node_Sel);
2156 register_verify_node_func(op_Shl, verify_node_Shl);
2157 register_verify_node_func(op_Shr, verify_node_Shr);
2158 register_verify_node_func(op_Shrs, verify_node_Shrs);
2159 register_verify_node_func(op_Start, verify_node_Start);
2160 register_verify_node_func(op_Store, verify_node_Store);
2161 register_verify_node_func(op_Sub, verify_node_Sub);
2162 register_verify_node_func(op_Switch, verify_node_Switch);
2163 register_verify_node_func(op_SymConst, verify_node_SymConst);
2164 register_verify_node_func(op_Sync, verify_node_Sync);
2166 register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
2167 register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
2168 register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
2169 register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);
2170 register_verify_node_func_proj(op_Div, verify_node_Proj_Div);
2171 register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
2172 register_verify_node_func_proj(op_Load, verify_node_Proj_Load);
2173 register_verify_node_func_proj(op_Mod, verify_node_Proj_Mod);
2174 register_verify_node_func_proj(op_Proj, verify_node_Proj_Proj);
2175 register_verify_node_func_proj(op_Raise, verify_node_Proj_Raise);
2176 register_verify_node_func_proj(op_Start, verify_node_Proj_Start);
2177 register_verify_node_func_proj(op_Store, verify_node_Proj_Store);
2178 register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
2179 register_verify_node_func_proj(op_Tuple, verify_node_Proj_Tuple);