2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
32 #include "irgraph_t.h"
42 /** if this flag is set, verify entity types in Load & Store nodes */
43 static int vrfy_entities = 0;
45 const char *firm_vrfy_failure_msg;
47 /* enable verification of Load/Store entities */
48 void vrfy_enable_entity_tests(int enable) {
49 vrfy_entities = enable;
55 * little helper for NULL modes
57 static const char *get_mode_name_ex(ir_mode *mode) {
60 return get_mode_name(mode);
63 /** the last IRG, on which a verify error was found */
64 static ir_graph *last_irg_error = NULL;
67 * print the name of the entity of an verification failure
69 static void show_entity_failure(ir_node *node) {
70 ir_graph *irg = get_irn_irg(node);
72 if (last_irg_error == irg)
77 if (irg == get_const_code_irg()) {
78 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
80 ir_entity *ent = get_irg_entity(irg);
83 ir_type *ent_type = get_entity_owner(ent);
86 if (ent_type == get_glob_type())
87 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
89 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
91 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
94 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
100 * Prints a failure for a Node
102 static void show_node_failure(ir_node *n) {
103 show_entity_failure(n);
104 fprintf(stderr, " node %ld %s%s\n" ,
106 get_irn_opname(n), get_irn_modename(n)
111 * Prints a failure message for a binop
113 static void show_binop_failure(ir_node *n, const char *text) {
114 ir_node *left = get_binop_left(n);
115 ir_node *right = get_binop_right(n);
117 show_entity_failure(n);
118 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
120 get_irn_opname(n), get_irn_modename(n),
121 get_irn_opname(left), get_irn_modename(left),
122 get_irn_opname(right), get_irn_modename(right),
127 * Prints a failure message for an unop
129 static void show_unop_failure(ir_node *n, const char *text) {
130 ir_node *op = get_unop_op(n);
132 show_entity_failure(n);
133 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
135 get_irn_opname(n), get_irn_modename(n),
136 get_irn_opname(op), get_irn_modename(op),
141 * Prints a failure message for an op with 3 operands
143 static void show_triop_failure(ir_node *n, const char *text) {
144 ir_node *op0 = get_irn_n(n, 0);
145 ir_node *op1 = get_irn_n(n, 1);
146 ir_node *op2 = get_irn_n(n, 2);
148 show_entity_failure(n);
149 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
151 get_irn_opname(n), get_irn_modename(n),
152 get_irn_opname(op0), get_irn_modename(op0),
153 get_irn_opname(op1), get_irn_modename(op1),
154 get_irn_opname(op2), get_irn_modename(op2),
159 * Prints a failure message for a proj
161 static void show_proj_failure(ir_node *n) {
162 ir_node *op = get_Proj_pred(n);
163 int proj = get_Proj_proj(n);
165 show_entity_failure(n);
166 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
168 get_irn_opname(n), get_irn_modename(n), proj,
169 get_irn_opname(op), get_irn_modename(op));
173 * Prints a failure message for a proj from Start
175 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
176 long proj = get_Proj_proj(n);
177 ir_mode *m = get_type_mode(ty);
179 show_entity_failure(n);
180 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
185 get_mode_name_ex(m));
189 * Prints a failure message for a proj
191 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
192 ir_node *op = get_Proj_pred(n);
193 int proj = get_Proj_proj(n);
194 ir_mode *m = get_type_mode(get_entity_type(ent));
196 show_entity_failure(n);
197 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
199 get_irn_opname(n), get_irn_modename(n), proj,
200 get_irn_opname(op), get_irn_modename(op),
201 get_entity_name(ent), get_type_name(get_entity_type(ent)),
202 get_mode_name_ex(m));
206 * Show a node and a graph
208 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
209 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
213 * Show call parameters
215 static void show_call_param(ir_node *n, ir_type *mt) {
218 show_entity_failure(n);
219 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
220 for (i = 0; i < get_method_n_params(mt); ++i) {
221 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
223 fprintf(stderr, ") != CALL(");
225 for (i = 0; i < get_Call_n_params(n); ++i) {
226 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
228 fprintf(stderr, ")\n");
234 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
235 ir_entity *ent = get_irg_entity(irg);
237 show_entity_failure(n);
238 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
239 get_irn_node_nr(n), get_entity_name(ent),
240 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
241 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
246 * Show return number of results
248 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
249 ir_entity *ent = get_irg_entity(irg);
251 show_entity_failure(n);
252 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
253 get_irn_node_nr(n), get_entity_name(ent),
254 get_Return_n_ress(n), get_method_n_ress(mt));
260 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
262 show_entity_failure(phi);
263 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
264 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
265 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
271 static void show_phi_inputs(ir_node *phi, ir_node *block) {
272 show_entity_failure(phi);
273 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
274 get_irn_node_nr(phi), get_irn_arity(phi),
275 get_irn_node_nr(block), get_irn_arity(block));
278 #endif /* #ifndef NDEBUG */
281 * If the address is Sel or SymConst, return the entity.
283 * @param ptr the node representing the address
285 static ir_entity *get_ptr_entity(ir_node *ptr) {
286 if (get_irn_op(ptr) == op_Sel) {
287 return get_Sel_entity(ptr);
288 } else if (is_SymConst_addr_ent(ptr)) {
289 return get_SymConst_entity(ptr);
295 * verify a Proj(Start) node
297 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
298 ir_mode *mode = get_irn_mode(p);
299 long proj = get_Proj_proj(p);
304 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
305 (proj == pn_Start_M && mode == mode_M) ||
306 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
307 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
308 (proj == pn_Start_T_args && mode == mode_T) ||
309 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
310 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
312 "wrong Proj from Start", 0,
313 show_proj_failure(p);
319 * verify a Proj(Cond) node
321 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
322 ir_mode *mode = get_irn_mode(p);
323 long proj = get_Proj_proj(p);
327 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
328 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
329 is_Bad(get_Cond_selector(pred)) /* rare */
331 "wrong Proj from Cond", 0,
332 show_proj_failure(p);
338 * verify a Proj(Raise) node
340 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
341 ir_mode *mode = get_irn_mode(p);
342 long proj = get_Proj_proj(p);
346 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
347 "wrong Proj from Raise", 0,
348 show_proj_failure(p);
354 * verify a Proj(InstOf) node
356 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
357 ir_mode *mode = get_irn_mode(p);
358 long proj = get_Proj_proj(p);
363 (proj == pn_InstOf_M_regular && mode == mode_M) ||
364 (proj == pn_InstOf_X_regular && mode == mode_X) ||
365 (proj == pn_InstOf_X_except && mode == mode_X) ||
366 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
367 (proj == pn_InstOf_M_except && mode == mode_M)
369 "wrong Proj from InstOf", 0,
370 show_proj_failure(p);
376 * verify a Proj(Call) node
378 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
379 ir_mode *mode = get_irn_mode(p);
380 long proj = get_Proj_proj(p);
384 (proj == pn_Call_M_regular && mode == mode_M) ||
385 (proj == pn_Call_X_regular && mode == mode_X) ||
386 (proj == pn_Call_X_except && mode == mode_X) ||
387 (proj == pn_Call_T_result && mode == mode_T) ||
388 (proj == pn_Call_M_except && mode == mode_M) ||
389 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
391 "wrong Proj from Call", 0,
392 show_proj_failure(p);
394 /* if we have exception flow, we must have a real Memory input */
395 if (proj == pn_Call_X_regular)
397 get_irn_op(get_Call_mem(n)) != op_NoMem,
398 "Regular Proj from FunctionCall", 0);
399 else if (proj == pn_Call_X_except)
401 get_irn_op(get_Call_mem(n)) != op_NoMem,
402 "Exception Proj from FunctionCall", 0);
403 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
405 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
406 "Memory Proj from FunctionCall", 0);
411 * verify a Proj(Quot) node
413 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
414 ir_mode *mode = get_irn_mode(p);
415 long proj = get_Proj_proj(p);
419 (proj == pn_Quot_M && mode == mode_M) ||
420 (proj == pn_Quot_X_regular && mode == mode_X) ||
421 (proj == pn_Quot_X_except && mode == mode_X) ||
422 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
424 "wrong Proj from Quot", 0,
425 show_proj_failure(p);
427 if (proj == pn_Quot_X_regular)
429 get_irn_pinned(n) == op_pin_state_pinned,
430 "Regular Proj from unpinned Quot", 0);
431 else if (proj == pn_Quot_X_except)
433 get_irn_pinned(n) == op_pin_state_pinned,
434 "Exception Proj from unpinned Quot", 0);
435 else if (proj == pn_Quot_M)
437 get_irn_pinned(n) == op_pin_state_pinned,
438 "Memory Proj from unpinned Quot", 0);
443 * verify a Proj(DivMod) node
445 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
446 ir_mode *mode = get_irn_mode(p);
447 long proj = get_Proj_proj(p);
451 (proj == pn_DivMod_M && mode == mode_M) ||
452 (proj == pn_DivMod_X_regular && mode == mode_X) ||
453 (proj == pn_DivMod_X_except && mode == mode_X) ||
454 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
455 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
457 "wrong Proj from DivMod", 0,
458 show_proj_failure(p);
460 if (proj == pn_DivMod_X_regular)
462 get_irn_pinned(n) == op_pin_state_pinned,
463 "Regular Proj from unpinned DivMod", 0);
464 else if (proj == pn_DivMod_X_except)
466 get_irn_pinned(n) == op_pin_state_pinned,
467 "Exception Proj from unpinned DivMod", 0);
468 else if (proj == pn_DivMod_M)
470 get_irn_pinned(n) == op_pin_state_pinned,
471 "Memory Proj from unpinned DivMod", 0);
476 * verify a Proj(Div) node
478 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
479 ir_mode *mode = get_irn_mode(p);
480 long proj = get_Proj_proj(p);
484 (proj == pn_Div_M && mode == mode_M) ||
485 (proj == pn_Div_X_regular && mode == mode_X) ||
486 (proj == pn_Div_X_except && mode == mode_X) ||
487 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
489 "wrong Proj from Div", 0,
490 show_proj_failure(p);
492 if (proj == pn_Div_X_regular)
494 get_irn_pinned(n) == op_pin_state_pinned,
495 "Regular Proj from unpinned Div", 0);
496 else if (proj == pn_Div_X_except)
498 get_irn_pinned(n) == op_pin_state_pinned,
499 "Exception Proj from unpinned Div", 0);
500 else if (proj == pn_Div_M)
502 get_irn_pinned(n) == op_pin_state_pinned,
503 "Memory Proj from unpinned Div", 0);
508 * verify a Proj(Mod) node
510 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
511 ir_mode *mode = get_irn_mode(p);
512 long proj = get_Proj_proj(p);
516 (proj == pn_Mod_M && mode == mode_M) ||
517 (proj == pn_Mod_X_regular && mode == mode_X) ||
518 (proj == pn_Mod_X_except && mode == mode_X) ||
519 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
521 "wrong Proj from Mod", 0,
522 show_proj_failure(p);
524 if (proj == pn_Mod_X_regular)
526 get_irn_pinned(n) == op_pin_state_pinned,
527 "Regular Proj from unpinned Mod", 0);
528 else if (proj == pn_Mod_X_except)
530 get_irn_pinned(n) == op_pin_state_pinned,
531 "Exception Proj from unpinned Mod", 0);
532 else if (proj == pn_Mod_M)
534 get_irn_pinned(n) == op_pin_state_pinned,
535 "Memory Proj from unpinned Div", 0);
540 * verify a Proj(Cmp) node
542 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
543 ir_mode *mode = get_irn_mode(p);
544 long proj = get_Proj_proj(p);
548 (proj >= 0 && proj <= 15 && mode == mode_b),
549 "wrong Proj from Cmp", 0,
550 show_proj_failure(p);
553 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
554 "unordered Proj for non-float Cmp", 0,
555 show_proj_failure(p);
561 * verify a Proj(Load) node
563 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
564 ir_mode *mode = get_irn_mode(p);
565 long proj = get_Proj_proj(p);
567 if (proj == pn_Load_res) {
568 ir_node *ptr = get_Load_ptr(n);
569 ir_entity *ent = get_ptr_entity(ptr);
571 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
572 /* do NOT check this for lowered phases, see comment on Store */
574 (mode == get_type_mode(get_entity_type(ent))),
575 "wrong data Proj from Load, entity type_mode failed", 0,
576 show_proj_failure_ent(p, ent);
581 mode_is_data(mode) && mode == get_Load_mode(n),
582 "wrong data Proj from Load", 0,
583 show_proj_failure(p);
590 (proj == pn_Load_M && mode == mode_M) ||
591 (proj == pn_Load_X_regular && mode == mode_X) ||
592 (proj == pn_Load_X_except && mode == mode_X)
594 "wrong Proj from Load", 0,
595 show_proj_failure(p);
598 if (proj == pn_Load_X_regular) {
600 get_irn_pinned(n) == op_pin_state_pinned,
601 "Regular Proj from unpinned Load", 0);
602 } else if (proj == pn_Load_X_except) {
604 get_irn_pinned(n) == op_pin_state_pinned,
605 "Exception Proj from unpinned Load", 0);
611 * verify a Proj(Store) node
613 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
614 ir_mode *mode = get_irn_mode(p);
615 long proj = get_Proj_proj(p);
619 (proj == pn_Store_M && mode == mode_M) ||
620 (proj == pn_Store_X_regular && mode == mode_X) ||
621 (proj == pn_Store_X_except && mode == mode_X)
623 "wrong Proj from Store", 0,
624 show_proj_failure(p);
626 if (proj == pn_Store_X_regular) {
628 get_irn_pinned(n) == op_pin_state_pinned,
629 "Regular Proj from unpinned Store", 0);
630 } else if (proj == pn_Store_X_except) {
632 get_irn_pinned(n) == op_pin_state_pinned,
633 "Exception Proj from unpinned Store", 0);
639 * verify a Proj(Alloc) node
641 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
642 ir_mode *mode = get_irn_mode(p);
643 long proj = get_Proj_proj(p);
648 (proj == pn_Alloc_M && mode == mode_M) ||
649 (proj == pn_Alloc_X_regular && mode == mode_X) ||
650 (proj == pn_Alloc_X_except && mode == mode_X) ||
651 (proj == pn_Alloc_res && mode_is_reference(mode))
653 "wrong Proj from Alloc", 0,
654 show_proj_failure(p);
660 * verify a Proj(Proj) node
662 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
663 ir_mode *mode = get_irn_mode(p);
664 long proj = get_Proj_proj(p);
665 long nr = get_Proj_proj(pred);
666 ir_type *mt; /* A method type */
668 pred = skip_Id(get_Proj_pred(pred));
669 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
671 switch (get_irn_opcode(pred)) {
673 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
675 if (nr == pn_Start_T_args) {
677 (proj >= 0 && mode_is_datab(mode)),
678 "wrong Proj from Proj from Start", 0);
680 (proj < get_method_n_params(mt)),
681 "More Projs for args than args in type", 0
683 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
684 /* value argument */ break;
686 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
688 (mode == get_type_mode(get_method_param_type(mt, proj))),
689 "Mode of Proj from Start doesn't match mode of param type.", 0,
690 show_proj_mode_failure(p, get_method_param_type(mt, proj));
693 } else if (nr == pn_Start_P_value_arg_base) {
695 (proj >= 0 && mode_is_reference(mode)),
696 "wrong Proj from Proj from Start", 0
699 (proj < get_method_n_params(mt)),
700 "More Projs for args than args in type", 0
708 (proj >= 0 && mode_is_datab(mode)),
709 "wrong Proj from Proj from Call", 0);
710 mt = get_Call_type(pred);
712 (proj < get_method_n_ress(mt)),
713 "More Projs for results than results in type.", 0);
714 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
715 /* value result */ break;
718 (mode == get_type_mode(get_method_res_type(mt, proj))),
719 "Mode of Proj from Call doesn't match mode of result type.", 0);
728 /* hmm, optimization did not remove it */
732 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
739 * verify a Proj(Tuple) node
741 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
749 * verify a Proj(CallBegin) node
751 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
758 * verify a Proj(EndReg) node
760 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
763 #ifdef INTERPROCEDURAL_VIEW
765 (get_irp_ip_view_state() != ip_view_no),
766 "EndReg may only appear if ip view is constructed.", 0);
772 * verify a Proj(EndExcept) node
774 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
777 #ifdef INTERPROCEDURAL_VIEW
779 (get_irp_ip_view_state() != ip_view_no),
780 "EndExcept may only appear if ip view is constructed.", 0);
786 * verify a Proj(CopyB) node
788 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
789 ir_mode *mode = get_irn_mode(p);
790 long proj = get_Proj_proj(p);
794 (proj == pn_CopyB_M_regular && mode == mode_M) ||
795 (proj == pn_CopyB_X_regular && mode == mode_X) ||
796 (proj == pn_CopyB_X_except && mode == mode_X) ||
797 (proj == pn_CopyB_M_except && mode == mode_M)
799 "wrong Proj from CopyB", 0,
800 show_proj_failure(p);
802 if (proj == pn_CopyB_X_regular)
804 get_irn_pinned(n) == op_pin_state_pinned,
805 "Regular Proj from unpinned CopyB", 0);
806 else if (proj == pn_CopyB_X_except)
808 get_irn_pinned(n) == op_pin_state_pinned,
809 "Exception Proj from unpinned CopyB", 0);
814 * verify a Proj(Bound) node
816 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
817 ir_mode *mode = get_irn_mode(p);
818 long proj = get_Proj_proj(p);
820 /* ignore Bound checks of Bad */
821 if (is_Bad(get_Bound_index(n)))
825 (proj == pn_Bound_M && mode == mode_M) ||
826 (proj == pn_Bound_X_regular && mode == mode_X) ||
827 (proj == pn_Bound_X_except && mode == mode_X) ||
828 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
830 "wrong Proj from Bound", 0,
831 show_proj_failure(p);
840 verify_node_Proj(ir_node *p, ir_graph *irg) {
845 pred = skip_Id(get_Proj_pred(p));
846 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
848 op = get_irn_op(pred);
850 if (op->ops.verify_proj_node)
851 return op->ops.verify_proj_node(pred, p);
858 * verify a Block node
860 static int verify_node_Block(ir_node *n, ir_graph *irg) {
862 ir_node *mb = get_Block_MacroBlock(n);
864 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
866 if (is_Block(mb) && mb != n) {
869 /* Blocks with more than one predecessor must be header blocks */
870 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
871 if (get_irg_phase_state(irg) != phase_backend) {
872 pred = get_Block_cfgpred(n, 0);
874 /* the predecessor MUST be a regular Proj */
875 ir_node *frag_op = get_Proj_pred(pred);
877 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
878 "partBlock with non-regular predecessor", 0);
880 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
881 of fragile nodes during construction. It does not violate our assumption of dominance
883 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
884 "partBlock with non-regular predecessor", 0);
887 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
891 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
892 ir_node *pred = get_Block_cfgpred(n, i);
894 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
895 "Block node must have a mode_X predecessor", 0);
898 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
899 /* End block may only have Return, Raise or fragile ops as preds. */
900 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
901 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
902 if (is_Proj(pred) || is_Tuple(pred))
903 break; /* We can not test properly. How many tuples are there? */
911 "End Block node", 0);
913 /* irg attr must == graph we are in. */
914 if (! get_interprocedural_view()) {
915 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
921 * verify a Start node
923 static int verify_node_Start(ir_node *n, ir_graph *irg) {
924 ir_mode *mymode = get_irn_mode(n);
928 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
929 mymode == mode_T, "Start node", 0
937 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
938 ir_mode *mymode = get_irn_mode(n);
943 mymode == mode_X, "Jmp node", 0
949 * verify an IJmp node
951 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
952 ir_mode *mymode = get_irn_mode(n);
953 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
957 /* IJmp: BB x ref --> X */
958 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
964 * verify a Break node
966 static int verify_node_Break(ir_node *n, ir_graph *irg) {
967 ir_mode *mymode = get_irn_mode(n);
970 #ifdef INTERPROCEDURAL_VIEW
971 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
972 "Break may only appear if ip view is constructed.", 0);
976 mymode == mode_X, "Break node", 0
984 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
985 ir_mode *mymode = get_irn_mode(n);
986 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
990 /* Cond: BB x b --> X x X */
991 (op1mode == mode_b ||
992 /* Cond: BB x int --> X^n */
993 mode_is_int(op1mode) ), "Cond node", 0
995 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
1001 * verify a Return node
1003 static int verify_node_Return(ir_node *n, ir_graph *irg) {
1005 ir_mode *mymode = get_irn_mode(n);
1006 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
1009 /* Return: BB x M x data1 x ... x datan --> X */
1011 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1013 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1014 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1016 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1017 /* Compare returned results with result types of method type */
1018 mt = get_entity_type(get_irg_entity(irg));
1019 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1020 "Number of results for Return doesn't match number of results in type.", 0,
1021 show_return_nres(irg, n, mt););
1022 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1023 ir_type *res_type = get_method_res_type(mt, i);
1025 if (get_irg_phase_state(irg) != phase_backend) {
1026 if (is_atomic_type(res_type)) {
1028 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1029 "Mode of result for Return doesn't match mode of result type.", 0,
1030 show_return_modes(irg, n, mt, i);
1034 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1035 "Mode of result for Return doesn't match mode of result type.", 0,
1036 show_return_modes(irg, n, mt, i);
1045 * verify a Raise node
1047 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1048 ir_mode *mymode = get_irn_mode(n);
1049 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1050 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1054 /* Sel: BB x M x ref --> X x M */
1055 op1mode == mode_M && mode_is_reference(op2mode) &&
1056 mymode == mode_T, "Raise node", 0
1062 * verify a Const node
1064 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1065 ir_mode *mymode = get_irn_mode(n);
1069 /* Const: BB --> data */
1070 (mode_is_data(mymode) ||
1071 mymode == mode_b) /* we want boolean constants for static evaluation */
1072 ,"Const node", 0 /* of Cmp. */
1075 /* the modes of the constant and teh tarval must match */
1076 mymode == get_tarval_mode(get_Const_tarval(n)),
1077 "Const node, tarval and node mode mismatch", 0
1083 * verify a SymConst node
1085 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1086 ir_mode *mymode = get_irn_mode(n);
1089 if (get_SymConst_kind(n) == symconst_addr_ent) {
1090 ir_entity *ent = get_SymConst_entity(n);
1091 if (is_Method_type(get_entity_type(ent)) &&
1092 get_irn_irg(n) != get_const_code_irg()) {
1094 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1095 "A constant must address an existing method.", 0);
1100 /* SymConst: BB --> int*/
1101 (mode_is_int(mymode) ||
1102 /* SymConst: BB --> ref */
1103 mode_is_reference(mymode))
1104 ,"SymConst node", 0);
1111 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1113 ir_mode *mymode = get_irn_mode(n);
1114 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1115 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1120 /* Sel: BB x M x ref x int^n --> ref */
1121 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1122 "Sel node", 0, show_node_failure(n)
1125 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1126 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1128 ent = get_Sel_entity(n);
1129 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1134 * verify an InstOf node
1136 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1137 ir_mode *mymode = get_irn_mode(n);
1138 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1141 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1142 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1147 * Check if the pinned state is right.
1149 static int verify_right_pinned(ir_node *n) {
1152 if (get_irn_pinned(n) == op_pin_state_pinned)
1154 mem = get_Call_mem(n);
1156 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1157 if (is_NoMem(mem) || is_Pin(mem))
1163 * verify a Call node
1165 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1166 ir_mode *mymode = get_irn_mode(n);
1167 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1168 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1173 /* Call: BB x M x ref x data1 x ... x datan
1174 --> M x datan+1 x ... x data n+m */
1175 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1177 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1178 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1180 mt = get_Call_type(n);
1181 if(get_unknown_type() == mt) {
1185 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1186 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1189 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1190 /* Compare arguments of node with those of type */
1192 if (get_method_variadicity(mt) == variadicity_variadic) {
1194 get_Call_n_params(n) >= get_method_n_params(mt),
1195 "Number of args for Call doesn't match number of args in variadic type.",
1197 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1198 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1202 get_Call_n_params(n) == get_method_n_params(mt),
1203 "Number of args for Call doesn't match number of args in non variadic type.",
1205 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1206 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1210 for (i = 0; i < get_method_n_params(mt); i++) {
1211 ir_type *t = get_method_param_type(mt, i);
1213 if (get_irg_phase_state(irg) != phase_backend) {
1214 if (is_atomic_type(t)) {
1216 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1217 "Mode of arg for Call doesn't match mode of arg type.", 0,
1218 show_call_param(n, mt);
1221 /* call with a compound type, mode must be reference */
1223 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1224 "Mode of arg for Call doesn't match mode of arg type.", 0,
1225 show_call_param(n, mt);
1232 if (Call_has_callees(n)) {
1233 for (i = 0; i < get_Call_n_callees(n); i++) {
1234 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1242 * verify an Add node
1244 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1245 ir_mode *mymode = get_irn_mode(n);
1246 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1247 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1252 /* common Add: BB x numP x numP --> numP */
1253 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1254 /* Pointer Add: BB x ref x int --> ref */
1255 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1256 /* Pointer Add: BB x int x ref --> ref */
1257 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1260 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1261 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1262 "/* Pointer Add: BB x int x ref --> ref */");
1270 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1271 ir_mode *mymode = get_irn_mode(n);
1272 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1273 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1278 /* common Sub: BB x numP x numP --> numP */
1279 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1280 /* Pointer Sub: BB x ref x int --> ref */
1281 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1282 /* Pointer Sub: BB x ref x ref --> int */
1283 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1286 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1287 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1288 "/* Pointer Sub: BB x ref x ref --> int */" );
1294 * verify a Minus node
1296 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1297 ir_mode *mymode = get_irn_mode(n);
1298 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1302 /* Minus: BB x num --> num */
1303 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1304 show_unop_failure(n , "/* Minus: BB x num --> num */");
1312 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1313 ir_mode *mymode = get_irn_mode(n);
1314 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1315 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1320 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1321 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1322 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1323 /* Mul: BB x float x float --> float */
1324 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1327 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1328 "/* Mul: BB x float x float --> float */");
1334 * verify a Mulh node
1336 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1337 ir_mode *mymode = get_irn_mode(n);
1338 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1339 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1344 /* Mulh: BB x int x int --> int */
1345 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1348 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1354 * verify a Quot node
1356 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1357 ir_mode *mymode = get_irn_mode(n);
1358 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1359 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1360 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1364 /* Quot: BB x M x float x float --> M x X x float */
1365 op1mode == mode_M && op2mode == op3mode &&
1366 get_mode_sort(op2mode) == irms_float_number &&
1369 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1375 * verify a DivMod node
1377 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1378 ir_mode *mymode = get_irn_mode(n);
1379 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1380 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1381 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1385 /* DivMod: BB x M x int x int --> M x X x int x int */
1386 op1mode == mode_M &&
1387 mode_is_int(op2mode) &&
1388 op3mode == op2mode &&
1398 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1399 ir_mode *mymode = get_irn_mode(n);
1400 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1401 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1402 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1406 /* Div: BB x M x int x int --> M x X x int */
1407 op1mode == mode_M &&
1408 op2mode == op3mode &&
1409 mode_is_int(op2mode) &&
1419 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1420 ir_mode *mymode = get_irn_mode(n);
1421 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1422 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1423 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1427 /* Mod: BB x M x int x int --> M x X x int */
1428 op1mode == mode_M &&
1429 op2mode == op3mode &&
1430 mode_is_int(op2mode) &&
1438 * verify an Abs node
1440 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1441 ir_mode *mymode = get_irn_mode(n);
1442 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1446 /* Abs: BB x num --> num */
1447 op1mode == mymode &&
1448 mode_is_num (op1mode),
1450 show_unop_failure(n, "/* Abs: BB x num --> num */");
1456 * verify a logical And, Or, Eor node
1458 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1459 ir_mode *mymode = get_irn_mode(n);
1460 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1461 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1465 /* And or Or or Eor: BB x int x int --> int */
1466 (mode_is_int(mymode) || mymode == mode_b) &&
1467 op2mode == op1mode &&
1469 "And, Or or Eor node", 0,
1470 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1475 #define verify_node_And verify_node_Logic
1476 #define verify_node_Or verify_node_Logic
1477 #define verify_node_Eor verify_node_Logic
1482 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1488 /* Not: BB x int --> int */
1489 (mode_is_int(mymode) || mymode == mode_b) &&
1492 show_unop_failure(n, "/* Not: BB x int --> int */");
1500 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1501 ir_mode *mymode = get_irn_mode(n);
1502 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1503 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1507 /* Cmp: BB x datab x datab --> b16 */
1508 mode_is_datab(op1mode) &&
1509 op2mode == op1mode &&
1512 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1518 * verify a Shift node
1520 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1521 ir_mode *mymode = get_irn_mode(n);
1522 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1523 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1527 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1528 mode_is_int(op1mode) &&
1529 mode_is_int(op2mode) &&
1530 !mode_is_signed(op2mode) &&
1532 "Shl, Shr or Shrs node", 0,
1533 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1538 #define verify_node_Shl verify_node_Shift
1539 #define verify_node_Shr verify_node_Shift
1540 #define verify_node_Shrs verify_node_Shift
1543 * verify a Rotl node
1545 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1546 ir_mode *mymode = get_irn_mode(n);
1547 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1548 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1552 /* Rotl: BB x int x int --> int */
1553 mode_is_int(op1mode) &&
1554 mode_is_int(op2mode) &&
1557 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1563 * verify a Conv node
1565 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1566 ir_mode *mymode = get_irn_mode(n);
1567 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1571 get_irg_phase_state(irg) == phase_backend ||
1572 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1574 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1580 * verify a Cast node
1582 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1583 ir_mode *mymode = get_irn_mode(n);
1584 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1588 /* Conv: BB x datab1 --> datab2 */
1589 mode_is_data(op1mode) && op1mode == mymode,
1591 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1599 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1600 ir_mode *mymode = get_irn_mode(n);
1601 ir_node *block = get_nodes_block(n);
1605 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1606 /* a Phi node MUST have the same number of inputs as its block */
1608 get_irn_arity(n) == get_irn_arity(block),
1609 "wrong number of inputs in Phi node", 0,
1610 show_phi_inputs(n, block);
1614 /* Phi: BB x dataM^n --> dataM */
1615 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1616 ir_node *pred = get_irn_n(n, i);
1617 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown)) {
1619 get_irn_mode(pred) == mymode,
1621 show_phi_failure(n, pred, i);
1625 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1627 if (mymode == mode_M) {
1628 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1630 ir_node *pred_i = get_Phi_pred(n, i);
1634 for (j = i - 1; j >= 0; --j) {
1635 ir_node *pred_j = get_Phi_pred(n, j);
1640 /* currently this checks fails for blocks with exception
1641 outputs (and these are NOT basic blocks). So it is disabled yet. */
1643 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1644 "At least two different PhiM predecessors are in the same block",
1646 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1656 * verify a Filter node
1658 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1661 #ifdef INTERPROCEDURAL_VIEW
1662 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1663 "Filter may only appear if ip view is constructed.", 0);
1665 /* We should further do tests as for Proj and Phi. */
1670 * verify a Load node
1672 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1673 ir_mode *mymode = get_irn_mode(n);
1674 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1675 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1677 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1678 if (get_irg_phase_state(irg) != phase_backend) {
1679 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1681 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1682 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1684 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1687 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1688 * (Proj (Proj))) sometimes ...
1690 * interprete.c:ai_eval seems to assume that this happens, too
1692 * obset.c:get_abstval_any can't deal with this if the load has
1696 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1697 assert ((NULL != ent) || (mymode != mode_T));
1705 * verify a Store node
1707 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1710 ir_mode *mymode = get_irn_mode(n);
1711 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1712 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1713 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1715 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1716 if (get_irg_phase_state(irg) != phase_backend) {
1717 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1719 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1720 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1722 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1724 target = get_ptr_entity(get_Store_ptr(n));
1725 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1727 * If lowered code, any Sels that add 0 may be removed, causing
1728 * an direct access to entities of array or compound type.
1729 * Prevent this by checking the phase.
1731 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1739 * verify an Alloc node
1741 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1742 ir_mode *mymode = get_irn_mode(n);
1743 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1744 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1748 /* Alloc: BB x M x int_u --> M x X x ref */
1749 op1mode == mode_M &&
1750 mode_is_int(op2mode) &&
1751 !mode_is_signed(op2mode) &&
1754 show_node_failure(n);
1760 * verify a Free node
1762 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1763 ir_mode *mymode = get_irn_mode(n);
1764 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1765 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1766 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1770 /* Free: BB x M x ref x int_u --> M */
1771 op1mode == mode_M && mode_is_reference(op2mode) &&
1772 mode_is_int(op3mode) &&
1773 !mode_is_signed(op3mode) &&
1776 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1782 * verify a Sync node
1784 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1786 ir_mode *mymode = get_irn_mode(n);
1789 /* Sync: BB x M^n --> M */
1790 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1791 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1793 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1798 * verify a Confirm node
1800 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1801 ir_mode *mymode = get_irn_mode(n);
1802 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1803 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1807 /* Confirm: BB x T x T --> T */
1808 op1mode == mymode &&
1811 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1819 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1820 ir_mode *mymode = get_irn_mode(n);
1821 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1822 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1823 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1827 /* Mux: BB x b x datab x datab --> datab */
1828 op1mode == mode_b &&
1829 op2mode == mymode &&
1830 op3mode == mymode &&
1831 mode_is_datab(mymode),
1838 * verify a CopyB node
1840 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1841 ir_mode *mymode = get_irn_mode(n);
1842 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1843 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1844 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1845 ir_type *t = get_CopyB_type(n);
1847 /* CopyB: BB x M x ref x ref --> M x X */
1848 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1849 if (get_irg_phase_state(irg) != phase_backend) {
1850 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1853 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1854 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1855 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1856 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1860 is_compound_type(t),
1861 "CopyB node should copy compound types only", 0 );
1863 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1864 This should happen RARELY, as CopyB COPIES MEMORY */
1865 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1870 * verify a Bound node
1872 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1873 ir_mode *mymode = get_irn_mode(n);
1874 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1875 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1876 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1877 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1880 /* Bound: BB x M x int x int x int --> M x X */
1883 op1mode == mode_M &&
1884 op2mode == op3mode &&
1885 op3mode == op4mode &&
1886 mode_is_int(op3mode),
1893 * For each usage of a node, it is checked, if the block of the
1894 * node dominates the block of the usage (for phis: the predecessor
1895 * block of the phi for the corresponding edge).
1897 * @return non-zero on success, 0 on dominance error
1899 static int check_dominance_for_node(ir_node *use) {
1900 if (is_Block(use)) {
1901 ir_node *mbh = get_Block_MacroBlock(use);
1904 /* must be a partBlock */
1905 if (is_Block(mbh)) {
1906 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1910 /* This won't work for blocks and the end node */
1911 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1913 ir_node *bl = get_nodes_block(use);
1915 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1916 ir_node *def = get_irn_n(use, i);
1917 ir_node *def_bl = get_nodes_block(def);
1918 ir_node *use_bl = bl;
1920 /* ignore dead definition blocks, will be removed */
1921 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1925 use_bl = get_Block_cfgpred_block(bl, i);
1927 /* ignore dead use blocks, will be removed */
1928 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1932 block_dominates(def_bl, use_bl),
1933 "the definition of a value used violates the dominance property", 0,
1935 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1936 current_ir_graph, def_bl, def, use_bl, use, i
1944 /* Tests the modes of n and its predecessors. */
1945 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1949 if (!get_node_verification_mode())
1952 if (!get_interprocedural_view()) {
1954 * do NOT check placement in interprocedural view, as we don't always know
1955 * the "right" graph ...
1958 node_is_in_irgs_storage(irg, n),
1959 "Node is not stored on proper IR graph!", 0,
1960 show_node_on_graph(irg, n);
1962 assert(get_irn_irg(n) == irg);
1964 unsigned idx = get_irn_idx(n);
1965 ir_node *node_from_map = get_idx_irn(irg, idx);
1966 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0, ir_printf("node %+F node in map %+F(%p)", n, node_from_map, node_from_map));
1972 /* We don't want to test nodes whose predecessors are Bad,
1973 as we would have to special case that for each operation. */
1974 if (op != op_Phi && op != op_Block) {
1975 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1976 if (is_Bad(get_irn_n(n, i)))
1981 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1982 op_pin_state state = get_irn_pinned(n);
1984 state == op_pin_state_floats ||
1985 state == op_pin_state_pinned,
1986 "invalid pin state", 0,
1987 ir_printf("node %+F", n));
1990 if (op->ops.verify_node)
1991 return op->ops.verify_node(n, irg);
1997 int irn_vrfy(ir_node *n) {
1998 #ifdef DEBUG_libfirm
1999 return irn_vrfy_irg(n, current_ir_graph);
2006 /*-----------------------------------------------------------------*/
2007 /* Verify the whole graph. */
2008 /*-----------------------------------------------------------------*/
2010 #ifdef DEBUG_libfirm
2012 * Walker to check every node
2014 static void vrfy_wrap(ir_node *node, void *env) {
2016 *res = irn_vrfy(node);
2020 * Walker to check every node including SSA property.
2021 * Only called if dominance info is available.
2023 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2026 *res = irn_vrfy(node);
2028 *res = check_dominance_for_node(node);
2032 #endif /* DEBUG_libfirm */
2035 * Calls irn_vrfy for each node in irg.
2036 * Graph must be in state "op_pin_state_pinned".
2037 * If dominance info is available, check the SSA property.
2039 int irg_verify(ir_graph *irg, unsigned flags) {
2041 #ifdef DEBUG_libfirm
2044 rem = current_ir_graph;
2045 current_ir_graph = irg;
2048 last_irg_error = NULL;
2051 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2053 if (flags & VRFY_ENFORCE_SSA)
2058 get_irg_dom_state(irg) == dom_consistent &&
2059 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2063 current_ir_graph = rem;
2065 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2066 ir_entity *ent = get_irg_entity(current_ir_graph);
2069 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2071 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
2076 #endif /* DEBUG_libfirm */
2081 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2083 firm_verification_t old = get_node_verification_mode();
2085 firm_vrfy_failure_msg = NULL;
2086 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2087 res = irn_vrfy_irg(n, irg);
2088 if (res && get_irg_dom_state(irg) == dom_consistent &&
2089 get_irg_pinned(irg) == op_pin_state_pinned)
2090 res = check_dominance_for_node(n);
2091 do_node_verification(old);
2092 *bad_string = firm_vrfy_failure_msg;
2098 typedef struct _vrfy_bad_env_t {
2104 * Pre-Walker: check Bad predecessors of node.
2106 static void check_bads(ir_node *node, void *env) {
2107 vrfy_bad_env_t *venv = env;
2108 int i, arity = get_irn_arity(node);
2110 if (is_Block(node)) {
2111 if ((venv->flags & BAD_CF) == 0) {
2113 /* check for Bad Block predecessor */
2114 for (i = 0; i < arity; ++i) {
2115 ir_node *pred = get_irn_n(node, i);
2118 venv->res |= BAD_CF;
2120 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2121 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2123 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2124 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2125 assert(0 && "Bad CF detected");
2131 if ((venv->flags & BAD_BLOCK) == 0) {
2133 /* check for Bad Block */
2134 if (is_Bad(get_nodes_block(node))) {
2135 venv->res |= BAD_BLOCK;
2137 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2138 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2140 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2141 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2142 assert(0 && "Bad CF detected");
2147 if ((venv->flags & TUPLE) == 0) {
2148 if (get_irn_op(node) == op_Tuple) {
2151 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2152 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2154 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2155 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2156 assert(0 && "Tuple detected");
2161 for (i = 0; i < arity; ++i) {
2162 ir_node *pred = get_irn_n(node, i);
2165 /* check for Phi with Bad inputs */
2166 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2167 if (venv->flags & BAD_CF)
2170 venv->res |= BAD_CF;
2172 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2173 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2175 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2176 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2177 assert(0 && "Bad CF detected");
2182 /* Bad node input */
2183 if ((venv->flags & BAD_DF) == 0) {
2184 venv->res |= BAD_DF;
2186 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2187 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2189 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2190 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2191 assert(0 && "Bad NON-CF detected");
2200 * verify occurrence of bad nodes
2202 int irg_vrfy_bads(ir_graph *irg, int flags) {
2208 irg_walk_graph(irg, check_bads, NULL, &env);
2214 * set the default verify operation
2216 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2219 ops->verify_node = verify_node_##a; \
2276 ops->verify_proj_node = verify_node_Proj_##a; \