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) {
48 vrfy_entities = enable;
54 * little helper for NULL modes
56 static const char *get_mode_name_ex(ir_mode *mode) {
59 return get_mode_name(mode);
62 /** the last IRG, on which a verification error was found */
63 static ir_graph *last_irg_error = NULL;
66 * print the name of the entity of an verification failure
68 * @param node the node caused the failure
70 static void show_entity_failure(ir_node *node) {
71 ir_graph *irg = get_irn_irg(node);
73 if (last_irg_error == irg)
78 if (irg == get_const_code_irg()) {
79 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
81 ir_entity *ent = get_irg_entity(irg);
84 ir_type *ent_type = get_entity_owner(ent);
87 if (ent_type == get_glob_type())
88 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
90 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
95 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
101 * Prints a failure for a Node
103 static void show_node_failure(ir_node *n) {
104 show_entity_failure(n);
105 fprintf(stderr, " node %ld %s%s\n" ,
107 get_irn_opname(n), get_irn_modename(n)
112 * Prints a failure message for a binop
114 static void show_binop_failure(ir_node *n, const char *text) {
115 ir_node *left = get_binop_left(n);
116 ir_node *right = get_binop_right(n);
118 show_entity_failure(n);
119 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
121 get_irn_opname(n), get_irn_modename(n),
122 get_irn_opname(left), get_irn_modename(left),
123 get_irn_opname(right), get_irn_modename(right),
128 * Prints a failure message for an unop
130 static void show_unop_failure(ir_node *n, const char *text) {
131 ir_node *op = get_unop_op(n);
133 show_entity_failure(n);
134 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
136 get_irn_opname(n), get_irn_modename(n),
137 get_irn_opname(op), get_irn_modename(op),
142 * Prints a failure message for an op with 3 operands
144 static void show_triop_failure(ir_node *n, const char *text) {
145 ir_node *op0 = get_irn_n(n, 0);
146 ir_node *op1 = get_irn_n(n, 1);
147 ir_node *op2 = get_irn_n(n, 2);
149 show_entity_failure(n);
150 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
152 get_irn_opname(n), get_irn_modename(n),
153 get_irn_opname(op0), get_irn_modename(op0),
154 get_irn_opname(op1), get_irn_modename(op1),
155 get_irn_opname(op2), get_irn_modename(op2),
160 * Prints a failure message for a proj
162 static void show_proj_failure(ir_node *n) {
163 ir_node *op = get_Proj_pred(n);
164 int proj = get_Proj_proj(n);
166 show_entity_failure(n);
167 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
169 get_irn_opname(n), get_irn_modename(n), proj,
170 get_irn_opname(op), get_irn_modename(op));
174 * Prints a failure message for a proj from Start
176 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
177 long proj = get_Proj_proj(n);
178 ir_mode *m = get_type_mode(ty);
180 show_entity_failure(n);
181 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
186 get_mode_name_ex(m));
190 * Prints a failure message for a proj
192 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
193 ir_node *op = get_Proj_pred(n);
194 int proj = get_Proj_proj(n);
195 ir_mode *m = get_type_mode(get_entity_type(ent));
197 show_entity_failure(n);
198 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
200 get_irn_opname(n), get_irn_modename(n), proj,
201 get_irn_opname(op), get_irn_modename(op),
202 get_entity_name(ent), get_type_name(get_entity_type(ent)),
203 get_mode_name_ex(m));
207 * Show a node and a graph
209 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
210 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
214 * Show call parameters
216 static void show_call_param(ir_node *n, ir_type *mt) {
219 show_entity_failure(n);
220 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
221 for (i = 0; i < get_method_n_params(mt); ++i) {
222 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
224 fprintf(stderr, ") != CALL(");
226 for (i = 0; i < get_Call_n_params(n); ++i) {
227 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
229 fprintf(stderr, ")\n");
235 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
236 ir_entity *ent = get_irg_entity(irg);
238 show_entity_failure(n);
239 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
240 get_irn_node_nr(n), get_entity_name(ent),
241 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
242 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
247 * Show return number of results
249 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
250 ir_entity *ent = get_irg_entity(irg);
252 show_entity_failure(n);
253 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
254 get_irn_node_nr(n), get_entity_name(ent),
255 get_Return_n_ress(n), get_method_n_ress(mt));
261 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
263 show_entity_failure(phi);
264 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
265 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
266 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
272 static void show_phi_inputs(ir_node *phi, ir_node *block) {
273 show_entity_failure(phi);
274 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
275 get_irn_node_nr(phi), get_irn_arity(phi),
276 get_irn_node_nr(block), get_irn_arity(block));
279 #endif /* #ifndef NDEBUG */
282 * If the address is Sel or SymConst, return the entity.
284 * @param ptr the node representing the address
286 static ir_entity *get_ptr_entity(ir_node *ptr) {
288 return get_Sel_entity(ptr);
289 } else if (is_SymConst_addr_ent(ptr)) {
290 return get_SymConst_entity(ptr);
296 * verify a Proj(Start) node
298 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
299 ir_mode *mode = get_irn_mode(p);
300 long proj = get_Proj_proj(p);
305 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
306 (proj == pn_Start_M && mode == mode_M) ||
307 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
308 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
309 (proj == pn_Start_T_args && mode == mode_T)
311 "wrong Proj from Start", 0,
312 show_proj_failure(p);
318 * verify a Proj(Cond) node
320 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
321 ir_mode *mode = get_irn_mode(p);
322 long proj = get_Proj_proj(p);
326 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
327 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
328 is_Bad(get_Cond_selector(pred)) /* rare */
330 "wrong Proj from Cond", 0,
331 show_proj_failure(p);
337 * verify a Proj(Raise) node
339 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
340 ir_mode *mode = get_irn_mode(p);
341 long proj = get_Proj_proj(p);
345 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
346 "wrong Proj from Raise", 0,
347 show_proj_failure(p);
353 * verify a Proj(InstOf) node
355 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
356 ir_mode *mode = get_irn_mode(p);
357 long proj = get_Proj_proj(p);
362 (proj == pn_InstOf_M && mode == mode_M) ||
363 (proj == pn_InstOf_X_regular && mode == mode_X) ||
364 (proj == pn_InstOf_X_except && mode == mode_X) ||
365 (proj == pn_InstOf_res && mode_is_reference(mode))
367 "wrong Proj from InstOf", 0,
368 show_proj_failure(p);
374 * verify a Proj(Call) node
376 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
377 ir_mode *mode = get_irn_mode(p);
378 long proj = get_Proj_proj(p);
382 (proj == pn_Call_M && mode == mode_M) ||
383 (proj == pn_Call_X_regular && mode == mode_X) ||
384 (proj == pn_Call_X_except && mode == mode_X) ||
385 (proj == pn_Call_T_result && mode == mode_T) ||
386 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
388 "wrong Proj from Call", 0,
389 show_proj_failure(p);
391 /* if we have exception flow, we must have a real Memory input */
392 if (proj == pn_Call_X_regular)
394 !is_NoMem(get_Call_mem(n)),
395 "Regular Proj from FunctionCall", 0);
396 else if (proj == pn_Call_X_except)
398 !is_NoMem(get_Call_mem(n)),
399 "Exception Proj from FunctionCall", 0);
400 else if (proj == pn_Call_M)
402 (!is_NoMem(get_Call_mem(n)) || 1),
403 "Memory Proj from FunctionCall", 0);
408 * verify a Proj(Quot) node
410 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
411 ir_mode *mode = get_irn_mode(p);
412 long proj = get_Proj_proj(p);
416 (proj == pn_Quot_M && mode == mode_M) ||
417 (proj == pn_Quot_X_regular && mode == mode_X) ||
418 (proj == pn_Quot_X_except && mode == mode_X) ||
419 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
421 "wrong Proj from Quot", 0,
422 show_proj_failure(p);
424 if (proj == pn_Quot_X_regular)
426 get_irn_pinned(n) == op_pin_state_pinned,
427 "Regular Proj from unpinned Quot", 0);
428 else if (proj == pn_Quot_X_except)
430 get_irn_pinned(n) == op_pin_state_pinned,
431 "Exception Proj from unpinned Quot", 0);
432 else if (proj == pn_Quot_M)
434 get_irn_pinned(n) == op_pin_state_pinned,
435 "Memory Proj from unpinned Quot", 0);
440 * verify a Proj(DivMod) node
442 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
443 ir_mode *mode = get_irn_mode(p);
444 long proj = get_Proj_proj(p);
448 (proj == pn_DivMod_M && mode == mode_M) ||
449 (proj == pn_DivMod_X_regular && mode == mode_X) ||
450 (proj == pn_DivMod_X_except && mode == mode_X) ||
451 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
452 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
454 "wrong Proj from DivMod", 0,
455 show_proj_failure(p);
457 if (proj == pn_DivMod_X_regular)
459 get_irn_pinned(n) == op_pin_state_pinned,
460 "Regular Proj from unpinned DivMod", 0);
461 else if (proj == pn_DivMod_X_except)
463 get_irn_pinned(n) == op_pin_state_pinned,
464 "Exception Proj from unpinned DivMod", 0);
465 else if (proj == pn_DivMod_M)
467 get_irn_pinned(n) == op_pin_state_pinned,
468 "Memory Proj from unpinned DivMod", 0);
473 * verify a Proj(Div) node
475 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
476 ir_mode *mode = get_irn_mode(p);
477 long proj = get_Proj_proj(p);
481 (proj == pn_Div_M && mode == mode_M) ||
482 (proj == pn_Div_X_regular && mode == mode_X) ||
483 (proj == pn_Div_X_except && mode == mode_X) ||
484 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
486 "wrong Proj from Div", 0,
487 show_proj_failure(p);
489 if (proj == pn_Div_X_regular)
491 get_irn_pinned(n) == op_pin_state_pinned,
492 "Regular Proj from unpinned Div", 0);
493 else if (proj == pn_Div_X_except)
495 get_irn_pinned(n) == op_pin_state_pinned,
496 "Exception Proj from unpinned Div", 0);
497 else if (proj == pn_Div_M)
499 get_irn_pinned(n) == op_pin_state_pinned,
500 "Memory Proj from unpinned Div", 0);
505 * verify a Proj(Mod) node
507 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
508 ir_mode *mode = get_irn_mode(p);
509 long proj = get_Proj_proj(p);
513 (proj == pn_Mod_M && mode == mode_M) ||
514 (proj == pn_Mod_X_regular && mode == mode_X) ||
515 (proj == pn_Mod_X_except && mode == mode_X) ||
516 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
518 "wrong Proj from Mod", 0,
519 show_proj_failure(p);
521 if (proj == pn_Mod_X_regular)
523 get_irn_pinned(n) == op_pin_state_pinned,
524 "Regular Proj from unpinned Mod", 0);
525 else if (proj == pn_Mod_X_except)
527 get_irn_pinned(n) == op_pin_state_pinned,
528 "Exception Proj from unpinned Mod", 0);
529 else if (proj == pn_Mod_M)
531 get_irn_pinned(n) == op_pin_state_pinned,
532 "Memory Proj from unpinned Div", 0);
537 * verify a Proj(Cmp) node
539 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
540 ir_mode *mode = get_irn_mode(p);
541 long proj = get_Proj_proj(p);
545 (proj >= 0 && proj <= 15 && mode == mode_b),
546 "wrong Proj from Cmp", 0,
547 show_proj_failure(p);
550 (mode_is_float(get_irn_mode(get_Cmp_left(n))) || !(proj & pn_Cmp_Uo)),
551 "unordered Proj for non-float Cmp", 0,
552 show_proj_failure(p);
558 * verify a Proj(Load) node
560 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
561 ir_mode *mode = get_irn_mode(p);
562 long proj = get_Proj_proj(p);
564 if (proj == pn_Load_res) {
565 ir_node *ptr = get_Load_ptr(n);
566 ir_entity *ent = get_ptr_entity(ptr);
568 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
569 /* do NOT check this for lowered phases, see comment on Store */
571 (mode == get_type_mode(get_entity_type(ent))),
572 "wrong data Proj from Load, entity type_mode failed", 0,
573 show_proj_failure_ent(p, ent);
578 mode_is_data(mode) && mode == get_Load_mode(n),
579 "wrong data Proj from Load", 0,
580 show_proj_failure(p);
587 (proj == pn_Load_M && mode == mode_M) ||
588 (proj == pn_Load_X_regular && mode == mode_X) ||
589 (proj == pn_Load_X_except && mode == mode_X)
591 "wrong Proj from Load", 0,
592 show_proj_failure(p);
595 if (proj == pn_Load_X_regular) {
597 get_irn_pinned(n) == op_pin_state_pinned,
598 "Regular Proj from unpinned Load", 0);
599 } else if (proj == pn_Load_X_except) {
601 get_irn_pinned(n) == op_pin_state_pinned,
602 "Exception Proj from unpinned Load", 0);
608 * verify a Proj(Store) node
610 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
611 ir_mode *mode = get_irn_mode(p);
612 long proj = get_Proj_proj(p);
616 (proj == pn_Store_M && mode == mode_M) ||
617 (proj == pn_Store_X_regular && mode == mode_X) ||
618 (proj == pn_Store_X_except && mode == mode_X)
620 "wrong Proj from Store", 0,
621 show_proj_failure(p);
623 if (proj == pn_Store_X_regular) {
625 get_irn_pinned(n) == op_pin_state_pinned,
626 "Regular Proj from unpinned Store", 0);
627 } else if (proj == pn_Store_X_except) {
629 get_irn_pinned(n) == op_pin_state_pinned,
630 "Exception Proj from unpinned Store", 0);
636 * verify a Proj(Alloc) node
638 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
639 ir_mode *mode = get_irn_mode(p);
640 long proj = get_Proj_proj(p);
645 (proj == pn_Alloc_M && mode == mode_M) ||
646 (proj == pn_Alloc_X_regular && mode == mode_X) ||
647 (proj == pn_Alloc_X_except && mode == mode_X) ||
648 (proj == pn_Alloc_res && mode_is_reference(mode))
650 "wrong Proj from Alloc", 0,
651 show_proj_failure(p);
657 * verify a Proj(Proj) node
659 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
660 ir_mode *mode = get_irn_mode(p);
661 long proj = get_Proj_proj(p);
662 long nr = get_Proj_proj(pred);
663 ir_type *mt; /* A method type */
665 pred = skip_Id(get_Proj_pred(pred));
666 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
668 switch (get_irn_opcode(pred)) {
670 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
672 if (nr == pn_Start_T_args) {
674 (proj >= 0 && mode_is_datab(mode)),
675 "wrong Proj from Proj from Start", 0);
677 (proj < get_method_n_params(mt)),
678 "More Projs for args than args in type", 0
680 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
681 /* value argument */ break;
683 if (get_irg_phase_state(get_irn_irg(pred)) != phase_backend) {
685 (mode == get_type_mode(get_method_param_type(mt, proj))),
686 "Mode of Proj from Start doesn't match mode of param type.", 0,
687 show_proj_mode_failure(p, get_method_param_type(mt, proj));
696 (proj >= 0 && mode_is_datab(mode)),
697 "wrong Proj from Proj from Call", 0);
698 mt = get_Call_type(pred);
700 (proj < get_method_n_ress(mt)),
701 "More Projs for results than results in type.", 0);
702 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
703 /* value result */ break;
706 (mode == get_type_mode(get_method_res_type(mt, proj))),
707 "Mode of Proj from Call doesn't match mode of result type.", 0);
716 /* hmm, optimization did not remove it */
720 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
727 * verify a Proj(Tuple) node
729 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
737 * verify a Proj(CallBegin) node
739 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
746 * verify a Proj(EndReg) node
748 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
751 #ifdef INTERPROCEDURAL_VIEW
753 (get_irp_ip_view_state() != ip_view_no),
754 "EndReg may only appear if ip view is constructed.", 0);
760 * verify a Proj(EndExcept) node
762 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
765 #ifdef INTERPROCEDURAL_VIEW
767 (get_irp_ip_view_state() != ip_view_no),
768 "EndExcept may only appear if ip view is constructed.", 0);
774 * verify a Proj(CopyB) node
776 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
777 ir_mode *mode = get_irn_mode(p);
778 long proj = get_Proj_proj(p);
782 (proj == pn_CopyB_M && mode == mode_M) ||
783 (proj == pn_CopyB_X_regular && mode == mode_X) ||
784 (proj == pn_CopyB_X_except && mode == mode_X)
786 "wrong Proj from CopyB", 0,
787 show_proj_failure(p);
789 if (proj == pn_CopyB_X_regular)
791 get_irn_pinned(n) == op_pin_state_pinned,
792 "Regular Proj from unpinned CopyB", 0);
793 else if (proj == pn_CopyB_X_except)
795 get_irn_pinned(n) == op_pin_state_pinned,
796 "Exception Proj from unpinned CopyB", 0);
801 * verify a Proj(Bound) node
803 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
804 ir_mode *mode = get_irn_mode(p);
805 long proj = get_Proj_proj(p);
807 /* ignore Bound checks of Bad */
808 if (is_Bad(get_Bound_index(n)))
812 (proj == pn_Bound_M && mode == mode_M) ||
813 (proj == pn_Bound_X_regular && mode == mode_X) ||
814 (proj == pn_Bound_X_except && mode == mode_X) ||
815 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
817 "wrong Proj from Bound", 0,
818 show_proj_failure(p);
827 verify_node_Proj(ir_node *p, ir_graph *irg) {
831 pred = skip_Id(get_Proj_pred(p));
832 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
833 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);
835 op = get_irn_op(pred);
837 if (op->ops.verify_proj_node)
838 return op->ops.verify_proj_node(pred, p);
845 * verify a Block node
847 static int verify_node_Block(ir_node *n, ir_graph *irg) {
849 ir_node *mb = get_Block_MacroBlock(n);
851 ASSERT_AND_RET(is_Block(mb) || is_Bad(mb), "Block node with wrong MacroBlock", 0);
853 if (is_Block(mb) && mb != n) {
856 /* Blocks with more than one predecessor must be header blocks */
857 ASSERT_AND_RET(get_Block_n_cfgpreds(n) == 1, "partBlock with more than one predecessor", 0);
858 if (get_irg_phase_state(irg) != phase_backend) {
859 pred = get_Block_cfgpred(n, 0);
861 /* the predecessor MUST be a regular Proj */
862 ir_node *frag_op = get_Proj_pred(pred);
864 is_fragile_op(frag_op) && get_Proj_proj(pred) == pn_Generic_X_regular,
865 "partBlock with non-regular predecessor", 0);
867 /* We allow Jmps to be predecessors of partBlocks. This can happen due to optimization
868 of fragile nodes during construction. It does not violate our assumption of dominance
870 ASSERT_AND_RET(is_Jmp(pred) || is_Bad(pred),
871 "partBlock with non-regular predecessor", 0);
874 /* relax in backend: Bound nodes are probably lowered into conditional jumps */
878 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
879 ir_node *pred = get_Block_cfgpred(n, i);
881 is_Bad(pred) || (get_irn_mode(pred) == mode_X),
882 "Block node must have a mode_X predecessor", 0);
885 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
886 /* End block may only have Return, Raise or fragile ops as preds. */
887 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
888 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
889 if (is_Proj(pred) || is_Tuple(pred))
890 break; /* We can not test properly. How many tuples are there? */
898 "End Block node", 0);
900 /* irg attr must == graph we are in. */
901 if (! get_interprocedural_view()) {
902 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
908 * verify a Start node
910 static int verify_node_Start(ir_node *n, ir_graph *irg) {
911 ir_mode *mymode = get_irn_mode(n);
915 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
916 mymode == mode_T, "Start node", 0
924 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
925 ir_mode *mymode = get_irn_mode(n);
930 mymode == mode_X, "Jmp node", 0
936 * verify an IJmp node
938 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
939 ir_mode *mymode = get_irn_mode(n);
940 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
944 /* IJmp: BB x ref --> X */
945 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
951 * verify a Break node
953 static int verify_node_Break(ir_node *n, ir_graph *irg) {
954 ir_mode *mymode = get_irn_mode(n);
957 #ifdef INTERPROCEDURAL_VIEW
958 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
959 "Break may only appear if ip view is constructed.", 0);
963 mymode == mode_X, "Break node", 0
971 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
972 ir_mode *mymode = get_irn_mode(n);
973 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
977 /* Cond: BB x b --> X x X */
978 (op1mode == mode_b ||
979 /* Cond: BB x int --> X^n */
980 mode_is_int(op1mode) ), "Cond node", 0
982 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
988 * verify a Return node
990 static int verify_node_Return(ir_node *n, ir_graph *irg) {
992 ir_mode *mymode = get_irn_mode(n);
993 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
996 /* Return: BB x M x data1 x ... x datan --> X */
998 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
1000 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1001 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
1003 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
1004 /* Compare returned results with result types of method type */
1005 mt = get_entity_type(get_irg_entity(irg));
1006 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
1007 "Number of results for Return doesn't match number of results in type.", 0,
1008 show_return_nres(irg, n, mt););
1009 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
1010 ir_type *res_type = get_method_res_type(mt, i);
1012 if (get_irg_phase_state(irg) != phase_backend) {
1013 if (is_atomic_type(res_type)) {
1015 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
1016 "Mode of result for Return doesn't match mode of result type.", 0,
1017 show_return_modes(irg, n, mt, i);
1021 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
1022 "Mode of result for Return doesn't match mode of result type.", 0,
1023 show_return_modes(irg, n, mt, i);
1032 * verify a Raise node
1034 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1035 ir_mode *mymode = get_irn_mode(n);
1036 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1037 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1041 /* Sel: BB x M x ref --> X x M */
1042 op1mode == mode_M && mode_is_reference(op2mode) &&
1043 mymode == mode_T, "Raise node", 0
1049 * verify a Const node
1051 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1052 ir_mode *mymode = get_irn_mode(n);
1056 /* Const: BB --> data */
1057 (mode_is_data(mymode) ||
1058 mymode == mode_b) /* we want boolean constants for static evaluation */
1059 ,"Const node", 0 /* of Cmp. */
1062 /* the modes of the constant and teh tarval must match */
1063 mymode == get_tarval_mode(get_Const_tarval(n)),
1064 "Const node, tarval and node mode mismatch", 0
1070 * verify a SymConst node
1072 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1073 ir_mode *mymode = get_irn_mode(n);
1076 if (get_SymConst_kind(n) == symconst_addr_ent) {
1077 ir_entity *ent = get_SymConst_entity(n);
1078 if (is_Method_type(get_entity_type(ent)) &&
1079 get_irn_irg(n) != get_const_code_irg()) {
1081 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1082 "A constant must address an existing method.", 0);
1087 /* SymConst: BB --> int*/
1088 (mode_is_int(mymode) ||
1089 /* SymConst: BB --> ref */
1090 mode_is_reference(mymode))
1091 ,"SymConst node", 0);
1098 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1100 ir_mode *mymode = get_irn_mode(n);
1101 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1102 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1107 /* Sel: BB x M x ref x int^n --> ref */
1108 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1109 "Sel node", 0, show_node_failure(n)
1112 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1113 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1115 ent = get_Sel_entity(n);
1116 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1121 * verify an InstOf node
1123 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1124 ir_mode *mymode = get_irn_mode(n);
1125 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1128 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1129 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1134 * Check if the pinned state is right.
1136 static int verify_right_pinned(ir_node *n) {
1139 if (get_irn_pinned(n) == op_pin_state_pinned)
1141 mem = get_Call_mem(n);
1143 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1144 if (is_NoMem(mem) || is_Pin(mem))
1150 * verify a Call node
1152 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1153 ir_mode *mymode = get_irn_mode(n);
1154 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1155 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1160 /* Call: BB x M x ref x data1 x ... x datan
1161 --> M x datan+1 x ... x data n+m */
1162 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1164 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1165 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1167 mt = get_Call_type(n);
1168 if(get_unknown_type() == mt) {
1172 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1173 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1176 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1177 /* Compare arguments of node with those of type */
1179 if (get_method_variadicity(mt) == variadicity_variadic) {
1181 get_Call_n_params(n) >= get_method_n_params(mt),
1182 "Number of args for Call doesn't match number of args in variadic type.",
1184 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1185 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1189 get_Call_n_params(n) == get_method_n_params(mt),
1190 "Number of args for Call doesn't match number of args in non variadic type.",
1192 ir_fprintf(stderr, "Call %+F has %d params, method %s type %d\n",
1193 n, get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1197 for (i = 0; i < get_method_n_params(mt); i++) {
1198 ir_type *t = get_method_param_type(mt, i);
1200 if (get_irg_phase_state(irg) != phase_backend) {
1201 if (is_atomic_type(t)) {
1203 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1204 "Mode of arg for Call doesn't match mode of arg type.", 0,
1205 show_call_param(n, mt);
1208 /* call with a compound type, mode must be reference */
1210 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1211 "Mode of arg for Call doesn't match mode of arg type.", 0,
1212 show_call_param(n, mt);
1219 if (Call_has_callees(n)) {
1220 for (i = 0; i < get_Call_n_callees(n); i++) {
1221 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1229 * verify an Add node
1231 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1232 ir_mode *mymode = get_irn_mode(n);
1233 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1234 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1239 /* common Add: BB x numP x numP --> numP */
1240 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1241 /* Pointer Add: BB x ref x int --> ref */
1242 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1243 /* Pointer Add: BB x int x ref --> ref */
1244 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1247 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1248 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1249 "/* Pointer Add: BB x int x ref --> ref */");
1257 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1258 ir_mode *mymode = get_irn_mode(n);
1259 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1260 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1265 /* common Sub: BB x numP x numP --> numP */
1266 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1267 /* Pointer Sub: BB x ref x int --> ref */
1268 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1269 /* Pointer Sub: BB x ref x ref --> int */
1270 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1273 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1274 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1275 "/* Pointer Sub: BB x ref x ref --> int */" );
1281 * verify a Minus node
1283 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1284 ir_mode *mymode = get_irn_mode(n);
1285 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1289 /* Minus: BB x num --> num */
1290 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1291 show_unop_failure(n , "/* Minus: BB x num --> num */");
1299 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1300 ir_mode *mymode = get_irn_mode(n);
1301 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1302 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1307 /* Mul: BB x int_n x int_n --> int_n|int_2n */
1308 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode) &&
1309 (op1mode == mymode || get_mode_size_bits(op1mode) * 2 == get_mode_size_bits(mymode))) ||
1310 /* Mul: BB x float x float --> float */
1311 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1314 show_binop_failure(n, "/* Mul: BB x int_n x int_n --> int_n|int_2n */ |\n"
1315 "/* Mul: BB x float x float --> float */");
1321 * verify a Mulh node
1323 static int verify_node_Mulh(ir_node *n, ir_graph *irg) {
1324 ir_mode *mymode = get_irn_mode(n);
1325 ir_mode *op1mode = get_irn_mode(get_Mulh_left(n));
1326 ir_mode *op2mode = get_irn_mode(get_Mulh_right(n));
1331 /* Mulh: BB x int x int --> int */
1332 (mode_is_int(op1mode) && op2mode == op1mode && op1mode == mymode)
1335 show_binop_failure(n, "/* Mulh: BB x int x int --> int */");
1341 * verify a Quot node
1343 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1344 ir_mode *mymode = get_irn_mode(n);
1345 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1346 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1347 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1351 /* Quot: BB x M x float x float --> M x X x float */
1352 op1mode == mode_M && op2mode == op3mode &&
1353 get_mode_sort(op2mode) == irms_float_number &&
1356 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1362 * verify a DivMod node
1364 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1365 ir_mode *mymode = get_irn_mode(n);
1366 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1367 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1368 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1372 /* DivMod: BB x M x int x int --> M x X x int x int */
1373 op1mode == mode_M &&
1374 mode_is_int(op2mode) &&
1375 op3mode == op2mode &&
1385 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1386 ir_mode *mymode = get_irn_mode(n);
1387 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1388 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1389 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1393 /* Div: BB x M x int x int --> M x X x int */
1394 op1mode == mode_M &&
1395 op2mode == op3mode &&
1396 mode_is_int(op2mode) &&
1406 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1407 ir_mode *mymode = get_irn_mode(n);
1408 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1409 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1410 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1414 /* Mod: BB x M x int x int --> M x X x int */
1415 op1mode == mode_M &&
1416 op2mode == op3mode &&
1417 mode_is_int(op2mode) &&
1425 * verify an Abs node
1427 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1428 ir_mode *mymode = get_irn_mode(n);
1429 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1433 /* Abs: BB x num --> num */
1434 op1mode == mymode &&
1435 mode_is_num (op1mode),
1437 show_unop_failure(n, "/* Abs: BB x num --> num */");
1443 * verify a logical And, Or, Eor node
1445 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1446 ir_mode *mymode = get_irn_mode(n);
1447 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1448 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1452 /* And or Or or Eor: BB x int x int --> int */
1453 (mode_is_int(mymode) || mymode == mode_b) &&
1454 op2mode == op1mode &&
1456 "And, Or or Eor node", 0,
1457 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1462 #define verify_node_And verify_node_Logic
1463 #define verify_node_Or verify_node_Logic
1464 #define verify_node_Eor verify_node_Logic
1469 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1470 ir_mode *mymode = get_irn_mode(n);
1471 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1475 /* Not: BB x int --> int */
1476 (mode_is_int(mymode) || mymode == mode_b) &&
1479 show_unop_failure(n, "/* Not: BB x int --> int */");
1487 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1488 ir_mode *mymode = get_irn_mode(n);
1489 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1490 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1494 /* Cmp: BB x datab x datab --> b16 */
1495 mode_is_datab(op1mode) &&
1496 op2mode == op1mode &&
1499 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1505 * verify a Shift node
1507 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1508 ir_mode *mymode = get_irn_mode(n);
1509 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1510 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1514 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1515 mode_is_int(op1mode) &&
1516 mode_is_int(op2mode) &&
1517 !mode_is_signed(op2mode) &&
1519 "Shl, Shr or Shrs node", 0,
1520 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1525 #define verify_node_Shl verify_node_Shift
1526 #define verify_node_Shr verify_node_Shift
1527 #define verify_node_Shrs verify_node_Shift
1530 * verify a Rotl node
1532 static int verify_node_Rotl(ir_node *n, ir_graph *irg) {
1533 ir_mode *mymode = get_irn_mode(n);
1534 ir_mode *op1mode = get_irn_mode(get_Rotl_left(n));
1535 ir_mode *op2mode = get_irn_mode(get_Rotl_right(n));
1539 /* Rotl: BB x int x int --> int */
1540 mode_is_int(op1mode) &&
1541 mode_is_int(op2mode) &&
1544 show_binop_failure(n, "/* Rotl: BB x int x int --> int */");
1550 * verify a Conv node
1552 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1553 ir_mode *mymode = get_irn_mode(n);
1554 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1558 get_irg_phase_state(irg) == phase_backend ||
1559 (mode_is_datab(op1mode) && mode_is_data(mymode)),
1561 show_unop_failure(n, "/* Conv: BB x datab --> data */");
1567 * verify a Cast node
1569 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1570 ir_mode *mymode = get_irn_mode(n);
1571 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1575 /* Conv: BB x datab1 --> datab2 */
1576 mode_is_data(op1mode) && op1mode == mymode,
1578 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1586 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1587 ir_mode *mymode = get_irn_mode(n);
1588 ir_node *block = get_nodes_block(n);
1592 /* a Phi node MUST have the same number of inputs as its block
1593 * Exception is a phi with 0 inputs which is used when (re)constructing the
1595 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building && get_irn_arity(n) > 0) {
1597 get_irn_arity(n) == get_irn_arity(block),
1598 "wrong number of inputs in Phi node", 0,
1599 show_phi_inputs(n, block);
1603 /* Phi: BB x dataM^n --> dataM */
1604 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1605 ir_node *pred = get_Phi_pred(n, i);
1606 if (!is_Bad(pred)) {
1608 get_irn_mode(pred) == mymode,
1610 show_phi_failure(n, pred, i);
1614 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1616 if (mymode == mode_M) {
1617 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1619 ir_node *pred_i = get_Phi_pred(n, i);
1623 for (j = i - 1; j >= 0; --j) {
1624 ir_node *pred_j = get_Phi_pred(n, j);
1629 /* currently this checks fails for blocks with exception
1630 outputs (and these are NOT basic blocks). So it is disabled yet. */
1632 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1633 "At least two different PhiM predecessors are in the same block",
1635 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1645 * verify a Filter node
1647 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1650 #ifdef INTERPROCEDURAL_VIEW
1651 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1652 "Filter may only appear if ip view is constructed.", 0);
1654 /* We should further do tests as for Proj and Phi. */
1659 * verify a Load node
1661 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1662 ir_mode *mymode = get_irn_mode(n);
1663 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1664 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1666 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1667 if (get_irg_phase_state(irg) != phase_backend) {
1668 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1670 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1673 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1674 * (Proj (Proj))) sometimes ...
1676 * interprete.c:ai_eval seems to assume that this happens, too
1678 * obset.c:get_abstval_any can't deal with this if the load has
1682 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1683 assert ((NULL != ent) || (mymode != mode_T));
1691 * verify a Store node
1693 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1696 ir_mode *mymode = get_irn_mode(n);
1697 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1698 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1699 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1701 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1702 if (get_irg_phase_state(irg) != phase_backend) {
1703 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1705 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1707 target = get_ptr_entity(get_Store_ptr(n));
1708 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1710 * If lowered code, any Sels that add 0 may be removed, causing
1711 * an direct access to entities of array or compound type.
1712 * Prevent this by checking the phase.
1714 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1722 * verify an Alloc node
1724 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1725 ir_mode *mymode = get_irn_mode(n);
1726 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1727 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1731 /* Alloc: BB x M x int_u --> M x X x ref */
1732 op1mode == mode_M &&
1733 mode_is_int(op2mode) &&
1734 !mode_is_signed(op2mode) &&
1737 show_node_failure(n);
1743 * verify a Free node
1745 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1746 ir_mode *mymode = get_irn_mode(n);
1747 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1748 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1749 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1753 /* Free: BB x M x ref x int_u --> M */
1754 op1mode == mode_M && mode_is_reference(op2mode) &&
1755 mode_is_int(op3mode) &&
1756 !mode_is_signed(op3mode) &&
1759 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1765 * verify a Sync node
1767 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1769 ir_mode *mymode = get_irn_mode(n);
1772 /* Sync: BB x M^n --> M */
1773 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1774 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1776 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1781 * verify a Confirm node
1783 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1784 ir_mode *mymode = get_irn_mode(n);
1785 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1786 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1790 /* Confirm: BB x T x T --> T */
1791 op1mode == mymode &&
1794 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1802 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1803 ir_mode *mymode = get_irn_mode(n);
1804 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1805 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1806 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1810 /* Mux: BB x b x datab x datab --> datab */
1811 op1mode == mode_b &&
1812 op2mode == mymode &&
1813 op3mode == mymode &&
1814 mode_is_datab(mymode),
1821 * verify a CopyB node
1823 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1824 ir_mode *mymode = get_irn_mode(n);
1825 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1826 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1827 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1828 ir_type *t = get_CopyB_type(n);
1830 /* CopyB: BB x M x ref x ref --> M x X */
1831 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1832 if (get_irg_phase_state(irg) != phase_backend) {
1833 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1838 is_compound_type(t),
1839 "CopyB node should copy compound types only", 0 );
1841 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1842 This should happen RARELY, as CopyB COPIES MEMORY */
1843 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1848 * verify a Bound node
1850 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1851 ir_mode *mymode = get_irn_mode(n);
1852 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1853 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1854 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1855 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1858 /* Bound: BB x M x int x int x int --> M x X */
1861 op1mode == mode_M &&
1862 op2mode == op3mode &&
1863 op3mode == op4mode &&
1864 mode_is_int(op3mode),
1871 * For each usage of a node, it is checked, if the block of the
1872 * node dominates the block of the usage (for phis: the predecessor
1873 * block of the phi for the corresponding edge).
1875 * @return non-zero on success, 0 on dominance error
1877 static int check_dominance_for_node(ir_node *use) {
1878 if (is_Block(use)) {
1879 ir_node *mbh = get_Block_MacroBlock(use);
1882 /* must be a partBlock */
1883 if (is_Block(mbh)) {
1884 ASSERT_AND_RET(block_dominates(mbh, use), "MacroBlock header must dominate a partBlock", 0);
1888 /* This won't work for blocks and the end node */
1889 else if (use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1891 ir_node *bl = get_nodes_block(use);
1893 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1894 ir_node *def = get_irn_n(use, i);
1895 ir_node *def_bl = get_nodes_block(def);
1896 ir_node *use_bl = bl;
1898 /* ignore dead definition blocks, will be removed */
1899 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1903 use_bl = get_Block_cfgpred_block(bl, i);
1905 /* ignore dead use blocks, will be removed */
1906 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1910 block_dominates(def_bl, use_bl),
1911 "the definition of a value used violates the dominance property", 0,
1913 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1914 current_ir_graph, def_bl, def, use_bl, use, i
1922 /* Tests the modes of n and its predecessors. */
1923 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1927 if (!get_node_verification_mode())
1930 if (!get_interprocedural_view()) {
1932 * do NOT check placement in interprocedural view, as we don't always know
1933 * the "right" graph ...
1937 /* this seems to be an expensive check in VS compile (9% over all runtime),
1938 so do NOT run it in release mode */
1940 node_is_in_irgs_storage(irg, n),
1941 "Node is not stored on proper IR graph!", 0,
1942 show_node_on_graph(irg, n);
1945 assert(get_irn_irg(n) == irg);
1947 unsigned idx = get_irn_idx(n);
1948 ir_node *node_from_map = get_idx_irn(irg, idx);
1949 ASSERT_AND_RET_DBG(node_from_map == n, "Node index and index map entry differ", 0,
1950 ir_printf("node %+F node in map %+F(%p)\n", n, node_from_map, node_from_map));
1956 /* We don't want to test nodes whose predecessors are Bad,
1957 as we would have to special case that for each operation. */
1958 if (op != op_Phi && op != op_Block) {
1959 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1960 if (is_Bad(get_irn_n(n, i)))
1965 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1966 op_pin_state state = get_irn_pinned(n);
1968 state == op_pin_state_floats ||
1969 state == op_pin_state_pinned,
1970 "invalid pin state", 0,
1971 ir_printf("node %+F", n));
1974 if (op->ops.verify_node)
1975 return op->ops.verify_node(n, irg);
1981 int irn_vrfy(ir_node *n) {
1982 #ifdef DEBUG_libfirm
1983 return irn_vrfy_irg(n, current_ir_graph);
1990 /*-----------------------------------------------------------------*/
1991 /* Verify the whole graph. */
1992 /*-----------------------------------------------------------------*/
1994 #ifdef DEBUG_libfirm
1996 * Walker to check every node
1998 static void vrfy_wrap(ir_node *node, void *env) {
2000 *res = irn_vrfy(node);
2004 * Walker to check every node including SSA property.
2005 * Only called if dominance info is available.
2007 static void vrfy_wrap_ssa(ir_node *node, void *env) {
2010 *res = irn_vrfy(node);
2012 *res = check_dominance_for_node(node);
2016 #endif /* DEBUG_libfirm */
2019 * Calls irn_vrfy for each node in irg.
2020 * Graph must be in state "op_pin_state_pinned".
2021 * If dominance info is available, check the SSA property.
2023 int irg_verify(ir_graph *irg, unsigned flags) {
2025 #ifdef DEBUG_libfirm
2028 rem = current_ir_graph;
2029 current_ir_graph = irg;
2032 last_irg_error = NULL;
2035 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
2037 if (flags & VRFY_ENFORCE_SSA)
2042 get_irg_dom_state(irg) == dom_consistent &&
2043 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
2047 current_ir_graph = rem;
2049 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
2050 ir_entity *ent = get_irg_entity(current_ir_graph);
2053 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
2055 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
2060 #endif /* DEBUG_libfirm */
2066 ir_graph_pass_t pass;
2071 * Wrapper to irg_verify to be run as an ir_graph pass.
2073 static int irg_verify_wrapper(ir_graph *irg, void *context) {
2074 struct pass_t *pass = context;
2075 irg_verify(irg, pass->flags);
2076 /* do NOT rerun the pass if verify is ok :-) */
2080 /* Creates an ir_graph pass for irg_verify(). */
2081 ir_graph_pass_t *irg_verify_pass(const char *name, unsigned flags) {
2082 struct pass_t *pass = XMALLOCZ(struct pass_t);
2084 def_graph_pass_constructor(
2085 &pass->pass, name ? name : "irg_verify", irg_verify_wrapper);
2087 /* neither dump for verify */
2088 pass->pass.dump_irg = (DUMP_ON_IRG_FUNC)ir_prog_no_dump;
2089 pass->pass.verify_irg = (RUN_ON_IRG_FUNC)ir_prog_no_verify;
2091 pass->flags = flags;
2095 /* create a verify pass */
2096 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
2098 firm_verification_t old = get_node_verification_mode();
2100 firm_vrfy_failure_msg = NULL;
2101 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
2102 res = irn_vrfy_irg(n, irg);
2103 if (res && get_irg_dom_state(irg) == dom_consistent &&
2104 get_irg_pinned(irg) == op_pin_state_pinned)
2105 res = check_dominance_for_node(n);
2106 do_node_verification(old);
2107 *bad_string = firm_vrfy_failure_msg;
2113 typedef struct _vrfy_bad_env_t {
2119 * Pre-Walker: check Bad predecessors of node.
2121 static void check_bads(ir_node *node, void *env) {
2122 vrfy_bad_env_t *venv = env;
2123 int i, arity = get_irn_arity(node);
2125 if (is_Block(node)) {
2126 if ((venv->flags & BAD_CF) == 0) {
2128 /* check for Bad Block predecessor */
2129 for (i = 0; i < arity; ++i) {
2130 ir_node *pred = get_irn_n(node, i);
2133 venv->res |= BAD_CF;
2135 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2136 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2138 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2139 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2140 assert(0 && "Bad CF detected");
2146 if ((venv->flags & BAD_BLOCK) == 0) {
2148 /* check for Bad Block */
2149 if (is_Bad(get_nodes_block(node))) {
2150 venv->res |= BAD_BLOCK;
2152 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2153 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2155 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2156 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2157 assert(0 && "Bad CF detected");
2162 if ((venv->flags & TUPLE) == 0) {
2163 if (is_Tuple(node)) {
2166 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2167 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2169 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2170 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2171 assert(0 && "Tuple detected");
2176 for (i = 0; i < arity; ++i) {
2177 ir_node *pred = get_irn_n(node, i);
2180 /* check for Phi with Bad inputs */
2181 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2182 if (venv->flags & BAD_CF)
2185 venv->res |= BAD_CF;
2187 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2188 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2190 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2191 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2192 assert(0 && "Bad CF detected");
2197 /* Bad node input */
2198 if ((venv->flags & BAD_DF) == 0) {
2199 venv->res |= BAD_DF;
2201 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2202 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2204 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2205 dump_ir_block_graph_sched(current_ir_graph, "-assert");
2206 assert(0 && "Bad NON-CF detected");
2215 * verify occurrence of bad nodes
2217 int irg_vrfy_bads(ir_graph *irg, int flags) {
2223 irg_walk_graph(irg, check_bads, NULL, &env);
2229 * set the default verify operation
2231 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2234 ops->verify_node = verify_node_##a; \
2291 ops->verify_proj_node = verify_node_Proj_##a; \