2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
32 #include "irgraph_t.h"
42 /** if this flag is set, verify entity types in Load & Store nodes */
43 static int vrfy_entities = 0;
45 const char *firm_vrfy_failure_msg;
47 /* enable verification of Load/Store entities */
48 void vrfy_enable_entity_tests(int enable) {
49 vrfy_entities = enable;
55 * little helper for NULL modes
57 static const char *get_mode_name_ex(ir_mode *mode) {
60 return get_mode_name(mode);
63 /** the last IRG, on which a verify error was found */
64 static ir_graph *last_irg_error = NULL;
67 * print the name of the entity of an verification failure
69 static void show_entity_failure(ir_node *node) {
70 ir_graph *irg = get_irn_irg(node);
72 if (last_irg_error == irg)
77 if (irg == get_const_code_irg()) {
78 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
80 ir_entity *ent = get_irg_entity(irg);
83 ir_type *ent_type = get_entity_owner(ent);
86 if (ent_type == get_glob_type())
87 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
89 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
91 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
94 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
100 * Prints a failure for a Node
102 static void show_node_failure(ir_node *n) {
103 show_entity_failure(n);
104 fprintf(stderr, " node %ld %s%s\n" ,
106 get_irn_opname(n), get_irn_modename(n)
111 * Prints a failure message for a binop
113 static void show_binop_failure(ir_node *n, const char *text) {
114 ir_node *left = get_binop_left(n);
115 ir_node *right = get_binop_right(n);
117 show_entity_failure(n);
118 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
120 get_irn_opname(n), get_irn_modename(n),
121 get_irn_opname(left), get_irn_modename(left),
122 get_irn_opname(right), get_irn_modename(right),
127 * Prints a failure message for an unop
129 static void show_unop_failure(ir_node *n, const char *text) {
130 ir_node *op = get_unop_op(n);
132 show_entity_failure(n);
133 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
135 get_irn_opname(n), get_irn_modename(n),
136 get_irn_opname(op), get_irn_modename(op),
141 * Prints a failure message for an op with 3 operands
143 static void show_triop_failure(ir_node *n, const char *text) {
144 ir_node *op0 = get_irn_n(n, 0);
145 ir_node *op1 = get_irn_n(n, 1);
146 ir_node *op2 = get_irn_n(n, 2);
148 show_entity_failure(n);
149 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
151 get_irn_opname(n), get_irn_modename(n),
152 get_irn_opname(op0), get_irn_modename(op0),
153 get_irn_opname(op1), get_irn_modename(op1),
154 get_irn_opname(op2), get_irn_modename(op2),
159 * Prints a failure message for a proj
161 static void show_proj_failure(ir_node *n) {
162 ir_node *op = get_Proj_pred(n);
163 int proj = get_Proj_proj(n);
165 show_entity_failure(n);
166 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
168 get_irn_opname(n), get_irn_modename(n), proj,
169 get_irn_opname(op), get_irn_modename(op));
173 * Prints a failure message for a proj from Start
175 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
176 long proj = get_Proj_proj(n);
177 ir_mode *m = get_type_mode(ty);
179 show_entity_failure(n);
180 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
185 get_mode_name_ex(m));
189 * Prints a failure message for a proj
191 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
192 ir_node *op = get_Proj_pred(n);
193 int proj = get_Proj_proj(n);
194 ir_mode *m = get_type_mode(get_entity_type(ent));
196 show_entity_failure(n);
197 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
199 get_irn_opname(n), get_irn_modename(n), proj,
200 get_irn_opname(op), get_irn_modename(op),
201 get_entity_name(ent), get_type_name(get_entity_type(ent)),
202 get_mode_name_ex(m));
206 * Show a node and a graph
208 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
209 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
213 * Show call parameters
215 static void show_call_param(ir_node *n, ir_type *mt) {
218 show_entity_failure(n);
219 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
220 for (i = 0; i < get_method_n_params(mt); ++i) {
221 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
223 fprintf(stderr, ") != CALL(");
225 for (i = 0; i < get_Call_n_params(n); ++i) {
226 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
228 fprintf(stderr, ")\n");
234 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
235 ir_entity *ent = get_irg_entity(irg);
237 show_entity_failure(n);
238 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
239 get_irn_node_nr(n), get_entity_name(ent),
240 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
241 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
246 * Show return number of results
248 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
249 ir_entity *ent = get_irg_entity(irg);
251 show_entity_failure(n);
252 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
253 get_irn_node_nr(n), get_entity_name(ent),
254 get_Return_n_ress(n), get_method_n_ress(mt));
260 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
262 show_entity_failure(phi);
263 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
264 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
265 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
271 static void show_phi_inputs(ir_node *phi, ir_node *block) {
272 show_entity_failure(phi);
273 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
274 get_irn_node_nr(phi), get_irn_arity(phi),
275 get_irn_node_nr(block), get_irn_arity(block));
278 #endif /* #ifndef NDEBUG */
281 * If the address is Sel or SymConst, return the entity.
283 * @param ptr the node representing the address
285 static ir_entity *get_ptr_entity(ir_node *ptr) {
286 if (get_irn_op(ptr) == op_Sel) {
287 return get_Sel_entity(ptr);
288 } else if (is_SymConst_addr_ent(ptr)) {
289 return get_SymConst_entity(ptr);
295 * verify a Proj(Start) node
297 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
298 ir_mode *mode = get_irn_mode(p);
299 long proj = get_Proj_proj(p);
304 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
305 (proj == pn_Start_M && mode == mode_M) ||
306 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
307 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
308 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
309 (proj == pn_Start_T_args && mode == mode_T) ||
310 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
311 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
313 "wrong Proj from Start", 0,
314 show_proj_failure(p);
320 * verify a Proj(Cond) node
322 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
323 ir_mode *mode = get_irn_mode(p);
324 long proj = get_Proj_proj(p);
328 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
329 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
330 is_Bad(get_Cond_selector(pred)) /* rare */
332 "wrong Proj from Cond", 0,
333 show_proj_failure(p);
339 * verify a Proj(Raise) node
341 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
342 ir_mode *mode = get_irn_mode(p);
343 long proj = get_Proj_proj(p);
347 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
348 "wrong Proj from Raise", 0,
349 show_proj_failure(p);
355 * verify a Proj(InstOf) node
357 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
358 ir_mode *mode = get_irn_mode(p);
359 long proj = get_Proj_proj(p);
364 (proj == pn_InstOf_M_regular && mode == mode_M) ||
365 (proj == pn_InstOf_X_regular && mode == mode_X) ||
366 (proj == pn_InstOf_X_except && mode == mode_X) ||
367 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
368 (proj == pn_InstOf_M_except && mode == mode_M)
370 "wrong Proj from InstOf", 0,
371 show_proj_failure(p);
377 * verify a Proj(Call) node
379 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
380 ir_mode *mode = get_irn_mode(p);
381 long proj = get_Proj_proj(p);
385 (proj == pn_Call_M_regular && mode == mode_M) ||
386 (proj == pn_Call_X_regular && mode == mode_X) ||
387 (proj == pn_Call_X_except && mode == mode_X) ||
388 (proj == pn_Call_T_result && mode == mode_T) ||
389 (proj == pn_Call_M_except && mode == mode_M) ||
390 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
392 "wrong Proj from Call", 0,
393 show_proj_failure(p);
395 /* if we have exception flow, we must have a real Memory input */
396 if (proj == pn_Call_X_regular)
398 get_irn_op(get_Call_mem(n)) != op_NoMem,
399 "Regular Proj from FunctionCall", 0);
400 else if (proj == pn_Call_X_except)
402 get_irn_op(get_Call_mem(n)) != op_NoMem,
403 "Exception Proj from FunctionCall", 0);
404 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
406 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
407 "Memory Proj from FunctionCall", 0);
412 * verify a Proj(Quot) node
414 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
415 ir_mode *mode = get_irn_mode(p);
416 long proj = get_Proj_proj(p);
420 (proj == pn_Quot_M && mode == mode_M) ||
421 (proj == pn_Quot_X_regular && mode == mode_X) ||
422 (proj == pn_Quot_X_except && mode == mode_X) ||
423 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
425 "wrong Proj from Quot", 0,
426 show_proj_failure(p);
428 if (proj == pn_Quot_X_regular)
430 get_irn_pinned(n) == op_pin_state_pinned,
431 "Regular Proj from unpinned Quot", 0);
432 else if (proj == pn_Quot_X_except)
434 get_irn_pinned(n) == op_pin_state_pinned,
435 "Exception Proj from unpinned Quot", 0);
436 else if (proj == pn_Quot_M)
438 get_irn_pinned(n) == op_pin_state_pinned,
439 "Memory Proj from unpinned Quot", 0);
444 * verify a Proj(DivMod) node
446 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
447 ir_mode *mode = get_irn_mode(p);
448 long proj = get_Proj_proj(p);
452 (proj == pn_DivMod_M && mode == mode_M) ||
453 (proj == pn_DivMod_X_regular && mode == mode_X) ||
454 (proj == pn_DivMod_X_except && mode == mode_X) ||
455 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
456 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
458 "wrong Proj from DivMod", 0,
459 show_proj_failure(p);
461 if (proj == pn_DivMod_X_regular)
463 get_irn_pinned(n) == op_pin_state_pinned,
464 "Regular Proj from unpinned DivMod", 0);
465 else if (proj == pn_DivMod_X_except)
467 get_irn_pinned(n) == op_pin_state_pinned,
468 "Exception Proj from unpinned DivMod", 0);
469 else if (proj == pn_DivMod_M)
471 get_irn_pinned(n) == op_pin_state_pinned,
472 "Memory Proj from unpinned DivMod", 0);
477 * verify a Proj(Div) node
479 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
480 ir_mode *mode = get_irn_mode(p);
481 long proj = get_Proj_proj(p);
485 (proj == pn_Div_M && mode == mode_M) ||
486 (proj == pn_Div_X_regular && mode == mode_X) ||
487 (proj == pn_Div_X_except && mode == mode_X) ||
488 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
490 "wrong Proj from Div", 0,
491 show_proj_failure(p);
493 if (proj == pn_Div_X_regular)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Regular Proj from unpinned Div", 0);
497 else if (proj == pn_Div_X_except)
499 get_irn_pinned(n) == op_pin_state_pinned,
500 "Exception Proj from unpinned Div", 0);
501 else if (proj == pn_Div_M)
503 get_irn_pinned(n) == op_pin_state_pinned,
504 "Memory Proj from unpinned Div", 0);
509 * verify a Proj(Mod) node
511 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
512 ir_mode *mode = get_irn_mode(p);
513 long proj = get_Proj_proj(p);
517 (proj == pn_Mod_M && mode == mode_M) ||
518 (proj == pn_Mod_X_regular && mode == mode_X) ||
519 (proj == pn_Mod_X_except && mode == mode_X) ||
520 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
522 "wrong Proj from Mod", 0,
523 show_proj_failure(p);
525 if (proj == pn_Mod_X_regular)
527 get_irn_pinned(n) == op_pin_state_pinned,
528 "Regular Proj from unpinned Mod", 0);
529 else if (proj == pn_Mod_X_except)
531 get_irn_pinned(n) == op_pin_state_pinned,
532 "Exception Proj from unpinned Mod", 0);
533 else if (proj == pn_Mod_M)
535 get_irn_pinned(n) == op_pin_state_pinned,
536 "Memory Proj from unpinned Div", 0);
541 * verify a Proj(Cmp) node
543 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
544 ir_mode *mode = get_irn_mode(p);
545 long proj = get_Proj_proj(p);
549 (proj >= 0 && proj <= 15 && mode == mode_b),
550 "wrong Proj from Cmp", 0,
551 show_proj_failure(p);
554 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
555 "unordered Proj for non-float Cmp", 0,
556 show_proj_failure(p);
562 * verify a Proj(Load) node
564 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
565 ir_mode *mode = get_irn_mode(p);
566 long proj = get_Proj_proj(p);
568 if (proj == pn_Load_res) {
569 ir_node *ptr = get_Load_ptr(n);
570 ir_entity *ent = get_ptr_entity(ptr);
572 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
573 /* do NOT check this for lowered phases, see comment on Store */
575 (mode == get_type_mode(get_entity_type(ent))),
576 "wrong data Proj from Load, entity type_mode failed", 0,
577 show_proj_failure_ent(p, ent);
582 mode_is_data(mode) && mode == get_Load_mode(n),
583 "wrong data Proj from Load", 0,
584 show_proj_failure(p);
591 (proj == pn_Load_M && mode == mode_M) ||
592 (proj == pn_Load_X_regular && mode == mode_X) ||
593 (proj == pn_Load_X_except && mode == mode_X)
595 "wrong Proj from Load", 0,
596 show_proj_failure(p);
599 if (proj == pn_Load_X_regular) {
601 get_irn_pinned(n) == op_pin_state_pinned,
602 "Regular Proj from unpinned Load", 0);
603 } else if (proj == pn_Load_X_except) {
605 get_irn_pinned(n) == op_pin_state_pinned,
606 "Exception Proj from unpinned Load", 0);
612 * verify a Proj(Store) node
614 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
615 ir_mode *mode = get_irn_mode(p);
616 long proj = get_Proj_proj(p);
620 (proj == pn_Store_M && mode == mode_M) ||
621 (proj == pn_Store_X_regular && mode == mode_X) ||
622 (proj == pn_Store_X_except && mode == mode_X)
624 "wrong Proj from Store", 0,
625 show_proj_failure(p);
627 if (proj == pn_Store_X_regular) {
629 get_irn_pinned(n) == op_pin_state_pinned,
630 "Regular Proj from unpinned Store", 0);
631 } else if (proj == pn_Store_X_except) {
633 get_irn_pinned(n) == op_pin_state_pinned,
634 "Exception Proj from unpinned Store", 0);
640 * verify a Proj(Alloc) node
642 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
643 ir_mode *mode = get_irn_mode(p);
644 long proj = get_Proj_proj(p);
649 (proj == pn_Alloc_M && mode == mode_M) ||
650 (proj == pn_Alloc_X_regular && mode == mode_X) ||
651 (proj == pn_Alloc_X_except && mode == mode_X) ||
652 (proj == pn_Alloc_res && mode_is_reference(mode))
654 "wrong Proj from Alloc", 0,
655 show_proj_failure(p);
661 * verify a Proj(Proj) node
663 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
664 ir_mode *mode = get_irn_mode(p);
665 long proj = get_Proj_proj(p);
666 long nr = get_Proj_proj(pred);
667 ir_type *mt; /* A method type */
669 pred = skip_Id(get_Proj_pred(pred));
670 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
672 switch (get_irn_opcode(pred)) {
674 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
676 if (nr == pn_Start_T_args) {
678 (proj >= 0 && mode_is_datab(mode)),
679 "wrong Proj from Proj from Start", 0);
681 (proj < get_method_n_params(mt)),
682 "More Projs for args than args in type", 0
684 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
685 /* value argument */ break;
687 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
689 (mode == get_type_mode(get_method_param_type(mt, proj))),
690 "Mode of Proj from Start doesn't match mode of param type.", 0,
691 show_proj_mode_failure(p, get_method_param_type(mt, proj));
694 } else if (nr == pn_Start_P_value_arg_base) {
696 (proj >= 0 && mode_is_reference(mode)),
697 "wrong Proj from Proj from Start", 0
700 (proj < get_method_n_params(mt)),
701 "More Projs for args than args in type", 0
709 (proj >= 0 && mode_is_datab(mode)),
710 "wrong Proj from Proj from Call", 0);
711 mt = get_Call_type(pred);
713 (proj < get_method_n_ress(mt)),
714 "More Projs for results than results in type.", 0);
715 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
716 /* value result */ break;
719 (mode == get_type_mode(get_method_res_type(mt, proj))),
720 "Mode of Proj from Call doesn't match mode of result type.", 0);
729 /* hmm, optimization did not remove it */
733 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
740 * verify a Proj(Tuple) node
742 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
750 * verify a Proj(CallBegin) node
752 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
759 * verify a Proj(EndReg) node
761 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
764 #ifdef INTERPROCEDURAL_VIEW
766 (get_irp_ip_view_state() != ip_view_no),
767 "EndReg may only appear if ip view is constructed.", 0);
773 * verify a Proj(EndExcept) node
775 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
778 #ifdef INTERPROCEDURAL_VIEW
780 (get_irp_ip_view_state() != ip_view_no),
781 "EndExcept may only appear if ip view is constructed.", 0);
787 * verify a Proj(CopyB) node
789 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
790 ir_mode *mode = get_irn_mode(p);
791 long proj = get_Proj_proj(p);
795 (proj == pn_CopyB_M_regular && mode == mode_M) ||
796 (proj == pn_CopyB_X_regular && mode == mode_X) ||
797 (proj == pn_CopyB_X_except && mode == mode_X) ||
798 (proj == pn_CopyB_M_except && mode == mode_M)
800 "wrong Proj from CopyB", 0,
801 show_proj_failure(p);
803 if (proj == pn_CopyB_X_regular)
805 get_irn_pinned(n) == op_pin_state_pinned,
806 "Regular Proj from unpinned CopyB", 0);
807 else if (proj == pn_CopyB_X_except)
809 get_irn_pinned(n) == op_pin_state_pinned,
810 "Exception Proj from unpinned CopyB", 0);
815 * verify a Proj(Bound) node
817 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
818 ir_mode *mode = get_irn_mode(p);
819 long proj = get_Proj_proj(p);
821 /* ignore Bound checks of Bad */
822 if (is_Bad(get_Bound_index(n)))
826 (proj == pn_Bound_M && mode == mode_M) ||
827 (proj == pn_Bound_X_regular && mode == mode_X) ||
828 (proj == pn_Bound_X_except && mode == mode_X) ||
829 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
831 "wrong Proj from Bound", 0,
832 show_proj_failure(p);
841 verify_node_Proj(ir_node *p, ir_graph *irg) {
846 pred = skip_Id(get_Proj_pred(p));
847 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
849 op = get_irn_op(pred);
851 if (op->ops.verify_proj_node)
852 return op->ops.verify_proj_node(pred, p);
859 * verify a Block node
861 static int verify_node_Block(ir_node *n, ir_graph *irg) {
863 ir_node *mb = get_Block_MacroBlock(n);
865 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
867 if (is_Block(mb) && mb != n) {
870 /* Blocks with more than one predecessor must be header blocks */
871 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
872 pred = get_Block_cfgpred(n, 0);
874 /* the predecessor MUST be a regular Proj */
875 ir_node *frag_op = get_Proj_pred(pred);
876 ASSERT_AND_RET(is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
877 "partBlock with non-regular predecessor", 0);
879 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
880 of fragile nodes during construction. It does not violate our assumption of dominance
882 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
883 "partBlock with non-regular predecessor", 0);
887 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
888 ir_node *pred = get_Block_cfgpred(n, i);
890 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
891 "Block node must have a mode_X predecessor", 0);
894 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
895 /* End block may only have Return, Raise or fragile ops as preds. */
896 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
897 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
898 if (is_Proj(pred) || is_Tuple(pred))
899 break; /* We can not test properly. How many tuples are there? */
907 "End Block node", 0);
909 /* irg attr must == graph we are in. */
910 if (! get_interprocedural_view()) {
911 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
917 * verify a Start node
919 static int verify_node_Start(ir_node *n, ir_graph *irg) {
920 ir_mode *mymode = get_irn_mode(n);
924 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
925 mymode == mode_T, "Start node", 0
933 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
934 ir_mode *mymode = get_irn_mode(n);
939 mymode == mode_X, "Jmp node", 0
945 * verify an IJmp node
947 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
948 ir_mode *mymode = get_irn_mode(n);
949 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
953 /* IJmp: BB x ref --> X */
954 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
960 * verify a Break node
962 static int verify_node_Break(ir_node *n, ir_graph *irg) {
963 ir_mode *mymode = get_irn_mode(n);
966 #ifdef INTERPROCEDURAL_VIEW
967 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
968 "Break may only appear if ip view is constructed.", 0);
972 mymode == mode_X, "Break node", 0
980 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
981 ir_mode *mymode = get_irn_mode(n);
982 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
986 /* Cond: BB x b --> X x X */
987 (op1mode == mode_b ||
988 /* Cond: BB x int --> X^n */
989 mode_is_int(op1mode) ), "Cond node", 0
991 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
997 * verify a Return node
999 static int verify_node_Return(ir_node *n, ir_graph *irg) {
1001 ir_mode *mymode = get_irn_mode(n);
1002 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
1005 /* Return: BB x M x data1 x ... x datan --> X */
1007 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1009 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1010 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1012 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1013 /* Compare returned results with result types of method type */
1014 mt = get_entity_type(get_irg_entity(irg));
1015 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1016 "Number of results for Return doesn't match number of results in type.", 0,
1017 show_return_nres(irg, n, mt););
1018 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1019 ir_type *res_type = get_method_res_type(mt, i);
1021 if (get_irg_phase_state(irg) != phase_backend) {
1022 if (is_atomic_type(res_type)) {
1024 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1025 "Mode of result for Return doesn't match mode of result type.", 0,
1026 show_return_modes(irg, n, mt, i);
1030 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1031 "Mode of result for Return doesn't match mode of result type.", 0,
1032 show_return_modes(irg, n, mt, i);
1041 * verify a Raise node
1043 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1044 ir_mode *mymode = get_irn_mode(n);
1045 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1046 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1050 /* Sel: BB x M x ref --> X x M */
1051 op1mode == mode_M && mode_is_reference(op2mode) &&
1052 mymode == mode_T, "Raise node", 0
1058 * verify a Const node
1060 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1061 ir_mode *mymode = get_irn_mode(n);
1065 /* Const: BB --> data */
1066 (mode_is_data(mymode) ||
1067 mymode == mode_b) /* we want boolean constants for static evaluation */
1068 ,"Const node", 0 /* of Cmp. */
1071 /* the modes of the constant and teh tarval must match */
1072 mymode == get_tarval_mode(get_Const_tarval(n)),
1073 "Const node, tarval and node mode mismatch", 0
1079 * verify a SymConst node
1081 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1082 ir_mode *mymode = get_irn_mode(n);
1085 if (get_SymConst_kind(n) == symconst_addr_ent) {
1086 ir_entity *ent = get_SymConst_entity(n);
1087 if (is_Method_type(get_entity_type(ent)) &&
1088 get_irn_irg(n) != get_const_code_irg()) {
1090 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1091 "A constant must address an existing method.", 0);
1096 /* SymConst: BB --> int*/
1097 (mode_is_int(mymode) ||
1098 /* SymConst: BB --> ref */
1099 mode_is_reference(mymode))
1100 ,"SymConst node", 0);
1107 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1109 ir_mode *mymode = get_irn_mode(n);
1110 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1111 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1116 /* Sel: BB x M x ref x int^n --> ref */
1117 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1118 "Sel node", 0, show_node_failure(n)
1121 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1122 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1124 ent = get_Sel_entity(n);
1125 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1130 * verify an InstOf node
1132 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1133 ir_mode *mymode = get_irn_mode(n);
1134 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1137 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1138 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1143 * Check if the pinned state is right.
1145 static int verify_right_pinned(ir_node *n) {
1148 if (get_irn_pinned(n) == op_pin_state_pinned)
1150 mem = get_Call_mem(n);
1152 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1153 if (is_NoMem(mem) || is_Pin(mem))
1159 * verify a Call node
1161 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1162 ir_mode *mymode = get_irn_mode(n);
1163 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1164 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1169 /* Call: BB x M x ref x data1 x ... x datan
1170 --> M x datan+1 x ... x data n+m */
1171 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1173 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1174 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1176 mt = get_Call_type(n);
1177 if(get_unknown_type() == mt) {
1181 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1182 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1185 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1186 /* Compare arguments of node with those of type */
1188 if (get_method_variadicity(mt) == variadicity_variadic) {
1190 get_Call_n_params(n) >= get_method_n_params(mt),
1191 "Number of args for Call doesn't match number of args in variadic type.",
1193 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1194 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1198 get_Call_n_params(n) == get_method_n_params(mt),
1199 "Number of args for Call doesn't match number of args in non variadic type.",
1201 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1202 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1206 for (i = 0; i < get_method_n_params(mt); i++) {
1207 ir_type *t = get_method_param_type(mt, i);
1209 if (get_irg_phase_state(irg) != phase_backend) {
1210 if (is_atomic_type(t)) {
1212 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1213 "Mode of arg for Call doesn't match mode of arg type.", 0,
1214 show_call_param(n, mt);
1217 /* call with a compound type, mode must be reference */
1219 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1220 "Mode of arg for Call doesn't match mode of arg type.", 0,
1221 show_call_param(n, mt);
1228 if (Call_has_callees(n)) {
1229 for (i = 0; i < get_Call_n_callees(n); i++) {
1230 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1238 * verify an Add node
1240 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1241 ir_mode *mymode = get_irn_mode(n);
1242 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1243 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1248 /* common Add: BB x numP x numP --> numP */
1249 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1250 /* Pointer Add: BB x ref x int --> ref */
1251 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1252 /* Pointer Add: BB x int x ref --> ref */
1253 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1256 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1257 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1258 "/* Pointer Add: BB x int x ref --> ref */");
1266 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1267 ir_mode *mymode = get_irn_mode(n);
1268 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1269 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1274 /* common Sub: BB x numP x numP --> numP */
1275 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1276 /* Pointer Sub: BB x ref x int --> ref */
1277 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1278 /* Pointer Sub: BB x int x ref --> ref */
1279 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1280 /* Pointer Sub: BB x ref x ref --> int */
1281 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1284 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1285 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1286 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1287 "/* Pointer Sub: BB x ref x ref --> int */" );
1293 * verify a Minus node
1295 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1296 ir_mode *mymode = get_irn_mode(n);
1297 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1301 /* Minus: BB x num --> num */
1302 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1303 show_unop_failure(n , "/* Minus: BB x num --> num */");
1311 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1312 ir_mode *mymode = get_irn_mode(n);
1313 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1314 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1319 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1320 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1321 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1322 /* Mul: BB x float x float --> float */
1323 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1326 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1327 "/* Mul: BB x float x float --> float */");
1333 * verify a Mulh node
1335 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1336 ir_mode *mymode = get_irn_mode(n);
1337 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1338 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1343 /* Mulh: BB x int x int --> int */
1344 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1347 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1353 * verify a Quot node
1355 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1356 ir_mode *mymode = get_irn_mode(n);
1357 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1358 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1359 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1363 /* Quot: BB x M x float x float --> M x X x float */
1364 op1mode == mode_M && op2mode == op3mode &&
1365 get_mode_sort(op2mode) == irms_float_number &&
1368 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1374 * verify a DivMod node
1376 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1377 ir_mode *mymode = get_irn_mode(n);
1378 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1379 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1380 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1384 /* DivMod: BB x M x int x int --> M x X x int x int */
1385 op1mode == mode_M &&
1386 mode_is_int(op2mode) &&
1387 op3mode == op2mode &&
1397 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1398 ir_mode *mymode = get_irn_mode(n);
1399 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1400 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1401 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1405 /* Div: BB x M x int x int --> M x X x int */
1406 op1mode == mode_M &&
1407 op2mode == op3mode &&
1408 mode_is_int(op2mode) &&
1418 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1419 ir_mode *mymode = get_irn_mode(n);
1420 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1421 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1422 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1426 /* Mod: BB x M x int x int --> M x X x int */
1427 op1mode == mode_M &&
1428 op2mode == op3mode &&
1429 mode_is_int(op2mode) &&
1437 * verify an Abs node
1439 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1440 ir_mode *mymode = get_irn_mode(n);
1441 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1445 /* Abs: BB x num --> num */
1446 op1mode == mymode &&
1447 mode_is_num (op1mode),
1449 show_unop_failure(n, "/* Abs: BB x num --> num */");
1455 * verify a logical And, Or, Eor node
1457 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1458 ir_mode *mymode = get_irn_mode(n);
1459 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1460 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1464 /* And or Or or Eor: BB x int x int --> int */
1465 (mode_is_int(mymode) || mymode == mode_b) &&
1466 op2mode == op1mode &&
1468 "And, Or or Eor node", 0,
1469 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1474 #define verify_node_And verify_node_Logic
1475 #define verify_node_Or verify_node_Logic
1476 #define verify_node_Eor verify_node_Logic
1481 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1482 ir_mode *mymode = get_irn_mode(n);
1483 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1487 /* Not: BB x int --> int */
1488 (mode_is_int(mymode) || mymode == mode_b) &&
1491 show_unop_failure(n, "/* Not: BB x int --> int */");
1499 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1500 ir_mode *mymode = get_irn_mode(n);
1501 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1502 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1506 /* Cmp: BB x datab x datab --> b16 */
1507 mode_is_datab(op1mode) &&
1508 op2mode == op1mode &&
1511 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1517 * verify a Shift node
1519 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1520 ir_mode *mymode = get_irn_mode(n);
1521 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1522 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1526 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1527 mode_is_int(op1mode) &&
1528 mode_is_int(op2mode) &&
1529 !mode_is_signed(op2mode) &&
1531 "Shl, Shr or Shrs node", 0,
1532 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1537 #define verify_node_Shl verify_node_Shift
1538 #define verify_node_Shr verify_node_Shift
1539 #define verify_node_Shrs verify_node_Shift
1544 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1545 ir_mode *mymode = get_irn_mode(n);
1546 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1547 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1551 /* Rot: BB x int x int --> int */
1552 mode_is_int(op1mode) &&
1553 mode_is_int(op2mode) &&
1556 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1562 * verify a Conv node
1564 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1565 ir_mode *mymode = get_irn_mode(n);
1566 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1570 get_irg_phase_state(irg) == phase_backend ||
1571 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1573 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1579 * verify a Cast node
1581 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1582 ir_mode *mymode = get_irn_mode(n);
1583 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1587 /* Conv: BB x datab1 --> datab2 */
1588 mode_is_data(op1mode) && op1mode == mymode,
1590 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1598 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1599 ir_mode *mymode = get_irn_mode(n);
1600 ir_node *block = get_nodes_block(n);
1604 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1605 /* a Phi node MUST have the same number of inputs as its block */
1607 get_irn_arity(n) == get_irn_arity(block),
1608 "wrong number of inputs in Phi node", 0,
1609 show_phi_inputs(n, block);
1613 /* Phi: BB x dataM^n --> dataM */
1614 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1615 ir_node *pred = get_irn_n(n, i);
1616 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown)) {
1618 get_irn_mode(pred) == mymode,
1620 show_phi_failure(n, pred, i);
1624 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1626 if (mymode == mode_M) {
1627 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1629 ir_node *pred_i = get_Phi_pred(n, i);
1633 for (j = i - 1; j >= 0; --j) {
1634 ir_node *pred_j = get_Phi_pred(n, j);
1639 /* currently this checks fails for blocks with exception
1640 outputs (and these are NOT basic blocks). So it is disabled yet. */
1642 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1643 "At least two different PhiM predecessors are in the same block",
1645 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1655 * verify a Filter node
1657 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1660 #ifdef INTERPROCEDURAL_VIEW
1661 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1662 "Filter may only appear if ip view is constructed.", 0);
1664 /* We should further do tests as for Proj and Phi. */
1669 * verify a Load node
1671 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1672 ir_mode *mymode = get_irn_mode(n);
1673 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1674 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1676 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1677 if (get_irg_phase_state(irg) != phase_backend) {
1678 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1680 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1681 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1683 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1686 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1687 * (Proj (Proj))) sometimes ...
1689 * interprete.c:ai_eval seems to assume that this happens, too
1691 * obset.c:get_abstval_any can't deal with this if the load has
1695 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1696 assert ((NULL != ent) || (mymode != mode_T));
1704 * verify a Store node
1706 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1709 ir_mode *mymode = get_irn_mode(n);
1710 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1711 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1712 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1714 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1715 if (get_irg_phase_state(irg) != phase_backend) {
1716 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1718 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1719 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1721 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1723 target = get_ptr_entity(get_Store_ptr(n));
1724 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1726 * If lowered code, any Sels that add 0 may be removed, causing
1727 * an direct access to entities of array or compound type.
1728 * Prevent this by checking the phase.
1730 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1738 * verify an Alloc node
1740 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1741 ir_mode *mymode = get_irn_mode(n);
1742 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1743 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1747 /* Alloc: BB x M x int_u --> M x X x ref */
1748 op1mode == mode_M &&
1749 mode_is_int(op2mode) &&
1750 !mode_is_signed(op2mode) &&
1753 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1759 * verify a Free node
1761 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1762 ir_mode *mymode = get_irn_mode(n);
1763 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1764 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1765 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1769 /* Free: BB x M x ref x int_u --> M */
1770 op1mode == mode_M && mode_is_reference(op2mode) &&
1771 mode_is_int(op3mode) &&
1772 !mode_is_signed(op3mode) &&
1775 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1781 * verify a Sync node
1783 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1785 ir_mode *mymode = get_irn_mode(n);
1788 /* Sync: BB x M^n --> M */
1789 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1790 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1792 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1797 * verify a Confirm node
1799 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1800 ir_mode *mymode = get_irn_mode(n);
1801 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1802 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1806 /* Confirm: BB x T x T --> T */
1807 op1mode == mymode &&
1810 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1818 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1819 ir_mode *mymode = get_irn_mode(n);
1820 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1821 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1822 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1826 /* Mux: BB x b x numP x numP --> numP */
1827 op1mode == mode_b &&
1828 op2mode == mymode &&
1829 op3mode == mymode &&
1830 mode_is_data(mymode),
1837 * verify a CopyB node
1839 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1840 ir_mode *mymode = get_irn_mode(n);
1841 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1842 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1843 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1844 ir_type *t = get_CopyB_type(n);
1846 /* CopyB: BB x M x ref x ref --> M x X */
1847 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1848 if (get_irg_phase_state(irg) != phase_backend) {
1849 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1852 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1853 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1854 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1855 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1859 is_compound_type(t),
1860 "CopyB node should copy compound types only", 0 );
1862 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1863 This should happen RARELY, as CopyB COPIES MEMORY */
1864 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1869 * verify a Bound node
1871 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1872 ir_mode *mymode = get_irn_mode(n);
1873 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1874 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1875 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1876 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1879 /* Bound: BB x M x int x int x int --> M x X */
1882 op1mode == mode_M &&
1883 op2mode == op3mode &&
1884 op3mode == op4mode &&
1885 mode_is_int(op3mode),
1892 * For each usage of a node, it is checked, if the block of the
1893 * node dominates the block of the usage (for phis: the predecessor
1894 * block of the phi for the corresponding edge).
1896 * @return non-zero on success, 0 on dominance error
1898 static int check_dominance_for_node(ir_node *use) {
1899 if (is_Block(use)) {
1900 ir_node *mbh = get_Block_MacroBlock(use);
1903 /* must be a partBlock */
1904 if (is_Block(mbh)) {
1905 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1909 /* This won't work for blocks and the end node */
1910 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1912 ir_node *bl = get_nodes_block(use);
1914 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1915 ir_node *def = get_irn_n(use, i);
1916 ir_node *def_bl = get_nodes_block(def);
1917 ir_node *use_bl = bl;
1919 /* ignore dead definition blocks, will be removed */
1920 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1924 use_bl = get_Block_cfgpred_block(bl, i);
1926 /* ignore dead use blocks, will be removed */
1927 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1931 block_dominates(def_bl, use_bl),
1932 "the definition of a value used violates the dominance property", 0,
1934 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1935 current_ir_graph, def_bl, def, use_bl, use, i
1943 /* Tests the modes of n and its predecessors. */
1944 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1948 if (!get_node_verification_mode())
1951 if (!get_interprocedural_view()) {
1953 * do NOT check placement in interprocedural view, as we don't always know
1954 * the "right" graph ...
1957 node_is_in_irgs_storage(irg, n),
1958 "Node is not stored on proper IR graph!", 0,
1959 show_node_on_graph(irg, n);
1961 assert(get_irn_irg(n) == irg);
1963 unsigned idx = get_irn_idx(n);
1964 ir_node *node_from_map = get_idx_irn(irg, idx);
1965 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));
1971 /* We don't want to test nodes whose predecessors are Bad,
1972 as we would have to special case that for each operation. */
1973 if (op != op_Phi && op != op_Block) {
1974 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1975 if (is_Bad(get_irn_n(n, i)))
1980 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1981 op_pin_state state = get_irn_pinned(n);
1983 state == op_pin_state_floats ||
1984 state == op_pin_state_pinned,
1985 "invalid pin state", 0,
1986 ir_printf("node %+F", n));
1989 if (op->ops.verify_node)
1990 return op->ops.verify_node(n, irg);
1996 int irn_vrfy(ir_node *n) {
1997 #ifdef DEBUG_libfirm
1998 return irn_vrfy_irg(n, current_ir_graph);
2005 /*-----------------------------------------------------------------*/
2006 /* Verify the whole graph. */
2007 /*-----------------------------------------------------------------*/
2009 #ifdef DEBUG_libfirm
2011 * Walker to check every node
2013 static void vrfy_wrap(ir_node *node, void *env) {
2015 *res = irn_vrfy(node);
2019 * Walker to check every node including SSA property.
2020 * Only called if dominance info is available.
2022 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2025 *res = irn_vrfy(node);
2027 *res = check_dominance_for_node(node);
2031 #endif /* DEBUG_libfirm */
2034 * Calls irn_vrfy for each node in irg.
2035 * Graph must be in state "op_pin_state_pinned".
2036 * If dominance info is available, check the SSA property.
2038 int irg_verify(ir_graph *irg, unsigned flags) {
2040 #ifdef DEBUG_libfirm
2043 rem = current_ir_graph;
2044 current_ir_graph = irg;
2047 last_irg_error = NULL;
2050 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2052 if (flags & VRFY_ENFORCE_SSA)
2057 get_irg_dom_state(irg) == dom_consistent &&
2058 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2062 current_ir_graph = rem;
2064 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2065 ir_entity *ent = get_irg_entity(current_ir_graph);
2068 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2070 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
2075 #endif /* DEBUG_libfirm */
2080 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2082 firm_verification_t old = get_node_verification_mode();
2084 firm_vrfy_failure_msg = NULL;
2085 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2086 res = irn_vrfy_irg(n, irg);
2087 if (res && get_irg_dom_state(irg) == dom_consistent &&
2088 get_irg_pinned(irg) == op_pin_state_pinned)
2089 res = check_dominance_for_node(n);
2090 do_node_verification(old);
2091 *bad_string = firm_vrfy_failure_msg;
2097 typedef struct _vrfy_bad_env_t {
2103 * Pre-Walker: check Bad predecessors of node.
2105 static void check_bads(ir_node *node, void *env) {
2106 vrfy_bad_env_t *venv = env;
2107 int i, arity = get_irn_arity(node);
2109 if (is_Block(node)) {
2110 if ((venv->flags & BAD_CF) == 0) {
2112 /* check for Bad Block predecessor */
2113 for (i = 0; i < arity; ++i) {
2114 ir_node *pred = get_irn_n(node, i);
2117 venv->res |= BAD_CF;
2119 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2120 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2122 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2123 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2124 assert(0 && "Bad CF detected");
2130 if ((venv->flags & BAD_BLOCK) == 0) {
2132 /* check for Bad Block */
2133 if (is_Bad(get_nodes_block(node))) {
2134 venv->res |= BAD_BLOCK;
2136 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2137 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2139 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2140 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2141 assert(0 && "Bad CF detected");
2146 if ((venv->flags & TUPLE) == 0) {
2147 if (get_irn_op(node) == op_Tuple) {
2150 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2151 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2153 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2154 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2155 assert(0 && "Tuple detected");
2160 for (i = 0; i < arity; ++i) {
2161 ir_node *pred = get_irn_n(node, i);
2164 /* check for Phi with Bad inputs */
2165 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2166 if (venv->flags & BAD_CF)
2169 venv->res |= BAD_CF;
2171 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2172 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2174 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2175 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2176 assert(0 && "Bad CF detected");
2181 /* Bad node input */
2182 if ((venv->flags & BAD_DF) == 0) {
2183 venv->res |= BAD_DF;
2185 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2186 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2188 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2189 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2190 assert(0 && "Bad NON-CF detected");
2199 * verify occurrence of bad nodes
2201 int irg_vrfy_bads(ir_graph *irg, int flags) {
2207 irg_walk_graph(irg, check_bads, NULL, &env);
2213 * set the default verify operation
2215 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2218 ops->verify_node = verify_node_##a; \
2275 ops->verify_proj_node = verify_node_Proj_##a; \