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 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() %+F::%s failed\n",
88 ent_type, get_entity_name(ent));
90 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
93 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
99 * Prints a failure for a Node
101 static void show_node_failure(ir_node *n) {
102 show_entity_failure(n);
103 fprintf(stderr, " node %ld %s%s\n" ,
105 get_irn_opname(n), get_irn_modename(n)
110 * Prints a failure message for a binop
112 static void show_binop_failure(ir_node *n, const char *text) {
113 ir_node *left = get_binop_left(n);
114 ir_node *right = get_binop_right(n);
116 show_entity_failure(n);
117 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
119 get_irn_opname(n), get_irn_modename(n),
120 get_irn_opname(left), get_irn_modename(left),
121 get_irn_opname(right), get_irn_modename(right),
126 * Prints a failure message for an unop
128 static void show_unop_failure(ir_node *n, const char *text) {
129 ir_node *op = get_unop_op(n);
131 show_entity_failure(n);
132 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
134 get_irn_opname(n), get_irn_modename(n),
135 get_irn_opname(op), get_irn_modename(op),
140 * Prints a failure message for an op with 3 operands
142 static void show_triop_failure(ir_node *n, const char *text) {
143 ir_node *op0 = get_irn_n(n, 0);
144 ir_node *op1 = get_irn_n(n, 1);
145 ir_node *op2 = get_irn_n(n, 2);
147 show_entity_failure(n);
148 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
150 get_irn_opname(n), get_irn_modename(n),
151 get_irn_opname(op0), get_irn_modename(op0),
152 get_irn_opname(op1), get_irn_modename(op1),
153 get_irn_opname(op2), get_irn_modename(op2),
158 * Prints a failure message for a proj
160 static void show_proj_failure(ir_node *n) {
161 ir_node *op = get_Proj_pred(n);
162 int proj = get_Proj_proj(n);
164 show_entity_failure(n);
165 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
167 get_irn_opname(n), get_irn_modename(n), proj,
168 get_irn_opname(op), get_irn_modename(op));
172 * Prints a failure message for a proj from Start
174 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
175 long proj = get_Proj_proj(n);
176 ir_mode *m = get_type_mode(ty);
178 ir_print_type(type_name, sizeof(type_name), 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 ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
199 show_entity_failure(n);
200 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
202 get_irn_opname(n), get_irn_modename(n), proj,
203 get_irn_opname(op), get_irn_modename(op),
204 get_entity_name(ent), type_name,
205 get_mode_name_ex(m));
209 * Show a node and a graph
211 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
212 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
216 * Show call parameters
218 static void show_call_param(ir_node *n, ir_type *mt) {
221 ir_print_type(type_name, sizeof(type_name), mt);
223 show_entity_failure(n);
224 fprintf(stderr, " Call type-check failed: %s(", type_name);
225 for (i = 0; i < get_method_n_params(mt); ++i) {
226 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
228 fprintf(stderr, ") != CALL(");
230 for (i = 0; i < get_Call_n_params(n); ++i) {
231 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
233 fprintf(stderr, ")\n");
239 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
240 ir_entity *ent = get_irg_entity(irg);
242 show_entity_failure(n);
243 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
244 get_irn_node_nr(n), get_entity_name(ent),
245 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
246 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
251 * Show return number of results
253 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
254 ir_entity *ent = get_irg_entity(irg);
256 show_entity_failure(n);
257 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
258 get_irn_node_nr(n), get_entity_name(ent),
259 get_Return_n_ress(n), get_method_n_ress(mt));
265 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
267 show_entity_failure(phi);
268 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
269 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
270 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
276 static void show_phi_inputs(ir_node *phi, ir_node *block) {
277 show_entity_failure(phi);
278 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
279 get_irn_node_nr(phi), get_irn_arity(phi),
280 get_irn_node_nr(block), get_irn_arity(block));
283 #endif /* #ifndef NDEBUG */
286 * If the address is Sel or SymConst, return the entity.
288 * @param ptr the node representing the address
290 static ir_entity *get_ptr_entity(ir_node *ptr) {
292 return get_Sel_entity(ptr);
293 } else if (is_SymConst_addr_ent(ptr)) {
294 return get_SymConst_entity(ptr);
300 * verify a Proj(Start) node
302 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
303 ir_mode *mode = get_irn_mode(p);
304 long proj = get_Proj_proj(p);
309 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
310 (proj == pn_Start_M && mode == mode_M) ||
311 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
312 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
313 (proj == pn_Start_T_args && mode == mode_T)
315 "wrong Proj from Start", 0,
316 show_proj_failure(p);
322 * verify a Proj(Cond) node
324 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
325 ir_mode *mode = get_irn_mode(p);
326 long proj = get_Proj_proj(p);
330 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
331 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
332 is_Bad(get_Cond_selector(pred)) /* rare */
334 "wrong Proj from Cond", 0,
335 show_proj_failure(p);
341 * verify a Proj(Raise) node
343 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
344 ir_mode *mode = get_irn_mode(p);
345 long proj = get_Proj_proj(p);
349 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
350 "wrong Proj from Raise", 0,
351 show_proj_failure(p);
357 * verify a Proj(InstOf) node
359 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
360 ir_mode *mode = get_irn_mode(p);
361 long proj = get_Proj_proj(p);
366 (proj == pn_InstOf_M && mode == mode_M) ||
367 (proj == pn_InstOf_X_regular && mode == mode_X) ||
368 (proj == pn_InstOf_X_except && mode == mode_X) ||
369 (proj == pn_InstOf_res && mode_is_reference(mode))
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 && 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_P_value_res_base && mode_is_reference(mode))
392 "wrong Proj from Call", 0,
393 show_proj_failure(p);
395 /* if we have exception flow, we must have a real Memory input */
396 if (proj == pn_Call_X_regular)
398 !is_NoMem(get_Call_mem(n)),
399 "Regular Proj from FunctionCall", 0);
400 else if (proj == pn_Call_X_except)
402 !is_NoMem(get_Call_mem(n)),
403 "Exception Proj from FunctionCall", 0);
404 else if (proj == pn_Call_M)
406 (!is_NoMem(get_Call_mem(n)) || 1),
407 "Memory Proj from FunctionCall", 0);
412 * verify a Proj(Quot) node
414 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
415 ir_mode *mode = get_irn_mode(p);
416 long proj = get_Proj_proj(p);
420 (proj == pn_Quot_M && mode == mode_M) ||
421 (proj == pn_Quot_X_regular && mode == mode_X) ||
422 (proj == pn_Quot_X_except && mode == mode_X) ||
423 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
425 "wrong Proj from Quot", 0,
426 show_proj_failure(p);
428 if (proj == pn_Quot_X_regular)
430 get_irn_pinned(n) == op_pin_state_pinned,
431 "Regular Proj from unpinned Quot", 0);
432 else if (proj == pn_Quot_X_except)
434 get_irn_pinned(n) == op_pin_state_pinned,
435 "Exception Proj from unpinned Quot", 0);
436 else if (proj == pn_Quot_M)
438 get_irn_pinned(n) == op_pin_state_pinned,
439 "Memory Proj from unpinned Quot", 0);
444 * verify a Proj(DivMod) node
446 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
447 ir_mode *mode = get_irn_mode(p);
448 long proj = get_Proj_proj(p);
452 (proj == pn_DivMod_M && mode == mode_M) ||
453 (proj == pn_DivMod_X_regular && mode == mode_X) ||
454 (proj == pn_DivMod_X_except && mode == mode_X) ||
455 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
456 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
458 "wrong Proj from DivMod", 0,
459 show_proj_failure(p);
461 if (proj == pn_DivMod_X_regular)
463 get_irn_pinned(n) == op_pin_state_pinned,
464 "Regular Proj from unpinned DivMod", 0);
465 else if (proj == pn_DivMod_X_except)
467 get_irn_pinned(n) == op_pin_state_pinned,
468 "Exception Proj from unpinned DivMod", 0);
469 else if (proj == pn_DivMod_M)
471 get_irn_pinned(n) == op_pin_state_pinned,
472 "Memory Proj from unpinned DivMod", 0);
477 * verify a Proj(Div) node
479 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
480 ir_mode *mode = get_irn_mode(p);
481 long proj = get_Proj_proj(p);
485 (proj == pn_Div_M && mode == mode_M) ||
486 (proj == pn_Div_X_regular && mode == mode_X) ||
487 (proj == pn_Div_X_except && mode == mode_X) ||
488 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
490 "wrong Proj from Div", 0,
491 show_proj_failure(p);
493 if (proj == pn_Div_X_regular)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Regular Proj from unpinned Div", 0);
497 else if (proj == pn_Div_X_except)
499 get_irn_pinned(n) == op_pin_state_pinned,
500 "Exception Proj from unpinned Div", 0);
501 else if (proj == pn_Div_M)
503 get_irn_pinned(n) == op_pin_state_pinned,
504 "Memory Proj from unpinned Div", 0);
509 * verify a Proj(Mod) node
511 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
512 ir_mode *mode = get_irn_mode(p);
513 long proj = get_Proj_proj(p);
517 (proj == pn_Mod_M && mode == mode_M) ||
518 (proj == pn_Mod_X_regular && mode == mode_X) ||
519 (proj == pn_Mod_X_except && mode == mode_X) ||
520 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
522 "wrong Proj from Mod", 0,
523 show_proj_failure(p);
525 if (proj == pn_Mod_X_regular)
527 get_irn_pinned(n) == op_pin_state_pinned,
528 "Regular Proj from unpinned Mod", 0);
529 else if (proj == pn_Mod_X_except)
531 get_irn_pinned(n) == op_pin_state_pinned,
532 "Exception Proj from unpinned Mod", 0);
533 else if (proj == pn_Mod_M)
535 get_irn_pinned(n) == op_pin_state_pinned,
536 "Memory Proj from unpinned Div", 0);
541 * verify a Proj(Cmp) node
543 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
544 ir_mode *mode = get_irn_mode(p);
545 long proj = get_Proj_proj(p);
549 (proj >= 0 && proj <= 15 && mode == mode_b),
550 "wrong Proj from Cmp", 0,
551 show_proj_failure(p);
554 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
555 "unordered Proj for non-float Cmp", 0,
556 show_proj_failure(p);
562 * verify a Proj(Load) node
564 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
565 ir_mode *mode = get_irn_mode(p);
566 long proj = get_Proj_proj(p);
568 if (proj == pn_Load_res) {
569 ir_node *ptr = get_Load_ptr(n);
570 ir_entity *ent = get_ptr_entity(ptr);
572 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
573 /* do NOT check this for lowered phases, see comment on Store */
575 (mode == get_type_mode(get_entity_type(ent))),
576 "wrong data Proj from Load, entity type_mode failed", 0,
577 show_proj_failure_ent(p, ent);
582 mode_is_data(mode) && mode == get_Load_mode(n),
583 "wrong data Proj from Load", 0,
584 show_proj_failure(p);
591 (proj == pn_Load_M && mode == mode_M) ||
592 (proj == pn_Load_X_regular && mode == mode_X) ||
593 (proj == pn_Load_X_except && mode == mode_X)
595 "wrong Proj from Load", 0,
596 show_proj_failure(p);
599 if (proj == pn_Load_X_regular) {
601 get_irn_pinned(n) == op_pin_state_pinned,
602 "Regular Proj from unpinned Load", 0);
603 } else if (proj == pn_Load_X_except) {
605 get_irn_pinned(n) == op_pin_state_pinned,
606 "Exception Proj from unpinned Load", 0);
612 * verify a Proj(Store) node
614 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
615 ir_mode *mode = get_irn_mode(p);
616 long proj = get_Proj_proj(p);
620 (proj == pn_Store_M && mode == mode_M) ||
621 (proj == pn_Store_X_regular && mode == mode_X) ||
622 (proj == pn_Store_X_except && mode == mode_X)
624 "wrong Proj from Store", 0,
625 show_proj_failure(p);
627 if (proj == pn_Store_X_regular) {
629 get_irn_pinned(n) == op_pin_state_pinned,
630 "Regular Proj from unpinned Store", 0);
631 } else if (proj == pn_Store_X_except) {
633 get_irn_pinned(n) == op_pin_state_pinned,
634 "Exception Proj from unpinned Store", 0);
640 * verify a Proj(Alloc) node
642 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
643 ir_mode *mode = get_irn_mode(p);
644 long proj = get_Proj_proj(p);
649 (proj == pn_Alloc_M && mode == mode_M) ||
650 (proj == pn_Alloc_X_regular && mode == mode_X) ||
651 (proj == pn_Alloc_X_except && mode == mode_X) ||
652 (proj == pn_Alloc_res && mode_is_reference(mode))
654 "wrong Proj from Alloc", 0,
655 show_proj_failure(p);
661 * verify a Proj(Proj) node
663 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
664 ir_mode *mode = get_irn_mode(p);
665 long proj = get_Proj_proj(p);
666 long nr = get_Proj_proj(pred);
667 ir_type *mt; /* A method type */
669 pred = skip_Id(get_Proj_pred(pred));
670 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
672 switch (get_irn_opcode(pred)) {
674 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
676 if (nr == pn_Start_T_args) {
678 (proj >= 0 && mode_is_datab(mode)),
679 "wrong Proj from Proj from Start", 0);
681 (proj < get_method_n_params(mt)),
682 "More Projs for args than args in type", 0
684 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
685 /* value argument */ break;
687 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
689 (mode == get_type_mode(get_method_param_type(mt, proj))),
690 "Mode of Proj from Start doesn't match mode of param type.", 0,
691 show_proj_mode_failure(p, get_method_param_type(mt, proj));
700 (proj >= 0 && mode_is_datab(mode)),
701 "wrong Proj from Proj from Call", 0);
702 mt = get_Call_type(pred);
704 (proj < get_method_n_ress(mt)),
705 "More Projs for results than results in type.", 0);
706 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
707 /* value result */ break;
710 (mode == get_type_mode(get_method_res_type(mt, proj))),
711 "Mode of Proj from Call doesn't match mode of result type.", 0);
720 /* hmm, optimization did not remove it */
724 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
731 * verify a Proj(Tuple) node
733 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
741 * verify a Proj(CallBegin) node
743 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
750 * verify a Proj(EndReg) node
752 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
755 #ifdef INTERPROCEDURAL_VIEW
757 (get_irp_ip_view_state() != ip_view_no),
758 "EndReg may only appear if ip view is constructed.", 0);
764 * verify a Proj(EndExcept) node
766 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
769 #ifdef INTERPROCEDURAL_VIEW
771 (get_irp_ip_view_state() != ip_view_no),
772 "EndExcept may only appear if ip view is constructed.", 0);
778 * verify a Proj(CopyB) node
780 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
781 ir_mode *mode = get_irn_mode(p);
782 long proj = get_Proj_proj(p);
786 (proj == pn_CopyB_M && mode == mode_M) ||
787 (proj == pn_CopyB_X_regular && mode == mode_X) ||
788 (proj == pn_CopyB_X_except && mode == mode_X)
790 "wrong Proj from CopyB", 0,
791 show_proj_failure(p);
793 if (proj == pn_CopyB_X_regular)
795 get_irn_pinned(n) == op_pin_state_pinned,
796 "Regular Proj from unpinned CopyB", 0);
797 else if (proj == pn_CopyB_X_except)
799 get_irn_pinned(n) == op_pin_state_pinned,
800 "Exception Proj from unpinned CopyB", 0);
805 * verify a Proj(Bound) node
807 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
808 ir_mode *mode = get_irn_mode(p);
809 long proj = get_Proj_proj(p);
811 /* ignore Bound checks of Bad */
812 if (is_Bad(get_Bound_index(n)))
816 (proj == pn_Bound_M && mode == mode_M) ||
817 (proj == pn_Bound_X_regular && mode == mode_X) ||
818 (proj == pn_Bound_X_except && mode == mode_X) ||
819 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
821 "wrong Proj from Bound", 0,
822 show_proj_failure(p);
831 verify_node_Proj(ir_node *p, ir_graph *irg) {
835 pred = skip_Id(get_Proj_pred(p));
836 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
837 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);
839 op = get_irn_op(pred);
841 if (op->ops.verify_proj_node)
842 return op->ops.verify_proj_node(pred, p);
849 * verify a Block node
851 static int verify_node_Block(ir_node *n, ir_graph *irg) {
853 ir_node *mb = get_Block_MacroBlock(n);
855 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
857 if (is_Block(mb) && mb != n) {
860 /* Blocks with more than one predecessor must be header blocks */
861 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
862 if (get_irg_phase_state(irg) != phase_backend) {
863 pred = get_Block_cfgpred(n, 0);
865 /* the predecessor MUST be a regular Proj */
866 ir_node *frag_op = get_Proj_pred(pred);
868 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
869 "partBlock with non-regular predecessor", 0);
871 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
872 of fragile nodes during construction. It does not violate our assumption of dominance
874 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
875 "partBlock with non-regular predecessor", 0);
878 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
882 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
883 ir_node *pred = get_Block_cfgpred(n, i);
885 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
886 "Block node must have a mode_X predecessor", 0);
889 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
890 /* End block may only have Return, Raise or fragile ops as preds. */
891 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
892 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
893 if (is_Proj(pred) || is_Tuple(pred))
894 break; /* We can not test properly. How many tuples are there? */
902 "End Block node", 0);
904 /* irg attr must == graph we are in. */
905 if (! get_interprocedural_view()) {
906 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
912 * verify a Start node
914 static int verify_node_Start(ir_node *n, ir_graph *irg) {
915 ir_mode *mymode = get_irn_mode(n);
919 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
920 mymode == mode_T, "Start node", 0
928 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
929 ir_mode *mymode = get_irn_mode(n);
934 mymode == mode_X, "Jmp node", 0
940 * verify an IJmp node
942 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
943 ir_mode *mymode = get_irn_mode(n);
944 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
948 /* IJmp: BB x ref --> X */
949 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
955 * verify a Break node
957 static int verify_node_Break(ir_node *n, ir_graph *irg) {
958 ir_mode *mymode = get_irn_mode(n);
961 #ifdef INTERPROCEDURAL_VIEW
962 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
963 "Break may only appear if ip view is constructed.", 0);
967 mymode == mode_X, "Break node", 0
975 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
976 ir_mode *mymode = get_irn_mode(n);
977 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
981 /* Cond: BB x b --> X x X */
982 (op1mode == mode_b ||
983 /* Cond: BB x int --> X^n */
984 mode_is_int(op1mode) ), "Cond node", 0
986 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
992 * verify a Return node
994 static int verify_node_Return(ir_node *n, ir_graph *irg) {
996 ir_mode *mymode = get_irn_mode(n);
997 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
1000 /* Return: BB x M x data1 x ... x datan --> X */
1002 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1004 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1005 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1007 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1008 /* Compare returned results with result types of method type */
1009 mt = get_entity_type(get_irg_entity(irg));
1010 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1011 "Number of results for Return doesn't match number of results in type.", 0,
1012 show_return_nres(irg, n, mt););
1013 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1014 ir_type *res_type = get_method_res_type(mt, i);
1016 if (get_irg_phase_state(irg) != phase_backend) {
1017 if (is_atomic_type(res_type)) {
1019 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1020 "Mode of result for Return doesn't match mode of result type.", 0,
1021 show_return_modes(irg, n, mt, i);
1025 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1026 "Mode of result for Return doesn't match mode of result type.", 0,
1027 show_return_modes(irg, n, mt, i);
1036 * verify a Raise node
1038 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1039 ir_mode *mymode = get_irn_mode(n);
1040 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1041 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1045 /* Sel: BB x M x ref --> X x M */
1046 op1mode == mode_M && mode_is_reference(op2mode) &&
1047 mymode == mode_T, "Raise node", 0
1053 * verify a Const node
1055 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1056 ir_mode *mymode = get_irn_mode(n);
1060 /* Const: BB --> data */
1061 (mode_is_data(mymode) ||
1062 mymode == mode_b) /* we want boolean constants for static evaluation */
1063 ,"Const node", 0 /* of Cmp. */
1066 /* the modes of the constant and teh tarval must match */
1067 mymode == get_tarval_mode(get_Const_tarval(n)),
1068 "Const node, tarval and node mode mismatch", 0
1074 * verify a SymConst node
1076 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
1078 ir_mode *mymode = get_irn_mode(n);
1082 /* SymConst: BB --> int*/
1083 (mode_is_int(mymode) ||
1084 /* SymConst: BB --> ref */
1085 mode_is_reference(mymode))
1086 ,"SymConst node", 0);
1093 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1095 ir_mode *mymode = get_irn_mode(n);
1096 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1097 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1102 /* Sel: BB x M x ref x int^n --> ref */
1103 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1104 "Sel node", 0, show_node_failure(n)
1107 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1108 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1110 ent = get_Sel_entity(n);
1111 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1116 * verify an InstOf node
1118 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1119 ir_mode *mymode = get_irn_mode(n);
1120 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1123 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1124 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1129 * Check if the pinned state is right.
1131 static int verify_right_pinned(ir_node *n) {
1134 if (get_irn_pinned(n) == op_pin_state_pinned)
1136 mem = get_Call_mem(n);
1138 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1139 if (is_NoMem(mem) || is_Pin(mem))
1145 * verify a Call node
1147 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1148 ir_mode *mymode = get_irn_mode(n);
1149 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1150 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1155 /* Call: BB x M x ref x data1 x ... x datan
1156 --> M x datan+1 x ... x data n+m */
1157 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1159 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1160 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1162 mt = get_Call_type(n);
1163 if(get_unknown_type() == mt) {
1167 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1168 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1171 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1172 /* Compare arguments of node with those of type */
1174 if (get_method_variadicity(mt) == variadicity_variadic) {
1176 get_Call_n_params(n) >= get_method_n_params(mt),
1177 "Number of args for Call doesn't match number of args in variadic type.",
1179 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1180 n, get_Call_n_params(n), get_method_n_params(mt));
1184 get_Call_n_params(n) == get_method_n_params(mt),
1185 "Number of args for Call doesn't match number of args in non variadic type.",
1187 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1188 n, get_Call_n_params(n), get_method_n_params(mt));
1192 for (i = 0; i < get_method_n_params(mt); i++) {
1193 ir_type *t = get_method_param_type(mt, i);
1195 if (get_irg_phase_state(irg) != phase_backend) {
1196 if (is_atomic_type(t)) {
1198 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1199 "Mode of arg for Call doesn't match mode of arg type.", 0,
1200 show_call_param(n, mt);
1203 /* call with a compound type, mode must be reference */
1205 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1206 "Mode of arg for Call doesn't match mode of arg type.", 0,
1207 show_call_param(n, mt);
1214 if (Call_has_callees(n)) {
1215 for (i = 0; i < get_Call_n_callees(n); i++) {
1216 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1224 * verify an Add node
1226 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1227 ir_mode *mymode = get_irn_mode(n);
1228 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1229 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1234 /* common Add: BB x numP x numP --> numP */
1235 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1236 /* Pointer Add: BB x ref x int --> ref */
1237 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1238 /* Pointer Add: BB x int x ref --> ref */
1239 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1242 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1243 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1244 "/* Pointer Add: BB x int x ref --> ref */");
1252 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1253 ir_mode *mymode = get_irn_mode(n);
1254 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1255 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1260 /* common Sub: BB x numP x numP --> numP */
1261 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1262 /* Pointer Sub: BB x ref x int --> ref */
1263 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1264 /* Pointer Sub: BB x ref x ref --> int */
1265 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1268 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1269 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1270 "/* Pointer Sub: BB x ref x ref --> int */" );
1276 * verify a Minus node
1278 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1279 ir_mode *mymode = get_irn_mode(n);
1280 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1284 /* Minus: BB x num --> num */
1285 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1286 show_unop_failure(n , "/* Minus: BB x num --> num */");
1294 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1295 ir_mode *mymode = get_irn_mode(n);
1296 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1297 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1302 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1303 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1304 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1305 /* Mul: BB x float x float --> float */
1306 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1309 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1310 "/* Mul: BB x float x float --> float */");
1316 * verify a Mulh node
1318 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1319 ir_mode *mymode = get_irn_mode(n);
1320 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1321 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1326 /* Mulh: BB x int x int --> int */
1327 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1330 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1336 * verify a Quot node
1338 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1339 ir_mode *mymode = get_irn_mode(n);
1340 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1341 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1342 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1346 /* Quot: BB x M x float x float --> M x X x float */
1347 op1mode == mode_M && op2mode == op3mode &&
1348 get_mode_sort(op2mode) == irms_float_number &&
1351 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1357 * verify a DivMod node
1359 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1360 ir_mode *mymode = get_irn_mode(n);
1361 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1362 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1363 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1367 /* DivMod: BB x M x int x int --> M x X x int x int */
1368 op1mode == mode_M &&
1369 mode_is_int(op2mode) &&
1370 op3mode == op2mode &&
1380 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1381 ir_mode *mymode = get_irn_mode(n);
1382 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1383 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1384 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1388 /* Div: BB x M x int x int --> M x X x int */
1389 op1mode == mode_M &&
1390 op2mode == op3mode &&
1391 mode_is_int(op2mode) &&
1401 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1402 ir_mode *mymode = get_irn_mode(n);
1403 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1404 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1405 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1409 /* Mod: BB x M x int x int --> M x X x int */
1410 op1mode == mode_M &&
1411 op2mode == op3mode &&
1412 mode_is_int(op2mode) &&
1420 * verify an Abs node
1422 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1423 ir_mode *mymode = get_irn_mode(n);
1424 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1428 /* Abs: BB x num --> num */
1429 op1mode == mymode &&
1430 mode_is_num (op1mode),
1432 show_unop_failure(n, "/* Abs: BB x num --> num */");
1438 * verify a logical And, Or, Eor node
1440 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1441 ir_mode *mymode = get_irn_mode(n);
1442 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1443 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1447 /* And or Or or Eor: BB x int x int --> int */
1448 (mode_is_int(mymode) || mymode == mode_b) &&
1449 op2mode == op1mode &&
1451 "And, Or or Eor node", 0,
1452 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1457 #define verify_node_And verify_node_Logic
1458 #define verify_node_Or verify_node_Logic
1459 #define verify_node_Eor verify_node_Logic
1464 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1465 ir_mode *mymode = get_irn_mode(n);
1466 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1470 /* Not: BB x int --> int */
1471 (mode_is_int(mymode) || mymode == mode_b) &&
1474 show_unop_failure(n, "/* Not: BB x int --> int */");
1482 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1485 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1489 /* Cmp: BB x datab x datab --> b16 */
1490 mode_is_datab(op1mode) &&
1491 op2mode == op1mode &&
1494 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1500 * verify a Shift node
1502 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1503 ir_mode *mymode = get_irn_mode(n);
1504 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1505 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1509 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1510 mode_is_int(op1mode) &&
1511 mode_is_int(op2mode) &&
1512 !mode_is_signed(op2mode) &&
1514 "Shl, Shr or Shrs node", 0,
1515 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1520 #define verify_node_Shl verify_node_Shift
1521 #define verify_node_Shr verify_node_Shift
1522 #define verify_node_Shrs verify_node_Shift
1525 * verify a Rotl node
1527 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1528 ir_mode *mymode = get_irn_mode(n);
1529 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1530 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1534 /* Rotl: BB x int x int --> int */
1535 mode_is_int(op1mode) &&
1536 mode_is_int(op2mode) &&
1539 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1545 * verify a Conv node
1547 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1548 ir_mode *mymode = get_irn_mode(n);
1549 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1553 get_irg_phase_state(irg) == phase_backend ||
1554 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1556 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1562 * verify a Cast node
1564 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1565 ir_mode *mymode = get_irn_mode(n);
1566 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1570 /* Conv: BB x datab1 --> datab2 */
1571 mode_is_data(op1mode) && op1mode == mymode,
1573 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1581 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1582 ir_mode *mymode = get_irn_mode(n);
1583 ir_node *block = get_nodes_block(n);
1587 /* a Phi node MUST have the same number of inputs as its block
1588 * Exception is a phi with 0 inputs which is used when (re)constructing the
1590 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1592 get_irn_arity(n) == get_irn_arity(block),
1593 "wrong number of inputs in Phi node", 0,
1594 show_phi_inputs(n, block);
1598 /* Phi: BB x dataM^n --> dataM */
1599 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1600 ir_node *pred = get_Phi_pred(n, i);
1601 if (!is_Bad(pred)) {
1603 get_irn_mode(pred) == mymode,
1605 show_phi_failure(n, pred, i);
1609 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1611 if (mymode == mode_M) {
1612 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1614 ir_node *pred_i = get_Phi_pred(n, i);
1618 for (j = i - 1; j >= 0; --j) {
1619 ir_node *pred_j = get_Phi_pred(n, j);
1624 /* currently this checks fails for blocks with exception
1625 outputs (and these are NOT basic blocks). So it is disabled yet. */
1627 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1628 "At least two different PhiM predecessors are in the same block",
1630 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1640 * verify a Filter node
1642 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1645 #ifdef INTERPROCEDURAL_VIEW
1646 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1647 "Filter may only appear if ip view is constructed.", 0);
1649 /* We should further do tests as for Proj and Phi. */
1654 * verify a Load node
1656 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1657 ir_mode *mymode = get_irn_mode(n);
1658 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1659 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1661 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1662 if (get_irg_phase_state(irg) != phase_backend) {
1663 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1665 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1668 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1669 * (Proj (Proj))) sometimes ...
1671 * interprete.c:ai_eval seems to assume that this happens, too
1673 * obset.c:get_abstval_any can't deal with this if the load has
1677 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1678 assert ((NULL != ent) || (mymode != mode_T));
1686 * verify a Store node
1688 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1691 ir_mode *mymode = get_irn_mode(n);
1692 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1693 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1694 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1696 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1697 if (get_irg_phase_state(irg) != phase_backend) {
1698 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1700 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1702 target = get_ptr_entity(get_Store_ptr(n));
1703 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1705 * If lowered code, any Sels that add 0 may be removed, causing
1706 * an direct access to entities of array or compound type.
1707 * Prevent this by checking the phase.
1709 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1717 * verify an Alloc node
1719 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1720 ir_mode *mymode = get_irn_mode(n);
1721 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1722 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1726 /* Alloc: BB x M x int_u --> M x X x ref */
1727 op1mode == mode_M &&
1728 mode_is_int(op2mode) &&
1729 !mode_is_signed(op2mode) &&
1732 show_node_failure(n);
1738 * verify a Free node
1740 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1741 ir_mode *mymode = get_irn_mode(n);
1742 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1743 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1744 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1748 /* Free: BB x M x ref x int_u --> M */
1749 op1mode == mode_M && mode_is_reference(op2mode) &&
1750 mode_is_int(op3mode) &&
1751 !mode_is_signed(op3mode) &&
1754 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1760 * verify a Sync node
1762 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1764 ir_mode *mymode = get_irn_mode(n);
1767 /* Sync: BB x M^n --> M */
1768 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1769 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1771 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1776 * verify a Confirm node
1778 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1779 ir_mode *mymode = get_irn_mode(n);
1780 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1781 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1785 /* Confirm: BB x T x T --> T */
1786 op1mode == mymode &&
1789 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1797 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1798 ir_mode *mymode = get_irn_mode(n);
1799 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1800 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1801 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1805 /* Mux: BB x b x datab x datab --> datab */
1806 op1mode == mode_b &&
1807 op2mode == mymode &&
1808 op3mode == mymode &&
1809 mode_is_datab(mymode),
1816 * verify a CopyB node
1818 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1819 ir_mode *mymode = get_irn_mode(n);
1820 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1821 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1822 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1823 ir_type *t = get_CopyB_type(n);
1825 /* CopyB: BB x M x ref x ref --> M x X */
1826 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1827 if (get_irg_phase_state(irg) != phase_backend) {
1828 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1833 is_compound_type(t),
1834 "CopyB node should copy compound types only", 0 );
1836 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1837 This should happen RARELY, as CopyB COPIES MEMORY */
1838 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1843 * verify a Bound node
1845 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1846 ir_mode *mymode = get_irn_mode(n);
1847 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1848 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1849 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1850 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1853 /* Bound: BB x M x int x int x int --> M x X */
1856 op1mode == mode_M &&
1857 op2mode == op3mode &&
1858 op3mode == op4mode &&
1859 mode_is_int(op3mode),
1866 * For each usage of a node, it is checked, if the block of the
1867 * node dominates the block of the usage (for phis: the predecessor
1868 * block of the phi for the corresponding edge).
1870 * @return non-zero on success, 0 on dominance error
1872 static int check_dominance_for_node(ir_node *use) {
1873 if (is_Block(use)) {
1874 ir_node *mbh = get_Block_MacroBlock(use);
1877 /* must be a partBlock */
1878 if (is_Block(mbh)) {
1879 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1883 /* This won't work for blocks and the end node */
1884 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1886 ir_node *bl = get_nodes_block(use);
1888 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1889 ir_node *def = get_irn_n(use, i);
1890 ir_node *def_bl = get_nodes_block(def);
1891 ir_node *use_bl = bl;
1893 /* ignore dead definition blocks, will be removed */
1894 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1898 use_bl = get_Block_cfgpred_block(bl, i);
1900 /* ignore dead use blocks, will be removed */
1901 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1905 block_dominates(def_bl, use_bl),
1906 "the definition of a value used violates the dominance property", 0,
1908 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1909 current_ir_graph, def_bl, def, use_bl, use, i
1917 /* Tests the modes of n and its predecessors. */
1918 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1922 if (!get_node_verification_mode())
1925 if (!get_interprocedural_view()) {
1927 * do NOT check placement in interprocedural view, as we don't always know
1928 * the "right" graph ...
1932 /* this seems to be an expensive check in VS compile (9% over all runtime),
1933 so do NOT run it in release mode */
1935 node_is_in_irgs_storage(irg, n),
1936 "Node is not stored on proper IR graph!", 0,
1937 show_node_on_graph(irg, n);
1940 assert(get_irn_irg(n) == irg);
1942 unsigned idx = get_irn_idx(n);
1943 ir_node *node_from_map = get_idx_irn(irg, idx);
1944 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1945 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1951 /* We don't want to test nodes whose predecessors are Bad,
1952 as we would have to special case that for each operation. */
1953 if (op != op_Phi && op != op_Block) {
1954 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1955 if (is_Bad(get_irn_n(n, i)))
1960 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1961 op_pin_state state = get_irn_pinned(n);
1963 state == op_pin_state_floats ||
1964 state == op_pin_state_pinned,
1965 "invalid pin state", 0,
1966 ir_printf("node %+F", n));
1969 if (op->ops.verify_node)
1970 return op->ops.verify_node(n, irg);
1976 int irn_vrfy(ir_node *n) {
1977 #ifdef DEBUG_libfirm
1978 return irn_vrfy_irg(n, current_ir_graph);
1985 /*-----------------------------------------------------------------*/
1986 /* Verify the whole graph. */
1987 /*-----------------------------------------------------------------*/
1989 #ifdef DEBUG_libfirm
1991 * Walker to check every node
1993 static void vrfy_wrap(ir_node *node, void *env) {
1995 *res = irn_vrfy_irg(node, current_ir_graph);
1999 * Walker to check every node including SSA property.
2000 * Only called if dominance info is available.
2002 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2005 *res = irn_vrfy_irg(node, current_ir_graph);
2007 *res = check_dominance_for_node(node);
2011 #endif /* DEBUG_libfirm */
2014 * Calls irn_vrfy for each node in irg.
2015 * Graph must be in state "op_pin_state_pinned".
2016 * If dominance info is available, check the SSA property.
2018 int irg_verify(ir_graph *irg, unsigned flags) {
2020 #ifdef DEBUG_libfirm
2023 rem = current_ir_graph;
2024 current_ir_graph = irg;
2027 last_irg_error = NULL;
2030 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2032 if (flags & VRFY_ENFORCE_SSA)
2037 get_irg_dom_state(irg) == dom_consistent &&
2038 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2042 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2043 ir_entity *ent = get_irg_entity(irg);
2046 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2048 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2051 current_ir_graph = rem;
2055 #endif /* DEBUG_libfirm */
2061 ir_graph_pass_t pass;
2066 * Wrapper to irg_verify to be run as an ir_graph pass.
2068 static int irg_verify_wrapper(ir_graph *irg, void *context) {
2069 struct pass_t *pass = context;
2070 irg_verify(irg, pass->flags);
2071 /* do NOT rerun the pass if verify is ok :-) */
2075 /* Creates an ir_graph pass for irg_verify(). */
2076 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags) {
2077 struct pass_t *pass = XMALLOCZ(struct pass_t);
2079 def_graph_pass_constructor(
2080 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2082 /* neither dump for verify */
2083 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2084 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2086 pass->flags = flags;
2090 /* create a verify pass */
2091 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2093 firm_verification_t old = get_node_verification_mode();
2095 firm_vrfy_failure_msg = NULL;
2096 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2097 res = irn_vrfy_irg(n, irg);
2098 if (res && get_irg_dom_state(irg) == dom_consistent &&
2099 get_irg_pinned(irg) == op_pin_state_pinned)
2100 res = check_dominance_for_node(n);
2101 do_node_verification(old);
2102 *bad_string = firm_vrfy_failure_msg;
2108 typedef struct _vrfy_bad_env_t {
2114 * Pre-Walker: check Bad predecessors of node.
2116 static void check_bads(ir_node *node, void *env) {
2117 vrfy_bad_env_t *venv = env;
2118 int i, arity = get_irn_arity(node);
2120 if (is_Block(node)) {
2121 if ((venv->flags & BAD_CF) == 0) {
2123 /* check for Bad Block predecessor */
2124 for (i = 0; i < arity; ++i) {
2125 ir_node *pred = get_irn_n(node, i);
2128 venv->res |= BAD_CF;
2130 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2131 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2133 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2134 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2135 assert(0 && "Bad CF detected");
2141 if ((venv->flags & BAD_BLOCK) == 0) {
2143 /* check for Bad Block */
2144 if (is_Bad(get_nodes_block(node))) {
2145 venv->res |= BAD_BLOCK;
2147 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2148 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2150 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2151 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2152 assert(0 && "Bad CF detected");
2157 if ((venv->flags & TUPLE) == 0) {
2158 if (is_Tuple(node)) {
2161 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2162 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2164 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2165 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2166 assert(0 && "Tuple detected");
2171 for (i = 0; i < arity; ++i) {
2172 ir_node *pred = get_irn_n(node, i);
2175 /* check for Phi with Bad inputs */
2176 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2177 if (venv->flags & BAD_CF)
2180 venv->res |= BAD_CF;
2182 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2183 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2185 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2186 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2187 assert(0 && "Bad CF detected");
2192 /* Bad node input */
2193 if ((venv->flags & BAD_DF) == 0) {
2194 venv->res |= BAD_DF;
2196 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2197 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2199 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2200 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2201 assert(0 && "Bad NON-CF detected");
2210 * verify occurrence of bad nodes
2212 int irg_vrfy_bads(ir_graph *irg, int flags) {
2218 irg_walk_graph(irg, check_bads, NULL, &env);
2224 * set the default verify operation
2226 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2229 ops->verify_node = verify_node_##a; \
2286 ops->verify_proj_node = verify_node_Proj_##a; \