2 * Copyright (C) 1995-2010 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 %d results different from type %d\n",
277 get_irn_node_nr(n), get_entity_name(ent),
278 get_Return_n_ress(n), get_method_n_ress(mt));
284 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
287 show_entity_failure(phi);
288 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
289 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
290 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
296 static void show_phi_inputs(ir_node *phi, ir_node *block)
298 show_entity_failure(phi);
299 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
300 get_irn_node_nr(phi), get_irn_arity(phi),
301 get_irn_node_nr(block), get_irn_arity(block));
304 #endif /* #ifndef NDEBUG */
307 * If the address is Sel or SymConst, return the entity.
309 * @param ptr the node representing the address
311 static ir_entity *get_ptr_entity(ir_node *ptr)
314 return get_Sel_entity(ptr);
315 } else if (is_SymConst_addr_ent(ptr)) {
316 return get_SymConst_entity(ptr);
322 * verify a Proj(Start) node
324 static int verify_node_Proj_Start(ir_node *n, ir_node *p)
326 ir_mode *mode = get_irn_mode(p);
327 long proj = get_Proj_proj(p);
332 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
333 (proj == pn_Start_M && mode == mode_M) ||
334 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
335 (proj == pn_Start_P_tls && 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) ||
417 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
419 "wrong Proj from Call", 0,
420 show_proj_failure(p);
422 /* if we have exception flow, we must have a real Memory input */
423 if (proj == pn_Call_X_regular)
425 !is_NoMem(get_Call_mem(n)),
426 "Regular Proj from FunctionCall", 0);
427 else if (proj == pn_Call_X_except)
429 !is_NoMem(get_Call_mem(n)),
430 "Exception Proj from FunctionCall", 0);
435 * verify a Proj(Quot) node
437 static int verify_node_Proj_Quot(ir_node *n, ir_node *p)
439 ir_mode *mode = get_irn_mode(p);
440 long proj = get_Proj_proj(p);
444 (proj == pn_Quot_M && mode == mode_M) ||
445 (proj == pn_Quot_X_regular && mode == mode_X) ||
446 (proj == pn_Quot_X_except && mode == mode_X) ||
447 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
449 "wrong Proj from Quot", 0,
450 show_proj_failure(p);
452 if (proj == pn_Quot_X_regular)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Regular Proj from unpinned Quot", 0);
456 else if (proj == pn_Quot_X_except)
458 get_irn_pinned(n) == op_pin_state_pinned,
459 "Exception Proj from unpinned Quot", 0);
460 else if (proj == pn_Quot_M)
462 get_irn_pinned(n) == op_pin_state_pinned,
463 "Memory Proj from unpinned Quot", 0);
468 * verify a Proj(DivMod) node
470 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p)
472 ir_mode *mode = get_irn_mode(p);
473 long proj = get_Proj_proj(p);
477 (proj == pn_DivMod_M && mode == mode_M) ||
478 (proj == pn_DivMod_X_regular && mode == mode_X) ||
479 (proj == pn_DivMod_X_except && mode == mode_X) ||
480 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
481 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
483 "wrong Proj from DivMod", 0,
484 show_proj_failure(p);
486 if (proj == pn_DivMod_X_regular)
488 get_irn_pinned(n) == op_pin_state_pinned,
489 "Regular Proj from unpinned DivMod", 0);
490 else if (proj == pn_DivMod_X_except)
492 get_irn_pinned(n) == op_pin_state_pinned,
493 "Exception Proj from unpinned DivMod", 0);
494 else if (proj == pn_DivMod_M)
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Memory Proj from unpinned DivMod", 0);
502 * verify a Proj(Div) node
504 static int verify_node_Proj_Div(ir_node *n, ir_node *p)
506 ir_mode *mode = get_irn_mode(p);
507 long proj = get_Proj_proj(p);
511 (proj == pn_Div_M && mode == mode_M) ||
512 (proj == pn_Div_X_regular && mode == mode_X) ||
513 (proj == pn_Div_X_except && mode == mode_X) ||
514 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
516 "wrong Proj from Div", 0,
517 show_proj_failure(p);
519 if (proj == pn_Div_X_regular)
521 get_irn_pinned(n) == op_pin_state_pinned,
522 "Regular Proj from unpinned Div", 0);
523 else if (proj == pn_Div_X_except)
525 get_irn_pinned(n) == op_pin_state_pinned,
526 "Exception Proj from unpinned Div", 0);
527 else if (proj == pn_Div_M)
529 get_irn_pinned(n) == op_pin_state_pinned,
530 "Memory Proj from unpinned Div", 0);
535 * verify a Proj(Mod) node
537 static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
539 ir_mode *mode = get_irn_mode(p);
540 long proj = get_Proj_proj(p);
544 (proj == pn_Mod_M && mode == mode_M) ||
545 (proj == pn_Mod_X_regular && mode == mode_X) ||
546 (proj == pn_Mod_X_except && mode == mode_X) ||
547 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
549 "wrong Proj from Mod", 0,
550 show_proj_failure(p);
552 if (proj == pn_Mod_X_regular)
554 get_irn_pinned(n) == op_pin_state_pinned,
555 "Regular Proj from unpinned Mod", 0);
556 else if (proj == pn_Mod_X_except)
558 get_irn_pinned(n) == op_pin_state_pinned,
559 "Exception Proj from unpinned Mod", 0);
560 else if (proj == pn_Mod_M)
562 get_irn_pinned(n) == op_pin_state_pinned,
563 "Memory Proj from unpinned Div", 0);
568 * verify a Proj(Cmp) node
570 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p)
572 ir_mode *mode = get_irn_mode(p);
573 long proj = get_Proj_proj(p);
577 (proj >= 0 && proj <= 15 && mode == mode_b),
578 "wrong Proj from Cmp", 0,
579 show_proj_failure(p);
582 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
583 "unordered Proj for non-float Cmp", 0,
584 show_proj_failure(p);
590 * verify a Proj(Load) node
592 static int verify_node_Proj_Load(ir_node *n, ir_node *p)
594 ir_mode *mode = get_irn_mode(p);
595 long proj = get_Proj_proj(p);
597 if (proj == pn_Load_res) {
598 ir_node *ptr = get_Load_ptr(n);
599 ir_entity *ent = get_ptr_entity(ptr);
600 ir_graph *irg = get_irn_irg(n);
602 if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
603 /* do NOT check this for lowered phases, see comment on Store */
605 (mode == get_type_mode(get_entity_type(ent))),
606 "wrong data Proj from Load, entity type_mode failed", 0,
607 show_proj_failure_ent(p, ent);
612 mode_is_data(mode) && mode == get_Load_mode(n),
613 "wrong data Proj from Load", 0,
614 show_proj_failure(p);
621 (proj == pn_Load_M && mode == mode_M) ||
622 (proj == pn_Load_X_regular && mode == mode_X) ||
623 (proj == pn_Load_X_except && mode == mode_X)
625 "wrong Proj from Load", 0,
626 show_proj_failure(p);
629 if (proj == pn_Load_X_regular) {
631 get_irn_pinned(n) == op_pin_state_pinned,
632 "Regular Proj from unpinned Load", 0);
633 } else if (proj == pn_Load_X_except) {
635 get_irn_pinned(n) == op_pin_state_pinned,
636 "Exception Proj from unpinned Load", 0);
642 * verify a Proj(Store) node
644 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
646 ir_mode *mode = get_irn_mode(p);
647 long proj = get_Proj_proj(p);
651 (proj == pn_Store_M && mode == mode_M) ||
652 (proj == pn_Store_X_regular && mode == mode_X) ||
653 (proj == pn_Store_X_except && mode == mode_X)
655 "wrong Proj from Store", 0,
656 show_proj_failure(p);
658 if (proj == pn_Store_X_regular) {
660 get_irn_pinned(n) == op_pin_state_pinned,
661 "Regular Proj from unpinned Store", 0);
662 } else if (proj == pn_Store_X_except) {
664 get_irn_pinned(n) == op_pin_state_pinned,
665 "Exception Proj from unpinned Store", 0);
671 * verify a Proj(Alloc) node
673 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
675 ir_mode *mode = get_irn_mode(p);
676 long proj = get_Proj_proj(p);
681 (proj == pn_Alloc_M && mode == mode_M) ||
682 (proj == pn_Alloc_X_regular && mode == mode_X) ||
683 (proj == pn_Alloc_X_except && mode == mode_X) ||
684 (proj == pn_Alloc_res && mode_is_reference(mode))
686 "wrong Proj from Alloc", 0,
687 show_proj_failure(p);
693 * verify a Proj(Proj) node
695 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
697 ir_mode *mode = get_irn_mode(p);
698 long proj = get_Proj_proj(p);
699 long nr = get_Proj_proj(pred);
700 ir_type *mt; /* A method type */
702 pred = skip_Id(get_Proj_pred(pred));
703 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
705 switch (get_irn_opcode(pred)) {
707 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
709 if (nr == pn_Start_T_args) {
711 (proj >= 0 && mode_is_datab(mode)),
712 "wrong Proj from Proj from Start", 0);
714 (proj < get_method_n_params(mt)),
715 "More Projs for args than args in type", 0
717 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
718 /* value argument */ break;
720 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
722 (mode == get_type_mode(get_method_param_type(mt, proj))),
723 "Mode of Proj from Start doesn't match mode of param type.", 0,
724 show_proj_mode_failure(p, get_method_param_type(mt, proj));
733 (proj >= 0 && mode_is_datab(mode)),
734 "wrong Proj from Proj from Call", 0);
735 mt = get_Call_type(pred);
736 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
737 "wrong call type on call", 0);
739 (proj < get_method_n_ress(mt)),
740 "More Projs for results than results in type.", 0);
741 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
742 /* value result */ break;
745 (mode == get_type_mode(get_method_res_type(mt, proj))),
746 "Mode of Proj from Call doesn't match mode of result type.", 0);
755 /* hmm, optimization did not remove it */
759 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
766 * verify a Proj(Tuple) node
768 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
777 * verify a Proj(CopyB) node
779 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
781 ir_mode *mode = get_irn_mode(p);
782 long proj = get_Proj_proj(p);
786 (proj == pn_CopyB_M && mode == mode_M) ||
787 (proj == pn_CopyB_X_regular && mode == mode_X) ||
788 (proj == pn_CopyB_X_except && mode == mode_X)
790 "wrong Proj from CopyB", 0,
791 show_proj_failure(p);
793 if (proj == pn_CopyB_X_regular)
795 get_irn_pinned(n) == op_pin_state_pinned,
796 "Regular Proj from unpinned CopyB", 0);
797 else if (proj == pn_CopyB_X_except)
799 get_irn_pinned(n) == op_pin_state_pinned,
800 "Exception Proj from unpinned CopyB", 0);
805 * verify a Proj(Bound) node
807 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
809 ir_mode *mode = get_irn_mode(p);
810 long proj = get_Proj_proj(p);
812 /* ignore Bound checks of Bad */
813 if (is_Bad(get_Bound_index(n)))
817 (proj == pn_Bound_M && mode == mode_M) ||
818 (proj == pn_Bound_X_regular && mode == mode_X) ||
819 (proj == pn_Bound_X_except && mode == mode_X) ||
820 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
822 "wrong Proj from Bound", 0,
823 show_proj_failure(p);
831 static int verify_node_Proj(ir_node *p, ir_graph *irg)
836 pred = skip_Id(get_Proj_pred(p));
837 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
838 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);
840 op = get_irn_op(pred);
842 if (op->ops.verify_proj_node)
843 return op->ops.verify_proj_node(pred, p);
850 * verify a Block node
852 static int verify_node_Block(ir_node *n, ir_graph *irg)
856 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
857 ir_node *pred = get_Block_cfgpred(n, i);
859 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
860 "Block node must have a mode_X predecessor", 0);
863 if (n == get_irg_start_block(irg)) {
864 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
867 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
868 /* End block may only have Return, Raise or fragile ops as preds. */
869 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
870 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
871 if (is_Proj(pred) || is_Tuple(pred))
872 break; /* We can not test properly. How many tuples are there? */
880 "End Block node", 0);
882 /* irg attr must == graph we are in. */
883 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
888 * verify a Start node
890 static int verify_node_Start(ir_node *n, ir_graph *irg)
892 ir_mode *mymode = get_irn_mode(n);
896 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
897 mymode == mode_T, "Start node", 0
905 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
907 ir_mode *mymode = get_irn_mode(n);
912 mymode == mode_X, "Jmp node", 0
918 * verify an IJmp node
920 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
922 ir_mode *mymode = get_irn_mode(n);
923 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
927 /* IJmp: BB x ref --> X */
928 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
936 static int verify_node_Cond(ir_node *n, ir_graph *irg)
938 ir_mode *mymode = get_irn_mode(n);
939 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
943 /* Cond: BB x b --> X x X */
944 (op1mode == mode_b ||
945 /* Cond: BB x int --> X^n */
946 mode_is_int(op1mode) ), "Cond node", 0
948 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
954 * verify a Return node
956 static int verify_node_Return(ir_node *n, ir_graph *irg)
959 ir_mode *mymode = get_irn_mode(n);
960 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
963 /* Return: BB x M x data1 x ... x datan --> X */
965 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
967 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
968 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
970 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
971 /* Compare returned results with result types of method type */
972 mt = get_entity_type(get_irg_entity(irg));
973 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
974 "Number of results for Return doesn't match number of results in type.", 0,
975 show_return_nres(irg, n, mt););
976 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
977 ir_type *res_type = get_method_res_type(mt, i);
979 if (get_irg_phase_state(irg) != phase_backend) {
980 if (is_atomic_type(res_type)) {
982 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
983 "Mode of result for Return doesn't match mode of result type.", 0,
984 show_return_modes(irg, n, mt, i);
988 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
989 "Mode of result for Return doesn't match mode of result type.", 0,
990 show_return_modes(irg, n, mt, i);
999 * verify a Raise node
1001 static int verify_node_Raise(ir_node *n, ir_graph *irg)
1003 ir_mode *mymode = get_irn_mode(n);
1004 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1005 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1009 /* Sel: BB x M x ref --> X x M */
1010 op1mode == mode_M && mode_is_reference(op2mode) &&
1011 mymode == mode_T, "Raise node", 0
1017 * verify a Const node
1019 static int verify_node_Const(ir_node *n, ir_graph *irg)
1021 ir_mode *mymode = get_irn_mode(n);
1025 /* Const: BB --> data */
1026 (mode_is_data(mymode) ||
1027 mymode == mode_b) /* we want boolean constants for static evaluation */
1028 ,"Const node", 0 /* of Cmp. */
1031 /* the modes of the constant and teh tarval must match */
1032 mymode == get_tarval_mode(get_Const_tarval(n)),
1033 "Const node, tarval and node mode mismatch", 0
1039 * verify a SymConst node
1041 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
1043 ir_mode *mymode = get_irn_mode(n);
1047 /* SymConst: BB --> int*/
1048 (mode_is_int(mymode) ||
1049 /* SymConst: BB --> ref */
1050 mode_is_reference(mymode))
1051 ,"SymConst node", 0);
1058 static int verify_node_Sel(ir_node *n, ir_graph *irg)
1061 ir_mode *mymode = get_irn_mode(n);
1062 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1063 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1068 /* Sel: BB x M x ref x int^n --> ref */
1069 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1070 "Sel node", 0, show_node_failure(n)
1073 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1074 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1076 ent = get_Sel_entity(n);
1077 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1082 * verify an InstOf node
1084 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
1086 ir_mode *mymode = get_irn_mode(n);
1087 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1090 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1091 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1096 * Check if the pinned state is right.
1098 static int verify_right_pinned(ir_node *n)
1102 if (get_irn_pinned(n) == op_pin_state_pinned)
1104 mem = get_Call_mem(n);
1106 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1107 if (is_NoMem(mem) || is_Pin(mem))
1113 * verify a Call node
1115 static int verify_node_Call(ir_node *n, ir_graph *irg)
1117 ir_mode *mymode = get_irn_mode(n);
1118 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1119 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1124 /* Call: BB x M x ref x data1 x ... x datan
1125 --> M x datan+1 x ... x data n+m */
1126 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1128 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1129 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1131 mt = get_Call_type(n);
1132 if (get_unknown_type() == mt) {
1136 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1137 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1140 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1141 /* Compare arguments of node with those of type */
1143 if (get_method_variadicity(mt) == variadicity_variadic) {
1145 get_Call_n_params(n) >= get_method_n_params(mt),
1146 "Number of args for Call doesn't match number of args in variadic type.",
1148 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1149 n, get_Call_n_params(n), get_method_n_params(mt));
1153 get_Call_n_params(n) == get_method_n_params(mt),
1154 "Number of args for Call doesn't match number of args in non variadic type.",
1156 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1157 n, get_Call_n_params(n), get_method_n_params(mt));
1161 for (i = 0; i < get_method_n_params(mt); i++) {
1162 ir_type *t = get_method_param_type(mt, i);
1164 if (get_irg_phase_state(irg) != phase_backend) {
1165 if (is_atomic_type(t)) {
1167 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1168 "Mode of arg for Call doesn't match mode of arg type.", 0,
1169 show_call_param(n, mt);
1172 /* call with a compound type, mode must be reference */
1174 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1175 "Mode of arg for Call doesn't match mode of arg type.", 0,
1176 show_call_param(n, mt);
1183 if (Call_has_callees(n)) {
1184 for (i = 0; i < get_Call_n_callees(n); i++) {
1185 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1193 * verify an Add node
1195 static int verify_node_Add(ir_node *n, ir_graph *irg)
1197 ir_mode *mymode = get_irn_mode(n);
1198 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1199 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1204 /* common Add: BB x numP x numP --> numP */
1205 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1206 /* Pointer Add: BB x ref x int --> ref */
1207 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1208 /* Pointer Add: BB x int x ref --> ref */
1209 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1212 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1213 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1214 "/* Pointer Add: BB x int x ref --> ref */");
1222 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1224 ir_mode *mymode = get_irn_mode(n);
1225 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1226 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1231 /* common Sub: BB x numP x numP --> numP */
1232 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1233 /* Pointer Sub: BB x ref x int --> ref */
1234 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1235 /* Pointer Sub: BB x ref x ref --> int */
1236 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1239 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1240 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1241 "/* Pointer Sub: BB x ref x ref --> int */" );
1247 * verify a Minus node
1249 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1251 ir_mode *mymode = get_irn_mode(n);
1252 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1256 /* Minus: BB x num --> num */
1257 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1258 show_unop_failure(n , "/* Minus: BB x num --> num */");
1266 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1268 ir_mode *mymode = get_irn_mode(n);
1269 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1270 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1275 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1276 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1277 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1278 /* Mul: BB x float x float --> float */
1279 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1282 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1283 "/* Mul: BB x float x float --> float */");
1289 * verify a Mulh node
1291 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1293 ir_mode *mymode = get_irn_mode(n);
1294 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1295 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1300 /* Mulh: BB x int x int --> int */
1301 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1304 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1310 * verify a Quot node
1312 static int verify_node_Quot(ir_node *n, ir_graph *irg)
1314 ir_mode *mymode = get_irn_mode(n);
1315 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1316 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1317 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1321 /* Quot: BB x M x float x float --> M x X x float */
1322 op1mode == mode_M && op2mode == op3mode &&
1323 get_mode_sort(op2mode) == irms_float_number &&
1326 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1332 * verify a DivMod node
1334 static int verify_node_DivMod(ir_node *n, ir_graph *irg)
1336 ir_mode *mymode = get_irn_mode(n);
1337 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1338 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1339 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1343 /* DivMod: BB x M x int x int --> M x X x int x int */
1344 op1mode == mode_M &&
1345 mode_is_int(op2mode) &&
1346 op3mode == op2mode &&
1356 static int verify_node_Div(ir_node *n, ir_graph *irg)
1358 ir_mode *mymode = get_irn_mode(n);
1359 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1360 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1361 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1365 /* Div: BB x M x int x int --> M x X x int */
1366 op1mode == mode_M &&
1367 op2mode == op3mode &&
1368 mode_is_int(op2mode) &&
1378 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1380 ir_mode *mymode = get_irn_mode(n);
1381 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1382 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1383 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1387 /* Mod: BB x M x int x int --> M x X x int */
1388 op1mode == mode_M &&
1389 op2mode == op3mode &&
1390 mode_is_int(op2mode) &&
1398 * verify a logical And, Or, Eor node
1400 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1402 ir_mode *mymode = get_irn_mode(n);
1403 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1404 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1408 /* And or Or or Eor: BB x int x int --> int */
1409 (mode_is_int(mymode) || mymode == mode_b) &&
1410 op2mode == op1mode &&
1412 "And, Or or Eor node", 0,
1413 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1418 #define verify_node_And verify_node_Logic
1419 #define verify_node_Or verify_node_Logic
1420 #define verify_node_Eor verify_node_Logic
1425 static int verify_node_Not(ir_node *n, ir_graph *irg)
1427 ir_mode *mymode = get_irn_mode(n);
1428 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1432 /* Not: BB x int --> int */
1433 (mode_is_int(mymode) || mymode == mode_b) &&
1436 show_unop_failure(n, "/* Not: BB x int --> int */");
1444 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1446 ir_mode *mymode = get_irn_mode(n);
1447 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1448 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1452 /* Cmp: BB x datab x datab --> b16 */
1453 mode_is_datab(op1mode) &&
1454 op2mode == op1mode &&
1457 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1463 * verify a Shift node
1465 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1467 ir_mode *mymode = get_irn_mode(n);
1468 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1469 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1473 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1474 mode_is_int(op1mode) &&
1475 mode_is_int(op2mode) &&
1476 !mode_is_signed(op2mode) &&
1478 "Shl, Shr or Shrs node", 0,
1479 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1484 #define verify_node_Shl verify_node_Shift
1485 #define verify_node_Shr verify_node_Shift
1486 #define verify_node_Shrs verify_node_Shift
1489 * verify a Rotl node
1491 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1493 ir_mode *mymode = get_irn_mode(n);
1494 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1495 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1499 /* Rotl: BB x int x int --> int */
1500 mode_is_int(op1mode) &&
1501 mode_is_int(op2mode) &&
1504 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1510 * verify a Conv node
1512 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1514 ir_mode *mymode = get_irn_mode(n);
1515 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1519 is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
1520 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1522 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1528 * verify a Cast node
1530 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1532 ir_mode *mymode = get_irn_mode(n);
1533 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1537 /* Conv: BB x datab1 --> datab2 */
1538 mode_is_data(op1mode) && op1mode == mymode,
1540 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1548 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1550 ir_mode *mymode = get_irn_mode(n);
1551 ir_node *block = get_nodes_block(n);
1555 /* a Phi node MUST have the same number of inputs as its block
1556 * Exception is a phi with 0 inputs which is used when (re)constructing the
1558 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1560 get_irn_arity(n) == get_irn_arity(block),
1561 "wrong number of inputs in Phi node", 0,
1562 show_phi_inputs(n, block);
1566 /* Phi: BB x dataM^n --> dataM */
1567 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1568 ir_node *pred = get_Phi_pred(n, i);
1569 if (!is_Bad(pred)) {
1571 get_irn_mode(pred) == mymode,
1573 show_phi_failure(n, pred, i);
1577 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1579 if (mymode == mode_M) {
1580 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1582 ir_node *pred_i = get_Phi_pred(n, i);
1586 for (j = i - 1; j >= 0; --j) {
1587 ir_node *pred_j = get_Phi_pred(n, j);
1592 /* currently this checks fails for blocks with exception
1593 outputs (and these are NOT basic blocks). So it is disabled yet. */
1595 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1596 "At least two different PhiM predecessors are in the same block",
1598 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1608 * verify a Load node
1610 static int verify_node_Load(ir_node *n, ir_graph *irg)
1612 ir_mode *mymode = get_irn_mode(n);
1613 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1614 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1616 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1617 if (get_irg_phase_state(irg) != phase_backend) {
1618 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1620 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1623 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1624 * (Proj (Proj))) sometimes ...
1626 * interprete.c:ai_eval seems to assume that this happens, too
1628 * obset.c:get_abstval_any can't deal with this if the load has
1632 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1633 assert ((NULL != ent) || (mymode != mode_T));
1641 * verify a Store node
1643 static int verify_node_Store(ir_node *n, ir_graph *irg)
1647 ir_mode *mymode = get_irn_mode(n);
1648 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1649 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1650 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1652 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1653 if (get_irg_phase_state(irg) != phase_backend) {
1654 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1656 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1658 target = get_ptr_entity(get_Store_ptr(n));
1659 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1661 * If lowered code, any Sels that add 0 may be removed, causing
1662 * an direct access to entities of array or compound type.
1663 * Prevent this by checking the phase.
1665 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1673 * verify an Alloc node
1675 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1677 ir_mode *mymode = get_irn_mode(n);
1678 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1679 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1683 /* Alloc: BB x M x int_u --> M x X x ref */
1684 op1mode == mode_M &&
1685 mode_is_int(op2mode) &&
1686 !mode_is_signed(op2mode) &&
1689 show_node_failure(n);
1695 * verify a Free node
1697 static int verify_node_Free(ir_node *n, ir_graph *irg)
1699 ir_mode *mymode = get_irn_mode(n);
1700 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1701 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1702 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1706 /* Free: BB x M x ref x int_u --> M */
1707 op1mode == mode_M && mode_is_reference(op2mode) &&
1708 mode_is_int(op3mode) &&
1709 !mode_is_signed(op3mode) &&
1712 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1718 * verify a Sync node
1720 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1723 ir_mode *mymode = get_irn_mode(n);
1726 /* Sync: BB x M^n --> M */
1727 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1728 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1730 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1735 * verify a Confirm node
1737 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1739 ir_mode *mymode = get_irn_mode(n);
1740 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1741 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1745 /* Confirm: BB x T x T --> T */
1746 op1mode == mymode &&
1749 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1757 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1759 ir_mode *mymode = get_irn_mode(n);
1760 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1761 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1762 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1766 /* Mux: BB x b x datab x datab --> datab */
1767 op1mode == mode_b &&
1768 op2mode == mymode &&
1769 op3mode == mymode &&
1770 mode_is_datab(mymode),
1777 * verify a CopyB node
1779 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1781 ir_mode *mymode = get_irn_mode(n);
1782 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1783 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1784 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1785 ir_type *t = get_CopyB_type(n);
1787 /* CopyB: BB x M x ref x ref --> M x X */
1788 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1789 if (get_irg_phase_state(irg) != phase_backend) {
1790 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1795 is_compound_type(t) || is_Array_type(t),
1796 "CopyB node should copy compound types only", 0 );
1798 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1799 This should happen RARELY, as CopyB COPIES MEMORY */
1800 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1805 * verify a Bound node
1807 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1809 ir_mode *mymode = get_irn_mode(n);
1810 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1811 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1812 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1813 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1816 /* Bound: BB x M x int x int x int --> M x X */
1819 op1mode == mode_M &&
1820 op2mode == op3mode &&
1821 op3mode == op4mode &&
1822 mode_is_int(op3mode),
1829 * For each usage of a node, it is checked, if the block of the
1830 * node dominates the block of the usage (for phis: the predecessor
1831 * block of the phi for the corresponding edge).
1833 * @return non-zero on success, 0 on dominance error
1835 static int check_dominance_for_node(ir_node *use)
1837 /* This won't work for blocks and the end node */
1838 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1840 ir_node *bl = get_nodes_block(use);
1842 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1843 ir_node *def = get_irn_n(use, i);
1844 ir_node *def_bl = get_nodes_block(def);
1845 ir_node *use_bl = bl;
1848 /* ignore dead definition blocks, will be removed */
1849 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1853 use_bl = get_Block_cfgpred_block(bl, i);
1855 /* ignore dead use blocks, will be removed */
1856 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1859 irg = get_irn_irg(use);
1861 block_dominates(def_bl, use_bl),
1862 "the definition of a value used violates the dominance property", 0,
1864 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1865 irg, def_bl, def, use_bl, use, i
1873 /* Tests the modes of n and its predecessors. */
1874 int irn_verify_irg(ir_node *n, ir_graph *irg)
1879 if (!get_node_verification_mode())
1883 * do NOT check placement in interprocedural view, as we don't always
1884 * know the "right" graph ...
1888 /* this is an expensive check for large graphs (it has a quadratic
1889 * runtime but with a small constant); so do NOT run it in release mode
1892 node_is_in_irgs_storage(irg, n),
1893 "Node is not stored on proper IR graph!", 0,
1894 show_node_on_graph(irg, n);
1897 assert(get_irn_irg(n) == irg);
1899 unsigned idx = get_irn_idx(n);
1900 ir_node *node_from_map = get_idx_irn(irg, idx);
1901 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1902 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1907 /* We don't want to test nodes whose predecessors are Bad,
1908 as we would have to special case that for each operation. */
1909 if (op != op_Phi && op != op_Block) {
1910 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1911 if (is_Bad(get_irn_n(n, i)))
1916 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1917 op_pin_state state = get_irn_pinned(n);
1919 state == op_pin_state_floats ||
1920 state == op_pin_state_pinned,
1921 "invalid pin state", 0,
1922 ir_printf("node %+F", n));
1925 if (op->ops.verify_node)
1926 return op->ops.verify_node(n, irg);
1932 int irn_verify(ir_node *n)
1934 #ifdef DEBUG_libfirm
1935 return irn_verify_irg(n, get_irn_irg(n));
1942 /*-----------------------------------------------------------------*/
1943 /* Verify the whole graph. */
1944 /*-----------------------------------------------------------------*/
1946 #ifdef DEBUG_libfirm
1948 * Walker to check every node
1950 static void verify_wrap(ir_node *node, void *env)
1952 int *res = (int*)env;
1953 *res = irn_verify_irg(node, get_irn_irg(node));
1957 * Walker to check every node including SSA property.
1958 * Only called if dominance info is available.
1960 static void verify_wrap_ssa(ir_node *node, void *env)
1962 int *res = (int*)env;
1964 *res = irn_verify_irg(node, get_irn_irg(node));
1966 *res = check_dominance_for_node(node);
1970 #endif /* DEBUG_libfirm */
1973 * Calls irn_verify for each node in irg.
1974 * Graph must be in state "op_pin_state_pinned".
1975 * If dominance info is available, check the SSA property.
1977 int irg_verify(ir_graph *irg, unsigned flags)
1980 #ifdef DEBUG_libfirm
1983 last_irg_error = NULL;
1986 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1988 if (flags & VERIFY_ENFORCE_SSA)
1993 get_irg_dom_state(irg) == dom_consistent &&
1994 get_irg_pinned(irg) == op_pin_state_pinned ? verify_wrap_ssa : verify_wrap,
1998 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1999 ir_entity *ent = get_irg_entity(irg);
2002 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2004 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2010 #endif /* DEBUG_libfirm */
2015 typedef struct pass_t {
2016 ir_graph_pass_t pass;
2021 * Wrapper to irg_verify to be run as an ir_graph pass.
2023 static int irg_verify_wrapper(ir_graph *irg, void *context)
2025 pass_t *pass = (pass_t*)context;
2026 irg_verify(irg, pass->flags);
2027 /* do NOT rerun the pass if verify is ok :-) */
2031 /* Creates an ir_graph pass for irg_verify(). */
2032 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2034 pass_t *pass = XMALLOCZ(pass_t);
2036 def_graph_pass_constructor(
2037 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2039 /* neither dump for verify */
2040 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2041 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2043 pass->flags = flags;
2047 /* create a verify pass */
2048 int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
2051 firm_verification_t old = get_node_verification_mode();
2053 firm_verify_failure_msg = NULL;
2054 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2055 res = irn_verify_irg(n, irg);
2056 if (res && get_irg_dom_state(irg) == dom_consistent &&
2057 get_irg_pinned(irg) == op_pin_state_pinned)
2058 res = check_dominance_for_node(n);
2059 do_node_verification(old);
2060 *bad_string = firm_verify_failure_msg;
2065 typedef struct verify_bad_env_t {
2071 * Pre-Walker: check Bad predecessors of node.
2073 static void check_bads(ir_node *node, void *env)
2075 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2076 int i, arity = get_irn_arity(node);
2077 ir_graph *irg = get_irn_irg(node);
2079 if (is_Block(node)) {
2080 if ((venv->flags & BAD_CF) == 0) {
2082 /* check for Bad Block predecessor */
2083 for (i = 0; i < arity; ++i) {
2084 ir_node *pred = get_irn_n(node, i);
2087 venv->res |= BAD_CF;
2089 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2090 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2092 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2093 dump_ir_graph(irg, "-assert");
2094 assert(0 && "Bad CF detected");
2100 if ((venv->flags & BAD_BLOCK) == 0) {
2102 /* check for Bad Block */
2103 if (is_Bad(get_nodes_block(node))) {
2104 venv->res |= BAD_BLOCK;
2106 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2107 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2109 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2110 dump_ir_graph(irg, "-assert");
2111 assert(0 && "Bad CF detected");
2116 if ((venv->flags & TUPLE) == 0) {
2117 if (is_Tuple(node)) {
2120 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2121 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2123 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2124 dump_ir_graph(irg, "-assert");
2125 assert(0 && "Tuple detected");
2130 for (i = 0; i < arity; ++i) {
2131 ir_node *pred = get_irn_n(node, i);
2134 /* check for Phi with Bad inputs */
2135 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2136 if (venv->flags & BAD_CF)
2139 venv->res |= BAD_CF;
2141 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2142 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2144 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2145 dump_ir_graph(irg, "-assert");
2146 assert(0 && "Bad CF detected");
2151 /* Bad node input */
2152 if ((venv->flags & BAD_DF) == 0) {
2153 venv->res |= BAD_DF;
2155 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2156 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2158 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2159 dump_ir_graph(irg, "-assert");
2160 assert(0 && "Bad NON-CF detected");
2169 * verify occurrence of bad nodes
2171 int irg_verify_bads(ir_graph *irg, int flags)
2173 verify_bad_env_t env;
2178 irg_walk_graph(irg, check_bads, NULL, &env);
2184 * set the default verify operation
2186 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2190 ops->verify_node = verify_node_##a; \
2244 ops->verify_proj_node = verify_node_Proj_##a; \