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_P_tls && 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 */
357 is_Bad(get_Cond_selector(pred)) /* rare */
359 "wrong Proj from Cond", 0,
360 show_proj_failure(p);
366 * verify a Proj(Raise) node
368 static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
370 ir_mode *mode = get_irn_mode(p);
371 long proj = get_Proj_proj(p);
375 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
376 "wrong Proj from Raise", 0,
377 show_proj_failure(p);
383 * verify a Proj(InstOf) node
385 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p)
387 ir_mode *mode = get_irn_mode(p);
388 long proj = get_Proj_proj(p);
393 (proj == pn_InstOf_M && mode == mode_M) ||
394 (proj == pn_InstOf_X_regular && mode == mode_X) ||
395 (proj == pn_InstOf_X_except && mode == mode_X) ||
396 (proj == pn_InstOf_res && mode_is_reference(mode))
398 "wrong Proj from InstOf", 0,
399 show_proj_failure(p);
405 * verify a Proj(Call) node
407 static int verify_node_Proj_Call(ir_node *n, ir_node *p)
409 ir_mode *mode = get_irn_mode(p);
410 long proj = get_Proj_proj(p);
414 (proj == pn_Call_M && mode == mode_M) ||
415 (proj == pn_Call_X_regular && mode == mode_X) ||
416 (proj == pn_Call_X_except && mode == mode_X) ||
417 (proj == pn_Call_T_result && mode == mode_T) ||
418 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
420 "wrong Proj from Call", 0,
421 show_proj_failure(p);
423 /* if we have exception flow, we must have a real Memory input */
424 if (proj == pn_Call_X_regular)
426 !is_NoMem(get_Call_mem(n)),
427 "Regular Proj from FunctionCall", 0);
428 else if (proj == pn_Call_X_except)
430 !is_NoMem(get_Call_mem(n)),
431 "Exception Proj from FunctionCall", 0);
436 * verify a Proj(Div) node
438 static int verify_node_Proj_Div(ir_node *n, ir_node *p)
440 ir_mode *mode = get_irn_mode(p);
441 long proj = get_Proj_proj(p);
445 (proj == pn_Div_M && mode == mode_M) ||
446 (proj == pn_Div_X_regular && mode == mode_X) ||
447 (proj == pn_Div_X_except && mode == mode_X) ||
448 (proj == pn_Div_res && mode_is_data(mode) && mode == get_Div_resmode(n))
450 "wrong Proj from Div", 0,
451 show_proj_failure(p);
453 if (proj == pn_Div_X_regular)
455 get_irn_pinned(n) == op_pin_state_pinned,
456 "Regular Proj from unpinned Div", 0);
457 else if (proj == pn_Div_X_except)
459 get_irn_pinned(n) == op_pin_state_pinned,
460 "Exception Proj from unpinned Div", 0);
461 else if (proj == pn_Div_M)
463 get_irn_pinned(n) == op_pin_state_pinned,
464 "Memory Proj from unpinned Div", 0);
469 * verify a Proj(Mod) node
471 static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
473 ir_mode *mode = get_irn_mode(p);
474 long proj = get_Proj_proj(p);
478 (proj == pn_Mod_M && mode == mode_M) ||
479 (proj == pn_Mod_X_regular && mode == mode_X) ||
480 (proj == pn_Mod_X_except && mode == mode_X) ||
481 (proj == pn_Mod_res && mode == get_Mod_resmode(n))
483 "wrong Proj from Mod", 0,
484 show_proj_failure(p);
486 if (proj == pn_Mod_X_regular)
488 get_irn_pinned(n) == op_pin_state_pinned,
489 "Regular Proj from unpinned Mod", 0);
490 else if (proj == pn_Mod_X_except)
492 get_irn_pinned(n) == op_pin_state_pinned,
493 "Exception Proj from unpinned Mod", 0);
494 else if (proj == pn_Mod_M)
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Memory Proj from unpinned Div", 0);
502 * verify a Proj(Cmp) node
504 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p)
506 ir_mode *mode = get_irn_mode(p);
507 long proj = get_Proj_proj(p);
511 (proj >= 0 && proj <= 15 && mode == mode_b),
512 "wrong Proj from Cmp", 0,
513 show_proj_failure(p);
516 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
517 "unordered Proj for non-float Cmp (Did you use Ne instead of Lg?)", 0,
518 show_proj_failure(p);
524 * verify a Proj(Load) node
526 static int verify_node_Proj_Load(ir_node *n, ir_node *p)
528 ir_mode *mode = get_irn_mode(p);
529 long proj = get_Proj_proj(p);
531 if (proj == pn_Load_res) {
532 ir_node *ptr = get_Load_ptr(n);
533 ir_entity *ent = get_ptr_entity(ptr);
534 ir_graph *irg = get_irn_irg(n);
536 if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
537 /* do NOT check this for lowered phases, see comment on Store */
539 (mode == get_type_mode(get_entity_type(ent))),
540 "wrong data Proj from Load, entity type_mode failed", 0,
541 show_proj_failure_ent(p, ent);
546 mode_is_data(mode) && mode == get_Load_mode(n),
547 "wrong data Proj from Load", 0,
548 show_proj_failure(p);
555 (proj == pn_Load_M && mode == mode_M) ||
556 (proj == pn_Load_X_regular && mode == mode_X) ||
557 (proj == pn_Load_X_except && mode == mode_X)
559 "wrong Proj from Load", 0,
560 show_proj_failure(p);
563 if (proj == pn_Load_X_regular) {
565 get_irn_pinned(n) == op_pin_state_pinned,
566 "Regular Proj from unpinned Load", 0);
567 } else if (proj == pn_Load_X_except) {
569 get_irn_pinned(n) == op_pin_state_pinned,
570 "Exception Proj from unpinned Load", 0);
576 * verify a Proj(Store) node
578 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
580 ir_mode *mode = get_irn_mode(p);
581 long proj = get_Proj_proj(p);
585 (proj == pn_Store_M && mode == mode_M) ||
586 (proj == pn_Store_X_regular && mode == mode_X) ||
587 (proj == pn_Store_X_except && mode == mode_X)
589 "wrong Proj from Store", 0,
590 show_proj_failure(p);
592 if (proj == pn_Store_X_regular) {
594 get_irn_pinned(n) == op_pin_state_pinned,
595 "Regular Proj from unpinned Store", 0);
596 } else if (proj == pn_Store_X_except) {
598 get_irn_pinned(n) == op_pin_state_pinned,
599 "Exception Proj from unpinned Store", 0);
605 * verify a Proj(Alloc) node
607 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
609 ir_mode *mode = get_irn_mode(p);
610 long proj = get_Proj_proj(p);
615 (proj == pn_Alloc_M && mode == mode_M) ||
616 (proj == pn_Alloc_X_regular && mode == mode_X) ||
617 (proj == pn_Alloc_X_except && mode == mode_X) ||
618 (proj == pn_Alloc_res && mode_is_reference(mode))
620 "wrong Proj from Alloc", 0,
621 show_proj_failure(p);
627 * verify a Proj(Proj) node
629 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
631 ir_mode *mode = get_irn_mode(p);
632 long proj = get_Proj_proj(p);
633 long nr = get_Proj_proj(pred);
634 ir_type *mt; /* A method type */
636 pred = skip_Id(get_Proj_pred(pred));
637 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
639 switch (get_irn_opcode(pred)) {
641 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
643 if (nr == pn_Start_T_args) {
645 (proj >= 0 && mode_is_datab(mode)),
646 "wrong Proj from Proj from Start", 0);
648 (proj < (int)get_method_n_params(mt)),
649 "More Projs for args than args in type", 0
651 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
652 /* value argument */ break;
654 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
656 (mode == get_type_mode(get_method_param_type(mt, proj))),
657 "Mode of Proj from Start doesn't match mode of param type.", 0,
658 show_proj_mode_failure(p, get_method_param_type(mt, proj));
667 (proj >= 0 && mode_is_datab(mode)),
668 "wrong Proj from Proj from Call", 0);
669 mt = get_Call_type(pred);
670 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
671 "wrong call type on call", 0);
673 (proj < (int)get_method_n_ress(mt)),
674 "More Projs for results than results in type.", 0);
675 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
676 /* value result */ break;
679 (mode == get_type_mode(get_method_res_type(mt, proj))),
680 "Mode of Proj from Call doesn't match mode of result type.", 0);
689 /* hmm, optimization did not remove it */
693 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
700 * verify a Proj(Tuple) node
702 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
711 * verify a Proj(CopyB) node
713 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
715 ir_mode *mode = get_irn_mode(p);
716 long proj = get_Proj_proj(p);
720 (proj == pn_CopyB_M && mode == mode_M) ||
721 (proj == pn_CopyB_X_regular && mode == mode_X) ||
722 (proj == pn_CopyB_X_except && mode == mode_X)
724 "wrong Proj from CopyB", 0,
725 show_proj_failure(p);
727 if (proj == pn_CopyB_X_regular)
729 get_irn_pinned(n) == op_pin_state_pinned,
730 "Regular Proj from unpinned CopyB", 0);
731 else if (proj == pn_CopyB_X_except)
733 get_irn_pinned(n) == op_pin_state_pinned,
734 "Exception Proj from unpinned CopyB", 0);
739 * verify a Proj(Bound) node
741 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
743 ir_mode *mode = get_irn_mode(p);
744 long proj = get_Proj_proj(p);
746 /* ignore Bound checks of Bad */
747 if (is_Bad(get_Bound_index(n)))
751 (proj == pn_Bound_M && mode == mode_M) ||
752 (proj == pn_Bound_X_regular && mode == mode_X) ||
753 (proj == pn_Bound_X_except && mode == mode_X) ||
754 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
756 "wrong Proj from Bound", 0,
757 show_proj_failure(p);
765 static int verify_node_Proj(ir_node *p, ir_graph *irg)
770 pred = skip_Id(get_Proj_pred(p));
771 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
772 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);
774 op = get_irn_op(pred);
776 if (op->ops.verify_proj_node)
777 return op->ops.verify_proj_node(pred, p);
784 * verify a Block node
786 static int verify_node_Block(ir_node *n, ir_graph *irg)
790 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
791 ir_node *pred = get_Block_cfgpred(n, i);
793 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
794 "Block node must have a mode_X predecessor", 0);
797 if (n == get_irg_start_block(irg)) {
798 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
801 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
802 /* End block may only have Return, Raise or fragile ops as preds. */
803 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
804 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
805 if (is_Proj(pred) || is_Tuple(pred))
806 break; /* We can not test properly. How many tuples are there? */
814 "End Block node", 0);
816 /* irg attr must == graph we are in. */
817 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
822 * verify a Start node
824 static int verify_node_Start(ir_node *n, ir_graph *irg)
826 ir_mode *mymode = get_irn_mode(n);
830 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
831 mymode == mode_T, "Start node", 0
839 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
841 ir_mode *mymode = get_irn_mode(n);
846 mymode == mode_X, "Jmp node", 0
852 * verify an IJmp node
854 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
856 ir_mode *mymode = get_irn_mode(n);
857 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
861 /* IJmp: BB x ref --> X */
862 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
870 static int verify_node_Cond(ir_node *n, ir_graph *irg)
872 ir_mode *mymode = get_irn_mode(n);
873 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
877 /* Cond: BB x b --> X x X */
878 (op1mode == mode_b ||
879 /* Cond: BB x int --> X^n */
880 mode_is_int(op1mode) ), "Cond node", 0
882 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
888 * verify a Return node
890 static int verify_node_Return(ir_node *n, ir_graph *irg)
893 ir_mode *mymode = get_irn_mode(n);
894 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
897 /* Return: BB x M x data1 x ... x datan --> X */
899 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
901 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
902 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
904 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
905 /* Compare returned results with result types of method type */
906 mt = get_entity_type(get_irg_entity(irg));
907 ASSERT_AND_RET_DBG(get_Return_n_ress(n) == get_method_n_ress(mt),
908 "Number of results for Return doesn't match number of results in type.", 0,
909 show_return_nres(irg, n, mt););
910 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
911 ir_type *res_type = get_method_res_type(mt, i);
913 if (get_irg_phase_state(irg) != phase_backend) {
914 if (is_atomic_type(res_type)) {
916 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
917 "Mode of result for Return doesn't match mode of result type.", 0,
918 show_return_modes(irg, n, mt, i);
922 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
923 "Mode of result for Return doesn't match mode of result type.", 0,
924 show_return_modes(irg, n, mt, i);
933 * verify a Raise node
935 static int verify_node_Raise(ir_node *n, ir_graph *irg)
937 ir_mode *mymode = get_irn_mode(n);
938 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
939 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
943 /* Sel: BB x M x ref --> X x M */
944 op1mode == mode_M && mode_is_reference(op2mode) &&
945 mymode == mode_T, "Raise node", 0
951 * verify a Const node
953 static int verify_node_Const(ir_node *n, ir_graph *irg)
955 ir_mode *mymode = get_irn_mode(n);
959 /* Const: BB --> data */
960 (mode_is_data(mymode) ||
961 mymode == mode_b) /* we want boolean constants for static evaluation */
962 ,"Const node", 0 /* of Cmp. */
965 /* the modes of the constant and teh tarval must match */
966 mymode == get_tarval_mode(get_Const_tarval(n)),
967 "Const node, tarval and node mode mismatch", 0
973 * verify a SymConst node
975 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
977 ir_mode *mymode = get_irn_mode(n);
981 /* SymConst: BB --> int*/
982 (mode_is_int(mymode) ||
983 /* SymConst: BB --> ref */
984 mode_is_reference(mymode))
985 ,"SymConst node", 0);
992 static int verify_node_Sel(ir_node *n, ir_graph *irg)
995 ir_mode *mymode = get_irn_mode(n);
996 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
997 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1002 /* Sel: BB x M x ref x int^n --> ref */
1003 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1004 "Sel node", 0, show_node_failure(n)
1007 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1008 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1010 ent = get_Sel_entity(n);
1011 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1016 * verify an InstOf node
1018 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
1020 ir_mode *mymode = get_irn_mode(n);
1021 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1024 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1025 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1030 * Check if the pinned state is right.
1032 static int verify_right_pinned(ir_node *n)
1036 if (get_irn_pinned(n) == op_pin_state_pinned)
1038 mem = get_Call_mem(n);
1040 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1041 if (is_NoMem(mem) || is_Pin(mem))
1047 * verify a Call node
1049 static int verify_node_Call(ir_node *n, ir_graph *irg)
1051 ir_mode *mymode = get_irn_mode(n);
1052 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1053 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1059 /* Call: BB x M x ref x data1 x ... x datan
1060 --> M x datan+1 x ... x data n+m */
1061 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1063 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1064 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1066 mt = get_Call_type(n);
1067 if (get_unknown_type() == mt) {
1071 n_params = get_Call_n_params(n);
1072 for (i = 0; i < n_params; ++i) {
1073 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1076 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1077 /* Compare arguments of node with those of type */
1079 if (get_method_variadicity(mt) == variadicity_variadic) {
1081 get_Call_n_params(n) >= get_method_n_params(mt),
1082 "Number of args for Call doesn't match number of args in variadic type.",
1084 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1085 n, get_Call_n_params(n), get_method_n_params(mt));
1089 get_Call_n_params(n) == get_method_n_params(mt),
1090 "Number of args for Call doesn't match number of args in non variadic type.",
1092 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1093 n, get_Call_n_params(n), get_method_n_params(mt));
1097 for (i = 0; i < get_method_n_params(mt); i++) {
1098 ir_type *t = get_method_param_type(mt, i);
1100 if (get_irg_phase_state(irg) != phase_backend) {
1101 if (is_atomic_type(t)) {
1103 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1104 "Mode of arg for Call doesn't match mode of arg type.", 0,
1105 show_call_param(n, mt);
1108 /* call with a compound type, mode must be reference */
1110 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1111 "Mode of arg for Call doesn't match mode of arg type.", 0,
1112 show_call_param(n, mt);
1119 if (Call_has_callees(n)) {
1120 for (i = 0; i < get_Call_n_callees(n); i++) {
1121 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1129 * verify an Add node
1131 static int verify_node_Add(ir_node *n, ir_graph *irg)
1133 ir_mode *mymode = get_irn_mode(n);
1134 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1135 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1140 /* common Add: BB x numP x numP --> numP */
1141 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1142 /* Pointer Add: BB x ref x int --> ref */
1143 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1144 /* Pointer Add: BB x int x ref --> ref */
1145 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1148 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1149 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1150 "/* Pointer Add: BB x int x ref --> ref */");
1158 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1160 ir_mode *mymode = get_irn_mode(n);
1161 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1162 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1167 /* common Sub: BB x numP x numP --> numP */
1168 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1169 /* Pointer Sub: BB x ref x int --> ref */
1170 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1171 /* Pointer Sub: BB x ref x ref --> int */
1172 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1175 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1176 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1177 "/* Pointer Sub: BB x ref x ref --> int */" );
1183 * verify a Minus node
1185 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1187 ir_mode *mymode = get_irn_mode(n);
1188 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1192 /* Minus: BB x num --> num */
1193 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1194 show_unop_failure(n , "/* Minus: BB x num --> num */");
1202 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1204 ir_mode *mymode = get_irn_mode(n);
1205 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1206 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1211 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1212 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1213 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1214 /* Mul: BB x float x float --> float */
1215 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1218 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1219 "/* Mul: BB x float x float --> float */");
1225 * verify a Mulh node
1227 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1229 ir_mode *mymode = get_irn_mode(n);
1230 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1231 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1236 /* Mulh: BB x int x int --> int */
1237 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1240 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1248 static int verify_node_Div(ir_node *n, ir_graph *irg)
1250 ir_mode *mymode = get_irn_mode(n);
1251 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1252 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1253 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1257 /* Div: BB x M x data x data --> M x X x data */
1258 op1mode == mode_M &&
1259 op2mode == op3mode &&
1260 mode_is_data(op2mode) &&
1270 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1272 ir_mode *mymode = get_irn_mode(n);
1273 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1274 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1275 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1279 /* Mod: BB x M x int x int --> M x X x int */
1280 op1mode == mode_M &&
1281 op2mode == op3mode &&
1282 mode_is_int(op2mode) &&
1290 * verify a logical And, Or, Eor node
1292 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1294 ir_mode *mymode = get_irn_mode(n);
1295 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1296 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1300 /* And or Or or Eor: BB x int x int --> int */
1301 (mode_is_int(mymode) || mymode == mode_b) &&
1302 op2mode == op1mode &&
1304 "And, Or or Eor node", 0,
1305 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1310 #define verify_node_And verify_node_Logic
1311 #define verify_node_Or verify_node_Logic
1312 #define verify_node_Eor verify_node_Logic
1317 static int verify_node_Not(ir_node *n, ir_graph *irg)
1319 ir_mode *mymode = get_irn_mode(n);
1320 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1324 /* Not: BB x int --> int */
1325 (mode_is_int(mymode) || mymode == mode_b) &&
1328 show_unop_failure(n, "/* Not: BB x int --> int */");
1336 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1338 ir_mode *mymode = get_irn_mode(n);
1339 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1340 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1344 /* Cmp: BB x datab x datab --> b16 */
1345 mode_is_datab(op1mode) &&
1346 op2mode == op1mode &&
1349 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1355 * verify a Shift node
1357 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1359 ir_mode *mymode = get_irn_mode(n);
1360 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1361 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1365 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1366 mode_is_int(op1mode) &&
1367 mode_is_int(op2mode) &&
1368 !mode_is_signed(op2mode) &&
1370 "Shl, Shr or Shrs node", 0,
1371 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1376 #define verify_node_Shl verify_node_Shift
1377 #define verify_node_Shr verify_node_Shift
1378 #define verify_node_Shrs verify_node_Shift
1381 * verify a Rotl node
1383 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1385 ir_mode *mymode = get_irn_mode(n);
1386 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1387 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1391 /* Rotl: BB x int x int --> int */
1392 mode_is_int(op1mode) &&
1393 mode_is_int(op2mode) &&
1396 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1402 * verify a Conv node
1404 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1406 ir_mode *mymode = get_irn_mode(n);
1407 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1411 is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
1412 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1414 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1420 * verify a Cast node
1422 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1424 ir_mode *mymode = get_irn_mode(n);
1425 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1429 /* Conv: BB x datab1 --> datab2 */
1430 mode_is_data(op1mode) && op1mode == mymode,
1432 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1440 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1442 ir_mode *mymode = get_irn_mode(n);
1443 ir_node *block = get_nodes_block(n);
1447 /* a Phi node MUST have the same number of inputs as its block
1448 * Exception is a phi with 0 inputs which is used when (re)constructing the
1450 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1452 get_irn_arity(n) == get_irn_arity(block),
1453 "wrong number of inputs in Phi node", 0,
1454 show_phi_inputs(n, block);
1458 /* Phi: BB x dataM^n --> dataM */
1459 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1460 ir_node *pred = get_Phi_pred(n, i);
1461 if (!is_Bad(pred)) {
1463 get_irn_mode(pred) == mymode,
1465 show_phi_failure(n, pred, i);
1469 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1471 if (mymode == mode_M) {
1472 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1474 ir_node *pred_i = get_Phi_pred(n, i);
1478 for (j = i - 1; j >= 0; --j) {
1479 ir_node *pred_j = get_Phi_pred(n, j);
1484 /* currently this checks fails for blocks with exception
1485 outputs (and these are NOT basic blocks). So it is disabled yet. */
1487 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1488 "At least two different PhiM predecessors are in the same block",
1490 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1500 * verify a Load node
1502 static int verify_node_Load(ir_node *n, ir_graph *irg)
1504 ir_mode *mymode = get_irn_mode(n);
1505 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1506 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1508 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1509 if (get_irg_phase_state(irg) != phase_backend) {
1510 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1512 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1515 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1516 * (Proj (Proj))) sometimes ...
1518 * interprete.c:ai_eval seems to assume that this happens, too
1520 * obset.c:get_abstval_any can't deal with this if the load has
1524 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1525 assert ((NULL != ent) || (mymode != mode_T));
1533 * verify a Store node
1535 static int verify_node_Store(ir_node *n, ir_graph *irg)
1539 ir_mode *mymode = get_irn_mode(n);
1540 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1541 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1542 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1544 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1545 if (get_irg_phase_state(irg) != phase_backend) {
1546 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1548 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1550 target = get_ptr_entity(get_Store_ptr(n));
1551 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1553 * If lowered code, any Sels that add 0 may be removed, causing
1554 * an direct access to entities of array or compound type.
1555 * Prevent this by checking the phase.
1557 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1565 * verify an Alloc node
1567 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1569 ir_mode *mymode = get_irn_mode(n);
1570 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1571 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1575 /* Alloc: BB x M x int_u --> M x X x ref */
1576 op1mode == mode_M &&
1577 mode_is_int(op2mode) &&
1578 !mode_is_signed(op2mode) &&
1581 show_node_failure(n);
1587 * verify a Free node
1589 static int verify_node_Free(ir_node *n, ir_graph *irg)
1591 ir_mode *mymode = get_irn_mode(n);
1592 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1593 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1594 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1598 /* Free: BB x M x ref x int_u --> M */
1599 op1mode == mode_M && mode_is_reference(op2mode) &&
1600 mode_is_int(op3mode) &&
1601 !mode_is_signed(op3mode) &&
1604 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1610 * verify a Sync node
1612 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1615 ir_mode *mymode = get_irn_mode(n);
1618 /* Sync: BB x M^n --> M */
1619 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1620 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1622 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1627 * verify a Confirm node
1629 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1631 ir_mode *mymode = get_irn_mode(n);
1632 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1633 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1637 /* Confirm: BB x T x T --> T */
1638 op1mode == mymode &&
1641 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1649 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1651 ir_mode *mymode = get_irn_mode(n);
1652 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1653 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1654 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1658 /* Mux: BB x b x datab x datab --> datab */
1659 op1mode == mode_b &&
1660 op2mode == mymode &&
1661 op3mode == mymode &&
1662 mode_is_datab(mymode),
1669 * verify a CopyB node
1671 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1673 ir_mode *mymode = get_irn_mode(n);
1674 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1675 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1676 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1677 ir_type *t = get_CopyB_type(n);
1679 /* CopyB: BB x M x ref x ref --> M x X */
1680 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1681 if (get_irg_phase_state(irg) != phase_backend) {
1682 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1687 is_compound_type(t) || is_Array_type(t),
1688 "CopyB node should copy compound types only", 0 );
1690 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1691 This should happen RARELY, as CopyB COPIES MEMORY */
1692 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1697 * verify a Bound node
1699 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1701 ir_mode *mymode = get_irn_mode(n);
1702 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1703 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1704 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1705 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1708 /* Bound: BB x M x int x int x int --> M x X */
1711 op1mode == mode_M &&
1712 op2mode == op3mode &&
1713 op3mode == op4mode &&
1714 mode_is_int(op3mode),
1721 * For each usage of a node, it is checked, if the block of the
1722 * node dominates the block of the usage (for phis: the predecessor
1723 * block of the phi for the corresponding edge).
1725 * @return non-zero on success, 0 on dominance error
1727 static int check_dominance_for_node(ir_node *use)
1729 /* This won't work for blocks and the end node */
1730 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1732 ir_node *bl = get_nodes_block(use);
1734 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1735 ir_node *def = get_irn_n(use, i);
1736 ir_node *def_bl = get_nodes_block(def);
1737 ir_node *use_bl = bl;
1740 /* ignore dead definition blocks, will be removed */
1741 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1745 use_bl = get_Block_cfgpred_block(bl, i);
1747 /* ignore dead use blocks, will be removed */
1748 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1751 irg = get_irn_irg(use);
1753 block_dominates(def_bl, use_bl),
1754 "the definition of a value used violates the dominance property", 0,
1756 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1757 irg, def_bl, def, use_bl, use, i
1765 /* Tests the modes of n and its predecessors. */
1766 int irn_verify_irg(ir_node *n, ir_graph *irg)
1771 if (!get_node_verification_mode())
1775 * do NOT check placement in interprocedural view, as we don't always
1776 * know the "right" graph ...
1780 /* this is an expensive check for large graphs (it has a quadratic
1781 * runtime but with a small constant); so do NOT run it in release mode
1784 node_is_in_irgs_storage(irg, n),
1785 "Node is not stored on proper IR graph!", 0,
1786 show_node_on_graph(irg, n);
1789 assert(get_irn_irg(n) == irg);
1791 unsigned idx = get_irn_idx(n);
1792 ir_node *node_from_map = get_idx_irn(irg, idx);
1793 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1794 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1799 /* We don't want to test nodes whose predecessors are Bad,
1800 as we would have to special case that for each operation. */
1801 if (op != op_Phi && op != op_Block) {
1802 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1803 if (is_Bad(get_irn_n(n, i)))
1808 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1809 op_pin_state state = get_irn_pinned(n);
1811 state == op_pin_state_floats ||
1812 state == op_pin_state_pinned,
1813 "invalid pin state", 0,
1814 ir_printf("node %+F", n));
1817 if (op->ops.verify_node)
1818 return op->ops.verify_node(n, irg);
1824 int irn_verify(ir_node *n)
1826 #ifdef DEBUG_libfirm
1827 return irn_verify_irg(n, get_irn_irg(n));
1834 /*-----------------------------------------------------------------*/
1835 /* Verify the whole graph. */
1836 /*-----------------------------------------------------------------*/
1838 #ifdef DEBUG_libfirm
1840 * Walker to check every node
1842 static void verify_wrap(ir_node *node, void *env)
1844 int *res = (int*)env;
1845 *res = irn_verify_irg(node, get_irn_irg(node));
1849 * Walker to check every node including SSA property.
1850 * Only called if dominance info is available.
1852 static void verify_wrap_ssa(ir_node *node, void *env)
1854 int *res = (int*)env;
1856 *res = irn_verify_irg(node, get_irn_irg(node));
1858 *res = check_dominance_for_node(node);
1862 #endif /* DEBUG_libfirm */
1865 * Calls irn_verify for each node in irg.
1866 * Graph must be in state "op_pin_state_pinned".
1867 * If dominance info is available, check the SSA property.
1869 int irg_verify(ir_graph *irg, unsigned flags)
1872 #ifdef DEBUG_libfirm
1875 last_irg_error = NULL;
1878 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1880 if (flags & VERIFY_ENFORCE_SSA)
1885 get_irg_dom_state(irg) == dom_consistent &&
1886 get_irg_pinned(irg) == op_pin_state_pinned ? verify_wrap_ssa : verify_wrap,
1890 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1891 ir_entity *ent = get_irg_entity(irg);
1894 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1896 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
1902 #endif /* DEBUG_libfirm */
1907 typedef struct pass_t {
1908 ir_graph_pass_t pass;
1913 * Wrapper to irg_verify to be run as an ir_graph pass.
1915 static int irg_verify_wrapper(ir_graph *irg, void *context)
1917 pass_t *pass = (pass_t*)context;
1918 irg_verify(irg, pass->flags);
1919 /* do NOT rerun the pass if verify is ok :-) */
1923 /* Creates an ir_graph pass for irg_verify(). */
1924 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
1926 pass_t *pass = XMALLOCZ(pass_t);
1928 def_graph_pass_constructor(
1929 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
1931 /* neither dump for verify */
1932 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
1933 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
1935 pass->flags = flags;
1939 /* create a verify pass */
1940 int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1943 firm_verification_t old = get_node_verification_mode();
1945 firm_verify_failure_msg = NULL;
1946 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1947 res = irn_verify_irg(n, irg);
1948 if (res && get_irg_dom_state(irg) == dom_consistent &&
1949 get_irg_pinned(irg) == op_pin_state_pinned)
1950 res = check_dominance_for_node(n);
1951 do_node_verification(old);
1952 *bad_string = firm_verify_failure_msg;
1957 typedef struct verify_bad_env_t {
1963 * Pre-Walker: check Bad predecessors of node.
1965 static void check_bads(ir_node *node, void *env)
1967 verify_bad_env_t *venv = (verify_bad_env_t*)env;
1968 int i, arity = get_irn_arity(node);
1969 ir_graph *irg = get_irn_irg(node);
1971 if (is_Block(node)) {
1972 if ((venv->flags & BAD_CF) == 0) {
1974 /* check for Bad Block predecessor */
1975 for (i = 0; i < arity; ++i) {
1976 ir_node *pred = get_irn_n(node, i);
1979 venv->res |= BAD_CF;
1981 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1982 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1984 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1985 dump_ir_graph(irg, "-assert");
1986 assert(0 && "Bad CF detected");
1992 if ((venv->flags & BAD_BLOCK) == 0) {
1994 /* check for Bad Block */
1995 if (is_Bad(get_nodes_block(node))) {
1996 venv->res |= BAD_BLOCK;
1998 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1999 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2001 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2002 dump_ir_graph(irg, "-assert");
2003 assert(0 && "Bad CF detected");
2008 if ((venv->flags & TUPLE) == 0) {
2009 if (is_Tuple(node)) {
2012 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2013 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2015 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2016 dump_ir_graph(irg, "-assert");
2017 assert(0 && "Tuple detected");
2022 for (i = 0; i < arity; ++i) {
2023 ir_node *pred = get_irn_n(node, i);
2026 /* check for Phi with Bad inputs */
2027 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2028 if (venv->flags & BAD_CF)
2031 venv->res |= BAD_CF;
2033 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2034 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2036 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2037 dump_ir_graph(irg, "-assert");
2038 assert(0 && "Bad CF detected");
2043 /* Bad node input */
2044 if ((venv->flags & BAD_DF) == 0) {
2045 venv->res |= BAD_DF;
2047 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2048 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2050 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2051 dump_ir_graph(irg, "-assert");
2052 assert(0 && "Bad NON-CF detected");
2061 * verify occurrence of bad nodes
2063 int irg_verify_bads(ir_graph *irg, int flags)
2065 verify_bad_env_t env;
2070 irg_walk_graph(irg, check_bads, NULL, &env);
2076 * set the default verify operation
2078 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2082 ops->verify_node = verify_node_##a; \
2134 ops->verify_proj_node = verify_node_Proj_##a; \