2 * Copyright (C) 1995-2008 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"
40 /** if this flag is set, verify entity types in Load & Store nodes */
41 static int vrfy_entities = 0;
43 const char *firm_vrfy_failure_msg;
45 /* enable verification of Load/Store entities */
46 void vrfy_enable_entity_tests(int enable)
48 vrfy_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_vrfy_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_vrfy_irg() %+F::%s failed\n",
90 ent_type, get_entity_name(ent));
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
95 fprintf(stderr, "\nFIRM: irn_vrfy_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_vrfy_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);
595 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
596 /* do NOT check this for lowered phases, see comment on Store */
598 (mode == get_type_mode(get_entity_type(ent))),
599 "wrong data Proj from Load, entity type_mode failed", 0,
600 show_proj_failure_ent(p, ent);
605 mode_is_data(mode) && mode == get_Load_mode(n),
606 "wrong data Proj from Load", 0,
607 show_proj_failure(p);
614 (proj == pn_Load_M && mode == mode_M) ||
615 (proj == pn_Load_X_regular && mode == mode_X) ||
616 (proj == pn_Load_X_except && mode == mode_X)
618 "wrong Proj from Load", 0,
619 show_proj_failure(p);
622 if (proj == pn_Load_X_regular) {
624 get_irn_pinned(n) == op_pin_state_pinned,
625 "Regular Proj from unpinned Load", 0);
626 } else if (proj == pn_Load_X_except) {
628 get_irn_pinned(n) == op_pin_state_pinned,
629 "Exception Proj from unpinned Load", 0);
635 * verify a Proj(Store) node
637 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
639 ir_mode *mode = get_irn_mode(p);
640 long proj = get_Proj_proj(p);
644 (proj == pn_Store_M && mode == mode_M) ||
645 (proj == pn_Store_X_regular && mode == mode_X) ||
646 (proj == pn_Store_X_except && mode == mode_X)
648 "wrong Proj from Store", 0,
649 show_proj_failure(p);
651 if (proj == pn_Store_X_regular) {
653 get_irn_pinned(n) == op_pin_state_pinned,
654 "Regular Proj from unpinned Store", 0);
655 } else if (proj == pn_Store_X_except) {
657 get_irn_pinned(n) == op_pin_state_pinned,
658 "Exception Proj from unpinned Store", 0);
664 * verify a Proj(Alloc) node
666 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
668 ir_mode *mode = get_irn_mode(p);
669 long proj = get_Proj_proj(p);
674 (proj == pn_Alloc_M && mode == mode_M) ||
675 (proj == pn_Alloc_X_regular && mode == mode_X) ||
676 (proj == pn_Alloc_X_except && mode == mode_X) ||
677 (proj == pn_Alloc_res && mode_is_reference(mode))
679 "wrong Proj from Alloc", 0,
680 show_proj_failure(p);
686 * verify a Proj(Proj) node
688 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
690 ir_mode *mode = get_irn_mode(p);
691 long proj = get_Proj_proj(p);
692 long nr = get_Proj_proj(pred);
693 ir_type *mt; /* A method type */
695 pred = skip_Id(get_Proj_pred(pred));
696 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
698 switch (get_irn_opcode(pred)) {
700 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
702 if (nr == pn_Start_T_args) {
704 (proj >= 0 && mode_is_datab(mode)),
705 "wrong Proj from Proj from Start", 0);
707 (proj < get_method_n_params(mt)),
708 "More Projs for args than args in type", 0
710 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
711 /* value argument */ break;
713 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
715 (mode == get_type_mode(get_method_param_type(mt, proj))),
716 "Mode of Proj from Start doesn't match mode of param type.", 0,
717 show_proj_mode_failure(p, get_method_param_type(mt, proj));
726 (proj >= 0 && mode_is_datab(mode)),
727 "wrong Proj from Proj from Call", 0);
728 mt = get_Call_type(pred);
729 ASSERT_AND_RET(mt == get_unknown_type() || is_Method_type(mt),
730 "wrong call type on call", 0);
732 (proj < get_method_n_ress(mt)),
733 "More Projs for results than results in type.", 0);
734 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
735 /* value result */ break;
738 (mode == get_type_mode(get_method_res_type(mt, proj))),
739 "Mode of Proj from Call doesn't match mode of result type.", 0);
748 /* hmm, optimization did not remove it */
752 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
759 * verify a Proj(Tuple) node
761 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
770 * verify a Proj(CopyB) node
772 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
774 ir_mode *mode = get_irn_mode(p);
775 long proj = get_Proj_proj(p);
779 (proj == pn_CopyB_M && mode == mode_M) ||
780 (proj == pn_CopyB_X_regular && mode == mode_X) ||
781 (proj == pn_CopyB_X_except && mode == mode_X)
783 "wrong Proj from CopyB", 0,
784 show_proj_failure(p);
786 if (proj == pn_CopyB_X_regular)
788 get_irn_pinned(n) == op_pin_state_pinned,
789 "Regular Proj from unpinned CopyB", 0);
790 else if (proj == pn_CopyB_X_except)
792 get_irn_pinned(n) == op_pin_state_pinned,
793 "Exception Proj from unpinned CopyB", 0);
798 * verify a Proj(Bound) node
800 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
802 ir_mode *mode = get_irn_mode(p);
803 long proj = get_Proj_proj(p);
805 /* ignore Bound checks of Bad */
806 if (is_Bad(get_Bound_index(n)))
810 (proj == pn_Bound_M && mode == mode_M) ||
811 (proj == pn_Bound_X_regular && mode == mode_X) ||
812 (proj == pn_Bound_X_except && mode == mode_X) ||
813 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
815 "wrong Proj from Bound", 0,
816 show_proj_failure(p);
824 static int verify_node_Proj(ir_node *p, ir_graph *irg)
829 pred = skip_Id(get_Proj_pred(p));
830 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
831 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);
833 op = get_irn_op(pred);
835 if (op->ops.verify_proj_node)
836 return op->ops.verify_proj_node(pred, p);
843 * verify a Block node
845 static int verify_node_Block(ir_node *n, ir_graph *irg)
848 ir_node *mb = get_Block_MacroBlock(n);
850 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
852 if (is_Block(mb) && mb != n) {
855 /* Blocks with more than one predecessor must be header blocks */
856 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
857 if (get_irg_phase_state(irg) != phase_backend) {
858 pred = get_Block_cfgpred(n, 0);
860 /* the predecessor MUST be a regular Proj */
861 ir_node *frag_op = get_Proj_pred(pred);
863 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
864 "partBlock with non-regular predecessor", 0);
866 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
867 of fragile nodes during construction. It does not violate our assumption of dominance
869 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
870 "partBlock with non-regular predecessor", 0);
873 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
877 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
878 ir_node *pred = get_Block_cfgpred(n, i);
880 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
881 "Block node must have a mode_X predecessor", 0);
884 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
885 /* End block may only have Return, Raise or fragile ops as preds. */
886 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
887 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
888 if (is_Proj(pred) || is_Tuple(pred))
889 break; /* We can not test properly. How many tuples are there? */
897 "End Block node", 0);
899 /* irg attr must == graph we are in. */
900 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
905 * verify a Start node
907 static int verify_node_Start(ir_node *n, ir_graph *irg)
909 ir_mode *mymode = get_irn_mode(n);
913 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
914 mymode == mode_T, "Start node", 0
922 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
924 ir_mode *mymode = get_irn_mode(n);
929 mymode == mode_X, "Jmp node", 0
935 * verify an IJmp node
937 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
939 ir_mode *mymode = get_irn_mode(n);
940 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
944 /* IJmp: BB x ref --> X */
945 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
953 static int verify_node_Cond(ir_node *n, ir_graph *irg)
955 ir_mode *mymode = get_irn_mode(n);
956 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
960 /* Cond: BB x b --> X x X */
961 (op1mode == mode_b ||
962 /* Cond: BB x int --> X^n */
963 mode_is_int(op1mode) ), "Cond node", 0
965 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
971 * verify a Return node
973 static int verify_node_Return(ir_node *n, ir_graph *irg)
976 ir_mode *mymode = get_irn_mode(n);
977 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
980 /* Return: BB x M x data1 x ... x datan --> X */
982 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
984 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
985 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
987 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
988 /* Compare returned results with result types of method type */
989 mt = get_entity_type(get_irg_entity(irg));
990 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
991 "Number of results for Return doesn't match number of results in type.", 0,
992 show_return_nres(irg, n, mt););
993 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
994 ir_type *res_type = get_method_res_type(mt, i);
996 if (get_irg_phase_state(irg) != phase_backend) {
997 if (is_atomic_type(res_type)) {
999 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1000 "Mode of result for Return doesn't match mode of result type.", 0,
1001 show_return_modes(irg, n, mt, i);
1005 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1006 "Mode of result for Return doesn't match mode of result type.", 0,
1007 show_return_modes(irg, n, mt, i);
1016 * verify a Raise node
1018 static int verify_node_Raise(ir_node *n, ir_graph *irg)
1020 ir_mode *mymode = get_irn_mode(n);
1021 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1022 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1026 /* Sel: BB x M x ref --> X x M */
1027 op1mode == mode_M && mode_is_reference(op2mode) &&
1028 mymode == mode_T, "Raise node", 0
1034 * verify a Const node
1036 static int verify_node_Const(ir_node *n, ir_graph *irg)
1038 ir_mode *mymode = get_irn_mode(n);
1042 /* Const: BB --> data */
1043 (mode_is_data(mymode) ||
1044 mymode == mode_b) /* we want boolean constants for static evaluation */
1045 ,"Const node", 0 /* of Cmp. */
1048 /* the modes of the constant and teh tarval must match */
1049 mymode == get_tarval_mode(get_Const_tarval(n)),
1050 "Const node, tarval and node mode mismatch", 0
1056 * verify a SymConst node
1058 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
1060 ir_mode *mymode = get_irn_mode(n);
1064 /* SymConst: BB --> int*/
1065 (mode_is_int(mymode) ||
1066 /* SymConst: BB --> ref */
1067 mode_is_reference(mymode))
1068 ,"SymConst node", 0);
1075 static int verify_node_Sel(ir_node *n, ir_graph *irg)
1078 ir_mode *mymode = get_irn_mode(n);
1079 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1080 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1085 /* Sel: BB x M x ref x int^n --> ref */
1086 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1087 "Sel node", 0, show_node_failure(n)
1090 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1091 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1093 ent = get_Sel_entity(n);
1094 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1099 * verify an InstOf node
1101 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
1103 ir_mode *mymode = get_irn_mode(n);
1104 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1107 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1108 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1113 * Check if the pinned state is right.
1115 static int verify_right_pinned(ir_node *n)
1119 if (get_irn_pinned(n) == op_pin_state_pinned)
1121 mem = get_Call_mem(n);
1123 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1124 if (is_NoMem(mem) || is_Pin(mem))
1130 * verify a Call node
1132 static int verify_node_Call(ir_node *n, ir_graph *irg)
1134 ir_mode *mymode = get_irn_mode(n);
1135 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1136 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1141 /* Call: BB x M x ref x data1 x ... x datan
1142 --> M x datan+1 x ... x data n+m */
1143 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1145 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1146 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1148 mt = get_Call_type(n);
1149 if (get_unknown_type() == mt) {
1153 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1154 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1157 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1158 /* Compare arguments of node with those of type */
1160 if (get_method_variadicity(mt) == variadicity_variadic) {
1162 get_Call_n_params(n) >= get_method_n_params(mt),
1163 "Number of args for Call doesn't match number of args in variadic type.",
1165 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1166 n, get_Call_n_params(n), get_method_n_params(mt));
1170 get_Call_n_params(n) == get_method_n_params(mt),
1171 "Number of args for Call doesn't match number of args in non variadic type.",
1173 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1174 n, get_Call_n_params(n), get_method_n_params(mt));
1178 for (i = 0; i < get_method_n_params(mt); i++) {
1179 ir_type *t = get_method_param_type(mt, i);
1181 if (get_irg_phase_state(irg) != phase_backend) {
1182 if (is_atomic_type(t)) {
1184 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1185 "Mode of arg for Call doesn't match mode of arg type.", 0,
1186 show_call_param(n, mt);
1189 /* call with a compound type, mode must be reference */
1191 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1192 "Mode of arg for Call doesn't match mode of arg type.", 0,
1193 show_call_param(n, mt);
1200 if (Call_has_callees(n)) {
1201 for (i = 0; i < get_Call_n_callees(n); i++) {
1202 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1210 * verify an Add node
1212 static int verify_node_Add(ir_node *n, ir_graph *irg)
1214 ir_mode *mymode = get_irn_mode(n);
1215 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1216 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1221 /* common Add: BB x numP x numP --> numP */
1222 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1223 /* Pointer Add: BB x ref x int --> ref */
1224 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1225 /* Pointer Add: BB x int x ref --> ref */
1226 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1229 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1230 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1231 "/* Pointer Add: BB x int x ref --> ref */");
1239 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1241 ir_mode *mymode = get_irn_mode(n);
1242 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1243 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1248 /* common Sub: BB x numP x numP --> numP */
1249 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1250 /* Pointer Sub: BB x ref x int --> ref */
1251 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1252 /* Pointer Sub: BB x ref x ref --> int */
1253 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1256 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1257 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1258 "/* Pointer Sub: BB x ref x ref --> int */" );
1264 * verify a Minus node
1266 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1268 ir_mode *mymode = get_irn_mode(n);
1269 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1273 /* Minus: BB x num --> num */
1274 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1275 show_unop_failure(n , "/* Minus: BB x num --> num */");
1283 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1285 ir_mode *mymode = get_irn_mode(n);
1286 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1287 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1292 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1293 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1294 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1295 /* Mul: BB x float x float --> float */
1296 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1299 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1300 "/* Mul: BB x float x float --> float */");
1306 * verify a Mulh node
1308 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1310 ir_mode *mymode = get_irn_mode(n);
1311 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1312 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1317 /* Mulh: BB x int x int --> int */
1318 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1321 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1327 * verify a Quot node
1329 static int verify_node_Quot(ir_node *n, ir_graph *irg)
1331 ir_mode *mymode = get_irn_mode(n);
1332 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1333 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1334 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1338 /* Quot: BB x M x float x float --> M x X x float */
1339 op1mode == mode_M && op2mode == op3mode &&
1340 get_mode_sort(op2mode) == irms_float_number &&
1343 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1349 * verify a DivMod node
1351 static int verify_node_DivMod(ir_node *n, ir_graph *irg)
1353 ir_mode *mymode = get_irn_mode(n);
1354 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1355 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1356 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1360 /* DivMod: BB x M x int x int --> M x X x int x int */
1361 op1mode == mode_M &&
1362 mode_is_int(op2mode) &&
1363 op3mode == op2mode &&
1373 static int verify_node_Div(ir_node *n, ir_graph *irg)
1375 ir_mode *mymode = get_irn_mode(n);
1376 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1377 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1378 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1382 /* Div: BB x M x int x int --> M x X x int */
1383 op1mode == mode_M &&
1384 op2mode == op3mode &&
1385 mode_is_int(op2mode) &&
1395 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1397 ir_mode *mymode = get_irn_mode(n);
1398 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1399 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1400 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1404 /* Mod: BB x M x int x int --> M x X x int */
1405 op1mode == mode_M &&
1406 op2mode == op3mode &&
1407 mode_is_int(op2mode) &&
1415 * verify an Abs node
1417 static int verify_node_Abs(ir_node *n, ir_graph *irg)
1419 ir_mode *mymode = get_irn_mode(n);
1420 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1424 /* Abs: BB x num --> num */
1425 op1mode == mymode &&
1426 mode_is_num (op1mode),
1428 show_unop_failure(n, "/* Abs: BB x num --> num */");
1434 * verify a logical And, Or, Eor node
1436 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1438 ir_mode *mymode = get_irn_mode(n);
1439 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1440 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1444 /* And or Or or Eor: BB x int x int --> int */
1445 (mode_is_int(mymode) || mymode == mode_b) &&
1446 op2mode == op1mode &&
1448 "And, Or or Eor node", 0,
1449 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1454 #define verify_node_And verify_node_Logic
1455 #define verify_node_Or verify_node_Logic
1456 #define verify_node_Eor verify_node_Logic
1461 static int verify_node_Not(ir_node *n, ir_graph *irg)
1463 ir_mode *mymode = get_irn_mode(n);
1464 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1468 /* Not: BB x int --> int */
1469 (mode_is_int(mymode) || mymode == mode_b) &&
1472 show_unop_failure(n, "/* Not: BB x int --> int */");
1480 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1482 ir_mode *mymode = get_irn_mode(n);
1483 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1484 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1488 /* Cmp: BB x datab x datab --> b16 */
1489 mode_is_datab(op1mode) &&
1490 op2mode == op1mode &&
1493 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1499 * verify a Shift node
1501 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1503 ir_mode *mymode = get_irn_mode(n);
1504 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1505 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1509 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1510 mode_is_int(op1mode) &&
1511 mode_is_int(op2mode) &&
1512 !mode_is_signed(op2mode) &&
1514 "Shl, Shr or Shrs node", 0,
1515 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1520 #define verify_node_Shl verify_node_Shift
1521 #define verify_node_Shr verify_node_Shift
1522 #define verify_node_Shrs verify_node_Shift
1525 * verify a Rotl node
1527 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1529 ir_mode *mymode = get_irn_mode(n);
1530 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1531 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1535 /* Rotl: BB x int x int --> int */
1536 mode_is_int(op1mode) &&
1537 mode_is_int(op2mode) &&
1540 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1546 * verify a Conv node
1548 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1550 ir_mode *mymode = get_irn_mode(n);
1551 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1555 get_irg_phase_state(irg) == phase_backend ||
1556 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1558 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1564 * verify a Cast node
1566 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1568 ir_mode *mymode = get_irn_mode(n);
1569 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1573 /* Conv: BB x datab1 --> datab2 */
1574 mode_is_data(op1mode) && op1mode == mymode,
1576 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1584 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1586 ir_mode *mymode = get_irn_mode(n);
1587 ir_node *block = get_nodes_block(n);
1591 /* a Phi node MUST have the same number of inputs as its block
1592 * Exception is a phi with 0 inputs which is used when (re)constructing the
1594 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1596 get_irn_arity(n) == get_irn_arity(block),
1597 "wrong number of inputs in Phi node", 0,
1598 show_phi_inputs(n, block);
1602 /* Phi: BB x dataM^n --> dataM */
1603 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1604 ir_node *pred = get_Phi_pred(n, i);
1605 if (!is_Bad(pred)) {
1607 get_irn_mode(pred) == mymode,
1609 show_phi_failure(n, pred, i);
1613 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1615 if (mymode == mode_M) {
1616 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1618 ir_node *pred_i = get_Phi_pred(n, i);
1622 for (j = i - 1; j >= 0; --j) {
1623 ir_node *pred_j = get_Phi_pred(n, j);
1628 /* currently this checks fails for blocks with exception
1629 outputs (and these are NOT basic blocks). So it is disabled yet. */
1631 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1632 "At least two different PhiM predecessors are in the same block",
1634 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1644 * verify a Load node
1646 static int verify_node_Load(ir_node *n, ir_graph *irg)
1648 ir_mode *mymode = get_irn_mode(n);
1649 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1650 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1652 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1653 if (get_irg_phase_state(irg) != phase_backend) {
1654 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1656 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1659 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1660 * (Proj (Proj))) sometimes ...
1662 * interprete.c:ai_eval seems to assume that this happens, too
1664 * obset.c:get_abstval_any can't deal with this if the load has
1668 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1669 assert ((NULL != ent) || (mymode != mode_T));
1677 * verify a Store node
1679 static int verify_node_Store(ir_node *n, ir_graph *irg)
1683 ir_mode *mymode = get_irn_mode(n);
1684 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1685 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1686 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1688 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1689 if (get_irg_phase_state(irg) != phase_backend) {
1690 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1692 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1694 target = get_ptr_entity(get_Store_ptr(n));
1695 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1697 * If lowered code, any Sels that add 0 may be removed, causing
1698 * an direct access to entities of array or compound type.
1699 * Prevent this by checking the phase.
1701 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1709 * verify an Alloc node
1711 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1713 ir_mode *mymode = get_irn_mode(n);
1714 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1715 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1719 /* Alloc: BB x M x int_u --> M x X x ref */
1720 op1mode == mode_M &&
1721 mode_is_int(op2mode) &&
1722 !mode_is_signed(op2mode) &&
1725 show_node_failure(n);
1731 * verify a Free node
1733 static int verify_node_Free(ir_node *n, ir_graph *irg)
1735 ir_mode *mymode = get_irn_mode(n);
1736 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1737 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1738 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1742 /* Free: BB x M x ref x int_u --> M */
1743 op1mode == mode_M && mode_is_reference(op2mode) &&
1744 mode_is_int(op3mode) &&
1745 !mode_is_signed(op3mode) &&
1748 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1754 * verify a Sync node
1756 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1759 ir_mode *mymode = get_irn_mode(n);
1762 /* Sync: BB x M^n --> M */
1763 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1764 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1766 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1771 * verify a Confirm node
1773 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1775 ir_mode *mymode = get_irn_mode(n);
1776 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1777 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1781 /* Confirm: BB x T x T --> T */
1782 op1mode == mymode &&
1785 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1793 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1795 ir_mode *mymode = get_irn_mode(n);
1796 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1797 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1798 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1802 /* Mux: BB x b x datab x datab --> datab */
1803 op1mode == mode_b &&
1804 op2mode == mymode &&
1805 op3mode == mymode &&
1806 mode_is_datab(mymode),
1813 * verify a CopyB node
1815 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1817 ir_mode *mymode = get_irn_mode(n);
1818 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1819 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1820 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1821 ir_type *t = get_CopyB_type(n);
1823 /* CopyB: BB x M x ref x ref --> M x X */
1824 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1825 if (get_irg_phase_state(irg) != phase_backend) {
1826 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1831 is_compound_type(t) || is_Array_type(t),
1832 "CopyB node should copy compound types only", 0 );
1834 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1835 This should happen RARELY, as CopyB COPIES MEMORY */
1836 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1841 * verify a Bound node
1843 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1845 ir_mode *mymode = get_irn_mode(n);
1846 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1847 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1848 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1849 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1852 /* Bound: BB x M x int x int x int --> M x X */
1855 op1mode == mode_M &&
1856 op2mode == op3mode &&
1857 op3mode == op4mode &&
1858 mode_is_int(op3mode),
1865 * For each usage of a node, it is checked, if the block of the
1866 * node dominates the block of the usage (for phis: the predecessor
1867 * block of the phi for the corresponding edge).
1869 * @return non-zero on success, 0 on dominance error
1871 static int check_dominance_for_node(ir_node *use)
1873 if (is_Block(use)) {
1874 ir_node *mbh = get_Block_MacroBlock(use);
1877 /* must be a partBlock */
1878 if (is_Block(mbh)) {
1879 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1883 /* This won't work for blocks and the end node */
1884 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1886 ir_node *bl = get_nodes_block(use);
1888 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1889 ir_node *def = get_irn_n(use, i);
1890 ir_node *def_bl = get_nodes_block(def);
1891 ir_node *use_bl = bl;
1893 /* ignore dead definition blocks, will be removed */
1894 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1898 use_bl = get_Block_cfgpred_block(bl, i);
1900 /* ignore dead use blocks, will be removed */
1901 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1905 block_dominates(def_bl, use_bl),
1906 "the definition of a value used violates the dominance property", 0,
1908 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1909 current_ir_graph, def_bl, def, use_bl, use, i
1917 /* Tests the modes of n and its predecessors. */
1918 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1923 if (!get_node_verification_mode())
1927 * do NOT check placement in interprocedural view, as we don't always
1928 * know the "right" graph ...
1932 /* this is an expensive check for large graphs (it has a quadratic
1933 * runtime but with a small constant); so do NOT run it in release mode
1936 node_is_in_irgs_storage(irg, n),
1937 "Node is not stored on proper IR graph!", 0,
1938 show_node_on_graph(irg, n);
1941 assert(get_irn_irg(n) == irg);
1943 unsigned idx = get_irn_idx(n);
1944 ir_node *node_from_map = get_idx_irn(irg, idx);
1945 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1946 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1951 /* We don't want to test nodes whose predecessors are Bad,
1952 as we would have to special case that for each operation. */
1953 if (op != op_Phi && op != op_Block) {
1954 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1955 if (is_Bad(get_irn_n(n, i)))
1960 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1961 op_pin_state state = get_irn_pinned(n);
1963 state == op_pin_state_floats ||
1964 state == op_pin_state_pinned,
1965 "invalid pin state", 0,
1966 ir_printf("node %+F", n));
1969 if (op->ops.verify_node)
1970 return op->ops.verify_node(n, irg);
1976 int irn_vrfy(ir_node *n)
1978 #ifdef DEBUG_libfirm
1979 return irn_vrfy_irg(n, current_ir_graph);
1986 /*-----------------------------------------------------------------*/
1987 /* Verify the whole graph. */
1988 /*-----------------------------------------------------------------*/
1990 #ifdef DEBUG_libfirm
1992 * Walker to check every node
1994 static void vrfy_wrap(ir_node *node, void *env)
1997 *res = irn_vrfy_irg(node, current_ir_graph);
2001 * Walker to check every node including SSA property.
2002 * Only called if dominance info is available.
2004 static void vrfy_wrap_ssa(ir_node *node, void *env)
2008 *res = irn_vrfy_irg(node, current_ir_graph);
2010 *res = check_dominance_for_node(node);
2014 #endif /* DEBUG_libfirm */
2017 * Calls irn_vrfy for each node in irg.
2018 * Graph must be in state "op_pin_state_pinned".
2019 * If dominance info is available, check the SSA property.
2021 int irg_verify(ir_graph *irg, unsigned flags)
2024 #ifdef DEBUG_libfirm
2027 rem = current_ir_graph;
2028 current_ir_graph = irg;
2031 last_irg_error = NULL;
2034 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2036 if (flags & VRFY_ENFORCE_SSA)
2041 get_irg_dom_state(irg) == dom_consistent &&
2042 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2046 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2047 ir_entity *ent = get_irg_entity(irg);
2050 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2052 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2055 current_ir_graph = rem;
2059 #endif /* DEBUG_libfirm */
2065 ir_graph_pass_t pass;
2070 * Wrapper to irg_verify to be run as an ir_graph pass.
2072 static int irg_verify_wrapper(ir_graph *irg, void *context)
2074 struct pass_t *pass = context;
2075 irg_verify(irg, pass->flags);
2076 /* do NOT rerun the pass if verify is ok :-) */
2080 /* Creates an ir_graph pass for irg_verify(). */
2081 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2083 struct pass_t *pass = XMALLOCZ(struct pass_t);
2085 def_graph_pass_constructor(
2086 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2088 /* neither dump for verify */
2089 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2090 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2092 pass->flags = flags;
2096 /* create a verify pass */
2097 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
2100 firm_verification_t old = get_node_verification_mode();
2102 firm_vrfy_failure_msg = NULL;
2103 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2104 res = irn_vrfy_irg(n, irg);
2105 if (res && get_irg_dom_state(irg) == dom_consistent &&
2106 get_irg_pinned(irg) == op_pin_state_pinned)
2107 res = check_dominance_for_node(n);
2108 do_node_verification(old);
2109 *bad_string = firm_vrfy_failure_msg;
2115 typedef struct _vrfy_bad_env_t {
2121 * Pre-Walker: check Bad predecessors of node.
2123 static void check_bads(ir_node *node, void *env)
2125 vrfy_bad_env_t *venv = env;
2126 int i, arity = get_irn_arity(node);
2128 if (is_Block(node)) {
2129 if ((venv->flags & BAD_CF) == 0) {
2131 /* check for Bad Block predecessor */
2132 for (i = 0; i < arity; ++i) {
2133 ir_node *pred = get_irn_n(node, i);
2136 venv->res |= BAD_CF;
2138 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2139 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2141 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2142 dump_ir_graph(current_ir_graph, "-assert");
2143 assert(0 && "Bad CF detected");
2149 if ((venv->flags & BAD_BLOCK) == 0) {
2151 /* check for Bad Block */
2152 if (is_Bad(get_nodes_block(node))) {
2153 venv->res |= BAD_BLOCK;
2155 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2156 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2158 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2159 dump_ir_graph(current_ir_graph, "-assert");
2160 assert(0 && "Bad CF detected");
2165 if ((venv->flags & TUPLE) == 0) {
2166 if (is_Tuple(node)) {
2169 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2170 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2172 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2173 dump_ir_graph(current_ir_graph, "-assert");
2174 assert(0 && "Tuple detected");
2179 for (i = 0; i < arity; ++i) {
2180 ir_node *pred = get_irn_n(node, i);
2183 /* check for Phi with Bad inputs */
2184 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2185 if (venv->flags & BAD_CF)
2188 venv->res |= BAD_CF;
2190 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2191 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2193 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2194 dump_ir_graph(current_ir_graph, "-assert");
2195 assert(0 && "Bad CF detected");
2200 /* Bad node input */
2201 if ((venv->flags & BAD_DF) == 0) {
2202 venv->res |= BAD_DF;
2204 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2205 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2207 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2208 dump_ir_graph(current_ir_graph, "-assert");
2209 assert(0 && "Bad NON-CF detected");
2218 * verify occurrence of bad nodes
2220 int irg_vrfy_bads(ir_graph *irg, int flags)
2227 irg_walk_graph(irg, check_bads, NULL, &env);
2233 * set the default verify operation
2235 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2239 ops->verify_node = verify_node_##a; \
2294 ops->verify_proj_node = verify_node_Proj_##a; \