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);
101 * Prints a failure for a Node
103 static void show_node_failure(ir_node *n)
105 show_entity_failure(n);
106 fprintf(stderr, " node %ld %s%s\n" ,
108 get_irn_opname(n), get_irn_modename(n)
113 * Prints a failure message for a binop
115 static void show_binop_failure(ir_node *n, const char *text)
117 ir_node *left = get_binop_left(n);
118 ir_node *right = get_binop_right(n);
120 show_entity_failure(n);
121 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
123 get_irn_opname(n), get_irn_modename(n),
124 get_irn_opname(left), get_irn_modename(left),
125 get_irn_opname(right), get_irn_modename(right),
130 * Prints a failure message for an unop
132 static void show_unop_failure(ir_node *n, const char *text)
134 ir_node *op = get_unop_op(n);
136 show_entity_failure(n);
137 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
139 get_irn_opname(n), get_irn_modename(n),
140 get_irn_opname(op), get_irn_modename(op),
145 * Prints a failure message for an op with 3 operands
147 static void show_triop_failure(ir_node *n, const char *text)
149 ir_node *op0 = get_irn_n(n, 0);
150 ir_node *op1 = get_irn_n(n, 1);
151 ir_node *op2 = get_irn_n(n, 2);
153 show_entity_failure(n);
154 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
156 get_irn_opname(n), get_irn_modename(n),
157 get_irn_opname(op0), get_irn_modename(op0),
158 get_irn_opname(op1), get_irn_modename(op1),
159 get_irn_opname(op2), get_irn_modename(op2),
164 * Prints a failure message for a proj
166 static void show_proj_failure(ir_node *n)
168 ir_node *op = get_Proj_pred(n);
169 int proj = get_Proj_proj(n);
171 show_entity_failure(n);
172 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
174 get_irn_opname(n), get_irn_modename(n), proj,
175 get_irn_opname(op), get_irn_modename(op));
179 * Prints a failure message for a proj from Start
181 static void show_proj_mode_failure(ir_node *n, ir_type *ty)
183 long proj = get_Proj_proj(n);
184 ir_mode *m = get_type_mode(ty);
186 ir_print_type(type_name, sizeof(type_name), ty);
188 show_entity_failure(n);
189 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
194 get_mode_name_ex(m));
198 * Prints a failure message for a proj
200 static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
202 ir_node *op = get_Proj_pred(n);
203 int proj = get_Proj_proj(n);
204 ir_mode *m = get_type_mode(get_entity_type(ent));
206 ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
208 show_entity_failure(n);
209 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
211 get_irn_opname(n), get_irn_modename(n), proj,
212 get_irn_opname(op), get_irn_modename(op),
213 get_entity_name(ent), type_name,
214 get_mode_name_ex(m));
218 * Show a node and a graph
220 static void show_node_on_graph(ir_graph *irg, ir_node *n)
222 ir_fprintf(stderr, "\nFIRM: irn_verify_irg() of %+F, node %+F\n", irg, n);
226 * Show call parameters
228 static void show_call_param(ir_node *n, ir_type *mt)
232 ir_print_type(type_name, sizeof(type_name), mt);
234 show_entity_failure(n);
235 fprintf(stderr, " Call type-check failed: %s(", type_name);
236 for (i = 0; i < get_method_n_params(mt); ++i) {
237 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
239 fprintf(stderr, ") != CALL(");
241 for (i = 0; i < get_Call_n_params(n); ++i) {
242 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
244 fprintf(stderr, ")\n");
250 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
252 ir_entity *ent = get_irg_entity(irg);
254 show_entity_failure(n);
255 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
256 get_irn_node_nr(n), get_entity_name(ent),
257 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
258 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
263 * Show return number of results
265 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
267 ir_entity *ent = get_irg_entity(irg);
269 show_entity_failure(n);
270 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
271 get_irn_node_nr(n), get_entity_name(ent),
272 get_Return_n_ress(n), get_method_n_ress(mt));
278 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
281 show_entity_failure(phi);
282 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
283 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
284 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
290 static void show_phi_inputs(ir_node *phi, ir_node *block)
292 show_entity_failure(phi);
293 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
294 get_irn_node_nr(phi), get_irn_arity(phi),
295 get_irn_node_nr(block), get_irn_arity(block));
298 #endif /* #ifndef NDEBUG */
301 * If the address is Sel or SymConst, return the entity.
303 * @param ptr the node representing the address
305 static ir_entity *get_ptr_entity(ir_node *ptr)
308 return get_Sel_entity(ptr);
309 } else if (is_SymConst_addr_ent(ptr)) {
310 return get_SymConst_entity(ptr);
316 * verify a Proj(Start) node
318 static int verify_node_Proj_Start(ir_node *n, ir_node *p)
320 ir_mode *mode = get_irn_mode(p);
321 long proj = get_Proj_proj(p);
326 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
327 (proj == pn_Start_M && mode == mode_M) ||
328 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
329 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
330 (proj == pn_Start_T_args && mode == mode_T)
332 "wrong Proj from Start", 0,
333 show_proj_failure(p);
339 * verify a Proj(Cond) node
341 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p)
343 ir_mode *mode = get_irn_mode(p);
344 long proj = get_Proj_proj(p);
348 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
349 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
350 is_Bad(get_Cond_selector(pred)) /* rare */
352 "wrong Proj from Cond", 0,
353 show_proj_failure(p);
359 * verify a Proj(Raise) node
361 static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
363 ir_mode *mode = get_irn_mode(p);
364 long proj = get_Proj_proj(p);
368 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
369 "wrong Proj from Raise", 0,
370 show_proj_failure(p);
376 * verify a Proj(InstOf) node
378 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p)
380 ir_mode *mode = get_irn_mode(p);
381 long proj = get_Proj_proj(p);
386 (proj == pn_InstOf_M && mode == mode_M) ||
387 (proj == pn_InstOf_X_regular && mode == mode_X) ||
388 (proj == pn_InstOf_X_except && mode == mode_X) ||
389 (proj == pn_InstOf_res && mode_is_reference(mode))
391 "wrong Proj from InstOf", 0,
392 show_proj_failure(p);
398 * verify a Proj(Call) node
400 static int verify_node_Proj_Call(ir_node *n, ir_node *p)
402 ir_mode *mode = get_irn_mode(p);
403 long proj = get_Proj_proj(p);
407 (proj == pn_Call_M && mode == mode_M) ||
408 (proj == pn_Call_X_regular && mode == mode_X) ||
409 (proj == pn_Call_X_except && mode == mode_X) ||
410 (proj == pn_Call_T_result && mode == mode_T) ||
411 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
413 "wrong Proj from Call", 0,
414 show_proj_failure(p);
416 /* if we have exception flow, we must have a real Memory input */
417 if (proj == pn_Call_X_regular)
419 !is_NoMem(get_Call_mem(n)),
420 "Regular Proj from FunctionCall", 0);
421 else if (proj == pn_Call_X_except)
423 !is_NoMem(get_Call_mem(n)),
424 "Exception Proj from FunctionCall", 0);
429 * verify a Proj(Quot) node
431 static int verify_node_Proj_Quot(ir_node *n, ir_node *p)
433 ir_mode *mode = get_irn_mode(p);
434 long proj = get_Proj_proj(p);
438 (proj == pn_Quot_M && mode == mode_M) ||
439 (proj == pn_Quot_X_regular && mode == mode_X) ||
440 (proj == pn_Quot_X_except && mode == mode_X) ||
441 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
443 "wrong Proj from Quot", 0,
444 show_proj_failure(p);
446 if (proj == pn_Quot_X_regular)
448 get_irn_pinned(n) == op_pin_state_pinned,
449 "Regular Proj from unpinned Quot", 0);
450 else if (proj == pn_Quot_X_except)
452 get_irn_pinned(n) == op_pin_state_pinned,
453 "Exception Proj from unpinned Quot", 0);
454 else if (proj == pn_Quot_M)
456 get_irn_pinned(n) == op_pin_state_pinned,
457 "Memory Proj from unpinned Quot", 0);
462 * verify a Proj(DivMod) node
464 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p)
466 ir_mode *mode = get_irn_mode(p);
467 long proj = get_Proj_proj(p);
471 (proj == pn_DivMod_M && mode == mode_M) ||
472 (proj == pn_DivMod_X_regular && mode == mode_X) ||
473 (proj == pn_DivMod_X_except && mode == mode_X) ||
474 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
475 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
477 "wrong Proj from DivMod", 0,
478 show_proj_failure(p);
480 if (proj == pn_DivMod_X_regular)
482 get_irn_pinned(n) == op_pin_state_pinned,
483 "Regular Proj from unpinned DivMod", 0);
484 else if (proj == pn_DivMod_X_except)
486 get_irn_pinned(n) == op_pin_state_pinned,
487 "Exception Proj from unpinned DivMod", 0);
488 else if (proj == pn_DivMod_M)
490 get_irn_pinned(n) == op_pin_state_pinned,
491 "Memory Proj from unpinned DivMod", 0);
496 * verify a Proj(Div) node
498 static int verify_node_Proj_Div(ir_node *n, ir_node *p)
500 ir_mode *mode = get_irn_mode(p);
501 long proj = get_Proj_proj(p);
505 (proj == pn_Div_M && mode == mode_M) ||
506 (proj == pn_Div_X_regular && mode == mode_X) ||
507 (proj == pn_Div_X_except && mode == mode_X) ||
508 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
510 "wrong Proj from Div", 0,
511 show_proj_failure(p);
513 if (proj == pn_Div_X_regular)
515 get_irn_pinned(n) == op_pin_state_pinned,
516 "Regular Proj from unpinned Div", 0);
517 else if (proj == pn_Div_X_except)
519 get_irn_pinned(n) == op_pin_state_pinned,
520 "Exception Proj from unpinned Div", 0);
521 else if (proj == pn_Div_M)
523 get_irn_pinned(n) == op_pin_state_pinned,
524 "Memory Proj from unpinned Div", 0);
529 * verify a Proj(Mod) node
531 static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
533 ir_mode *mode = get_irn_mode(p);
534 long proj = get_Proj_proj(p);
538 (proj == pn_Mod_M && mode == mode_M) ||
539 (proj == pn_Mod_X_regular && mode == mode_X) ||
540 (proj == pn_Mod_X_except && mode == mode_X) ||
541 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
543 "wrong Proj from Mod", 0,
544 show_proj_failure(p);
546 if (proj == pn_Mod_X_regular)
548 get_irn_pinned(n) == op_pin_state_pinned,
549 "Regular Proj from unpinned Mod", 0);
550 else if (proj == pn_Mod_X_except)
552 get_irn_pinned(n) == op_pin_state_pinned,
553 "Exception Proj from unpinned Mod", 0);
554 else if (proj == pn_Mod_M)
556 get_irn_pinned(n) == op_pin_state_pinned,
557 "Memory Proj from unpinned Div", 0);
562 * verify a Proj(Cmp) node
564 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p)
566 ir_mode *mode = get_irn_mode(p);
567 long proj = get_Proj_proj(p);
571 (proj >= 0 && proj <= 15 && mode == mode_b),
572 "wrong Proj from Cmp", 0,
573 show_proj_failure(p);
576 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
577 "unordered Proj for non-float Cmp", 0,
578 show_proj_failure(p);
584 * verify a Proj(Load) node
586 static int verify_node_Proj_Load(ir_node *n, ir_node *p)
588 ir_mode *mode = get_irn_mode(p);
589 long proj = get_Proj_proj(p);
591 if (proj == pn_Load_res) {
592 ir_node *ptr = get_Load_ptr(n);
593 ir_entity *ent = get_ptr_entity(ptr);
594 ir_graph *irg = get_irn_irg(n);
596 if (verify_entities && ent && get_irg_phase_state(irg) == phase_high) {
597 /* do NOT check this for lowered phases, see comment on Store */
599 (mode == get_type_mode(get_entity_type(ent))),
600 "wrong data Proj from Load, entity type_mode failed", 0,
601 show_proj_failure_ent(p, ent);
606 mode_is_data(mode) && mode == get_Load_mode(n),
607 "wrong data Proj from Load", 0,
608 show_proj_failure(p);
615 (proj == pn_Load_M && mode == mode_M) ||
616 (proj == pn_Load_X_regular && mode == mode_X) ||
617 (proj == pn_Load_X_except && mode == mode_X)
619 "wrong Proj from Load", 0,
620 show_proj_failure(p);
623 if (proj == pn_Load_X_regular) {
625 get_irn_pinned(n) == op_pin_state_pinned,
626 "Regular Proj from unpinned Load", 0);
627 } else if (proj == pn_Load_X_except) {
629 get_irn_pinned(n) == op_pin_state_pinned,
630 "Exception Proj from unpinned Load", 0);
636 * verify a Proj(Store) node
638 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
640 ir_mode *mode = get_irn_mode(p);
641 long proj = get_Proj_proj(p);
645 (proj == pn_Store_M && mode == mode_M) ||
646 (proj == pn_Store_X_regular && mode == mode_X) ||
647 (proj == pn_Store_X_except && mode == mode_X)
649 "wrong Proj from Store", 0,
650 show_proj_failure(p);
652 if (proj == pn_Store_X_regular) {
654 get_irn_pinned(n) == op_pin_state_pinned,
655 "Regular Proj from unpinned Store", 0);
656 } else if (proj == pn_Store_X_except) {
658 get_irn_pinned(n) == op_pin_state_pinned,
659 "Exception Proj from unpinned Store", 0);
665 * verify a Proj(Alloc) node
667 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
669 ir_mode *mode = get_irn_mode(p);
670 long proj = get_Proj_proj(p);
675 (proj == pn_Alloc_M && mode == mode_M) ||
676 (proj == pn_Alloc_X_regular && mode == mode_X) ||
677 (proj == pn_Alloc_X_except && mode == mode_X) ||
678 (proj == pn_Alloc_res && mode_is_reference(mode))
680 "wrong Proj from Alloc", 0,
681 show_proj_failure(p);
687 * verify a Proj(Proj) node
689 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
691 ir_mode *mode = get_irn_mode(p);
692 long proj = get_Proj_proj(p);
693 long nr = get_Proj_proj(pred);
694 ir_type *mt; /* A method type */
696 pred = skip_Id(get_Proj_pred(pred));
697 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
699 switch (get_irn_opcode(pred)) {
701 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
703 if (nr == pn_Start_T_args) {
705 (proj >= 0 && mode_is_datab(mode)),
706 "wrong Proj from Proj from Start", 0);
708 (proj < get_method_n_params(mt)),
709 "More Projs for args than args in type", 0
711 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
712 /* value argument */ break;
714 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
716 (mode == get_type_mode(get_method_param_type(mt, proj))),
717 "Mode of Proj from Start doesn't match mode of param type.", 0,
718 show_proj_mode_failure(p, get_method_param_type(mt, proj));
727 (proj >= 0 && mode_is_datab(mode)),
728 "wrong Proj from Proj from Call", 0);
729 mt = get_Call_type(pred);
730 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
731 "wrong call type on call", 0);
733 (proj < get_method_n_ress(mt)),
734 "More Projs for results than results in type.", 0);
735 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
736 /* value result */ break;
739 (mode == get_type_mode(get_method_res_type(mt, proj))),
740 "Mode of Proj from Call doesn't match mode of result type.", 0);
749 /* hmm, optimization did not remove it */
753 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
760 * verify a Proj(Tuple) node
762 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
771 * verify a Proj(CopyB) node
773 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
775 ir_mode *mode = get_irn_mode(p);
776 long proj = get_Proj_proj(p);
780 (proj == pn_CopyB_M && mode == mode_M) ||
781 (proj == pn_CopyB_X_regular && mode == mode_X) ||
782 (proj == pn_CopyB_X_except && mode == mode_X)
784 "wrong Proj from CopyB", 0,
785 show_proj_failure(p);
787 if (proj == pn_CopyB_X_regular)
789 get_irn_pinned(n) == op_pin_state_pinned,
790 "Regular Proj from unpinned CopyB", 0);
791 else if (proj == pn_CopyB_X_except)
793 get_irn_pinned(n) == op_pin_state_pinned,
794 "Exception Proj from unpinned CopyB", 0);
799 * verify a Proj(Bound) node
801 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
803 ir_mode *mode = get_irn_mode(p);
804 long proj = get_Proj_proj(p);
806 /* ignore Bound checks of Bad */
807 if (is_Bad(get_Bound_index(n)))
811 (proj == pn_Bound_M && mode == mode_M) ||
812 (proj == pn_Bound_X_regular && mode == mode_X) ||
813 (proj == pn_Bound_X_except && mode == mode_X) ||
814 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
816 "wrong Proj from Bound", 0,
817 show_proj_failure(p);
825 static int verify_node_Proj(ir_node *p, ir_graph *irg)
830 pred = skip_Id(get_Proj_pred(p));
831 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
832 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);
834 op = get_irn_op(pred);
836 if (op->ops.verify_proj_node)
837 return op->ops.verify_proj_node(pred, p);
844 * verify a Block node
846 static int verify_node_Block(ir_node *n, ir_graph *irg)
850 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
851 ir_node *pred = get_Block_cfgpred(n, i);
853 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
854 "Block node must have a mode_X predecessor", 0);
857 if (n == get_irg_start_block(irg)) {
858 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 0, "Start Block node", 0);
861 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
862 /* End block may only have Return, Raise or fragile ops as preds. */
863 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
864 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
865 if (is_Proj(pred) || is_Tuple(pred))
866 break; /* We can not test properly. How many tuples are there? */
874 "End Block node", 0);
876 /* irg attr must == graph we are in. */
877 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
882 * verify a Start node
884 static int verify_node_Start(ir_node *n, ir_graph *irg)
886 ir_mode *mymode = get_irn_mode(n);
890 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
891 mymode == mode_T, "Start node", 0
899 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
901 ir_mode *mymode = get_irn_mode(n);
906 mymode == mode_X, "Jmp node", 0
912 * verify an IJmp node
914 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
916 ir_mode *mymode = get_irn_mode(n);
917 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
921 /* IJmp: BB x ref --> X */
922 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
930 static int verify_node_Cond(ir_node *n, ir_graph *irg)
932 ir_mode *mymode = get_irn_mode(n);
933 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
937 /* Cond: BB x b --> X x X */
938 (op1mode == mode_b ||
939 /* Cond: BB x int --> X^n */
940 mode_is_int(op1mode) ), "Cond node", 0
942 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
948 * verify a Return node
950 static int verify_node_Return(ir_node *n, ir_graph *irg)
953 ir_mode *mymode = get_irn_mode(n);
954 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
957 /* Return: BB x M x data1 x ... x datan --> X */
959 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
961 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
962 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
964 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
965 /* Compare returned results with result types of method type */
966 mt = get_entity_type(get_irg_entity(irg));
967 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
968 "Number of results for Return doesn't match number of results in type.", 0,
969 show_return_nres(irg, n, mt););
970 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
971 ir_type *res_type = get_method_res_type(mt, i);
973 if (get_irg_phase_state(irg) != phase_backend) {
974 if (is_atomic_type(res_type)) {
976 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
977 "Mode of result for Return doesn't match mode of result type.", 0,
978 show_return_modes(irg, n, mt, i);
982 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
983 "Mode of result for Return doesn't match mode of result type.", 0,
984 show_return_modes(irg, n, mt, i);
993 * verify a Raise node
995 static int verify_node_Raise(ir_node *n, ir_graph *irg)
997 ir_mode *mymode = get_irn_mode(n);
998 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
999 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1003 /* Sel: BB x M x ref --> X x M */
1004 op1mode == mode_M && mode_is_reference(op2mode) &&
1005 mymode == mode_T, "Raise node", 0
1011 * verify a Const node
1013 static int verify_node_Const(ir_node *n, ir_graph *irg)
1015 ir_mode *mymode = get_irn_mode(n);
1019 /* Const: BB --> data */
1020 (mode_is_data(mymode) ||
1021 mymode == mode_b) /* we want boolean constants for static evaluation */
1022 ,"Const node", 0 /* of Cmp. */
1025 /* the modes of the constant and teh tarval must match */
1026 mymode == get_tarval_mode(get_Const_tarval(n)),
1027 "Const node, tarval and node mode mismatch", 0
1033 * verify a SymConst node
1035 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
1037 ir_mode *mymode = get_irn_mode(n);
1041 /* SymConst: BB --> int*/
1042 (mode_is_int(mymode) ||
1043 /* SymConst: BB --> ref */
1044 mode_is_reference(mymode))
1045 ,"SymConst node", 0);
1052 static int verify_node_Sel(ir_node *n, ir_graph *irg)
1055 ir_mode *mymode = get_irn_mode(n);
1056 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1057 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1062 /* Sel: BB x M x ref x int^n --> ref */
1063 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1064 "Sel node", 0, show_node_failure(n)
1067 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1068 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1070 ent = get_Sel_entity(n);
1071 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1076 * verify an InstOf node
1078 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
1080 ir_mode *mymode = get_irn_mode(n);
1081 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1084 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1085 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1090 * Check if the pinned state is right.
1092 static int verify_right_pinned(ir_node *n)
1096 if (get_irn_pinned(n) == op_pin_state_pinned)
1098 mem = get_Call_mem(n);
1100 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1101 if (is_NoMem(mem) || is_Pin(mem))
1107 * verify a Call node
1109 static int verify_node_Call(ir_node *n, ir_graph *irg)
1111 ir_mode *mymode = get_irn_mode(n);
1112 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1113 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1118 /* Call: BB x M x ref x data1 x ... x datan
1119 --> M x datan+1 x ... x data n+m */
1120 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1122 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1123 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1125 mt = get_Call_type(n);
1126 if (get_unknown_type() == mt) {
1130 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1131 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1134 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1135 /* Compare arguments of node with those of type */
1137 if (get_method_variadicity(mt) == variadicity_variadic) {
1139 get_Call_n_params(n) >= get_method_n_params(mt),
1140 "Number of args for Call doesn't match number of args in variadic type.",
1142 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1143 n, get_Call_n_params(n), get_method_n_params(mt));
1147 get_Call_n_params(n) == get_method_n_params(mt),
1148 "Number of args for Call doesn't match number of args in non variadic type.",
1150 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1151 n, get_Call_n_params(n), get_method_n_params(mt));
1155 for (i = 0; i < get_method_n_params(mt); i++) {
1156 ir_type *t = get_method_param_type(mt, i);
1158 if (get_irg_phase_state(irg) != phase_backend) {
1159 if (is_atomic_type(t)) {
1161 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1162 "Mode of arg for Call doesn't match mode of arg type.", 0,
1163 show_call_param(n, mt);
1166 /* call with a compound type, mode must be reference */
1168 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1169 "Mode of arg for Call doesn't match mode of arg type.", 0,
1170 show_call_param(n, mt);
1177 if (Call_has_callees(n)) {
1178 for (i = 0; i < get_Call_n_callees(n); i++) {
1179 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1187 * verify an Add node
1189 static int verify_node_Add(ir_node *n, ir_graph *irg)
1191 ir_mode *mymode = get_irn_mode(n);
1192 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1193 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1198 /* common Add: BB x numP x numP --> numP */
1199 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1200 /* Pointer Add: BB x ref x int --> ref */
1201 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1202 /* Pointer Add: BB x int x ref --> ref */
1203 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1206 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1207 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1208 "/* Pointer Add: BB x int x ref --> ref */");
1216 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1218 ir_mode *mymode = get_irn_mode(n);
1219 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1220 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1225 /* common Sub: BB x numP x numP --> numP */
1226 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1227 /* Pointer Sub: BB x ref x int --> ref */
1228 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1229 /* Pointer Sub: BB x ref x ref --> int */
1230 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1233 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1234 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1235 "/* Pointer Sub: BB x ref x ref --> int */" );
1241 * verify a Minus node
1243 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1245 ir_mode *mymode = get_irn_mode(n);
1246 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1250 /* Minus: BB x num --> num */
1251 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1252 show_unop_failure(n , "/* Minus: BB x num --> num */");
1260 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1262 ir_mode *mymode = get_irn_mode(n);
1263 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1264 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1269 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1270 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1271 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1272 /* Mul: BB x float x float --> float */
1273 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1276 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1277 "/* Mul: BB x float x float --> float */");
1283 * verify a Mulh node
1285 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1287 ir_mode *mymode = get_irn_mode(n);
1288 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1289 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1294 /* Mulh: BB x int x int --> int */
1295 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1298 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1304 * verify a Quot node
1306 static int verify_node_Quot(ir_node *n, ir_graph *irg)
1308 ir_mode *mymode = get_irn_mode(n);
1309 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1310 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1311 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1315 /* Quot: BB x M x float x float --> M x X x float */
1316 op1mode == mode_M && op2mode == op3mode &&
1317 get_mode_sort(op2mode) == irms_float_number &&
1320 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1326 * verify a DivMod node
1328 static int verify_node_DivMod(ir_node *n, ir_graph *irg)
1330 ir_mode *mymode = get_irn_mode(n);
1331 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1332 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1333 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1337 /* DivMod: BB x M x int x int --> M x X x int x int */
1338 op1mode == mode_M &&
1339 mode_is_int(op2mode) &&
1340 op3mode == op2mode &&
1350 static int verify_node_Div(ir_node *n, ir_graph *irg)
1352 ir_mode *mymode = get_irn_mode(n);
1353 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1354 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1355 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1359 /* Div: BB x M x int x int --> M x X x int */
1360 op1mode == mode_M &&
1361 op2mode == op3mode &&
1362 mode_is_int(op2mode) &&
1372 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1374 ir_mode *mymode = get_irn_mode(n);
1375 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1376 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1377 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1381 /* Mod: BB x M x int x int --> M x X x int */
1382 op1mode == mode_M &&
1383 op2mode == op3mode &&
1384 mode_is_int(op2mode) &&
1392 * verify a logical And, Or, Eor node
1394 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1396 ir_mode *mymode = get_irn_mode(n);
1397 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1398 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1402 /* And or Or or Eor: BB x int x int --> int */
1403 (mode_is_int(mymode) || mymode == mode_b) &&
1404 op2mode == op1mode &&
1406 "And, Or or Eor node", 0,
1407 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1412 #define verify_node_And verify_node_Logic
1413 #define verify_node_Or verify_node_Logic
1414 #define verify_node_Eor verify_node_Logic
1419 static int verify_node_Not(ir_node *n, ir_graph *irg)
1421 ir_mode *mymode = get_irn_mode(n);
1422 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1426 /* Not: BB x int --> int */
1427 (mode_is_int(mymode) || mymode == mode_b) &&
1430 show_unop_failure(n, "/* Not: BB x int --> int */");
1438 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1440 ir_mode *mymode = get_irn_mode(n);
1441 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1442 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1446 /* Cmp: BB x datab x datab --> b16 */
1447 mode_is_datab(op1mode) &&
1448 op2mode == op1mode &&
1451 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1457 * verify a Shift node
1459 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1461 ir_mode *mymode = get_irn_mode(n);
1462 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1463 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1467 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1468 mode_is_int(op1mode) &&
1469 mode_is_int(op2mode) &&
1470 !mode_is_signed(op2mode) &&
1472 "Shl, Shr or Shrs node", 0,
1473 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1478 #define verify_node_Shl verify_node_Shift
1479 #define verify_node_Shr verify_node_Shift
1480 #define verify_node_Shrs verify_node_Shift
1483 * verify a Rotl node
1485 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1487 ir_mode *mymode = get_irn_mode(n);
1488 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1489 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1493 /* Rotl: BB x int x int --> int */
1494 mode_is_int(op1mode) &&
1495 mode_is_int(op2mode) &&
1498 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1504 * verify a Conv node
1506 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1508 ir_mode *mymode = get_irn_mode(n);
1509 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1513 is_irg_state(irg, IR_GRAPH_STATE_BCONV_ALLOWED) ||
1514 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1516 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1522 * verify a Cast node
1524 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1526 ir_mode *mymode = get_irn_mode(n);
1527 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1531 /* Conv: BB x datab1 --> datab2 */
1532 mode_is_data(op1mode) && op1mode == mymode,
1534 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1542 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1544 ir_mode *mymode = get_irn_mode(n);
1545 ir_node *block = get_nodes_block(n);
1549 /* a Phi node MUST have the same number of inputs as its block
1550 * Exception is a phi with 0 inputs which is used when (re)constructing the
1552 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1554 get_irn_arity(n) == get_irn_arity(block),
1555 "wrong number of inputs in Phi node", 0,
1556 show_phi_inputs(n, block);
1560 /* Phi: BB x dataM^n --> dataM */
1561 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1562 ir_node *pred = get_Phi_pred(n, i);
1563 if (!is_Bad(pred)) {
1565 get_irn_mode(pred) == mymode,
1567 show_phi_failure(n, pred, i);
1571 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1573 if (mymode == mode_M) {
1574 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1576 ir_node *pred_i = get_Phi_pred(n, i);
1580 for (j = i - 1; j >= 0; --j) {
1581 ir_node *pred_j = get_Phi_pred(n, j);
1586 /* currently this checks fails for blocks with exception
1587 outputs (and these are NOT basic blocks). So it is disabled yet. */
1589 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1590 "At least two different PhiM predecessors are in the same block",
1592 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1602 * verify a Load node
1604 static int verify_node_Load(ir_node *n, ir_graph *irg)
1606 ir_mode *mymode = get_irn_mode(n);
1607 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1608 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1610 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1611 if (get_irg_phase_state(irg) != phase_backend) {
1612 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1614 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1617 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1618 * (Proj (Proj))) sometimes ...
1620 * interprete.c:ai_eval seems to assume that this happens, too
1622 * obset.c:get_abstval_any can't deal with this if the load has
1626 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1627 assert ((NULL != ent) || (mymode != mode_T));
1635 * verify a Store node
1637 static int verify_node_Store(ir_node *n, ir_graph *irg)
1641 ir_mode *mymode = get_irn_mode(n);
1642 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1643 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1644 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1646 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1647 if (get_irg_phase_state(irg) != phase_backend) {
1648 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1650 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1652 target = get_ptr_entity(get_Store_ptr(n));
1653 if (verify_entities && target && get_irg_phase_state(irg) == phase_high) {
1655 * If lowered code, any Sels that add 0 may be removed, causing
1656 * an direct access to entities of array or compound type.
1657 * Prevent this by checking the phase.
1659 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1667 * verify an Alloc node
1669 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1671 ir_mode *mymode = get_irn_mode(n);
1672 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1673 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1677 /* Alloc: BB x M x int_u --> M x X x ref */
1678 op1mode == mode_M &&
1679 mode_is_int(op2mode) &&
1680 !mode_is_signed(op2mode) &&
1683 show_node_failure(n);
1689 * verify a Free node
1691 static int verify_node_Free(ir_node *n, ir_graph *irg)
1693 ir_mode *mymode = get_irn_mode(n);
1694 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1695 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1696 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1700 /* Free: BB x M x ref x int_u --> M */
1701 op1mode == mode_M && mode_is_reference(op2mode) &&
1702 mode_is_int(op3mode) &&
1703 !mode_is_signed(op3mode) &&
1706 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1712 * verify a Sync node
1714 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1717 ir_mode *mymode = get_irn_mode(n);
1720 /* Sync: BB x M^n --> M */
1721 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1722 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1724 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1729 * verify a Confirm node
1731 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1733 ir_mode *mymode = get_irn_mode(n);
1734 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1735 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1739 /* Confirm: BB x T x T --> T */
1740 op1mode == mymode &&
1743 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1751 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1753 ir_mode *mymode = get_irn_mode(n);
1754 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1755 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1756 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1760 /* Mux: BB x b x datab x datab --> datab */
1761 op1mode == mode_b &&
1762 op2mode == mymode &&
1763 op3mode == mymode &&
1764 mode_is_datab(mymode),
1771 * verify a CopyB node
1773 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1775 ir_mode *mymode = get_irn_mode(n);
1776 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1777 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1778 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1779 ir_type *t = get_CopyB_type(n);
1781 /* CopyB: BB x M x ref x ref --> M x X */
1782 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1783 if (get_irg_phase_state(irg) != phase_backend) {
1784 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1789 is_compound_type(t) || is_Array_type(t),
1790 "CopyB node should copy compound types only", 0 );
1792 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1793 This should happen RARELY, as CopyB COPIES MEMORY */
1794 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1799 * verify a Bound node
1801 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1803 ir_mode *mymode = get_irn_mode(n);
1804 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1805 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1806 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1807 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1810 /* Bound: BB x M x int x int x int --> M x X */
1813 op1mode == mode_M &&
1814 op2mode == op3mode &&
1815 op3mode == op4mode &&
1816 mode_is_int(op3mode),
1823 * For each usage of a node, it is checked, if the block of the
1824 * node dominates the block of the usage (for phis: the predecessor
1825 * block of the phi for the corresponding edge).
1827 * @return non-zero on success, 0 on dominance error
1829 static int check_dominance_for_node(ir_node *use)
1831 /* This won't work for blocks and the end node */
1832 if (!is_Block(use) && !is_End(use) && !is_Anchor(use)) {
1834 ir_node *bl = get_nodes_block(use);
1836 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1837 ir_node *def = get_irn_n(use, i);
1838 ir_node *def_bl = get_nodes_block(def);
1839 ir_node *use_bl = bl;
1842 /* ignore dead definition blocks, will be removed */
1843 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1847 use_bl = get_Block_cfgpred_block(bl, i);
1849 /* ignore dead use blocks, will be removed */
1850 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1853 irg = get_irn_irg(use);
1855 block_dominates(def_bl, use_bl),
1856 "the definition of a value used violates the dominance property", 0,
1858 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1859 irg, def_bl, def, use_bl, use, i
1867 /* Tests the modes of n and its predecessors. */
1868 int irn_verify_irg(ir_node *n, ir_graph *irg)
1873 if (!get_node_verification_mode())
1877 * do NOT check placement in interprocedural view, as we don't always
1878 * know the "right" graph ...
1882 /* this is an expensive check for large graphs (it has a quadratic
1883 * runtime but with a small constant); so do NOT run it in release mode
1886 node_is_in_irgs_storage(irg, n),
1887 "Node is not stored on proper IR graph!", 0,
1888 show_node_on_graph(irg, n);
1891 assert(get_irn_irg(n) == irg);
1893 unsigned idx = get_irn_idx(n);
1894 ir_node *node_from_map = get_idx_irn(irg, idx);
1895 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1896 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1901 /* We don't want to test nodes whose predecessors are Bad,
1902 as we would have to special case that for each operation. */
1903 if (op != op_Phi && op != op_Block) {
1904 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1905 if (is_Bad(get_irn_n(n, i)))
1910 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1911 op_pin_state state = get_irn_pinned(n);
1913 state == op_pin_state_floats ||
1914 state == op_pin_state_pinned,
1915 "invalid pin state", 0,
1916 ir_printf("node %+F", n));
1919 if (op->ops.verify_node)
1920 return op->ops.verify_node(n, irg);
1926 int irn_verify(ir_node *n)
1928 #ifdef DEBUG_libfirm
1929 return irn_verify_irg(n, get_irn_irg(n));
1936 /*-----------------------------------------------------------------*/
1937 /* Verify the whole graph. */
1938 /*-----------------------------------------------------------------*/
1940 #ifdef DEBUG_libfirm
1942 * Walker to check every node
1944 static void verify_wrap(ir_node *node, void *env)
1946 int *res = (int*)env;
1947 *res = irn_verify_irg(node, get_irn_irg(node));
1951 * Walker to check every node including SSA property.
1952 * Only called if dominance info is available.
1954 static void verify_wrap_ssa(ir_node *node, void *env)
1956 int *res = (int*)env;
1958 *res = irn_verify_irg(node, get_irn_irg(node));
1960 *res = check_dominance_for_node(node);
1964 #endif /* DEBUG_libfirm */
1967 * Calls irn_verify for each node in irg.
1968 * Graph must be in state "op_pin_state_pinned".
1969 * If dominance info is available, check the SSA property.
1971 int irg_verify(ir_graph *irg, unsigned flags)
1974 #ifdef DEBUG_libfirm
1978 last_irg_error = NULL;
1981 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1983 if (flags & VERIFY_ENFORCE_SSA)
1988 get_irg_dom_state(irg) == dom_consistent &&
1989 get_irg_pinned(irg) == op_pin_state_pinned ? verify_wrap_ssa : verify_wrap,
1993 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1994 ir_entity *ent = get_irg_entity(irg);
1997 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1999 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2005 #endif /* DEBUG_libfirm */
2010 typedef struct pass_t {
2011 ir_graph_pass_t pass;
2016 * Wrapper to irg_verify to be run as an ir_graph pass.
2018 static int irg_verify_wrapper(ir_graph *irg, void *context)
2020 pass_t *pass = (pass_t*)context;
2021 irg_verify(irg, pass->flags);
2022 /* do NOT rerun the pass if verify is ok :-) */
2026 /* Creates an ir_graph pass for irg_verify(). */
2027 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2029 pass_t *pass = XMALLOCZ(pass_t);
2031 def_graph_pass_constructor(
2032 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2034 /* neither dump for verify */
2035 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2036 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2038 pass->flags = flags;
2042 /* create a verify pass */
2043 int irn_verify_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
2046 firm_verification_t old = get_node_verification_mode();
2048 firm_verify_failure_msg = NULL;
2049 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2050 res = irn_verify_irg(n, irg);
2051 if (res && get_irg_dom_state(irg) == dom_consistent &&
2052 get_irg_pinned(irg) == op_pin_state_pinned)
2053 res = check_dominance_for_node(n);
2054 do_node_verification(old);
2055 *bad_string = firm_verify_failure_msg;
2060 typedef struct verify_bad_env_t {
2066 * Pre-Walker: check Bad predecessors of node.
2068 static void check_bads(ir_node *node, void *env)
2070 verify_bad_env_t *venv = (verify_bad_env_t*)env;
2071 int i, arity = get_irn_arity(node);
2072 ir_graph *irg = get_irn_irg(node);
2074 if (is_Block(node)) {
2075 if ((venv->flags & BAD_CF) == 0) {
2077 /* check for Bad Block predecessor */
2078 for (i = 0; i < arity; ++i) {
2079 ir_node *pred = get_irn_n(node, i);
2082 venv->res |= BAD_CF;
2084 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2085 fprintf(stderr, "irg_verify_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2087 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2088 dump_ir_graph(irg, "-assert");
2089 assert(0 && "Bad CF detected");
2095 if ((venv->flags & BAD_BLOCK) == 0) {
2097 /* check for Bad Block */
2098 if (is_Bad(get_nodes_block(node))) {
2099 venv->res |= BAD_BLOCK;
2101 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2102 fprintf(stderr, "irg_verify_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2104 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2105 dump_ir_graph(irg, "-assert");
2106 assert(0 && "Bad CF detected");
2111 if ((venv->flags & TUPLE) == 0) {
2112 if (is_Tuple(node)) {
2115 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2116 fprintf(stderr, "irg_verify_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2118 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2119 dump_ir_graph(irg, "-assert");
2120 assert(0 && "Tuple detected");
2125 for (i = 0; i < arity; ++i) {
2126 ir_node *pred = get_irn_n(node, i);
2129 /* check for Phi with Bad inputs */
2130 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2131 if (venv->flags & BAD_CF)
2134 venv->res |= BAD_CF;
2136 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2137 fprintf(stderr, "irg_verify_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2139 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2140 dump_ir_graph(irg, "-assert");
2141 assert(0 && "Bad CF detected");
2146 /* Bad node input */
2147 if ((venv->flags & BAD_DF) == 0) {
2148 venv->res |= BAD_DF;
2150 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2151 fprintf(stderr, "irg_verify_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2153 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2154 dump_ir_graph(irg, "-assert");
2155 assert(0 && "Bad NON-CF detected");
2164 * verify occurrence of bad nodes
2166 int irg_verify_bads(ir_graph *irg, int flags)
2168 verify_bad_env_t env;
2173 irg_walk_graph(irg, check_bads, NULL, &env);
2179 * set the default verify operation
2181 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2185 ops->verify_node = verify_node_##a; \
2239 ops->verify_proj_node = verify_node_Proj_##a; \