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 * File name: ir/ir/irvrfy.c
23 * Purpose: Check irnodes for correctness.
24 * Author: Christian Schaefer
25 * Modified by: Goetz Lindenmaier. Till Riedel. Michael Beck.
28 * Copyright: (c) 1998-2003 Universität Karlsruhe
37 #include "irgraph_t.h"
47 /** if this flag is set, verify entity types in Load & Store nodes */
48 static int vrfy_entities = 0;
50 const char *firm_vrfy_failure_msg;
52 /* enable verification of Load/Store entities */
53 void vrfy_enable_entity_tests(int enable) {
54 vrfy_entities = enable;
58 * little helper for NULL modes
60 static const char *get_mode_name_ex(ir_mode *mode) {
63 return get_mode_name(mode);
66 /** the last IRG, on which a verify error was found */
67 static ir_graph *last_irg_error = NULL;
70 * print the name of the entity of an verification failure
72 static void show_entity_failure(ir_node *node)
74 ir_graph *irg = get_irn_irg(node);
76 if (last_irg_error == irg)
81 if (irg == get_const_code_irg()) {
82 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
85 ir_entity *ent = get_irg_entity(irg);
88 ir_type *ent_type = get_entity_owner(ent);
91 if (ent_type == get_glob_type())
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
94 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
97 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
101 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
107 * Prints a failure for a Node
109 static void show_node_failure(ir_node *n)
111 show_entity_failure(n);
112 fprintf(stderr, " node %ld %s%s\n" ,
114 get_irn_opname(n), get_irn_modename(n)
119 * Prints a failure message for a binop
121 static void show_binop_failure(ir_node *n, const char *text)
123 ir_node *left = get_binop_left(n);
124 ir_node *right = get_binop_right(n);
126 show_entity_failure(n);
127 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
129 get_irn_opname(n), get_irn_modename(n),
130 get_irn_opname(left), get_irn_modename(left),
131 get_irn_opname(right), get_irn_modename(right),
136 * Prints a failure message for an unop
138 static void show_unop_failure(ir_node *n, const char *text)
140 ir_node *op = get_unop_op(n);
142 show_entity_failure(n);
143 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
145 get_irn_opname(n), get_irn_modename(n),
146 get_irn_opname(op), get_irn_modename(op),
151 * Prints a failure message for an op with 3 operands
153 static void show_triop_failure(ir_node *n, const char *text)
155 ir_node *op0 = get_irn_n(n, 0);
156 ir_node *op1 = get_irn_n(n, 1);
157 ir_node *op2 = get_irn_n(n, 2);
159 show_entity_failure(n);
160 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
162 get_irn_opname(n), get_irn_modename(n),
163 get_irn_opname(op0), get_irn_modename(op0),
164 get_irn_opname(op1), get_irn_modename(op1),
165 get_irn_opname(op2), get_irn_modename(op2),
170 * Prints a failure message for a proj
172 static void show_proj_failure(ir_node *n)
174 ir_node *op = get_Proj_pred(n);
175 int proj = get_Proj_proj(n);
177 show_entity_failure(n);
178 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
180 get_irn_opname(n), get_irn_modename(n), proj,
181 get_irn_opname(op), get_irn_modename(op));
185 * Prints a failure message for a proj from Start
187 static void show_proj_mode_failure(ir_node *n, ir_type *ty)
189 long proj = get_Proj_proj(n);
190 ir_mode *m = get_type_mode(ty);
192 show_entity_failure(n);
193 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
198 get_mode_name_ex(m));
202 * Prints a failure message for a proj
204 static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
206 ir_node *op = get_Proj_pred(n);
207 int proj = get_Proj_proj(n);
208 ir_mode *m = get_type_mode(get_entity_type(ent));
210 show_entity_failure(n);
211 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
213 get_irn_opname(n), get_irn_modename(n), proj,
214 get_irn_opname(op), get_irn_modename(op),
215 get_entity_name(ent), get_type_name(get_entity_type(ent)),
216 get_mode_name_ex(m));
220 * Show a node and a graph
222 static void show_node_on_graph(ir_graph *irg, ir_node *n)
224 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
228 * Show call parameters
230 static void show_call_param(ir_node *n, ir_type *mt)
234 show_entity_failure(n);
235 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
236 for (i = 0; i < get_method_n_params(mt); ++i) {
237 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
239 fprintf(stderr, ") != CALL(");
241 for (i = 0; i < get_Call_n_params(n); ++i) {
242 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
244 fprintf(stderr, ")\n");
251 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
253 ir_entity *ent = get_irg_entity(irg);
255 show_entity_failure(n);
256 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
257 get_irn_node_nr(n), get_entity_name(ent),
258 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
259 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
264 * Show return number of results
266 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
268 ir_entity *ent = get_irg_entity(irg);
270 show_entity_failure(n);
271 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
272 get_irn_node_nr(n), get_entity_name(ent),
273 get_Return_n_ress(n), get_method_n_ress(mt));
279 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos)
281 show_entity_failure(phi);
282 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
283 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
284 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
290 static void show_phi_inputs(ir_node *phi, ir_node *block)
292 show_entity_failure(phi);
293 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
294 get_irn_node_nr(phi), get_irn_arity(phi),
295 get_irn_node_nr(block), get_irn_arity(block));
298 /** If the address is Sel or SymConst, return the entity. */
299 static ir_entity *get_ptr_entity(ir_node *ptr) {
300 if (get_irn_op(ptr) == op_Sel) {
301 return get_Sel_entity(ptr);
302 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
303 return get_SymConst_entity(ptr);
309 * verify a Proj(Start) node
311 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
312 ir_mode *mode = get_irn_mode(p);
313 long proj = get_Proj_proj(p);
317 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
318 (proj == pn_Start_M && mode == mode_M) ||
319 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
320 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
321 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
322 (proj == pn_Start_T_args && mode == mode_T) ||
323 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
324 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
326 "wrong Proj from Start", 0,
327 show_proj_failure(p);
333 * verify a Proj(Cond) node
335 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
336 ir_mode *mode = get_irn_mode(p);
337 long proj = get_Proj_proj(p);
341 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
342 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
343 is_Bad(get_Cond_selector(pred)) /* rare */
345 "wrong Proj from Cond", 0,
346 show_proj_failure(p);
352 * verify a Proj(Raise) node
354 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
355 ir_mode *mode = get_irn_mode(p);
356 long proj = get_Proj_proj(p);
359 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
360 "wrong Proj from Raise", 0,
361 show_proj_failure(p);
367 * verify a Proj(InstOf) node
369 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
370 ir_mode *mode = get_irn_mode(p);
371 long proj = get_Proj_proj(p);
374 (proj >= 0 && mode == mode_X),
375 "wrong Proj from InstOf", 0,
376 show_proj_failure(p);
382 * verify a Proj(Call) node
384 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
385 ir_mode *mode = get_irn_mode(p);
386 long proj = get_Proj_proj(p);
389 ((proj == pn_Call_M_regular && mode == mode_M) ||
390 (proj == pn_Call_X_except && mode == mode_X) ||
391 (proj == pn_Call_T_result && mode == mode_T) ||
392 (proj == pn_Call_M_except && mode == mode_M) ||
393 (proj == pn_Call_P_value_res_base && mode == mode_P)),
394 "wrong Proj from Call", 0,
395 show_proj_failure(p);
397 if (proj == pn_Call_X_except)
399 get_irn_op(get_Call_mem(n)) != op_NoMem,
400 "Exception Proj from FunctionCall", 0);
401 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
403 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
404 "Memory Proj from FunctionCall", 0);
409 * verify a Proj(Quot) node
411 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
412 ir_mode *mode = get_irn_mode(p);
413 long proj = get_Proj_proj(p);
416 ((proj == pn_Quot_M && mode == mode_M) ||
417 (proj == pn_Quot_X_except && mode == mode_X) ||
418 (proj == pn_Quot_res && mode_is_float(mode))),
419 "wrong Proj from Quot", 0,
420 show_proj_failure(p);
422 if (proj == pn_Quot_X_except)
424 get_irn_pinned(n) == op_pin_state_pinned,
425 "Exception Proj from unpinned Quot", 0);
426 else if (proj == pn_Quot_M)
428 get_irn_pinned(n) == op_pin_state_pinned,
429 "Memory Proj from unpinned Quot", 0);
434 * verify a Proj(DivMod) node
436 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
437 ir_mode *mode = get_irn_mode(p);
438 long proj = get_Proj_proj(p);
441 ((proj == pn_DivMod_M && mode == mode_M) ||
442 (proj == pn_DivMod_X_except && mode == mode_X) ||
443 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
444 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
445 "wrong Proj from DivMod", 0,
446 show_proj_failure(p);
448 if (proj == pn_DivMod_X_except)
450 get_irn_pinned(n) == op_pin_state_pinned,
451 "Exception Proj from unpinned DivMod", 0);
452 else if (proj == pn_DivMod_M)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Memory Proj from unpinned DivMod", 0);
460 * verify a Proj(Div) node
462 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
463 ir_mode *mode = get_irn_mode(p);
464 long proj = get_Proj_proj(p);
467 ((proj == pn_Div_M && mode == mode_M) ||
468 (proj == pn_Div_X_except && mode == mode_X) ||
469 (proj == pn_Div_res && mode_is_int(mode))),
470 "wrong Proj from Div", 0,
471 show_proj_failure(p);
473 if (proj == pn_Div_X_except)
475 get_irn_pinned(n) == op_pin_state_pinned,
476 "Exception Proj from unpinned Div", 0);
477 else if (proj == pn_Div_M)
479 get_irn_pinned(n) == op_pin_state_pinned,
480 "Memory Proj from unpinned Div", 0);
485 * verify a Proj(Mod) node
487 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
488 ir_mode *mode = get_irn_mode(p);
489 long proj = get_Proj_proj(p);
492 ((proj == pn_Mod_M && mode == mode_M) ||
493 (proj == pn_Mod_X_except && mode == mode_X) ||
494 (proj == pn_Mod_res && mode_is_int(mode))),
495 "wrong Proj from Mod", 0,
496 show_proj_failure(p);
498 if (proj == pn_Mod_X_except)
500 get_irn_pinned(n) == op_pin_state_pinned,
501 "Exception Proj from unpinned Mod", 0);
502 else if (proj == pn_Mod_M)
504 get_irn_pinned(n) == op_pin_state_pinned,
505 "Memory Proj from unpinned Div", 0);
510 * verify a Proj(Cmp) node
512 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
513 ir_mode *mode = get_irn_mode(p);
514 long proj = get_Proj_proj(p);
517 (proj >= 0 && proj <= 15 && mode == mode_b),
518 "wrong Proj from Cmp", 0,
519 show_proj_failure(p);
525 * verify a Proj(Load) node
527 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
528 ir_mode *mode = get_irn_mode(p);
529 long proj = get_Proj_proj(p);
531 if (proj == pn_Load_res) {
532 ir_node *ptr = get_Load_ptr(n);
533 ir_entity *ent = get_ptr_entity(ptr);
535 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
536 /* do NOT check this for lowered phases, see comment on Store */
538 (mode == get_type_mode(get_entity_type(ent))),
539 "wrong data Proj from Load, entity type_mode failed", 0,
540 show_proj_failure_ent(p, ent);
545 mode_is_data(mode) && mode == get_Load_mode(n),
546 "wrong data Proj from Load", 0,
547 show_proj_failure(p);
553 ((proj == pn_Load_M && mode == mode_M) ||
554 (proj == pn_Load_X_except && mode == mode_X)),
555 "wrong Proj from Load", 0,
556 show_proj_failure(p);
559 if (proj == pn_Load_X_except)
561 get_irn_pinned(n) == op_pin_state_pinned,
562 "Exception Proj from unpinned Load", 0);
567 * verify a Proj(Store) node
569 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
570 ir_mode *mode = get_irn_mode(p);
571 long proj = get_Proj_proj(p);
574 ((proj == pn_Store_M && mode == mode_M) ||
575 (proj == pn_Store_X_except && mode == mode_X)),
576 "wrong Proj from Store", 0,
577 show_proj_failure(p);
579 if (proj == pn_Store_X_except)
581 get_irn_pinned(n) == op_pin_state_pinned,
582 "Exception Proj from unpinned Store", 0);
587 * verify a Proj(Alloc) node
589 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
590 ir_mode *mode = get_irn_mode(p);
591 long proj = get_Proj_proj(p);
595 (proj == pn_Alloc_M && mode == mode_M) ||
596 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
597 (proj == pn_Alloc_res && mode_is_reference(mode))
599 "wrong Proj from Alloc", 0,
600 show_proj_failure(p);
606 * verify a Proj(Proj) node
608 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
609 ir_mode *mode = get_irn_mode(p);
610 long proj = get_Proj_proj(p);
611 long nr = get_Proj_proj(pred);
612 ir_type *mt; /* A method type */
614 pred = skip_Id(get_Proj_pred(pred));
615 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
617 switch (get_irn_opcode(pred)) {
619 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
621 if (nr == pn_Start_T_args) {
623 (proj >= 0 && mode_is_data(mode)),
624 "wrong Proj from Proj from Start", 0);
626 (proj < get_method_n_params(mt)),
627 "More Projs for args than args in type", 0
629 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
630 /* value argument */ break;
633 (mode == get_type_mode(get_method_param_type(mt, proj))),
634 "Mode of Proj from Start doesn't match mode of param type.", 0,
635 show_proj_mode_failure(p, get_method_param_type(mt, proj));
638 else if (nr == pn_Start_P_value_arg_base) {
640 (proj >= 0 && mode_is_reference(mode)),
641 "wrong Proj from Proj from Start", 0
644 (proj < get_method_n_params(mt)),
645 "More Projs for args than args in type", 0
653 (proj >= 0 && mode_is_data(mode)),
654 "wrong Proj from Proj from Call", 0);
655 mt = get_Call_type(pred);
657 (proj < get_method_n_ress(mt)),
658 "More Projs for results than results in type.", 0);
659 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
660 /* value result */ break;
663 (mode == get_type_mode(get_method_res_type(mt, proj))),
664 "Mode of Proj from Call doesn't match mode of result type.", 0);
673 /* hmm, optimization did not remove it */
677 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
684 * verify a Proj(Tuple) node
686 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
692 * verify a Proj(CallBegin) node
694 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
699 * verify a Proj(EndReg) node
701 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
702 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
703 "EndReg may only appear if ip view is constructed.", 0);
708 * verify a Proj(EndExcept) node
710 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
711 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
712 "EndExcept may only appear if ip view is constructed.", 0);
717 * verify a Proj(CopyB) node
719 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
720 ir_mode *mode = get_irn_mode(p);
721 long proj = get_Proj_proj(p);
724 ((proj == pn_CopyB_M_regular && mode == mode_M) ||
725 (proj == pn_CopyB_X_except && mode == mode_X) ||
726 (proj == pn_CopyB_M_except && mode == mode_M)),
727 "wrong Proj from CopyB", 0,
728 show_proj_failure(p);
730 if (proj == pn_CopyB_X_except)
732 get_irn_pinned(n) == op_pin_state_pinned,
733 "Exception Proj from unpinned CopyB", 0);
738 * verify a Proj(Bound) node
740 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
741 ir_mode *mode = get_irn_mode(p);
742 long proj = get_Proj_proj(p);
744 /* ignore Bound checks of Bad */
745 if (is_Bad(get_Bound_index(n)))
748 ((proj == pn_Bound_M && mode == mode_M) ||
749 (proj == pn_Bound_X_except && mode == mode_X) ||
750 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))),
751 "wrong Proj from Bound", 0,
752 show_proj_failure(p);
754 if (proj == pn_Bound_X_except)
756 get_irn_pinned(n) == op_pin_state_pinned,
757 "Exception Proj from unpinned Bound", 0);
765 verify_node_Proj(ir_node *p, ir_graph *irg) {
769 pred = skip_Id(get_Proj_pred(p));
770 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
772 op = get_irn_op(pred);
774 if (op->ops.verify_proj_node)
775 return op->ops.verify_proj_node(pred, p);
782 * verify a Block node
784 static int verify_node_Block(ir_node *n, ir_graph *irg) {
787 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
788 ir_node *pred = get_Block_cfgpred(n, i);
792 (get_irn_mode(pred) == mode_X)
796 /* End block may only have Return, Raise or fragile ops as preds. */
797 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
798 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
799 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
800 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
801 break; /* We can not test properly. How many tuples are there? */
802 ASSERT_AND_RET((is_Return(pred) ||
804 (get_irn_op(pred) == op_Raise) ||
805 is_fragile_op(pred) ),
806 "End Block node", 0);
808 /* irg attr must == graph we are in. */
809 if (! get_interprocedural_view()) {
810 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
816 * verify a Start node
818 static int verify_node_Start(ir_node *n, ir_graph *irg) {
819 ir_mode *mymode = get_irn_mode(n);
822 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
823 mymode == mode_T, "Start node", 0
831 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
832 ir_mode *mymode = get_irn_mode(n);
836 mymode == mode_X, "Jmp node", 0
842 * verify an IJmp node
844 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
845 ir_mode *mymode = get_irn_mode(n);
846 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
849 /* IJmp: BB x ref --> X */
850 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
856 * verify a Break node
858 static int verify_node_Break(ir_node *n, ir_graph *irg) {
859 ir_mode *mymode = get_irn_mode(n);
861 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
862 "Break may only appear if ip view is constructed.", 0);
865 mymode == mode_X, "Break node", 0
873 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
874 ir_mode *mymode = get_irn_mode(n);
875 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
878 /* Cond: BB x b --> X x X */
879 (op1mode == mode_b ||
880 /* Cond: BB x int --> X^n */
881 mode_is_int(op1mode) ), "Cond node", 0
883 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
889 * verify a Return node
891 static int verify_node_Return(ir_node *n, ir_graph *irg) {
893 ir_mode *mymode = get_irn_mode(n);
894 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
897 /* Return: BB x M x data1 x ... x datan --> X */
899 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
901 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
902 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
904 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
905 /* Compare returned results with result types of method type */
906 mt = get_entity_type(get_irg_entity(irg));
907 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
908 "Number of results for Return doesn't match number of results in type.", 0,
909 show_return_nres(irg, n, mt););
910 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
911 ir_type *res_type = get_method_res_type(mt, i);
913 if (is_atomic_type(res_type)) {
915 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
916 "Mode of result for Return doesn't match mode of result type.", 0,
917 show_return_modes(irg, n, mt, i);
922 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
923 "Mode of result for Return doesn't match mode of result type.", 0,
924 show_return_modes(irg, n, mt, i);
932 * verify a Raise node
934 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
935 ir_mode *mymode = get_irn_mode(n);
936 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
937 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
940 /* Sel: BB x M x ref --> X x M */
941 op1mode == mode_M && mode_is_reference(op2mode) &&
942 mymode == mode_T, "Raise node", 0
948 * verify a Const node
950 static int verify_node_Const(ir_node *n, ir_graph *irg) {
951 ir_mode *mymode = get_irn_mode(n);
954 /* Const: BB --> data */
955 (mode_is_data(mymode) ||
956 mymode == mode_b) /* we want boolean constants for static evaluation */
957 ,"Const node", 0 /* of Cmp. */
960 /* the modes of the constant and teh tarval must match */
961 mymode == get_tarval_mode(get_Const_tarval(n)),
962 "Const node, tarval and node mode mismatch", 0
968 * verify a SymConst node
970 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
971 ir_mode *mymode = get_irn_mode(n);
973 if (get_SymConst_kind(n) == symconst_addr_ent) {
974 ir_entity *ent = get_SymConst_entity(n);
975 if (is_Method_type(get_entity_type(ent)) &&
976 get_irn_irg(n) != get_const_code_irg()) {
978 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
979 "A constant must address an existing method.", 0);
984 /* SymConst: BB --> int*/
985 (mode_is_int(mymode) ||
986 /* SymConst: BB --> ref */
987 mode_is_reference(mymode))
988 ,"SymConst node", 0);
995 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
997 ir_mode *mymode = get_irn_mode(n);
998 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
999 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1003 /* Sel: BB x M x ref x int^n --> ref */
1004 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1005 "Sel node", 0, show_node_failure(n)
1008 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1009 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1011 ent = get_Sel_entity(n);
1012 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1017 * verify an InstOf node
1019 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1020 ir_mode *mymode = get_irn_mode(n);
1021 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1023 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1024 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1029 * verify a Call node
1031 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1032 ir_mode *mymode = get_irn_mode(n);
1033 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1034 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1038 /* Call: BB x M x ref x data1 x ... x datan
1039 --> M x datan+1 x ... x data n+m */
1040 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1042 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1044 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
1045 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1046 "Call node with wrong memory input", 0 );
1048 mt = get_Call_type(n);
1049 if(get_unknown_type() == mt) {
1053 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1054 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1057 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1058 /* Compare arguments of node with those of type */
1060 if (get_method_variadicity(mt) == variadicity_variadic) {
1062 get_Call_n_params(n) >= get_method_n_params(mt),
1063 "Number of args for Call doesn't match number of args in variadic type.",
1065 fprintf(stderr, "Call has %d params, method %s type %d\n",
1066 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1071 get_Call_n_params(n) == get_method_n_params(mt),
1072 "Number of args for Call doesn't match number of args in non variadic type.",
1076 for (i = 0; i < get_method_n_params(mt); i++) {
1077 ir_type *t = get_method_param_type(mt, i);
1079 if (is_atomic_type(t)) {
1081 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1082 "Mode of arg for Call doesn't match mode of arg type.", 0,
1083 show_call_param(n, mt);
1087 /* call with a compound type, mode must be reference */
1089 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1090 "Mode of arg for Call doesn't match mode of arg type.", 0,
1091 show_call_param(n, mt);
1097 if (Call_has_callees(n)) {
1098 for (i = 0; i < get_Call_n_callees(n); i++) {
1099 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1107 * verify an Add node
1109 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1110 ir_mode *mymode = get_irn_mode(n);
1111 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1112 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1116 /* common Add: BB x numP x numP --> numP */
1117 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1118 /* Pointer Add: BB x ref x int --> ref */
1119 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1120 /* Pointer Add: BB x int x ref --> ref */
1121 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1124 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1125 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1126 "/* Pointer Add: BB x int x ref --> ref */");
1134 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1135 ir_mode *mymode = get_irn_mode(n);
1136 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1137 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1140 /* common Sub: BB x numP x numP --> numP */
1141 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1142 /* Pointer Sub: BB x ref x int --> ref */
1143 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1144 /* Pointer Sub: BB x int x ref --> ref */
1145 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1146 /* Pointer Sub: BB x ref x ref --> int */
1147 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1149 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1150 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1151 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1152 "/* Pointer Sub: BB x ref x ref --> int */" );
1158 * verify a Minus node
1160 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1161 ir_mode *mymode = get_irn_mode(n);
1162 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1165 /* Minus: BB x num --> num */
1166 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1167 show_unop_failure(n , "/* Minus: BB x num --> num */");
1175 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1176 ir_mode *mymode = get_irn_mode(n);
1177 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1178 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1181 /* Mul: BB x int1 x int1 --> int2 */
1182 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1183 /* Mul: BB x float x float --> float */
1184 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1186 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1187 "/* Mul: BB x float x float --> float */");
1193 * verify a Quot node
1195 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1196 ir_mode *mymode = get_irn_mode(n);
1197 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1198 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1199 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1202 /* Quot: BB x M x float x float --> M x X x float */
1203 op1mode == mode_M && op2mode == op3mode &&
1204 get_mode_sort(op2mode) == irms_float_number &&
1207 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1213 * verify a DivMod node
1215 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1216 ir_mode *mymode = get_irn_mode(n);
1217 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1218 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1219 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1222 /* DivMod: BB x M x int x int --> M x X x int x int */
1223 op1mode == mode_M &&
1224 mode_is_int(op2mode) &&
1225 op3mode == op2mode &&
1235 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1236 ir_mode *mymode = get_irn_mode(n);
1237 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1238 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1239 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1242 /* Div: BB x M x int x int --> M x X x int */
1243 op1mode == mode_M &&
1244 op2mode == op3mode &&
1245 mode_is_int(op2mode) &&
1255 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1256 ir_mode *mymode = get_irn_mode(n);
1257 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1258 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1259 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1262 /* Mod: BB x M x int x int --> M x X x int */
1263 op1mode == mode_M &&
1264 op2mode == op3mode &&
1265 mode_is_int(op2mode) &&
1273 * verify an Abs node
1275 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1276 ir_mode *mymode = get_irn_mode(n);
1277 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1280 /* Abs: BB x num --> num */
1281 op1mode == mymode &&
1282 mode_is_num (op1mode),
1284 show_unop_failure(n, "/* Abs: BB x num --> num */");
1290 * verify a logical And, Or, Eor node
1292 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1293 ir_mode *mymode = get_irn_mode(n);
1294 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1295 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1298 /* And or Or or Eor: BB x int x int --> int */
1299 (mode_is_int(mymode) || mymode == mode_b) &&
1300 op2mode == op1mode &&
1302 "And, Or or Eor node", 0,
1303 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1308 #define verify_node_And verify_node_Logic
1309 #define verify_node_Or verify_node_Logic
1310 #define verify_node_Eor verify_node_Logic
1315 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1316 ir_mode *mymode = get_irn_mode(n);
1317 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1320 /* Not: BB x int --> int */
1321 mode_is_int(mymode) &&
1324 show_unop_failure(n, "/* Not: BB x int --> int */");
1332 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1333 ir_mode *mymode = get_irn_mode(n);
1334 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1335 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1338 /* Cmp: BB x datab x datab --> b16 */
1339 mode_is_data (op1mode) &&
1340 op2mode == op1mode &&
1343 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1349 * verify a Shift node
1351 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1352 ir_mode *mymode = get_irn_mode(n);
1353 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1354 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1357 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1358 mode_is_int(op1mode) &&
1359 mode_is_int(op2mode) &&
1360 !mode_is_signed(op2mode) &&
1362 "Shl, Shr or Shrs node", 0,
1363 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1368 #define verify_node_Shl verify_node_Shift
1369 #define verify_node_Shr verify_node_Shift
1370 #define verify_node_Shrs verify_node_Shift
1375 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1376 ir_mode *mymode = get_irn_mode(n);
1377 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1378 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1381 /* Rot: BB x int x int --> int */
1382 mode_is_int(op1mode) &&
1383 mode_is_int(op2mode) &&
1386 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1392 * verify a Conv node
1394 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1395 ir_mode *mymode = get_irn_mode(n);
1396 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1399 /* Conv: BB x datab1 --> datab2 */
1400 mode_is_datab(op1mode) && mode_is_data(mymode),
1402 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1408 * verify a Cast node
1410 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1411 ir_mode *mymode = get_irn_mode(n);
1412 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1415 /* Conv: BB x datab1 --> datab2 */
1416 mode_is_data(op1mode) && op1mode == mymode,
1418 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1426 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1427 ir_mode *mymode = get_irn_mode(n);
1428 ir_node *block = get_nodes_block(n);
1431 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1432 /* a Phi node MUST have the same number of inputs as its block */
1434 get_irn_arity(n) == get_irn_arity(block),
1435 "wrong number of inputs in Phi node", 0,
1436 show_phi_inputs(n, block);
1440 /* Phi: BB x dataM^n --> dataM */
1441 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1442 ir_node *pred = get_irn_n(n, i);
1443 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1445 get_irn_mode(pred) == mymode,
1447 show_phi_failure(n, pred, i);
1450 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1452 if (mymode == mode_M) {
1453 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1455 ir_node *pred_i = get_Phi_pred(n, i);
1459 for (j = i - 1; j >= 0; --j) {
1460 ir_node *pred_j = get_Phi_pred(n, j);
1465 /* currently this checks fails for blocks with exception
1466 outputs (and these are NOT basic blocks). So it is disabled yet. */
1468 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1469 "At least two different PhiM predecessors are in the same block",
1471 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1481 * verify a Filter node
1483 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1484 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1485 "Filter may only appear if ip view is constructed.", 0);
1486 /* We should further do tests as for Proj and Phi. */
1491 * verify a Load node
1493 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1494 ir_mode *mymode = get_irn_mode(n);
1495 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1496 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1498 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1499 if(get_irg_phase_state(irg) != phase_backend) {
1500 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1502 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1503 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1505 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1508 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1509 * (Proj (Proj))) sometimes ...
1511 * interprete.c:ai_eval seems to assume that this happens, too
1513 * obset.c:get_abstval_any can't deal with this if the load has
1517 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1518 assert ((NULL != ent) || (mymode != mode_T));
1526 * verify a Store node
1528 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1531 ir_mode *mymode = get_irn_mode(n);
1532 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1533 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1534 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1536 ASSERT_AND_RET(op1mode == mode_M && mode_is_data(op3mode), "Store node", 0 );
1537 if(get_irg_phase_state(irg) != phase_backend) {
1538 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1540 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1541 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1543 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1545 target = get_ptr_entity(get_Store_ptr(n));
1546 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1548 * If lowered code, any Sels that add 0 may be removed, causing
1549 * an direct access to entities of array or compound type.
1550 * Prevent this by checking the phase.
1552 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1560 * verify an Alloc node
1562 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1563 ir_mode *mymode = get_irn_mode(n);
1564 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1565 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1568 /* Alloc: BB x M x int_u --> M x X x ref */
1569 op1mode == mode_M &&
1570 mode_is_int(op2mode) &&
1571 !mode_is_signed(op2mode) &&
1574 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1580 * verify a Free node
1582 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1583 ir_mode *mymode = get_irn_mode(n);
1584 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1585 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1586 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1589 /* Free: BB x M x ref x int_u --> M */
1590 op1mode == mode_M && mode_is_reference(op2mode) &&
1591 mode_is_int(op3mode) &&
1592 !mode_is_signed(op3mode) &&
1595 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1601 * verify a Sync node
1603 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1605 ir_mode *mymode = get_irn_mode(n);
1607 /* Sync: BB x M^n --> M */
1608 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1609 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1611 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1616 * verify a Confirm node
1618 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1619 ir_mode *mymode = get_irn_mode(n);
1620 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1621 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1624 /* Confirm: BB x T x T --> T */
1625 op1mode == mymode &&
1628 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1636 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1637 ir_mode *mymode = get_irn_mode(n);
1638 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1639 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1640 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1643 /* Mux: BB x b x numP x numP --> numP */
1644 op1mode == mode_b &&
1645 op2mode == mymode &&
1646 op3mode == mymode &&
1647 mode_is_numP(mymode),
1654 * verify a CopyB node
1656 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1657 ir_mode *mymode = get_irn_mode(n);
1658 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1659 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1660 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1661 ir_type *t = get_CopyB_type(n);
1663 /* CopyB: BB x M x ref x ref --> M x X */
1664 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1665 if(get_irg_phase_state(irg) != phase_backend) {
1666 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1669 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1670 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1671 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1672 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1676 is_compound_type(t),
1677 "CopyB node should copy compound types only", 0 );
1679 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1680 This should happen RARELY, as CopyB COPIES MEMORY */
1682 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1683 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1684 "CopyB node with wrong memory input", 0 );
1689 * verify a Bound node
1691 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1692 ir_mode *mymode = get_irn_mode(n);
1693 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1694 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1695 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1696 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1698 /* Bound: BB x M x ref x ref --> M x X */
1701 op1mode == mode_M &&
1702 op2mode == op3mode &&
1703 op3mode == op4mode &&
1704 mode_is_int(op3mode),
1705 "Bound node", 0 ); /* operand M x int x int x int */
1707 /* NoMem nodes are only allowed as memory input if the Bound is NOT pinned.
1708 This should happen RARELY, as Bound COPIES MEMORY */
1710 (get_irn_op(get_Bound_mem(n)) == op_NoMem) ||
1711 (get_irn_op(get_Bound_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1712 "Bound node with wrong memory input", 0 );
1718 * For each usage of a node, it is checked, if the block of the
1719 * node dominates the block of the usage (for phis: the predecessor
1720 * block of the phi for the corresponding edge).
1722 * @return non-zero on success, 0 on dominance error
1724 static int check_dominance_for_node(ir_node *use)
1726 /* This won't work for blocks and the end node */
1727 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1729 ir_node *bl = get_nodes_block(use);
1731 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1732 ir_node *def = get_irn_n(use, i);
1733 ir_node *def_bl = get_nodes_block(def);
1734 ir_node *use_bl = bl;
1736 /* ignore dead definition blocks, will be removed */
1737 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1741 use_bl = get_Block_cfgpred_block(bl, i);
1743 /* ignore dead use blocks, will be removed */
1744 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1748 block_dominates(def_bl, use_bl),
1749 "the definition of a value used violates the dominance property", 0,
1751 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1752 current_ir_graph, def_bl, def, use_bl, use, i
1760 /* Tests the modes of n and its predecessors. */
1761 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1766 if (!get_node_verification_mode())
1769 if (!get_interprocedural_view()) {
1771 * do NOT check placement in interprocedural view, as we don't always know
1772 * the "right" graph ...
1775 node_is_in_irgs_storage(irg, n),
1776 "Node is not stored on proper IR graph!", 0,
1777 show_node_on_graph(irg, n);
1779 assert(get_irn_irg(n) == irg);
1781 unsigned idx = get_irn_idx(n);
1782 ir_node *node_from_map = get_idx_irn(irg, idx);
1783 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));
1789 /* We don't want to test nodes whose predecessors are Bad,
1790 as we would have to special case that for each operation. */
1791 if (op != op_Phi && op != op_Block)
1792 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1793 if (is_Bad(get_irn_n(n, i)))
1797 if (op->ops.verify_node)
1798 return op->ops.verify_node(n, irg);
1804 int irn_vrfy(ir_node *n)
1807 #ifdef DEBUG_libfirm
1808 res = irn_vrfy_irg(n, current_ir_graph);
1813 /*-----------------------------------------------------------------*/
1814 /* Verify the whole graph. */
1815 /*-----------------------------------------------------------------*/
1817 #ifdef DEBUG_libfirm
1819 * Walker to check every node
1821 static void vrfy_wrap(ir_node *node, void *env) {
1823 *res = irn_vrfy(node);
1827 * Walker to check every node including SSA property.
1828 * Only called if dominance info is available.
1830 static void vrfy_wrap_ssa(ir_node *node, void *env)
1834 *res = irn_vrfy(node);
1836 *res = check_dominance_for_node(node);
1839 #endif /* DEBUG_libfirm */
1842 * Calls irn_vrfy for each node in irg.
1843 * Graph must be in state "op_pin_state_pinned".
1844 * If dominance info is available, check the SSA property.
1846 int irg_verify(ir_graph *irg, unsigned flags)
1849 #ifdef DEBUG_libfirm
1852 rem = current_ir_graph;
1853 current_ir_graph = irg;
1854 last_irg_error = NULL;
1856 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1858 if (flags & VRFY_ENFORCE_SSA)
1863 get_irg_dom_state(irg) == dom_consistent &&
1864 get_irg_pinned(irg) == op_pin_state_pinned ?
1865 vrfy_wrap_ssa : vrfy_wrap,
1869 current_ir_graph = rem;
1871 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1872 ir_entity *ent = get_irg_entity(current_ir_graph);
1875 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1877 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1879 #endif /* DEBUG_libfirm */
1884 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1887 firm_verification_t old = get_node_verification_mode();
1889 firm_vrfy_failure_msg = NULL;
1890 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1891 res = irn_vrfy_irg(n, irg);
1892 if (res && get_irg_dom_state(irg) == dom_consistent &&
1893 get_irg_pinned(irg) == op_pin_state_pinned)
1894 res = check_dominance_for_node(n);
1895 do_node_verification(old);
1896 *bad_string = firm_vrfy_failure_msg;
1902 typedef struct _vrfy_bad_env_t {
1908 * Pre-Walker: check Bad predecessors of node.
1910 static void check_bads(ir_node *node, void *env)
1912 vrfy_bad_env_t *venv = env;
1913 int i, arity = get_irn_arity(node);
1915 if (is_Block(node)) {
1916 if ((venv->flags & BAD_CF) == 0) {
1918 /* check for Bad Block predecessor */
1919 for (i = 0; i < arity; ++i) {
1920 ir_node *pred = get_irn_n(node, i);
1923 venv->res |= BAD_CF;
1925 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1926 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1928 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1929 dump_ir_block_graph(current_ir_graph, "-assert");
1930 assert(0 && "Bad CF detected");
1937 if ((venv->flags & BAD_BLOCK) == 0) {
1939 /* check for Bad Block */
1940 if (is_Bad(get_nodes_block(node))) {
1941 venv->res |= BAD_BLOCK;
1943 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1944 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1946 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1947 dump_ir_block_graph(current_ir_graph, "-assert");
1948 assert(0 && "Bad CF detected");
1953 if ((venv->flags & TUPLE) == 0) {
1954 if (get_irn_op(node) == op_Tuple) {
1957 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1958 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1960 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1961 dump_ir_block_graph(current_ir_graph, "-assert");
1962 assert(0 && "Tuple detected");
1967 for (i = 0; i < arity; ++i) {
1968 ir_node *pred = get_irn_n(node, i);
1971 /* check for Phi with Bad inputs */
1972 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1973 if (venv->flags & BAD_CF)
1976 venv->res |= BAD_CF;
1978 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1979 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1981 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1982 dump_ir_block_graph(current_ir_graph, "-assert");
1983 assert(0 && "Bad CF detected");
1988 /* Bad node input */
1989 if ((venv->flags & BAD_DF) == 0) {
1990 venv->res |= BAD_DF;
1992 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1993 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1995 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1996 dump_ir_block_graph(current_ir_graph, "-assert");
1997 assert(0 && "Bad NON-CF detected");
2006 * verify occurrence of bad nodes
2008 int irg_vrfy_bads(ir_graph *irg, int flags)
2015 irg_walk_graph(irg, check_bads, NULL, &env);
2021 * set the default verify operation
2023 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2027 ops->verify_node = verify_node_##a; \
2083 ops->verify_proj_node = verify_node_Proj_##a; \