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 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
578 /* value argument */ break;
580 if (!irg_is_constrained(get_irn_irg(pred), IR_GRAPH_CONSTRAINT_BACKEND)) {
582 (mode == get_type_mode(get_method_param_type(mt, proj))),
583 "Mode of Proj from Start doesn't match mode of param type.", 0,
584 show_proj_mode_failure(p, get_method_param_type(mt, proj));
593 (proj >= 0 && mode_is_datab(mode)),
594 "wrong Proj from Proj from Call", 0);
595 mt = get_Call_type(pred);
596 ASSERT_AND_RET(is_unknown_type(mt) || is_Method_type(mt),
597 "wrong call type on call", 0);
599 (proj < (int)get_method_n_ress(mt)),
600 "More Projs for results than results in type.", 0);
601 ir_type *res_type = get_method_res_type(mt, proj);
603 if ((mode_is_reference(mode)) &&
604 (is_compound_type(res_type) || is_Array_type(res_type)))
608 (mode == get_type_mode(get_method_res_type(mt, proj))),
609 "Mode of Proj from Call doesn't match mode of result type.", 0);
618 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
625 * verify a Proj(Tuple) node
627 static int verify_node_Proj_Tuple(const ir_node *p)
635 * verify a Proj(CopyB) node
637 static int verify_node_Proj_CopyB(const ir_node *p)
639 ir_mode *mode = get_irn_mode(p);
640 ir_node *n = get_Proj_pred(p);
641 long proj = get_Proj_proj(p);
645 (proj == pn_CopyB_M && mode == mode_M) ||
646 (proj == pn_CopyB_X_regular && mode == mode_X) ||
647 (proj == pn_CopyB_X_except && mode == mode_X)
649 "wrong Proj from CopyB", 0,
650 show_proj_failure(p);
652 if (proj == pn_CopyB_X_regular)
654 get_irn_pinned(n) == op_pin_state_pinned,
655 "Regular Proj from unpinned CopyB", 0);
656 else if (proj == pn_CopyB_X_except)
658 get_irn_pinned(n) == op_pin_state_pinned,
659 "Exception Proj from unpinned CopyB", 0);
663 static int verify_node_Proj_fragile(const ir_node *node)
665 ir_node *pred = get_Proj_pred(node);
666 int throws_exception = ir_throws_exception(pred);
667 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
668 && (!is_x_regular_Proj(node) || throws_exception),
669 "X_except und X_regular Proj only allowed when throws_exception is set",
677 static int verify_node_Proj(const ir_node *p)
679 ir_graph *irg = get_irn_irg(p);
683 pred = skip_Id(get_Proj_pred(p));
684 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
685 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);
687 if (is_fragile_op(pred)) {
688 int res = verify_node_Proj_fragile(p);
693 op = get_irn_op(pred);
694 if (op->ops.verify_proj_node)
695 return op->ops.verify_proj_node(p);
702 * verify a Block node
704 static int verify_node_Block(const ir_node *n)
706 ir_graph *irg = get_irn_irg(n);
709 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
710 ir_node *pred = get_Block_cfgpred(n, i);
711 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
712 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
713 "Block node must have a mode_X predecessor", 0);
714 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
717 if (n == get_irg_start_block(irg)) {
718 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
721 if (n == get_irg_end_block(irg) && !irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
722 /* End block may only have Return, Raise or fragile ops as preds. */
723 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
724 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
725 if (is_Proj(pred) || is_Tuple(pred))
726 break; /* We can not test properly. How many tuples are there? */
734 "End Block node", 0);
737 /* irg attr must == graph we are in. */
738 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
743 * verify a Start node
745 static int verify_node_Start(const ir_node *n)
747 ir_mode *mymode = get_irn_mode(n);
750 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
751 mymode == mode_T, "Start node", 0
759 static int verify_node_Jmp(const ir_node *n)
761 ir_mode *mymode = get_irn_mode(n);
765 mymode == mode_X, "Jmp node", 0
771 * verify an IJmp node
773 static int verify_node_IJmp(const ir_node *n)
775 ir_mode *mymode = get_irn_mode(n);
776 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
779 /* IJmp: BB x ref --> X */
780 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
788 static int verify_node_Cond(const ir_node *n)
790 ir_mode *mymode = get_irn_mode(n);
791 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
793 ASSERT_AND_RET(op1mode == mode_b, "Cond operand not mode_b", 0);
794 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
798 static int verify_switch_table(const ir_node *n)
800 const ir_switch_table *table = get_Switch_table(n);
801 unsigned n_outs = get_Switch_n_outs(n);
802 ir_node *selector = get_Switch_selector(n);
803 ir_mode *mode = get_irn_mode(selector);
807 ASSERT_AND_RET(table != NULL, "switch table is NULL", 0);
809 n_entries = ir_switch_table_get_n_entries(table);
810 for (e = 0; e < n_entries; ++e) {
811 const ir_switch_table_entry *entry
812 = ir_switch_table_get_entry_const(table, e);
815 ASSERT_AND_RET(entry->min != NULL && entry->max != NULL,
816 "switch table entry without min+max value", 0);
817 ASSERT_AND_RET(get_tarval_mode(entry->min) == mode &&
818 get_tarval_mode(entry->max) == mode,
819 "switch table entry with wrong modes", 0);
820 ASSERT_AND_RET(tarval_cmp(entry->min, entry->max) != ir_relation_greater,
821 "switch table entry without min+max value", 0);
822 ASSERT_AND_RET(entry->pn >= 0 && entry->pn < (long)n_outs,
823 "switch table entry with invalid proj number", 0);
828 static int verify_node_Switch(const ir_node *n)
830 ir_mode *mymode = get_irn_mode(n);
831 ir_mode *op1mode = get_irn_mode(get_Switch_selector(n));
832 if (!verify_switch_table(n))
835 ASSERT_AND_RET(mode_is_int(op1mode), "Switch operand not integer", 0);
836 ASSERT_AND_RET(mymode == mode_T, "Switch mode is not a tuple", 0);
841 * verify a Return node
843 static int verify_node_Return(const ir_node *n)
845 ir_graph *irg = get_irn_irg(n);
846 ir_mode *mymode = get_irn_mode(n);
847 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
851 /* Return: BB x M x data1 x ... x datan --> X */
853 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
855 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
856 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
858 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
859 /* Compare returned results with result types of method type */
860 mt = get_entity_type(get_irg_entity(irg));
861 ASSERT_AND_RET_DBG((size_t)get_Return_n_ress(n) == get_method_n_ress(mt),
862 "Number of results for Return doesn't match number of results in type.", 0,
863 show_return_nres(irg, n, mt););
864 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
865 ir_type *res_type = get_method_res_type(mt, i);
867 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
868 if (is_atomic_type(res_type)) {
870 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
871 "Mode of result for Return doesn't match mode of result type.", 0,
872 show_return_modes(irg, n, mt, i);
876 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
877 "Mode of result for Return doesn't match mode of result type.", 0,
878 show_return_modes(irg, n, mt, i);
887 * verify a Raise node
889 static int verify_node_Raise(const ir_node *n)
891 ir_mode *mymode = get_irn_mode(n);
892 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
893 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
896 /* Sel: BB x M x ref --> X x M */
897 op1mode == mode_M && mode_is_reference(op2mode) &&
898 mymode == mode_T, "Raise node", 0
904 * verify a Const node
906 static int verify_node_Const(const ir_node *n)
908 ir_mode *mymode = get_irn_mode(n);
911 /* Const: BB --> data */
912 (mode_is_data(mymode) ||
913 mymode == mode_b) /* we want boolean constants for static evaluation */
914 ,"Const node", 0 /* of Cmp. */
917 /* the modes of the constant and teh tarval must match */
918 mymode == get_tarval_mode(get_Const_tarval(n)),
919 "Const node, tarval and node mode mismatch", 0
925 * verify a SymConst node
927 static int verify_node_SymConst(const ir_node *n)
929 ir_mode *mymode = get_irn_mode(n);
932 /* SymConst: BB --> int*/
933 (mode_is_int(mymode) ||
934 /* SymConst: BB --> ref */
935 mode_is_reference(mymode))
936 ,"SymConst node", 0);
937 if (SYMCONST_HAS_ENT(get_SymConst_kind(n))) {
938 ir_entity *ent = get_SymConst_entity(n);
939 /* the is_method_entity(ent) exception is for nested functions... */
940 ASSERT_AND_RET_DBG((get_entity_owner(ent)->flags & tf_segment)
941 || is_method_entity(ent),
942 "SymConst node with frame entity", 0,
943 show_node_failure(n););
951 static int verify_node_Sel(const ir_node *n)
954 ir_mode *mymode = get_irn_mode(n);
955 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
956 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
960 /* Sel: BB x M x ref x int^n --> ref */
961 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
962 "Sel node", 0, show_node_failure(n);
965 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
966 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
968 ent = get_Sel_entity(n);
969 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
970 ASSERT_AND_RET_DBG(!(get_entity_owner(ent)->flags & tf_segment),
971 "Sel node with global entity", 0, show_node_failure(n););
976 * verify an InstOf node
978 static int verify_node_InstOf(const ir_node *n)
980 ir_mode *mymode = get_irn_mode(n);
981 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
983 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
984 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
989 * Check if the pinned state is right.
991 static int verify_right_pinned(const ir_node *n)
995 if (get_irn_pinned(n) == op_pin_state_pinned)
997 mem = get_Call_mem(n);
999 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1000 if (is_NoMem(mem) || is_Pin(mem))
1006 * verify a Call node
1008 static int verify_node_Call(const ir_node *n)
1010 ir_graph *irg = get_irn_irg(n);
1011 ir_mode *mymode = get_irn_mode(n);
1012 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1013 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1018 /* Call: BB x M x ref x data1 x ... x datan
1019 --> M x datan+1 x ... x data n+m */
1020 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1022 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1023 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1025 mt = get_Call_type(n);
1026 if (get_unknown_type() == mt) {
1030 n_params = get_Call_n_params(n);
1031 for (i = 0; i < n_params; ++i) {
1032 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1035 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1036 /* Compare arguments of node with those of type */
1038 if (get_method_variadicity(mt) == variadicity_variadic) {
1040 (size_t)get_Call_n_params(n) >= get_method_n_params(mt),
1041 "Number of args for Call doesn't match number of args in variadic type.",
1043 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1044 n, get_Call_n_params(n), get_method_n_params(mt));
1048 (size_t)get_Call_n_params(n) == get_method_n_params(mt),
1049 "Number of args for Call doesn't match number of args in non variadic type.",
1051 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1052 n, get_Call_n_params(n), get_method_n_params(mt));
1056 for (i = 0; i < get_method_n_params(mt); i++) {
1057 ir_type *t = get_method_param_type(mt, i);
1059 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1060 if (is_atomic_type(t)) {
1062 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1063 "Mode of arg for Call doesn't match mode of arg type.", 0,
1064 show_call_param(n, mt);
1067 /* call with a compound type, mode must be reference */
1069 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1070 "Mode of arg for Call doesn't match mode of arg type.", 0,
1071 show_call_param(n, mt);
1081 * verify an Add node
1083 static int verify_node_Add(const ir_node *n)
1085 ir_mode *mymode = get_irn_mode(n);
1086 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1087 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1091 /* common Add: BB x numP x numP --> numP */
1092 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1093 /* Pointer Add: BB x ref x int --> ref */
1094 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1095 /* Pointer Add: BB x int x ref --> ref */
1096 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1099 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1100 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1101 "/* Pointer Add: BB x int x ref --> ref */");
1109 static int verify_node_Sub(const ir_node *n)
1111 ir_mode *mymode = get_irn_mode(n);
1112 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1113 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1117 /* common Sub: BB x numP x numP --> numP */
1118 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1119 /* Pointer Sub: BB x ref x int --> ref */
1120 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1121 /* Pointer Sub: BB x ref x ref --> int */
1122 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1125 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1126 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1127 "/* Pointer Sub: BB x ref x ref --> int */" );
1133 * verify a Minus node
1135 static int verify_node_Minus(const ir_node *n)
1137 ir_mode *mymode = get_irn_mode(n);
1138 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1141 /* Minus: BB x num --> num */
1142 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1143 show_unop_failure(n , "/* Minus: BB x num --> num */");
1151 static int verify_node_Mul(const ir_node *n)
1153 ir_mode *mymode = get_irn_mode(n);
1154 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1155 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1159 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1160 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1161 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1162 /* Mul: BB x float x float --> float */
1163 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1166 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1167 "/* Mul: BB x float x float --> float */");
1173 * verify a Mulh node
1175 static int verify_node_Mulh(const ir_node *n)
1177 ir_mode *mymode = get_irn_mode(n);
1178 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1179 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1183 /* Mulh: BB x int x int --> int */
1184 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1187 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1195 static int verify_node_Div(const ir_node *n)
1197 ir_mode *mymode = get_irn_mode(n);
1198 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1199 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1200 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1201 ir_mode *resmode = get_Div_resmode(n);
1204 /* Div: BB x M x num x num --> M x X x num */
1205 op1mode == mode_M &&
1206 op2mode == resmode &&
1207 op3mode == resmode &&
1208 mode_is_num(resmode) &&
1218 static int verify_node_Mod(const ir_node *n)
1220 ir_mode *mymode = get_irn_mode(n);
1221 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1222 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1223 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1224 ir_mode *resmode = get_Mod_resmode(n);
1227 /* Mod: BB x M x int x int --> M x X x int */
1228 op1mode == mode_M &&
1229 op2mode == resmode &&
1230 op3mode == resmode &&
1231 mode_is_int(resmode) &&
1239 * verify a logical And, Or, Eor node
1241 static int verify_node_Logic(const ir_node *n)
1243 ir_mode *mymode = get_irn_mode(n);
1244 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1245 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1248 /* And or Or or Eor: BB x int x int --> int */
1249 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1250 op2mode == op1mode &&
1252 "And, Or or Eor node", 0,
1253 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1258 static int verify_node_And(const ir_node *n)
1260 return verify_node_Logic(n);
1263 static int verify_node_Or(const ir_node *n)
1265 return verify_node_Logic(n);
1268 static int verify_node_Eor(const ir_node *n)
1270 return verify_node_Logic(n);
1276 static int verify_node_Not(const ir_node *n)
1278 ir_mode *mymode = get_irn_mode(n);
1279 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1282 /* Not: BB x int --> int */
1283 (mode_is_int(mymode) || mymode == mode_b) &&
1286 show_unop_failure(n, "/* Not: BB x int --> int */");
1294 static int verify_node_Cmp(const ir_node *n)
1296 ir_mode *mymode = get_irn_mode(n);
1297 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1298 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1301 /* Cmp: BB x datab x datab --> b16 */
1302 mode_is_datab(op1mode) &&
1303 op2mode == op1mode &&
1306 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1312 * verify a Shift node
1314 static int verify_node_Shift(const ir_node *n)
1316 ir_mode *mymode = get_irn_mode(n);
1317 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1318 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1321 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1322 mode_is_int(op1mode) &&
1323 mode_is_int(op2mode) &&
1324 !mode_is_signed(op2mode) &&
1326 "Shl, Shr or Shrs node", 0,
1327 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1332 static int verify_node_Shl(const ir_node *n)
1334 return verify_node_Shift(n);
1337 static int verify_node_Shr(const ir_node *n)
1339 return verify_node_Shift(n);
1342 static int verify_node_Shrs(const ir_node *n)
1344 return verify_node_Shift(n);
1348 * verify a Rotl node
1350 static int verify_node_Rotl(const ir_node *n)
1352 ir_mode *mymode = get_irn_mode(n);
1353 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1354 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1357 /* Rotl: BB x int x int --> int */
1358 mode_is_int(op1mode) &&
1359 mode_is_int(op2mode) &&
1362 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1368 * verify a Conv node
1370 static int verify_node_Conv(const ir_node *n)
1372 ir_mode *mymode = get_irn_mode(n);
1373 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1375 ASSERT_AND_RET_DBG(mode_is_data(op1mode) && mode_is_data(mymode),
1377 show_unop_failure(n, "/* Conv: BB x data --> data */");
1385 static int verify_node_Phi(const ir_node *n)
1387 ir_mode *mymode = get_irn_mode(n);
1388 ir_node *block = get_nodes_block(n);
1391 /* a Phi node MUST have the same number of inputs as its block
1392 * Exception is a phi with 0 inputs which is used when (re)constructing the
1395 && !irg_is_constrained(get_irn_irg(n), IR_GRAPH_CONSTRAINT_CONSTRUCTION)
1396 && get_irn_arity(n) > 0) {
1398 get_irn_arity(n) == get_irn_arity(block),
1399 "wrong number of inputs in Phi node", 0,
1400 show_phi_inputs(n, block);
1404 /* Phi: BB x dataM^n --> dataM */
1405 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1406 ir_node *pred = get_Phi_pred(n, i);
1407 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1408 "Phi node", 0, show_phi_failure(n, pred, i);
1411 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1417 * verify a Load node
1419 static int verify_node_Load(const ir_node *n)
1421 ir_graph *irg = get_irn_irg(n);
1422 ir_mode *mymode = get_irn_mode(n);
1423 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1424 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1426 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1427 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1428 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1430 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1436 * verify a Store node
1438 static int verify_node_Store(const ir_node *n)
1440 ir_graph *irg = get_irn_irg(n);
1442 ir_mode *mymode = get_irn_mode(n);
1443 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1444 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1445 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1447 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1448 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1449 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1451 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1457 * verify an Alloc node
1459 static int verify_node_Alloc(const ir_node *n)
1461 ir_mode *mymode = get_irn_mode(n);
1462 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1463 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1466 /* Alloc: BB x M x int_u --> M x X x ref */
1467 op1mode == mode_M &&
1468 mode_is_int(op2mode) &&
1469 !mode_is_signed(op2mode) &&
1472 show_node_failure(n);
1478 * verify a Free node
1480 static int verify_node_Free(const ir_node *n)
1482 ir_mode *mymode = get_irn_mode(n);
1483 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1484 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1485 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1488 /* Free: BB x M x ref x int_u --> M */
1489 op1mode == mode_M && mode_is_reference(op2mode) &&
1490 mode_is_int(op3mode) &&
1491 !mode_is_signed(op3mode) &&
1494 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1500 * verify a Sync node
1502 static int verify_node_Sync(const ir_node *n)
1505 ir_mode *mymode = get_irn_mode(n);
1507 /* Sync: BB x M^n --> M */
1508 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1509 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1511 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1516 * verify a Confirm node
1518 static int verify_node_Confirm(const ir_node *n)
1520 ir_mode *mymode = get_irn_mode(n);
1521 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1522 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1525 /* Confirm: BB x T x T --> T */
1526 op1mode == mymode &&
1529 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1537 static int verify_node_Mux(const ir_node *n)
1539 ir_mode *mymode = get_irn_mode(n);
1540 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1541 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1542 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1545 /* Mux: BB x b x datab x datab --> datab */
1546 op1mode == mode_b &&
1547 op2mode == mymode &&
1548 op3mode == mymode &&
1549 mode_is_datab(mymode),
1556 * verify a CopyB node
1558 static int verify_node_CopyB(const ir_node *n)
1560 ir_graph *irg = get_irn_irg(n);
1561 ir_mode *mymode = get_irn_mode(n);
1562 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1563 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1564 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1565 ir_type *t = get_CopyB_type(n);
1567 /* CopyB: BB x M x ref x ref --> M x X */
1568 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1569 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) {
1570 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1575 is_compound_type(t) || is_Array_type(t),
1576 "CopyB node should copy compound types only", 0 );
1578 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1579 This should happen RARELY, as CopyB COPIES MEMORY */
1580 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1586 * For each usage of a node, it is checked, if the block of the
1587 * node dominates the block of the usage (for phis: the predecessor
1588 * block of the phi for the corresponding edge).
1590 * @return non-zero on success, 0 on dominance error
1592 static int check_dominance_for_node(const ir_node *use)
1594 /* This won't work for blocks and the end node */
1595 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1597 ir_node *bl = get_nodes_block(use);
1599 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1600 ir_node *def = get_irn_n(use, i);
1601 ir_node *def_bl = get_nodes_block(def);
1602 ir_node *use_bl = bl;
1605 /* we have no dominance relation for unreachable blocks, so we can't
1606 * check the dominance property there */
1607 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1613 use_bl = get_Block_cfgpred_block(bl, i);
1616 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1619 irg = get_irn_irg(use);
1621 block_dominates(def_bl, use_bl),
1622 "the definition of a value used violates the dominance property", 0,
1624 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1625 irg, def_bl, def, use_bl, use, i
1633 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1637 if (!get_node_verification_mode())
1641 * do NOT check placement in interprocedural view, as we don't always
1642 * know the "right" graph ...
1646 /* this is an expensive check for large graphs (it has a quadratic
1647 * runtime but with a small constant); so do NOT run it in release mode
1650 node_is_in_irgs_storage(irg, n),
1651 "Node is not stored on proper IR graph!", 0,
1652 show_node_on_graph(irg, n);
1655 assert(get_irn_irg(n) == irg);
1657 unsigned idx = get_irn_idx(n);
1658 ir_node *node_from_map = get_idx_irn(irg, idx);
1659 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1660 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1666 if (get_op_pinned(op) >= op_pin_state_exc_pinned) {
1667 op_pin_state state = get_irn_pinned(n);
1669 state == op_pin_state_floats ||
1670 state == op_pin_state_pinned,
1671 "invalid pin state", 0,
1672 ir_printf("node %+F", n);
1674 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1675 && irg_has_properties(irg, IR_GRAPH_PROPERTY_NO_BADS)) {
1676 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1677 "block input is not a block", 0,
1678 ir_printf("node %+F", n);
1683 !is_irn_start_block_placed(n) || get_nodes_block(n) == get_irg_start_block(irg),
1684 "node should be in start block", 0,
1685 ir_printf("node %+F", n);
1688 if (op->ops.verify_node)
1689 return op->ops.verify_node(n);
1695 int irn_verify(const ir_node *n)
1697 #ifdef DEBUG_libfirm
1698 return irn_verify_irg(n, get_irn_irg(n));
1705 /*-----------------------------------------------------------------*/
1706 /* Verify the whole graph. */
1707 /*-----------------------------------------------------------------*/
1709 #ifdef DEBUG_libfirm
1711 * Walker to check every node
1713 static void verify_wrap(ir_node *node, void *env)
1715 int *res = (int*)env;
1716 *res = irn_verify_irg(node, get_irn_irg(node));
1720 * Walker to check every node including SSA property.
1721 * Only called if dominance info is available.
1723 static void verify_wrap_ssa(ir_node *node, void *env)
1725 int *res = (int*)env;
1727 *res = irn_verify_irg(node, get_irn_irg(node));
1729 *res = check_dominance_for_node(node);
1733 #endif /* DEBUG_libfirm */
1735 typedef struct check_cfg_env_t {
1736 pmap *branch_nodes; /**< map blocks to their branching nodes,
1737 map mode_X nodes to the blocks they branch to */
1739 ir_nodeset_t reachable_blocks;
1740 ir_nodeset_t kept_nodes;
1741 ir_nodeset_t true_projs;
1742 ir_nodeset_t false_projs;
1745 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1751 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1752 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1753 ir_printf("block %+F\n", block);
1756 n_cfgpreds = get_Block_n_cfgpreds(block);
1757 branch_nodes = env->branch_nodes;
1758 for (i = 0; i < n_cfgpreds; ++i) {
1759 /* check that each mode_X node is only connected
1761 ir_node *branch = get_Block_cfgpred(block, i);
1762 ir_node *former_dest;
1763 ir_node *former_branch;
1764 ir_node *branch_proj;
1765 ir_node *branch_block;
1766 branch = skip_Tuple(branch);
1769 former_dest = pmap_get(ir_node, branch_nodes, branch);
1770 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1771 "Multiple users on mode_X node", 0,
1772 ir_printf("node %+F\n", branch);
1774 pmap_insert(branch_nodes, branch, (void*)block);
1776 /* check that there's only 1 branching instruction in each block */
1777 branch_block = get_nodes_block(branch);
1778 branch_proj = branch;
1779 if (is_Proj(branch)) {
1780 branch = skip_Proj(branch);
1782 former_branch = pmap_get(ir_node, branch_nodes, branch_block);
1784 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1785 "Multiple branching nodes in a block", 0,
1786 ir_printf("nodes %+F,%+F in block %+F\n",
1787 branch, former_branch, branch_block);
1789 pmap_insert(branch_nodes, branch_block, branch);
1791 if (is_Cond(branch)) {
1792 long pn = get_Proj_proj(branch_proj);
1793 if (pn == pn_Cond_true)
1794 ir_nodeset_insert(&env->true_projs, branch);
1795 if (pn == pn_Cond_false)
1796 ir_nodeset_insert(&env->false_projs, branch);
1797 } else if (is_Switch(branch)) {
1798 long pn = get_Proj_proj(branch_proj);
1799 if (pn == pn_Switch_default)
1800 ir_nodeset_insert(&env->true_projs, branch);
1807 static void check_cfg_walk_func(ir_node *node, void *data)
1809 check_cfg_env_t *env = (check_cfg_env_t*)data;
1810 if (!is_Block(node))
1812 env->res &= check_block_cfg(node, env);
1815 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1817 ir_node *branch = pmap_get(ir_node, env->branch_nodes, block);
1818 ASSERT_AND_RET_DBG(branch != NULL
1819 || ir_nodeset_contains(&env->kept_nodes, block)
1820 || block == get_irg_end_block(get_irn_irg(block)),
1821 "block contains no cfop", 0,
1822 ir_printf("block %+F\n", block);
1827 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1829 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1830 "Cond node lacks true proj", 0,
1831 ir_printf("Cond %+F\n", cond);
1833 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1834 "Cond node lacks false proj", 0,
1835 ir_printf("Cond %+F\n", cond);
1840 static int verify_switch_projs(const ir_node *sw, check_cfg_env_t *env)
1842 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, sw),
1843 "Switch node lacks default Proj", 0,
1844 ir_printf("Switch %+F\n", sw);
1849 static void assert_branch(ir_node *node, void *data)
1851 check_cfg_env_t *env = (check_cfg_env_t*)data;
1852 if (is_Block(node)) {
1853 env->res &= verify_block_branch(node, env);
1854 } else if (is_Cond(node)) {
1855 env->res &= verify_cond_projs(node, env);
1856 } else if (is_Switch(node)) {
1857 env->res &= verify_switch_projs(node, env);
1861 static void collect_reachable_blocks(ir_node *block, void *data)
1863 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1864 ir_nodeset_insert(reachable_blocks, block);
1868 * Checks CFG well-formedness
1870 static int check_cfg(ir_graph *irg)
1872 check_cfg_env_t env;
1873 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1875 ir_nodeset_init(&env.reachable_blocks);
1876 ir_nodeset_init(&env.true_projs);
1877 ir_nodeset_init(&env.false_projs);
1879 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1880 &env.reachable_blocks);
1882 /* note that we do not use irg_walk_block because it will miss these
1883 * invalid blocks without a jump instruction which we want to detect
1885 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1887 ir_nodeset_init(&env.kept_nodes);
1889 ir_node *end = get_irg_end(irg);
1890 int arity = get_irn_arity(end);
1892 for (i = 0; i < arity; ++i) {
1893 ir_node *n = get_irn_n(end, i);
1894 ir_nodeset_insert(&env.kept_nodes, n);
1897 irg_walk_graph(irg, assert_branch, NULL, &env);
1899 ir_nodeset_destroy(&env.false_projs);
1900 ir_nodeset_destroy(&env.true_projs);
1901 ir_nodeset_destroy(&env.kept_nodes);
1902 ir_nodeset_destroy(&env.reachable_blocks);
1903 pmap_destroy(env.branch_nodes);
1907 int irg_verify(ir_graph *irg, unsigned flags)
1910 #ifdef DEBUG_libfirm
1911 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1914 last_irg_error = NULL;
1917 if (pinned && !check_cfg(irg))
1920 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
1925 pinned && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE)
1926 ? verify_wrap_ssa : verify_wrap,
1931 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1932 ir_entity *ent = get_irg_entity(irg);
1935 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1937 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1943 #endif /* DEBUG_libfirm */
1948 typedef struct pass_t {
1949 ir_graph_pass_t pass;
1954 * Wrapper to irg_verify to be run as an ir_graph pass.
1956 static int irg_verify_wrapper(ir_graph *irg, void *context)
1958 pass_t *pass = (pass_t*)context;
1959 irg_verify(irg, pass->flags);
1960 /* do NOT rerun the pass if verify is ok :-) */
1964 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1966 pass_t *pass = XMALLOCZ(pass_t);
1968 def_graph_pass_constructor(
1969 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1971 /* neither dump for verify */
1972 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1973 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1975 pass->flags = flags;
1979 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
1980 const char **bad_string)
1983 firm_verification_t old = get_node_verification_mode();
1985 firm_verify_failure_msg = NULL;
1986 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1987 res = irn_verify_irg(n, irg);
1988 if (res && irg_has_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE) &&
1989 get_irg_pinned(irg) == op_pin_state_pinned)
1990 res = check_dominance_for_node(n);
1991 do_node_verification(old);
1992 *bad_string = firm_verify_failure_msg;
1997 typedef struct verify_bad_env_t {
2003 * Pre-Walker: check Bad predecessors of node.
2005 static void check_bads(ir_node *node, void *env)
2007 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2008 int i, arity = get_irn_arity(node);
2009 ir_graph *irg = get_irn_irg(node);
2011 if (is_Block(node)) {
2012 if ((venv->flags & BAD_CF) == 0) {
2014 /* check for Bad Block predecessor */
2015 for (i = 0; i < arity; ++i) {
2016 ir_node *pred = get_irn_n(node, i);
2019 venv->res |= BAD_CF;
2021 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2022 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2024 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2025 dump_ir_graph(irg, "assert");
2026 assert(0 && "Bad CF detected");
2032 if ((venv->flags & BAD_BLOCK) == 0) {
2034 /* check for Bad Block */
2035 if (is_Bad(get_nodes_block(node))) {
2036 venv->res |= BAD_BLOCK;
2038 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2039 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2041 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2042 dump_ir_graph(irg, "assert");
2043 assert(0 && "Bad CF detected");
2048 if ((venv->flags & TUPLE) == 0) {
2049 if (is_Tuple(node)) {
2052 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2053 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2055 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2056 dump_ir_graph(irg, "assert");
2057 assert(0 && "Tuple detected");
2062 for (i = 0; i < arity; ++i) {
2063 ir_node *pred = get_irn_n(node, i);
2066 /* check for Phi with Bad inputs */
2067 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2068 if (venv->flags & BAD_CF)
2071 venv->res |= BAD_CF;
2073 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2074 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2076 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2077 dump_ir_graph(irg, "assert");
2078 assert(0 && "Bad CF detected");
2083 /* Bad node input */
2084 if ((venv->flags & BAD_DF) == 0) {
2085 venv->res |= BAD_DF;
2087 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2088 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2090 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2091 dump_ir_graph(irg, "assert");
2092 assert(0 && "Bad NON-CF detected");
2100 int irg_verify_bads(ir_graph *irg, int flags)
2102 verify_bad_env_t env;
2107 irg_walk_graph(irg, check_bads, NULL, &env);
2112 static void register_verify_node_func(ir_op *op, verify_node_func func)
2114 op->ops.verify_node = func;
2117 static void register_verify_node_func_proj(ir_op *op, verify_node_func func)
2119 op->ops.verify_proj_node = func;
2122 void ir_register_verify_node_ops(void)
2124 register_verify_node_func(op_Add, verify_node_Add);
2125 register_verify_node_func(op_Alloc, verify_node_Alloc);
2126 register_verify_node_func(op_And, verify_node_And);
2127 register_verify_node_func(op_Block, verify_node_Block);
2128 register_verify_node_func(op_Call, verify_node_Call);
2129 register_verify_node_func(op_Cmp, verify_node_Cmp);
2130 register_verify_node_func(op_Cond, verify_node_Cond);
2131 register_verify_node_func(op_Confirm, verify_node_Confirm);
2132 register_verify_node_func(op_Const, verify_node_Const);
2133 register_verify_node_func(op_Conv, verify_node_Conv);
2134 register_verify_node_func(op_CopyB, verify_node_CopyB);
2135 register_verify_node_func(op_Div, verify_node_Div);
2136 register_verify_node_func(op_Eor, verify_node_Eor);
2137 register_verify_node_func(op_Free, verify_node_Free);
2138 register_verify_node_func(op_IJmp, verify_node_IJmp);
2139 register_verify_node_func(op_InstOf, verify_node_InstOf);
2140 register_verify_node_func(op_Jmp, verify_node_Jmp);
2141 register_verify_node_func(op_Load, verify_node_Load);
2142 register_verify_node_func(op_Minus, verify_node_Minus);
2143 register_verify_node_func(op_Mod, verify_node_Mod);
2144 register_verify_node_func(op_Mul, verify_node_Mul);
2145 register_verify_node_func(op_Mulh, verify_node_Mulh);
2146 register_verify_node_func(op_Mux, verify_node_Mux);
2147 register_verify_node_func(op_Not, verify_node_Not);
2148 register_verify_node_func(op_Or, verify_node_Or);
2149 register_verify_node_func(op_Phi, verify_node_Phi);
2150 register_verify_node_func(op_Proj, verify_node_Proj);
2151 register_verify_node_func(op_Raise, verify_node_Raise);
2152 register_verify_node_func(op_Return, verify_node_Return);
2153 register_verify_node_func(op_Rotl, verify_node_Rotl);
2154 register_verify_node_func(op_Sel, verify_node_Sel);
2155 register_verify_node_func(op_Shl, verify_node_Shl);
2156 register_verify_node_func(op_Shr, verify_node_Shr);
2157 register_verify_node_func(op_Shrs, verify_node_Shrs);
2158 register_verify_node_func(op_Start, verify_node_Start);
2159 register_verify_node_func(op_Store, verify_node_Store);
2160 register_verify_node_func(op_Sub, verify_node_Sub);
2161 register_verify_node_func(op_Switch, verify_node_Switch);
2162 register_verify_node_func(op_SymConst, verify_node_SymConst);
2163 register_verify_node_func(op_Sync, verify_node_Sync);
2165 register_verify_node_func_proj(op_Alloc, verify_node_Proj_Alloc);
2166 register_verify_node_func_proj(op_Call, verify_node_Proj_Call);
2167 register_verify_node_func_proj(op_Cond, verify_node_Proj_Cond);
2168 register_verify_node_func_proj(op_CopyB, verify_node_Proj_CopyB);
2169 register_verify_node_func_proj(op_Div, verify_node_Proj_Div);
2170 register_verify_node_func_proj(op_InstOf, verify_node_Proj_InstOf);
2171 register_verify_node_func_proj(op_Load, verify_node_Proj_Load);
2172 register_verify_node_func_proj(op_Mod, verify_node_Proj_Mod);
2173 register_verify_node_func_proj(op_Proj, verify_node_Proj_Proj);
2174 register_verify_node_func_proj(op_Raise, verify_node_Proj_Raise);
2175 register_verify_node_func_proj(op_Start, verify_node_Proj_Start);
2176 register_verify_node_func_proj(op_Store, verify_node_Proj_Store);
2177 register_verify_node_func_proj(op_Switch, verify_node_Proj_Switch);
2178 register_verify_node_func_proj(op_Tuple, verify_node_Proj_Tuple);