2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
30 #include "irgraph_t.h"
41 /** if this flag is set, verify entity types in Load & Store nodes */
42 static int vrfy_entities = 0;
44 const char *firm_vrfy_failure_msg;
46 /* enable verification of Load/Store entities */
47 void vrfy_enable_entity_tests(int enable)
49 vrfy_entities = enable;
55 * little helper for NULL modes
57 static const char *get_mode_name_ex(ir_mode *mode)
61 return get_mode_name(mode);
64 /** the last IRG, on which a verification error was found */
65 static ir_graph *last_irg_error = NULL;
68 * print the name of the entity of an verification failure
70 * @param node the node caused the 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");
84 ir_entity *ent = get_irg_entity(irg);
87 ir_type *ent_type = get_entity_owner(ent);
90 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() %+F::%s failed\n",
91 ent_type, get_entity_name(ent));
93 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 ir_print_type(type_name, sizeof(type_name), ty);
189 show_entity_failure(n);
190 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
195 get_mode_name_ex(m));
199 * Prints a failure message for a proj
201 static void show_proj_failure_ent(ir_node *n, ir_entity *ent)
203 ir_node *op = get_Proj_pred(n);
204 int proj = get_Proj_proj(n);
205 ir_mode *m = get_type_mode(get_entity_type(ent));
207 ir_print_type(type_name, sizeof(type_name), get_entity_type(ent));
209 show_entity_failure(n);
210 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
212 get_irn_opname(n), get_irn_modename(n), proj,
213 get_irn_opname(op), get_irn_modename(op),
214 get_entity_name(ent), type_name,
215 get_mode_name_ex(m));
219 * Show a node and a graph
221 static void show_node_on_graph(ir_graph *irg, ir_node *n)
223 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
227 * Show call parameters
229 static void show_call_param(ir_node *n, ir_type *mt)
233 ir_print_type(type_name, sizeof(type_name), mt);
235 show_entity_failure(n);
236 fprintf(stderr, " Call type-check failed: %s(", type_name);
237 for (i = 0; i < get_method_n_params(mt); ++i) {
238 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
240 fprintf(stderr, ") != CALL(");
242 for (i = 0; i < get_Call_n_params(n); ++i) {
243 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
245 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)
282 show_entity_failure(phi);
283 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
284 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
285 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
291 static void show_phi_inputs(ir_node *phi, ir_node *block)
293 show_entity_failure(phi);
294 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
295 get_irn_node_nr(phi), get_irn_arity(phi),
296 get_irn_node_nr(block), get_irn_arity(block));
299 #endif /* #ifndef NDEBUG */
302 * If the address is Sel or SymConst, return the entity.
304 * @param ptr the node representing the address
306 static ir_entity *get_ptr_entity(ir_node *ptr)
309 return get_Sel_entity(ptr);
310 } else if (is_SymConst_addr_ent(ptr)) {
311 return get_SymConst_entity(ptr);
317 * verify a Proj(Start) node
319 static int verify_node_Proj_Start(ir_node *n, ir_node *p)
321 ir_mode *mode = get_irn_mode(p);
322 long proj = get_Proj_proj(p);
327 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
328 (proj == pn_Start_M && mode == mode_M) ||
329 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
330 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
331 (proj == pn_Start_T_args && mode == mode_T)
333 "wrong Proj from Start", 0,
334 show_proj_failure(p);
340 * verify a Proj(Cond) node
342 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p)
344 ir_mode *mode = get_irn_mode(p);
345 long proj = get_Proj_proj(p);
349 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
350 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
351 is_Bad(get_Cond_selector(pred)) /* rare */
353 "wrong Proj from Cond", 0,
354 show_proj_failure(p);
360 * verify a Proj(Raise) node
362 static int verify_node_Proj_Raise(ir_node *n, ir_node *p)
364 ir_mode *mode = get_irn_mode(p);
365 long proj = get_Proj_proj(p);
369 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
370 "wrong Proj from Raise", 0,
371 show_proj_failure(p);
377 * verify a Proj(InstOf) node
379 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p)
381 ir_mode *mode = get_irn_mode(p);
382 long proj = get_Proj_proj(p);
387 (proj == pn_InstOf_M && mode == mode_M) ||
388 (proj == pn_InstOf_X_regular && mode == mode_X) ||
389 (proj == pn_InstOf_X_except && mode == mode_X) ||
390 (proj == pn_InstOf_res && mode_is_reference(mode))
392 "wrong Proj from InstOf", 0,
393 show_proj_failure(p);
399 * verify a Proj(Call) node
401 static int verify_node_Proj_Call(ir_node *n, ir_node *p)
403 ir_mode *mode = get_irn_mode(p);
404 long proj = get_Proj_proj(p);
408 (proj == pn_Call_M && mode == mode_M) ||
409 (proj == pn_Call_X_regular && mode == mode_X) ||
410 (proj == pn_Call_X_except && mode == mode_X) ||
411 (proj == pn_Call_T_result && mode == mode_T) ||
412 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
414 "wrong Proj from Call", 0,
415 show_proj_failure(p);
417 /* if we have exception flow, we must have a real Memory input */
418 if (proj == pn_Call_X_regular)
420 !is_NoMem(get_Call_mem(n)),
421 "Regular Proj from FunctionCall", 0);
422 else if (proj == pn_Call_X_except)
424 !is_NoMem(get_Call_mem(n)),
425 "Exception Proj from FunctionCall", 0);
426 else if (proj == pn_Call_M)
428 (!is_NoMem(get_Call_mem(n)) || 1),
429 "Memory Proj from FunctionCall", 0);
434 * verify a Proj(Quot) node
436 static int verify_node_Proj_Quot(ir_node *n, ir_node *p)
438 ir_mode *mode = get_irn_mode(p);
439 long proj = get_Proj_proj(p);
443 (proj == pn_Quot_M && mode == mode_M) ||
444 (proj == pn_Quot_X_regular && mode == mode_X) ||
445 (proj == pn_Quot_X_except && mode == mode_X) ||
446 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
448 "wrong Proj from Quot", 0,
449 show_proj_failure(p);
451 if (proj == pn_Quot_X_regular)
453 get_irn_pinned(n) == op_pin_state_pinned,
454 "Regular Proj from unpinned Quot", 0);
455 else if (proj == pn_Quot_X_except)
457 get_irn_pinned(n) == op_pin_state_pinned,
458 "Exception Proj from unpinned Quot", 0);
459 else if (proj == pn_Quot_M)
461 get_irn_pinned(n) == op_pin_state_pinned,
462 "Memory Proj from unpinned Quot", 0);
467 * verify a Proj(DivMod) node
469 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p)
471 ir_mode *mode = get_irn_mode(p);
472 long proj = get_Proj_proj(p);
476 (proj == pn_DivMod_M && mode == mode_M) ||
477 (proj == pn_DivMod_X_regular && mode == mode_X) ||
478 (proj == pn_DivMod_X_except && mode == mode_X) ||
479 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
480 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
482 "wrong Proj from DivMod", 0,
483 show_proj_failure(p);
485 if (proj == pn_DivMod_X_regular)
487 get_irn_pinned(n) == op_pin_state_pinned,
488 "Regular Proj from unpinned DivMod", 0);
489 else if (proj == pn_DivMod_X_except)
491 get_irn_pinned(n) == op_pin_state_pinned,
492 "Exception Proj from unpinned DivMod", 0);
493 else if (proj == pn_DivMod_M)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Memory Proj from unpinned DivMod", 0);
501 * verify a Proj(Div) node
503 static int verify_node_Proj_Div(ir_node *n, ir_node *p)
505 ir_mode *mode = get_irn_mode(p);
506 long proj = get_Proj_proj(p);
510 (proj == pn_Div_M && mode == mode_M) ||
511 (proj == pn_Div_X_regular && mode == mode_X) ||
512 (proj == pn_Div_X_except && mode == mode_X) ||
513 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
515 "wrong Proj from Div", 0,
516 show_proj_failure(p);
518 if (proj == pn_Div_X_regular)
520 get_irn_pinned(n) == op_pin_state_pinned,
521 "Regular Proj from unpinned Div", 0);
522 else if (proj == pn_Div_X_except)
524 get_irn_pinned(n) == op_pin_state_pinned,
525 "Exception Proj from unpinned Div", 0);
526 else if (proj == pn_Div_M)
528 get_irn_pinned(n) == op_pin_state_pinned,
529 "Memory Proj from unpinned Div", 0);
534 * verify a Proj(Mod) node
536 static int verify_node_Proj_Mod(ir_node *n, ir_node *p)
538 ir_mode *mode = get_irn_mode(p);
539 long proj = get_Proj_proj(p);
543 (proj == pn_Mod_M && mode == mode_M) ||
544 (proj == pn_Mod_X_regular && mode == mode_X) ||
545 (proj == pn_Mod_X_except && mode == mode_X) ||
546 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
548 "wrong Proj from Mod", 0,
549 show_proj_failure(p);
551 if (proj == pn_Mod_X_regular)
553 get_irn_pinned(n) == op_pin_state_pinned,
554 "Regular Proj from unpinned Mod", 0);
555 else if (proj == pn_Mod_X_except)
557 get_irn_pinned(n) == op_pin_state_pinned,
558 "Exception Proj from unpinned Mod", 0);
559 else if (proj == pn_Mod_M)
561 get_irn_pinned(n) == op_pin_state_pinned,
562 "Memory Proj from unpinned Div", 0);
567 * verify a Proj(Cmp) node
569 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p)
571 ir_mode *mode = get_irn_mode(p);
572 long proj = get_Proj_proj(p);
576 (proj >= 0 && proj <= 15 && mode == mode_b),
577 "wrong Proj from Cmp", 0,
578 show_proj_failure(p);
581 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
582 "unordered Proj for non-float Cmp", 0,
583 show_proj_failure(p);
589 * verify a Proj(Load) node
591 static int verify_node_Proj_Load(ir_node *n, ir_node *p)
593 ir_mode *mode = get_irn_mode(p);
594 long proj = get_Proj_proj(p);
596 if (proj == pn_Load_res) {
597 ir_node *ptr = get_Load_ptr(n);
598 ir_entity *ent = get_ptr_entity(ptr);
600 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
601 /* do NOT check this for lowered phases, see comment on Store */
603 (mode == get_type_mode(get_entity_type(ent))),
604 "wrong data Proj from Load, entity type_mode failed", 0,
605 show_proj_failure_ent(p, ent);
610 mode_is_data(mode) && mode == get_Load_mode(n),
611 "wrong data Proj from Load", 0,
612 show_proj_failure(p);
619 (proj == pn_Load_M && mode == mode_M) ||
620 (proj == pn_Load_X_regular && mode == mode_X) ||
621 (proj == pn_Load_X_except && mode == mode_X)
623 "wrong Proj from Load", 0,
624 show_proj_failure(p);
627 if (proj == pn_Load_X_regular) {
629 get_irn_pinned(n) == op_pin_state_pinned,
630 "Regular Proj from unpinned Load", 0);
631 } else if (proj == pn_Load_X_except) {
633 get_irn_pinned(n) == op_pin_state_pinned,
634 "Exception Proj from unpinned Load", 0);
640 * verify a Proj(Store) node
642 static int verify_node_Proj_Store(ir_node *n, ir_node *p)
644 ir_mode *mode = get_irn_mode(p);
645 long proj = get_Proj_proj(p);
649 (proj == pn_Store_M && mode == mode_M) ||
650 (proj == pn_Store_X_regular && mode == mode_X) ||
651 (proj == pn_Store_X_except && mode == mode_X)
653 "wrong Proj from Store", 0,
654 show_proj_failure(p);
656 if (proj == pn_Store_X_regular) {
658 get_irn_pinned(n) == op_pin_state_pinned,
659 "Regular Proj from unpinned Store", 0);
660 } else if (proj == pn_Store_X_except) {
662 get_irn_pinned(n) == op_pin_state_pinned,
663 "Exception Proj from unpinned Store", 0);
669 * verify a Proj(Alloc) node
671 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p)
673 ir_mode *mode = get_irn_mode(p);
674 long proj = get_Proj_proj(p);
679 (proj == pn_Alloc_M && mode == mode_M) ||
680 (proj == pn_Alloc_X_regular && mode == mode_X) ||
681 (proj == pn_Alloc_X_except && mode == mode_X) ||
682 (proj == pn_Alloc_res && mode_is_reference(mode))
684 "wrong Proj from Alloc", 0,
685 show_proj_failure(p);
691 * verify a Proj(Proj) node
693 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p)
695 ir_mode *mode = get_irn_mode(p);
696 long proj = get_Proj_proj(p);
697 long nr = get_Proj_proj(pred);
698 ir_type *mt; /* A method type */
700 pred = skip_Id(get_Proj_pred(pred));
701 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
703 switch (get_irn_opcode(pred)) {
705 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
707 if (nr == pn_Start_T_args) {
709 (proj >= 0 && mode_is_datab(mode)),
710 "wrong Proj from Proj from Start", 0);
712 (proj < get_method_n_params(mt)),
713 "More Projs for args than args in type", 0
715 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
716 /* value argument */ break;
718 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
720 (mode == get_type_mode(get_method_param_type(mt, proj))),
721 "Mode of Proj from Start doesn't match mode of param type.", 0,
722 show_proj_mode_failure(p, get_method_param_type(mt, proj));
731 (proj >= 0 && mode_is_datab(mode)),
732 "wrong Proj from Proj from Call", 0);
733 mt = get_Call_type(pred);
735 (proj < get_method_n_ress(mt)),
736 "More Projs for results than results in type.", 0);
737 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
738 /* value result */ break;
741 (mode == get_type_mode(get_method_res_type(mt, proj))),
742 "Mode of Proj from Call doesn't match mode of result type.", 0);
751 /* hmm, optimization did not remove it */
755 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
762 * verify a Proj(Tuple) node
764 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p)
773 * verify a Proj(CallBegin) node
775 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p)
783 * verify a Proj(EndReg) node
785 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p)
789 #ifdef INTERPROCEDURAL_VIEW
791 (get_irp_ip_view_state() != ip_view_no),
792 "EndReg may only appear if ip view is constructed.", 0);
798 * verify a Proj(EndExcept) node
800 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p)
804 #ifdef INTERPROCEDURAL_VIEW
806 (get_irp_ip_view_state() != ip_view_no),
807 "EndExcept may only appear if ip view is constructed.", 0);
813 * verify a Proj(CopyB) node
815 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p)
817 ir_mode *mode = get_irn_mode(p);
818 long proj = get_Proj_proj(p);
822 (proj == pn_CopyB_M && mode == mode_M) ||
823 (proj == pn_CopyB_X_regular && mode == mode_X) ||
824 (proj == pn_CopyB_X_except && mode == mode_X)
826 "wrong Proj from CopyB", 0,
827 show_proj_failure(p);
829 if (proj == pn_CopyB_X_regular)
831 get_irn_pinned(n) == op_pin_state_pinned,
832 "Regular Proj from unpinned CopyB", 0);
833 else if (proj == pn_CopyB_X_except)
835 get_irn_pinned(n) == op_pin_state_pinned,
836 "Exception Proj from unpinned CopyB", 0);
841 * verify a Proj(Bound) node
843 static int verify_node_Proj_Bound(ir_node *n, ir_node *p)
845 ir_mode *mode = get_irn_mode(p);
846 long proj = get_Proj_proj(p);
848 /* ignore Bound checks of Bad */
849 if (is_Bad(get_Bound_index(n)))
853 (proj == pn_Bound_M && mode == mode_M) ||
854 (proj == pn_Bound_X_regular && mode == mode_X) ||
855 (proj == pn_Bound_X_except && mode == mode_X) ||
856 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
858 "wrong Proj from Bound", 0,
859 show_proj_failure(p);
867 static int verify_node_Proj(ir_node *p, ir_graph *irg)
872 pred = skip_Id(get_Proj_pred(p));
873 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
874 ASSERT_AND_RET(get_irg_pinned(irg) == op_pin_state_floats || get_nodes_block(pred) == get_nodes_block(p), "Proj must be in same block as its predecessor", 0);
876 op = get_irn_op(pred);
878 if (op->ops.verify_proj_node)
879 return op->ops.verify_proj_node(pred, p);
886 * verify a Block node
888 static int verify_node_Block(ir_node *n, ir_graph *irg)
891 ir_node *mb = get_Block_MacroBlock(n);
893 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
895 if (is_Block(mb) && mb != n) {
898 /* Blocks with more than one predecessor must be header blocks */
899 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
900 if (get_irg_phase_state(irg) != phase_backend) {
901 pred = get_Block_cfgpred(n, 0);
903 /* the predecessor MUST be a regular Proj */
904 ir_node *frag_op = get_Proj_pred(pred);
906 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
907 "partBlock with non-regular predecessor", 0);
909 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
910 of fragile nodes during construction. It does not violate our assumption of dominance
912 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
913 "partBlock with non-regular predecessor", 0);
916 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
920 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
921 ir_node *pred = get_Block_cfgpred(n, i);
923 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
924 "Block node must have a mode_X predecessor", 0);
927 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
928 /* End block may only have Return, Raise or fragile ops as preds. */
929 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
930 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
931 if (is_Proj(pred) || is_Tuple(pred))
932 break; /* We can not test properly. How many tuples are there? */
940 "End Block node", 0);
942 /* irg attr must == graph we are in. */
943 if (! get_interprocedural_view()) {
944 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
950 * verify a Start node
952 static int verify_node_Start(ir_node *n, ir_graph *irg)
954 ir_mode *mymode = get_irn_mode(n);
958 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
959 mymode == mode_T, "Start node", 0
967 static int verify_node_Jmp(ir_node *n, ir_graph *irg)
969 ir_mode *mymode = get_irn_mode(n);
974 mymode == mode_X, "Jmp node", 0
980 * verify an IJmp node
982 static int verify_node_IJmp(ir_node *n, ir_graph *irg)
984 ir_mode *mymode = get_irn_mode(n);
985 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
989 /* IJmp: BB x ref --> X */
990 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
996 * verify a Break node
998 static int verify_node_Break(ir_node *n, ir_graph *irg)
1000 ir_mode *mymode = get_irn_mode(n);
1003 #ifdef INTERPROCEDURAL_VIEW
1004 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1005 "Break may only appear if ip view is constructed.", 0);
1009 mymode == mode_X, "Break node", 0
1015 * verify a Cond node
1017 static int verify_node_Cond(ir_node *n, ir_graph *irg)
1019 ir_mode *mymode = get_irn_mode(n);
1020 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
1024 /* Cond: BB x b --> X x X */
1025 (op1mode == mode_b ||
1026 /* Cond: BB x int --> X^n */
1027 mode_is_int(op1mode) ), "Cond node", 0
1029 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
1035 * verify a Return node
1037 static int verify_node_Return(ir_node *n, ir_graph *irg)
1040 ir_mode *mymode = get_irn_mode(n);
1041 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
1044 /* Return: BB x M x data1 x ... x datan --> X */
1046 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1048 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1049 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1051 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1052 /* Compare returned results with result types of method type */
1053 mt = get_entity_type(get_irg_entity(irg));
1054 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1055 "Number of results for Return doesn't match number of results in type.", 0,
1056 show_return_nres(irg, n, mt););
1057 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1058 ir_type *res_type = get_method_res_type(mt, i);
1060 if (get_irg_phase_state(irg) != phase_backend) {
1061 if (is_atomic_type(res_type)) {
1063 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1064 "Mode of result for Return doesn't match mode of result type.", 0,
1065 show_return_modes(irg, n, mt, i);
1069 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1070 "Mode of result for Return doesn't match mode of result type.", 0,
1071 show_return_modes(irg, n, mt, i);
1080 * verify a Raise node
1082 static int verify_node_Raise(ir_node *n, ir_graph *irg)
1084 ir_mode *mymode = get_irn_mode(n);
1085 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1086 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1090 /* Sel: BB x M x ref --> X x M */
1091 op1mode == mode_M && mode_is_reference(op2mode) &&
1092 mymode == mode_T, "Raise node", 0
1098 * verify a Const node
1100 static int verify_node_Const(ir_node *n, ir_graph *irg)
1102 ir_mode *mymode = get_irn_mode(n);
1106 /* Const: BB --> data */
1107 (mode_is_data(mymode) ||
1108 mymode == mode_b) /* we want boolean constants for static evaluation */
1109 ,"Const node", 0 /* of Cmp. */
1112 /* the modes of the constant and teh tarval must match */
1113 mymode == get_tarval_mode(get_Const_tarval(n)),
1114 "Const node, tarval and node mode mismatch", 0
1120 * verify a SymConst node
1122 static int verify_node_SymConst(ir_node *n, ir_graph *irg)
1124 ir_mode *mymode = get_irn_mode(n);
1128 /* SymConst: BB --> int*/
1129 (mode_is_int(mymode) ||
1130 /* SymConst: BB --> ref */
1131 mode_is_reference(mymode))
1132 ,"SymConst node", 0);
1139 static int verify_node_Sel(ir_node *n, ir_graph *irg)
1142 ir_mode *mymode = get_irn_mode(n);
1143 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1144 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1149 /* Sel: BB x M x ref x int^n --> ref */
1150 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1151 "Sel node", 0, show_node_failure(n)
1154 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1155 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1157 ent = get_Sel_entity(n);
1158 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1163 * verify an InstOf node
1165 static int verify_node_InstOf(ir_node *n, ir_graph *irg)
1167 ir_mode *mymode = get_irn_mode(n);
1168 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1171 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1172 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1177 * Check if the pinned state is right.
1179 static int verify_right_pinned(ir_node *n)
1183 if (get_irn_pinned(n) == op_pin_state_pinned)
1185 mem = get_Call_mem(n);
1187 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1188 if (is_NoMem(mem) || is_Pin(mem))
1194 * verify a Call node
1196 static int verify_node_Call(ir_node *n, ir_graph *irg)
1198 ir_mode *mymode = get_irn_mode(n);
1199 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1200 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1205 /* Call: BB x M x ref x data1 x ... x datan
1206 --> M x datan+1 x ... x data n+m */
1207 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1209 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1210 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1212 mt = get_Call_type(n);
1213 if (get_unknown_type() == mt) {
1217 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1218 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1221 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1222 /* Compare arguments of node with those of type */
1224 if (get_method_variadicity(mt) == variadicity_variadic) {
1226 get_Call_n_params(n) >= get_method_n_params(mt),
1227 "Number of args for Call doesn't match number of args in variadic type.",
1229 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1230 n, get_Call_n_params(n), get_method_n_params(mt));
1234 get_Call_n_params(n) == get_method_n_params(mt),
1235 "Number of args for Call doesn't match number of args in non variadic type.",
1237 ir_fprintf(stderr, "Call %+F has %d params, type %d\n",
1238 n, get_Call_n_params(n), get_method_n_params(mt));
1242 for (i = 0; i < get_method_n_params(mt); i++) {
1243 ir_type *t = get_method_param_type(mt, i);
1245 if (get_irg_phase_state(irg) != phase_backend) {
1246 if (is_atomic_type(t)) {
1248 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1249 "Mode of arg for Call doesn't match mode of arg type.", 0,
1250 show_call_param(n, mt);
1253 /* call with a compound type, mode must be reference */
1255 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1256 "Mode of arg for Call doesn't match mode of arg type.", 0,
1257 show_call_param(n, mt);
1264 if (Call_has_callees(n)) {
1265 for (i = 0; i < get_Call_n_callees(n); i++) {
1266 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1274 * verify an Add node
1276 static int verify_node_Add(ir_node *n, ir_graph *irg)
1278 ir_mode *mymode = get_irn_mode(n);
1279 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1280 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1285 /* common Add: BB x numP x numP --> numP */
1286 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1287 /* Pointer Add: BB x ref x int --> ref */
1288 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1289 /* Pointer Add: BB x int x ref --> ref */
1290 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1293 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1294 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1295 "/* Pointer Add: BB x int x ref --> ref */");
1303 static int verify_node_Sub(ir_node *n, ir_graph *irg)
1305 ir_mode *mymode = get_irn_mode(n);
1306 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1307 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1312 /* common Sub: BB x numP x numP --> numP */
1313 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1314 /* Pointer Sub: BB x ref x int --> ref */
1315 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1316 /* Pointer Sub: BB x ref x ref --> int */
1317 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1320 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1321 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1322 "/* Pointer Sub: BB x ref x ref --> int */" );
1328 * verify a Minus node
1330 static int verify_node_Minus(ir_node *n, ir_graph *irg)
1332 ir_mode *mymode = get_irn_mode(n);
1333 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1337 /* Minus: BB x num --> num */
1338 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1339 show_unop_failure(n , "/* Minus: BB x num --> num */");
1347 static int verify_node_Mul(ir_node *n, ir_graph *irg)
1349 ir_mode *mymode = get_irn_mode(n);
1350 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1351 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1356 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1357 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1358 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1359 /* Mul: BB x float x float --> float */
1360 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1363 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1364 "/* Mul: BB x float x float --> float */");
1370 * verify a Mulh node
1372 static int verify_node_Mulh(ir_node *n, ir_graph *irg)
1374 ir_mode *mymode = get_irn_mode(n);
1375 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1376 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1381 /* Mulh: BB x int x int --> int */
1382 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1385 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1391 * verify a Quot node
1393 static int verify_node_Quot(ir_node *n, ir_graph *irg)
1395 ir_mode *mymode = get_irn_mode(n);
1396 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1397 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1398 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1402 /* Quot: BB x M x float x float --> M x X x float */
1403 op1mode == mode_M && op2mode == op3mode &&
1404 get_mode_sort(op2mode) == irms_float_number &&
1407 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1413 * verify a DivMod node
1415 static int verify_node_DivMod(ir_node *n, ir_graph *irg)
1417 ir_mode *mymode = get_irn_mode(n);
1418 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1419 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1420 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1424 /* DivMod: BB x M x int x int --> M x X x int x int */
1425 op1mode == mode_M &&
1426 mode_is_int(op2mode) &&
1427 op3mode == op2mode &&
1437 static int verify_node_Div(ir_node *n, ir_graph *irg)
1439 ir_mode *mymode = get_irn_mode(n);
1440 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1441 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1442 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1446 /* Div: BB x M x int x int --> M x X x int */
1447 op1mode == mode_M &&
1448 op2mode == op3mode &&
1449 mode_is_int(op2mode) &&
1459 static int verify_node_Mod(ir_node *n, ir_graph *irg)
1461 ir_mode *mymode = get_irn_mode(n);
1462 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1463 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1464 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1468 /* Mod: BB x M x int x int --> M x X x int */
1469 op1mode == mode_M &&
1470 op2mode == op3mode &&
1471 mode_is_int(op2mode) &&
1479 * verify an Abs node
1481 static int verify_node_Abs(ir_node *n, ir_graph *irg)
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1488 /* Abs: BB x num --> num */
1489 op1mode == mymode &&
1490 mode_is_num (op1mode),
1492 show_unop_failure(n, "/* Abs: BB x num --> num */");
1498 * verify a logical And, Or, Eor node
1500 static int verify_node_Logic(ir_node *n, ir_graph *irg)
1502 ir_mode *mymode = get_irn_mode(n);
1503 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1504 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1508 /* And or Or or Eor: BB x int x int --> int */
1509 (mode_is_int(mymode) || mymode == mode_b) &&
1510 op2mode == op1mode &&
1512 "And, Or or Eor node", 0,
1513 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1518 #define verify_node_And verify_node_Logic
1519 #define verify_node_Or verify_node_Logic
1520 #define verify_node_Eor verify_node_Logic
1525 static int verify_node_Not(ir_node *n, ir_graph *irg)
1527 ir_mode *mymode = get_irn_mode(n);
1528 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1532 /* Not: BB x int --> int */
1533 (mode_is_int(mymode) || mymode == mode_b) &&
1536 show_unop_failure(n, "/* Not: BB x int --> int */");
1544 static int verify_node_Cmp(ir_node *n, ir_graph *irg)
1546 ir_mode *mymode = get_irn_mode(n);
1547 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1548 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1552 /* Cmp: BB x datab x datab --> b16 */
1553 mode_is_datab(op1mode) &&
1554 op2mode == op1mode &&
1557 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1563 * verify a Shift node
1565 static int verify_node_Shift(ir_node *n, ir_graph *irg)
1567 ir_mode *mymode = get_irn_mode(n);
1568 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1569 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1573 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1574 mode_is_int(op1mode) &&
1575 mode_is_int(op2mode) &&
1576 !mode_is_signed(op2mode) &&
1578 "Shl, Shr or Shrs node", 0,
1579 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1584 #define verify_node_Shl verify_node_Shift
1585 #define verify_node_Shr verify_node_Shift
1586 #define verify_node_Shrs verify_node_Shift
1589 * verify a Rotl node
1591 static int verify_node_Rotl(ir_node *n, ir_graph *irg)
1593 ir_mode *mymode = get_irn_mode(n);
1594 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1595 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1599 /* Rotl: BB x int x int --> int */
1600 mode_is_int(op1mode) &&
1601 mode_is_int(op2mode) &&
1604 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1610 * verify a Conv node
1612 static int verify_node_Conv(ir_node *n, ir_graph *irg)
1614 ir_mode *mymode = get_irn_mode(n);
1615 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1619 get_irg_phase_state(irg) == phase_backend ||
1620 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1622 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1628 * verify a Cast node
1630 static int verify_node_Cast(ir_node *n, ir_graph *irg)
1632 ir_mode *mymode = get_irn_mode(n);
1633 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1637 /* Conv: BB x datab1 --> datab2 */
1638 mode_is_data(op1mode) && op1mode == mymode,
1640 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1648 static int verify_node_Phi(ir_node *n, ir_graph *irg)
1650 ir_mode *mymode = get_irn_mode(n);
1651 ir_node *block = get_nodes_block(n);
1655 /* a Phi node MUST have the same number of inputs as its block
1656 * Exception is a phi with 0 inputs which is used when (re)constructing the
1658 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1660 get_irn_arity(n) == get_irn_arity(block),
1661 "wrong number of inputs in Phi node", 0,
1662 show_phi_inputs(n, block);
1666 /* Phi: BB x dataM^n --> dataM */
1667 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1668 ir_node *pred = get_Phi_pred(n, i);
1669 if (!is_Bad(pred)) {
1671 get_irn_mode(pred) == mymode,
1673 show_phi_failure(n, pred, i);
1677 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1679 if (mymode == mode_M) {
1680 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1682 ir_node *pred_i = get_Phi_pred(n, i);
1686 for (j = i - 1; j >= 0; --j) {
1687 ir_node *pred_j = get_Phi_pred(n, j);
1692 /* currently this checks fails for blocks with exception
1693 outputs (and these are NOT basic blocks). So it is disabled yet. */
1695 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1696 "At least two different PhiM predecessors are in the same block",
1698 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1708 * verify a Filter node
1710 static int verify_node_Filter(ir_node *n, ir_graph *irg)
1714 #ifdef INTERPROCEDURAL_VIEW
1715 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1716 "Filter may only appear if ip view is constructed.", 0);
1718 /* We should further do tests as for Proj and Phi. */
1723 * verify a Load node
1725 static int verify_node_Load(ir_node *n, ir_graph *irg)
1727 ir_mode *mymode = get_irn_mode(n);
1728 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1729 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1731 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1732 if (get_irg_phase_state(irg) != phase_backend) {
1733 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1735 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1738 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1739 * (Proj (Proj))) sometimes ...
1741 * interprete.c:ai_eval seems to assume that this happens, too
1743 * obset.c:get_abstval_any can't deal with this if the load has
1747 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1748 assert ((NULL != ent) || (mymode != mode_T));
1756 * verify a Store node
1758 static int verify_node_Store(ir_node *n, ir_graph *irg)
1762 ir_mode *mymode = get_irn_mode(n);
1763 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1764 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1765 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1767 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1768 if (get_irg_phase_state(irg) != phase_backend) {
1769 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1771 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1773 target = get_ptr_entity(get_Store_ptr(n));
1774 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1776 * If lowered code, any Sels that add 0 may be removed, causing
1777 * an direct access to entities of array or compound type.
1778 * Prevent this by checking the phase.
1780 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1788 * verify an Alloc node
1790 static int verify_node_Alloc(ir_node *n, ir_graph *irg)
1792 ir_mode *mymode = get_irn_mode(n);
1793 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1794 ir_mode *op2mode = get_irn_mode(get_Alloc_count(n));
1798 /* Alloc: BB x M x int_u --> M x X x ref */
1799 op1mode == mode_M &&
1800 mode_is_int(op2mode) &&
1801 !mode_is_signed(op2mode) &&
1804 show_node_failure(n);
1810 * verify a Free node
1812 static int verify_node_Free(ir_node *n, ir_graph *irg)
1814 ir_mode *mymode = get_irn_mode(n);
1815 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1816 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1817 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1821 /* Free: BB x M x ref x int_u --> M */
1822 op1mode == mode_M && mode_is_reference(op2mode) &&
1823 mode_is_int(op3mode) &&
1824 !mode_is_signed(op3mode) &&
1827 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1833 * verify a Sync node
1835 static int verify_node_Sync(ir_node *n, ir_graph *irg)
1838 ir_mode *mymode = get_irn_mode(n);
1841 /* Sync: BB x M^n --> M */
1842 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1843 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1845 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1850 * verify a Confirm node
1852 static int verify_node_Confirm(ir_node *n, ir_graph *irg)
1854 ir_mode *mymode = get_irn_mode(n);
1855 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1856 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1860 /* Confirm: BB x T x T --> T */
1861 op1mode == mymode &&
1864 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1872 static int verify_node_Mux(ir_node *n, ir_graph *irg)
1874 ir_mode *mymode = get_irn_mode(n);
1875 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1876 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1877 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1881 /* Mux: BB x b x datab x datab --> datab */
1882 op1mode == mode_b &&
1883 op2mode == mymode &&
1884 op3mode == mymode &&
1885 mode_is_datab(mymode),
1892 * verify a CopyB node
1894 static int verify_node_CopyB(ir_node *n, ir_graph *irg)
1896 ir_mode *mymode = get_irn_mode(n);
1897 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1898 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1899 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1900 ir_type *t = get_CopyB_type(n);
1902 /* CopyB: BB x M x ref x ref --> M x X */
1903 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1904 if (get_irg_phase_state(irg) != phase_backend) {
1905 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1910 is_compound_type(t),
1911 "CopyB node should copy compound types only", 0 );
1913 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1914 This should happen RARELY, as CopyB COPIES MEMORY */
1915 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1920 * verify a Bound node
1922 static int verify_node_Bound(ir_node *n, ir_graph *irg)
1924 ir_mode *mymode = get_irn_mode(n);
1925 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1926 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1927 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1928 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1931 /* Bound: BB x M x int x int x int --> M x X */
1934 op1mode == mode_M &&
1935 op2mode == op3mode &&
1936 op3mode == op4mode &&
1937 mode_is_int(op3mode),
1944 * For each usage of a node, it is checked, if the block of the
1945 * node dominates the block of the usage (for phis: the predecessor
1946 * block of the phi for the corresponding edge).
1948 * @return non-zero on success, 0 on dominance error
1950 static int check_dominance_for_node(ir_node *use)
1952 if (is_Block(use)) {
1953 ir_node *mbh = get_Block_MacroBlock(use);
1956 /* must be a partBlock */
1957 if (is_Block(mbh)) {
1958 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1962 /* This won't work for blocks and the end node */
1963 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1965 ir_node *bl = get_nodes_block(use);
1967 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1968 ir_node *def = get_irn_n(use, i);
1969 ir_node *def_bl = get_nodes_block(def);
1970 ir_node *use_bl = bl;
1972 /* ignore dead definition blocks, will be removed */
1973 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1977 use_bl = get_Block_cfgpred_block(bl, i);
1979 /* ignore dead use blocks, will be removed */
1980 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1984 block_dominates(def_bl, use_bl),
1985 "the definition of a value used violates the dominance property", 0,
1987 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1988 current_ir_graph, def_bl, def, use_bl, use, i
1996 /* Tests the modes of n and its predecessors. */
1997 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
2002 if (!get_node_verification_mode())
2005 if (!get_interprocedural_view()) {
2007 * do NOT check placement in interprocedural view, as we don't always know
2008 * the "right" graph ...
2012 /* this seems to be an expensive check in VS compile (9% over all runtime),
2013 so do NOT run it in release mode */
2015 node_is_in_irgs_storage(irg, n),
2016 "Node is not stored on proper IR graph!", 0,
2017 show_node_on_graph(irg, n);
2020 assert(get_irn_irg(n) == irg);
2022 unsigned idx = get_irn_idx(n);
2023 ir_node *node_from_map = get_idx_irn(irg, idx);
2024 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
2025 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
2031 /* We don't want to test nodes whose predecessors are Bad,
2032 as we would have to special case that for each operation. */
2033 if (op != op_Phi && op != op_Block) {
2034 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
2035 if (is_Bad(get_irn_n(n, i)))
2040 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
2041 op_pin_state state = get_irn_pinned(n);
2043 state == op_pin_state_floats ||
2044 state == op_pin_state_pinned,
2045 "invalid pin state", 0,
2046 ir_printf("node %+F", n));
2049 if (op->ops.verify_node)
2050 return op->ops.verify_node(n, irg);
2056 int irn_vrfy(ir_node *n)
2058 #ifdef DEBUG_libfirm
2059 return irn_vrfy_irg(n, current_ir_graph);
2066 /*-----------------------------------------------------------------*/
2067 /* Verify the whole graph. */
2068 /*-----------------------------------------------------------------*/
2070 #ifdef DEBUG_libfirm
2072 * Walker to check every node
2074 static void vrfy_wrap(ir_node *node, void *env)
2077 *res = irn_vrfy_irg(node, current_ir_graph);
2081 * Walker to check every node including SSA property.
2082 * Only called if dominance info is available.
2084 static void vrfy_wrap_ssa(ir_node *node, void *env)
2088 *res = irn_vrfy_irg(node, current_ir_graph);
2090 *res = check_dominance_for_node(node);
2094 #endif /* DEBUG_libfirm */
2097 * Calls irn_vrfy for each node in irg.
2098 * Graph must be in state "op_pin_state_pinned".
2099 * If dominance info is available, check the SSA property.
2101 int irg_verify(ir_graph *irg, unsigned flags)
2104 #ifdef DEBUG_libfirm
2107 rem = current_ir_graph;
2108 current_ir_graph = irg;
2111 last_irg_error = NULL;
2114 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2116 if (flags & VRFY_ENFORCE_SSA)
2121 get_irg_dom_state(irg) == dom_consistent &&
2122 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2126 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2127 ir_entity *ent = get_irg_entity(irg);
2130 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2132 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)irg);
2135 current_ir_graph = rem;
2139 #endif /* DEBUG_libfirm */
2145 ir_graph_pass_t pass;
2150 * Wrapper to irg_verify to be run as an ir_graph pass.
2152 static int irg_verify_wrapper(ir_graph *irg, void *context)
2154 struct pass_t *pass = context;
2155 irg_verify(irg, pass->flags);
2156 /* do NOT rerun the pass if verify is ok :-) */
2160 /* Creates an ir_graph pass for irg_verify(). */
2161 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags)
2163 struct pass_t *pass = XMALLOCZ(struct pass_t);
2165 def_graph_pass_constructor(
2166 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2168 /* neither dump for verify */
2169 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2170 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2172 pass->flags = flags;
2176 /* create a verify pass */
2177 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
2180 firm_verification_t old = get_node_verification_mode();
2182 firm_vrfy_failure_msg = NULL;
2183 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2184 res = irn_vrfy_irg(n, irg);
2185 if (res && get_irg_dom_state(irg) == dom_consistent &&
2186 get_irg_pinned(irg) == op_pin_state_pinned)
2187 res = check_dominance_for_node(n);
2188 do_node_verification(old);
2189 *bad_string = firm_vrfy_failure_msg;
2195 typedef struct _vrfy_bad_env_t {
2201 * Pre-Walker: check Bad predecessors of node.
2203 static void check_bads(ir_node *node, void *env)
2205 vrfy_bad_env_t *venv = env;
2206 int i, arity = get_irn_arity(node);
2208 if (is_Block(node)) {
2209 if ((venv->flags & BAD_CF) == 0) {
2211 /* check for Bad Block predecessor */
2212 for (i = 0; i < arity; ++i) {
2213 ir_node *pred = get_irn_n(node, i);
2216 venv->res |= BAD_CF;
2218 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2219 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2221 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2222 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2223 assert(0 && "Bad CF detected");
2229 if ((venv->flags & BAD_BLOCK) == 0) {
2231 /* check for Bad Block */
2232 if (is_Bad(get_nodes_block(node))) {
2233 venv->res |= BAD_BLOCK;
2235 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2236 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2238 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2239 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2240 assert(0 && "Bad CF detected");
2245 if ((venv->flags & TUPLE) == 0) {
2246 if (is_Tuple(node)) {
2249 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2250 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2252 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2253 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2254 assert(0 && "Tuple detected");
2259 for (i = 0; i < arity; ++i) {
2260 ir_node *pred = get_irn_n(node, i);
2263 /* check for Phi with Bad inputs */
2264 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2265 if (venv->flags & BAD_CF)
2268 venv->res |= BAD_CF;
2270 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2271 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2273 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2274 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2275 assert(0 && "Bad CF detected");
2280 /* Bad node input */
2281 if ((venv->flags & BAD_DF) == 0) {
2282 venv->res |= BAD_DF;
2284 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2285 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2287 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2288 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2289 assert(0 && "Bad NON-CF detected");
2298 * verify occurrence of bad nodes
2300 int irg_vrfy_bads(ir_graph *irg, int flags)
2307 irg_walk_graph(irg, check_bads, NULL, &env);
2313 * set the default verify operation
2315 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops)
2319 ops->verify_node = verify_node_##a; \
2376 ops->verify_proj_node = verify_node_Proj_##a; \