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
32 #include "irgraph_t.h"
42 /** if this flag is set, verify entity types in Load & Store nodes */
43 static int vrfy_entities = 0;
45 const char *firm_vrfy_failure_msg;
47 /* enable verification of Load/Store entities */
48 void vrfy_enable_entity_tests(int enable) {
49 vrfy_entities = enable;
55 * little helper for NULL modes
57 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) {
72 ir_graph *irg = get_irn_irg(node);
74 if (last_irg_error == irg)
79 if (irg == get_const_code_irg()) {
80 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
82 ir_entity *ent = get_irg_entity(irg);
85 ir_type *ent_type = get_entity_owner(ent);
88 if (ent_type == get_glob_type())
89 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
91 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
93 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
96 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
102 * Prints a failure for a Node
104 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) {
116 ir_node *left = get_binop_left(n);
117 ir_node *right = get_binop_right(n);
119 show_entity_failure(n);
120 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
122 get_irn_opname(n), get_irn_modename(n),
123 get_irn_opname(left), get_irn_modename(left),
124 get_irn_opname(right), get_irn_modename(right),
129 * Prints a failure message for an unop
131 static void show_unop_failure(ir_node *n, const char *text) {
132 ir_node *op = get_unop_op(n);
134 show_entity_failure(n);
135 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
137 get_irn_opname(n), get_irn_modename(n),
138 get_irn_opname(op), get_irn_modename(op),
143 * Prints a failure message for an op with 3 operands
145 static void show_triop_failure(ir_node *n, const char *text) {
146 ir_node *op0 = get_irn_n(n, 0);
147 ir_node *op1 = get_irn_n(n, 1);
148 ir_node *op2 = get_irn_n(n, 2);
150 show_entity_failure(n);
151 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
153 get_irn_opname(n), get_irn_modename(n),
154 get_irn_opname(op0), get_irn_modename(op0),
155 get_irn_opname(op1), get_irn_modename(op1),
156 get_irn_opname(op2), get_irn_modename(op2),
161 * Prints a failure message for a proj
163 static void show_proj_failure(ir_node *n) {
164 ir_node *op = get_Proj_pred(n);
165 int proj = get_Proj_proj(n);
167 show_entity_failure(n);
168 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
170 get_irn_opname(n), get_irn_modename(n), proj,
171 get_irn_opname(op), get_irn_modename(op));
175 * Prints a failure message for a proj from Start
177 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
178 long proj = get_Proj_proj(n);
179 ir_mode *m = get_type_mode(ty);
181 show_entity_failure(n);
182 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
187 get_mode_name_ex(m));
191 * Prints a failure message for a proj
193 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
194 ir_node *op = get_Proj_pred(n);
195 int proj = get_Proj_proj(n);
196 ir_mode *m = get_type_mode(get_entity_type(ent));
198 show_entity_failure(n);
199 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
201 get_irn_opname(n), get_irn_modename(n), proj,
202 get_irn_opname(op), get_irn_modename(op),
203 get_entity_name(ent), get_type_name(get_entity_type(ent)),
204 get_mode_name_ex(m));
208 * Show a node and a graph
210 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
211 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
215 * Show call parameters
217 static void show_call_param(ir_node *n, ir_type *mt) {
220 show_entity_failure(n);
221 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
222 for (i = 0; i < get_method_n_params(mt); ++i) {
223 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
225 fprintf(stderr, ") != CALL(");
227 for (i = 0; i < get_Call_n_params(n); ++i) {
228 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
230 fprintf(stderr, ")\n");
236 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
237 ir_entity *ent = get_irg_entity(irg);
239 show_entity_failure(n);
240 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
241 get_irn_node_nr(n), get_entity_name(ent),
242 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
243 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
248 * Show return number of results
250 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
251 ir_entity *ent = get_irg_entity(irg);
253 show_entity_failure(n);
254 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
255 get_irn_node_nr(n), get_entity_name(ent),
256 get_Return_n_ress(n), get_method_n_ress(mt));
262 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
264 show_entity_failure(phi);
265 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
266 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
267 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
273 static void show_phi_inputs(ir_node *phi, ir_node *block) {
274 show_entity_failure(phi);
275 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
276 get_irn_node_nr(phi), get_irn_arity(phi),
277 get_irn_node_nr(block), get_irn_arity(block));
280 #endif /* #ifndef NDEBUG */
283 * If the address is Sel or SymConst, return the entity.
285 * @param ptr the node representing the address
287 static ir_entity *get_ptr_entity(ir_node *ptr) {
289 return get_Sel_entity(ptr);
290 } else if (is_SymConst_addr_ent(ptr)) {
291 return get_SymConst_entity(ptr);
297 * verify a Proj(Start) node
299 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
300 ir_mode *mode = get_irn_mode(p);
301 long proj = get_Proj_proj(p);
306 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
307 (proj == pn_Start_M && mode == mode_M) ||
308 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
309 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
310 (proj == pn_Start_T_args && mode == mode_T) ||
311 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
312 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
314 "wrong Proj from Start", 0,
315 show_proj_failure(p);
321 * verify a Proj(Cond) node
323 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
324 ir_mode *mode = get_irn_mode(p);
325 long proj = get_Proj_proj(p);
329 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
330 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
331 is_Bad(get_Cond_selector(pred)) /* rare */
333 "wrong Proj from Cond", 0,
334 show_proj_failure(p);
340 * verify a Proj(Raise) node
342 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
343 ir_mode *mode = get_irn_mode(p);
344 long proj = get_Proj_proj(p);
348 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
349 "wrong Proj from Raise", 0,
350 show_proj_failure(p);
356 * verify a Proj(InstOf) node
358 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
359 ir_mode *mode = get_irn_mode(p);
360 long proj = get_Proj_proj(p);
365 (proj == pn_InstOf_M_regular && mode == mode_M) ||
366 (proj == pn_InstOf_X_regular && mode == mode_X) ||
367 (proj == pn_InstOf_X_except && mode == mode_X) ||
368 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
369 (proj == pn_InstOf_M_except && mode == mode_M)
371 "wrong Proj from InstOf", 0,
372 show_proj_failure(p);
378 * verify a Proj(Call) node
380 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
381 ir_mode *mode = get_irn_mode(p);
382 long proj = get_Proj_proj(p);
386 (proj == pn_Call_M_regular && mode == mode_M) ||
387 (proj == pn_Call_X_regular && mode == mode_X) ||
388 (proj == pn_Call_X_except && mode == mode_X) ||
389 (proj == pn_Call_T_result && mode == mode_T) ||
390 (proj == pn_Call_M_except && mode == mode_M) ||
391 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
393 "wrong Proj from Call", 0,
394 show_proj_failure(p);
396 /* if we have exception flow, we must have a real Memory input */
397 if (proj == pn_Call_X_regular)
399 !is_NoMem(get_Call_mem(n)),
400 "Regular Proj from FunctionCall", 0);
401 else if (proj == pn_Call_X_except)
403 !is_NoMem(get_Call_mem(n)),
404 "Exception Proj from FunctionCall", 0);
405 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
407 (!is_NoMem(get_Call_mem(n)) || 1),
408 "Memory Proj from FunctionCall", 0);
413 * verify a Proj(Quot) node
415 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
416 ir_mode *mode = get_irn_mode(p);
417 long proj = get_Proj_proj(p);
421 (proj == pn_Quot_M && mode == mode_M) ||
422 (proj == pn_Quot_X_regular && mode == mode_X) ||
423 (proj == pn_Quot_X_except && mode == mode_X) ||
424 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
426 "wrong Proj from Quot", 0,
427 show_proj_failure(p);
429 if (proj == pn_Quot_X_regular)
431 get_irn_pinned(n) == op_pin_state_pinned,
432 "Regular Proj from unpinned Quot", 0);
433 else if (proj == pn_Quot_X_except)
435 get_irn_pinned(n) == op_pin_state_pinned,
436 "Exception Proj from unpinned Quot", 0);
437 else if (proj == pn_Quot_M)
439 get_irn_pinned(n) == op_pin_state_pinned,
440 "Memory Proj from unpinned Quot", 0);
445 * verify a Proj(DivMod) node
447 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
448 ir_mode *mode = get_irn_mode(p);
449 long proj = get_Proj_proj(p);
453 (proj == pn_DivMod_M && mode == mode_M) ||
454 (proj == pn_DivMod_X_regular && mode == mode_X) ||
455 (proj == pn_DivMod_X_except && mode == mode_X) ||
456 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
457 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
459 "wrong Proj from DivMod", 0,
460 show_proj_failure(p);
462 if (proj == pn_DivMod_X_regular)
464 get_irn_pinned(n) == op_pin_state_pinned,
465 "Regular Proj from unpinned DivMod", 0);
466 else if (proj == pn_DivMod_X_except)
468 get_irn_pinned(n) == op_pin_state_pinned,
469 "Exception Proj from unpinned DivMod", 0);
470 else if (proj == pn_DivMod_M)
472 get_irn_pinned(n) == op_pin_state_pinned,
473 "Memory Proj from unpinned DivMod", 0);
478 * verify a Proj(Div) node
480 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
481 ir_mode *mode = get_irn_mode(p);
482 long proj = get_Proj_proj(p);
486 (proj == pn_Div_M && mode == mode_M) ||
487 (proj == pn_Div_X_regular && mode == mode_X) ||
488 (proj == pn_Div_X_except && mode == mode_X) ||
489 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
491 "wrong Proj from Div", 0,
492 show_proj_failure(p);
494 if (proj == pn_Div_X_regular)
496 get_irn_pinned(n) == op_pin_state_pinned,
497 "Regular Proj from unpinned Div", 0);
498 else if (proj == pn_Div_X_except)
500 get_irn_pinned(n) == op_pin_state_pinned,
501 "Exception Proj from unpinned Div", 0);
502 else if (proj == pn_Div_M)
504 get_irn_pinned(n) == op_pin_state_pinned,
505 "Memory Proj from unpinned Div", 0);
510 * verify a Proj(Mod) node
512 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
513 ir_mode *mode = get_irn_mode(p);
514 long proj = get_Proj_proj(p);
518 (proj == pn_Mod_M && mode == mode_M) ||
519 (proj == pn_Mod_X_regular && mode == mode_X) ||
520 (proj == pn_Mod_X_except && mode == mode_X) ||
521 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
523 "wrong Proj from Mod", 0,
524 show_proj_failure(p);
526 if (proj == pn_Mod_X_regular)
528 get_irn_pinned(n) == op_pin_state_pinned,
529 "Regular Proj from unpinned Mod", 0);
530 else if (proj == pn_Mod_X_except)
532 get_irn_pinned(n) == op_pin_state_pinned,
533 "Exception Proj from unpinned Mod", 0);
534 else if (proj == pn_Mod_M)
536 get_irn_pinned(n) == op_pin_state_pinned,
537 "Memory Proj from unpinned Div", 0);
542 * verify a Proj(Cmp) node
544 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
545 ir_mode *mode = get_irn_mode(p);
546 long proj = get_Proj_proj(p);
550 (proj >= 0 && proj <= 15 && mode == mode_b),
551 "wrong Proj from Cmp", 0,
552 show_proj_failure(p);
555 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
556 "unordered Proj for non-float Cmp", 0,
557 show_proj_failure(p);
563 * verify a Proj(Load) node
565 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
566 ir_mode *mode = get_irn_mode(p);
567 long proj = get_Proj_proj(p);
569 if (proj == pn_Load_res) {
570 ir_node *ptr = get_Load_ptr(n);
571 ir_entity *ent = get_ptr_entity(ptr);
573 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
574 /* do NOT check this for lowered phases, see comment on Store */
576 (mode == get_type_mode(get_entity_type(ent))),
577 "wrong data Proj from Load, entity type_mode failed", 0,
578 show_proj_failure_ent(p, ent);
583 mode_is_data(mode) && mode == get_Load_mode(n),
584 "wrong data Proj from Load", 0,
585 show_proj_failure(p);
592 (proj == pn_Load_M && mode == mode_M) ||
593 (proj == pn_Load_X_regular && mode == mode_X) ||
594 (proj == pn_Load_X_except && mode == mode_X)
596 "wrong Proj from Load", 0,
597 show_proj_failure(p);
600 if (proj == pn_Load_X_regular) {
602 get_irn_pinned(n) == op_pin_state_pinned,
603 "Regular Proj from unpinned Load", 0);
604 } else if (proj == pn_Load_X_except) {
606 get_irn_pinned(n) == op_pin_state_pinned,
607 "Exception Proj from unpinned Load", 0);
613 * verify a Proj(Store) node
615 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
616 ir_mode *mode = get_irn_mode(p);
617 long proj = get_Proj_proj(p);
621 (proj == pn_Store_M && mode == mode_M) ||
622 (proj == pn_Store_X_regular && mode == mode_X) ||
623 (proj == pn_Store_X_except && mode == mode_X)
625 "wrong Proj from Store", 0,
626 show_proj_failure(p);
628 if (proj == pn_Store_X_regular) {
630 get_irn_pinned(n) == op_pin_state_pinned,
631 "Regular Proj from unpinned Store", 0);
632 } else if (proj == pn_Store_X_except) {
634 get_irn_pinned(n) == op_pin_state_pinned,
635 "Exception Proj from unpinned Store", 0);
641 * verify a Proj(Alloc) node
643 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
644 ir_mode *mode = get_irn_mode(p);
645 long proj = get_Proj_proj(p);
650 (proj == pn_Alloc_M && mode == mode_M) ||
651 (proj == pn_Alloc_X_regular && mode == mode_X) ||
652 (proj == pn_Alloc_X_except && mode == mode_X) ||
653 (proj == pn_Alloc_res && mode_is_reference(mode))
655 "wrong Proj from Alloc", 0,
656 show_proj_failure(p);
662 * verify a Proj(Proj) node
664 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
665 ir_mode *mode = get_irn_mode(p);
666 long proj = get_Proj_proj(p);
667 long nr = get_Proj_proj(pred);
668 ir_type *mt; /* A method type */
670 pred = skip_Id(get_Proj_pred(pred));
671 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
673 switch (get_irn_opcode(pred)) {
675 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
677 if (nr == pn_Start_T_args) {
679 (proj >= 0 && mode_is_datab(mode)),
680 "wrong Proj from Proj from Start", 0);
682 (proj < get_method_n_params(mt)),
683 "More Projs for args than args in type", 0
685 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
686 /* value argument */ break;
688 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
690 (mode == get_type_mode(get_method_param_type(mt, proj))),
691 "Mode of Proj from Start doesn't match mode of param type.", 0,
692 show_proj_mode_failure(p, get_method_param_type(mt, proj));
695 } else if (nr == pn_Start_P_value_arg_base) {
697 (proj >= 0 && mode_is_reference(mode)),
698 "wrong Proj from Proj from Start", 0
701 (proj < get_method_n_params(mt)),
702 "More Projs for args than args in type", 0
710 (proj >= 0 && mode_is_datab(mode)),
711 "wrong Proj from Proj from Call", 0);
712 mt = get_Call_type(pred);
714 (proj < get_method_n_ress(mt)),
715 "More Projs for results than results in type.", 0);
716 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
717 /* value result */ break;
720 (mode == get_type_mode(get_method_res_type(mt, proj))),
721 "Mode of Proj from Call doesn't match mode of result type.", 0);
730 /* hmm, optimization did not remove it */
734 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
741 * verify a Proj(Tuple) node
743 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
751 * verify a Proj(CallBegin) node
753 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
760 * verify a Proj(EndReg) node
762 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
765 #ifdef INTERPROCEDURAL_VIEW
767 (get_irp_ip_view_state() != ip_view_no),
768 "EndReg may only appear if ip view is constructed.", 0);
774 * verify a Proj(EndExcept) node
776 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
779 #ifdef INTERPROCEDURAL_VIEW
781 (get_irp_ip_view_state() != ip_view_no),
782 "EndExcept may only appear if ip view is constructed.", 0);
788 * verify a Proj(CopyB) node
790 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
791 ir_mode *mode = get_irn_mode(p);
792 long proj = get_Proj_proj(p);
796 (proj == pn_CopyB_M_regular && mode == mode_M) ||
797 (proj == pn_CopyB_X_regular && mode == mode_X) ||
798 (proj == pn_CopyB_X_except && mode == mode_X) ||
799 (proj == pn_CopyB_M_except && mode == mode_M)
801 "wrong Proj from CopyB", 0,
802 show_proj_failure(p);
804 if (proj == pn_CopyB_X_regular)
806 get_irn_pinned(n) == op_pin_state_pinned,
807 "Regular Proj from unpinned CopyB", 0);
808 else if (proj == pn_CopyB_X_except)
810 get_irn_pinned(n) == op_pin_state_pinned,
811 "Exception Proj from unpinned CopyB", 0);
816 * verify a Proj(Bound) node
818 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
819 ir_mode *mode = get_irn_mode(p);
820 long proj = get_Proj_proj(p);
822 /* ignore Bound checks of Bad */
823 if (is_Bad(get_Bound_index(n)))
827 (proj == pn_Bound_M && mode == mode_M) ||
828 (proj == pn_Bound_X_regular && mode == mode_X) ||
829 (proj == pn_Bound_X_except && mode == mode_X) ||
830 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
832 "wrong Proj from Bound", 0,
833 show_proj_failure(p);
842 verify_node_Proj(ir_node *p, ir_graph *irg) {
847 pred = skip_Id(get_Proj_pred(p));
848 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
850 op = get_irn_op(pred);
852 if (op->ops.verify_proj_node)
853 return op->ops.verify_proj_node(pred, p);
860 * verify a Block node
862 static int verify_node_Block(ir_node *n, ir_graph *irg) {
864 ir_node *mb = get_Block_MacroBlock(n);
866 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
868 if (is_Block(mb) && mb != n) {
871 /* Blocks with more than one predecessor must be header blocks */
872 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
873 if (get_irg_phase_state(irg) != phase_backend) {
874 pred = get_Block_cfgpred(n, 0);
876 /* the predecessor MUST be a regular Proj */
877 ir_node *frag_op = get_Proj_pred(pred);
879 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
880 "partBlock with non-regular predecessor", 0);
882 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
883 of fragile nodes during construction. It does not violate our assumption of dominance
885 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
886 "partBlock with non-regular predecessor", 0);
889 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
893 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
894 ir_node *pred = get_Block_cfgpred(n, i);
896 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
897 "Block node must have a mode_X predecessor", 0);
900 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
901 /* End block may only have Return, Raise or fragile ops as preds. */
902 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
903 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
904 if (is_Proj(pred) || is_Tuple(pred))
905 break; /* We can not test properly. How many tuples are there? */
913 "End Block node", 0);
915 /* irg attr must == graph we are in. */
916 if (! get_interprocedural_view()) {
917 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
923 * verify a Start node
925 static int verify_node_Start(ir_node *n, ir_graph *irg) {
926 ir_mode *mymode = get_irn_mode(n);
930 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
931 mymode == mode_T, "Start node", 0
939 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
940 ir_mode *mymode = get_irn_mode(n);
945 mymode == mode_X, "Jmp node", 0
951 * verify an IJmp node
953 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
954 ir_mode *mymode = get_irn_mode(n);
955 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
959 /* IJmp: BB x ref --> X */
960 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
966 * verify a Break node
968 static int verify_node_Break(ir_node *n, ir_graph *irg) {
969 ir_mode *mymode = get_irn_mode(n);
972 #ifdef INTERPROCEDURAL_VIEW
973 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
974 "Break may only appear if ip view is constructed.", 0);
978 mymode == mode_X, "Break node", 0
986 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
987 ir_mode *mymode = get_irn_mode(n);
988 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
992 /* Cond: BB x b --> X x X */
993 (op1mode == mode_b ||
994 /* Cond: BB x int --> X^n */
995 mode_is_int(op1mode) ), "Cond node", 0
997 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
1003 * verify a Return node
1005 static int verify_node_Return(ir_node *n, ir_graph *irg) {
1007 ir_mode *mymode = get_irn_mode(n);
1008 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
1011 /* Return: BB x M x data1 x ... x datan --> X */
1013 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1015 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1016 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1018 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1019 /* Compare returned results with result types of method type */
1020 mt = get_entity_type(get_irg_entity(irg));
1021 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1022 "Number of results for Return doesn't match number of results in type.", 0,
1023 show_return_nres(irg, n, mt););
1024 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1025 ir_type *res_type = get_method_res_type(mt, i);
1027 if (get_irg_phase_state(irg) != phase_backend) {
1028 if (is_atomic_type(res_type)) {
1030 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1031 "Mode of result for Return doesn't match mode of result type.", 0,
1032 show_return_modes(irg, n, mt, i);
1036 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1037 "Mode of result for Return doesn't match mode of result type.", 0,
1038 show_return_modes(irg, n, mt, i);
1047 * verify a Raise node
1049 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1050 ir_mode *mymode = get_irn_mode(n);
1051 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1052 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1056 /* Sel: BB x M x ref --> X x M */
1057 op1mode == mode_M && mode_is_reference(op2mode) &&
1058 mymode == mode_T, "Raise node", 0
1064 * verify a Const node
1066 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1067 ir_mode *mymode = get_irn_mode(n);
1071 /* Const: BB --> data */
1072 (mode_is_data(mymode) ||
1073 mymode == mode_b) /* we want boolean constants for static evaluation */
1074 ,"Const node", 0 /* of Cmp. */
1077 /* the modes of the constant and teh tarval must match */
1078 mymode == get_tarval_mode(get_Const_tarval(n)),
1079 "Const node, tarval and node mode mismatch", 0
1085 * verify a SymConst node
1087 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1088 ir_mode *mymode = get_irn_mode(n);
1091 if (get_SymConst_kind(n) == symconst_addr_ent) {
1092 ir_entity *ent = get_SymConst_entity(n);
1093 if (is_Method_type(get_entity_type(ent)) &&
1094 get_irn_irg(n) != get_const_code_irg()) {
1096 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1097 "A constant must address an existing method.", 0);
1102 /* SymConst: BB --> int*/
1103 (mode_is_int(mymode) ||
1104 /* SymConst: BB --> ref */
1105 mode_is_reference(mymode))
1106 ,"SymConst node", 0);
1113 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1115 ir_mode *mymode = get_irn_mode(n);
1116 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1117 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1122 /* Sel: BB x M x ref x int^n --> ref */
1123 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1124 "Sel node", 0, show_node_failure(n)
1127 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1128 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1130 ent = get_Sel_entity(n);
1131 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1136 * verify an InstOf node
1138 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1139 ir_mode *mymode = get_irn_mode(n);
1140 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1143 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1144 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1149 * Check if the pinned state is right.
1151 static int verify_right_pinned(ir_node *n) {
1154 if (get_irn_pinned(n) == op_pin_state_pinned)
1156 mem = get_Call_mem(n);
1158 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1159 if (is_NoMem(mem) || is_Pin(mem))
1165 * verify a Call node
1167 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1168 ir_mode *mymode = get_irn_mode(n);
1169 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1170 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1175 /* Call: BB x M x ref x data1 x ... x datan
1176 --> M x datan+1 x ... x data n+m */
1177 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1179 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1180 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1182 mt = get_Call_type(n);
1183 if(get_unknown_type() == mt) {
1187 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1188 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1191 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1192 /* Compare arguments of node with those of type */
1194 if (get_method_variadicity(mt) == variadicity_variadic) {
1196 get_Call_n_params(n) >= get_method_n_params(mt),
1197 "Number of args for Call doesn't match number of args in variadic type.",
1199 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1200 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1204 get_Call_n_params(n) == get_method_n_params(mt),
1205 "Number of args for Call doesn't match number of args in non variadic type.",
1207 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1208 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1212 for (i = 0; i < get_method_n_params(mt); i++) {
1213 ir_type *t = get_method_param_type(mt, i);
1215 if (get_irg_phase_state(irg) != phase_backend) {
1216 if (is_atomic_type(t)) {
1218 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1219 "Mode of arg for Call doesn't match mode of arg type.", 0,
1220 show_call_param(n, mt);
1223 /* call with a compound type, mode must be reference */
1225 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1226 "Mode of arg for Call doesn't match mode of arg type.", 0,
1227 show_call_param(n, mt);
1234 if (Call_has_callees(n)) {
1235 for (i = 0; i < get_Call_n_callees(n); i++) {
1236 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1244 * verify an Add node
1246 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1247 ir_mode *mymode = get_irn_mode(n);
1248 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1249 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1254 /* common Add: BB x numP x numP --> numP */
1255 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1256 /* Pointer Add: BB x ref x int --> ref */
1257 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1258 /* Pointer Add: BB x int x ref --> ref */
1259 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1262 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1263 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1264 "/* Pointer Add: BB x int x ref --> ref */");
1272 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1273 ir_mode *mymode = get_irn_mode(n);
1274 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1275 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1280 /* common Sub: BB x numP x numP --> numP */
1281 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1282 /* Pointer Sub: BB x ref x int --> ref */
1283 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1284 /* Pointer Sub: BB x ref x ref --> int */
1285 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1288 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1289 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1290 "/* Pointer Sub: BB x ref x ref --> int */" );
1296 * verify a Minus node
1298 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1299 ir_mode *mymode = get_irn_mode(n);
1300 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1304 /* Minus: BB x num --> num */
1305 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1306 show_unop_failure(n , "/* Minus: BB x num --> num */");
1314 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1315 ir_mode *mymode = get_irn_mode(n);
1316 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1317 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1322 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1323 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1324 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1325 /* Mul: BB x float x float --> float */
1326 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1329 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1330 "/* Mul: BB x float x float --> float */");
1336 * verify a Mulh node
1338 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1339 ir_mode *mymode = get_irn_mode(n);
1340 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1341 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1346 /* Mulh: BB x int x int --> int */
1347 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1350 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1356 * verify a Quot node
1358 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1359 ir_mode *mymode = get_irn_mode(n);
1360 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1361 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1362 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1366 /* Quot: BB x M x float x float --> M x X x float */
1367 op1mode == mode_M && op2mode == op3mode &&
1368 get_mode_sort(op2mode) == irms_float_number &&
1371 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1377 * verify a DivMod node
1379 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1380 ir_mode *mymode = get_irn_mode(n);
1381 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1382 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1383 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1387 /* DivMod: BB x M x int x int --> M x X x int x int */
1388 op1mode == mode_M &&
1389 mode_is_int(op2mode) &&
1390 op3mode == op2mode &&
1400 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1401 ir_mode *mymode = get_irn_mode(n);
1402 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1403 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1404 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1408 /* Div: BB x M x int x int --> M x X x int */
1409 op1mode == mode_M &&
1410 op2mode == op3mode &&
1411 mode_is_int(op2mode) &&
1421 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1422 ir_mode *mymode = get_irn_mode(n);
1423 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1424 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1425 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1429 /* Mod: BB x M x int x int --> M x X x int */
1430 op1mode == mode_M &&
1431 op2mode == op3mode &&
1432 mode_is_int(op2mode) &&
1440 * verify an Abs node
1442 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1443 ir_mode *mymode = get_irn_mode(n);
1444 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1448 /* Abs: BB x num --> num */
1449 op1mode == mymode &&
1450 mode_is_num (op1mode),
1452 show_unop_failure(n, "/* Abs: BB x num --> num */");
1458 * verify a logical And, Or, Eor node
1460 static int verify_node_Logic(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 /* And or Or or Eor: BB x int x int --> int */
1468 (mode_is_int(mymode) || mymode == mode_b) &&
1469 op2mode == op1mode &&
1471 "And, Or or Eor node", 0,
1472 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1477 #define verify_node_And verify_node_Logic
1478 #define verify_node_Or verify_node_Logic
1479 #define verify_node_Eor verify_node_Logic
1484 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1485 ir_mode *mymode = get_irn_mode(n);
1486 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1490 /* Not: BB x int --> int */
1491 (mode_is_int(mymode) || mymode == mode_b) &&
1494 show_unop_failure(n, "/* Not: BB x int --> int */");
1502 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1503 ir_mode *mymode = get_irn_mode(n);
1504 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1505 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1509 /* Cmp: BB x datab x datab --> b16 */
1510 mode_is_datab(op1mode) &&
1511 op2mode == op1mode &&
1514 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1520 * verify a Shift node
1522 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1523 ir_mode *mymode = get_irn_mode(n);
1524 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1525 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1529 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1530 mode_is_int(op1mode) &&
1531 mode_is_int(op2mode) &&
1532 !mode_is_signed(op2mode) &&
1534 "Shl, Shr or Shrs node", 0,
1535 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1540 #define verify_node_Shl verify_node_Shift
1541 #define verify_node_Shr verify_node_Shift
1542 #define verify_node_Shrs verify_node_Shift
1545 * verify a Rotl node
1547 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1548 ir_mode *mymode = get_irn_mode(n);
1549 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1550 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1554 /* Rotl: BB x int x int --> int */
1555 mode_is_int(op1mode) &&
1556 mode_is_int(op2mode) &&
1559 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1565 * verify a Conv node
1567 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1568 ir_mode *mymode = get_irn_mode(n);
1569 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1573 get_irg_phase_state(irg) == phase_backend ||
1574 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1576 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1582 * verify a Cast node
1584 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1585 ir_mode *mymode = get_irn_mode(n);
1586 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1590 /* Conv: BB x datab1 --> datab2 */
1591 mode_is_data(op1mode) && op1mode == mymode,
1593 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1601 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1602 ir_mode *mymode = get_irn_mode(n);
1603 ir_node *block = get_nodes_block(n);
1607 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1608 /* a Phi node MUST have the same number of inputs as its block */
1610 get_irn_arity(n) == get_irn_arity(block),
1611 "wrong number of inputs in Phi node", 0,
1612 show_phi_inputs(n, block);
1616 /* Phi: BB x dataM^n --> dataM */
1617 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1618 ir_node *pred = get_Phi_pred(n, i);
1619 if (!is_Bad(pred)) {
1621 get_irn_mode(pred) == mymode,
1623 show_phi_failure(n, pred, i);
1627 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1629 if (mymode == mode_M) {
1630 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1632 ir_node *pred_i = get_Phi_pred(n, i);
1636 for (j = i - 1; j >= 0; --j) {
1637 ir_node *pred_j = get_Phi_pred(n, j);
1642 /* currently this checks fails for blocks with exception
1643 outputs (and these are NOT basic blocks). So it is disabled yet. */
1645 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1646 "At least two different PhiM predecessors are in the same block",
1648 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1658 * verify a Filter node
1660 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1663 #ifdef INTERPROCEDURAL_VIEW
1664 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1665 "Filter may only appear if ip view is constructed.", 0);
1667 /* We should further do tests as for Proj and Phi. */
1672 * verify a Load node
1674 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1675 ir_mode *mymode = get_irn_mode(n);
1676 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1677 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1679 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1680 if (get_irg_phase_state(irg) != phase_backend) {
1681 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1683 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1684 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1686 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1689 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1690 * (Proj (Proj))) sometimes ...
1692 * interprete.c:ai_eval seems to assume that this happens, too
1694 * obset.c:get_abstval_any can't deal with this if the load has
1698 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1699 assert ((NULL != ent) || (mymode != mode_T));
1707 * verify a Store node
1709 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1712 ir_mode *mymode = get_irn_mode(n);
1713 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1714 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1715 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1717 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1718 if (get_irg_phase_state(irg) != phase_backend) {
1719 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1721 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1722 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1724 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1726 target = get_ptr_entity(get_Store_ptr(n));
1727 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1729 * If lowered code, any Sels that add 0 may be removed, causing
1730 * an direct access to entities of array or compound type.
1731 * Prevent this by checking the phase.
1733 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1741 * verify an Alloc node
1743 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1744 ir_mode *mymode = get_irn_mode(n);
1745 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1746 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1750 /* Alloc: BB x M x int_u --> M x X x ref */
1751 op1mode == mode_M &&
1752 mode_is_int(op2mode) &&
1753 !mode_is_signed(op2mode) &&
1756 show_node_failure(n);
1762 * verify a Free node
1764 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1765 ir_mode *mymode = get_irn_mode(n);
1766 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1767 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1768 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1772 /* Free: BB x M x ref x int_u --> M */
1773 op1mode == mode_M && mode_is_reference(op2mode) &&
1774 mode_is_int(op3mode) &&
1775 !mode_is_signed(op3mode) &&
1778 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1784 * verify a Sync node
1786 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1788 ir_mode *mymode = get_irn_mode(n);
1791 /* Sync: BB x M^n --> M */
1792 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1793 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1795 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1800 * verify a Confirm node
1802 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1803 ir_mode *mymode = get_irn_mode(n);
1804 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1805 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1809 /* Confirm: BB x T x T --> T */
1810 op1mode == mymode &&
1813 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1821 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1822 ir_mode *mymode = get_irn_mode(n);
1823 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1824 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1825 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1829 /* Mux: BB x b x datab x datab --> datab */
1830 op1mode == mode_b &&
1831 op2mode == mymode &&
1832 op3mode == mymode &&
1833 mode_is_datab(mymode),
1840 * verify a CopyB node
1842 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1843 ir_mode *mymode = get_irn_mode(n);
1844 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1845 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1846 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1847 ir_type *t = get_CopyB_type(n);
1849 /* CopyB: BB x M x ref x ref --> M x X */
1850 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1851 if (get_irg_phase_state(irg) != phase_backend) {
1852 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1855 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1856 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1857 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1858 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1862 is_compound_type(t),
1863 "CopyB node should copy compound types only", 0 );
1865 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1866 This should happen RARELY, as CopyB COPIES MEMORY */
1867 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1872 * verify a Bound node
1874 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1875 ir_mode *mymode = get_irn_mode(n);
1876 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1877 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1878 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1879 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1882 /* Bound: BB x M x int x int x int --> M x X */
1885 op1mode == mode_M &&
1886 op2mode == op3mode &&
1887 op3mode == op4mode &&
1888 mode_is_int(op3mode),
1895 * For each usage of a node, it is checked, if the block of the
1896 * node dominates the block of the usage (for phis: the predecessor
1897 * block of the phi for the corresponding edge).
1899 * @return non-zero on success, 0 on dominance error
1901 static int check_dominance_for_node(ir_node *use) {
1902 if (is_Block(use)) {
1903 ir_node *mbh = get_Block_MacroBlock(use);
1906 /* must be a partBlock */
1907 if (is_Block(mbh)) {
1908 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1912 /* This won't work for blocks and the end node */
1913 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1915 ir_node *bl = get_nodes_block(use);
1917 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1918 ir_node *def = get_irn_n(use, i);
1919 ir_node *def_bl = get_nodes_block(def);
1920 ir_node *use_bl = bl;
1922 /* ignore dead definition blocks, will be removed */
1923 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1927 use_bl = get_Block_cfgpred_block(bl, i);
1929 /* ignore dead use blocks, will be removed */
1930 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1934 block_dominates(def_bl, use_bl),
1935 "the definition of a value used violates the dominance property", 0,
1937 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1938 current_ir_graph, def_bl, def, use_bl, use, i
1946 /* Tests the modes of n and its predecessors. */
1947 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1951 if (!get_node_verification_mode())
1954 if (!get_interprocedural_view()) {
1956 * do NOT check placement in interprocedural view, as we don't always know
1957 * the "right" graph ...
1960 node_is_in_irgs_storage(irg, n),
1961 "Node is not stored on proper IR graph!", 0,
1962 show_node_on_graph(irg, n);
1964 assert(get_irn_irg(n) == irg);
1966 unsigned idx = get_irn_idx(n);
1967 ir_node *node_from_map = get_idx_irn(irg, idx);
1968 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0, ir_printf("node %+F node in map %+F(%p)", n, node_from_map, node_from_map));
1974 /* We don't want to test nodes whose predecessors are Bad,
1975 as we would have to special case that for each operation. */
1976 if (op != op_Phi && op != op_Block) {
1977 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1978 if (is_Bad(get_irn_n(n, i)))
1983 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1984 op_pin_state state = get_irn_pinned(n);
1986 state == op_pin_state_floats ||
1987 state == op_pin_state_pinned,
1988 "invalid pin state", 0,
1989 ir_printf("node %+F", n));
1992 if (op->ops.verify_node)
1993 return op->ops.verify_node(n, irg);
1999 int irn_vrfy(ir_node *n) {
2000 #ifdef DEBUG_libfirm
2001 return irn_vrfy_irg(n, current_ir_graph);
2008 /*-----------------------------------------------------------------*/
2009 /* Verify the whole graph. */
2010 /*-----------------------------------------------------------------*/
2012 #ifdef DEBUG_libfirm
2014 * Walker to check every node
2016 static void vrfy_wrap(ir_node *node, void *env) {
2018 *res = irn_vrfy(node);
2022 * Walker to check every node including SSA property.
2023 * Only called if dominance info is available.
2025 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2028 *res = irn_vrfy(node);
2030 *res = check_dominance_for_node(node);
2034 #endif /* DEBUG_libfirm */
2037 * Calls irn_vrfy for each node in irg.
2038 * Graph must be in state "op_pin_state_pinned".
2039 * If dominance info is available, check the SSA property.
2041 int irg_verify(ir_graph *irg, unsigned flags) {
2043 #ifdef DEBUG_libfirm
2046 rem = current_ir_graph;
2047 current_ir_graph = irg;
2050 last_irg_error = NULL;
2053 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2055 if (flags & VRFY_ENFORCE_SSA)
2060 get_irg_dom_state(irg) == dom_consistent &&
2061 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2065 current_ir_graph = rem;
2067 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2068 ir_entity *ent = get_irg_entity(current_ir_graph);
2071 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2073 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
2078 #endif /* DEBUG_libfirm */
2083 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2085 firm_verification_t old = get_node_verification_mode();
2087 firm_vrfy_failure_msg = NULL;
2088 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2089 res = irn_vrfy_irg(n, irg);
2090 if (res && get_irg_dom_state(irg) == dom_consistent &&
2091 get_irg_pinned(irg) == op_pin_state_pinned)
2092 res = check_dominance_for_node(n);
2093 do_node_verification(old);
2094 *bad_string = firm_vrfy_failure_msg;
2100 typedef struct _vrfy_bad_env_t {
2106 * Pre-Walker: check Bad predecessors of node.
2108 static void check_bads(ir_node *node, void *env) {
2109 vrfy_bad_env_t *venv = env;
2110 int i, arity = get_irn_arity(node);
2112 if (is_Block(node)) {
2113 if ((venv->flags & BAD_CF) == 0) {
2115 /* check for Bad Block predecessor */
2116 for (i = 0; i < arity; ++i) {
2117 ir_node *pred = get_irn_n(node, i);
2120 venv->res |= BAD_CF;
2122 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2123 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2125 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2126 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2127 assert(0 && "Bad CF detected");
2133 if ((venv->flags & BAD_BLOCK) == 0) {
2135 /* check for Bad Block */
2136 if (is_Bad(get_nodes_block(node))) {
2137 venv->res |= BAD_BLOCK;
2139 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2140 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2142 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2143 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2144 assert(0 && "Bad CF detected");
2149 if ((venv->flags & TUPLE) == 0) {
2150 if (is_Tuple(node)) {
2153 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2154 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2156 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2157 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2158 assert(0 && "Tuple detected");
2163 for (i = 0; i < arity; ++i) {
2164 ir_node *pred = get_irn_n(node, i);
2167 /* check for Phi with Bad inputs */
2168 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2169 if (venv->flags & BAD_CF)
2172 venv->res |= BAD_CF;
2174 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2175 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2177 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2178 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2179 assert(0 && "Bad CF detected");
2184 /* Bad node input */
2185 if ((venv->flags & BAD_DF) == 0) {
2186 venv->res |= BAD_DF;
2188 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2189 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2191 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2192 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2193 assert(0 && "Bad NON-CF detected");
2202 * verify occurrence of bad nodes
2204 int irg_vrfy_bads(ir_graph *irg, int flags) {
2210 irg_walk_graph(irg, check_bads, NULL, &env);
2216 * set the default verify operation
2218 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2221 ops->verify_node = verify_node_##a; \
2278 ops->verify_proj_node = verify_node_Proj_##a; \