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"
41 /** if this flag is set, verify entity types in Load & Store nodes */
42 static int verify_entities = 0;
44 const char *firm_verify_failure_msg;
46 /* enable verification of Load/Store entities */
47 void verify_enable_entity_tests(int enable)
49 verify_entities = enable;
55 * little helper for NULL modes
57 static const char *get_mode_name_ex(ir_mode *mode)
61 return get_mode_name(mode);
64 /** the last IRG, on which a verification error was found */
65 static ir_graph *last_irg_error = NULL;
68 * print the name of the entity of an verification failure
70 * @param node the node caused the failure
72 static void show_entity_failure(const ir_node *node)
74 ir_graph *irg = get_irn_irg(node);
76 if (last_irg_error == irg)
81 if (irg == get_const_code_irg()) {
82 fprintf(stderr, "\nFIRM: irn_verify_irg() <of CONST_CODE_IRG> failed\n");
84 ir_entity *ent = get_irg_entity(irg);
87 ir_type *ent_type = get_entity_owner(ent);
90 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n",
91 ent_type, get_entity_name(ent));
93 fprintf(stderr, "\nFIRM: irn_verify_irg() <NULL>::%s failed\n", get_entity_name(ent));
96 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
101 static const char *get_irn_modename(const ir_node *node)
103 ir_mode *mode = get_irn_mode(node);
104 return get_mode_name(mode);
108 * Prints a failure for a Node
110 static void show_node_failure(const ir_node *n)
112 show_entity_failure(n);
113 fprintf(stderr, " node %ld %s%s\n" ,
115 get_irn_opname(n), get_irn_modename(n)
120 * Prints a failure message for a binop
122 static void show_binop_failure(const ir_node *n, const char *text)
124 ir_node *left = get_binop_left(n);
125 ir_node *right = get_binop_right(n);
127 show_entity_failure(n);
128 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
130 get_irn_opname(n), get_irn_modename(n),
131 get_irn_opname(left), get_irn_modename(left),
132 get_irn_opname(right), get_irn_modename(right),
137 * Prints a failure message for an unop
139 static void show_unop_failure(const ir_node *n, const char *text)
141 ir_node *op = get_unop_op(n);
143 show_entity_failure(n);
144 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
146 get_irn_opname(n), get_irn_modename(n),
147 get_irn_opname(op), get_irn_modename(op),
152 * Prints a failure message for an op with 3 operands
154 static void show_triop_failure(const ir_node *n, const char *text)
156 ir_node *op0 = get_irn_n(n, 0);
157 ir_node *op1 = get_irn_n(n, 1);
158 ir_node *op2 = get_irn_n(n, 2);
160 show_entity_failure(n);
161 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
163 get_irn_opname(n), get_irn_modename(n),
164 get_irn_opname(op0), get_irn_modename(op0),
165 get_irn_opname(op1), get_irn_modename(op1),
166 get_irn_opname(op2), get_irn_modename(op2),
171 * Prints a failure message for a proj
173 static void show_proj_failure(const ir_node *n)
175 ir_node *op = get_Proj_pred(n);
176 int proj = get_Proj_proj(n);
178 show_entity_failure(n);
179 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
181 get_irn_opname(n), get_irn_modename(n), proj,
182 get_irn_opname(op), get_irn_modename(op));
186 * Prints a failure message for a proj from Start
188 static void show_proj_mode_failure(const ir_node *n, ir_type *ty)
190 long proj = get_Proj_proj(n);
191 ir_mode *m = get_type_mode(ty);
193 ir_print_type(type_name, sizeof(type_name), ty);
195 show_entity_failure(n);
196 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
201 get_mode_name_ex(m));
205 * Prints a failure message for a proj
207 static void show_proj_failure_ent(const ir_node *n, ir_entity *ent)
209 ir_node *op = get_Proj_pred(n);
210 int proj = get_Proj_proj(n);
211 ir_mode *m = get_type_mode(get_entity_type(ent));
213 ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
215 show_entity_failure(n);
216 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
218 get_irn_opname(n), get_irn_modename(n), proj,
219 get_irn_opname(op), get_irn_modename(op),
220 get_entity_name(ent), type_name,
221 get_mode_name_ex(m));
225 * Show a node and a graph
227 static void show_node_on_graph(const ir_graph *irg, const ir_node *n)
229 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
233 * Show call parameters
235 static void show_call_param(const ir_node *n, ir_type *mt)
239 ir_print_type(type_name, sizeof(type_name), mt);
241 show_entity_failure(n);
242 fprintf(stderr, " Call type-check failed: %s(", type_name);
243 for (i = 0; i < get_method_n_params(mt); ++i) {
244 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
246 fprintf(stderr, ") != CALL(");
248 for (i = 0; i < get_Call_n_params(n); ++i) {
249 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
251 fprintf(stderr, ")\n");
257 static void show_return_modes(const ir_graph *irg, const ir_node *n,
260 ir_entity *ent = get_irg_entity(irg);
262 show_entity_failure(n);
263 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
264 get_irn_node_nr(n), get_entity_name(ent),
265 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
266 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
271 * Show return number of results
273 static void show_return_nres(const ir_graph *irg, const ir_node *n, ir_type *mt)
275 ir_entity *ent = get_irg_entity(irg);
277 show_entity_failure(n);
278 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
279 get_irn_node_nr(n), get_entity_name(ent),
280 (unsigned long) get_Return_n_ress(n),
281 (unsigned long) get_method_n_ress(mt));
287 static void show_phi_failure(const ir_node *phi, const ir_node *pred, int pos)
290 show_entity_failure(phi);
291 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
292 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
293 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
299 static void show_phi_inputs(const ir_node *phi, const ir_node *block)
301 show_entity_failure(phi);
302 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
303 get_irn_node_nr(phi), get_irn_arity(phi),
304 get_irn_node_nr(block), get_irn_arity(block));
307 #endif /* #ifndef NDEBUG */
310 * If the address is Sel or SymConst, return the entity.
312 * @param ptr the node representing the address
314 static ir_entity *get_ptr_entity(const ir_node *ptr)
317 return get_Sel_entity(ptr);
318 } else if (is_SymConst_addr_ent(ptr)) {
319 return get_SymConst_entity(ptr);
325 * verify a Proj(Start) node
327 static int verify_node_Proj_Start(const ir_node *p)
329 ir_mode *mode = get_irn_mode(p);
330 long proj = get_Proj_proj(p);
334 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
335 (proj == pn_Start_M && mode == mode_M) ||
336 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
337 (proj == pn_Start_T_args && mode == mode_T)
339 "wrong Proj from Start", 0,
340 show_proj_failure(p);
346 * verify a Proj(Cond) node
348 static int verify_node_Proj_Cond(const ir_node *p)
350 ir_mode *mode = get_irn_mode(p);
351 ir_node *pred = get_Proj_pred(p);
352 long proj = get_Proj_proj(p);
356 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
357 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) /* switch */
359 "wrong Proj from Cond", 0,
360 show_proj_failure(p);
366 * verify a Proj(Raise) node
368 static int verify_node_Proj_Raise(const ir_node *p)
370 ir_mode *mode = get_irn_mode(p);
371 long proj = get_Proj_proj(p);
374 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
375 "wrong Proj from Raise", 0,
376 show_proj_failure(p);
382 * verify a Proj(InstOf) node
384 static int verify_node_Proj_InstOf(const ir_node *p)
386 ir_mode *mode = get_irn_mode(p);
387 long proj = get_Proj_proj(p);
391 (proj == pn_InstOf_M && mode == mode_M) ||
392 (proj == pn_InstOf_X_regular && mode == mode_X) ||
393 (proj == pn_InstOf_X_except && mode == mode_X) ||
394 (proj == pn_InstOf_res && mode_is_reference(mode))
396 "wrong Proj from InstOf", 0,
397 show_proj_failure(p);
403 * verify a Proj(Call) node
405 static int verify_node_Proj_Call(const ir_node *p)
407 ir_mode *mode = get_irn_mode(p);
408 ir_node *n = get_Proj_pred(p);
409 long proj = get_Proj_proj(p);
413 (proj == pn_Call_M && mode == mode_M) ||
414 (proj == pn_Call_X_regular && mode == mode_X) ||
415 (proj == pn_Call_X_except && mode == mode_X) ||
416 (proj == pn_Call_T_result && mode == mode_T)
418 "wrong Proj from Call", 0,
419 show_proj_failure(p);
421 /* if we have exception flow, we must have a real Memory input */
422 if (proj == pn_Call_X_regular)
424 !is_NoMem(get_Call_mem(n)),
425 "Regular Proj from FunctionCall", 0);
426 else if (proj == pn_Call_X_except)
428 !is_NoMem(get_Call_mem(n)),
429 "Exception Proj from FunctionCall", 0);
434 * verify a Proj(Div) node
436 static int verify_node_Proj_Div(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_Div_M && mode == mode_M) ||
445 (proj == pn_Div_X_regular && mode == mode_X) ||
446 (proj == pn_Div_X_except && mode == mode_X) ||
447 (proj == pn_Div_res && mode_is_data(mode) && mode == get_Div_resmode(n))
449 "wrong Proj from Div", 0,
450 show_proj_failure(p);
452 if (proj == pn_Div_X_regular)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Regular Proj from unpinned Div", 0);
456 else if (proj == pn_Div_X_except)
458 get_irn_pinned(n) == op_pin_state_pinned,
459 "Exception Proj from unpinned Div", 0);
460 else if (proj == pn_Div_M)
462 get_irn_pinned(n) == op_pin_state_pinned,
463 "Memory Proj from unpinned Div", 0);
468 * verify a Proj(Mod) node
470 static int verify_node_Proj_Mod(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);
478 (proj == pn_Mod_M && mode == mode_M) ||
479 (proj == pn_Mod_X_regular && mode == mode_X) ||
480 (proj == pn_Mod_X_except && mode == mode_X) ||
481 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
483 "wrong Proj from Mod", 0,
484 show_proj_failure(p);
486 if (proj == pn_Mod_X_regular)
488 get_irn_pinned(n) == op_pin_state_pinned,
489 "Regular Proj from unpinned Mod", 0);
490 else if (proj == pn_Mod_X_except)
492 get_irn_pinned(n) == op_pin_state_pinned,
493 "Exception Proj from unpinned Mod", 0);
494 else if (proj == pn_Mod_M)
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Memory Proj from unpinned Div", 0);
502 * verify a Proj(Load) node
504 static int verify_node_Proj_Load(const ir_node *p)
506 ir_mode *mode = get_irn_mode(p);
507 ir_node *n = get_Proj_pred(p);
508 long proj = get_Proj_proj(p);
510 if (proj == pn_Load_res) {
511 ir_node *ptr = get_Load_ptr(n);
512 ir_entity *ent = get_ptr_entity(ptr);
513 ir_graph *irg = get_irn_irg(n);
515 if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
516 /* do NOT check this for lowered phases, see comment on Store */
518 (mode == get_type_mode(get_entity_type(ent))),
519 "wrong data Proj from Load, entity type_mode failed", 0,
520 show_proj_failure_ent(p, ent);
525 mode_is_data(mode) && mode == get_Load_mode(n),
526 "wrong data Proj from Load", 0,
527 show_proj_failure(p);
534 (proj == pn_Load_M && mode == mode_M) ||
535 (proj == pn_Load_X_regular && mode == mode_X) ||
536 (proj == pn_Load_X_except && mode == mode_X)
538 "wrong Proj from Load", 0,
539 show_proj_failure(p);
542 if (proj == pn_Load_X_regular) {
544 get_irn_pinned(n) == op_pin_state_pinned,
545 "Regular Proj from unpinned Load", 0);
546 } else if (proj == pn_Load_X_except) {
548 get_irn_pinned(n) == op_pin_state_pinned,
549 "Exception Proj from unpinned Load", 0);
555 * verify a Proj(Store) node
557 static int verify_node_Proj_Store(const ir_node *p)
559 ir_mode *mode = get_irn_mode(p);
560 ir_node *n = get_Proj_pred(p);
561 long proj = get_Proj_proj(p);
565 (proj == pn_Store_M && mode == mode_M) ||
566 (proj == pn_Store_X_regular && mode == mode_X) ||
567 (proj == pn_Store_X_except && mode == mode_X)
569 "wrong Proj from Store", 0,
570 show_proj_failure(p);
572 if (proj == pn_Store_X_regular) {
574 get_irn_pinned(n) == op_pin_state_pinned,
575 "Regular Proj from unpinned Store", 0);
576 } else if (proj == pn_Store_X_except) {
578 get_irn_pinned(n) == op_pin_state_pinned,
579 "Exception Proj from unpinned Store", 0);
585 * verify a Proj(Alloc) node
587 static int verify_node_Proj_Alloc(const ir_node *p)
589 ir_mode *mode = get_irn_mode(p);
590 long proj = get_Proj_proj(p);
594 (proj == pn_Alloc_M && mode == mode_M) ||
595 (proj == pn_Alloc_X_regular && mode == mode_X) ||
596 (proj == pn_Alloc_X_except && mode == mode_X) ||
597 (proj == pn_Alloc_res && mode_is_reference(mode))
599 "wrong Proj from Alloc", 0,
600 show_proj_failure(p);
606 * verify a Proj(Proj) node
608 static int verify_node_Proj_Proj(const ir_node *p)
610 ir_mode *mode = get_irn_mode(p);
611 ir_node *pred = get_Proj_pred(p);
612 long proj = get_Proj_proj(p);
613 long nr = get_Proj_proj(pred);
614 ir_type *mt; /* A method type */
616 pred = skip_Id(get_Proj_pred(pred));
617 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
619 switch (get_irn_opcode(pred)) {
621 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
623 if (nr == pn_Start_T_args) {
625 (proj >= 0 && mode_is_datab(mode)),
626 "wrong Proj from Proj from Start", 0);
628 (proj < (int)get_method_n_params(mt)),
629 "More Projs for args than args in type", 0
631 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
632 /* value argument */ break;
634 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
636 (mode == get_type_mode(get_method_param_type(mt, proj))),
637 "Mode of Proj from Start doesn't match mode of param type.", 0,
638 show_proj_mode_failure(p, get_method_param_type(mt, proj));
647 (proj >= 0 && mode_is_datab(mode)),
648 "wrong Proj from Proj from Call", 0);
649 mt = get_Call_type(pred);
650 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
651 "wrong call type on call", 0);
653 (proj < (int)get_method_n_ress(mt)),
654 "More Projs for results than results in type.", 0);
655 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
656 /* value result */ break;
659 (mode == get_type_mode(get_method_res_type(mt, proj))),
660 "Mode of Proj from Call doesn't match mode of result type.", 0);
669 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
676 * verify a Proj(Tuple) node
678 static int verify_node_Proj_Tuple(const ir_node *p)
686 * verify a Proj(CopyB) node
688 static int verify_node_Proj_CopyB(const ir_node *p)
690 ir_mode *mode = get_irn_mode(p);
691 ir_node *n = get_Proj_pred(p);
692 long proj = get_Proj_proj(p);
696 (proj == pn_CopyB_M && mode == mode_M) ||
697 (proj == pn_CopyB_X_regular && mode == mode_X) ||
698 (proj == pn_CopyB_X_except && mode == mode_X)
700 "wrong Proj from CopyB", 0,
701 show_proj_failure(p);
703 if (proj == pn_CopyB_X_regular)
705 get_irn_pinned(n) == op_pin_state_pinned,
706 "Regular Proj from unpinned CopyB", 0);
707 else if (proj == pn_CopyB_X_except)
709 get_irn_pinned(n) == op_pin_state_pinned,
710 "Exception Proj from unpinned CopyB", 0);
715 * verify a Proj(Bound) node
717 static int verify_node_Proj_Bound(const ir_node *p)
719 ir_mode *mode = get_irn_mode(p);
720 ir_node *n = get_Proj_pred(p);
721 long proj = get_Proj_proj(p);
725 (proj == pn_Bound_M && mode == mode_M) ||
726 (proj == pn_Bound_X_regular && mode == mode_X) ||
727 (proj == pn_Bound_X_except && mode == mode_X) ||
728 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
730 "wrong Proj from Bound", 0,
731 show_proj_failure(p);
736 static int verify_node_Proj_fragile(const ir_node *node)
738 ir_node *pred = get_Proj_pred(node);
739 int throws_exception = ir_throws_exception(pred);
740 ASSERT_AND_RET((!is_x_except_Proj(node) || throws_exception)
741 && (!is_x_regular_Proj(node) || throws_exception),
742 "X_except und X_regular Proj only allowed when throws_exception is set",
750 static int verify_node_Proj(const ir_node *p)
752 ir_graph *irg = get_irn_irg(p);
756 pred = skip_Id(get_Proj_pred(p));
757 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
758 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);
760 if (is_fragile_op(pred)) {
761 int res = verify_node_Proj_fragile(p);
766 op = get_irn_op(pred);
767 if (op->ops.verify_proj_node)
768 return op->ops.verify_proj_node(p);
775 * verify a Block node
777 static int verify_node_Block(const ir_node *n)
779 ir_graph *irg = get_irn_irg(n);
782 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
783 ir_node *pred = get_Block_cfgpred(n, i);
784 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
785 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
786 "Block node must have a mode_X predecessor", 0);
787 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
790 if (n == get_irg_start_block(irg)) {
791 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
794 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend) {
795 /* End block may only have Return, Raise or fragile ops as preds. */
796 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
797 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
798 if (is_Proj(pred) || is_Tuple(pred))
799 break; /* We can not test properly. How many tuples are there? */
807 "End Block node", 0);
810 /* irg attr must == graph we are in. */
811 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
816 * verify a Start node
818 static int verify_node_Start(const ir_node *n)
820 ir_mode *mymode = get_irn_mode(n);
823 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
824 mymode == mode_T, "Start node", 0
832 static int verify_node_Jmp(const ir_node *n)
834 ir_mode *mymode = get_irn_mode(n);
838 mymode == mode_X, "Jmp node", 0
844 * verify an IJmp node
846 static int verify_node_IJmp(const ir_node *n)
848 ir_mode *mymode = get_irn_mode(n);
849 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
852 /* IJmp: BB x ref --> X */
853 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
861 static int verify_node_Cond(const ir_node *n)
863 ir_mode *mymode = get_irn_mode(n);
864 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
867 /* Cond: BB x b --> X x X */
868 (op1mode == mode_b ||
869 /* Cond: BB x int --> X^n */
870 mode_is_int(op1mode) ), "Cond node", 0
872 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
878 * verify a Return node
880 static int verify_node_Return(const ir_node *n)
882 ir_graph *irg = get_irn_irg(n);
883 ir_mode *mymode = get_irn_mode(n);
884 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
888 /* Return: BB x M x data1 x ... x datan --> X */
890 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
892 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
893 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
895 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
896 /* Compare returned results with result types of method type */
897 mt = get_entity_type(get_irg_entity(irg));
898 ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
899 "Number of results for Return doesn't match number of results in type.", 0,
900 show_return_nres(irg, n, mt););
901 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
902 ir_type *res_type = get_method_res_type(mt, i);
904 if (get_irg_phase_state(irg) != phase_backend) {
905 if (is_atomic_type(res_type)) {
907 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
908 "Mode of result for Return doesn't match mode of result type.", 0,
909 show_return_modes(irg, n, mt, i);
913 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
914 "Mode of result for Return doesn't match mode of result type.", 0,
915 show_return_modes(irg, n, mt, i);
924 * verify a Raise node
926 static int verify_node_Raise(const ir_node *n)
928 ir_mode *mymode = get_irn_mode(n);
929 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
930 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
933 /* Sel: BB x M x ref --> X x M */
934 op1mode == mode_M && mode_is_reference(op2mode) &&
935 mymode == mode_T, "Raise node", 0
941 * verify a Const node
943 static int verify_node_Const(const ir_node *n)
945 ir_mode *mymode = get_irn_mode(n);
948 /* Const: BB --> data */
949 (mode_is_data(mymode) ||
950 mymode == mode_b) /* we want boolean constants for static evaluation */
951 ,"Const node", 0 /* of Cmp. */
954 /* the modes of the constant and teh tarval must match */
955 mymode == get_tarval_mode(get_Const_tarval(n)),
956 "Const node, tarval and node mode mismatch", 0
962 * verify a SymConst node
964 static int verify_node_SymConst(const ir_node *n)
966 ir_mode *mymode = get_irn_mode(n);
969 /* SymConst: BB --> int*/
970 (mode_is_int(mymode) ||
971 /* SymConst: BB --> ref */
972 mode_is_reference(mymode))
973 ,"SymConst node", 0);
980 static int verify_node_Sel(const ir_node *n)
983 ir_mode *mymode = get_irn_mode(n);
984 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
985 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
989 /* Sel: BB x M x ref x int^n --> ref */
990 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
991 "Sel node", 0, show_node_failure(n);
994 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
995 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n););
997 ent = get_Sel_entity(n);
998 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n););
1003 * verify an InstOf node
1005 static int verify_node_InstOf(const ir_node *n)
1007 ir_mode *mymode = get_irn_mode(n);
1008 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1010 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1011 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1016 * Check if the pinned state is right.
1018 static int verify_right_pinned(const ir_node *n)
1022 if (get_irn_pinned(n) == op_pin_state_pinned)
1024 mem = get_Call_mem(n);
1026 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1027 if (is_NoMem(mem) || is_Pin(mem))
1033 * verify a Call node
1035 static int verify_node_Call(const ir_node *n)
1037 ir_graph *irg = get_irn_irg(n);
1038 ir_mode *mymode = get_irn_mode(n);
1039 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1040 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1045 /* Call: BB x M x ref x data1 x ... x datan
1046 --> M x datan+1 x ... x data n+m */
1047 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1049 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1050 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1052 mt = get_Call_type(n);
1053 if (get_unknown_type() == mt) {
1057 n_params = get_Call_n_params(n);
1058 for (i = 0; i < n_params; ++i) {
1059 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1062 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1063 /* Compare arguments of node with those of type */
1065 if (get_method_variadicity(mt) == variadicity_variadic) {
1067 get_Call_n_params(n) >= get_method_n_params(mt),
1068 "Number of args for Call doesn't match number of args in variadic type.",
1070 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1071 n, get_Call_n_params(n), get_method_n_params(mt));
1075 get_Call_n_params(n) == get_method_n_params(mt),
1076 "Number of args for Call doesn't match number of args in non variadic type.",
1078 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1079 n, get_Call_n_params(n), get_method_n_params(mt));
1083 for (i = 0; i < get_method_n_params(mt); i++) {
1084 ir_type *t = get_method_param_type(mt, i);
1086 if (get_irg_phase_state(irg) != phase_backend) {
1087 if (is_atomic_type(t)) {
1089 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1090 "Mode of arg for Call doesn't match mode of arg type.", 0,
1091 show_call_param(n, mt);
1094 /* call with a compound type, mode must be reference */
1096 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1097 "Mode of arg for Call doesn't match mode of arg type.", 0,
1098 show_call_param(n, mt);
1108 * verify an Add node
1110 static int verify_node_Add(const ir_node *n)
1112 ir_mode *mymode = get_irn_mode(n);
1113 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1114 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1118 /* common Add: BB x numP x numP --> numP */
1119 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1120 /* Pointer Add: BB x ref x int --> ref */
1121 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1122 /* Pointer Add: BB x int x ref --> ref */
1123 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1126 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1127 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1128 "/* Pointer Add: BB x int x ref --> ref */");
1136 static int verify_node_Sub(const ir_node *n)
1138 ir_mode *mymode = get_irn_mode(n);
1139 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1140 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1144 /* common Sub: BB x numP x numP --> numP */
1145 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1146 /* Pointer Sub: BB x ref x int --> ref */
1147 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1148 /* Pointer Sub: BB x ref x ref --> int */
1149 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1152 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1153 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1154 "/* Pointer Sub: BB x ref x ref --> int */" );
1160 * verify a Minus node
1162 static int verify_node_Minus(const ir_node *n)
1164 ir_mode *mymode = get_irn_mode(n);
1165 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1168 /* Minus: BB x num --> num */
1169 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1170 show_unop_failure(n , "/* Minus: BB x num --> num */");
1178 static int verify_node_Mul(const ir_node *n)
1180 ir_mode *mymode = get_irn_mode(n);
1181 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1182 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1186 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1187 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1188 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1189 /* Mul: BB x float x float --> float */
1190 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1193 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1194 "/* Mul: BB x float x float --> float */");
1200 * verify a Mulh node
1202 static int verify_node_Mulh(const ir_node *n)
1204 ir_mode *mymode = get_irn_mode(n);
1205 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1206 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1210 /* Mulh: BB x int x int --> int */
1211 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1214 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1222 static int verify_node_Div(const ir_node *n)
1224 ir_mode *mymode = get_irn_mode(n);
1225 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1226 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1227 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1230 /* Div: BB x M x data x data --> M x X x data */
1231 op1mode == mode_M &&
1232 op2mode == op3mode &&
1233 mode_is_data(op2mode) &&
1243 static int verify_node_Mod(const ir_node *n)
1245 ir_mode *mymode = get_irn_mode(n);
1246 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1247 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1248 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1251 /* Mod: BB x M x int x int --> M x X x int */
1252 op1mode == mode_M &&
1253 op2mode == op3mode &&
1254 mode_is_int(op2mode) &&
1262 * verify a logical And, Or, Eor node
1264 static int verify_node_Logic(const ir_node *n)
1266 ir_mode *mymode = get_irn_mode(n);
1267 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1268 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1271 /* And or Or or Eor: BB x int x int --> int */
1272 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1273 op2mode == op1mode &&
1275 "And, Or or Eor node", 0,
1276 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1281 static int verify_node_And(const ir_node *n)
1283 return verify_node_Logic(n);
1286 static int verify_node_Or(const ir_node *n)
1288 return verify_node_Logic(n);
1291 static int verify_node_Eor(const ir_node *n)
1293 return verify_node_Logic(n);
1299 static int verify_node_Not(const ir_node *n)
1301 ir_mode *mymode = get_irn_mode(n);
1302 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1305 /* Not: BB x int --> int */
1306 (mode_is_int(mymode) || mymode == mode_b) &&
1309 show_unop_failure(n, "/* Not: BB x int --> int */");
1317 static int verify_node_Cmp(const ir_node *n)
1319 ir_mode *mymode = get_irn_mode(n);
1320 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1321 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1324 /* Cmp: BB x datab x datab --> b16 */
1325 mode_is_datab(op1mode) &&
1326 op2mode == op1mode &&
1329 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1335 * verify a Shift node
1337 static int verify_node_Shift(const ir_node *n)
1339 ir_mode *mymode = get_irn_mode(n);
1340 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1341 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1344 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1345 mode_is_int(op1mode) &&
1346 mode_is_int(op2mode) &&
1347 !mode_is_signed(op2mode) &&
1349 "Shl, Shr or Shrs node", 0,
1350 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1355 static int verify_node_Shl(const ir_node *n)
1357 return verify_node_Shift(n);
1360 static int verify_node_Shr(const ir_node *n)
1362 return verify_node_Shift(n);
1365 static int verify_node_Shrs(const ir_node *n)
1367 return verify_node_Shift(n);
1371 * verify a Rotl node
1373 static int verify_node_Rotl(const ir_node *n)
1375 ir_mode *mymode = get_irn_mode(n);
1376 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1377 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1380 /* Rotl: BB x int x int --> int */
1381 mode_is_int(op1mode) &&
1382 mode_is_int(op2mode) &&
1385 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1391 * verify a Conv node
1393 static int verify_node_Conv(const ir_node *n)
1395 ir_mode *mymode = get_irn_mode(n);
1396 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1398 ASSERT_AND_RET_DBG(mode_is_datab(op1mode) && mode_is_data(mymode),
1400 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1406 * verify a Cast node
1408 static int verify_node_Cast(const ir_node *n)
1410 ir_mode *mymode = get_irn_mode(n);
1411 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1414 /* Conv: BB x datab1 --> datab2 */
1415 mode_is_data(op1mode) && op1mode == mymode,
1417 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1425 static int verify_node_Phi(const ir_node *n)
1427 ir_mode *mymode = get_irn_mode(n);
1428 ir_node *block = get_nodes_block(n);
1431 /* a Phi node MUST have the same number of inputs as its block
1432 * Exception is a phi with 0 inputs which is used when (re)constructing the
1434 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1436 get_irn_arity(n) == get_irn_arity(block),
1437 "wrong number of inputs in Phi node", 0,
1438 show_phi_inputs(n, block);
1442 /* Phi: BB x dataM^n --> dataM */
1443 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1444 ir_node *pred = get_Phi_pred(n, i);
1445 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1446 "Phi node", 0, show_phi_failure(n, pred, i);
1449 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1455 * verify a Load node
1457 static int verify_node_Load(const ir_node *n)
1459 ir_graph *irg = get_irn_irg(n);
1460 ir_mode *mymode = get_irn_mode(n);
1461 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1462 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1464 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1465 if (get_irg_phase_state(irg) != phase_backend) {
1466 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1468 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1471 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1472 * (Proj (Proj))) sometimes ...
1474 * interprete.c:ai_eval seems to assume that this happens, too
1476 * obset.c:get_abstval_any can't deal with this if the load has
1480 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1481 assert ((NULL != ent) || (mymode != mode_T));
1489 * verify a Store node
1491 static int verify_node_Store(const ir_node *n)
1493 ir_graph *irg = get_irn_irg(n);
1496 ir_mode *mymode = get_irn_mode(n);
1497 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1498 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1499 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1501 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1502 if (get_irg_phase_state(irg) != phase_backend) {
1503 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1505 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1507 target = get_ptr_entity(get_Store_ptr(n));
1508 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1510 * If lowered code, any Sels that add 0 may be removed, causing
1511 * an direct access to entities of array or compound type.
1512 * Prevent this by checking the phase.
1514 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1522 * verify an Alloc node
1524 static int verify_node_Alloc(const ir_node *n)
1526 ir_mode *mymode = get_irn_mode(n);
1527 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1528 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1531 /* Alloc: BB x M x int_u --> M x X x ref */
1532 op1mode == mode_M &&
1533 mode_is_int(op2mode) &&
1534 !mode_is_signed(op2mode) &&
1537 show_node_failure(n);
1543 * verify a Free node
1545 static int verify_node_Free(const ir_node *n)
1547 ir_mode *mymode = get_irn_mode(n);
1548 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1549 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1550 ir_mode *op3mode = get_irn_mode(get_Free_count(n));
1553 /* Free: BB x M x ref x int_u --> M */
1554 op1mode == mode_M && mode_is_reference(op2mode) &&
1555 mode_is_int(op3mode) &&
1556 !mode_is_signed(op3mode) &&
1559 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1565 * verify a Sync node
1567 static int verify_node_Sync(const ir_node *n)
1570 ir_mode *mymode = get_irn_mode(n);
1572 /* Sync: BB x M^n --> M */
1573 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1574 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1576 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1581 * verify a Confirm node
1583 static int verify_node_Confirm(const ir_node *n)
1585 ir_mode *mymode = get_irn_mode(n);
1586 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1587 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1590 /* Confirm: BB x T x T --> T */
1591 op1mode == mymode &&
1594 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1602 static int verify_node_Mux(const ir_node *n)
1604 ir_mode *mymode = get_irn_mode(n);
1605 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1606 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1607 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1610 /* Mux: BB x b x datab x datab --> datab */
1611 op1mode == mode_b &&
1612 op2mode == mymode &&
1613 op3mode == mymode &&
1614 mode_is_datab(mymode),
1621 * verify a CopyB node
1623 static int verify_node_CopyB(const ir_node *n)
1625 ir_graph *irg = get_irn_irg(n);
1626 ir_mode *mymode = get_irn_mode(n);
1627 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1628 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1629 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1630 ir_type *t = get_CopyB_type(n);
1632 /* CopyB: BB x M x ref x ref --> M x X */
1633 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1634 if (get_irg_phase_state(irg) != phase_backend) {
1635 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1640 is_compound_type(t) || is_Array_type(t),
1641 "CopyB node should copy compound types only", 0 );
1643 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1644 This should happen RARELY, as CopyB COPIES MEMORY */
1645 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1650 * verify a Bound node
1652 static int verify_node_Bound(const ir_node *n)
1654 ir_mode *mymode = get_irn_mode(n);
1655 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1656 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1657 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1658 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1660 /* Bound: BB x M x int x int x int --> M x X */
1663 op1mode == mode_M &&
1664 op2mode == op3mode &&
1665 op3mode == op4mode &&
1666 mode_is_int(op3mode),
1673 * For each usage of a node, it is checked, if the block of the
1674 * node dominates the block of the usage (for phis: the predecessor
1675 * block of the phi for the corresponding edge).
1677 * @return non-zero on success, 0 on dominance error
1679 static int check_dominance_for_node(const ir_node *use)
1681 /* This won't work for blocks and the end node */
1682 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1684 ir_node *bl = get_nodes_block(use);
1686 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1687 ir_node *def = get_irn_n(use, i);
1688 ir_node *def_bl = get_nodes_block(def);
1689 ir_node *use_bl = bl;
1692 /* we have no dominance relation for unreachable blocks, so we can't
1693 * check the dominance property there */
1694 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1700 use_bl = get_Block_cfgpred_block(bl, i);
1703 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1706 irg = get_irn_irg(use);
1708 block_dominates(def_bl, use_bl),
1709 "the definition of a value used violates the dominance property", 0,
1711 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1712 irg, def_bl, def, use_bl, use, i
1720 /* Tests the modes of n and its predecessors. */
1721 int irn_verify_irg(const ir_node *n, ir_graph *irg)
1725 if (!get_node_verification_mode())
1729 * do NOT check placement in interprocedural view, as we don't always
1730 * know the "right" graph ...
1734 /* this is an expensive check for large graphs (it has a quadratic
1735 * runtime but with a small constant); so do NOT run it in release mode
1738 node_is_in_irgs_storage(irg, n),
1739 "Node is not stored on proper IR graph!", 0,
1740 show_node_on_graph(irg, n);
1743 assert(get_irn_irg(n) == irg);
1745 unsigned idx = get_irn_idx(n);
1746 ir_node *node_from_map = get_idx_irn(irg, idx);
1747 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1748 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map);
1754 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1755 op_pin_state state = get_irn_pinned(n);
1757 state == op_pin_state_floats ||
1758 state == op_pin_state_pinned,
1759 "invalid pin state", 0,
1760 ir_printf("node %+F", n);
1762 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1763 && is_irg_state(irg, IR_GRAPH_STATE_NO_BADS)) {
1764 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1765 "block input is not a block", 0,
1766 ir_printf("node %+F", n);
1770 if (op->ops.verify_node)
1771 return op->ops.verify_node(n);
1777 int irn_verify(const ir_node *n)
1779 #ifdef DEBUG_libfirm
1780 return irn_verify_irg(n, get_irn_irg(n));
1787 /*-----------------------------------------------------------------*/
1788 /* Verify the whole graph. */
1789 /*-----------------------------------------------------------------*/
1791 #ifdef DEBUG_libfirm
1793 * Walker to check every node
1795 static void verify_wrap(ir_node *node, void *env)
1797 int *res = (int*)env;
1798 *res = irn_verify_irg(node, get_irn_irg(node));
1802 * Walker to check every node including SSA property.
1803 * Only called if dominance info is available.
1805 static void verify_wrap_ssa(ir_node *node, void *env)
1807 int *res = (int*)env;
1809 *res = irn_verify_irg(node, get_irn_irg(node));
1811 *res = check_dominance_for_node(node);
1815 #endif /* DEBUG_libfirm */
1817 typedef struct check_cfg_env_t {
1818 pmap *branch_nodes; /**< map blocks to their branching nodes,
1819 map mode_X nodes to the blocks they branch to */
1821 ir_nodeset_t reachable_blocks;
1822 ir_nodeset_t kept_nodes;
1823 ir_nodeset_t true_projs;
1824 ir_nodeset_t false_projs;
1827 static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
1833 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1834 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1835 ir_printf("block %+F\n", block);
1838 n_cfgpreds = get_Block_n_cfgpreds(block);
1839 branch_nodes = env->branch_nodes;
1840 for (i = 0; i < n_cfgpreds; ++i) {
1841 /* check that each mode_X node is only connected
1843 ir_node *branch = get_Block_cfgpred(block, i);
1844 ir_node *former_dest;
1845 ir_node *former_branch;
1846 ir_node *branch_proj;
1847 ir_node *branch_block;
1848 branch = skip_Tuple(branch);
1851 former_dest = pmap_get(branch_nodes, branch);
1852 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1853 "Multiple users on mode_X node", 0,
1854 ir_printf("node %+F\n", branch);
1856 pmap_insert(branch_nodes, branch, (void*)block);
1858 /* check that there's only 1 branching instruction in each block */
1859 branch_block = get_nodes_block(branch);
1860 branch_proj = branch;
1861 if (is_Proj(branch)) {
1862 branch = skip_Proj(branch);
1864 former_branch = pmap_get(branch_nodes, branch_block);
1866 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1867 "Multiple branching nodes in a block", 0,
1868 ir_printf("nodes %+F,%+F in block %+F\n",
1869 branch, former_branch, branch_block);
1871 pmap_insert(branch_nodes, branch_block, branch);
1873 if (is_Cond(branch)) {
1874 long pn = get_Proj_proj(branch_proj);
1875 if (get_irn_mode(get_Cond_selector(branch)) == mode_b) {
1876 if (pn == pn_Cond_true)
1877 ir_nodeset_insert(&env->true_projs, branch);
1878 if (pn == pn_Cond_false)
1879 ir_nodeset_insert(&env->false_projs, branch);
1881 long default_pn = get_Cond_default_proj(branch);
1882 if (pn == default_pn)
1883 ir_nodeset_insert(&env->true_projs, branch);
1891 static void check_cfg_walk_func(ir_node *node, void *data)
1893 check_cfg_env_t *env = (check_cfg_env_t*)data;
1894 if (!is_Block(node))
1896 env->res &= check_block_cfg(node, env);
1899 static int verify_block_branch(const ir_node *block, check_cfg_env_t *env)
1901 ir_node *branch = pmap_get(env->branch_nodes, block);
1902 ASSERT_AND_RET_DBG(branch != NULL
1903 || ir_nodeset_contains(&env->kept_nodes, block)
1904 || block == get_irg_end_block(get_irn_irg(block)),
1905 "block contains no cfop", 0,
1906 ir_printf("block %+F\n", block);
1911 static int verify_cond_projs(const ir_node *cond, check_cfg_env_t *env)
1913 if (get_irn_mode(get_Cond_selector(cond)) == mode_b) {
1914 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1915 "Cond node lacks true proj", 0,
1916 ir_printf("Cond %+F\n", cond);
1918 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1919 "Cond node lacks false proj", 0,
1920 ir_printf("Cond %+F\n", cond);
1923 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1924 "Cond node lacks default Proj", 0,
1925 ir_printf("Cond %+F\n", cond);
1931 static void assert_branch(ir_node *node, void *data)
1933 check_cfg_env_t *env = (check_cfg_env_t*)data;
1934 if (is_Block(node)) {
1935 env->res &= verify_block_branch(node, env);
1936 } else if (is_Cond(node)) {
1937 env->res &= verify_cond_projs(node, env);
1941 static void collect_reachable_blocks(ir_node *block, void *data)
1943 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1944 ir_nodeset_insert(reachable_blocks, block);
1948 * Checks CFG well-formedness
1950 static int check_cfg(ir_graph *irg)
1952 check_cfg_env_t env;
1953 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1955 ir_nodeset_init(&env.reachable_blocks);
1956 ir_nodeset_init(&env.true_projs);
1957 ir_nodeset_init(&env.false_projs);
1959 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1960 &env.reachable_blocks);
1962 /* note that we do not use irg_walk_block because it will miss these
1963 * invalid blocks without a jump instruction which we want to detect
1965 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1967 ir_nodeset_init(&env.kept_nodes);
1969 ir_node *end = get_irg_end(irg);
1970 int arity = get_irn_arity(end);
1972 for (i = 0; i < arity; ++i) {
1973 ir_node *n = get_irn_n(end, i);
1974 ir_nodeset_insert(&env.kept_nodes, n);
1977 irg_walk_graph(irg, assert_branch, NULL, &env);
1979 ir_nodeset_destroy(&env.false_projs);
1980 ir_nodeset_destroy(&env.true_projs);
1981 ir_nodeset_destroy(&env.kept_nodes);
1982 ir_nodeset_destroy(&env.reachable_blocks);
1983 pmap_destroy(env.branch_nodes);
1988 * Calls irn_verify for each node in irg.
1989 * Graph must be in state "op_pin_state_pinned".
1990 * If dominance info is available, check the SSA property.
1992 int irg_verify(ir_graph *irg, unsigned flags)
1995 #ifdef DEBUG_libfirm
1996 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1999 last_irg_error = NULL;
2002 if (pinned && !check_cfg(irg))
2005 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
2010 pinned && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE)
2011 ? verify_wrap_ssa : verify_wrap,
2016 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2017 ir_entity *ent = get_irg_entity(irg);
2020 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2022 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2028 #endif /* DEBUG_libfirm */
2033 typedef struct pass_t {
2034 ir_graph_pass_t pass;
2039 * Wrapper to irg_verify to be run as an ir_graph pass.
2041 static int irg_verify_wrapper(ir_graph *irg, void *context)
2043 pass_t *pass = (pass_t*)context;
2044 irg_verify(irg, pass->flags);
2045 /* do NOT rerun the pass if verify is ok :-) */
2049 /* Creates an ir_graph pass for irg_verify(). */
2050 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2052 pass_t *pass = XMALLOCZ(pass_t);
2054 def_graph_pass_constructor(
2055 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2057 /* neither dump for verify */
2058 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2059 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2061 pass->flags = flags;
2065 /* create a verify pass */
2066 int irn_verify_irg_dump(const ir_node *n, ir_graph *irg,
2067 const char **bad_string)
2070 firm_verification_t old = get_node_verification_mode();
2072 firm_verify_failure_msg = NULL;
2073 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2074 res = irn_verify_irg(n, irg);
2075 if (res && is_irg_state(irg, IR_GRAPH_STATE_CONSISTENT_DOMINANCE) &&
2076 get_irg_pinned(irg) == op_pin_state_pinned)
2077 res = check_dominance_for_node(n);
2078 do_node_verification(old);
2079 *bad_string = firm_verify_failure_msg;
2084 typedef struct verify_bad_env_t {
2090 * Pre-Walker: check Bad predecessors of node.
2092 static void check_bads(ir_node *node, void *env)
2094 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2095 int i, arity = get_irn_arity(node);
2096 ir_graph *irg = get_irn_irg(node);
2098 if (is_Block(node)) {
2099 if ((venv->flags & BAD_CF) == 0) {
2101 /* check for Bad Block predecessor */
2102 for (i = 0; i < arity; ++i) {
2103 ir_node *pred = get_irn_n(node, i);
2106 venv->res |= BAD_CF;
2108 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2109 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2111 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2112 dump_ir_graph(irg, "assert");
2113 assert(0 && "Bad CF detected");
2119 if ((venv->flags & BAD_BLOCK) == 0) {
2121 /* check for Bad Block */
2122 if (is_Bad(get_nodes_block(node))) {
2123 venv->res |= BAD_BLOCK;
2125 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2126 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2128 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2129 dump_ir_graph(irg, "assert");
2130 assert(0 && "Bad CF detected");
2135 if ((venv->flags & TUPLE) == 0) {
2136 if (is_Tuple(node)) {
2139 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2140 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2142 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2143 dump_ir_graph(irg, "assert");
2144 assert(0 && "Tuple detected");
2149 for (i = 0; i < arity; ++i) {
2150 ir_node *pred = get_irn_n(node, i);
2153 /* check for Phi with Bad inputs */
2154 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2155 if (venv->flags & BAD_CF)
2158 venv->res |= BAD_CF;
2160 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2161 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2163 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2164 dump_ir_graph(irg, "assert");
2165 assert(0 && "Bad CF detected");
2170 /* Bad node input */
2171 if ((venv->flags & BAD_DF) == 0) {
2172 venv->res |= BAD_DF;
2174 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2175 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2177 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2178 dump_ir_graph(irg, "assert");
2179 assert(0 && "Bad NON-CF detected");
2188 * verify occurrence of bad nodes
2190 int irg_verify_bads(ir_graph *irg, int flags)
2192 verify_bad_env_t env;
2197 irg_walk_graph(irg, check_bads, NULL, &env);
2203 * set the default verify operation
2205 void firm_set_default_verifier(unsigned code, ir_op_ops *ops)
2209 ops->verify_node = verify_node_##a; \
2261 ops->verify_proj_node = verify_node_Proj_##a; \