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(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(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(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(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(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(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(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(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(ir_graph *irg, 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(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(ir_graph *irg, ir_node *n, ir_type *mt, int i)
259 ir_entity *ent = get_irg_entity(irg);
261 show_entity_failure(n);
262 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
263 get_irn_node_nr(n), get_entity_name(ent),
264 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
265 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
270 * Show return number of results
272 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
274 ir_entity *ent = get_irg_entity(irg);
276 show_entity_failure(n);
277 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
278 get_irn_node_nr(n), get_entity_name(ent),
279 (unsigned long) get_Return_n_ress(n),
280 (unsigned long) get_method_n_ress(mt));
286 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
289 show_entity_failure(phi);
290 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
291 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
292 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
298 static void show_phi_inputs(ir_node *phi, ir_node *block)
300 show_entity_failure(phi);
301 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
302 get_irn_node_nr(phi), get_irn_arity(phi),
303 get_irn_node_nr(block), get_irn_arity(block));
306 #endif /* #ifndef NDEBUG */
309 * If the address is Sel or SymConst, return the entity.
311 * @param ptr the node representing the address
313 static ir_entity *get_ptr_entity(ir_node *ptr)
316 return get_Sel_entity(ptr);
317 } else if (is_SymConst_addr_ent(ptr)) {
318 return get_SymConst_entity(ptr);
324 * verify a Proj(Start) node
326 static int verify_node_Proj_Start(ir_node *n, ir_node *p)
328 ir_mode *mode = get_irn_mode(p);
329 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(ir_node *pred, ir_node *p)
350 ir_mode *mode = get_irn_mode(p);
351 long proj = get_Proj_proj(p);
355 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
356 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) /* switch */
358 "wrong Proj from Cond", 0,
359 show_proj_failure(p);
365 * verify a Proj(Raise) node
367 static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
369 ir_mode *mode = get_irn_mode(p);
370 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(ir_node *n, ir_node *p)
386 ir_mode *mode = get_irn_mode(p);
387 long proj = get_Proj_proj(p);
392 (proj == pn_InstOf_M && mode == mode_M) ||
393 (proj == pn_InstOf_X_regular && mode == mode_X) ||
394 (proj == pn_InstOf_X_except && mode == mode_X) ||
395 (proj == pn_InstOf_res && mode_is_reference(mode))
397 "wrong Proj from InstOf", 0,
398 show_proj_failure(p);
404 * verify a Proj(Call) node
406 static int verify_node_Proj_Call(ir_node *n, ir_node *p)
408 ir_mode *mode = get_irn_mode(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(ir_node *n, ir_node *p)
438 ir_mode *mode = get_irn_mode(p);
439 long proj = get_Proj_proj(p);
443 (proj == pn_Div_M && mode == mode_M) ||
444 (proj == pn_Div_X_regular && mode == mode_X) ||
445 (proj == pn_Div_X_except && mode == mode_X) ||
446 (proj == pn_Div_res && mode_is_data(mode) && mode == get_Div_resmode(n))
448 "wrong Proj from Div", 0,
449 show_proj_failure(p);
451 if (proj == pn_Div_X_regular)
453 get_irn_pinned(n) == op_pin_state_pinned,
454 "Regular Proj from unpinned Div", 0);
455 else if (proj == pn_Div_X_except)
457 get_irn_pinned(n) == op_pin_state_pinned,
458 "Exception Proj from unpinned Div", 0);
459 else if (proj == pn_Div_M)
461 get_irn_pinned(n) == op_pin_state_pinned,
462 "Memory Proj from unpinned Div", 0);
467 * verify a Proj(Mod) node
469 static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
471 ir_mode *mode = get_irn_mode(p);
472 long proj = get_Proj_proj(p);
476 (proj == pn_Mod_M && mode == mode_M) ||
477 (proj == pn_Mod_X_regular && mode == mode_X) ||
478 (proj == pn_Mod_X_except && mode == mode_X) ||
479 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
481 "wrong Proj from Mod", 0,
482 show_proj_failure(p);
484 if (proj == pn_Mod_X_regular)
486 get_irn_pinned(n) == op_pin_state_pinned,
487 "Regular Proj from unpinned Mod", 0);
488 else if (proj == pn_Mod_X_except)
490 get_irn_pinned(n) == op_pin_state_pinned,
491 "Exception Proj from unpinned Mod", 0);
492 else if (proj == pn_Mod_M)
494 get_irn_pinned(n) == op_pin_state_pinned,
495 "Memory Proj from unpinned Div", 0);
500 * verify a Proj(Load) node
502 static int verify_node_Proj_Load(ir_node *n, ir_node *p)
504 ir_mode *mode = get_irn_mode(p);
505 long proj = get_Proj_proj(p);
507 if (proj == pn_Load_res) {
508 ir_node *ptr = get_Load_ptr(n);
509 ir_entity *ent = get_ptr_entity(ptr);
510 ir_graph *irg = get_irn_irg(n);
512 if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
513 /* do NOT check this for lowered phases, see comment on Store */
515 (mode == get_type_mode(get_entity_type(ent))),
516 "wrong data Proj from Load, entity type_mode failed", 0,
517 show_proj_failure_ent(p, ent);
522 mode_is_data(mode) && mode == get_Load_mode(n),
523 "wrong data Proj from Load", 0,
524 show_proj_failure(p);
531 (proj == pn_Load_M && mode == mode_M) ||
532 (proj == pn_Load_X_regular && mode == mode_X) ||
533 (proj == pn_Load_X_except && mode == mode_X)
535 "wrong Proj from Load", 0,
536 show_proj_failure(p);
539 if (proj == pn_Load_X_regular) {
541 get_irn_pinned(n) == op_pin_state_pinned,
542 "Regular Proj from unpinned Load", 0);
543 } else if (proj == pn_Load_X_except) {
545 get_irn_pinned(n) == op_pin_state_pinned,
546 "Exception Proj from unpinned Load", 0);
552 * verify a Proj(Store) node
554 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
556 ir_mode *mode = get_irn_mode(p);
557 long proj = get_Proj_proj(p);
561 (proj == pn_Store_M && mode == mode_M) ||
562 (proj == pn_Store_X_regular && mode == mode_X) ||
563 (proj == pn_Store_X_except && mode == mode_X)
565 "wrong Proj from Store", 0,
566 show_proj_failure(p);
568 if (proj == pn_Store_X_regular) {
570 get_irn_pinned(n) == op_pin_state_pinned,
571 "Regular Proj from unpinned Store", 0);
572 } else if (proj == pn_Store_X_except) {
574 get_irn_pinned(n) == op_pin_state_pinned,
575 "Exception Proj from unpinned Store", 0);
581 * verify a Proj(Alloc) node
583 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
585 ir_mode *mode = get_irn_mode(p);
586 long proj = get_Proj_proj(p);
591 (proj == pn_Alloc_M && mode == mode_M) ||
592 (proj == pn_Alloc_X_regular && mode == mode_X) ||
593 (proj == pn_Alloc_X_except && mode == mode_X) ||
594 (proj == pn_Alloc_res && mode_is_reference(mode))
596 "wrong Proj from Alloc", 0,
597 show_proj_failure(p);
603 * verify a Proj(Proj) node
605 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
607 ir_mode *mode = get_irn_mode(p);
608 long proj = get_Proj_proj(p);
609 long nr = get_Proj_proj(pred);
610 ir_type *mt; /* A method type */
612 pred = skip_Id(get_Proj_pred(pred));
613 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
615 switch (get_irn_opcode(pred)) {
617 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
619 if (nr == pn_Start_T_args) {
621 (proj >= 0 && mode_is_datab(mode)),
622 "wrong Proj from Proj from Start", 0);
624 (proj < (int)get_method_n_params(mt)),
625 "More Projs for args than args in type", 0
627 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
628 /* value argument */ break;
630 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
632 (mode == get_type_mode(get_method_param_type(mt, proj))),
633 "Mode of Proj from Start doesn't match mode of param type.", 0,
634 show_proj_mode_failure(p, get_method_param_type(mt, proj));
643 (proj >= 0 && mode_is_datab(mode)),
644 "wrong Proj from Proj from Call", 0);
645 mt = get_Call_type(pred);
646 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
647 "wrong call type on call", 0);
649 (proj < (int)get_method_n_ress(mt)),
650 "More Projs for results than results in type.", 0);
651 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
652 /* value result */ break;
655 (mode == get_type_mode(get_method_res_type(mt, proj))),
656 "Mode of Proj from Call doesn't match mode of result type.", 0);
665 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
672 * verify a Proj(Tuple) node
674 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
683 * verify a Proj(CopyB) node
685 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
687 ir_mode *mode = get_irn_mode(p);
688 long proj = get_Proj_proj(p);
692 (proj == pn_CopyB_M && mode == mode_M) ||
693 (proj == pn_CopyB_X_regular && mode == mode_X) ||
694 (proj == pn_CopyB_X_except && mode == mode_X)
696 "wrong Proj from CopyB", 0,
697 show_proj_failure(p);
699 if (proj == pn_CopyB_X_regular)
701 get_irn_pinned(n) == op_pin_state_pinned,
702 "Regular Proj from unpinned CopyB", 0);
703 else if (proj == pn_CopyB_X_except)
705 get_irn_pinned(n) == op_pin_state_pinned,
706 "Exception Proj from unpinned CopyB", 0);
711 * verify a Proj(Bound) node
713 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
715 ir_mode *mode = get_irn_mode(p);
716 long proj = get_Proj_proj(p);
720 (proj == pn_Bound_M && mode == mode_M) ||
721 (proj == pn_Bound_X_regular && mode == mode_X) ||
722 (proj == pn_Bound_X_except && mode == mode_X) ||
723 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
725 "wrong Proj from Bound", 0,
726 show_proj_failure(p);
734 static int verify_node_Proj(ir_node *p, ir_graph *irg)
739 pred = skip_Id(get_Proj_pred(p));
740 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
741 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);
743 op = get_irn_op(pred);
745 if (op->ops.verify_proj_node)
746 return op->ops.verify_proj_node(pred, p);
753 * verify a Block node
755 static int verify_node_Block(ir_node *n, ir_graph *irg)
759 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
760 ir_node *pred = get_Block_cfgpred(n, i);
761 ir_node *skipped_pred = skip_Proj(skip_Tuple(pred));
762 ASSERT_AND_RET(get_irn_mode(pred) == mode_X,
763 "Block node must have a mode_X predecessor", 0);
764 ASSERT_AND_RET(is_cfop(skipped_pred) || is_Bad(skipped_pred), "Block predecessor must be a cfop (or Bad)", 0);
767 if (n == get_irg_start_block(irg)) {
768 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
771 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend) {
772 /* End block may only have Return, Raise or fragile ops as preds. */
773 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
774 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
775 if (is_Proj(pred) || is_Tuple(pred))
776 break; /* We can not test properly. How many tuples are there? */
784 "End Block node", 0);
787 /* irg attr must == graph we are in. */
788 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
793 * verify a Start node
795 static int verify_node_Start(ir_node *n, ir_graph *irg)
797 ir_mode *mymode = get_irn_mode(n);
801 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
802 mymode == mode_T, "Start node", 0
810 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
812 ir_mode *mymode = get_irn_mode(n);
817 mymode == mode_X, "Jmp node", 0
823 * verify an IJmp node
825 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
827 ir_mode *mymode = get_irn_mode(n);
828 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
832 /* IJmp: BB x ref --> X */
833 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
841 static int verify_node_Cond(ir_node *n, ir_graph *irg)
843 ir_mode *mymode = get_irn_mode(n);
844 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
848 /* Cond: BB x b --> X x X */
849 (op1mode == mode_b ||
850 /* Cond: BB x int --> X^n */
851 mode_is_int(op1mode) ), "Cond node", 0
853 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
859 * verify a Return node
861 static int verify_node_Return(ir_node *n, ir_graph *irg)
864 ir_mode *mymode = get_irn_mode(n);
865 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
868 /* Return: BB x M x data1 x ... x datan --> X */
870 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
872 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
873 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
875 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
876 /* Compare returned results with result types of method type */
877 mt = get_entity_type(get_irg_entity(irg));
878 ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
879 "Number of results for Return doesn't match number of results in type.", 0,
880 show_return_nres(irg, n, mt););
881 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
882 ir_type *res_type = get_method_res_type(mt, i);
884 if (get_irg_phase_state(irg) != phase_backend) {
885 if (is_atomic_type(res_type)) {
887 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
888 "Mode of result for Return doesn't match mode of result type.", 0,
889 show_return_modes(irg, n, mt, i);
893 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
894 "Mode of result for Return doesn't match mode of result type.", 0,
895 show_return_modes(irg, n, mt, i);
904 * verify a Raise node
906 static int verify_node_Raise(ir_node *n, ir_graph *irg)
908 ir_mode *mymode = get_irn_mode(n);
909 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
910 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
914 /* Sel: BB x M x ref --> X x M */
915 op1mode == mode_M && mode_is_reference(op2mode) &&
916 mymode == mode_T, "Raise node", 0
922 * verify a Const node
924 static int verify_node_Const(ir_node *n, ir_graph *irg)
926 ir_mode *mymode = get_irn_mode(n);
930 /* Const: BB --> data */
931 (mode_is_data(mymode) ||
932 mymode == mode_b) /* we want boolean constants for static evaluation */
933 ,"Const node", 0 /* of Cmp. */
936 /* the modes of the constant and teh tarval must match */
937 mymode == get_tarval_mode(get_Const_tarval(n)),
938 "Const node, tarval and node mode mismatch", 0
944 * verify a SymConst node
946 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
948 ir_mode *mymode = get_irn_mode(n);
952 /* SymConst: BB --> int*/
953 (mode_is_int(mymode) ||
954 /* SymConst: BB --> ref */
955 mode_is_reference(mymode))
956 ,"SymConst node", 0);
963 static int verify_node_Sel(ir_node *n, ir_graph *irg)
966 ir_mode *mymode = get_irn_mode(n);
967 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
968 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
973 /* Sel: BB x M x ref x int^n --> ref */
974 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
975 "Sel node", 0, show_node_failure(n)
978 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
979 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
981 ent = get_Sel_entity(n);
982 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
987 * verify an InstOf node
989 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
991 ir_mode *mymode = get_irn_mode(n);
992 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
995 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
996 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1001 * Check if the pinned state is right.
1003 static int verify_right_pinned(ir_node *n)
1007 if (get_irn_pinned(n) == op_pin_state_pinned)
1009 mem = get_Call_mem(n);
1011 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1012 if (is_NoMem(mem) || is_Pin(mem))
1018 * verify a Call node
1020 static int verify_node_Call(ir_node *n, ir_graph *irg)
1022 ir_mode *mymode = get_irn_mode(n);
1023 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1024 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1030 /* Call: BB x M x ref x data1 x ... x datan
1031 --> M x datan+1 x ... x data n+m */
1032 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1034 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1035 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1037 mt = get_Call_type(n);
1038 if (get_unknown_type() == mt) {
1042 n_params = get_Call_n_params(n);
1043 for (i = 0; i < n_params; ++i) {
1044 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1047 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1048 /* Compare arguments of node with those of type */
1050 if (get_method_variadicity(mt) == variadicity_variadic) {
1052 get_Call_n_params(n) >= get_method_n_params(mt),
1053 "Number of args for Call doesn't match number of args in variadic type.",
1055 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1056 n, get_Call_n_params(n), get_method_n_params(mt));
1060 get_Call_n_params(n) == get_method_n_params(mt),
1061 "Number of args for Call doesn't match number of args in non variadic type.",
1063 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1064 n, get_Call_n_params(n), get_method_n_params(mt));
1068 for (i = 0; i < get_method_n_params(mt); i++) {
1069 ir_type *t = get_method_param_type(mt, i);
1071 if (get_irg_phase_state(irg) != phase_backend) {
1072 if (is_atomic_type(t)) {
1074 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1075 "Mode of arg for Call doesn't match mode of arg type.", 0,
1076 show_call_param(n, mt);
1079 /* call with a compound type, mode must be reference */
1081 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1082 "Mode of arg for Call doesn't match mode of arg type.", 0,
1083 show_call_param(n, mt);
1090 if (Call_has_callees(n)) {
1091 for (i = 0; i < get_Call_n_callees(n); i++) {
1092 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1100 * verify an Add node
1102 static int verify_node_Add(ir_node *n, ir_graph *irg)
1104 ir_mode *mymode = get_irn_mode(n);
1105 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1106 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1111 /* common Add: BB x numP x numP --> numP */
1112 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1113 /* Pointer Add: BB x ref x int --> ref */
1114 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1115 /* Pointer Add: BB x int x ref --> ref */
1116 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1119 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1120 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1121 "/* Pointer Add: BB x int x ref --> ref */");
1129 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1131 ir_mode *mymode = get_irn_mode(n);
1132 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1133 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1138 /* common Sub: BB x numP x numP --> numP */
1139 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1140 /* Pointer Sub: BB x ref x int --> ref */
1141 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1142 /* Pointer Sub: BB x ref x ref --> int */
1143 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1146 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1147 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1148 "/* Pointer Sub: BB x ref x ref --> int */" );
1154 * verify a Minus node
1156 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1158 ir_mode *mymode = get_irn_mode(n);
1159 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1163 /* Minus: BB x num --> num */
1164 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1165 show_unop_failure(n , "/* Minus: BB x num --> num */");
1173 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1175 ir_mode *mymode = get_irn_mode(n);
1176 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1177 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1182 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1183 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1184 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1185 /* Mul: BB x float x float --> float */
1186 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1189 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1190 "/* Mul: BB x float x float --> float */");
1196 * verify a Mulh node
1198 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1200 ir_mode *mymode = get_irn_mode(n);
1201 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1202 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1207 /* Mulh: BB x int x int --> int */
1208 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1211 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1219 static int verify_node_Div(ir_node *n, ir_graph *irg)
1221 ir_mode *mymode = get_irn_mode(n);
1222 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1223 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1224 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1228 /* Div: BB x M x data x data --> M x X x data */
1229 op1mode == mode_M &&
1230 op2mode == op3mode &&
1231 mode_is_data(op2mode) &&
1241 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1243 ir_mode *mymode = get_irn_mode(n);
1244 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1245 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1246 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1250 /* Mod: BB x M x int x int --> M x X x int */
1251 op1mode == mode_M &&
1252 op2mode == op3mode &&
1253 mode_is_int(op2mode) &&
1261 * verify a logical And, Or, Eor node
1263 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1265 ir_mode *mymode = get_irn_mode(n);
1266 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1267 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 #define verify_node_And verify_node_Logic
1282 #define verify_node_Or verify_node_Logic
1283 #define verify_node_Eor verify_node_Logic
1288 static int verify_node_Not(ir_node *n, ir_graph *irg)
1290 ir_mode *mymode = get_irn_mode(n);
1291 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1295 /* Not: BB x int --> int */
1296 (mode_is_int(mymode) || mymode == mode_b) &&
1299 show_unop_failure(n, "/* Not: BB x int --> int */");
1307 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1309 ir_mode *mymode = get_irn_mode(n);
1310 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1311 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1315 /* Cmp: BB x datab x datab --> b16 */
1316 mode_is_datab(op1mode) &&
1317 op2mode == op1mode &&
1320 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1326 * verify a Shift node
1328 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1330 ir_mode *mymode = get_irn_mode(n);
1331 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1332 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1336 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1337 mode_is_int(op1mode) &&
1338 mode_is_int(op2mode) &&
1339 !mode_is_signed(op2mode) &&
1341 "Shl, Shr or Shrs node", 0,
1342 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1347 #define verify_node_Shl verify_node_Shift
1348 #define verify_node_Shr verify_node_Shift
1349 #define verify_node_Shrs verify_node_Shift
1352 * verify a Rotl node
1354 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1356 ir_mode *mymode = get_irn_mode(n);
1357 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1358 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1362 /* Rotl: BB x int x int --> int */
1363 mode_is_int(op1mode) &&
1364 mode_is_int(op2mode) &&
1367 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1373 * verify a Conv node
1375 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1377 ir_mode *mymode = get_irn_mode(n);
1378 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1382 is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
1383 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1385 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1391 * verify a Cast node
1393 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1395 ir_mode *mymode = get_irn_mode(n);
1396 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1400 /* Conv: BB x datab1 --> datab2 */
1401 mode_is_data(op1mode) && op1mode == mymode,
1403 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1411 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1413 ir_mode *mymode = get_irn_mode(n);
1414 ir_node *block = get_nodes_block(n);
1418 /* a Phi node MUST have the same number of inputs as its block
1419 * Exception is a phi with 0 inputs which is used when (re)constructing the
1421 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1423 get_irn_arity(n) == get_irn_arity(block),
1424 "wrong number of inputs in Phi node", 0,
1425 show_phi_inputs(n, block);
1429 /* Phi: BB x dataM^n --> dataM */
1430 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1431 ir_node *pred = get_Phi_pred(n, i);
1432 ASSERT_AND_RET_DBG(get_irn_mode(pred) == mymode,
1433 "Phi node", 0, show_phi_failure(n, pred, i);
1436 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1439 if (mymode == mode_M) {
1440 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1442 ir_node *pred_i = get_Phi_pred(n, i);
1444 for (j = i - 1; j >= 0; --j) {
1445 ir_node *pred_j = get_Phi_pred(n, j);
1447 /* currently this checks fails for blocks with exception
1448 outputs (and these are NOT basic blocks). So it is disabled yet. */
1450 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1451 "At least two different PhiM predecessors are in the same block",
1453 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1463 * verify a Load node
1465 static int verify_node_Load(ir_node *n, ir_graph *irg)
1467 ir_mode *mymode = get_irn_mode(n);
1468 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1469 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1471 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1472 if (get_irg_phase_state(irg) != phase_backend) {
1473 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1475 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1478 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1479 * (Proj (Proj))) sometimes ...
1481 * interprete.c:ai_eval seems to assume that this happens, too
1483 * obset.c:get_abstval_any can't deal with this if the load has
1487 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1488 assert ((NULL != ent) || (mymode != mode_T));
1496 * verify a Store node
1498 static int verify_node_Store(ir_node *n, ir_graph *irg)
1502 ir_mode *mymode = get_irn_mode(n);
1503 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1504 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1505 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1507 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1508 if (get_irg_phase_state(irg) != phase_backend) {
1509 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1511 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1513 target = get_ptr_entity(get_Store_ptr(n));
1514 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1516 * If lowered code, any Sels that add 0 may be removed, causing
1517 * an direct access to entities of array or compound type.
1518 * Prevent this by checking the phase.
1520 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1528 * verify an Alloc node
1530 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1532 ir_mode *mymode = get_irn_mode(n);
1533 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1534 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1538 /* Alloc: BB x M x int_u --> M x X x ref */
1539 op1mode == mode_M &&
1540 mode_is_int(op2mode) &&
1541 !mode_is_signed(op2mode) &&
1544 show_node_failure(n);
1550 * verify a Free node
1552 static int verify_node_Free(ir_node *n, ir_graph *irg)
1554 ir_mode *mymode = get_irn_mode(n);
1555 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1556 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1557 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1561 /* Free: BB x M x ref x int_u --> M */
1562 op1mode == mode_M && mode_is_reference(op2mode) &&
1563 mode_is_int(op3mode) &&
1564 !mode_is_signed(op3mode) &&
1567 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1573 * verify a Sync node
1575 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1578 ir_mode *mymode = get_irn_mode(n);
1581 /* Sync: BB x M^n --> M */
1582 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1583 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1585 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1590 * verify a Confirm node
1592 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1594 ir_mode *mymode = get_irn_mode(n);
1595 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1596 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1600 /* Confirm: BB x T x T --> T */
1601 op1mode == mymode &&
1604 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1612 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1614 ir_mode *mymode = get_irn_mode(n);
1615 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1616 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1617 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1621 /* Mux: BB x b x datab x datab --> datab */
1622 op1mode == mode_b &&
1623 op2mode == mymode &&
1624 op3mode == mymode &&
1625 mode_is_datab(mymode),
1632 * verify a CopyB node
1634 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1636 ir_mode *mymode = get_irn_mode(n);
1637 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1638 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1639 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1640 ir_type *t = get_CopyB_type(n);
1642 /* CopyB: BB x M x ref x ref --> M x X */
1643 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1644 if (get_irg_phase_state(irg) != phase_backend) {
1645 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1650 is_compound_type(t) || is_Array_type(t),
1651 "CopyB node should copy compound types only", 0 );
1653 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1654 This should happen RARELY, as CopyB COPIES MEMORY */
1655 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1660 * verify a Bound node
1662 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1664 ir_mode *mymode = get_irn_mode(n);
1665 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1666 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1667 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1668 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1671 /* Bound: BB x M x int x int x int --> M x X */
1674 op1mode == mode_M &&
1675 op2mode == op3mode &&
1676 op3mode == op4mode &&
1677 mode_is_int(op3mode),
1684 * For each usage of a node, it is checked, if the block of the
1685 * node dominates the block of the usage (for phis: the predecessor
1686 * block of the phi for the corresponding edge).
1688 * @return non-zero on success, 0 on dominance error
1690 static int check_dominance_for_node(ir_node *use)
1692 /* This won't work for blocks and the end node */
1693 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1695 ir_node *bl = get_nodes_block(use);
1697 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1698 ir_node *def = get_irn_n(use, i);
1699 ir_node *def_bl = get_nodes_block(def);
1700 ir_node *use_bl = bl;
1703 /* we have no dominance relation for unreachable blocks, so we can't
1704 * check the dominance property there */
1705 if (!is_Block(def_bl) || get_Block_dom_depth(def_bl) == -1)
1711 use_bl = get_Block_cfgpred_block(bl, i);
1714 if (!is_Block(use_bl) || get_Block_dom_depth(use_bl) == -1)
1717 irg = get_irn_irg(use);
1719 block_dominates(def_bl, use_bl),
1720 "the definition of a value used violates the dominance property", 0,
1722 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1723 irg, def_bl, def, use_bl, use, i
1731 /* Tests the modes of n and its predecessors. */
1732 int irn_verify_irg(ir_node *n, ir_graph *irg)
1736 if (!get_node_verification_mode())
1740 * do NOT check placement in interprocedural view, as we don't always
1741 * know the "right" graph ...
1745 /* this is an expensive check for large graphs (it has a quadratic
1746 * runtime but with a small constant); so do NOT run it in release mode
1749 node_is_in_irgs_storage(irg, n),
1750 "Node is not stored on proper IR graph!", 0,
1751 show_node_on_graph(irg, n);
1754 assert(get_irn_irg(n) == irg);
1756 unsigned idx = get_irn_idx(n);
1757 ir_node *node_from_map = get_idx_irn(irg, idx);
1758 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1759 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1764 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1765 op_pin_state state = get_irn_pinned(n);
1767 state == op_pin_state_floats ||
1768 state == op_pin_state_pinned,
1769 "invalid pin state", 0,
1770 ir_printf("node %+F", n));
1771 } else if (!is_Block(n) && is_irn_pinned_in_irg(n)
1772 && !is_irg_state(irg, IR_GRAPH_STATE_BAD_BLOCK)) {
1773 ASSERT_AND_RET_DBG(is_Block(get_nodes_block(n)) || is_Anchor(n),
1774 "block input is not a block", 0,
1775 ir_printf("node %+F", n));
1778 if (op->ops.verify_node)
1779 return op->ops.verify_node(n, irg);
1785 int irn_verify(ir_node *n)
1787 #ifdef DEBUG_libfirm
1788 return irn_verify_irg(n, get_irn_irg(n));
1795 /*-----------------------------------------------------------------*/
1796 /* Verify the whole graph. */
1797 /*-----------------------------------------------------------------*/
1799 #ifdef DEBUG_libfirm
1801 * Walker to check every node
1803 static void verify_wrap(ir_node *node, void *env)
1805 int *res = (int*)env;
1806 *res = irn_verify_irg(node, get_irn_irg(node));
1810 * Walker to check every node including SSA property.
1811 * Only called if dominance info is available.
1813 static void verify_wrap_ssa(ir_node *node, void *env)
1815 int *res = (int*)env;
1817 *res = irn_verify_irg(node, get_irn_irg(node));
1819 *res = check_dominance_for_node(node);
1823 #endif /* DEBUG_libfirm */
1825 typedef struct check_cfg_env_t {
1826 pmap *branch_nodes; /**< map blocks to their branching nodes,
1827 map mode_X nodes to the blocks they branch to */
1829 ir_nodeset_t reachable_blocks;
1830 ir_nodeset_t kept_nodes;
1831 ir_nodeset_t true_projs;
1832 ir_nodeset_t false_projs;
1835 static int check_block_cfg(ir_node *block, check_cfg_env_t *env)
1841 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->reachable_blocks, block),
1842 "Block is not reachable by blockwalker (endless loop with no kept block?)", 0,
1843 ir_printf("block %+F\n", block));
1845 n_cfgpreds = get_Block_n_cfgpreds(block);
1846 branch_nodes = env->branch_nodes;
1847 for (i = 0; i < n_cfgpreds; ++i) {
1848 /* check that each mode_X node is only connected
1850 ir_node *branch = get_Block_cfgpred(block, i);
1851 ir_node *former_dest;
1852 ir_node *former_branch;
1853 ir_node *branch_proj;
1854 ir_node *branch_block;
1855 branch = skip_Tuple(branch);
1858 former_dest = pmap_get(branch_nodes, branch);
1859 ASSERT_AND_RET_DBG(former_dest==NULL || is_unknown_jump(skip_Proj(branch)),
1860 "Multiple users on mode_X node", 0,
1861 ir_printf("node %+F\n", branch));
1862 pmap_insert(branch_nodes, branch, block);
1864 /* check that there's only 1 branching instruction in each block */
1865 branch_block = get_nodes_block(branch);
1866 branch_proj = branch;
1867 if (is_Proj(branch)) {
1868 branch = skip_Proj(branch);
1870 former_branch = pmap_get(branch_nodes, branch_block);
1872 ASSERT_AND_RET_DBG(former_branch == NULL || former_branch == branch,
1873 "Multiple branching nodes in a block", 0,
1874 ir_printf("nodes %+F,%+F in block %+F\n",
1875 branch, former_branch, branch_block));
1876 pmap_insert(branch_nodes, branch_block, branch);
1878 if (is_Cond(branch)) {
1879 long pn = get_Proj_proj(branch_proj);
1880 if (get_irn_mode(get_Cond_selector(branch)) == mode_b) {
1881 if (pn == pn_Cond_true)
1882 ir_nodeset_insert(&env->true_projs, branch);
1883 if (pn == pn_Cond_false)
1884 ir_nodeset_insert(&env->false_projs, branch);
1886 int default_pn = get_Cond_default_proj(branch);
1887 if (pn == default_pn)
1888 ir_nodeset_insert(&env->true_projs, branch);
1896 static void check_cfg_walk_func(ir_node *node, void *data)
1898 check_cfg_env_t *env = (check_cfg_env_t*)data;
1899 if (!is_Block(node))
1901 env->res &= check_block_cfg(node, env);
1904 static int verify_block_branch(ir_node *block, check_cfg_env_t *env)
1906 ir_node *branch = pmap_get(env->branch_nodes, block);
1907 ASSERT_AND_RET_DBG(branch != NULL
1908 || ir_nodeset_contains(&env->kept_nodes, block)
1909 || block == get_irg_end_block(get_irn_irg(block)),
1910 "block contains no cfop", 0,
1911 ir_printf("block %+F\n", block));
1915 static int verify_cond_projs(ir_node *cond, check_cfg_env_t *env)
1917 if (get_irn_mode(get_Cond_selector(cond)) == mode_b) {
1918 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1919 "Cond node lacks true proj", 0,
1920 ir_printf("Cond %+F\n", cond));
1921 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->false_projs, cond),
1922 "Cond node lacks false proj", 0,
1923 ir_printf("Cond %+F\n", cond));
1925 ASSERT_AND_RET_DBG(ir_nodeset_contains(&env->true_projs, cond),
1926 "Cond node lacks default Proj", 0,
1927 ir_printf("Cond %+F\n", cond));
1932 static void assert_branch(ir_node *node, void *data)
1934 check_cfg_env_t *env = (check_cfg_env_t*)data;
1935 if (is_Block(node)) {
1936 env->res &= verify_block_branch(node, env);
1937 } else if (is_Cond(node)) {
1938 env->res &= verify_cond_projs(node, env);
1942 static void collect_reachable_blocks(ir_node *block, void *data)
1944 ir_nodeset_t *reachable_blocks = (ir_nodeset_t*) data;
1945 ir_nodeset_insert(reachable_blocks, block);
1949 * Checks CFG well-formedness
1951 static int check_cfg(ir_graph *irg)
1953 check_cfg_env_t env;
1954 env.branch_nodes = pmap_create(); /**< map blocks to branch nodes */
1956 ir_nodeset_init(&env.reachable_blocks);
1957 ir_nodeset_init(&env.true_projs);
1958 ir_nodeset_init(&env.false_projs);
1960 irg_block_walk_graph(irg, collect_reachable_blocks, NULL,
1961 &env.reachable_blocks);
1963 /* note that we do not use irg_walk_block because it will miss these
1964 * invalid blocks without a jump instruction which we want to detect
1966 irg_walk_graph(irg, check_cfg_walk_func, NULL, &env);
1968 ir_nodeset_init(&env.kept_nodes);
1970 ir_node *end = get_irg_end(irg);
1971 int arity = get_irn_arity(end);
1973 for (i = 0; i < arity; ++i) {
1974 ir_node *n = get_irn_n(end, i);
1975 ir_nodeset_insert(&env.kept_nodes, n);
1978 irg_walk_graph(irg, assert_branch, NULL, &env);
1980 ir_nodeset_destroy(&env.false_projs);
1981 ir_nodeset_destroy(&env.true_projs);
1982 ir_nodeset_destroy(&env.kept_nodes);
1983 ir_nodeset_destroy(&env.reachable_blocks);
1984 pmap_destroy(env.branch_nodes);
1989 * Calls irn_verify for each node in irg.
1990 * Graph must be in state "op_pin_state_pinned".
1991 * If dominance info is available, check the SSA property.
1993 int irg_verify(ir_graph *irg, unsigned flags)
1996 #ifdef DEBUG_libfirm
1997 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
2000 last_irg_error = NULL;
2003 if (pinned && !check_cfg(irg))
2006 if (res == 1 && (flags & VERIFY_ENFORCE_SSA) && pinned)
2011 pinned && get_irg_dom_state(irg) == dom_consistent
2012 ? verify_wrap_ssa : verify_wrap,
2017 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2018 ir_entity *ent = get_irg_entity(irg);
2021 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2023 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2029 #endif /* DEBUG_libfirm */
2034 typedef struct pass_t {
2035 ir_graph_pass_t pass;
2040 * Wrapper to irg_verify to be run as an ir_graph pass.
2042 static int irg_verify_wrapper(ir_graph *irg, void *context)
2044 pass_t *pass = (pass_t*)context;
2045 irg_verify(irg, pass->flags);
2046 /* do NOT rerun the pass if verify is ok :-) */
2050 /* Creates an ir_graph pass for irg_verify(). */
2051 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2053 pass_t *pass = XMALLOCZ(pass_t);
2055 def_graph_pass_constructor(
2056 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2058 /* neither dump for verify */
2059 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2060 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2062 pass->flags = flags;
2066 /* create a verify pass */
2067 int irn_verify_irg_dump(ir_node *n, ir_graph *irg, 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 && get_irg_dom_state(irg) == dom_consistent &&
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; \