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) {
1077 ir_mode *mymode = get_irn_mode(n);
1080 if (get_SymConst_kind(n) == symconst_addr_ent) {
1081 ir_entity *ent = get_SymConst_entity(n);
1082 if (is_Method_type(get_entity_type(ent)) &&
1083 get_irn_irg(n) != get_const_code_irg()) {
1085 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1086 "A constant must address an existing method.", 0);
1091 /* SymConst: BB --> int*/
1092 (mode_is_int(mymode) ||
1093 /* SymConst: BB --> ref */
1094 mode_is_reference(mymode))
1095 ,"SymConst node", 0);
1102 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1104 ir_mode *mymode = get_irn_mode(n);
1105 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1106 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1111 /* Sel: BB x M x ref x int^n --> ref */
1112 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1113 "Sel node", 0, show_node_failure(n)
1116 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1117 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1119 ent = get_Sel_entity(n);
1120 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1125 * verify an InstOf node
1127 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1128 ir_mode *mymode = get_irn_mode(n);
1129 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1132 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1133 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1138 * Check if the pinned state is right.
1140 static int verify_right_pinned(ir_node *n) {
1143 if (get_irn_pinned(n) == op_pin_state_pinned)
1145 mem = get_Call_mem(n);
1147 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1148 if (is_NoMem(mem) || is_Pin(mem))
1154 * verify a Call node
1156 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1157 ir_mode *mymode = get_irn_mode(n);
1158 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1159 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1164 /* Call: BB x M x ref x data1 x ... x datan
1165 --> M x datan+1 x ... x data n+m */
1166 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1168 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1169 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1171 mt = get_Call_type(n);
1172 if(get_unknown_type() == mt) {
1176 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1177 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1180 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1181 /* Compare arguments of node with those of type */
1183 if (get_method_variadicity(mt) == variadicity_variadic) {
1185 get_Call_n_params(n) >= get_method_n_params(mt),
1186 "Number of args for Call doesn't match number of args in variadic type.",
1188 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1189 n, get_Call_n_params(n), get_method_n_params(mt));
1193 get_Call_n_params(n) == get_method_n_params(mt),
1194 "Number of args for Call doesn't match number of args in non variadic type.",
1196 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1197 n, get_Call_n_params(n), get_method_n_params(mt));
1201 for (i = 0; i < get_method_n_params(mt); i++) {
1202 ir_type *t = get_method_param_type(mt, i);
1204 if (get_irg_phase_state(irg) != phase_backend) {
1205 if (is_atomic_type(t)) {
1207 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1208 "Mode of arg for Call doesn't match mode of arg type.", 0,
1209 show_call_param(n, mt);
1212 /* call with a compound type, mode must be reference */
1214 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1215 "Mode of arg for Call doesn't match mode of arg type.", 0,
1216 show_call_param(n, mt);
1223 if (Call_has_callees(n)) {
1224 for (i = 0; i < get_Call_n_callees(n); i++) {
1225 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1233 * verify an Add node
1235 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1236 ir_mode *mymode = get_irn_mode(n);
1237 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1238 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1243 /* common Add: BB x numP x numP --> numP */
1244 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1245 /* Pointer Add: BB x ref x int --> ref */
1246 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1247 /* Pointer Add: BB x int x ref --> ref */
1248 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1251 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1252 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1253 "/* Pointer Add: BB x int x ref --> ref */");
1261 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1262 ir_mode *mymode = get_irn_mode(n);
1263 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1264 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1269 /* common Sub: BB x numP x numP --> numP */
1270 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1271 /* Pointer Sub: BB x ref x int --> ref */
1272 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1273 /* Pointer Sub: BB x ref x ref --> int */
1274 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1277 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1278 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1279 "/* Pointer Sub: BB x ref x ref --> int */" );
1285 * verify a Minus node
1287 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1288 ir_mode *mymode = get_irn_mode(n);
1289 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1293 /* Minus: BB x num --> num */
1294 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1295 show_unop_failure(n , "/* Minus: BB x num --> num */");
1303 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1304 ir_mode *mymode = get_irn_mode(n);
1305 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1306 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1311 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1312 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1313 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1314 /* Mul: BB x float x float --> float */
1315 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1318 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1319 "/* Mul: BB x float x float --> float */");
1325 * verify a Mulh node
1327 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1328 ir_mode *mymode = get_irn_mode(n);
1329 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1330 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1335 /* Mulh: BB x int x int --> int */
1336 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1339 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1345 * verify a Quot node
1347 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1348 ir_mode *mymode = get_irn_mode(n);
1349 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1350 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1351 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1355 /* Quot: BB x M x float x float --> M x X x float */
1356 op1mode == mode_M && op2mode == op3mode &&
1357 get_mode_sort(op2mode) == irms_float_number &&
1360 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1366 * verify a DivMod node
1368 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1369 ir_mode *mymode = get_irn_mode(n);
1370 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1371 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1372 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1376 /* DivMod: BB x M x int x int --> M x X x int x int */
1377 op1mode == mode_M &&
1378 mode_is_int(op2mode) &&
1379 op3mode == op2mode &&
1389 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1390 ir_mode *mymode = get_irn_mode(n);
1391 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1392 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1393 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1397 /* Div: BB x M x int x int --> M x X x int */
1398 op1mode == mode_M &&
1399 op2mode == op3mode &&
1400 mode_is_int(op2mode) &&
1410 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1411 ir_mode *mymode = get_irn_mode(n);
1412 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1413 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1414 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1418 /* Mod: BB x M x int x int --> M x X x int */
1419 op1mode == mode_M &&
1420 op2mode == op3mode &&
1421 mode_is_int(op2mode) &&
1429 * verify an Abs node
1431 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1432 ir_mode *mymode = get_irn_mode(n);
1433 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1437 /* Abs: BB x num --> num */
1438 op1mode == mymode &&
1439 mode_is_num (op1mode),
1441 show_unop_failure(n, "/* Abs: BB x num --> num */");
1447 * verify a logical And, Or, Eor node
1449 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1450 ir_mode *mymode = get_irn_mode(n);
1451 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1452 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1456 /* And or Or or Eor: BB x int x int --> int */
1457 (mode_is_int(mymode) || mymode == mode_b) &&
1458 op2mode == op1mode &&
1460 "And, Or or Eor node", 0,
1461 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1466 #define verify_node_And verify_node_Logic
1467 #define verify_node_Or verify_node_Logic
1468 #define verify_node_Eor verify_node_Logic
1473 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1474 ir_mode *mymode = get_irn_mode(n);
1475 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1479 /* Not: BB x int --> int */
1480 (mode_is_int(mymode) || mymode == mode_b) &&
1483 show_unop_failure(n, "/* Not: BB x int --> int */");
1491 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1492 ir_mode *mymode = get_irn_mode(n);
1493 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1494 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1498 /* Cmp: BB x datab x datab --> b16 */
1499 mode_is_datab(op1mode) &&
1500 op2mode == op1mode &&
1503 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1509 * verify a Shift node
1511 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1512 ir_mode *mymode = get_irn_mode(n);
1513 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1514 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1518 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1519 mode_is_int(op1mode) &&
1520 mode_is_int(op2mode) &&
1521 !mode_is_signed(op2mode) &&
1523 "Shl, Shr or Shrs node", 0,
1524 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1529 #define verify_node_Shl verify_node_Shift
1530 #define verify_node_Shr verify_node_Shift
1531 #define verify_node_Shrs verify_node_Shift
1534 * verify a Rotl node
1536 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1537 ir_mode *mymode = get_irn_mode(n);
1538 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1539 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1543 /* Rotl: BB x int x int --> int */
1544 mode_is_int(op1mode) &&
1545 mode_is_int(op2mode) &&
1548 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1554 * verify a Conv node
1556 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1557 ir_mode *mymode = get_irn_mode(n);
1558 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1562 get_irg_phase_state(irg) == phase_backend ||
1563 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1565 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1571 * verify a Cast node
1573 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1574 ir_mode *mymode = get_irn_mode(n);
1575 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1579 /* Conv: BB x datab1 --> datab2 */
1580 mode_is_data(op1mode) && op1mode == mymode,
1582 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1590 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1591 ir_mode *mymode = get_irn_mode(n);
1592 ir_node *block = get_nodes_block(n);
1596 /* a Phi node MUST have the same number of inputs as its block
1597 * Exception is a phi with 0 inputs which is used when (re)constructing the
1599 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1601 get_irn_arity(n) == get_irn_arity(block),
1602 "wrong number of inputs in Phi node", 0,
1603 show_phi_inputs(n, block);
1607 /* Phi: BB x dataM^n --> dataM */
1608 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1609 ir_node *pred = get_Phi_pred(n, i);
1610 if (!is_Bad(pred)) {
1612 get_irn_mode(pred) == mymode,
1614 show_phi_failure(n, pred, i);
1618 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1620 if (mymode == mode_M) {
1621 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1623 ir_node *pred_i = get_Phi_pred(n, i);
1627 for (j = i - 1; j >= 0; --j) {
1628 ir_node *pred_j = get_Phi_pred(n, j);
1633 /* currently this checks fails for blocks with exception
1634 outputs (and these are NOT basic blocks). So it is disabled yet. */
1636 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1637 "At least two different PhiM predecessors are in the same block",
1639 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1649 * verify a Filter node
1651 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1654 #ifdef INTERPROCEDURAL_VIEW
1655 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1656 "Filter may only appear if ip view is constructed.", 0);
1658 /* We should further do tests as for Proj and Phi. */
1663 * verify a Load node
1665 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1666 ir_mode *mymode = get_irn_mode(n);
1667 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1668 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1670 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1671 if (get_irg_phase_state(irg) != phase_backend) {
1672 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1674 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1677 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1678 * (Proj (Proj))) sometimes ...
1680 * interprete.c:ai_eval seems to assume that this happens, too
1682 * obset.c:get_abstval_any can't deal with this if the load has
1686 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1687 assert ((NULL != ent) || (mymode != mode_T));
1695 * verify a Store node
1697 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1700 ir_mode *mymode = get_irn_mode(n);
1701 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1702 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1703 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1705 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1706 if (get_irg_phase_state(irg) != phase_backend) {
1707 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1709 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1711 target = get_ptr_entity(get_Store_ptr(n));
1712 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1714 * If lowered code, any Sels that add 0 may be removed, causing
1715 * an direct access to entities of array or compound type.
1716 * Prevent this by checking the phase.
1718 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1726 * verify an Alloc node
1728 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1729 ir_mode *mymode = get_irn_mode(n);
1730 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1731 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1735 /* Alloc: BB x M x int_u --> M x X x ref */
1736 op1mode == mode_M &&
1737 mode_is_int(op2mode) &&
1738 !mode_is_signed(op2mode) &&
1741 show_node_failure(n);
1747 * verify a Free node
1749 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1750 ir_mode *mymode = get_irn_mode(n);
1751 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1752 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1753 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1757 /* Free: BB x M x ref x int_u --> M */
1758 op1mode == mode_M && mode_is_reference(op2mode) &&
1759 mode_is_int(op3mode) &&
1760 !mode_is_signed(op3mode) &&
1763 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1769 * verify a Sync node
1771 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1773 ir_mode *mymode = get_irn_mode(n);
1776 /* Sync: BB x M^n --> M */
1777 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1778 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1780 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1785 * verify a Confirm node
1787 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1788 ir_mode *mymode = get_irn_mode(n);
1789 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1790 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1794 /* Confirm: BB x T x T --> T */
1795 op1mode == mymode &&
1798 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1806 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1807 ir_mode *mymode = get_irn_mode(n);
1808 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1809 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1810 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1814 /* Mux: BB x b x datab x datab --> datab */
1815 op1mode == mode_b &&
1816 op2mode == mymode &&
1817 op3mode == mymode &&
1818 mode_is_datab(mymode),
1825 * verify a CopyB node
1827 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1828 ir_mode *mymode = get_irn_mode(n);
1829 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1830 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1831 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1832 ir_type *t = get_CopyB_type(n);
1834 /* CopyB: BB x M x ref x ref --> M x X */
1835 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1836 if (get_irg_phase_state(irg) != phase_backend) {
1837 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1842 is_compound_type(t),
1843 "CopyB node should copy compound types only", 0 );
1845 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1846 This should happen RARELY, as CopyB COPIES MEMORY */
1847 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1852 * verify a Bound node
1854 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1855 ir_mode *mymode = get_irn_mode(n);
1856 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1857 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1858 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1859 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1862 /* Bound: BB x M x int x int x int --> M x X */
1865 op1mode == mode_M &&
1866 op2mode == op3mode &&
1867 op3mode == op4mode &&
1868 mode_is_int(op3mode),
1875 * For each usage of a node, it is checked, if the block of the
1876 * node dominates the block of the usage (for phis: the predecessor
1877 * block of the phi for the corresponding edge).
1879 * @return non-zero on success, 0 on dominance error
1881 static int check_dominance_for_node(ir_node *use) {
1882 if (is_Block(use)) {
1883 ir_node *mbh = get_Block_MacroBlock(use);
1886 /* must be a partBlock */
1887 if (is_Block(mbh)) {
1888 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1892 /* This won't work for blocks and the end node */
1893 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1895 ir_node *bl = get_nodes_block(use);
1897 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1898 ir_node *def = get_irn_n(use, i);
1899 ir_node *def_bl = get_nodes_block(def);
1900 ir_node *use_bl = bl;
1902 /* ignore dead definition blocks, will be removed */
1903 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1907 use_bl = get_Block_cfgpred_block(bl, i);
1909 /* ignore dead use blocks, will be removed */
1910 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1914 block_dominates(def_bl, use_bl),
1915 "the definition of a value used violates the dominance property", 0,
1917 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1918 current_ir_graph, def_bl, def, use_bl, use, i
1926 /* Tests the modes of n and its predecessors. */
1927 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1931 if (!get_node_verification_mode())
1934 if (!get_interprocedural_view()) {
1936 * do NOT check placement in interprocedural view, as we don't always know
1937 * the "right" graph ...
1941 /* this seems to be an expensive check in VS compile (9% over all runtime),
1942 so do NOT run it in release mode */
1944 node_is_in_irgs_storage(irg, n),
1945 "Node is not stored on proper IR graph!", 0,
1946 show_node_on_graph(irg, n);
1949 assert(get_irn_irg(n) == irg);
1951 unsigned idx = get_irn_idx(n);
1952 ir_node *node_from_map = get_idx_irn(irg, idx);
1953 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1954 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1960 /* We don't want to test nodes whose predecessors are Bad,
1961 as we would have to special case that for each operation. */
1962 if (op != op_Phi && op != op_Block) {
1963 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1964 if (is_Bad(get_irn_n(n, i)))
1969 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1970 op_pin_state state = get_irn_pinned(n);
1972 state == op_pin_state_floats ||
1973 state == op_pin_state_pinned,
1974 "invalid pin state", 0,
1975 ir_printf("node %+F", n));
1978 if (op->ops.verify_node)
1979 return op->ops.verify_node(n, irg);
1985 int irn_vrfy(ir_node *n) {
1986 #ifdef DEBUG_libfirm
1987 return irn_vrfy_irg(n, current_ir_graph);
1994 /*-----------------------------------------------------------------*/
1995 /* Verify the whole graph. */
1996 /*-----------------------------------------------------------------*/
1998 #ifdef DEBUG_libfirm
2000 * Walker to check every node
2002 static void vrfy_wrap(ir_node *node, void *env) {
2004 *res = irn_vrfy_irg(node, current_ir_graph);
2008 * Walker to check every node including SSA property.
2009 * Only called if dominance info is available.
2011 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2014 *res = irn_vrfy_irg(node, current_ir_graph);
2016 *res = check_dominance_for_node(node);
2020 #endif /* DEBUG_libfirm */
2023 * Calls irn_vrfy for each node in irg.
2024 * Graph must be in state "op_pin_state_pinned".
2025 * If dominance info is available, check the SSA property.
2027 int irg_verify(ir_graph *irg, unsigned flags) {
2029 #ifdef DEBUG_libfirm
2032 rem = current_ir_graph;
2033 current_ir_graph = irg;
2036 last_irg_error = NULL;
2039 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2041 if (flags & VRFY_ENFORCE_SSA)
2046 get_irg_dom_state(irg) == dom_consistent &&
2047 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2051 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2052 ir_entity *ent = get_irg_entity(irg);
2055 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2057 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2060 current_ir_graph = rem;
2064 #endif /* DEBUG_libfirm */
2070 ir_graph_pass_t pass;
2075 * Wrapper to irg_verify to be run as an ir_graph pass.
2077 static int irg_verify_wrapper(ir_graph *irg, void *context) {
2078 struct pass_t *pass = context;
2079 irg_verify(irg, pass->flags);
2080 /* do NOT rerun the pass if verify is ok :-) */
2084 /* Creates an ir_graph pass for irg_verify(). */
2085 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags) {
2086 struct pass_t *pass = XMALLOCZ(struct pass_t);
2088 def_graph_pass_constructor(
2089 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2091 /* neither dump for verify */
2092 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2093 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2095 pass->flags = flags;
2099 /* create a verify pass */
2100 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2102 firm_verification_t old = get_node_verification_mode();
2104 firm_vrfy_failure_msg = NULL;
2105 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2106 res = irn_vrfy_irg(n, irg);
2107 if (res && get_irg_dom_state(irg) == dom_consistent &&
2108 get_irg_pinned(irg) == op_pin_state_pinned)
2109 res = check_dominance_for_node(n);
2110 do_node_verification(old);
2111 *bad_string = firm_vrfy_failure_msg;
2117 typedef struct _vrfy_bad_env_t {
2123 * Pre-Walker: check Bad predecessors of node.
2125 static void check_bads(ir_node *node, void *env) {
2126 vrfy_bad_env_t *venv = env;
2127 int i, arity = get_irn_arity(node);
2129 if (is_Block(node)) {
2130 if ((venv->flags & BAD_CF) == 0) {
2132 /* check for Bad Block predecessor */
2133 for (i = 0; i < arity; ++i) {
2134 ir_node *pred = get_irn_n(node, i);
2137 venv->res |= BAD_CF;
2139 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2140 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2142 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2143 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2144 assert(0 && "Bad CF detected");
2150 if ((venv->flags & BAD_BLOCK) == 0) {
2152 /* check for Bad Block */
2153 if (is_Bad(get_nodes_block(node))) {
2154 venv->res |= BAD_BLOCK;
2156 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2157 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2159 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2160 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2161 assert(0 && "Bad CF detected");
2166 if ((venv->flags & TUPLE) == 0) {
2167 if (is_Tuple(node)) {
2170 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2171 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2173 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2174 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2175 assert(0 && "Tuple detected");
2180 for (i = 0; i < arity; ++i) {
2181 ir_node *pred = get_irn_n(node, i);
2184 /* check for Phi with Bad inputs */
2185 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2186 if (venv->flags & BAD_CF)
2189 venv->res |= BAD_CF;
2191 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2192 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2194 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2195 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2196 assert(0 && "Bad CF detected");
2201 /* Bad node input */
2202 if ((venv->flags & BAD_DF) == 0) {
2203 venv->res |= BAD_DF;
2205 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2206 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2208 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2209 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2210 assert(0 && "Bad NON-CF detected");
2219 * verify occurrence of bad nodes
2221 int irg_vrfy_bads(ir_graph *irg, int flags) {
2227 irg_walk_graph(irg, check_bads, NULL, &env);
2233 * set the default verify operation
2235 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2238 ops->verify_node = verify_node_##a; \
2295 ops->verify_proj_node = verify_node_Proj_##a; \