2 * Copyright (C) 1995-2007 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;
53 * little helper for NULL modes
55 static const char *get_mode_name_ex(ir_mode *mode) {
58 return get_mode_name(mode);
61 /** the last IRG, on which a verify error was found */
62 static ir_graph *last_irg_error = NULL;
65 * print the name of the entity of an verification failure
67 static void show_entity_failure(ir_node *node)
69 ir_graph *irg = get_irn_irg(node);
71 if (last_irg_error == irg)
76 if (irg == get_const_code_irg()) {
77 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));
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
96 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
102 * Prints a failure for a Node
104 static void show_node_failure(ir_node *n)
106 show_entity_failure(n);
107 fprintf(stderr, " node %ld %s%s\n" ,
109 get_irn_opname(n), get_irn_modename(n)
114 * Prints a failure message for a binop
116 static void show_binop_failure(ir_node *n, const char *text)
118 ir_node *left = get_binop_left(n);
119 ir_node *right = get_binop_right(n);
121 show_entity_failure(n);
122 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
124 get_irn_opname(n), get_irn_modename(n),
125 get_irn_opname(left), get_irn_modename(left),
126 get_irn_opname(right), get_irn_modename(right),
131 * Prints a failure message for an unop
133 static void show_unop_failure(ir_node *n, const char *text)
135 ir_node *op = get_unop_op(n);
137 show_entity_failure(n);
138 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
140 get_irn_opname(n), get_irn_modename(n),
141 get_irn_opname(op), get_irn_modename(op),
146 * Prints a failure message for an op with 3 operands
148 static void show_triop_failure(ir_node *n, const char *text)
150 ir_node *op0 = get_irn_n(n, 0);
151 ir_node *op1 = get_irn_n(n, 1);
152 ir_node *op2 = get_irn_n(n, 2);
154 show_entity_failure(n);
155 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
157 get_irn_opname(n), get_irn_modename(n),
158 get_irn_opname(op0), get_irn_modename(op0),
159 get_irn_opname(op1), get_irn_modename(op1),
160 get_irn_opname(op2), get_irn_modename(op2),
165 * Prints a failure message for a proj
167 static void show_proj_failure(ir_node *n)
169 ir_node *op = get_Proj_pred(n);
170 int proj = get_Proj_proj(n);
172 show_entity_failure(n);
173 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
175 get_irn_opname(n), get_irn_modename(n), proj,
176 get_irn_opname(op), get_irn_modename(op));
180 * Prints a failure message for a proj from Start
182 static void show_proj_mode_failure(ir_node *n, ir_type *ty)
184 long proj = get_Proj_proj(n);
185 ir_mode *m = get_type_mode(ty);
187 show_entity_failure(n);
188 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
193 get_mode_name_ex(m));
197 * Prints a failure message for a proj
199 static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
201 ir_node *op = get_Proj_pred(n);
202 int proj = get_Proj_proj(n);
203 ir_mode *m = get_type_mode(get_entity_type(ent));
205 show_entity_failure(n);
206 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
208 get_irn_opname(n), get_irn_modename(n), proj,
209 get_irn_opname(op), get_irn_modename(op),
210 get_entity_name(ent), get_type_name(get_entity_type(ent)),
211 get_mode_name_ex(m));
215 * Show a node and a graph
217 static void show_node_on_graph(ir_graph *irg, ir_node *n)
219 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
223 * Show call parameters
225 static void show_call_param(ir_node *n, ir_type *mt)
229 show_entity_failure(n);
230 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
231 for (i = 0; i < get_method_n_params(mt); ++i) {
232 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
234 fprintf(stderr, ") != CALL(");
236 for (i = 0; i < get_Call_n_params(n); ++i) {
237 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
239 fprintf(stderr, ")\n");
246 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
248 ir_entity *ent = get_irg_entity(irg);
250 show_entity_failure(n);
251 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
252 get_irn_node_nr(n), get_entity_name(ent),
253 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
254 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
259 * Show return number of results
261 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
263 ir_entity *ent = get_irg_entity(irg);
265 show_entity_failure(n);
266 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
267 get_irn_node_nr(n), get_entity_name(ent),
268 get_Return_n_ress(n), get_method_n_ress(mt));
274 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
276 show_entity_failure(phi);
277 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
278 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
279 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
285 static void show_phi_inputs(ir_node *phi, ir_node *block)
287 show_entity_failure(phi);
288 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
289 get_irn_node_nr(phi), get_irn_arity(phi),
290 get_irn_node_nr(block), get_irn_arity(block));
293 /** If the address is Sel or SymConst, return the entity. */
294 static ir_entity *get_ptr_entity(ir_node *ptr) {
295 if (get_irn_op(ptr) == op_Sel) {
296 return get_Sel_entity(ptr);
297 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
298 return get_SymConst_entity(ptr);
304 * verify a Proj(Start) node
306 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
307 ir_mode *mode = get_irn_mode(p);
308 long proj = get_Proj_proj(p);
312 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
313 (proj == pn_Start_M && mode == mode_M) ||
314 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
315 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
316 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
317 (proj == pn_Start_T_args && mode == mode_T) ||
318 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
319 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
321 "wrong Proj from Start", 0,
322 show_proj_failure(p);
328 * verify a Proj(Cond) node
330 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
331 ir_mode *mode = get_irn_mode(p);
332 long proj = get_Proj_proj(p);
336 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
337 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
338 is_Bad(get_Cond_selector(pred)) /* rare */
340 "wrong Proj from Cond", 0,
341 show_proj_failure(p);
347 * verify a Proj(Raise) node
349 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
350 ir_mode *mode = get_irn_mode(p);
351 long proj = get_Proj_proj(p);
354 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
355 "wrong Proj from Raise", 0,
356 show_proj_failure(p);
362 * verify a Proj(InstOf) node
364 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
365 ir_mode *mode = get_irn_mode(p);
366 long proj = get_Proj_proj(p);
369 (proj >= 0 && mode == mode_X),
370 "wrong Proj from InstOf", 0,
371 show_proj_failure(p);
377 * verify a Proj(Call) node
379 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
380 ir_mode *mode = get_irn_mode(p);
381 long proj = get_Proj_proj(p);
384 ((proj == pn_Call_M_regular && mode == mode_M) ||
385 (proj == pn_Call_X_except && mode == mode_X) ||
386 (proj == pn_Call_T_result && mode == mode_T) ||
387 (proj == pn_Call_M_except && mode == mode_M) ||
388 (proj == pn_Call_P_value_res_base && mode == mode_P)),
389 "wrong Proj from Call", 0,
390 show_proj_failure(p);
392 if (proj == pn_Call_X_except)
394 get_irn_op(get_Call_mem(n)) != op_NoMem,
395 "Exception Proj from FunctionCall", 0);
396 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
398 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
399 "Memory Proj from FunctionCall", 0);
404 * verify a Proj(Quot) node
406 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
407 ir_mode *mode = get_irn_mode(p);
408 long proj = get_Proj_proj(p);
411 ((proj == pn_Quot_M && mode == mode_M) ||
412 (proj == pn_Quot_X_except && mode == mode_X) ||
413 (proj == pn_Quot_res && mode_is_float(mode))),
414 "wrong Proj from Quot", 0,
415 show_proj_failure(p);
417 if (proj == pn_Quot_X_except)
419 get_irn_pinned(n) == op_pin_state_pinned,
420 "Exception Proj from unpinned Quot", 0);
421 else if (proj == pn_Quot_M)
423 get_irn_pinned(n) == op_pin_state_pinned,
424 "Memory Proj from unpinned Quot", 0);
429 * verify a Proj(DivMod) node
431 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
432 ir_mode *mode = get_irn_mode(p);
433 long proj = get_Proj_proj(p);
436 ((proj == pn_DivMod_M && mode == mode_M) ||
437 (proj == pn_DivMod_X_except && mode == mode_X) ||
438 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
439 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
440 "wrong Proj from DivMod", 0,
441 show_proj_failure(p);
443 if (proj == pn_DivMod_X_except)
445 get_irn_pinned(n) == op_pin_state_pinned,
446 "Exception Proj from unpinned DivMod", 0);
447 else if (proj == pn_DivMod_M)
449 get_irn_pinned(n) == op_pin_state_pinned,
450 "Memory Proj from unpinned DivMod", 0);
455 * verify a Proj(Div) node
457 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
458 ir_mode *mode = get_irn_mode(p);
459 long proj = get_Proj_proj(p);
462 ((proj == pn_Div_M && mode == mode_M) ||
463 (proj == pn_Div_X_except && mode == mode_X) ||
464 (proj == pn_Div_res && mode_is_int(mode))),
465 "wrong Proj from Div", 0,
466 show_proj_failure(p);
468 if (proj == pn_Div_X_except)
470 get_irn_pinned(n) == op_pin_state_pinned,
471 "Exception Proj from unpinned Div", 0);
472 else if (proj == pn_Div_M)
474 get_irn_pinned(n) == op_pin_state_pinned,
475 "Memory Proj from unpinned Div", 0);
480 * verify a Proj(Mod) node
482 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
483 ir_mode *mode = get_irn_mode(p);
484 long proj = get_Proj_proj(p);
487 ((proj == pn_Mod_M && mode == mode_M) ||
488 (proj == pn_Mod_X_except && mode == mode_X) ||
489 (proj == pn_Mod_res && mode_is_int(mode))),
490 "wrong Proj from Mod", 0,
491 show_proj_failure(p);
493 if (proj == pn_Mod_X_except)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Exception Proj from unpinned Mod", 0);
497 else if (proj == pn_Mod_M)
499 get_irn_pinned(n) == op_pin_state_pinned,
500 "Memory Proj from unpinned Div", 0);
505 * verify a Proj(Cmp) node
507 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
508 ir_mode *mode = get_irn_mode(p);
509 long proj = get_Proj_proj(p);
512 (proj >= 0 && proj <= 15 && mode == mode_b),
513 "wrong Proj from Cmp", 0,
514 show_proj_failure(p);
520 * verify a Proj(Load) node
522 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
523 ir_mode *mode = get_irn_mode(p);
524 long proj = get_Proj_proj(p);
526 if (proj == pn_Load_res) {
527 ir_node *ptr = get_Load_ptr(n);
528 ir_entity *ent = get_ptr_entity(ptr);
530 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
531 /* do NOT check this for lowered phases, see comment on Store */
533 (mode == get_type_mode(get_entity_type(ent))),
534 "wrong data Proj from Load, entity type_mode failed", 0,
535 show_proj_failure_ent(p, ent);
540 mode_is_data(mode) && mode == get_Load_mode(n),
541 "wrong data Proj from Load", 0,
542 show_proj_failure(p);
548 ((proj == pn_Load_M && mode == mode_M) ||
549 (proj == pn_Load_X_except && mode == mode_X)),
550 "wrong Proj from Load", 0,
551 show_proj_failure(p);
554 if (proj == pn_Load_X_except)
556 get_irn_pinned(n) == op_pin_state_pinned,
557 "Exception Proj from unpinned Load", 0);
562 * verify a Proj(Store) node
564 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
565 ir_mode *mode = get_irn_mode(p);
566 long proj = get_Proj_proj(p);
569 ((proj == pn_Store_M && mode == mode_M) ||
570 (proj == pn_Store_X_except && mode == mode_X)),
571 "wrong Proj from Store", 0,
572 show_proj_failure(p);
574 if (proj == pn_Store_X_except)
576 get_irn_pinned(n) == op_pin_state_pinned,
577 "Exception Proj from unpinned Store", 0);
582 * verify a Proj(Alloc) node
584 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
585 ir_mode *mode = get_irn_mode(p);
586 long proj = get_Proj_proj(p);
590 (proj == pn_Alloc_M && mode == mode_M) ||
591 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
592 (proj == pn_Alloc_res && mode_is_reference(mode))
594 "wrong Proj from Alloc", 0,
595 show_proj_failure(p);
601 * verify a Proj(Proj) node
603 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
604 ir_mode *mode = get_irn_mode(p);
605 long proj = get_Proj_proj(p);
606 long nr = get_Proj_proj(pred);
607 ir_type *mt; /* A method type */
609 pred = skip_Id(get_Proj_pred(pred));
610 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
612 switch (get_irn_opcode(pred)) {
614 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
616 if (nr == pn_Start_T_args) {
618 (proj >= 0 && mode_is_data(mode)),
619 "wrong Proj from Proj from Start", 0);
621 (proj < get_method_n_params(mt)),
622 "More Projs for args than args in type", 0
624 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
625 /* value argument */ break;
628 (mode == get_type_mode(get_method_param_type(mt, proj))),
629 "Mode of Proj from Start doesn't match mode of param type.", 0,
630 show_proj_mode_failure(p, get_method_param_type(mt, proj));
633 else if (nr == pn_Start_P_value_arg_base) {
635 (proj >= 0 && mode_is_reference(mode)),
636 "wrong Proj from Proj from Start", 0
639 (proj < get_method_n_params(mt)),
640 "More Projs for args than args in type", 0
648 (proj >= 0 && mode_is_data(mode)),
649 "wrong Proj from Proj from Call", 0);
650 mt = get_Call_type(pred);
652 (proj < get_method_n_ress(mt)),
653 "More Projs for results than results in type.", 0);
654 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
655 /* value result */ break;
658 (mode == get_type_mode(get_method_res_type(mt, proj))),
659 "Mode of Proj from Call doesn't match mode of result type.", 0);
668 /* hmm, optimization did not remove it */
672 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
679 * verify a Proj(Tuple) node
681 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
687 * verify a Proj(CallBegin) node
689 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
694 * verify a Proj(EndReg) node
696 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
697 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
698 "EndReg may only appear if ip view is constructed.", 0);
703 * verify a Proj(EndExcept) node
705 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
706 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
707 "EndExcept may only appear if ip view is constructed.", 0);
712 * verify a Proj(CopyB) node
714 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
715 ir_mode *mode = get_irn_mode(p);
716 long proj = get_Proj_proj(p);
719 ((proj == pn_CopyB_M_regular && mode == mode_M) ||
720 (proj == pn_CopyB_X_except && mode == mode_X) ||
721 (proj == pn_CopyB_M_except && mode == mode_M)),
722 "wrong Proj from CopyB", 0,
723 show_proj_failure(p);
725 if (proj == pn_CopyB_X_except)
727 get_irn_pinned(n) == op_pin_state_pinned,
728 "Exception Proj from unpinned CopyB", 0);
733 * verify a Proj(Bound) node
735 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
736 ir_mode *mode = get_irn_mode(p);
737 long proj = get_Proj_proj(p);
739 /* ignore Bound checks of Bad */
740 if (is_Bad(get_Bound_index(n)))
743 ((proj == pn_Bound_M && mode == mode_M) ||
744 (proj == pn_Bound_X_except && mode == mode_X) ||
745 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))),
746 "wrong Proj from Bound", 0,
747 show_proj_failure(p);
749 if (proj == pn_Bound_X_except)
751 get_irn_pinned(n) == op_pin_state_pinned,
752 "Exception Proj from unpinned Bound", 0);
760 verify_node_Proj(ir_node *p, ir_graph *irg) {
764 pred = skip_Id(get_Proj_pred(p));
765 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
767 op = get_irn_op(pred);
769 if (op->ops.verify_proj_node)
770 return op->ops.verify_proj_node(pred, p);
777 * verify a Block node
779 static int verify_node_Block(ir_node *n, ir_graph *irg) {
782 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
783 ir_node *pred = get_Block_cfgpred(n, i);
787 (get_irn_mode(pred) == mode_X)
791 /* End block may only have Return, Raise or fragile ops as preds. */
792 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
793 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
794 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
795 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
796 break; /* We can not test properly. How many tuples are there? */
797 ASSERT_AND_RET((is_Return(pred) ||
799 (get_irn_op(pred) == op_Raise) ||
800 is_fragile_op(pred) ),
801 "End Block node", 0);
803 /* irg attr must == graph we are in. */
804 if (! get_interprocedural_view()) {
805 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
811 * verify a Start node
813 static int verify_node_Start(ir_node *n, ir_graph *irg) {
814 ir_mode *mymode = get_irn_mode(n);
817 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
818 mymode == mode_T, "Start node", 0
826 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
827 ir_mode *mymode = get_irn_mode(n);
831 mymode == mode_X, "Jmp node", 0
837 * verify an IJmp node
839 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
840 ir_mode *mymode = get_irn_mode(n);
841 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
844 /* IJmp: BB x ref --> X */
845 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
851 * verify a Break node
853 static int verify_node_Break(ir_node *n, ir_graph *irg) {
854 ir_mode *mymode = get_irn_mode(n);
856 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
857 "Break may only appear if ip view is constructed.", 0);
860 mymode == mode_X, "Break node", 0
868 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
869 ir_mode *mymode = get_irn_mode(n);
870 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
873 /* Cond: BB x b --> X x X */
874 (op1mode == mode_b ||
875 /* Cond: BB x int --> X^n */
876 mode_is_int(op1mode) ), "Cond node", 0
878 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
884 * verify a Return node
886 static int verify_node_Return(ir_node *n, ir_graph *irg) {
888 ir_mode *mymode = get_irn_mode(n);
889 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
892 /* Return: BB x M x data1 x ... x datan --> X */
894 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
896 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
897 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
899 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
900 /* Compare returned results with result types of method type */
901 mt = get_entity_type(get_irg_entity(irg));
902 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
903 "Number of results for Return doesn't match number of results in type.", 0,
904 show_return_nres(irg, n, mt););
905 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
906 ir_type *res_type = get_method_res_type(mt, i);
908 if (is_atomic_type(res_type)) {
910 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
911 "Mode of result for Return doesn't match mode of result type.", 0,
912 show_return_modes(irg, n, mt, i);
917 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
918 "Mode of result for Return doesn't match mode of result type.", 0,
919 show_return_modes(irg, n, mt, i);
927 * verify a Raise node
929 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
930 ir_mode *mymode = get_irn_mode(n);
931 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
932 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
935 /* Sel: BB x M x ref --> X x M */
936 op1mode == mode_M && mode_is_reference(op2mode) &&
937 mymode == mode_T, "Raise node", 0
943 * verify a Const node
945 static int verify_node_Const(ir_node *n, ir_graph *irg) {
946 ir_mode *mymode = get_irn_mode(n);
949 /* Const: BB --> data */
950 (mode_is_data(mymode) ||
951 mymode == mode_b) /* we want boolean constants for static evaluation */
952 ,"Const node", 0 /* of Cmp. */
955 /* the modes of the constant and teh tarval must match */
956 mymode == get_tarval_mode(get_Const_tarval(n)),
957 "Const node, tarval and node mode mismatch", 0
963 * verify a SymConst node
965 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
966 ir_mode *mymode = get_irn_mode(n);
968 if (get_SymConst_kind(n) == symconst_addr_ent) {
969 ir_entity *ent = get_SymConst_entity(n);
970 if (is_Method_type(get_entity_type(ent)) &&
971 get_irn_irg(n) != get_const_code_irg()) {
973 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
974 "A constant must address an existing method.", 0);
979 /* SymConst: BB --> int*/
980 (mode_is_int(mymode) ||
981 /* SymConst: BB --> ref */
982 mode_is_reference(mymode))
983 ,"SymConst node", 0);
990 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
992 ir_mode *mymode = get_irn_mode(n);
993 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
994 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
998 /* Sel: BB x M x ref x int^n --> ref */
999 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1000 "Sel node", 0, show_node_failure(n)
1003 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1004 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1006 ent = get_Sel_entity(n);
1007 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1012 * verify an InstOf node
1014 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1015 ir_mode *mymode = get_irn_mode(n);
1016 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1018 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1019 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1024 * verify a Call node
1026 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1027 ir_mode *mymode = get_irn_mode(n);
1028 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1029 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1033 /* Call: BB x M x ref x data1 x ... x datan
1034 --> M x datan+1 x ... x data n+m */
1035 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1037 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1039 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
1040 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1041 "Call node with wrong memory input", 0 );
1043 mt = get_Call_type(n);
1044 if(get_unknown_type() == mt) {
1048 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1049 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1052 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1053 /* Compare arguments of node with those of type */
1055 if (get_method_variadicity(mt) == variadicity_variadic) {
1057 get_Call_n_params(n) >= get_method_n_params(mt),
1058 "Number of args for Call doesn't match number of args in variadic type.",
1060 fprintf(stderr, "Call has %d params, method %s type %d\n",
1061 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1066 get_Call_n_params(n) == get_method_n_params(mt),
1067 "Number of args for Call doesn't match number of args in non variadic type.",
1071 for (i = 0; i < get_method_n_params(mt); i++) {
1072 ir_type *t = get_method_param_type(mt, i);
1074 if (is_atomic_type(t)) {
1076 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1077 "Mode of arg for Call doesn't match mode of arg type.", 0,
1078 show_call_param(n, mt);
1082 /* call with a compound type, mode must be reference */
1084 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1085 "Mode of arg for Call doesn't match mode of arg type.", 0,
1086 show_call_param(n, mt);
1092 if (Call_has_callees(n)) {
1093 for (i = 0; i < get_Call_n_callees(n); i++) {
1094 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1102 * verify an Add node
1104 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1105 ir_mode *mymode = get_irn_mode(n);
1106 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1107 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1111 /* common Add: BB x numP x numP --> numP */
1112 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1113 /* Pointer Add: BB x ref x int --> ref */
1114 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1115 /* Pointer Add: BB x int x ref --> ref */
1116 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1119 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1120 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1121 "/* Pointer Add: BB x int x ref --> ref */");
1129 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1130 ir_mode *mymode = get_irn_mode(n);
1131 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1132 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1135 /* common Sub: BB x numP x numP --> numP */
1136 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1137 /* Pointer Sub: BB x ref x int --> ref */
1138 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1139 /* Pointer Sub: BB x int x ref --> ref */
1140 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1141 /* Pointer Sub: BB x ref x ref --> int */
1142 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1144 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1145 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1146 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1147 "/* Pointer Sub: BB x ref x ref --> int */" );
1153 * verify a Minus node
1155 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1156 ir_mode *mymode = get_irn_mode(n);
1157 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1160 /* Minus: BB x num --> num */
1161 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1162 show_unop_failure(n , "/* Minus: BB x num --> num */");
1170 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1171 ir_mode *mymode = get_irn_mode(n);
1172 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1173 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1176 /* Mul: BB x int1 x int1 --> int2 */
1177 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1178 /* Mul: BB x float x float --> float */
1179 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1181 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1182 "/* Mul: BB x float x float --> float */");
1188 * verify a Quot node
1190 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1191 ir_mode *mymode = get_irn_mode(n);
1192 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1193 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1194 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1197 /* Quot: BB x M x float x float --> M x X x float */
1198 op1mode == mode_M && op2mode == op3mode &&
1199 get_mode_sort(op2mode) == irms_float_number &&
1202 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1208 * verify a DivMod node
1210 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1211 ir_mode *mymode = get_irn_mode(n);
1212 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1213 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1214 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1217 /* DivMod: BB x M x int x int --> M x X x int x int */
1218 op1mode == mode_M &&
1219 mode_is_int(op2mode) &&
1220 op3mode == op2mode &&
1230 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1231 ir_mode *mymode = get_irn_mode(n);
1232 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1233 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1234 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1237 /* Div: BB x M x int x int --> M x X x int */
1238 op1mode == mode_M &&
1239 op2mode == op3mode &&
1240 mode_is_int(op2mode) &&
1250 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1251 ir_mode *mymode = get_irn_mode(n);
1252 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1253 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1254 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1257 /* Mod: BB x M x int x int --> M x X x int */
1258 op1mode == mode_M &&
1259 op2mode == op3mode &&
1260 mode_is_int(op2mode) &&
1268 * verify an Abs node
1270 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1271 ir_mode *mymode = get_irn_mode(n);
1272 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1275 /* Abs: BB x num --> num */
1276 op1mode == mymode &&
1277 mode_is_num (op1mode),
1279 show_unop_failure(n, "/* Abs: BB x num --> num */");
1285 * verify a logical And, Or, Eor node
1287 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1288 ir_mode *mymode = get_irn_mode(n);
1289 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1290 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1293 /* And or Or or Eor: BB x int x int --> int */
1294 (mode_is_int(mymode) || mymode == mode_b) &&
1295 op2mode == op1mode &&
1297 "And, Or or Eor node", 0,
1298 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1303 #define verify_node_And verify_node_Logic
1304 #define verify_node_Or verify_node_Logic
1305 #define verify_node_Eor verify_node_Logic
1310 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1311 ir_mode *mymode = get_irn_mode(n);
1312 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1315 /* Not: BB x int --> int */
1316 mode_is_int(mymode) &&
1319 show_unop_failure(n, "/* Not: BB x int --> int */");
1327 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1328 ir_mode *mymode = get_irn_mode(n);
1329 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1330 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1333 /* Cmp: BB x datab x datab --> b16 */
1334 mode_is_data (op1mode) &&
1335 op2mode == op1mode &&
1338 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1344 * verify a Shift node
1346 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1347 ir_mode *mymode = get_irn_mode(n);
1348 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1349 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1352 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1353 mode_is_int(op1mode) &&
1354 mode_is_int(op2mode) &&
1355 !mode_is_signed(op2mode) &&
1357 "Shl, Shr or Shrs node", 0,
1358 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1363 #define verify_node_Shl verify_node_Shift
1364 #define verify_node_Shr verify_node_Shift
1365 #define verify_node_Shrs verify_node_Shift
1370 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1371 ir_mode *mymode = get_irn_mode(n);
1372 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1373 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1376 /* Rot: BB x int x int --> int */
1377 mode_is_int(op1mode) &&
1378 mode_is_int(op2mode) &&
1381 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1387 * verify a Conv node
1389 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1390 ir_mode *mymode = get_irn_mode(n);
1391 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1394 /* Conv: BB x datab1 --> datab2 */
1395 mode_is_datab(op1mode) && mode_is_data(mymode),
1397 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1403 * verify a Cast node
1405 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1406 ir_mode *mymode = get_irn_mode(n);
1407 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1410 /* Conv: BB x datab1 --> datab2 */
1411 mode_is_data(op1mode) && op1mode == mymode,
1413 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1421 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1422 ir_mode *mymode = get_irn_mode(n);
1423 ir_node *block = get_nodes_block(n);
1426 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1427 /* a Phi node MUST have the same number of inputs as its block */
1429 get_irn_arity(n) == get_irn_arity(block),
1430 "wrong number of inputs in Phi node", 0,
1431 show_phi_inputs(n, block);
1435 /* Phi: BB x dataM^n --> dataM */
1436 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1437 ir_node *pred = get_irn_n(n, i);
1438 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1440 get_irn_mode(pred) == mymode,
1442 show_phi_failure(n, pred, i);
1445 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1447 if (mymode == mode_M) {
1448 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1450 ir_node *pred_i = get_Phi_pred(n, i);
1454 for (j = i - 1; j >= 0; --j) {
1455 ir_node *pred_j = get_Phi_pred(n, j);
1460 /* currently this checks fails for blocks with exception
1461 outputs (and these are NOT basic blocks). So it is disabled yet. */
1463 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1464 "At least two different PhiM predecessors are in the same block",
1466 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1476 * verify a Filter node
1478 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1479 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1480 "Filter may only appear if ip view is constructed.", 0);
1481 /* We should further do tests as for Proj and Phi. */
1486 * verify a Load node
1488 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1489 ir_mode *mymode = get_irn_mode(n);
1490 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1491 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1493 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1494 if(get_irg_phase_state(irg) != phase_backend) {
1495 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1497 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1498 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1500 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1503 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1504 * (Proj (Proj))) sometimes ...
1506 * interprete.c:ai_eval seems to assume that this happens, too
1508 * obset.c:get_abstval_any can't deal with this if the load has
1512 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1513 assert ((NULL != ent) || (mymode != mode_T));
1521 * verify a Store node
1523 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1526 ir_mode *mymode = get_irn_mode(n);
1527 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1528 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1529 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1531 ASSERT_AND_RET(op1mode == mode_M && mode_is_data(op3mode), "Store node", 0 );
1532 if(get_irg_phase_state(irg) != phase_backend) {
1533 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1535 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1536 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1538 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1540 target = get_ptr_entity(get_Store_ptr(n));
1541 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1543 * If lowered code, any Sels that add 0 may be removed, causing
1544 * an direct access to entities of array or compound type.
1545 * Prevent this by checking the phase.
1547 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1555 * verify an Alloc node
1557 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1558 ir_mode *mymode = get_irn_mode(n);
1559 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1560 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1563 /* Alloc: BB x M x int_u --> M x X x ref */
1564 op1mode == mode_M &&
1565 mode_is_int(op2mode) &&
1566 !mode_is_signed(op2mode) &&
1569 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1575 * verify a Free node
1577 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1578 ir_mode *mymode = get_irn_mode(n);
1579 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1580 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1581 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1584 /* Free: BB x M x ref x int_u --> M */
1585 op1mode == mode_M && mode_is_reference(op2mode) &&
1586 mode_is_int(op3mode) &&
1587 !mode_is_signed(op3mode) &&
1590 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1596 * verify a Sync node
1598 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1600 ir_mode *mymode = get_irn_mode(n);
1602 /* Sync: BB x M^n --> M */
1603 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1604 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1606 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1611 * verify a Confirm node
1613 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1614 ir_mode *mymode = get_irn_mode(n);
1615 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1616 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1619 /* Confirm: BB x T x T --> T */
1620 op1mode == mymode &&
1623 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1631 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1632 ir_mode *mymode = get_irn_mode(n);
1633 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1634 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1635 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1638 /* Mux: BB x b x numP x numP --> numP */
1639 op1mode == mode_b &&
1640 op2mode == mymode &&
1641 op3mode == mymode &&
1642 mode_is_numP(mymode),
1649 * verify a CopyB node
1651 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1652 ir_mode *mymode = get_irn_mode(n);
1653 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1654 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1655 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1656 ir_type *t = get_CopyB_type(n);
1658 /* CopyB: BB x M x ref x ref --> M x X */
1659 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1660 if(get_irg_phase_state(irg) != phase_backend) {
1661 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1664 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1665 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1666 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1667 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1671 is_compound_type(t),
1672 "CopyB node should copy compound types only", 0 );
1674 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1675 This should happen RARELY, as CopyB COPIES MEMORY */
1677 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1678 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1679 "CopyB node with wrong memory input", 0 );
1684 * verify a Bound node
1686 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1687 ir_mode *mymode = get_irn_mode(n);
1688 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1689 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1690 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1691 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1693 /* Bound: BB x M x ref x ref --> M x X */
1696 op1mode == mode_M &&
1697 op2mode == op3mode &&
1698 op3mode == op4mode &&
1699 mode_is_int(op3mode),
1700 "Bound node", 0 ); /* operand M x int x int x int */
1702 /* NoMem nodes are only allowed as memory input if the Bound is NOT pinned.
1703 This should happen RARELY, as Bound COPIES MEMORY */
1705 (get_irn_op(get_Bound_mem(n)) == op_NoMem) ||
1706 (get_irn_op(get_Bound_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1707 "Bound node with wrong memory input", 0 );
1713 * For each usage of a node, it is checked, if the block of the
1714 * node dominates the block of the usage (for phis: the predecessor
1715 * block of the phi for the corresponding edge).
1717 * @return non-zero on success, 0 on dominance error
1719 static int check_dominance_for_node(ir_node *use)
1721 /* This won't work for blocks and the end node */
1722 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1724 ir_node *bl = get_nodes_block(use);
1726 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1727 ir_node *def = get_irn_n(use, i);
1728 ir_node *def_bl = get_nodes_block(def);
1729 ir_node *use_bl = bl;
1731 /* ignore dead definition blocks, will be removed */
1732 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1736 use_bl = get_Block_cfgpred_block(bl, i);
1738 /* ignore dead use blocks, will be removed */
1739 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1743 block_dominates(def_bl, use_bl),
1744 "the definition of a value used violates the dominance property", 0,
1746 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1747 current_ir_graph, def_bl, def, use_bl, use, i
1755 /* Tests the modes of n and its predecessors. */
1756 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1761 if (!get_node_verification_mode())
1764 if (!get_interprocedural_view()) {
1766 * do NOT check placement in interprocedural view, as we don't always know
1767 * the "right" graph ...
1770 node_is_in_irgs_storage(irg, n),
1771 "Node is not stored on proper IR graph!", 0,
1772 show_node_on_graph(irg, n);
1774 assert(get_irn_irg(n) == irg);
1776 unsigned idx = get_irn_idx(n);
1777 ir_node *node_from_map = get_idx_irn(irg, idx);
1778 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));
1784 /* We don't want to test nodes whose predecessors are Bad,
1785 as we would have to special case that for each operation. */
1786 if (op != op_Phi && op != op_Block)
1787 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1788 if (is_Bad(get_irn_n(n, i)))
1792 if (op->ops.verify_node)
1793 return op->ops.verify_node(n, irg);
1799 int irn_vrfy(ir_node *n)
1802 #ifdef DEBUG_libfirm
1803 res = irn_vrfy_irg(n, current_ir_graph);
1808 /*-----------------------------------------------------------------*/
1809 /* Verify the whole graph. */
1810 /*-----------------------------------------------------------------*/
1812 #ifdef DEBUG_libfirm
1814 * Walker to check every node
1816 static void vrfy_wrap(ir_node *node, void *env) {
1818 *res = irn_vrfy(node);
1822 * Walker to check every node including SSA property.
1823 * Only called if dominance info is available.
1825 static void vrfy_wrap_ssa(ir_node *node, void *env)
1829 *res = irn_vrfy(node);
1831 *res = check_dominance_for_node(node);
1834 #endif /* DEBUG_libfirm */
1837 * Calls irn_vrfy for each node in irg.
1838 * Graph must be in state "op_pin_state_pinned".
1839 * If dominance info is available, check the SSA property.
1841 int irg_verify(ir_graph *irg, unsigned flags)
1844 #ifdef DEBUG_libfirm
1847 rem = current_ir_graph;
1848 current_ir_graph = irg;
1849 last_irg_error = NULL;
1851 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1853 if (flags & VRFY_ENFORCE_SSA)
1858 get_irg_dom_state(irg) == dom_consistent &&
1859 get_irg_pinned(irg) == op_pin_state_pinned ?
1860 vrfy_wrap_ssa : vrfy_wrap,
1864 current_ir_graph = rem;
1866 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1867 ir_entity *ent = get_irg_entity(current_ir_graph);
1870 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1872 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1874 #endif /* DEBUG_libfirm */
1879 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1882 firm_verification_t old = get_node_verification_mode();
1884 firm_vrfy_failure_msg = NULL;
1885 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1886 res = irn_vrfy_irg(n, irg);
1887 if (res && get_irg_dom_state(irg) == dom_consistent &&
1888 get_irg_pinned(irg) == op_pin_state_pinned)
1889 res = check_dominance_for_node(n);
1890 do_node_verification(old);
1891 *bad_string = firm_vrfy_failure_msg;
1897 typedef struct _vrfy_bad_env_t {
1903 * Pre-Walker: check Bad predecessors of node.
1905 static void check_bads(ir_node *node, void *env)
1907 vrfy_bad_env_t *venv = env;
1908 int i, arity = get_irn_arity(node);
1910 if (is_Block(node)) {
1911 if ((venv->flags & BAD_CF) == 0) {
1913 /* check for Bad Block predecessor */
1914 for (i = 0; i < arity; ++i) {
1915 ir_node *pred = get_irn_n(node, i);
1918 venv->res |= BAD_CF;
1920 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1921 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1923 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1924 dump_ir_block_graph(current_ir_graph, "-assert");
1925 assert(0 && "Bad CF detected");
1932 if ((venv->flags & BAD_BLOCK) == 0) {
1934 /* check for Bad Block */
1935 if (is_Bad(get_nodes_block(node))) {
1936 venv->res |= BAD_BLOCK;
1938 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1939 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1941 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1942 dump_ir_block_graph(current_ir_graph, "-assert");
1943 assert(0 && "Bad CF detected");
1948 if ((venv->flags & TUPLE) == 0) {
1949 if (get_irn_op(node) == op_Tuple) {
1952 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1953 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1955 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1956 dump_ir_block_graph(current_ir_graph, "-assert");
1957 assert(0 && "Tuple detected");
1962 for (i = 0; i < arity; ++i) {
1963 ir_node *pred = get_irn_n(node, i);
1966 /* check for Phi with Bad inputs */
1967 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1968 if (venv->flags & BAD_CF)
1971 venv->res |= BAD_CF;
1973 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1974 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1976 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1977 dump_ir_block_graph(current_ir_graph, "-assert");
1978 assert(0 && "Bad CF detected");
1983 /* Bad node input */
1984 if ((venv->flags & BAD_DF) == 0) {
1985 venv->res |= BAD_DF;
1987 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1988 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1990 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1991 dump_ir_block_graph(current_ir_graph, "-assert");
1992 assert(0 && "Bad NON-CF detected");
2001 * verify occurrence of bad nodes
2003 int irg_vrfy_bads(ir_graph *irg, int flags)
2010 irg_walk_graph(irg, check_bads, NULL, &env);
2016 * set the default verify operation
2018 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2022 ops->verify_node = verify_node_##a; \
2078 ops->verify_proj_node = verify_node_Proj_##a; \