2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
32 #include "irgraph_t.h"
42 /** if this flag is set, verify entity types in Load & Store nodes */
43 static int vrfy_entities = 0;
45 const char *firm_vrfy_failure_msg;
47 /* enable verification of Load/Store entities */
48 void vrfy_enable_entity_tests(int enable) {
49 vrfy_entities = enable;
53 * little helper for NULL modes
55 static const char *get_mode_name_ex(ir_mode *mode) {
58 return get_mode_name(mode);
61 /** the last IRG, on which a verify error was found */
62 static ir_graph *last_irg_error = NULL;
65 * print the name of the entity of an verification failure
67 static void show_entity_failure(ir_node *node) {
68 ir_graph *irg = get_irn_irg(node);
70 if (last_irg_error == irg)
75 if (irg == get_const_code_irg()) {
76 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
78 ir_entity *ent = get_irg_entity(irg);
81 ir_type *ent_type = get_entity_owner(ent);
84 if (ent_type == get_glob_type())
85 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
87 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
89 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
98 * Prints a failure for a Node
100 static void show_node_failure(ir_node *n) {
101 show_entity_failure(n);
102 fprintf(stderr, " node %ld %s%s\n" ,
104 get_irn_opname(n), get_irn_modename(n)
109 * Prints a failure message for a binop
111 static void show_binop_failure(ir_node *n, const char *text) {
112 ir_node *left = get_binop_left(n);
113 ir_node *right = get_binop_right(n);
115 show_entity_failure(n);
116 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
118 get_irn_opname(n), get_irn_modename(n),
119 get_irn_opname(left), get_irn_modename(left),
120 get_irn_opname(right), get_irn_modename(right),
125 * Prints a failure message for an unop
127 static void show_unop_failure(ir_node *n, const char *text) {
128 ir_node *op = get_unop_op(n);
130 show_entity_failure(n);
131 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
133 get_irn_opname(n), get_irn_modename(n),
134 get_irn_opname(op), get_irn_modename(op),
139 * Prints a failure message for an op with 3 operands
141 static void show_triop_failure(ir_node *n, const char *text) {
142 ir_node *op0 = get_irn_n(n, 0);
143 ir_node *op1 = get_irn_n(n, 1);
144 ir_node *op2 = get_irn_n(n, 2);
146 show_entity_failure(n);
147 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
149 get_irn_opname(n), get_irn_modename(n),
150 get_irn_opname(op0), get_irn_modename(op0),
151 get_irn_opname(op1), get_irn_modename(op1),
152 get_irn_opname(op2), get_irn_modename(op2),
157 * Prints a failure message for a proj
159 static void show_proj_failure(ir_node *n) {
160 ir_node *op = get_Proj_pred(n);
161 int proj = get_Proj_proj(n);
163 show_entity_failure(n);
164 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
166 get_irn_opname(n), get_irn_modename(n), proj,
167 get_irn_opname(op), get_irn_modename(op));
171 * Prints a failure message for a proj from Start
173 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
174 long proj = get_Proj_proj(n);
175 ir_mode *m = get_type_mode(ty);
177 show_entity_failure(n);
178 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
183 get_mode_name_ex(m));
187 * Prints a failure message for a proj
189 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
190 ir_node *op = get_Proj_pred(n);
191 int proj = get_Proj_proj(n);
192 ir_mode *m = get_type_mode(get_entity_type(ent));
194 show_entity_failure(n);
195 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
197 get_irn_opname(n), get_irn_modename(n), proj,
198 get_irn_opname(op), get_irn_modename(op),
199 get_entity_name(ent), get_type_name(get_entity_type(ent)),
200 get_mode_name_ex(m));
204 * Show a node and a graph
206 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
207 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
211 * Show call parameters
213 static void show_call_param(ir_node *n, ir_type *mt) {
216 show_entity_failure(n);
217 fprintf(stderr, " Call type-check failed: %s(", get_type_name(mt));
218 for (i = 0; i < get_method_n_params(mt); ++i) {
219 fprintf(stderr, "%s ", get_mode_name_ex(get_type_mode(get_method_param_type(mt, i))));
221 fprintf(stderr, ") != CALL(");
223 for (i = 0; i < get_Call_n_params(n); ++i) {
224 fprintf(stderr, "%s ", get_mode_name_ex(get_irn_mode(get_Call_param(n, i))));
226 fprintf(stderr, ")\n");
232 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
233 ir_entity *ent = get_irg_entity(irg);
235 show_entity_failure(n);
236 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
237 get_irn_node_nr(n), get_entity_name(ent),
238 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
239 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
244 * Show return number of results
246 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
247 ir_entity *ent = get_irg_entity(irg);
249 show_entity_failure(n);
250 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
251 get_irn_node_nr(n), get_entity_name(ent),
252 get_Return_n_ress(n), get_method_n_ress(mt));
258 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
260 show_entity_failure(phi);
261 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
262 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
263 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
269 static void show_phi_inputs(ir_node *phi, ir_node *block) {
270 show_entity_failure(phi);
271 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
272 get_irn_node_nr(phi), get_irn_arity(phi),
273 get_irn_node_nr(block), get_irn_arity(block));
276 /** If the address is Sel or SymConst, return the entity. */
277 static ir_entity *get_ptr_entity(ir_node *ptr) {
278 if (get_irn_op(ptr) == op_Sel) {
279 return get_Sel_entity(ptr);
280 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
281 return get_SymConst_entity(ptr);
287 * verify a Proj(Start) node
289 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
290 ir_mode *mode = get_irn_mode(p);
291 long proj = get_Proj_proj(p);
296 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
297 (proj == pn_Start_M && mode == mode_M) ||
298 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
299 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
300 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
301 (proj == pn_Start_T_args && mode == mode_T) ||
302 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
303 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
305 "wrong Proj from Start", 0,
306 show_proj_failure(p);
312 * verify a Proj(Cond) node
314 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
315 ir_mode *mode = get_irn_mode(p);
316 long proj = get_Proj_proj(p);
320 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
321 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
322 is_Bad(get_Cond_selector(pred)) /* rare */
324 "wrong Proj from Cond", 0,
325 show_proj_failure(p);
331 * verify a Proj(Raise) node
333 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
334 ir_mode *mode = get_irn_mode(p);
335 long proj = get_Proj_proj(p);
339 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
340 "wrong Proj from Raise", 0,
341 show_proj_failure(p);
347 * verify a Proj(InstOf) node
349 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
350 ir_mode *mode = get_irn_mode(p);
351 long proj = get_Proj_proj(p);
356 (proj == pn_InstOf_M_regular && mode == mode_M) ||
357 (proj == pn_InstOf_X_regular && mode == mode_X) ||
358 (proj == pn_InstOf_X_except && mode == mode_X) ||
359 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
360 (proj == pn_InstOf_M_except && mode == mode_M)
362 "wrong Proj from InstOf", 0,
363 show_proj_failure(p);
369 * verify a Proj(Call) node
371 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
372 ir_mode *mode = get_irn_mode(p);
373 long proj = get_Proj_proj(p);
377 (proj == pn_Call_M_regular && mode == mode_M) ||
378 (proj == pn_Call_X_regular && mode == mode_X) ||
379 (proj == pn_Call_X_except && mode == mode_X) ||
380 (proj == pn_Call_T_result && mode == mode_T) ||
381 (proj == pn_Call_M_except && mode == mode_M) ||
382 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
384 "wrong Proj from Call", 0,
385 show_proj_failure(p);
387 if (proj == pn_Call_X_regular)
389 get_irn_op(get_Call_mem(n)) != op_NoMem,
390 "Regular Proj from FunctionCall", 0);
391 else if (proj == pn_Call_X_except)
393 get_irn_op(get_Call_mem(n)) != op_NoMem,
394 "Exception Proj from FunctionCall", 0);
395 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
397 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
398 "Memory Proj from FunctionCall", 0);
403 * verify a Proj(Quot) node
405 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
406 ir_mode *mode = get_irn_mode(p);
407 long proj = get_Proj_proj(p);
411 (proj == pn_Quot_M && mode == mode_M) ||
412 (proj == pn_Quot_X_regular && mode == mode_X) ||
413 (proj == pn_Quot_X_except && mode == mode_X) ||
414 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
416 "wrong Proj from Quot", 0,
417 show_proj_failure(p);
419 if (proj == pn_Quot_X_regular)
421 get_irn_pinned(n) == op_pin_state_pinned,
422 "Regular Proj from unpinned Quot", 0);
423 else if (proj == pn_Quot_X_except)
425 get_irn_pinned(n) == op_pin_state_pinned,
426 "Exception Proj from unpinned Quot", 0);
427 else if (proj == pn_Quot_M)
429 get_irn_pinned(n) == op_pin_state_pinned,
430 "Memory Proj from unpinned Quot", 0);
435 * verify a Proj(DivMod) node
437 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
438 ir_mode *mode = get_irn_mode(p);
439 long proj = get_Proj_proj(p);
443 (proj == pn_DivMod_M && mode == mode_M) ||
444 (proj == pn_DivMod_X_regular && mode == mode_X) ||
445 (proj == pn_DivMod_X_except && mode == mode_X) ||
446 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
447 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
449 "wrong Proj from DivMod", 0,
450 show_proj_failure(p);
452 if (proj == pn_DivMod_X_regular)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Regular Proj from unpinned DivMod", 0);
456 else if (proj == pn_DivMod_X_except)
458 get_irn_pinned(n) == op_pin_state_pinned,
459 "Exception Proj from unpinned DivMod", 0);
460 else if (proj == pn_DivMod_M)
462 get_irn_pinned(n) == op_pin_state_pinned,
463 "Memory Proj from unpinned DivMod", 0);
468 * verify a Proj(Div) node
470 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
471 ir_mode *mode = get_irn_mode(p);
472 long proj = get_Proj_proj(p);
476 (proj == pn_Div_M && mode == mode_M) ||
477 (proj == pn_Div_X_regular && mode == mode_X) ||
478 (proj == pn_Div_X_except && mode == mode_X) ||
479 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
481 "wrong Proj from Div", 0,
482 show_proj_failure(p);
484 if (proj == pn_Div_X_regular)
486 get_irn_pinned(n) == op_pin_state_pinned,
487 "Regular Proj from unpinned Div", 0);
488 else if (proj == pn_Div_X_except)
490 get_irn_pinned(n) == op_pin_state_pinned,
491 "Exception Proj from unpinned Div", 0);
492 else if (proj == pn_Div_M)
494 get_irn_pinned(n) == op_pin_state_pinned,
495 "Memory Proj from unpinned Div", 0);
500 * verify a Proj(Mod) node
502 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
503 ir_mode *mode = get_irn_mode(p);
504 long proj = get_Proj_proj(p);
508 (proj == pn_Mod_M && mode == mode_M) ||
509 (proj == pn_Mod_X_regular && mode == mode_X) ||
510 (proj == pn_Mod_X_except && mode == mode_X) ||
511 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
513 "wrong Proj from Mod", 0,
514 show_proj_failure(p);
516 if (proj == pn_Mod_X_regular)
518 get_irn_pinned(n) == op_pin_state_pinned,
519 "Regular Proj from unpinned Mod", 0);
520 else if (proj == pn_Mod_X_except)
522 get_irn_pinned(n) == op_pin_state_pinned,
523 "Exception Proj from unpinned Mod", 0);
524 else if (proj == pn_Mod_M)
526 get_irn_pinned(n) == op_pin_state_pinned,
527 "Memory Proj from unpinned Div", 0);
532 * verify a Proj(Cmp) node
534 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
535 ir_mode *mode = get_irn_mode(p);
536 long proj = get_Proj_proj(p);
540 (proj >= 0 && proj <= 15 && mode == mode_b),
541 "wrong Proj from Cmp", 0,
542 show_proj_failure(p);
548 * verify a Proj(Load) node
550 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
551 ir_mode *mode = get_irn_mode(p);
552 long proj = get_Proj_proj(p);
554 if (proj == pn_Load_res) {
555 ir_node *ptr = get_Load_ptr(n);
556 ir_entity *ent = get_ptr_entity(ptr);
558 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
559 /* do NOT check this for lowered phases, see comment on Store */
561 (mode == get_type_mode(get_entity_type(ent))),
562 "wrong data Proj from Load, entity type_mode failed", 0,
563 show_proj_failure_ent(p, ent);
568 mode_is_data(mode) && mode == get_Load_mode(n),
569 "wrong data Proj from Load", 0,
570 show_proj_failure(p);
577 (proj == pn_Load_M && mode == mode_M) ||
578 (proj == pn_Load_X_regular && mode == mode_X) ||
579 (proj == pn_Load_X_except && mode == mode_X)
581 "wrong Proj from Load", 0,
582 show_proj_failure(p);
585 if (proj == pn_Load_X_regular) {
587 get_irn_pinned(n) == op_pin_state_pinned,
588 "Regular Proj from unpinned Load", 0);
589 } else if (proj == pn_Load_X_except) {
591 get_irn_pinned(n) == op_pin_state_pinned,
592 "Exception Proj from unpinned Load", 0);
598 * verify a Proj(Store) node
600 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
601 ir_mode *mode = get_irn_mode(p);
602 long proj = get_Proj_proj(p);
606 (proj == pn_Store_M && mode == mode_M) ||
607 (proj == pn_Store_X_regular && mode == mode_X) ||
608 (proj == pn_Store_X_except && mode == mode_X)
610 "wrong Proj from Store", 0,
611 show_proj_failure(p);
613 if (proj == pn_Store_X_regular) {
615 get_irn_pinned(n) == op_pin_state_pinned,
616 "Regular Proj from unpinned Store", 0);
617 } else if (proj == pn_Store_X_except) {
619 get_irn_pinned(n) == op_pin_state_pinned,
620 "Exception Proj from unpinned Store", 0);
626 * verify a Proj(Alloc) node
628 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
629 ir_mode *mode = get_irn_mode(p);
630 long proj = get_Proj_proj(p);
635 (proj == pn_Alloc_M && mode == mode_M) ||
636 (proj == pn_Alloc_X_regular && mode == mode_X) ||
637 (proj == pn_Alloc_X_except && mode == mode_X) ||
638 (proj == pn_Alloc_res && mode_is_reference(mode))
640 "wrong Proj from Alloc", 0,
641 show_proj_failure(p);
647 * verify a Proj(Proj) node
649 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
650 ir_mode *mode = get_irn_mode(p);
651 long proj = get_Proj_proj(p);
652 long nr = get_Proj_proj(pred);
653 ir_type *mt; /* A method type */
655 pred = skip_Id(get_Proj_pred(pred));
656 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
658 switch (get_irn_opcode(pred)) {
660 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
662 if (nr == pn_Start_T_args) {
664 (proj >= 0 && mode_is_datab(mode)),
665 "wrong Proj from Proj from Start", 0);
667 (proj < get_method_n_params(mt)),
668 "More Projs for args than args in type", 0
670 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
671 /* value argument */ break;
674 (mode == get_type_mode(get_method_param_type(mt, proj))),
675 "Mode of Proj from Start doesn't match mode of param type.", 0,
676 show_proj_mode_failure(p, get_method_param_type(mt, proj));
678 } else if (nr == pn_Start_P_value_arg_base) {
680 (proj >= 0 && mode_is_reference(mode)),
681 "wrong Proj from Proj from Start", 0
684 (proj < get_method_n_params(mt)),
685 "More Projs for args than args in type", 0
693 (proj >= 0 && mode_is_datab(mode)),
694 "wrong Proj from Proj from Call", 0);
695 mt = get_Call_type(pred);
697 (proj < get_method_n_ress(mt)),
698 "More Projs for results than results in type.", 0);
699 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
700 /* value result */ break;
703 (mode == get_type_mode(get_method_res_type(mt, proj))),
704 "Mode of Proj from Call doesn't match mode of result type.", 0);
713 /* hmm, optimization did not remove it */
717 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
724 * verify a Proj(Tuple) node
726 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
734 * verify a Proj(CallBegin) node
736 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
743 * verify a Proj(EndReg) node
745 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
749 (get_irp_ip_view_state() != ip_view_no),
750 "EndReg may only appear if ip view is constructed.", 0);
755 * verify a Proj(EndExcept) node
757 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
761 (get_irp_ip_view_state() != ip_view_no),
762 "EndExcept may only appear if ip view is constructed.", 0);
767 * verify a Proj(CopyB) node
769 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
770 ir_mode *mode = get_irn_mode(p);
771 long proj = get_Proj_proj(p);
775 (proj == pn_CopyB_M_regular && mode == mode_M) ||
776 (proj == pn_CopyB_X_regular && mode == mode_X) ||
777 (proj == pn_CopyB_X_except && mode == mode_X) ||
778 (proj == pn_CopyB_M_except && mode == mode_M)
780 "wrong Proj from CopyB", 0,
781 show_proj_failure(p);
783 if (proj == pn_CopyB_X_regular)
785 get_irn_pinned(n) == op_pin_state_pinned,
786 "Regular Proj from unpinned CopyB", 0);
787 else if (proj == pn_CopyB_X_except)
789 get_irn_pinned(n) == op_pin_state_pinned,
790 "Exception Proj from unpinned CopyB", 0);
795 * verify a Proj(Bound) node
797 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
798 ir_mode *mode = get_irn_mode(p);
799 long proj = get_Proj_proj(p);
801 /* ignore Bound checks of Bad */
802 if (is_Bad(get_Bound_index(n)))
806 (proj == pn_Bound_M && mode == mode_M) ||
807 (proj == pn_Bound_X_regular && mode == mode_X) ||
808 (proj == pn_Bound_X_except && mode == mode_X) ||
809 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
811 "wrong Proj from Bound", 0,
812 show_proj_failure(p);
821 verify_node_Proj(ir_node *p, ir_graph *irg) {
826 pred = skip_Id(get_Proj_pred(p));
827 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
829 op = get_irn_op(pred);
831 if (op->ops.verify_proj_node)
832 return op->ops.verify_proj_node(pred, p);
839 * verify a Block node
841 static int verify_node_Block(ir_node *n, ir_graph *irg) {
844 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
845 ir_node *pred = get_Block_cfgpred(n, i);
850 (get_irn_mode(pred) == mode_X)
855 /* End block may only have Return, Raise or fragile ops as preds. */
856 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
857 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
858 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
859 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
860 break; /* We can not test properly. How many tuples are there? */
865 (get_irn_op(pred) == op_Raise) ||
868 "End Block node", 0);
870 /* irg attr must == graph we are in. */
871 if (! get_interprocedural_view()) {
872 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
878 * verify a Start node
880 static int verify_node_Start(ir_node *n, ir_graph *irg) {
881 ir_mode *mymode = get_irn_mode(n);
885 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
886 mymode == mode_T, "Start node", 0
894 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
895 ir_mode *mymode = get_irn_mode(n);
900 mymode == mode_X, "Jmp node", 0
906 * verify an IJmp node
908 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
909 ir_mode *mymode = get_irn_mode(n);
910 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
914 /* IJmp: BB x ref --> X */
915 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
921 * verify a Break node
923 static int verify_node_Break(ir_node *n, ir_graph *irg) {
924 ir_mode *mymode = get_irn_mode(n);
927 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
928 "Break may only appear if ip view is constructed.", 0);
931 mymode == mode_X, "Break node", 0
939 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
940 ir_mode *mymode = get_irn_mode(n);
941 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
945 /* Cond: BB x b --> X x X */
946 (op1mode == mode_b ||
947 /* Cond: BB x int --> X^n */
948 mode_is_int(op1mode) ), "Cond node", 0
950 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
956 * verify a Return node
958 static int verify_node_Return(ir_node *n, ir_graph *irg) {
960 ir_mode *mymode = get_irn_mode(n);
961 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
964 /* Return: BB x M x data1 x ... x datan --> X */
966 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
968 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
969 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
971 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
972 /* Compare returned results with result types of method type */
973 mt = get_entity_type(get_irg_entity(irg));
974 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
975 "Number of results for Return doesn't match number of results in type.", 0,
976 show_return_nres(irg, n, mt););
977 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
978 ir_type *res_type = get_method_res_type(mt, i);
980 if (is_atomic_type(res_type)) {
982 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
983 "Mode of result for Return doesn't match mode of result type.", 0,
984 show_return_modes(irg, n, mt, i);
988 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
989 "Mode of result for Return doesn't match mode of result type.", 0,
990 show_return_modes(irg, n, mt, i);
998 * verify a Raise node
1000 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
1001 ir_mode *mymode = get_irn_mode(n);
1002 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
1003 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
1007 /* Sel: BB x M x ref --> X x M */
1008 op1mode == mode_M && mode_is_reference(op2mode) &&
1009 mymode == mode_T, "Raise node", 0
1015 * verify a Const node
1017 static int verify_node_Const(ir_node *n, ir_graph *irg) {
1018 ir_mode *mymode = get_irn_mode(n);
1022 /* Const: BB --> data */
1023 (mode_is_data(mymode) ||
1024 mymode == mode_b) /* we want boolean constants for static evaluation */
1025 ,"Const node", 0 /* of Cmp. */
1028 /* the modes of the constant and teh tarval must match */
1029 mymode == get_tarval_mode(get_Const_tarval(n)),
1030 "Const node, tarval and node mode mismatch", 0
1036 * verify a SymConst node
1038 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1039 ir_mode *mymode = get_irn_mode(n);
1042 if (get_SymConst_kind(n) == symconst_addr_ent) {
1043 ir_entity *ent = get_SymConst_entity(n);
1044 if (is_Method_type(get_entity_type(ent)) &&
1045 get_irn_irg(n) != get_const_code_irg()) {
1047 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1048 "A constant must address an existing method.", 0);
1053 /* SymConst: BB --> int*/
1054 (mode_is_int(mymode) ||
1055 /* SymConst: BB --> ref */
1056 mode_is_reference(mymode))
1057 ,"SymConst node", 0);
1064 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1066 ir_mode *mymode = get_irn_mode(n);
1067 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1068 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1073 /* Sel: BB x M x ref x int^n --> ref */
1074 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1075 "Sel node", 0, show_node_failure(n)
1078 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1079 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1081 ent = get_Sel_entity(n);
1082 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1087 * verify an InstOf node
1089 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1090 ir_mode *mymode = get_irn_mode(n);
1091 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1094 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1095 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1100 * Check if the pinned state is right.
1102 static int verify_right_pinned(ir_node *n) {
1105 if (get_irn_pinned(n) == op_pin_state_pinned)
1107 mem = get_Call_mem(n);
1109 /* if it's not pinned, its memory predecessor must be NoMem or Pin */
1110 if (is_NoMem(mem) || is_Pin(mem))
1116 * verify a Call node
1118 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1119 ir_mode *mymode = get_irn_mode(n);
1120 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1121 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1126 /* Call: BB x M x ref x data1 x ... x datan
1127 --> M x datan+1 x ... x data n+m */
1128 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1130 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1131 ASSERT_AND_RET(verify_right_pinned(n),"Call node with wrong memory input", 0 );
1133 mt = get_Call_type(n);
1134 if(get_unknown_type() == mt) {
1138 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1139 ASSERT_AND_RET( mode_is_datab(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1142 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1143 /* Compare arguments of node with those of type */
1145 if (get_method_variadicity(mt) == variadicity_variadic) {
1147 get_Call_n_params(n) >= get_method_n_params(mt),
1148 "Number of args for Call doesn't match number of args in variadic type.",
1150 fprintf(stderr, "Call has %d params, method %s type %d\n",
1151 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1155 get_Call_n_params(n) == get_method_n_params(mt),
1156 "Number of args for Call doesn't match number of args in non variadic type.",
1160 for (i = 0; i < get_method_n_params(mt); i++) {
1161 ir_type *t = get_method_param_type(mt, i);
1163 if (is_atomic_type(t)) {
1165 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1166 "Mode of arg for Call doesn't match mode of arg type.", 0,
1167 show_call_param(n, mt);
1170 /* call with a compound type, mode must be reference */
1172 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1173 "Mode of arg for Call doesn't match mode of arg type.", 0,
1174 show_call_param(n, mt);
1180 if (Call_has_callees(n)) {
1181 for (i = 0; i < get_Call_n_callees(n); i++) {
1182 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1190 * verify an Add node
1192 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1193 ir_mode *mymode = get_irn_mode(n);
1194 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1195 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1200 /* common Add: BB x numP x numP --> numP */
1201 (op1mode == mymode && op2mode == op1mode && mode_is_data(mymode)) ||
1202 /* Pointer Add: BB x ref x int --> ref */
1203 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1204 /* Pointer Add: BB x int x ref --> ref */
1205 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1208 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1209 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1210 "/* Pointer Add: BB x int x ref --> ref */");
1218 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1219 ir_mode *mymode = get_irn_mode(n);
1220 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1221 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1226 /* common Sub: BB x numP x numP --> numP */
1227 (mymode ==op1mode && mymode == op2mode && mode_is_data(op1mode)) ||
1228 /* Pointer Sub: BB x ref x int --> ref */
1229 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1230 /* Pointer Sub: BB x int x ref --> ref */
1231 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1232 /* Pointer Sub: BB x ref x ref --> int */
1233 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1236 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1237 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1238 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1239 "/* Pointer Sub: BB x ref x ref --> int */" );
1245 * verify a Minus node
1247 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1248 ir_mode *mymode = get_irn_mode(n);
1249 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1253 /* Minus: BB x num --> num */
1254 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1255 show_unop_failure(n , "/* Minus: BB x num --> num */");
1263 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1264 ir_mode *mymode = get_irn_mode(n);
1265 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1266 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1271 /* Mul: BB x int1 x int1 --> int2 */
1272 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1273 /* Mul: BB x float x float --> float */
1274 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1277 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1278 "/* Mul: BB x float x float --> float */");
1284 * verify a Quot node
1286 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1287 ir_mode *mymode = get_irn_mode(n);
1288 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1289 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1290 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1294 /* Quot: BB x M x float x float --> M x X x float */
1295 op1mode == mode_M && op2mode == op3mode &&
1296 get_mode_sort(op2mode) == irms_float_number &&
1299 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1305 * verify a DivMod node
1307 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1308 ir_mode *mymode = get_irn_mode(n);
1309 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1310 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1311 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1315 /* DivMod: BB x M x int x int --> M x X x int x int */
1316 op1mode == mode_M &&
1317 mode_is_int(op2mode) &&
1318 op3mode == op2mode &&
1328 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1329 ir_mode *mymode = get_irn_mode(n);
1330 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1331 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1332 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1336 /* Div: BB x M x int x int --> M x X x int */
1337 op1mode == mode_M &&
1338 op2mode == op3mode &&
1339 mode_is_int(op2mode) &&
1349 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1350 ir_mode *mymode = get_irn_mode(n);
1351 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1352 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1353 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1357 /* Mod: BB x M x int x int --> M x X x int */
1358 op1mode == mode_M &&
1359 op2mode == op3mode &&
1360 mode_is_int(op2mode) &&
1368 * verify an Abs node
1370 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1371 ir_mode *mymode = get_irn_mode(n);
1372 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1376 /* Abs: BB x num --> num */
1377 op1mode == mymode &&
1378 mode_is_num (op1mode),
1380 show_unop_failure(n, "/* Abs: BB x num --> num */");
1386 * verify a logical And, Or, Eor node
1388 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1389 ir_mode *mymode = get_irn_mode(n);
1390 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1391 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1395 /* And or Or or Eor: BB x int x int --> int */
1396 (mode_is_int(mymode) || mymode == mode_b) &&
1397 op2mode == op1mode &&
1399 "And, Or or Eor node", 0,
1400 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1405 #define verify_node_And verify_node_Logic
1406 #define verify_node_Or verify_node_Logic
1407 #define verify_node_Eor verify_node_Logic
1412 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1413 ir_mode *mymode = get_irn_mode(n);
1414 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1418 /* Not: BB x int --> int */
1419 (mode_is_int(mymode) || mymode == mode_b) &&
1422 show_unop_failure(n, "/* Not: BB x int --> int */");
1430 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1431 ir_mode *mymode = get_irn_mode(n);
1432 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1433 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1437 /* Cmp: BB x datab x datab --> b16 */
1438 mode_is_data (op1mode) &&
1439 op2mode == op1mode &&
1442 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1448 * verify a Shift node
1450 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1451 ir_mode *mymode = get_irn_mode(n);
1452 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1453 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1457 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1458 mode_is_int(op1mode) &&
1459 mode_is_int(op2mode) &&
1460 !mode_is_signed(op2mode) &&
1462 "Shl, Shr or Shrs node", 0,
1463 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1468 #define verify_node_Shl verify_node_Shift
1469 #define verify_node_Shr verify_node_Shift
1470 #define verify_node_Shrs verify_node_Shift
1475 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1476 ir_mode *mymode = get_irn_mode(n);
1477 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1478 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1482 /* Rot: BB x int x int --> int */
1483 mode_is_int(op1mode) &&
1484 mode_is_int(op2mode) &&
1487 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1493 * verify a Conv node
1495 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1496 ir_mode *mymode = get_irn_mode(n);
1497 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1501 /* Conv: BB x datab1 --> datab2 */
1502 mode_is_datab(op1mode) && mode_is_datab(mymode),
1504 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1510 * verify a Cast node
1512 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1513 ir_mode *mymode = get_irn_mode(n);
1514 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1518 /* Conv: BB x datab1 --> datab2 */
1519 mode_is_data(op1mode) && op1mode == mymode,
1521 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1529 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1530 ir_mode *mymode = get_irn_mode(n);
1531 ir_node *block = get_nodes_block(n);
1535 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1536 /* a Phi node MUST have the same number of inputs as its block */
1538 get_irn_arity(n) == get_irn_arity(block),
1539 "wrong number of inputs in Phi node", 0,
1540 show_phi_inputs(n, block);
1544 /* Phi: BB x dataM^n --> dataM */
1545 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1546 ir_node *pred = get_irn_n(n, i);
1547 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown)) {
1549 get_irn_mode(pred) == mymode,
1551 show_phi_failure(n, pred, i);
1555 ASSERT_AND_RET(mode_is_dataM(mymode) || mymode == mode_b, "Phi node", 0 );
1557 if (mymode == mode_M) {
1558 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1560 ir_node *pred_i = get_Phi_pred(n, i);
1564 for (j = i - 1; j >= 0; --j) {
1565 ir_node *pred_j = get_Phi_pred(n, j);
1570 /* currently this checks fails for blocks with exception
1571 outputs (and these are NOT basic blocks). So it is disabled yet. */
1573 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1574 "At least two different PhiM predecessors are in the same block",
1576 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1586 * verify a Filter node
1588 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1591 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1592 "Filter may only appear if ip view is constructed.", 0);
1593 /* We should further do tests as for Proj and Phi. */
1598 * verify a Load node
1600 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1601 ir_mode *mymode = get_irn_mode(n);
1602 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1603 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1605 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1606 if (get_irg_phase_state(irg) != phase_backend) {
1607 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1609 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1610 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1612 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1615 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1616 * (Proj (Proj))) sometimes ...
1618 * interprete.c:ai_eval seems to assume that this happens, too
1620 * obset.c:get_abstval_any can't deal with this if the load has
1624 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1625 assert ((NULL != ent) || (mymode != mode_T));
1633 * verify a Store node
1635 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1638 ir_mode *mymode = get_irn_mode(n);
1639 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1640 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1641 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1643 ASSERT_AND_RET(op1mode == mode_M && mode_is_datab(op3mode), "Store node", 0 );
1644 if (get_irg_phase_state(irg) != phase_backend) {
1645 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1647 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1648 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1650 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1652 target = get_ptr_entity(get_Store_ptr(n));
1653 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1655 * If lowered code, any Sels that add 0 may be removed, causing
1656 * an direct access to entities of array or compound type.
1657 * Prevent this by checking the phase.
1659 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1667 * verify an Alloc node
1669 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1670 ir_mode *mymode = get_irn_mode(n);
1671 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1672 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1676 /* Alloc: BB x M x int_u --> M x X x ref */
1677 op1mode == mode_M &&
1678 mode_is_int(op2mode) &&
1679 !mode_is_signed(op2mode) &&
1682 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1688 * verify a Free node
1690 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1691 ir_mode *mymode = get_irn_mode(n);
1692 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1693 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1694 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1698 /* Free: BB x M x ref x int_u --> M */
1699 op1mode == mode_M && mode_is_reference(op2mode) &&
1700 mode_is_int(op3mode) &&
1701 !mode_is_signed(op3mode) &&
1704 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1710 * verify a Sync node
1712 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1714 ir_mode *mymode = get_irn_mode(n);
1717 /* Sync: BB x M^n --> M */
1718 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1719 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1721 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1726 * verify a Confirm node
1728 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1729 ir_mode *mymode = get_irn_mode(n);
1730 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1731 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1735 /* Confirm: BB x T x T --> T */
1736 op1mode == mymode &&
1739 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1747 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1748 ir_mode *mymode = get_irn_mode(n);
1749 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1750 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1751 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1755 /* Mux: BB x b x numP x numP --> numP */
1756 op1mode == mode_b &&
1757 op2mode == mymode &&
1758 op3mode == mymode &&
1759 mode_is_data(mymode),
1766 * verify a CopyB node
1768 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1769 ir_mode *mymode = get_irn_mode(n);
1770 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1771 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1772 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1773 ir_type *t = get_CopyB_type(n);
1775 /* CopyB: BB x M x ref x ref --> M x X */
1776 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1777 if (get_irg_phase_state(irg) != phase_backend) {
1778 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1781 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1782 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1783 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1784 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1788 is_compound_type(t),
1789 "CopyB node should copy compound types only", 0 );
1791 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1792 This should happen RARELY, as CopyB COPIES MEMORY */
1793 ASSERT_AND_RET(verify_right_pinned(n), "CopyB node with wrong memory input", 0 );
1798 * verify a Bound node
1800 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1801 ir_mode *mymode = get_irn_mode(n);
1802 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1803 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1804 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1805 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1808 /* Bound: BB x M x int x int x int --> M x X */
1811 op1mode == mode_M &&
1812 op2mode == op3mode &&
1813 op3mode == op4mode &&
1814 mode_is_int(op3mode),
1821 * For each usage of a node, it is checked, if the block of the
1822 * node dominates the block of the usage (for phis: the predecessor
1823 * block of the phi for the corresponding edge).
1825 * @return non-zero on success, 0 on dominance error
1827 static int check_dominance_for_node(ir_node *use) {
1828 /* This won't work for blocks and the end node */
1829 if (!is_Block(use) && use != get_irg_end(current_ir_graph) && use != current_ir_graph->anchor) {
1831 ir_node *bl = get_nodes_block(use);
1833 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1834 ir_node *def = get_irn_n(use, i);
1835 ir_node *def_bl = get_nodes_block(def);
1836 ir_node *use_bl = bl;
1838 /* ignore dead definition blocks, will be removed */
1839 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1843 use_bl = get_Block_cfgpred_block(bl, i);
1845 /* ignore dead use blocks, will be removed */
1846 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1850 block_dominates(def_bl, use_bl),
1851 "the definition of a value used violates the dominance property", 0,
1853 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1854 current_ir_graph, def_bl, def, use_bl, use, i
1862 /* Tests the modes of n and its predecessors. */
1863 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1867 if (!get_node_verification_mode())
1870 if (!get_interprocedural_view()) {
1872 * do NOT check placement in interprocedural view, as we don't always know
1873 * the "right" graph ...
1876 node_is_in_irgs_storage(irg, n),
1877 "Node is not stored on proper IR graph!", 0,
1878 show_node_on_graph(irg, n);
1880 assert(get_irn_irg(n) == irg);
1882 unsigned idx = get_irn_idx(n);
1883 ir_node *node_from_map = get_idx_irn(irg, idx);
1884 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));
1890 /* We don't want to test nodes whose predecessors are Bad,
1891 as we would have to special case that for each operation. */
1892 if (op != op_Phi && op != op_Block) {
1893 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1894 if (is_Bad(get_irn_n(n, i)))
1899 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1900 op_pin_state state = get_irn_pinned(n);
1902 state == op_pin_state_floats ||
1903 state == op_pin_state_pinned,
1904 "invalid pin state", 0,
1905 ir_printf("node %+F", n));
1908 if (op->ops.verify_node)
1909 return op->ops.verify_node(n, irg);
1915 int irn_vrfy(ir_node *n) {
1917 #ifdef DEBUG_libfirm
1918 res = irn_vrfy_irg(n, current_ir_graph);
1923 /*-----------------------------------------------------------------*/
1924 /* Verify the whole graph. */
1925 /*-----------------------------------------------------------------*/
1927 #ifdef DEBUG_libfirm
1929 * Walker to check every node
1931 static void vrfy_wrap(ir_node *node, void *env) {
1933 *res = irn_vrfy(node);
1937 * Walker to check every node including SSA property.
1938 * Only called if dominance info is available.
1940 static void vrfy_wrap_ssa(ir_node *node, void *env) {
1943 *res = irn_vrfy(node);
1945 *res = check_dominance_for_node(node);
1949 #endif /* DEBUG_libfirm */
1952 * Calls irn_vrfy for each node in irg.
1953 * Graph must be in state "op_pin_state_pinned".
1954 * If dominance info is available, check the SSA property.
1956 int irg_verify(ir_graph *irg, unsigned flags) {
1958 #ifdef DEBUG_libfirm
1961 rem = current_ir_graph;
1962 current_ir_graph = irg;
1963 last_irg_error = NULL;
1965 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1967 if (flags & VRFY_ENFORCE_SSA)
1972 get_irg_dom_state(irg) == dom_consistent &&
1973 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
1977 current_ir_graph = rem;
1979 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1980 ir_entity *ent = get_irg_entity(current_ir_graph);
1983 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1985 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1987 #endif /* DEBUG_libfirm */
1992 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
1994 firm_verification_t old = get_node_verification_mode();
1996 firm_vrfy_failure_msg = NULL;
1997 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1998 res = irn_vrfy_irg(n, irg);
1999 if (res && get_irg_dom_state(irg) == dom_consistent &&
2000 get_irg_pinned(irg) == op_pin_state_pinned)
2001 res = check_dominance_for_node(n);
2002 do_node_verification(old);
2003 *bad_string = firm_vrfy_failure_msg;
2009 typedef struct _vrfy_bad_env_t {
2015 * Pre-Walker: check Bad predecessors of node.
2017 static void check_bads(ir_node *node, void *env) {
2018 vrfy_bad_env_t *venv = env;
2019 int i, arity = get_irn_arity(node);
2021 if (is_Block(node)) {
2022 if ((venv->flags & BAD_CF) == 0) {
2024 /* check for Bad Block predecessor */
2025 for (i = 0; i < arity; ++i) {
2026 ir_node *pred = get_irn_n(node, i);
2029 venv->res |= BAD_CF;
2031 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2032 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
2034 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2035 dump_ir_block_graph(current_ir_graph, "-assert");
2036 assert(0 && "Bad CF detected");
2042 if ((venv->flags & BAD_BLOCK) == 0) {
2044 /* check for Bad Block */
2045 if (is_Bad(get_nodes_block(node))) {
2046 venv->res |= BAD_BLOCK;
2048 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2049 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
2051 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2052 dump_ir_block_graph(current_ir_graph, "-assert");
2053 assert(0 && "Bad CF detected");
2058 if ((venv->flags & TUPLE) == 0) {
2059 if (get_irn_op(node) == op_Tuple) {
2062 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2063 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2065 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2066 dump_ir_block_graph(current_ir_graph, "-assert");
2067 assert(0 && "Tuple detected");
2072 for (i = 0; i < arity; ++i) {
2073 ir_node *pred = get_irn_n(node, i);
2076 /* check for Phi with Bad inputs */
2077 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2078 if (venv->flags & BAD_CF)
2081 venv->res |= BAD_CF;
2083 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2084 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2086 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2087 dump_ir_block_graph(current_ir_graph, "-assert");
2088 assert(0 && "Bad CF detected");
2093 /* Bad node input */
2094 if ((venv->flags & BAD_DF) == 0) {
2095 venv->res |= BAD_DF;
2097 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2098 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2100 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2101 dump_ir_block_graph(current_ir_graph, "-assert");
2102 assert(0 && "Bad NON-CF detected");
2111 * verify occurrence of bad nodes
2113 int irg_vrfy_bads(ir_graph *irg, int flags) {
2119 irg_walk_graph(irg, check_bads, NULL, &env);
2125 * set the default verify operation
2127 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2130 ops->verify_node = verify_node_##a; \
2186 ops->verify_proj_node = verify_node_Proj_##a; \