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"
40 /** if this flag is set, verify entity types in Load & Store nodes */
41 static int verify_entities = 0;
43 const char *firm_verify_failure_msg;
45 /* enable verification of Load/Store entities */
46 void verify_enable_entity_tests(int enable)
48 verify_entities = enable;
54 * little helper for NULL modes
56 static const char *get_mode_name_ex(ir_mode *mode)
60 return get_mode_name(mode);
63 /** the last IRG, on which a verification error was found */
64 static ir_graph *last_irg_error = NULL;
67 * print the name of the entity of an verification failure
69 * @param node the node caused the failure
71 static void show_entity_failure(ir_node *node)
73 ir_graph *irg = get_irn_irg(node);
75 if (last_irg_error == irg)
80 if (irg == get_const_code_irg()) {
81 fprintf(stderr, "\nFIRM: irn_verify_irg() <of CONST_CODE_IRG> failed\n");
83 ir_entity *ent = get_irg_entity(irg);
86 ir_type *ent_type = get_entity_owner(ent);
89 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() %+F::%s failed\n",
90 ent_type, get_entity_name(ent));
92 fprintf(stderr, "\nFIRM: irn_verify_irg() <NULL>::%s failed\n", get_entity_name(ent));
95 fprintf(stderr, "\nFIRM: irn_verify_irg() <IRG %p> failed\n", (void *)irg);
100 static const char *get_irn_modename(const ir_node *node)
102 ir_mode *mode = get_irn_mode(node);
103 return get_mode_name(mode);
107 * Prints a failure for a Node
109 static void show_node_failure(ir_node *n)
111 show_entity_failure(n);
112 fprintf(stderr, " node %ld %s%s\n" ,
114 get_irn_opname(n), get_irn_modename(n)
119 * Prints a failure message for a binop
121 static void show_binop_failure(ir_node *n, const char *text)
123 ir_node *left = get_binop_left(n);
124 ir_node *right = get_binop_right(n);
126 show_entity_failure(n);
127 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
129 get_irn_opname(n), get_irn_modename(n),
130 get_irn_opname(left), get_irn_modename(left),
131 get_irn_opname(right), get_irn_modename(right),
136 * Prints a failure message for an unop
138 static void show_unop_failure(ir_node *n, const char *text)
140 ir_node *op = get_unop_op(n);
142 show_entity_failure(n);
143 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
145 get_irn_opname(n), get_irn_modename(n),
146 get_irn_opname(op), get_irn_modename(op),
151 * Prints a failure message for an op with 3 operands
153 static void show_triop_failure(ir_node *n, const char *text)
155 ir_node *op0 = get_irn_n(n, 0);
156 ir_node *op1 = get_irn_n(n, 1);
157 ir_node *op2 = get_irn_n(n, 2);
159 show_entity_failure(n);
160 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
162 get_irn_opname(n), get_irn_modename(n),
163 get_irn_opname(op0), get_irn_modename(op0),
164 get_irn_opname(op1), get_irn_modename(op1),
165 get_irn_opname(op2), get_irn_modename(op2),
170 * Prints a failure message for a proj
172 static void show_proj_failure(ir_node *n)
174 ir_node *op = get_Proj_pred(n);
175 int proj = get_Proj_proj(n);
177 show_entity_failure(n);
178 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
180 get_irn_opname(n), get_irn_modename(n), proj,
181 get_irn_opname(op), get_irn_modename(op));
185 * Prints a failure message for a proj from Start
187 static void show_proj_mode_failure(ir_node *n, ir_type *ty)
189 long proj = get_Proj_proj(n);
190 ir_mode *m = get_type_mode(ty);
192 ir_print_type(type_name, sizeof(type_name), ty);
194 show_entity_failure(n);
195 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
200 get_mode_name_ex(m));
204 * Prints a failure message for a proj
206 static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
208 ir_node *op = get_Proj_pred(n);
209 int proj = get_Proj_proj(n);
210 ir_mode *m = get_type_mode(get_entity_type(ent));
212 ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
214 show_entity_failure(n);
215 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
217 get_irn_opname(n), get_irn_modename(n), proj,
218 get_irn_opname(op), get_irn_modename(op),
219 get_entity_name(ent), type_name,
220 get_mode_name_ex(m));
224 * Show a node and a graph
226 static void show_node_on_graph(ir_graph *irg, ir_node *n)
228 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
232 * Show call parameters
234 static void show_call_param(ir_node *n, ir_type *mt)
238 ir_print_type(type_name, sizeof(type_name), mt);
240 show_entity_failure(n);
241 fprintf(stderr, " Call type-check failed: %s(", type_name);
242 for (i = 0; i < get_method_n_params(mt); ++i) {
243 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
245 fprintf(stderr, ") != CALL(");
247 for (i = 0; i < get_Call_n_params(n); ++i) {
248 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
250 fprintf(stderr, ")\n");
256 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
258 ir_entity *ent = get_irg_entity(irg);
260 show_entity_failure(n);
261 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
262 get_irn_node_nr(n), get_entity_name(ent),
263 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
264 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
269 * Show return number of results
271 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
273 ir_entity *ent = get_irg_entity(irg);
275 show_entity_failure(n);
276 fprintf(stderr, " Return node %ld in entity \"%s\" has %lu results different from type %lu\n",
277 get_irn_node_nr(n), get_entity_name(ent),
278 (unsigned long) get_Return_n_ress(n),
279 (unsigned long) get_method_n_ress(mt));
285 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
288 show_entity_failure(phi);
289 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
290 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
291 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
297 static void show_phi_inputs(ir_node *phi, ir_node *block)
299 show_entity_failure(phi);
300 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
301 get_irn_node_nr(phi), get_irn_arity(phi),
302 get_irn_node_nr(block), get_irn_arity(block));
305 #endif /* #ifndef NDEBUG */
308 * If the address is Sel or SymConst, return the entity.
310 * @param ptr the node representing the address
312 static ir_entity *get_ptr_entity(ir_node *ptr)
315 return get_Sel_entity(ptr);
316 } else if (is_SymConst_addr_ent(ptr)) {
317 return get_SymConst_entity(ptr);
323 * verify a Proj(Start) node
325 static int verify_node_Proj_Start(ir_node *n, ir_node *p)
327 ir_mode *mode = get_irn_mode(p);
328 long proj = get_Proj_proj(p);
333 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
334 (proj == pn_Start_M && mode == mode_M) ||
335 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
336 (proj == pn_Start_T_args && mode == mode_T)
338 "wrong Proj from Start", 0,
339 show_proj_failure(p);
345 * verify a Proj(Cond) node
347 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p)
349 ir_mode *mode = get_irn_mode(p);
350 long proj = get_Proj_proj(p);
354 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
355 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
356 is_Bad(get_Cond_selector(pred)) /* rare */
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 /* hmm, optimization did not remove it */
669 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
676 * verify a Proj(Tuple) node
678 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
687 * verify a Proj(CopyB) node
689 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
691 ir_mode *mode = get_irn_mode(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(ir_node *n, ir_node *p)
719 ir_mode *mode = get_irn_mode(p);
720 long proj = get_Proj_proj(p);
722 /* ignore Bound checks of Bad */
723 if (is_Bad(get_Bound_index(n)))
727 (proj == pn_Bound_M && mode == mode_M) ||
728 (proj == pn_Bound_X_regular && mode == mode_X) ||
729 (proj == pn_Bound_X_except && mode == mode_X) ||
730 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
732 "wrong Proj from Bound", 0,
733 show_proj_failure(p);
741 static int verify_node_Proj(ir_node *p, ir_graph *irg)
746 pred = skip_Id(get_Proj_pred(p));
747 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
748 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);
750 op = get_irn_op(pred);
752 if (op->ops.verify_proj_node)
753 return op->ops.verify_proj_node(pred, p);
760 * verify a Block node
762 static int verify_node_Block(ir_node *n, ir_graph *irg)
766 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
767 ir_node *pred = get_Block_cfgpred(n, i);
769 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
770 "Block node must have a mode_X predecessor", 0);
773 if (n == get_irg_start_block(irg)) {
774 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
777 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
778 /* End block may only have Return, Raise or fragile ops as preds. */
779 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
780 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
781 if (is_Proj(pred) || is_Tuple(pred))
782 break; /* We can not test properly. How many tuples are there? */
790 "End Block node", 0);
792 /* irg attr must == graph we are in. */
793 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
798 * verify a Start node
800 static int verify_node_Start(ir_node *n, ir_graph *irg)
802 ir_mode *mymode = get_irn_mode(n);
806 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
807 mymode == mode_T, "Start node", 0
815 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
817 ir_mode *mymode = get_irn_mode(n);
822 mymode == mode_X, "Jmp node", 0
828 * verify an IJmp node
830 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
832 ir_mode *mymode = get_irn_mode(n);
833 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
837 /* IJmp: BB x ref --> X */
838 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
846 static int verify_node_Cond(ir_node *n, ir_graph *irg)
848 ir_mode *mymode = get_irn_mode(n);
849 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
853 /* Cond: BB x b --> X x X */
854 (op1mode == mode_b ||
855 /* Cond: BB x int --> X^n */
856 mode_is_int(op1mode) ), "Cond node", 0
858 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
864 * verify a Return node
866 static int verify_node_Return(ir_node *n, ir_graph *irg)
869 ir_mode *mymode = get_irn_mode(n);
870 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
873 /* Return: BB x M x data1 x ... x datan --> X */
875 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
877 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
878 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
880 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
881 /* Compare returned results with result types of method type */
882 mt = get_entity_type(get_irg_entity(irg));
883 ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
884 "Number of results for Return doesn't match number of results in type.", 0,
885 show_return_nres(irg, n, mt););
886 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
887 ir_type *res_type = get_method_res_type(mt, i);
889 if (get_irg_phase_state(irg) != phase_backend) {
890 if (is_atomic_type(res_type)) {
892 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
893 "Mode of result for Return doesn't match mode of result type.", 0,
894 show_return_modes(irg, n, mt, i);
898 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
899 "Mode of result for Return doesn't match mode of result type.", 0,
900 show_return_modes(irg, n, mt, i);
909 * verify a Raise node
911 static int verify_node_Raise(ir_node *n, ir_graph *irg)
913 ir_mode *mymode = get_irn_mode(n);
914 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
915 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
919 /* Sel: BB x M x ref --> X x M */
920 op1mode == mode_M && mode_is_reference(op2mode) &&
921 mymode == mode_T, "Raise node", 0
927 * verify a Const node
929 static int verify_node_Const(ir_node *n, ir_graph *irg)
931 ir_mode *mymode = get_irn_mode(n);
935 /* Const: BB --> data */
936 (mode_is_data(mymode) ||
937 mymode == mode_b) /* we want boolean constants for static evaluation */
938 ,"Const node", 0 /* of Cmp. */
941 /* the modes of the constant and teh tarval must match */
942 mymode == get_tarval_mode(get_Const_tarval(n)),
943 "Const node, tarval and node mode mismatch", 0
949 * verify a SymConst node
951 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
953 ir_mode *mymode = get_irn_mode(n);
957 /* SymConst: BB --> int*/
958 (mode_is_int(mymode) ||
959 /* SymConst: BB --> ref */
960 mode_is_reference(mymode))
961 ,"SymConst node", 0);
968 static int verify_node_Sel(ir_node *n, ir_graph *irg)
971 ir_mode *mymode = get_irn_mode(n);
972 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
973 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
978 /* Sel: BB x M x ref x int^n --> ref */
979 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
980 "Sel node", 0, show_node_failure(n)
983 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
984 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
986 ent = get_Sel_entity(n);
987 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
992 * verify an InstOf node
994 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
996 ir_mode *mymode = get_irn_mode(n);
997 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1000 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1001 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1006 * Check if the pinned state is right.
1008 static int verify_right_pinned(ir_node *n)
1012 if (get_irn_pinned(n) == op_pin_state_pinned)
1014 mem = get_Call_mem(n);
1016 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1017 if (is_NoMem(mem) || is_Pin(mem))
1023 * verify a Call node
1025 static int verify_node_Call(ir_node *n, ir_graph *irg)
1027 ir_mode *mymode = get_irn_mode(n);
1028 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1029 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1035 /* Call: BB x M x ref x data1 x ... x datan
1036 --> M x datan+1 x ... x data n+m */
1037 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1039 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1040 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1042 mt = get_Call_type(n);
1043 if (get_unknown_type() == mt) {
1047 n_params = get_Call_n_params(n);
1048 for (i = 0; i < n_params; ++i) {
1049 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1052 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1053 /* Compare arguments of node with those of type */
1055 if (get_method_variadicity(mt) == variadicity_variadic) {
1057 get_Call_n_params(n) >= get_method_n_params(mt),
1058 "Number of args for Call doesn't match number of args in variadic type.",
1060 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1061 n, get_Call_n_params(n), get_method_n_params(mt));
1065 get_Call_n_params(n) == get_method_n_params(mt),
1066 "Number of args for Call doesn't match number of args in non variadic type.",
1068 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1069 n, get_Call_n_params(n), get_method_n_params(mt));
1073 for (i = 0; i < get_method_n_params(mt); i++) {
1074 ir_type *t = get_method_param_type(mt, i);
1076 if (get_irg_phase_state(irg) != phase_backend) {
1077 if (is_atomic_type(t)) {
1079 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1080 "Mode of arg for Call doesn't match mode of arg type.", 0,
1081 show_call_param(n, mt);
1084 /* call with a compound type, mode must be reference */
1086 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1087 "Mode of arg for Call doesn't match mode of arg type.", 0,
1088 show_call_param(n, mt);
1095 if (Call_has_callees(n)) {
1096 for (i = 0; i < get_Call_n_callees(n); i++) {
1097 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1105 * verify an Add node
1107 static int verify_node_Add(ir_node *n, ir_graph *irg)
1109 ir_mode *mymode = get_irn_mode(n);
1110 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1111 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1116 /* common Add: BB x numP x numP --> numP */
1117 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1118 /* Pointer Add: BB x ref x int --> ref */
1119 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1120 /* Pointer Add: BB x int x ref --> ref */
1121 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1124 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1125 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1126 "/* Pointer Add: BB x int x ref --> ref */");
1134 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1136 ir_mode *mymode = get_irn_mode(n);
1137 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1138 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1143 /* common Sub: BB x numP x numP --> numP */
1144 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1145 /* Pointer Sub: BB x ref x int --> ref */
1146 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1147 /* Pointer Sub: BB x ref x ref --> int */
1148 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1151 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1152 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1153 "/* Pointer Sub: BB x ref x ref --> int */" );
1159 * verify a Minus node
1161 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1163 ir_mode *mymode = get_irn_mode(n);
1164 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(ir_node *n, ir_graph *irg)
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));
1187 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1188 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1189 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1190 /* Mul: BB x float x float --> float */
1191 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1194 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1195 "/* Mul: BB x float x float --> float */");
1201 * verify a Mulh node
1203 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1205 ir_mode *mymode = get_irn_mode(n);
1206 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1207 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1212 /* Mulh: BB x int x int --> int */
1213 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1216 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1224 static int verify_node_Div(ir_node *n, ir_graph *irg)
1226 ir_mode *mymode = get_irn_mode(n);
1227 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1228 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1229 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1233 /* Div: BB x M x data x data --> M x X x data */
1234 op1mode == mode_M &&
1235 op2mode == op3mode &&
1236 mode_is_data(op2mode) &&
1246 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1248 ir_mode *mymode = get_irn_mode(n);
1249 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1250 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1251 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1255 /* Mod: BB x M x int x int --> M x X x int */
1256 op1mode == mode_M &&
1257 op2mode == op3mode &&
1258 mode_is_int(op2mode) &&
1266 * verify a logical And, Or, Eor node
1268 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1270 ir_mode *mymode = get_irn_mode(n);
1271 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1272 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1276 /* And or Or or Eor: BB x int x int --> int */
1277 (mode_is_int(mymode) || mode_is_reference(mymode) || mymode == mode_b) &&
1278 op2mode == op1mode &&
1280 "And, Or or Eor node", 0,
1281 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1286 #define verify_node_And verify_node_Logic
1287 #define verify_node_Or verify_node_Logic
1288 #define verify_node_Eor verify_node_Logic
1293 static int verify_node_Not(ir_node *n, ir_graph *irg)
1295 ir_mode *mymode = get_irn_mode(n);
1296 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1300 /* Not: BB x int --> int */
1301 (mode_is_int(mymode) || mymode == mode_b) &&
1304 show_unop_failure(n, "/* Not: BB x int --> int */");
1312 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1314 ir_mode *mymode = get_irn_mode(n);
1315 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1316 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1320 /* Cmp: BB x datab x datab --> b16 */
1321 mode_is_datab(op1mode) &&
1322 op2mode == op1mode &&
1325 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1331 * verify a Shift node
1333 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1335 ir_mode *mymode = get_irn_mode(n);
1336 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1337 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1341 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1342 mode_is_int(op1mode) &&
1343 mode_is_int(op2mode) &&
1344 !mode_is_signed(op2mode) &&
1346 "Shl, Shr or Shrs node", 0,
1347 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1352 #define verify_node_Shl verify_node_Shift
1353 #define verify_node_Shr verify_node_Shift
1354 #define verify_node_Shrs verify_node_Shift
1357 * verify a Rotl node
1359 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1361 ir_mode *mymode = get_irn_mode(n);
1362 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1363 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1367 /* Rotl: BB x int x int --> int */
1368 mode_is_int(op1mode) &&
1369 mode_is_int(op2mode) &&
1372 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1378 * verify a Conv node
1380 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1382 ir_mode *mymode = get_irn_mode(n);
1383 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1387 is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
1388 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1390 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1396 * verify a Cast node
1398 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1400 ir_mode *mymode = get_irn_mode(n);
1401 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1405 /* Conv: BB x datab1 --> datab2 */
1406 mode_is_data(op1mode) && op1mode == mymode,
1408 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1416 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1418 ir_mode *mymode = get_irn_mode(n);
1419 ir_node *block = get_nodes_block(n);
1423 /* a Phi node MUST have the same number of inputs as its block
1424 * Exception is a phi with 0 inputs which is used when (re)constructing the
1426 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1428 get_irn_arity(n) == get_irn_arity(block),
1429 "wrong number of inputs in Phi node", 0,
1430 show_phi_inputs(n, block);
1434 /* Phi: BB x dataM^n --> dataM */
1435 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1436 ir_node *pred = get_Phi_pred(n, i);
1437 if (!is_Bad(pred)) {
1439 get_irn_mode(pred) == mymode,
1441 show_phi_failure(n, pred, i);
1445 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1447 if (mymode == mode_M) {
1448 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1450 ir_node *pred_i = get_Phi_pred(n, i);
1454 for (j = i - 1; j >= 0; --j) {
1455 ir_node *pred_j = get_Phi_pred(n, j);
1460 /* currently this checks fails for blocks with exception
1461 outputs (and these are NOT basic blocks). So it is disabled yet. */
1463 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1464 "At least two different PhiM predecessors are in the same block",
1466 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1476 * verify a Load node
1478 static int verify_node_Load(ir_node *n, ir_graph *irg)
1480 ir_mode *mymode = get_irn_mode(n);
1481 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1482 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1484 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1485 if (get_irg_phase_state(irg) != phase_backend) {
1486 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1488 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1491 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1492 * (Proj (Proj))) sometimes ...
1494 * interprete.c:ai_eval seems to assume that this happens, too
1496 * obset.c:get_abstval_any can't deal with this if the load has
1500 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1501 assert ((NULL != ent) || (mymode != mode_T));
1509 * verify a Store node
1511 static int verify_node_Store(ir_node *n, ir_graph *irg)
1515 ir_mode *mymode = get_irn_mode(n);
1516 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1517 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1518 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1520 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1521 if (get_irg_phase_state(irg) != phase_backend) {
1522 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1524 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1526 target = get_ptr_entity(get_Store_ptr(n));
1527 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1529 * If lowered code, any Sels that add 0 may be removed, causing
1530 * an direct access to entities of array or compound type.
1531 * Prevent this by checking the phase.
1533 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1541 * verify an Alloc node
1543 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1545 ir_mode *mymode = get_irn_mode(n);
1546 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1547 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1551 /* Alloc: BB x M x int_u --> M x X x ref */
1552 op1mode == mode_M &&
1553 mode_is_int(op2mode) &&
1554 !mode_is_signed(op2mode) &&
1557 show_node_failure(n);
1563 * verify a Free node
1565 static int verify_node_Free(ir_node *n, ir_graph *irg)
1567 ir_mode *mymode = get_irn_mode(n);
1568 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1569 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1570 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1574 /* Free: BB x M x ref x int_u --> M */
1575 op1mode == mode_M && mode_is_reference(op2mode) &&
1576 mode_is_int(op3mode) &&
1577 !mode_is_signed(op3mode) &&
1580 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1586 * verify a Sync node
1588 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1591 ir_mode *mymode = get_irn_mode(n);
1594 /* Sync: BB x M^n --> M */
1595 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1596 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1598 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1603 * verify a Confirm node
1605 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1607 ir_mode *mymode = get_irn_mode(n);
1608 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1609 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1613 /* Confirm: BB x T x T --> T */
1614 op1mode == mymode &&
1617 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1625 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1627 ir_mode *mymode = get_irn_mode(n);
1628 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1629 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1630 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1634 /* Mux: BB x b x datab x datab --> datab */
1635 op1mode == mode_b &&
1636 op2mode == mymode &&
1637 op3mode == mymode &&
1638 mode_is_datab(mymode),
1645 * verify a CopyB node
1647 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1649 ir_mode *mymode = get_irn_mode(n);
1650 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1651 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1652 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1653 ir_type *t = get_CopyB_type(n);
1655 /* CopyB: BB x M x ref x ref --> M x X */
1656 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1657 if (get_irg_phase_state(irg) != phase_backend) {
1658 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1663 is_compound_type(t) || is_Array_type(t),
1664 "CopyB node should copy compound types only", 0 );
1666 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1667 This should happen RARELY, as CopyB COPIES MEMORY */
1668 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1673 * verify a Bound node
1675 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1677 ir_mode *mymode = get_irn_mode(n);
1678 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1679 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1680 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1681 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1684 /* Bound: BB x M x int x int x int --> M x X */
1687 op1mode == mode_M &&
1688 op2mode == op3mode &&
1689 op3mode == op4mode &&
1690 mode_is_int(op3mode),
1697 * For each usage of a node, it is checked, if the block of the
1698 * node dominates the block of the usage (for phis: the predecessor
1699 * block of the phi for the corresponding edge).
1701 * @return non-zero on success, 0 on dominance error
1703 static int check_dominance_for_node(ir_node *use)
1705 /* This won't work for blocks and the end node */
1706 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1708 ir_node *bl = get_nodes_block(use);
1710 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1711 ir_node *def = get_irn_n(use, i);
1712 ir_node *def_bl = get_nodes_block(def);
1713 ir_node *use_bl = bl;
1716 /* ignore dead definition blocks, will be removed */
1717 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1721 use_bl = get_Block_cfgpred_block(bl, i);
1723 /* ignore dead use blocks, will be removed */
1724 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1727 irg = get_irn_irg(use);
1729 block_dominates(def_bl, use_bl),
1730 "the definition of a value used violates the dominance property", 0,
1732 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1733 irg, def_bl, def, use_bl, use, i
1741 /* Tests the modes of n and its predecessors. */
1742 int irn_verify_irg(ir_node *n, ir_graph *irg)
1747 if (!get_node_verification_mode())
1751 * do NOT check placement in interprocedural view, as we don't always
1752 * know the "right" graph ...
1756 /* this is an expensive check for large graphs (it has a quadratic
1757 * runtime but with a small constant); so do NOT run it in release mode
1760 node_is_in_irgs_storage(irg, n),
1761 "Node is not stored on proper IR graph!", 0,
1762 show_node_on_graph(irg, n);
1765 assert(get_irn_irg(n) == irg);
1767 unsigned idx = get_irn_idx(n);
1768 ir_node *node_from_map = get_idx_irn(irg, idx);
1769 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1770 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1775 /* We don't want to test nodes whose predecessors are Bad,
1776 as we would have to special case that for each operation. */
1777 if (op != op_Phi && op != op_Block) {
1778 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1779 if (is_Bad(get_irn_n(n, i)))
1784 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1785 op_pin_state state = get_irn_pinned(n);
1787 state == op_pin_state_floats ||
1788 state == op_pin_state_pinned,
1789 "invalid pin state", 0,
1790 ir_printf("node %+F", n));
1793 if (op->ops.verify_node)
1794 return op->ops.verify_node(n, irg);
1800 int irn_verify(ir_node *n)
1802 #ifdef DEBUG_libfirm
1803 return irn_verify_irg(n, get_irn_irg(n));
1810 /*-----------------------------------------------------------------*/
1811 /* Verify the whole graph. */
1812 /*-----------------------------------------------------------------*/
1814 #ifdef DEBUG_libfirm
1816 * Walker to check every node
1818 static void verify_wrap(ir_node *node, void *env)
1820 int *res = (int*)env;
1821 *res = irn_verify_irg(node, get_irn_irg(node));
1825 * Walker to check every node including SSA property.
1826 * Only called if dominance info is available.
1828 static void verify_wrap_ssa(ir_node *node, void *env)
1830 int *res = (int*)env;
1832 *res = irn_verify_irg(node, get_irn_irg(node));
1834 *res = check_dominance_for_node(node);
1838 #endif /* DEBUG_libfirm */
1841 * Calls irn_verify for each node in irg.
1842 * Graph must be in state "op_pin_state_pinned".
1843 * If dominance info is available, check the SSA property.
1845 int irg_verify(ir_graph *irg, unsigned flags)
1848 #ifdef DEBUG_libfirm
1849 int pinned = get_irg_pinned(irg) == op_pin_state_pinned;
1852 last_irg_error = NULL;
1855 if ((flags & VERIFY_ENFORCE_SSA) && pinned)
1860 pinned && get_irg_dom_state(irg) == dom_consistent
1861 ? verify_wrap_ssa : verify_wrap,
1866 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1867 ir_entity *ent = get_irg_entity(irg);
1870 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1872 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1878 #endif /* DEBUG_libfirm */
1883 typedef struct pass_t {
1884 ir_graph_pass_t pass;
1889 * Wrapper to irg_verify to be run as an ir_graph pass.
1891 static int irg_verify_wrapper(ir_graph *irg, void *context)
1893 pass_t *pass = (pass_t*)context;
1894 irg_verify(irg, pass->flags);
1895 /* do NOT rerun the pass if verify is ok :-) */
1899 /* Creates an ir_graph pass for irg_verify(). */
1900 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1902 pass_t *pass = XMALLOCZ(pass_t);
1904 def_graph_pass_constructor(
1905 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1907 /* neither dump for verify */
1908 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1909 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1911 pass->flags = flags;
1915 /* create a verify pass */
1916 int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1919 firm_verification_t old = get_node_verification_mode();
1921 firm_verify_failure_msg = NULL;
1922 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1923 res = irn_verify_irg(n, irg);
1924 if (res && get_irg_dom_state(irg) == dom_consistent &&
1925 get_irg_pinned(irg) == op_pin_state_pinned)
1926 res = check_dominance_for_node(n);
1927 do_node_verification(old);
1928 *bad_string = firm_verify_failure_msg;
1933 typedef struct verify_bad_env_t {
1939 * Pre-Walker: check Bad predecessors of node.
1941 static void check_bads(ir_node *node, void *env)
1943 verify_bad_env_t *venv = (verify_bad_env_t*)env;
1944 int i, arity = get_irn_arity(node);
1945 ir_graph *irg = get_irn_irg(node);
1947 if (is_Block(node)) {
1948 if ((venv->flags & BAD_CF) == 0) {
1950 /* check for Bad Block predecessor */
1951 for (i = 0; i < arity; ++i) {
1952 ir_node *pred = get_irn_n(node, i);
1955 venv->res |= BAD_CF;
1957 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1958 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1960 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1961 dump_ir_graph(irg, "-assert");
1962 assert(0 && "Bad CF detected");
1968 if ((venv->flags & BAD_BLOCK) == 0) {
1970 /* check for Bad Block */
1971 if (is_Bad(get_nodes_block(node))) {
1972 venv->res |= BAD_BLOCK;
1974 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1975 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1977 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1978 dump_ir_graph(irg, "-assert");
1979 assert(0 && "Bad CF detected");
1984 if ((venv->flags & TUPLE) == 0) {
1985 if (is_Tuple(node)) {
1988 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1989 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1991 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1992 dump_ir_graph(irg, "-assert");
1993 assert(0 && "Tuple detected");
1998 for (i = 0; i < arity; ++i) {
1999 ir_node *pred = get_irn_n(node, i);
2002 /* check for Phi with Bad inputs */
2003 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2004 if (venv->flags & BAD_CF)
2007 venv->res |= BAD_CF;
2009 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2010 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2012 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2013 dump_ir_graph(irg, "-assert");
2014 assert(0 && "Bad CF detected");
2019 /* Bad node input */
2020 if ((venv->flags & BAD_DF) == 0) {
2021 venv->res |= BAD_DF;
2023 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2024 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2026 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2027 dump_ir_graph(irg, "-assert");
2028 assert(0 && "Bad NON-CF detected");
2037 * verify occurrence of bad nodes
2039 int irg_verify_bads(ir_graph *irg, int flags)
2041 verify_bad_env_t env;
2046 irg_walk_graph(irg, check_bads, NULL, &env);
2052 * set the default verify operation
2054 void firm_set_default_verifier(unsigned code, ir_op_ops *ops)
2058 ops->verify_node = verify_node_##a; \
2110 ops->verify_proj_node = verify_node_Proj_##a; \