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"
41 /** if this flag is set, verify entity types in Load & Store nodes */
42 static int vrfy_entities = 0;
44 const char *firm_vrfy_failure_msg;
46 /* enable verification of Load/Store entities */
47 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) {
59 return get_mode_name(mode);
62 /** the last IRG, on which a verification error was found */
63 static ir_graph *last_irg_error = NULL;
66 * print the name of the entity of an verification failure
68 * @param node the node caused the failure
70 static void show_entity_failure(ir_node *node) {
71 ir_graph *irg = get_irn_irg(node);
73 if (last_irg_error == irg)
78 if (irg == get_const_code_irg()) {
79 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
81 ir_entity *ent = get_irg_entity(irg);
84 ir_type *ent_type = get_entity_owner(ent);
87 if (ent_type == get_glob_type())
88 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
90 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(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) {
104 show_entity_failure(n);
105 fprintf(stderr, " node %ld %s%s\n" ,
107 get_irn_opname(n), get_irn_modename(n)
112 * Prints a failure message for a binop
114 static void show_binop_failure(ir_node *n, const char *text) {
115 ir_node *left = get_binop_left(n);
116 ir_node *right = get_binop_right(n);
118 show_entity_failure(n);
119 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
121 get_irn_opname(n), get_irn_modename(n),
122 get_irn_opname(left), get_irn_modename(left),
123 get_irn_opname(right), get_irn_modename(right),
128 * Prints a failure message for an unop
130 static void show_unop_failure(ir_node *n, const char *text) {
131 ir_node *op = get_unop_op(n);
133 show_entity_failure(n);
134 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
136 get_irn_opname(n), get_irn_modename(n),
137 get_irn_opname(op), get_irn_modename(op),
142 * Prints a failure message for an op with 3 operands
144 static void show_triop_failure(ir_node *n, const char *text) {
145 ir_node *op0 = get_irn_n(n, 0);
146 ir_node *op1 = get_irn_n(n, 1);
147 ir_node *op2 = get_irn_n(n, 2);
149 show_entity_failure(n);
150 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
152 get_irn_opname(n), get_irn_modename(n),
153 get_irn_opname(op0), get_irn_modename(op0),
154 get_irn_opname(op1), get_irn_modename(op1),
155 get_irn_opname(op2), get_irn_modename(op2),
160 * Prints a failure message for a proj
162 static void show_proj_failure(ir_node *n) {
163 ir_node *op = get_Proj_pred(n);
164 int proj = get_Proj_proj(n);
166 show_entity_failure(n);
167 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
169 get_irn_opname(n), get_irn_modename(n), proj,
170 get_irn_opname(op), get_irn_modename(op));
174 * Prints a failure message for a proj from Start
176 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
177 long proj = get_Proj_proj(n);
178 ir_mode *m = get_type_mode(ty);
180 show_entity_failure(n);
181 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
186 get_mode_name_ex(m));
190 * Prints a failure message for a proj
192 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
193 ir_node *op = get_Proj_pred(n);
194 int proj = get_Proj_proj(n);
195 ir_mode *m = get_type_mode(get_entity_type(ent));
197 show_entity_failure(n);
198 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
200 get_irn_opname(n), get_irn_modename(n), proj,
201 get_irn_opname(op), get_irn_modename(op),
202 get_entity_name(ent), get_type_name(get_entity_type(ent)),
203 get_mode_name_ex(m));
207 * Show a node and a graph
209 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
210 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
214 * Show call parameters
216 static void show_call_param(ir_node *n, ir_type *mt) {
219 show_entity_failure(n);
220 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
221 for (i = 0; i < get_method_n_params(mt); ++i) {
222 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
224 fprintf(stderr, ") != CALL(");
226 for (i = 0; i < get_Call_n_params(n); ++i) {
227 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
229 fprintf(stderr, ")\n");
235 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
236 ir_entity *ent = get_irg_entity(irg);
238 show_entity_failure(n);
239 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
240 get_irn_node_nr(n), get_entity_name(ent),
241 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
242 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
247 * Show return number of results
249 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
250 ir_entity *ent = get_irg_entity(irg);
252 show_entity_failure(n);
253 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
254 get_irn_node_nr(n), get_entity_name(ent),
255 get_Return_n_ress(n), get_method_n_ress(mt));
261 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
263 show_entity_failure(phi);
264 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
265 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
266 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
272 static void show_phi_inputs(ir_node *phi, ir_node *block) {
273 show_entity_failure(phi);
274 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
275 get_irn_node_nr(phi), get_irn_arity(phi),
276 get_irn_node_nr(block), get_irn_arity(block));
279 #endif /* #ifndef NDEBUG */
282 * If the address is Sel or SymConst, return the entity.
284 * @param ptr the node representing the address
286 static ir_entity *get_ptr_entity(ir_node *ptr) {
288 return get_Sel_entity(ptr);
289 } else if (is_SymConst_addr_ent(ptr)) {
290 return get_SymConst_entity(ptr);
296 * verify a Proj(Start) node
298 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
299 ir_mode *mode = get_irn_mode(p);
300 long proj = get_Proj_proj(p);
305 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
306 (proj == pn_Start_M && mode == mode_M) ||
307 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
308 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
309 (proj == pn_Start_T_args && mode == mode_T)
311 "wrong Proj from Start", 0,
312 show_proj_failure(p);
318 * verify a Proj(Cond) node
320 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
321 ir_mode *mode = get_irn_mode(p);
322 long proj = get_Proj_proj(p);
326 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
327 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
328 is_Bad(get_Cond_selector(pred)) /* rare */
330 "wrong Proj from Cond", 0,
331 show_proj_failure(p);
337 * verify a Proj(Raise) node
339 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
340 ir_mode *mode = get_irn_mode(p);
341 long proj = get_Proj_proj(p);
345 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
346 "wrong Proj from Raise", 0,
347 show_proj_failure(p);
353 * verify a Proj(InstOf) node
355 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
356 ir_mode *mode = get_irn_mode(p);
357 long proj = get_Proj_proj(p);
362 (proj == pn_InstOf_M_regular && mode == mode_M) ||
363 (proj == pn_InstOf_X_regular && mode == mode_X) ||
364 (proj == pn_InstOf_X_except && mode == mode_X) ||
365 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
366 (proj == pn_InstOf_M_except && mode == mode_M)
368 "wrong Proj from InstOf", 0,
369 show_proj_failure(p);
375 * verify a Proj(Call) node
377 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
378 ir_mode *mode = get_irn_mode(p);
379 long proj = get_Proj_proj(p);
383 (proj == pn_Call_M_regular && mode == mode_M) ||
384 (proj == pn_Call_X_regular && mode == mode_X) ||
385 (proj == pn_Call_X_except && mode == mode_X) ||
386 (proj == pn_Call_T_result && mode == mode_T) ||
387 (proj == pn_Call_M_except && mode == mode_M) ||
388 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
390 "wrong Proj from Call", 0,
391 show_proj_failure(p);
393 /* if we have exception flow, we must have a real Memory input */
394 if (proj == pn_Call_X_regular)
396 !is_NoMem(get_Call_mem(n)),
397 "Regular Proj from FunctionCall", 0);
398 else if (proj == pn_Call_X_except)
400 !is_NoMem(get_Call_mem(n)),
401 "Exception Proj from FunctionCall", 0);
402 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
404 (!is_NoMem(get_Call_mem(n)) || 1),
405 "Memory Proj from FunctionCall", 0);
410 * verify a Proj(Quot) node
412 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
413 ir_mode *mode = get_irn_mode(p);
414 long proj = get_Proj_proj(p);
418 (proj == pn_Quot_M && mode == mode_M) ||
419 (proj == pn_Quot_X_regular && mode == mode_X) ||
420 (proj == pn_Quot_X_except && mode == mode_X) ||
421 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
423 "wrong Proj from Quot", 0,
424 show_proj_failure(p);
426 if (proj == pn_Quot_X_regular)
428 get_irn_pinned(n) == op_pin_state_pinned,
429 "Regular Proj from unpinned Quot", 0);
430 else if (proj == pn_Quot_X_except)
432 get_irn_pinned(n) == op_pin_state_pinned,
433 "Exception Proj from unpinned Quot", 0);
434 else if (proj == pn_Quot_M)
436 get_irn_pinned(n) == op_pin_state_pinned,
437 "Memory Proj from unpinned Quot", 0);
442 * verify a Proj(DivMod) node
444 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
445 ir_mode *mode = get_irn_mode(p);
446 long proj = get_Proj_proj(p);
450 (proj == pn_DivMod_M && mode == mode_M) ||
451 (proj == pn_DivMod_X_regular && mode == mode_X) ||
452 (proj == pn_DivMod_X_except && mode == mode_X) ||
453 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
454 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
456 "wrong Proj from DivMod", 0,
457 show_proj_failure(p);
459 if (proj == pn_DivMod_X_regular)
461 get_irn_pinned(n) == op_pin_state_pinned,
462 "Regular Proj from unpinned DivMod", 0);
463 else if (proj == pn_DivMod_X_except)
465 get_irn_pinned(n) == op_pin_state_pinned,
466 "Exception Proj from unpinned DivMod", 0);
467 else if (proj == pn_DivMod_M)
469 get_irn_pinned(n) == op_pin_state_pinned,
470 "Memory Proj from unpinned DivMod", 0);
475 * verify a Proj(Div) node
477 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
478 ir_mode *mode = get_irn_mode(p);
479 long proj = get_Proj_proj(p);
483 (proj == pn_Div_M && mode == mode_M) ||
484 (proj == pn_Div_X_regular && mode == mode_X) ||
485 (proj == pn_Div_X_except && mode == mode_X) ||
486 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
488 "wrong Proj from Div", 0,
489 show_proj_failure(p);
491 if (proj == pn_Div_X_regular)
493 get_irn_pinned(n) == op_pin_state_pinned,
494 "Regular Proj from unpinned Div", 0);
495 else if (proj == pn_Div_X_except)
497 get_irn_pinned(n) == op_pin_state_pinned,
498 "Exception Proj from unpinned Div", 0);
499 else if (proj == pn_Div_M)
501 get_irn_pinned(n) == op_pin_state_pinned,
502 "Memory Proj from unpinned Div", 0);
507 * verify a Proj(Mod) node
509 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
510 ir_mode *mode = get_irn_mode(p);
511 long proj = get_Proj_proj(p);
515 (proj == pn_Mod_M && mode == mode_M) ||
516 (proj == pn_Mod_X_regular && mode == mode_X) ||
517 (proj == pn_Mod_X_except && mode == mode_X) ||
518 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
520 "wrong Proj from Mod", 0,
521 show_proj_failure(p);
523 if (proj == pn_Mod_X_regular)
525 get_irn_pinned(n) == op_pin_state_pinned,
526 "Regular Proj from unpinned Mod", 0);
527 else if (proj == pn_Mod_X_except)
529 get_irn_pinned(n) == op_pin_state_pinned,
530 "Exception Proj from unpinned Mod", 0);
531 else if (proj == pn_Mod_M)
533 get_irn_pinned(n) == op_pin_state_pinned,
534 "Memory Proj from unpinned Div", 0);
539 * verify a Proj(Cmp) node
541 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
542 ir_mode *mode = get_irn_mode(p);
543 long proj = get_Proj_proj(p);
547 (proj >= 0 && proj <= 15 && mode == mode_b),
548 "wrong Proj from Cmp", 0,
549 show_proj_failure(p);
552 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
553 "unordered Proj for non-float Cmp", 0,
554 show_proj_failure(p);
560 * verify a Proj(Load) node
562 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
563 ir_mode *mode = get_irn_mode(p);
564 long proj = get_Proj_proj(p);
566 if (proj == pn_Load_res) {
567 ir_node *ptr = get_Load_ptr(n);
568 ir_entity *ent = get_ptr_entity(ptr);
570 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
571 /* do NOT check this for lowered phases, see comment on Store */
573 (mode == get_type_mode(get_entity_type(ent))),
574 "wrong data Proj from Load, entity type_mode failed", 0,
575 show_proj_failure_ent(p, ent);
580 mode_is_data(mode) && mode == get_Load_mode(n),
581 "wrong data Proj from Load", 0,
582 show_proj_failure(p);
589 (proj == pn_Load_M && mode == mode_M) ||
590 (proj == pn_Load_X_regular && mode == mode_X) ||
591 (proj == pn_Load_X_except && mode == mode_X)
593 "wrong Proj from Load", 0,
594 show_proj_failure(p);
597 if (proj == pn_Load_X_regular) {
599 get_irn_pinned(n) == op_pin_state_pinned,
600 "Regular Proj from unpinned Load", 0);
601 } else if (proj == pn_Load_X_except) {
603 get_irn_pinned(n) == op_pin_state_pinned,
604 "Exception Proj from unpinned Load", 0);
610 * verify a Proj(Store) node
612 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
613 ir_mode *mode = get_irn_mode(p);
614 long proj = get_Proj_proj(p);
618 (proj == pn_Store_M && mode == mode_M) ||
619 (proj == pn_Store_X_regular && mode == mode_X) ||
620 (proj == pn_Store_X_except && mode == mode_X)
622 "wrong Proj from Store", 0,
623 show_proj_failure(p);
625 if (proj == pn_Store_X_regular) {
627 get_irn_pinned(n) == op_pin_state_pinned,
628 "Regular Proj from unpinned Store", 0);
629 } else if (proj == pn_Store_X_except) {
631 get_irn_pinned(n) == op_pin_state_pinned,
632 "Exception Proj from unpinned Store", 0);
638 * verify a Proj(Alloc) node
640 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
641 ir_mode *mode = get_irn_mode(p);
642 long proj = get_Proj_proj(p);
647 (proj == pn_Alloc_M && mode == mode_M) ||
648 (proj == pn_Alloc_X_regular && mode == mode_X) ||
649 (proj == pn_Alloc_X_except && mode == mode_X) ||
650 (proj == pn_Alloc_res && mode_is_reference(mode))
652 "wrong Proj from Alloc", 0,
653 show_proj_failure(p);
659 * verify a Proj(Proj) node
661 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
662 ir_mode *mode = get_irn_mode(p);
663 long proj = get_Proj_proj(p);
664 long nr = get_Proj_proj(pred);
665 ir_type *mt; /* A method type */
667 pred = skip_Id(get_Proj_pred(pred));
668 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
670 switch (get_irn_opcode(pred)) {
672 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
674 if (nr == pn_Start_T_args) {
676 (proj >= 0 && mode_is_datab(mode)),
677 "wrong Proj from Proj from Start", 0);
679 (proj < get_method_n_params(mt)),
680 "More Projs for args than args in type", 0
682 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
683 /* value argument */ break;
685 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
687 (mode == get_type_mode(get_method_param_type(mt, proj))),
688 "Mode of Proj from Start doesn't match mode of param type.", 0,
689 show_proj_mode_failure(p, get_method_param_type(mt, proj));
698 (proj >= 0 && mode_is_datab(mode)),
699 "wrong Proj from Proj from Call", 0);
700 mt = get_Call_type(pred);
702 (proj < get_method_n_ress(mt)),
703 "More Projs for results than results in type.", 0);
704 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
705 /* value result */ break;
708 (mode == get_type_mode(get_method_res_type(mt, proj))),
709 "Mode of Proj from Call doesn't match mode of result type.", 0);
718 /* hmm, optimization did not remove it */
722 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
729 * verify a Proj(Tuple) node
731 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
739 * verify a Proj(CallBegin) node
741 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
748 * verify a Proj(EndReg) node
750 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
753 #ifdef INTERPROCEDURAL_VIEW
755 (get_irp_ip_view_state() != ip_view_no),
756 "EndReg may only appear if ip view is constructed.", 0);
762 * verify a Proj(EndExcept) node
764 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
767 #ifdef INTERPROCEDURAL_VIEW
769 (get_irp_ip_view_state() != ip_view_no),
770 "EndExcept may only appear if ip view is constructed.", 0);
776 * verify a Proj(CopyB) node
778 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
779 ir_mode *mode = get_irn_mode(p);
780 long proj = get_Proj_proj(p);
784 (proj == pn_CopyB_M_regular && mode == mode_M) ||
785 (proj == pn_CopyB_X_regular && mode == mode_X) ||
786 (proj == pn_CopyB_X_except && mode == mode_X) ||
787 (proj == pn_CopyB_M_except && mode == mode_M)
789 "wrong Proj from CopyB", 0,
790 show_proj_failure(p);
792 if (proj == pn_CopyB_X_regular)
794 get_irn_pinned(n) == op_pin_state_pinned,
795 "Regular Proj from unpinned CopyB", 0);
796 else if (proj == pn_CopyB_X_except)
798 get_irn_pinned(n) == op_pin_state_pinned,
799 "Exception Proj from unpinned CopyB", 0);
804 * verify a Proj(Bound) node
806 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
807 ir_mode *mode = get_irn_mode(p);
808 long proj = get_Proj_proj(p);
810 /* ignore Bound checks of Bad */
811 if (is_Bad(get_Bound_index(n)))
815 (proj == pn_Bound_M && mode == mode_M) ||
816 (proj == pn_Bound_X_regular && mode == mode_X) ||
817 (proj == pn_Bound_X_except && mode == mode_X) ||
818 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
820 "wrong Proj from Bound", 0,
821 show_proj_failure(p);
830 verify_node_Proj(ir_node *p, ir_graph *irg) {
834 pred = skip_Id(get_Proj_pred(p));
835 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
836 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);
838 op = get_irn_op(pred);
840 if (op->ops.verify_proj_node)
841 return op->ops.verify_proj_node(pred, p);
848 * verify a Block node
850 static int verify_node_Block(ir_node *n, ir_graph *irg) {
852 ir_node *mb = get_Block_MacroBlock(n);
854 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
856 if (is_Block(mb) && mb != n) {
859 /* Blocks with more than one predecessor must be header blocks */
860 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
861 if (get_irg_phase_state(irg) != phase_backend) {
862 pred = get_Block_cfgpred(n, 0);
864 /* the predecessor MUST be a regular Proj */
865 ir_node *frag_op = get_Proj_pred(pred);
867 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
868 "partBlock with non-regular predecessor", 0);
870 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
871 of fragile nodes during construction. It does not violate our assumption of dominance
873 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
874 "partBlock with non-regular predecessor", 0);
877 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
881 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
882 ir_node *pred = get_Block_cfgpred(n, i);
884 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
885 "Block node must have a mode_X predecessor", 0);
888 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
889 /* End block may only have Return, Raise or fragile ops as preds. */
890 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
891 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
892 if (is_Proj(pred) || is_Tuple(pred))
893 break; /* We can not test properly. How many tuples are there? */
901 "End Block node", 0);
903 /* irg attr must == graph we are in. */
904 if (! get_interprocedural_view()) {
905 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
911 * verify a Start node
913 static int verify_node_Start(ir_node *n, ir_graph *irg) {
914 ir_mode *mymode = get_irn_mode(n);
918 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
919 mymode == mode_T, "Start node", 0
927 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
928 ir_mode *mymode = get_irn_mode(n);
933 mymode == mode_X, "Jmp node", 0
939 * verify an IJmp node
941 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
942 ir_mode *mymode = get_irn_mode(n);
943 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
947 /* IJmp: BB x ref --> X */
948 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
954 * verify a Break node
956 static int verify_node_Break(ir_node *n, ir_graph *irg) {
957 ir_mode *mymode = get_irn_mode(n);
960 #ifdef INTERPROCEDURAL_VIEW
961 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
962 "Break may only appear if ip view is constructed.", 0);
966 mymode == mode_X, "Break node", 0
974 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
975 ir_mode *mymode = get_irn_mode(n);
976 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
980 /* Cond: BB x b --> X x X */
981 (op1mode == mode_b ||
982 /* Cond: BB x int --> X^n */
983 mode_is_int(op1mode) ), "Cond node", 0
985 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
991 * verify a Return node
993 static int verify_node_Return(ir_node *n, ir_graph *irg) {
995 ir_mode *mymode = get_irn_mode(n);
996 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
999 /* Return: BB x M x data1 x ... x datan --> X */
1001 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1003 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1004 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1006 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1007 /* Compare returned results with result types of method type */
1008 mt = get_entity_type(get_irg_entity(irg));
1009 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1010 "Number of results for Return doesn't match number of results in type.", 0,
1011 show_return_nres(irg, n, mt););
1012 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1013 ir_type *res_type = get_method_res_type(mt, i);
1015 if (get_irg_phase_state(irg) != phase_backend) {
1016 if (is_atomic_type(res_type)) {
1018 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1019 "Mode of result for Return doesn't match mode of result type.", 0,
1020 show_return_modes(irg, n, mt, i);
1024 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1025 "Mode of result for Return doesn't match mode of result type.", 0,
1026 show_return_modes(irg, n, mt, i);
1035 * verify a Raise node
1037 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1038 ir_mode *mymode = get_irn_mode(n);
1039 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1040 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1044 /* Sel: BB x M x ref --> X x M */
1045 op1mode == mode_M && mode_is_reference(op2mode) &&
1046 mymode == mode_T, "Raise node", 0
1052 * verify a Const node
1054 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1055 ir_mode *mymode = get_irn_mode(n);
1059 /* Const: BB --> data */
1060 (mode_is_data(mymode) ||
1061 mymode == mode_b) /* we want boolean constants for static evaluation */
1062 ,"Const node", 0 /* of Cmp. */
1065 /* the modes of the constant and teh tarval must match */
1066 mymode == get_tarval_mode(get_Const_tarval(n)),
1067 "Const node, tarval and node mode mismatch", 0
1073 * verify a SymConst node
1075 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1076 ir_mode *mymode = get_irn_mode(n);
1079 if (get_SymConst_kind(n) == symconst_addr_ent) {
1080 ir_entity *ent = get_SymConst_entity(n);
1081 if (is_Method_type(get_entity_type(ent)) &&
1082 get_irn_irg(n) != get_const_code_irg()) {
1084 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1085 "A constant must address an existing method.", 0);
1090 /* SymConst: BB --> int*/
1091 (mode_is_int(mymode) ||
1092 /* SymConst: BB --> ref */
1093 mode_is_reference(mymode))
1094 ,"SymConst node", 0);
1101 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1103 ir_mode *mymode = get_irn_mode(n);
1104 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1105 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1110 /* Sel: BB x M x ref x int^n --> ref */
1111 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1112 "Sel node", 0, show_node_failure(n)
1115 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1116 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1118 ent = get_Sel_entity(n);
1119 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1124 * verify an InstOf node
1126 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1127 ir_mode *mymode = get_irn_mode(n);
1128 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1131 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1132 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1137 * Check if the pinned state is right.
1139 static int verify_right_pinned(ir_node *n) {
1142 if (get_irn_pinned(n) == op_pin_state_pinned)
1144 mem = get_Call_mem(n);
1146 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1147 if (is_NoMem(mem) || is_Pin(mem))
1153 * verify a Call node
1155 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1156 ir_mode *mymode = get_irn_mode(n);
1157 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1158 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1163 /* Call: BB x M x ref x data1 x ... x datan
1164 --> M x datan+1 x ... x data n+m */
1165 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1167 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1168 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1170 mt = get_Call_type(n);
1171 if(get_unknown_type() == mt) {
1175 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1176 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1179 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1180 /* Compare arguments of node with those of type */
1182 if (get_method_variadicity(mt) == variadicity_variadic) {
1184 get_Call_n_params(n) >= get_method_n_params(mt),
1185 "Number of args for Call doesn't match number of args in variadic type.",
1187 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1188 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1192 get_Call_n_params(n) == get_method_n_params(mt),
1193 "Number of args for Call doesn't match number of args in non variadic type.",
1195 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1196 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1200 for (i = 0; i < get_method_n_params(mt); i++) {
1201 ir_type *t = get_method_param_type(mt, i);
1203 if (get_irg_phase_state(irg) != phase_backend) {
1204 if (is_atomic_type(t)) {
1206 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1207 "Mode of arg for Call doesn't match mode of arg type.", 0,
1208 show_call_param(n, mt);
1211 /* call with a compound type, mode must be reference */
1213 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1214 "Mode of arg for Call doesn't match mode of arg type.", 0,
1215 show_call_param(n, mt);
1222 if (Call_has_callees(n)) {
1223 for (i = 0; i < get_Call_n_callees(n); i++) {
1224 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1232 * verify an Add node
1234 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1235 ir_mode *mymode = get_irn_mode(n);
1236 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1237 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1242 /* common Add: BB x numP x numP --> numP */
1243 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1244 /* Pointer Add: BB x ref x int --> ref */
1245 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1246 /* Pointer Add: BB x int x ref --> ref */
1247 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1250 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1251 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1252 "/* Pointer Add: BB x int x ref --> ref */");
1260 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1261 ir_mode *mymode = get_irn_mode(n);
1262 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1263 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1268 /* common Sub: BB x numP x numP --> numP */
1269 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1270 /* Pointer Sub: BB x ref x int --> ref */
1271 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1272 /* Pointer Sub: BB x ref x ref --> int */
1273 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1276 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1277 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1278 "/* Pointer Sub: BB x ref x ref --> int */" );
1284 * verify a Minus node
1286 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1287 ir_mode *mymode = get_irn_mode(n);
1288 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1292 /* Minus: BB x num --> num */
1293 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1294 show_unop_failure(n , "/* Minus: BB x num --> num */");
1302 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1303 ir_mode *mymode = get_irn_mode(n);
1304 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1305 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1310 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1311 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1312 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1313 /* Mul: BB x float x float --> float */
1314 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1317 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1318 "/* Mul: BB x float x float --> float */");
1324 * verify a Mulh node
1326 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1327 ir_mode *mymode = get_irn_mode(n);
1328 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1329 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1334 /* Mulh: BB x int x int --> int */
1335 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1338 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1344 * verify a Quot node
1346 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1347 ir_mode *mymode = get_irn_mode(n);
1348 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1349 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1350 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1354 /* Quot: BB x M x float x float --> M x X x float */
1355 op1mode == mode_M && op2mode == op3mode &&
1356 get_mode_sort(op2mode) == irms_float_number &&
1359 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1365 * verify a DivMod node
1367 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1368 ir_mode *mymode = get_irn_mode(n);
1369 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1370 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1371 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1375 /* DivMod: BB x M x int x int --> M x X x int x int */
1376 op1mode == mode_M &&
1377 mode_is_int(op2mode) &&
1378 op3mode == op2mode &&
1388 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1389 ir_mode *mymode = get_irn_mode(n);
1390 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1391 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1392 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1396 /* Div: BB x M x int x int --> M x X x int */
1397 op1mode == mode_M &&
1398 op2mode == op3mode &&
1399 mode_is_int(op2mode) &&
1409 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1410 ir_mode *mymode = get_irn_mode(n);
1411 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1412 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1413 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1417 /* Mod: BB x M x int x int --> M x X x int */
1418 op1mode == mode_M &&
1419 op2mode == op3mode &&
1420 mode_is_int(op2mode) &&
1428 * verify an Abs node
1430 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1431 ir_mode *mymode = get_irn_mode(n);
1432 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1436 /* Abs: BB x num --> num */
1437 op1mode == mymode &&
1438 mode_is_num (op1mode),
1440 show_unop_failure(n, "/* Abs: BB x num --> num */");
1446 * verify a logical And, Or, Eor node
1448 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1449 ir_mode *mymode = get_irn_mode(n);
1450 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1451 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1455 /* And or Or or Eor: BB x int x int --> int */
1456 (mode_is_int(mymode) || mymode == mode_b) &&
1457 op2mode == op1mode &&
1459 "And, Or or Eor node", 0,
1460 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1465 #define verify_node_And verify_node_Logic
1466 #define verify_node_Or verify_node_Logic
1467 #define verify_node_Eor verify_node_Logic
1472 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1473 ir_mode *mymode = get_irn_mode(n);
1474 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1478 /* Not: BB x int --> int */
1479 (mode_is_int(mymode) || mymode == mode_b) &&
1482 show_unop_failure(n, "/* Not: BB x int --> int */");
1490 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1491 ir_mode *mymode = get_irn_mode(n);
1492 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1493 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1497 /* Cmp: BB x datab x datab --> b16 */
1498 mode_is_datab(op1mode) &&
1499 op2mode == op1mode &&
1502 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1508 * verify a Shift node
1510 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1511 ir_mode *mymode = get_irn_mode(n);
1512 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1513 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1517 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1518 mode_is_int(op1mode) &&
1519 mode_is_int(op2mode) &&
1520 !mode_is_signed(op2mode) &&
1522 "Shl, Shr or Shrs node", 0,
1523 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1528 #define verify_node_Shl verify_node_Shift
1529 #define verify_node_Shr verify_node_Shift
1530 #define verify_node_Shrs verify_node_Shift
1533 * verify a Rotl node
1535 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1536 ir_mode *mymode = get_irn_mode(n);
1537 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1538 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1542 /* Rotl: BB x int x int --> int */
1543 mode_is_int(op1mode) &&
1544 mode_is_int(op2mode) &&
1547 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1553 * verify a Conv node
1555 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1556 ir_mode *mymode = get_irn_mode(n);
1557 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1561 get_irg_phase_state(irg) == phase_backend ||
1562 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1564 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1570 * verify a Cast node
1572 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1573 ir_mode *mymode = get_irn_mode(n);
1574 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1578 /* Conv: BB x datab1 --> datab2 */
1579 mode_is_data(op1mode) && op1mode == mymode,
1581 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1589 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1590 ir_mode *mymode = get_irn_mode(n);
1591 ir_node *block = get_nodes_block(n);
1595 /* a Phi node MUST have the same number of inputs as its block
1596 * Exception is a phi with 0 inputs which is used when (re)constructing the
1598 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1600 get_irn_arity(n) == get_irn_arity(block),
1601 "wrong number of inputs in Phi node", 0,
1602 show_phi_inputs(n, block);
1606 /* Phi: BB x dataM^n --> dataM */
1607 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1608 ir_node *pred = get_Phi_pred(n, i);
1609 if (!is_Bad(pred)) {
1611 get_irn_mode(pred) == mymode,
1613 show_phi_failure(n, pred, i);
1617 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1619 if (mymode == mode_M) {
1620 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1622 ir_node *pred_i = get_Phi_pred(n, i);
1626 for (j = i - 1; j >= 0; --j) {
1627 ir_node *pred_j = get_Phi_pred(n, j);
1632 /* currently this checks fails for blocks with exception
1633 outputs (and these are NOT basic blocks). So it is disabled yet. */
1635 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1636 "At least two different PhiM predecessors are in the same block",
1638 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1648 * verify a Filter node
1650 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1653 #ifdef INTERPROCEDURAL_VIEW
1654 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1655 "Filter may only appear if ip view is constructed.", 0);
1657 /* We should further do tests as for Proj and Phi. */
1662 * verify a Load node
1664 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1665 ir_mode *mymode = get_irn_mode(n);
1666 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1667 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1669 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1670 if (get_irg_phase_state(irg) != phase_backend) {
1671 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1673 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1676 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1677 * (Proj (Proj))) sometimes ...
1679 * interprete.c:ai_eval seems to assume that this happens, too
1681 * obset.c:get_abstval_any can't deal with this if the load has
1685 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1686 assert ((NULL != ent) || (mymode != mode_T));
1694 * verify a Store node
1696 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1699 ir_mode *mymode = get_irn_mode(n);
1700 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1701 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1702 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1704 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1705 if (get_irg_phase_state(irg) != phase_backend) {
1706 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1708 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1710 target = get_ptr_entity(get_Store_ptr(n));
1711 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1713 * If lowered code, any Sels that add 0 may be removed, causing
1714 * an direct access to entities of array or compound type.
1715 * Prevent this by checking the phase.
1717 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1725 * verify an Alloc node
1727 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1728 ir_mode *mymode = get_irn_mode(n);
1729 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1730 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1734 /* Alloc: BB x M x int_u --> M x X x ref */
1735 op1mode == mode_M &&
1736 mode_is_int(op2mode) &&
1737 !mode_is_signed(op2mode) &&
1740 show_node_failure(n);
1746 * verify a Free node
1748 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1749 ir_mode *mymode = get_irn_mode(n);
1750 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1751 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1752 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1756 /* Free: BB x M x ref x int_u --> M */
1757 op1mode == mode_M && mode_is_reference(op2mode) &&
1758 mode_is_int(op3mode) &&
1759 !mode_is_signed(op3mode) &&
1762 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1768 * verify a Sync node
1770 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1772 ir_mode *mymode = get_irn_mode(n);
1775 /* Sync: BB x M^n --> M */
1776 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1777 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1779 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1784 * verify a Confirm node
1786 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1787 ir_mode *mymode = get_irn_mode(n);
1788 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1789 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1793 /* Confirm: BB x T x T --> T */
1794 op1mode == mymode &&
1797 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1805 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1806 ir_mode *mymode = get_irn_mode(n);
1807 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1808 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1809 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1813 /* Mux: BB x b x datab x datab --> datab */
1814 op1mode == mode_b &&
1815 op2mode == mymode &&
1816 op3mode == mymode &&
1817 mode_is_datab(mymode),
1824 * verify a CopyB node
1826 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1827 ir_mode *mymode = get_irn_mode(n);
1828 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1829 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1830 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1831 ir_type *t = get_CopyB_type(n);
1833 /* CopyB: BB x M x ref x ref --> M x X */
1834 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1835 if (get_irg_phase_state(irg) != phase_backend) {
1836 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1841 is_compound_type(t),
1842 "CopyB node should copy compound types only", 0 );
1844 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1845 This should happen RARELY, as CopyB COPIES MEMORY */
1846 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1851 * verify a Bound node
1853 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1854 ir_mode *mymode = get_irn_mode(n);
1855 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1856 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1857 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1858 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1861 /* Bound: BB x M x int x int x int --> M x X */
1864 op1mode == mode_M &&
1865 op2mode == op3mode &&
1866 op3mode == op4mode &&
1867 mode_is_int(op3mode),
1874 * For each usage of a node, it is checked, if the block of the
1875 * node dominates the block of the usage (for phis: the predecessor
1876 * block of the phi for the corresponding edge).
1878 * @return non-zero on success, 0 on dominance error
1880 static int check_dominance_for_node(ir_node *use) {
1881 if (is_Block(use)) {
1882 ir_node *mbh = get_Block_MacroBlock(use);
1885 /* must be a partBlock */
1886 if (is_Block(mbh)) {
1887 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1891 /* This won't work for blocks and the end node */
1892 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1894 ir_node *bl = get_nodes_block(use);
1896 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1897 ir_node *def = get_irn_n(use, i);
1898 ir_node *def_bl = get_nodes_block(def);
1899 ir_node *use_bl = bl;
1901 /* ignore dead definition blocks, will be removed */
1902 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1906 use_bl = get_Block_cfgpred_block(bl, i);
1908 /* ignore dead use blocks, will be removed */
1909 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1913 block_dominates(def_bl, use_bl),
1914 "the definition of a value used violates the dominance property", 0,
1916 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1917 current_ir_graph, def_bl, def, use_bl, use, i
1925 /* Tests the modes of n and its predecessors. */
1926 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1930 if (!get_node_verification_mode())
1933 if (!get_interprocedural_view()) {
1935 * do NOT check placement in interprocedural view, as we don't always know
1936 * the "right" graph ...
1940 /* this seems to be an expensive check in VS compile (9% over all runtime),
1941 so do NOT run it in release mode */
1943 node_is_in_irgs_storage(irg, n),
1944 "Node is not stored on proper IR graph!", 0,
1945 show_node_on_graph(irg, n);
1948 assert(get_irn_irg(n) == irg);
1950 unsigned idx = get_irn_idx(n);
1951 ir_node *node_from_map = get_idx_irn(irg, idx);
1952 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1953 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1959 /* We don't want to test nodes whose predecessors are Bad,
1960 as we would have to special case that for each operation. */
1961 if (op != op_Phi && op != op_Block) {
1962 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1963 if (is_Bad(get_irn_n(n, i)))
1968 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1969 op_pin_state state = get_irn_pinned(n);
1971 state == op_pin_state_floats ||
1972 state == op_pin_state_pinned,
1973 "invalid pin state", 0,
1974 ir_printf("node %+F", n));
1977 if (op->ops.verify_node)
1978 return op->ops.verify_node(n, irg);
1984 int irn_vrfy(ir_node *n) {
1985 #ifdef DEBUG_libfirm
1986 return irn_vrfy_irg(n, current_ir_graph);
1993 /*-----------------------------------------------------------------*/
1994 /* Verify the whole graph. */
1995 /*-----------------------------------------------------------------*/
1997 #ifdef DEBUG_libfirm
1999 * Walker to check every node
2001 static void vrfy_wrap(ir_node *node, void *env) {
2003 *res = irn_vrfy(node);
2007 * Walker to check every node including SSA property.
2008 * Only called if dominance info is available.
2010 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2013 *res = irn_vrfy(node);
2015 *res = check_dominance_for_node(node);
2019 #endif /* DEBUG_libfirm */
2022 * Calls irn_vrfy for each node in irg.
2023 * Graph must be in state "op_pin_state_pinned".
2024 * If dominance info is available, check the SSA property.
2026 int irg_verify(ir_graph *irg, unsigned flags) {
2028 #ifdef DEBUG_libfirm
2031 rem = current_ir_graph;
2032 current_ir_graph = irg;
2035 last_irg_error = NULL;
2038 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2040 if (flags & VRFY_ENFORCE_SSA)
2045 get_irg_dom_state(irg) == dom_consistent &&
2046 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2050 current_ir_graph = rem;
2052 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2053 ir_entity *ent = get_irg_entity(current_ir_graph);
2056 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2058 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
2063 #endif /* DEBUG_libfirm */
2069 ir_graph_pass_t pass;
2074 * Wrapper to irg_verify to be run as an ir_graph pass.
2076 static int irg_verify_wrapper(ir_graph *irg, void *context) {
2077 struct pass_t *pass = context;
2078 irg_verify(irg, pass->flags);
2079 /* do NOT rerun the pass if verify is ok :-) */
2083 /* Creates an ir_graph pass for irg_verify(). */
2084 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags) {
2085 struct pass_t *pass = XMALLOCZ(struct pass_t);
2087 pass->flags = flags;
2088 return def_graph_pass_constructor(
2089 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2092 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2094 firm_verification_t old = get_node_verification_mode();
2096 firm_vrfy_failure_msg = NULL;
2097 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2098 res = irn_vrfy_irg(n, irg);
2099 if (res && get_irg_dom_state(irg) == dom_consistent &&
2100 get_irg_pinned(irg) == op_pin_state_pinned)
2101 res = check_dominance_for_node(n);
2102 do_node_verification(old);
2103 *bad_string = firm_vrfy_failure_msg;
2109 typedef struct _vrfy_bad_env_t {
2115 * Pre-Walker: check Bad predecessors of node.
2117 static void check_bads(ir_node *node, void *env) {
2118 vrfy_bad_env_t *venv = env;
2119 int i, arity = get_irn_arity(node);
2121 if (is_Block(node)) {
2122 if ((venv->flags & BAD_CF) == 0) {
2124 /* check for Bad Block predecessor */
2125 for (i = 0; i < arity; ++i) {
2126 ir_node *pred = get_irn_n(node, i);
2129 venv->res |= BAD_CF;
2131 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2132 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2134 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2135 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2136 assert(0 && "Bad CF detected");
2142 if ((venv->flags & BAD_BLOCK) == 0) {
2144 /* check for Bad Block */
2145 if (is_Bad(get_nodes_block(node))) {
2146 venv->res |= BAD_BLOCK;
2148 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2149 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2151 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2152 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2153 assert(0 && "Bad CF detected");
2158 if ((venv->flags & TUPLE) == 0) {
2159 if (is_Tuple(node)) {
2162 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2163 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2165 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2166 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2167 assert(0 && "Tuple detected");
2172 for (i = 0; i < arity; ++i) {
2173 ir_node *pred = get_irn_n(node, i);
2176 /* check for Phi with Bad inputs */
2177 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2178 if (venv->flags & BAD_CF)
2181 venv->res |= BAD_CF;
2183 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2184 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2186 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2187 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2188 assert(0 && "Bad CF detected");
2193 /* Bad node input */
2194 if ((venv->flags & BAD_DF) == 0) {
2195 venv->res |= BAD_DF;
2197 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2198 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2200 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2201 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2202 assert(0 && "Bad NON-CF detected");
2211 * verify occurrence of bad nodes
2213 int irg_vrfy_bads(ir_graph *irg, int flags) {
2219 irg_walk_graph(irg, check_bads, NULL, &env);
2225 * set the default verify operation
2227 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2230 ops->verify_node = verify_node_##a; \
2287 ops->verify_proj_node = verify_node_Proj_##a; \