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
29 #include "irgraph_t.h"
30 #include "irverify_t.h"
38 #include "irnodeset.h"
41 const char *firm_verify_failure_msg;
46 * little helper for NULL modes
48 static const char *get_mode_name_ex(ir_mode *mode)
52 return get_mode_name(mode);
55 /** the last IRG, on which a verification error was found */
56 static ir_graph *last_irg_error = NULL;
59 * print the name of the entity of an verification failure
61 * @param node the node caused the failure
63 static void show_entity_failure(const ir_node *node)
65 ir_graph *irg = get_irn_irg(node);
67 if (last_irg_error == irg)
72 if (irg == get_const_code_irg()) {
73 fprintf(stderr, "\nFIRM: irn_verify_irg() <of CONST_CODE_IRG> failed\n");
75 ir_entity *ent = get_irg_entity(irg);
78 ir_type *ent_type = get_entity_owner(ent);
81 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n",
82 ent_type, get_entity_name(ent));
84 fprintf(stderr, "\nFIRM: irn_verify_irg() <NULL>::%s failed\n", get_entity_name(ent));
87 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
92 static const char *get_irn_modename(const ir_node *node)
94 ir_mode *mode = get_irn_mode(node);
95 return get_mode_name(mode);
99 * Prints a failure for a Node
101 static void show_node_failure(const ir_node *n)
103 show_entity_failure(n);
104 fprintf(stderr, " node %ld %s%s\n" ,
106 get_irn_opname(n), get_irn_modename(n)
111 * Prints a failure message for a binop
113 static void show_binop_failure(const ir_node *n, const char *text)
115 ir_node *left = get_binop_left(n);
116 ir_node *right = get_binop_right(n);
118 show_entity_failure(n);
119 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
121 get_irn_opname(n), get_irn_modename(n),
122 get_irn_opname(left), get_irn_modename(left),
123 get_irn_opname(right), get_irn_modename(right),
128 * Prints a failure message for an unop
130 static void show_unop_failure(const ir_node *n, const char *text)
132 ir_node *op = get_unop_op(n);
134 show_entity_failure(n);
135 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
137 get_irn_opname(n), get_irn_modename(n),
138 get_irn_opname(op), get_irn_modename(op),
143 * Prints a failure message for an op with 3 operands
145 static void show_triop_failure(const ir_node *n, const char *text)
147 ir_node *op0 = get_irn_n(n, 0);
148 ir_node *op1 = get_irn_n(n, 1);
149 ir_node *op2 = get_irn_n(n, 2);
151 show_entity_failure(n);
152 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
154 get_irn_opname(n), get_irn_modename(n),
155 get_irn_opname(op0), get_irn_modename(op0),
156 get_irn_opname(op1), get_irn_modename(op1),
157 get_irn_opname(op2), get_irn_modename(op2),
162 * Prints a failure message for a proj
164 static void show_proj_failure(const ir_node *n)
166 ir_node *op = get_Proj_pred(n);
167 int proj = get_Proj_proj(n);
169 show_entity_failure(n);
170 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
172 get_irn_opname(n), get_irn_modename(n), proj,
173 get_irn_opname(op), get_irn_modename(op));
177 * Prints a failure message for a proj from Start
179 static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
181 long proj = get_Proj_proj(n);
182 ir_mode *m = get_type_mode(ty);
184 ir_print_type(type_name, sizeof(type_name), ty);
186 show_entity_failure(n);
187 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
192 get_mode_name_ex(m));
196 * Show a node and a graph
198 static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
200 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
204 * Show call parameters
206 static void show_call_param(const ir_node *n, ir_type *mt)
209 ir_print_type(type_name, sizeof(type_name), mt);
211 show_entity_failure(n);
212 fprintf(stderr, " Call type-check failed: %s(", type_name);
213 size_t n_method_params = get_method_n_params(mt);
214 for (size_t i = 0; i < n_method_params; ++i) {
215 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
217 fprintf(stderr, ") != CALL(");
219 int n_params = get_Call_n_params(n);
220 for (int i = 0; i < n_params; ++i) {
221 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
223 fprintf(stderr, ")\n");
229 static void show_return_modes(const ir_graph *irg, const ir_node *n,
232 ir_entity *ent = get_irg_entity(irg);
234 show_entity_failure(n);
235 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
236 get_irn_node_nr(n), get_entity_name(ent),
237 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
238 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
243 * Show return number of results
245 static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
247 ir_entity *ent = get_irg_entity(irg);
249 show_entity_failure(n);
250 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
251 get_irn_node_nr(n), get_entity_name(ent),
252 (unsigned long) get_Return_n_ress(n),
253 (unsigned long) get_method_n_ress(mt));
259 static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
262 show_entity_failure(phi);
263 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
264 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
265 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
271 static void show_phi_inputs(const ir_node *phi, const ir_node *block)
273 show_entity_failure(phi);
274 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
275 get_irn_node_nr(phi), get_irn_arity(phi),
276 get_irn_node_nr(block), get_irn_arity(block));
279 #endif /* #ifndef NDEBUG */
282 * verify a Proj(Start) node
284 static int verify_node_Proj_Start(const ir_node *p)
286 ir_mode *mode = get_irn_mode(p);
287 long proj = get_Proj_proj(p);
291 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
292 (proj == pn_Start_M && mode == mode_M) ||
293 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
294 (proj == pn_Start_T_args && mode == mode_T)
296 "wrong Proj from Start", 0,
297 show_proj_failure(p);
303 * verify a Proj(Cond) node
305 static int verify_node_Proj_Cond(const ir_node *p)
307 ir_mode *mode = get_irn_mode(p);
308 long proj = get_Proj_proj(p);
311 mode == mode_X && (proj == pn_Cond_false || proj == pn_Cond_true),
312 "wrong Proj from Cond", 0,
313 show_proj_failure(p);
318 static int verify_node_Proj_Switch(const ir_node *p)
320 ir_mode *mode = get_irn_mode(p);
321 long pn = get_Proj_proj(p);
322 ir_node *pred = get_Proj_pred(p);
324 mode == mode_X && (pn >= 0 && pn < (long)get_Switch_n_outs(pred)),
325 "wrong Proj from Switch", 0,
326 show_proj_failure(p);
332 * verify a Proj(Raise) node
334 static int verify_node_Proj_Raise(const ir_node *p)
336 ir_mode *mode = get_irn_mode(p);
337 long proj = get_Proj_proj(p);
340 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
341 "wrong Proj from Raise", 0,
342 show_proj_failure(p);
348 * verify a Proj(InstOf) node
350 static int verify_node_Proj_InstOf(const ir_node *p)
352 ir_mode *mode = get_irn_mode(p);
353 long proj = get_Proj_proj(p);
357 (proj == pn_InstOf_M && mode == mode_M) ||
358 (proj == pn_InstOf_X_regular && mode == mode_X) ||
359 (proj == pn_InstOf_X_except && mode == mode_X) ||
360 (proj == pn_InstOf_res && mode_is_reference(mode))
362 "wrong Proj from InstOf", 0,
363 show_proj_failure(p);
369 * verify a Proj(Call) node
371 static int verify_node_Proj_Call(const ir_node *p)
373 ir_mode *mode = get_irn_mode(p);
374 ir_node *n = get_Proj_pred(p);
375 long proj = get_Proj_proj(p);
379 (proj == pn_Call_M && mode == mode_M) ||
380 (proj == pn_Call_X_regular && mode == mode_X) ||
381 (proj == pn_Call_X_except && mode == mode_X) ||
382 (proj == pn_Call_T_result && mode == mode_T)
384 "wrong Proj from Call", 0,
385 show_proj_failure(p);
387 /* if we have exception flow, we must have a real Memory input */
388 if (proj == pn_Call_X_regular)
390 !is_NoMem(get_Call_mem(n)),
391 "Regular Proj from FunctionCall", 0);
392 else if (proj == pn_Call_X_except)
394 !is_NoMem(get_Call_mem(n)),
395 "Exception Proj from FunctionCall", 0);
400 * verify a Proj(Div) node
402 static int verify_node_Proj_Div(const ir_node *p)
404 ir_mode *mode = get_irn_mode(p);
405 ir_node *n = get_Proj_pred(p);
406 long proj = get_Proj_proj(p);
410 (proj == pn_Div_M && mode == mode_M) ||
411 (proj == pn_Div_X_regular && mode == mode_X) ||
412 (proj == pn_Div_X_except && mode == mode_X) ||
413 (proj == pn_Div_res && mode_is_data(mode) && mode == get_Div_resmode(n))
415 "wrong Proj from Div", 0,
416 show_proj_failure(p);
418 if (proj == pn_Div_X_regular)
420 get_irn_pinned(n) == op_pin_state_pinned,
421 "Regular Proj from unpinned Div", 0);
422 else if (proj == pn_Div_X_except)
424 get_irn_pinned(n) == op_pin_state_pinned,
425 "Exception Proj from unpinned Div", 0);
426 else if (proj == pn_Div_M)
428 get_irn_pinned(n) == op_pin_state_pinned,
429 "Memory Proj from unpinned Div", 0);
434 * verify a Proj(Mod) node
436 static int verify_node_Proj_Mod(const ir_node *p)
438 ir_mode *mode = get_irn_mode(p);
439 ir_node *n = get_Proj_pred(p);
440 long proj = get_Proj_proj(p);
444 (proj == pn_Mod_M && mode == mode_M) ||
445 (proj == pn_Mod_X_regular && mode == mode_X) ||
446 (proj == pn_Mod_X_except && mode == mode_X) ||
447 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
449 "wrong Proj from Mod", 0,
450 show_proj_failure(p);
452 if (proj == pn_Mod_X_regular)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Regular Proj from unpinned Mod", 0);
456 else if (proj == pn_Mod_X_except)
458 get_irn_pinned(n) == op_pin_state_pinned,
459 "Exception Proj from unpinned Mod", 0);
460 else if (proj == pn_Mod_M)
462 get_irn_pinned(n) == op_pin_state_pinned,
463 "Memory Proj from unpinned Div", 0);
468 * verify a Proj(Load) node
470 static int verify_node_Proj_Load(const ir_node *p)
472 ir_mode *mode = get_irn_mode(p);
473 ir_node *n = get_Proj_pred(p);
474 long proj = get_Proj_proj(p);
476 if (proj == pn_Load_res) {
478 mode_is_data(mode) && mode == get_Load_mode(n),
479 "wrong data Proj from Load", 0,
480 show_proj_failure(p);
485 (proj == pn_Load_M && mode == mode_M) ||
486 (proj == pn_Load_X_regular && mode == mode_X) ||
487 (proj == pn_Load_X_except && mode == mode_X)
489 "wrong Proj from Load", 0,
490 show_proj_failure(p);
493 if (proj == pn_Load_X_regular) {
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Regular Proj from unpinned Load", 0);
497 } else if (proj == pn_Load_X_except) {
499 get_irn_pinned(n) == op_pin_state_pinned,
500 "Exception Proj from unpinned Load", 0);
506 * verify a Proj(Store) node
508 static int verify_node_Proj_Store(const ir_node *p)
510 ir_mode *mode = get_irn_mode(p);
511 ir_node *n = get_Proj_pred(p);
512 long proj = get_Proj_proj(p);
516 (proj == pn_Store_M && mode == mode_M) ||
517 (proj == pn_Store_X_regular && mode == mode_X) ||
518 (proj == pn_Store_X_except && mode == mode_X)
520 "wrong Proj from Store", 0,
521 show_proj_failure(p);
523 if (proj == pn_Store_X_regular) {
525 get_irn_pinned(n) == op_pin_state_pinned,
526 "Regular Proj from unpinned Store", 0);
527 } else if (proj == pn_Store_X_except) {
529 get_irn_pinned(n) == op_pin_state_pinned,
530 "Exception Proj from unpinned Store", 0);
536 * verify a Proj(Alloc) node
538 static int verify_node_Proj_Alloc(const ir_node *p)
540 ir_mode *mode = get_irn_mode(p);
541 long proj = get_Proj_proj(p);
545 (proj == pn_Alloc_M && mode == mode_M) ||
546 (proj == pn_Alloc_X_regular && mode == mode_X) ||
547 (proj == pn_Alloc_X_except && mode == mode_X) ||
548 (proj == pn_Alloc_res && mode_is_reference(mode))
550 "wrong Proj from Alloc", 0,
551 show_proj_failure(p);
557 * verify a Proj(Proj) node
559 static int verify_node_Proj_Proj(const ir_node *p)
561 ir_mode *mode = get_irn_mode(p);
562 ir_node *pred = get_Proj_pred(p);
563 long proj = get_Proj_proj(p);
564 long nr = get_Proj_proj(pred);
565 ir_type *mt; /* A method type */
567 pred = skip_Id(get_Proj_pred(pred));
568 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
570 switch (get_irn_opcode(pred)) {
572 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
574 if (nr == pn_Start_T_args) {
576 (proj >= 0 && mode_is_datab(mode)),
577 "wrong Proj from Proj from Start", 0);
579 (proj < (int)get_method_n_params(mt)),
580 "More Projs for args than args in type", 0
582 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
583 /* value argument */ break;
585 if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
587 (mode == get_type_mode(get_method_param_type(mt, proj))),
588 "Mode of Proj from Start doesn't match mode of param type.", 0,
589 show_proj_mode_failure(p, get_method_param_type(mt, proj));
598 (proj >= 0 && mode_is_datab(mode)),
599 "wrong Proj from Proj from Call", 0);
600 mt = get_Call_type(pred);
601 ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
602 "wrong call type on call", 0);
604 (proj < (int)get_method_n_ress(mt)),
605 "More Projs for results than results in type.", 0);
606 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
607 /* value result */ break;
610 (mode == get_type_mode(get_method_res_type(mt, proj))),
611 "Mode of Proj from Call doesn't match mode of result type.", 0);
620 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
627 * verify a Proj(Tuple) node
629 static int verify_node_Proj_Tuple(const ir_node *p)
637 * verify a Proj(CopyB) node
639 static int verify_node_Proj_CopyB(const ir_node *p)
641 ir_mode *mode = get_irn_mode(p);
642 ir_node *n = get_Proj_pred(p);
643 long proj = get_Proj_proj(p);
647 (proj == pn_CopyB_M && mode == mode_M) ||
648 (proj == pn_CopyB_X_regular && mode == mode_X) ||
649 (proj == pn_CopyB_X_except && mode == mode_X)
651 "wrong Proj from CopyB", 0,
652 show_proj_failure(p);
654 if (proj == pn_CopyB_X_regular)
656 get_irn_pinned(n) == op_pin_state_pinned,
657 "Regular Proj from unpinned CopyB", 0);
658 else if (proj == pn_CopyB_X_except)
660 get_irn_pinned(n) == op_pin_state_pinned,
661 "Exception Proj from unpinned CopyB", 0);
666 * verify a Proj(Bound) node
668 static int verify_node_Proj_Bound(const ir_node *p)
670 ir_mode *mode = get_irn_mode(p);
671 ir_node *n = get_Proj_pred(p);
672 long proj = get_Proj_proj(p);
676 (proj == pn_Bound_M && mode == mode_M) ||
677 (proj == pn_Bound_X_regular && mode == mode_X) ||
678 (proj == pn_Bound_X_except && mode == mode_X) ||
679 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
681 "wrong Proj from Bound", 0,
682 show_proj_failure(p);
687 static int verify_node_Proj_fragile(const ir_node *node)
689 ir_node *pred = get_Proj_pred(node);
690 int throws_exception = ir_throws_exception(pred);
691 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
692 && (!is_x_regular_Proj(node) || throws_exception),
693 "X_except und X_regular Proj only allowed when throws_exception is set",
701 static int verify_node_Proj(const ir_node *p)
703 ir_graph *irg = get_irn_irg(p);
707 pred = skip_Id(get_Proj_pred(p));
708 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
709 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);
711 if (is_fragile_op(pred)) {
712 int res = verify_node_Proj_fragile(p);
717 op = get_irn_op(pred);
718 if (op->ops.verify_proj_node)
719 return op->ops.verify_proj_node(p);
726 * verify a Block node
728 static int verify_node_Block(const ir_node *n)
730 ir_graph *irg = get_irn_irg(n);
733 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
734 ir_node *pred = get_Block_cfgpred(n, i);
735 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
736 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
737 "Block node must have a mode_X predecessor", 0);
738 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
741 if (n == get_irg_start_block(irg)) {
742 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
745 if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
746 /* End block may only have Return, Raise or fragile ops as preds. */
747 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
748 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
749 if (is_Proj(pred) || is_Tuple(pred))
750 break; /* We can not test properly. How many tuples are there? */
758 "End Block node", 0);
761 /* irg attr must == graph we are in. */
762 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
767 * verify a Start node
769 static int verify_node_Start(const ir_node *n)
771 ir_mode *mymode = get_irn_mode(n);
774 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
775 mymode == mode_T, "Start node", 0
783 static int verify_node_Jmp(const ir_node *n)
785 ir_mode *mymode = get_irn_mode(n);
789 mymode == mode_X, "Jmp node", 0
795 * verify an IJmp node
797 static int verify_node_IJmp(const ir_node *n)
799 ir_mode *mymode = get_irn_mode(n);
800 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
803 /* IJmp: BB x ref --> X */
804 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
812 static int verify_node_Cond(const ir_node *n)
814 ir_mode *mymode = get_irn_mode(n);
815 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
817 ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
818 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
822 static int verify_switch_table(const ir_node *n)
824 const ir_switch_table *table = get_Switch_table(n);
825 unsigned n_outs = get_Switch_n_outs(n);
826 ir_node *selector = get_Switch_selector(n);
827 ir_mode *mode = get_irn_mode(selector);
831 ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
833 n_entries = ir_switch_table_get_n_entries(table);
834 for (e = 0; e < n_entries; ++e) {
835 const ir_switch_table_entry *entry
836 = ir_switch_table_get_entry_const(table, e);
839 ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
840 "switch table entry without min+max value", 0);
841 ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
842 get_tarval_mode(entry->max) == mode,
843 "switch table entry with wrong modes", 0);
844 ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
845 "switch table entry without min+max value", 0);
846 ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
847 "switch table entry with invalid proj number", 0);
852 static int verify_node_Switch(const ir_node *n)
854 ir_mode *mymode = get_irn_mode(n);
855 ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
856 if (!verify_switch_table(n))
859 ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
860 ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
865 * verify a Return node
867 static int verify_node_Return(const ir_node *n)
869 ir_graph *irg = get_irn_irg(n);
870 ir_mode *mymode = get_irn_mode(n);
871 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
875 /* Return: BB x M x data1 x ... x datan --> X */
877 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
879 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
880 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
882 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
883 /* Compare returned results with result types of method type */
884 mt = get_entity_type(get_irg_entity(irg));
885 ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
886 "Number of results for Return doesn't match number of results in type.", 0,
887 show_return_nres(irg, n, mt););
888 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
889 ir_type *res_type = get_method_res_type(mt, i);
891 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
892 if (is_atomic_type(res_type)) {
894 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
895 "Mode of result for Return doesn't match mode of result type.", 0,
896 show_return_modes(irg, n, mt, i);
900 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
901 "Mode of result for Return doesn't match mode of result type.", 0,
902 show_return_modes(irg, n, mt, i);
911 * verify a Raise node
913 static int verify_node_Raise(const ir_node *n)
915 ir_mode *mymode = get_irn_mode(n);
916 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
917 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
920 /* Sel: BB x M x ref --> X x M */
921 op1mode == mode_M && mode_is_reference(op2mode) &&
922 mymode == mode_T, "Raise node", 0
928 * verify a Const node
930 static int verify_node_Const(const ir_node *n)
932 ir_mode *mymode = get_irn_mode(n);
935 /* Const: BB --> data */
936 (mode_is_data(mymode) ||
937 mymode == mode_b) /* we want boolean constants for static evaluation */
938 ,"Const node", 0 /* of Cmp. */
941 /* the modes of the constant and teh tarval must match */
942 mymode == get_tarval_mode(get_Const_tarval(n)),
943 "Const node, tarval and node mode mismatch", 0
949 * verify a SymConst node
951 static int verify_node_SymConst(const ir_node *n)
953 ir_mode *mymode = get_irn_mode(n);
956 /* SymConst: BB --> int*/
957 (mode_is_int(mymode) ||
958 /* SymConst: BB --> ref */
959 mode_is_reference(mymode))
960 ,"SymConst node", 0);
967 static int verify_node_Sel(const ir_node *n)
970 ir_mode *mymode = get_irn_mode(n);
971 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
972 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
976 /* Sel: BB x M x ref x int^n --> ref */
977 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
978 "Sel node", 0, show_node_failure(n);
981 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
982 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
984 ent = get_Sel_entity(n);
985 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
990 * verify an InstOf node
992 static int verify_node_InstOf(const ir_node *n)
994 ir_mode *mymode = get_irn_mode(n);
995 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
997 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
998 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1003 * Check if the pinned state is right.
1005 static int verify_right_pinned(const ir_node *n)
1009 if (get_irn_pinned(n) == op_pin_state_pinned)
1011 mem = get_Call_mem(n);
1013 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1014 if (is_NoMem(mem) || is_Pin(mem))
1020 * verify a Call node
1022 static int verify_node_Call(const ir_node *n)
1024 ir_graph *irg = get_irn_irg(n);
1025 ir_mode *mymode = get_irn_mode(n);
1026 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1027 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1032 /* Call: BB x M x ref x data1 x ... x datan
1033 --> M x datan+1 x ... x data n+m */
1034 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1036 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1037 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1039 mt = get_Call_type(n);
1040 if (get_unknown_type() == mt) {
1044 n_params = get_Call_n_params(n);
1045 for (i = 0; i < n_params; ++i) {
1046 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1049 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1050 /* Compare arguments of node with those of type */
1052 if (get_method_variadicity(mt) == variadicity_variadic) {
1054 (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
1055 "Number of args for Call doesn't match number of args in variadic type.",
1057 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1058 n, get_Call_n_params(n), get_method_n_params(mt));
1062 (size_t)get_Call_n_params(n) == get_method_n_params(mt),
1063 "Number of args for Call doesn't match number of args in non variadic type.",
1065 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1066 n, get_Call_n_params(n), get_method_n_params(mt));
1070 for (i = 0; i < get_method_n_params(mt); i++) {
1071 ir_type *t = get_method_param_type(mt, i);
1073 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1074 if (is_atomic_type(t)) {
1076 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1077 "Mode of arg for Call doesn't match mode of arg type.", 0,
1078 show_call_param(n, mt);
1081 /* call with a compound type, mode must be reference */
1083 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1084 "Mode of arg for Call doesn't match mode of arg type.", 0,
1085 show_call_param(n, mt);
1095 * verify an Add node
1097 static int verify_node_Add(const ir_node *n)
1099 ir_mode *mymode = get_irn_mode(n);
1100 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1101 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1105 /* common Add: BB x numP x numP --> numP */
1106 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1107 /* Pointer Add: BB x ref x int --> ref */
1108 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1109 /* Pointer Add: BB x int x ref --> ref */
1110 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1113 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1114 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1115 "/* Pointer Add: BB x int x ref --> ref */");
1123 static int verify_node_Sub(const ir_node *n)
1125 ir_mode *mymode = get_irn_mode(n);
1126 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1127 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1131 /* common Sub: BB x numP x numP --> numP */
1132 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1133 /* Pointer Sub: BB x ref x int --> ref */
1134 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1135 /* Pointer Sub: BB x ref x ref --> int */
1136 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1139 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1140 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1141 "/* Pointer Sub: BB x ref x ref --> int */" );
1147 * verify a Minus node
1149 static int verify_node_Minus(const ir_node *n)
1151 ir_mode *mymode = get_irn_mode(n);
1152 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1155 /* Minus: BB x num --> num */
1156 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1157 show_unop_failure(n , "/* Minus: BB x num --> num */");
1165 static int verify_node_Mul(const ir_node *n)
1167 ir_mode *mymode = get_irn_mode(n);
1168 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1169 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1173 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1174 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1175 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1176 /* Mul: BB x float x float --> float */
1177 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1180 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1181 "/* Mul: BB x float x float --> float */");
1187 * verify a Mulh node
1189 static int verify_node_Mulh(const ir_node *n)
1191 ir_mode *mymode = get_irn_mode(n);
1192 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1193 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1197 /* Mulh: BB x int x int --> int */
1198 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1201 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1209 static int verify_node_Div(const ir_node *n)
1211 ir_mode *mymode = get_irn_mode(n);
1212 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1213 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1214 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1217 /* Div: BB x M x data x data --> M x X x data */
1218 op1mode == mode_M &&
1219 op2mode == op3mode &&
1220 mode_is_data(op2mode) &&
1230 static int verify_node_Mod(const ir_node *n)
1232 ir_mode *mymode = get_irn_mode(n);
1233 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1234 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1235 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1238 /* Mod: BB x M x int x int --> M x X x int */
1239 op1mode == mode_M &&
1240 op2mode == op3mode &&
1241 mode_is_int(op2mode) &&
1249 * verify a logical And, Or, Eor node
1251 static int verify_node_Logic(const ir_node *n)
1253 ir_mode *mymode = get_irn_mode(n);
1254 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1255 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1258 /* And or Or or Eor: BB x int x int --> int */
1259 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1260 op2mode == op1mode &&
1262 "And, Or or Eor node", 0,
1263 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1268 static int verify_node_And(const ir_node *n)
1270 return verify_node_Logic(n);
1273 static int verify_node_Or(const ir_node *n)
1275 return verify_node_Logic(n);
1278 static int verify_node_Eor(const ir_node *n)
1280 return verify_node_Logic(n);
1286 static int verify_node_Not(const ir_node *n)
1288 ir_mode *mymode = get_irn_mode(n);
1289 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1292 /* Not: BB x int --> int */
1293 (mode_is_int(mymode) || mymode == mode_b) &&
1296 show_unop_failure(n, "/* Not: BB x int --> int */");
1304 static int verify_node_Cmp(const ir_node *n)
1306 ir_mode *mymode = get_irn_mode(n);
1307 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1308 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1311 /* Cmp: BB x datab x datab --> b16 */
1312 mode_is_datab(op1mode) &&
1313 op2mode == op1mode &&
1316 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1322 * verify a Shift node
1324 static int verify_node_Shift(const ir_node *n)
1326 ir_mode *mymode = get_irn_mode(n);
1327 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1328 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1331 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1332 mode_is_int(op1mode) &&
1333 mode_is_int(op2mode) &&
1334 !mode_is_signed(op2mode) &&
1336 "Shl, Shr or Shrs node", 0,
1337 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1342 static int verify_node_Shl(const ir_node *n)
1344 return verify_node_Shift(n);
1347 static int verify_node_Shr(const ir_node *n)
1349 return verify_node_Shift(n);
1352 static int verify_node_Shrs(const ir_node *n)
1354 return verify_node_Shift(n);
1358 * verify a Rotl node
1360 static int verify_node_Rotl(const ir_node *n)
1362 ir_mode *mymode = get_irn_mode(n);
1363 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1364 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1367 /* Rotl: BB x int x int --> int */
1368 mode_is_int(op1mode) &&
1369 mode_is_int(op2mode) &&
1372 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1378 * verify a Conv node
1380 static int verify_node_Conv(const ir_node *n)
1382 ir_mode *mymode = get_irn_mode(n);
1383 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1385 ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
1387 show_unop_failure(n, "/* Conv: BB x data --> data */");
1393 * verify a Cast node
1395 static int verify_node_Cast(const ir_node *n)
1397 ir_mode *mymode = get_irn_mode(n);
1398 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1401 /* Conv: BB x datab1 --> datab2 */
1402 mode_is_data(op1mode) && op1mode == mymode,
1404 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1412 static int verify_node_Phi(const ir_node *n)
1414 ir_mode *mymode = get_irn_mode(n);
1415 ir_node *block = get_nodes_block(n);
1418 /* a Phi node MUST have the same number of inputs as its block
1419 * Exception is a phi with 0 inputs which is used when (re)constructing the
1422 && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
1423 && get_irn_arity(n) > 0) {
1425 get_irn_arity(n) == get_irn_arity(block),
1426 "wrong number of inputs in Phi node", 0,
1427 show_phi_inputs(n, block);
1431 /* Phi: BB x dataM^n --> dataM */
1432 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1433 ir_node *pred = get_Phi_pred(n, i);
1434 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1435 "Phi node", 0, show_phi_failure(n, pred, i);
1438 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1444 * verify a Load node
1446 static int verify_node_Load(const ir_node *n)
1448 ir_graph *irg = get_irn_irg(n);
1449 ir_mode *mymode = get_irn_mode(n);
1450 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1451 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1453 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1454 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1455 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1457 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1463 * verify a Store node
1465 static int verify_node_Store(const ir_node *n)
1467 ir_graph *irg = get_irn_irg(n);
1469 ir_mode *mymode = get_irn_mode(n);
1470 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1471 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1472 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1474 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1475 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1476 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1478 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1484 * verify an Alloc node
1486 static int verify_node_Alloc(const ir_node *n)
1488 ir_mode *mymode = get_irn_mode(n);
1489 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1490 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1493 /* Alloc: BB x M x int_u --> M x X x ref */
1494 op1mode == mode_M &&
1495 mode_is_int(op2mode) &&
1496 !mode_is_signed(op2mode) &&
1499 show_node_failure(n);
1505 * verify a Free node
1507 static int verify_node_Free(const ir_node *n)
1509 ir_mode *mymode = get_irn_mode(n);
1510 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1511 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1512 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1515 /* Free: BB x M x ref x int_u --> M */
1516 op1mode == mode_M && mode_is_reference(op2mode) &&
1517 mode_is_int(op3mode) &&
1518 !mode_is_signed(op3mode) &&
1521 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1527 * verify a Sync node
1529 static int verify_node_Sync(const ir_node *n)
1532 ir_mode *mymode = get_irn_mode(n);
1534 /* Sync: BB x M^n --> M */
1535 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1536 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1538 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1543 * verify a Confirm node
1545 static int verify_node_Confirm(const ir_node *n)
1547 ir_mode *mymode = get_irn_mode(n);
1548 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1549 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1552 /* Confirm: BB x T x T --> T */
1553 op1mode == mymode &&
1556 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1564 static int verify_node_Mux(const ir_node *n)
1566 ir_mode *mymode = get_irn_mode(n);
1567 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1568 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1569 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1572 /* Mux: BB x b x datab x datab --> datab */
1573 op1mode == mode_b &&
1574 op2mode == mymode &&
1575 op3mode == mymode &&
1576 mode_is_datab(mymode),
1583 * verify a CopyB node
1585 static int verify_node_CopyB(const ir_node *n)
1587 ir_graph *irg = get_irn_irg(n);
1588 ir_mode *mymode = get_irn_mode(n);
1589 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1590 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1591 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1592 ir_type *t = get_CopyB_type(n);
1594 /* CopyB: BB x M x ref x ref --> M x X */
1595 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1596 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1597 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1602 is_compound_type(t) || is_Array_type(t),
1603 "CopyB node should copy compound types only", 0 );
1605 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1606 This should happen RARELY, as CopyB COPIES MEMORY */
1607 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1612 * verify a Bound node
1614 static int verify_node_Bound(const ir_node *n)
1616 ir_mode *mymode = get_irn_mode(n);
1617 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1618 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1619 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1620 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1622 /* Bound: BB x M x int x int x int --> M x X */
1625 op1mode == mode_M &&
1626 op2mode == op3mode &&
1627 op3mode == op4mode &&
1628 mode_is_int(op3mode),
1635 * For each usage of a node, it is checked, if the block of the
1636 * node dominates the block of the usage (for phis: the predecessor
1637 * block of the phi for the corresponding edge).
1639 * @return non-zero on success, 0 on dominance error
1641 static int check_dominance_for_node(const ir_node *use)
1643 /* This won't work for blocks and the end node */
1644 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1646 ir_node *bl = get_nodes_block(use);
1648 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1649 ir_node *def = get_irn_n(use, i);
1650 ir_node *def_bl = get_nodes_block(def);
1651 ir_node *use_bl = bl;
1654 /* we have no dominance relation for unreachable blocks, so we can't
1655 * check the dominance property there */
1656 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1662 use_bl = get_Block_cfgpred_block(bl, i);
1665 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1668 irg = get_irn_irg(use);
1670 block_dominates(def_bl, use_bl),
1671 "the definition of a value used violates the dominance property", 0,
1673 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1674 irg, def_bl, def, use_bl, use, i
1682 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1686 if (!get_node_verification_mode())
1690 * do NOT check placement in interprocedural view, as we don't always
1691 * know the "right" graph ...
1695 /* this is an expensive check for large graphs (it has a quadratic
1696 * runtime but with a small constant); so do NOT run it in release mode
1699 node_is_in_irgs_storage(irg, n),
1700 "Node is not stored on proper IR graph!", 0,
1701 show_node_on_graph(irg, n);
1704 assert(get_irn_irg(n) == irg);
1706 unsigned idx = get_irn_idx(n);
1707 ir_node *node_from_map = get_idx_irn(irg, idx);
1708 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1709 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1715 if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
1716 op_pin_state state = get_irn_pinned(n);
1718 state == op_pin_state_floats ||
1719 state == op_pin_state_pinned,
1720 "invalid pin state", 0,
1721 ir_printf("node %+F", n);
1723 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1724 && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
1725 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1726 "block input is not a block", 0,
1727 ir_printf("node %+F", n);
1731 if (op->ops.verify_node)
1732 return op->ops.verify_node(n);
1738 int irn_verify(const ir_node *n)
1740 #ifdef DEBUG_libfirm
1741 return irn_verify_irg(n, get_irn_irg(n));
1748 /*-----------------------------------------------------------------*/
1749 /* Verify the whole graph. */
1750 /*-----------------------------------------------------------------*/
1752 #ifdef DEBUG_libfirm
1754 * Walker to check every node
1756 static void verify_wrap(ir_node *node, void *env)
1758 int *res = (int*)env;
1759 *res = irn_verify_irg(node, get_irn_irg(node));
1763 * Walker to check every node including SSA property.
1764 * Only called if dominance info is available.
1766 static void verify_wrap_ssa(ir_node *node, void *env)
1768 int *res = (int*)env;
1770 *res = irn_verify_irg(node, get_irn_irg(node));
1772 *res = check_dominance_for_node(node);
1776 #endif /* DEBUG_libfirm */
1778 typedef struct check_cfg_env_t {
1779 pmap *branch_nodes; /**< map blocks to their branching nodes,
1780 map mode_X nodes to the blocks they branch to */
1782 ir_nodeset_t reachable_blocks;
1783 ir_nodeset_t kept_nodes;
1784 ir_nodeset_t true_projs;
1785 ir_nodeset_t false_projs;
1788 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1794 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1795 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1796 ir_printf("block %+F\n", block);
1799 n_cfgpreds = get_Block_n_cfgpreds(block);
1800 branch_nodes = env->branch_nodes;
1801 for (i = 0; i < n_cfgpreds; ++i) {
1802 /* check that each mode_X node is only connected
1804 ir_node *branch = get_Block_cfgpred(block, i);
1805 ir_node *former_dest;
1806 ir_node *former_branch;
1807 ir_node *branch_proj;
1808 ir_node *branch_block;
1809 branch = skip_Tuple(branch);
1812 former_dest = pmap_get(ir_node, branch_nodes, branch);
1813 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1814 "Multiple users on mode_X node", 0,
1815 ir_printf("node %+F\n", branch);
1817 pmap_insert(branch_nodes, branch, (void*)block);
1819 /* check that there's only 1 branching instruction in each block */
1820 branch_block = get_nodes_block(branch);
1821 branch_proj = branch;
1822 if (is_Proj(branch)) {
1823 branch = skip_Proj(branch);
1825 former_branch = pmap_get(ir_node, branch_nodes, branch_block);
1827 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1828 "Multiple branching nodes in a block", 0,
1829 ir_printf("nodes %+F,%+F in block %+F\n",
1830 branch, former_branch, branch_block);
1832 pmap_insert(branch_nodes, branch_block, branch);
1834 if (is_Cond(branch)) {
1835 long pn = get_Proj_proj(branch_proj);
1836 if (pn == pn_Cond_true)
1837 ir_nodeset_insert(&env->true_projs, branch);
1838 if (pn == pn_Cond_false)
1839 ir_nodeset_insert(&env->false_projs, branch);
1840 } else if (is_Switch(branch)) {
1841 long pn = get_Proj_proj(branch_proj);
1842 if (pn == pn_Switch_default)
1843 ir_nodeset_insert(&env->true_projs, branch);
1850 static void check_cfg_walk_func(ir_node *node, void *data)
1852 check_cfg_env_t *env = (check_cfg_env_t*)data;
1853 if (!is_Block(node))
1855 env->res &= check_block_cfg(node, env);
1858 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1860 ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
1861 ASSERT_AND_RET_DBG(branch != NULL
1862 || ir_nodeset_contains(&env->kept_nodes, block)
1863 || block == get_irg_end_block(get_irn_irg(block)),
1864 "block contains no cfop", 0,
1865 ir_printf("block %+F\n", block);
1870 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1872 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1873 "Cond node lacks true proj", 0,
1874 ir_printf("Cond %+F\n", cond);
1876 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1877 "Cond node lacks false proj", 0,
1878 ir_printf("Cond %+F\n", cond);
1883 static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
1885 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
1886 "Switch node lacks default Proj", 0,
1887 ir_printf("Switch %+F\n", sw);
1892 static void assert_branch(ir_node *node, void *data)
1894 check_cfg_env_t *env = (check_cfg_env_t*)data;
1895 if (is_Block(node)) {
1896 env->res &= verify_block_branch(node, env);
1897 } else if (is_Cond(node)) {
1898 env->res &= verify_cond_projs(node, env);
1899 } else if (is_Switch(node)) {
1900 env->res &= verify_switch_projs(node, env);
1904 static void collect_reachable_blocks(ir_node *block, void *data)
1906 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1907 ir_nodeset_insert(reachable_blocks, block);
1911 * Checks CFG well-formedness
1913 static int check_cfg(ir_graph *irg)
1915 check_cfg_env_t env;
1916 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1918 ir_nodeset_init(&env.reachable_blocks);
1919 ir_nodeset_init(&env.true_projs);
1920 ir_nodeset_init(&env.false_projs);
1922 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1923 &env.reachable_blocks);
1925 /* note that we do not use irg_walk_block because it will miss these
1926 * invalid blocks without a jump instruction which we want to detect
1928 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1930 ir_nodeset_init(&env.kept_nodes);
1932 ir_node *end = get_irg_end(irg);
1933 int arity = get_irn_arity(end);
1935 for (i = 0; i < arity; ++i) {
1936 ir_node *n = get_irn_n(end, i);
1937 ir_nodeset_insert(&env.kept_nodes, n);
1940 irg_walk_graph(irg, assert_branch, NULL, &env);
1942 ir_nodeset_destroy(&env.false_projs);
1943 ir_nodeset_destroy(&env.true_projs);
1944 ir_nodeset_destroy(&env.kept_nodes);
1945 ir_nodeset_destroy(&env.reachable_blocks);
1946 pmap_destroy(env.branch_nodes);
1950 int irg_verify(ir_graph *irg, unsigned flags)
1953 #ifdef DEBUG_libfirm
1954 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1957 last_irg_error = NULL;
1960 if (pinned && !check_cfg(irg))
1963 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
1968 pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
1969 ? verify_wrap_ssa : verify_wrap,
1974 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1975 ir_entity *ent = get_irg_entity(irg);
1978 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1980 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1986 #endif /* DEBUG_libfirm */
1991 typedef struct pass_t {
1992 ir_graph_pass_t pass;
1997 * Wrapper to irg_verify to be run as an ir_graph pass.
1999 static int irg_verify_wrapper(ir_graph *irg, void *context)
2001 pass_t *pass = (pass_t*)context;
2002 irg_verify(irg, pass->flags);
2003 /* do NOT rerun the pass if verify is ok :-) */
2007 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2009 pass_t *pass = XMALLOCZ(pass_t);
2011 def_graph_pass_constructor(
2012 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2014 /* neither dump for verify */
2015 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2016 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2018 pass->flags = flags;
2022 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
2023 const char **bad_string)
2026 firm_verification_t old = get_node_verification_mode();
2028 firm_verify_failure_msg = NULL;
2029 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2030 res = irn_verify_irg(n, irg);
2031 if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
2032 get_irg_pinned(irg) == op_pin_state_pinned)
2033 res = check_dominance_for_node(n);
2034 do_node_verification(old);
2035 *bad_string = firm_verify_failure_msg;
2040 typedef struct verify_bad_env_t {
2046 * Pre-Walker: check Bad predecessors of node.
2048 static void check_bads(ir_node *node, void *env)
2050 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2051 int i, arity = get_irn_arity(node);
2052 ir_graph *irg = get_irn_irg(node);
2054 if (is_Block(node)) {
2055 if ((venv->flags & BAD_CF) == 0) {
2057 /* check for Bad Block predecessor */
2058 for (i = 0; i < arity; ++i) {
2059 ir_node *pred = get_irn_n(node, i);
2062 venv->res |= BAD_CF;
2064 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2065 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2067 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2068 dump_ir_graph(irg, "assert");
2069 assert(0 && "Bad CF detected");
2075 if ((venv->flags & BAD_BLOCK) == 0) {
2077 /* check for Bad Block */
2078 if (is_Bad(get_nodes_block(node))) {
2079 venv->res |= BAD_BLOCK;
2081 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2082 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2084 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2085 dump_ir_graph(irg, "assert");
2086 assert(0 && "Bad CF detected");
2091 if ((venv->flags & TUPLE) == 0) {
2092 if (is_Tuple(node)) {
2095 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2096 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2098 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2099 dump_ir_graph(irg, "assert");
2100 assert(0 && "Tuple detected");
2105 for (i = 0; i < arity; ++i) {
2106 ir_node *pred = get_irn_n(node, i);
2109 /* check for Phi with Bad inputs */
2110 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2111 if (venv->flags & BAD_CF)
2114 venv->res |= BAD_CF;
2116 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2117 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2119 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2120 dump_ir_graph(irg, "assert");
2121 assert(0 && "Bad CF detected");
2126 /* Bad node input */
2127 if ((venv->flags & BAD_DF) == 0) {
2128 venv->res |= BAD_DF;
2130 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2131 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2133 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2134 dump_ir_graph(irg, "assert");
2135 assert(0 && "Bad NON-CF detected");
2143 int irg_verify_bads(ir_graph *irg, int flags)
2145 verify_bad_env_t env;
2150 irg_walk_graph(irg, check_bads, NULL, &env);
2155 static void register_verify_node_func(ir_op *op, verify_node_func func)
2157 op->ops.verify_node = func;
2160 static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
2162 op->ops.verify_proj_node = func;
2165 void ir_register_verify_node_ops(void)
2167 register_verify_node_func(op_Add, verify_node_Add);
2168 register_verify_node_func(op_Alloc, verify_node_Alloc);
2169 register_verify_node_func(op_And, verify_node_And);
2170 register_verify_node_func(op_Block, verify_node_Block);
2171 register_verify_node_func(op_Bound, verify_node_Bound);
2172 register_verify_node_func(op_Call, verify_node_Call);
2173 register_verify_node_func(op_Cast, verify_node_Cast);
2174 register_verify_node_func(op_Cmp, verify_node_Cmp);
2175 register_verify_node_func(op_Cond, verify_node_Cond);
2176 register_verify_node_func(op_Confirm, verify_node_Confirm);
2177 register_verify_node_func(op_Const, verify_node_Const);
2178 register_verify_node_func(op_Conv, verify_node_Conv);
2179 register_verify_node_func(op_CopyB, verify_node_CopyB);
2180 register_verify_node_func(op_Div, verify_node_Div);
2181 register_verify_node_func(op_Eor, verify_node_Eor);
2182 register_verify_node_func(op_Free, verify_node_Free);
2183 register_verify_node_func(op_IJmp, verify_node_IJmp);
2184 register_verify_node_func(op_InstOf, verify_node_InstOf);
2185 register_verify_node_func(op_Jmp, verify_node_Jmp);
2186 register_verify_node_func(op_Load, verify_node_Load);
2187 register_verify_node_func(op_Minus, verify_node_Minus);
2188 register_verify_node_func(op_Mod, verify_node_Mod);
2189 register_verify_node_func(op_Mul, verify_node_Mul);
2190 register_verify_node_func(op_Mulh, verify_node_Mulh);
2191 register_verify_node_func(op_Mux, verify_node_Mux);
2192 register_verify_node_func(op_Not, verify_node_Not);
2193 register_verify_node_func(op_Or, verify_node_Or);
2194 register_verify_node_func(op_Phi, verify_node_Phi);
2195 register_verify_node_func(op_Proj, verify_node_Proj);
2196 register_verify_node_func(op_Raise, verify_node_Raise);
2197 register_verify_node_func(op_Return, verify_node_Return);
2198 register_verify_node_func(op_Rotl, verify_node_Rotl);
2199 register_verify_node_func(op_Sel, verify_node_Sel);
2200 register_verify_node_func(op_Shl, verify_node_Shl);
2201 register_verify_node_func(op_Shr, verify_node_Shr);
2202 register_verify_node_func(op_Shrs, verify_node_Shrs);
2203 register_verify_node_func(op_Start, verify_node_Start);
2204 register_verify_node_func(op_Store, verify_node_Store);
2205 register_verify_node_func(op_Sub, verify_node_Sub);
2206 register_verify_node_func(op_Switch, verify_node_Switch);
2207 register_verify_node_func(op_SymConst, verify_node_SymConst);
2208 register_verify_node_func(op_Sync, verify_node_Sync);
2210 register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
2211 register_verify_node_func_proj(op_Bound, verify_node_Proj_Bound);
2212 register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
2213 register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
2214 register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);
2215 register_verify_node_func_proj(op_Div, verify_node_Proj_Div);
2216 register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
2217 register_verify_node_func_proj(op_Load, verify_node_Proj_Load);
2218 register_verify_node_func_proj(op_Mod, verify_node_Proj_Mod);
2219 register_verify_node_func_proj(op_Proj, verify_node_Proj_Proj);
2220 register_verify_node_func_proj(op_Raise, verify_node_Proj_Raise);
2221 register_verify_node_func_proj(op_Start, verify_node_Proj_Start);
2222 register_verify_node_func_proj(op_Store, verify_node_Proj_Store);
2223 register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
2224 register_verify_node_func_proj(op_Tuple, verify_node_Proj_Tuple);