3 * File name: ir/ir/irvrfy.c
4 * Purpose: Check irnodes for correctness.
5 * Author: Christian Schaefer
6 * Modified by: Goetz Lindenmaier. Till Riedel. Michael Beck.
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
19 #include "irgraph_t.h"
29 /** if this flag is set, verify entity types in Load & Store nodes */
30 static int vrfy_entities = 0;
32 const char *firm_vrfy_failure_msg;
34 /* enable verification of Load/Store entities */
35 void vrfy_enable_entity_tests(int enable) {
36 vrfy_entities = enable;
40 * little helper for NULL modes
42 static const char *get_mode_name_ex(ir_mode *mode) {
45 return get_mode_name(mode);
48 /** the last IRG, on which a verify error was found */
49 static ir_graph *last_irg_error = NULL;
52 * print the name of the entity of an verification failure
54 static void show_entity_failure(ir_node *node)
56 ir_graph *irg = get_irn_irg(node);
58 if (last_irg_error == irg)
63 if (irg == get_const_code_irg()) {
64 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
67 entity *ent = get_irg_entity(irg);
70 ir_type *ent_type = get_entity_owner(ent);
73 if (ent_type == get_glob_type())
74 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
76 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
79 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
83 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
89 * Prints a failure for a Node
91 static void show_node_failure(ir_node *n)
93 show_entity_failure(n);
94 fprintf(stderr, " node %ld %s%s\n" ,
96 get_irn_opname(n), get_irn_modename(n)
101 * Prints a failure message for a binop
103 static void show_binop_failure(ir_node *n, const char *text)
105 ir_node *left = get_binop_left(n);
106 ir_node *right = get_binop_right(n);
108 show_entity_failure(n);
109 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
111 get_irn_opname(n), get_irn_modename(n),
112 get_irn_opname(left), get_irn_modename(left),
113 get_irn_opname(right), get_irn_modename(right),
118 * Prints a failure message for an unop
120 static void show_unop_failure(ir_node *n, const char *text)
122 ir_node *op = get_unop_op(n);
124 show_entity_failure(n);
125 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
127 get_irn_opname(n), get_irn_modename(n),
128 get_irn_opname(op), get_irn_modename(op),
133 * Prints a failure message for an op with 3 operands
135 static void show_triop_failure(ir_node *n, const char *text)
137 ir_node *op0 = get_irn_n(n, 0);
138 ir_node *op1 = get_irn_n(n, 1);
139 ir_node *op2 = get_irn_n(n, 2);
141 show_entity_failure(n);
142 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
144 get_irn_opname(n), get_irn_modename(n),
145 get_irn_opname(op0), get_irn_modename(op0),
146 get_irn_opname(op1), get_irn_modename(op1),
147 get_irn_opname(op2), get_irn_modename(op2),
152 * Prints a failure message for a proj
154 static void show_proj_failure(ir_node *n)
156 ir_node *op = get_Proj_pred(n);
157 int proj = get_Proj_proj(n);
159 show_entity_failure(n);
160 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
162 get_irn_opname(n), get_irn_modename(n), proj,
163 get_irn_opname(op), get_irn_modename(op));
167 * Prints a failure message for a proj from Start
169 static void show_proj_mode_failure(ir_node *n, ir_type *ty)
171 long proj = get_Proj_proj(n);
172 ir_mode *m = get_type_mode(ty);
174 show_entity_failure(n);
175 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
180 get_mode_name_ex(m));
184 * Prints a failure message for a proj
186 static void show_proj_failure_ent(ir_node *n, entity *ent)
188 ir_node *op = get_Proj_pred(n);
189 int proj = get_Proj_proj(n);
190 ir_mode *m = get_type_mode(get_entity_type(ent));
192 show_entity_failure(n);
193 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
195 get_irn_opname(n), get_irn_modename(n), proj,
196 get_irn_opname(op), get_irn_modename(op),
197 get_entity_name(ent), get_type_name(get_entity_type(ent)),
198 get_mode_name_ex(m));
202 * Show a node and a graph
204 static void show_node_on_graph(ir_graph *irg, ir_node *n)
206 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
210 * Show call parameters
212 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");
233 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i)
235 entity *ent = get_irg_entity(irg);
237 show_entity_failure(n);
238 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
239 get_irn_node_nr(n), get_entity_name(ent),
240 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
241 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
246 * Show return number of results
248 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt)
250 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)
274 show_entity_failure(phi);
275 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
276 get_irn_node_nr(phi), get_irn_arity(phi),
277 get_irn_node_nr(block), get_irn_arity(block));
280 /** If the address is Sel or SymConst, return the entity. */
281 static entity *get_ptr_entity(ir_node *ptr) {
282 if (get_irn_op(ptr) == op_Sel) {
283 return get_Sel_entity(ptr);
284 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
285 return get_SymConst_entity(ptr);
291 * verify a Proj(Start) node
293 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
294 ir_mode *mode = get_irn_mode(p);
295 long proj = get_Proj_proj(p);
299 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
300 (proj == pn_Start_M && mode == mode_M) ||
301 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
302 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
303 (proj == pn_Start_T_args && mode == mode_T) ||
304 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
305 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
307 "wrong Proj from Start", 0,
308 show_proj_failure(p);
314 * verify a Proj(Cond) node
316 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
317 ir_mode *mode = get_irn_mode(p);
318 long proj = get_Proj_proj(p);
322 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
323 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
324 is_Bad(get_Cond_selector(pred)) /* rare */
326 "wrong Proj from Cond", 0,
327 show_proj_failure(p);
333 * verify a Proj(Raise) node
335 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
336 ir_mode *mode = get_irn_mode(p);
337 long proj = get_Proj_proj(p);
340 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
341 "wrong Proj from Raise", 0,
342 show_proj_failure(p);
348 * verify a Proj(InstOf) node
350 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
351 ir_mode *mode = get_irn_mode(p);
352 long proj = get_Proj_proj(p);
355 (proj >= 0 && mode == mode_X),
356 "wrong Proj from InstOf", 0,
357 show_proj_failure(p);
363 * verify a Proj(Call) node
365 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
366 ir_mode *mode = get_irn_mode(p);
367 long proj = get_Proj_proj(p);
370 ((proj == pn_Call_M_regular && mode == mode_M) ||
371 (proj == pn_Call_X_except && mode == mode_X) ||
372 (proj == pn_Call_T_result && mode == mode_T) ||
373 (proj == pn_Call_M_except && mode == mode_M) ||
374 (proj == pn_Call_P_value_res_base && mode == mode_P)),
375 "wrong Proj from Call", 0,
376 show_proj_failure(p);
378 if (proj == pn_Call_X_except)
380 get_irn_op(get_Call_mem(n)) != op_NoMem,
381 "Exception Proj from FunctionCall", 0);
382 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
384 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
385 "Memory Proj from FunctionCall", 0);
390 * verify a Proj(Quot) node
392 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
393 ir_mode *mode = get_irn_mode(p);
394 long proj = get_Proj_proj(p);
397 ((proj == pn_Quot_M && mode == mode_M) ||
398 (proj == pn_Quot_X_except && mode == mode_X) ||
399 (proj == pn_Quot_res && mode_is_float(mode))),
400 "wrong Proj from Quot", 0,
401 show_proj_failure(p);
403 if (proj == pn_Quot_X_except)
405 get_irn_pinned(n) == op_pin_state_pinned,
406 "Exception Proj from unpinned Quot", 0);
407 else if (proj == pn_Quot_M)
409 get_irn_pinned(n) == op_pin_state_pinned,
410 "Memory Proj from unpinned Quot", 0);
415 * verify a Proj(DivMod) node
417 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
418 ir_mode *mode = get_irn_mode(p);
419 long proj = get_Proj_proj(p);
422 ((proj == pn_DivMod_M && mode == mode_M) ||
423 (proj == pn_DivMod_X_except && mode == mode_X) ||
424 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
425 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
426 "wrong Proj from DivMod", 0,
427 show_proj_failure(p);
429 if (proj == pn_DivMod_X_except)
431 get_irn_pinned(n) == op_pin_state_pinned,
432 "Exception Proj from unpinned DivMod", 0);
433 else if (proj == pn_DivMod_M)
435 get_irn_pinned(n) == op_pin_state_pinned,
436 "Memory Proj from unpinned DivMod", 0);
441 * verify a Proj(Div) node
443 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
444 ir_mode *mode = get_irn_mode(p);
445 long proj = get_Proj_proj(p);
448 ((proj == pn_Div_M && mode == mode_M) ||
449 (proj == pn_Div_X_except && mode == mode_X) ||
450 (proj == pn_Div_res && mode_is_int(mode))),
451 "wrong Proj from Div", 0,
452 show_proj_failure(p);
454 if (proj == pn_Div_X_except)
456 get_irn_pinned(n) == op_pin_state_pinned,
457 "Exception Proj from unpinned Div", 0);
458 else if (proj == pn_Div_M)
460 get_irn_pinned(n) == op_pin_state_pinned,
461 "Memory Proj from unpinned Div", 0);
466 * verify a Proj(Mod) node
468 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
469 ir_mode *mode = get_irn_mode(p);
470 long proj = get_Proj_proj(p);
473 ((proj == pn_Mod_M && mode == mode_M) ||
474 (proj == pn_Mod_X_except && mode == mode_X) ||
475 (proj == pn_Mod_res && mode_is_int(mode))),
476 "wrong Proj from Mod", 0,
477 show_proj_failure(p);
479 if (proj == pn_Mod_X_except)
481 get_irn_pinned(n) == op_pin_state_pinned,
482 "Exception Proj from unpinned Mod", 0);
483 else if (proj == pn_Mod_M)
485 get_irn_pinned(n) == op_pin_state_pinned,
486 "Memory Proj from unpinned Div", 0);
491 * verify a Proj(Cmp) node
493 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
494 ir_mode *mode = get_irn_mode(p);
495 long proj = get_Proj_proj(p);
498 (proj >= 0 && proj <= 15 && mode == mode_b),
499 "wrong Proj from Cmp", 0,
500 show_proj_failure(p);
506 * verify a Proj(Load) node
508 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
509 ir_mode *mode = get_irn_mode(p);
510 long proj = get_Proj_proj(p);
512 if (proj == pn_Load_res) {
513 ir_node *ptr = get_Load_ptr(n);
514 entity *ent = get_ptr_entity(ptr);
516 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
517 /* do NOT check this for lowered phases, see comment on Store */
519 (mode == get_type_mode(get_entity_type(ent))),
520 "wrong data Proj from Load, entity type_mode failed", 0,
521 show_proj_failure_ent(p, ent);
526 mode_is_data(mode) && mode == get_Load_mode(n),
527 "wrong data Proj from Load", 0,
528 show_proj_failure(p);
534 ((proj == pn_Load_M && mode == mode_M) ||
535 (proj == pn_Load_X_except && mode == mode_X)),
536 "wrong Proj from Load", 0,
537 show_proj_failure(p);
540 if (proj == pn_Load_X_except)
542 get_irn_pinned(n) == op_pin_state_pinned,
543 "Exception Proj from unpinned Load", 0);
548 * verify a Proj(Store) node
550 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
551 ir_mode *mode = get_irn_mode(p);
552 long proj = get_Proj_proj(p);
555 ((proj == pn_Store_M && mode == mode_M) ||
556 (proj == pn_Store_X_except && mode == mode_X)),
557 "wrong Proj from Store", 0,
558 show_proj_failure(p);
560 if (proj == pn_Store_X_except)
562 get_irn_pinned(n) == op_pin_state_pinned,
563 "Exception Proj from unpinned Store", 0);
568 * verify a Proj(Alloc) node
570 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
571 ir_mode *mode = get_irn_mode(p);
572 long proj = get_Proj_proj(p);
576 (proj == pn_Alloc_M && mode == mode_M) ||
577 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
578 (proj == pn_Alloc_res && mode_is_reference(mode))
580 "wrong Proj from Alloc", 0,
581 show_proj_failure(p);
587 * verify a Proj(Proj) node
589 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
590 ir_mode *mode = get_irn_mode(p);
591 long proj = get_Proj_proj(p);
592 long nr = get_Proj_proj(pred);
593 ir_type *mt; /* A method type */
595 pred = skip_Id(get_Proj_pred(pred));
596 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
598 switch (get_irn_opcode(pred)) {
600 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
602 if (nr == pn_Start_T_args) {
604 (proj >= 0 && mode_is_data(mode)),
605 "wrong Proj from Proj from Start", 0);
607 (proj < get_method_n_params(mt)),
608 "More Projs for args than args in type", 0
610 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
611 /* value argument */ break;
614 (mode == get_type_mode(get_method_param_type(mt, proj))),
615 "Mode of Proj from Start doesn't match mode of param type.", 0,
616 show_proj_mode_failure(p, get_method_param_type(mt, proj));
619 else if (nr == pn_Start_P_value_arg_base) {
621 (proj >= 0 && mode_is_reference(mode)),
622 "wrong Proj from Proj from Start", 0
625 (proj < get_method_n_params(mt)),
626 "More Projs for args than args in type", 0
634 (proj >= 0 && mode_is_data(mode)),
635 "wrong Proj from Proj from Call", 0);
636 mt = get_Call_type(pred);
638 (proj < get_method_n_ress(mt)),
639 "More Projs for results than results in type.", 0);
640 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
641 /* value result */ break;
644 (mode == get_type_mode(get_method_res_type(mt, proj))),
645 "Mode of Proj from Call doesn't match mode of result type.", 0);
654 /* hmm, optimization did not remove it */
658 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
665 * verify a Proj(Tuple) node
667 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
673 * verify a Proj(CallBegin) node
675 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
680 * verify a Proj(EndReg) node
682 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
683 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
684 "EndReg may only appear if ip view is constructed.", 0);
689 * verify a Proj(EndExcept) node
691 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
692 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
693 "EndExcept may only appear if ip view is constructed.", 0);
698 * verify a Proj(CopyB) node
700 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
701 ir_mode *mode = get_irn_mode(p);
702 long proj = get_Proj_proj(p);
705 ((proj == pn_CopyB_M && mode == mode_M) ||
706 (proj == pn_CopyB_X_except && mode == mode_X)),
707 "wrong Proj from CopyB", 0,
708 show_proj_failure(p);
710 if (proj == pn_CopyB_X_except)
712 get_irn_pinned(n) == op_pin_state_pinned,
713 "Exception Proj from unpinned CopyB", 0);
718 * verify a Proj(Bound) node
720 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
721 ir_mode *mode = get_irn_mode(p);
722 long proj = get_Proj_proj(p);
725 ((proj == pn_Bound_M && mode == mode_M) ||
726 (proj == pn_Bound_X_except && mode == mode_X) ||
727 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))),
728 "wrong Proj from Bound", 0,
729 show_proj_failure(p);
731 if (proj == pn_Bound_X_except)
733 get_irn_pinned(n) == op_pin_state_pinned,
734 "Exception Proj from unpinned Bound", 0);
742 verify_node_Proj(ir_node *p, ir_graph *irg) {
746 pred = skip_Id(get_Proj_pred(p));
747 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
749 op = get_irn_op(pred);
751 if (op->ops.verify_proj_node)
752 return op->ops.verify_proj_node(pred, p);
759 * verify a Block node
761 static int verify_node_Block(ir_node *n, ir_graph *irg) {
764 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
765 ir_node *pred = get_Block_cfgpred(n, i);
769 (get_irn_mode(pred) == mode_X)
773 /* End block may only have Return, Raise or fragile ops as preds. */
774 if (n == get_irg_end_block(irg))
775 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
776 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
777 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
778 break; /* We can not test properly. How many tuples are there? */
779 ASSERT_AND_RET((is_Return(pred) ||
781 (get_irn_op(pred) == op_Raise) ||
782 is_fragile_op(pred) ),
783 "End Block node", 0);
785 /* irg attr must == graph we are in. */
786 if (! get_interprocedural_view()) {
787 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
793 * verify a Start node
795 static int verify_node_Start(ir_node *n, ir_graph *irg) {
796 ir_mode *mymode = get_irn_mode(n);
799 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
800 mymode == mode_T, "Start node", 0
808 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
809 ir_mode *mymode = get_irn_mode(n);
813 mymode == mode_X, "Jmp node", 0
819 * verify an IJmp node
821 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
822 ir_mode *mymode = get_irn_mode(n);
823 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
826 /* IJmp: BB x ref --> X */
827 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
833 * verify a Break node
835 static int verify_node_Break(ir_node *n, ir_graph *irg) {
836 ir_mode *mymode = get_irn_mode(n);
838 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
839 "Break may only appear if ip view is constructed.", 0);
842 mymode == mode_X, "Break node", 0
850 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
851 ir_mode *mymode = get_irn_mode(n);
852 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
855 /* Cond: BB x b --> X x X */
856 (op1mode == mode_b ||
857 /* Cond: BB x int --> X^n */
858 mode_is_int(op1mode) ), "Cond node", 0
860 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
866 * verify a Return node
868 static int verify_node_Return(ir_node *n, ir_graph *irg) {
870 ir_mode *mymode = get_irn_mode(n);
871 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
874 /* Return: BB x M x data1 x ... x datan --> X */
876 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
878 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
879 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
881 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
882 /* Compare returned results with result types of method type */
883 mt = get_entity_type(get_irg_entity(irg));
884 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
885 "Number of results for Return doesn't match number of results in type.", 0,
886 show_return_nres(irg, n, mt););
887 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
888 ir_type *res_type = get_method_res_type(mt, i);
890 if (is_atomic_type(res_type)) {
892 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
893 "Mode of result for Return doesn't match mode of result type.", 0,
894 show_return_modes(irg, n, mt, i);
899 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
900 "Mode of result for Return doesn't match mode of result type.", 0,
901 show_return_modes(irg, n, mt, i);
909 * verify a Raise node
911 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
912 ir_mode *mymode = get_irn_mode(n);
913 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
914 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
917 /* Sel: BB x M x ref --> X x M */
918 op1mode == mode_M && mode_is_reference(op2mode) &&
919 mymode == mode_T, "Raise node", 0
925 * verify a Const node
927 static int verify_node_Const(ir_node *n, ir_graph *irg) {
928 ir_mode *mymode = get_irn_mode(n);
931 /* Const: BB --> data */
932 (mode_is_data(mymode) ||
933 mymode == mode_b) /* we want boolean constants for static evaluation */
934 ,"Const node", 0 /* of Cmp. */
937 /* the modes of the constant and teh tarval must match */
938 mymode == get_tarval_mode(get_Const_tarval(n)),
939 "Const node, tarval and node mode mismatch", 0
945 * verify a SymConst node
947 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
948 ir_mode *mymode = get_irn_mode(n);
950 if (get_SymConst_kind(n) == symconst_addr_ent) {
951 entity *ent = get_SymConst_entity(n);
952 if (is_Method_type(get_entity_type(ent)) &&
953 get_irn_irg(n) != get_const_code_irg()) {
955 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
956 "A constant must address an existing method.", 0);
961 /* SymConst: BB --> int*/
962 (mode_is_int(mymode) ||
963 /* SymConst: BB --> ref */
964 mode_is_reference(mymode))
965 ,"SymConst node", 0);
972 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
974 ir_mode *mymode = get_irn_mode(n);
975 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
976 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
980 /* Sel: BB x M x ref x int^n --> ref */
981 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
982 "Sel node", 0, show_node_failure(n)
985 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
986 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
988 ent = get_Sel_entity(n);
989 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
994 * verify an InstOf node
996 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
997 ir_mode *mymode = get_irn_mode(n);
998 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1000 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1001 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1006 * verify a Call node
1008 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1009 ir_mode *mymode = get_irn_mode(n);
1010 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1011 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1015 /* Call: BB x M x ref x data1 x ... x datan
1016 --> M x datan+1 x ... x data n+m */
1017 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1019 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1021 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
1022 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1023 "Call node with wrong memory input", 0 );
1025 mt = get_Call_type(n);
1026 if(get_unknown_type() == mt) {
1030 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1031 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1034 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1035 /* Compare arguments of node with those of type */
1037 if (get_method_variadicity(mt) == variadicity_variadic) {
1039 get_Call_n_params(n) >= get_method_n_params(mt),
1040 "Number of args for Call doesn't match number of args in variadic type.",
1042 fprintf(stderr, "Call has %d params, method %s type %d\n",
1043 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1048 get_Call_n_params(n) == get_method_n_params(mt),
1049 "Number of args for Call doesn't match number of args in non variadic type.",
1053 for (i = 0; i < get_method_n_params(mt); i++) {
1054 ir_type *t = get_method_param_type(mt, i);
1056 if (is_atomic_type(t)) {
1058 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1059 "Mode of arg for Call doesn't match mode of arg type.", 0,
1060 show_call_param(n, mt);
1064 /* call with a compound type, mode must be reference */
1066 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1067 "Mode of arg for Call doesn't match mode of arg type.", 0,
1068 show_call_param(n, mt);
1074 if (Call_has_callees(n)) {
1075 for (i = 0; i < get_Call_n_callees(n); i++) {
1076 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1084 * verify an Add node
1086 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1087 ir_mode *mymode = get_irn_mode(n);
1088 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1089 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1093 /* common Add: BB x numP x numP --> numP */
1094 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1095 /* Pointer Add: BB x ref x int --> ref */
1096 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1097 /* Pointer Add: BB x int x ref --> ref */
1098 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1101 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1102 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1103 "/* Pointer Add: BB x int x ref --> ref */");
1111 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1112 ir_mode *mymode = get_irn_mode(n);
1113 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1114 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1117 /* common Sub: BB x numP x numP --> numP */
1118 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1119 /* Pointer Sub: BB x ref x int --> ref */
1120 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1121 /* Pointer Sub: BB x int x ref --> ref */
1122 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1123 /* Pointer Sub: BB x ref x ref --> int */
1124 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1126 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1127 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1128 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1129 "/* Pointer Sub: BB x ref x ref --> int */" );
1135 * verify a Minus node
1137 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1138 ir_mode *mymode = get_irn_mode(n);
1139 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1142 /* Minus: BB x num --> num */
1143 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1144 show_unop_failure(n , "/* Minus: BB x num --> num */");
1152 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1153 ir_mode *mymode = get_irn_mode(n);
1154 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1155 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1158 /* Mul: BB x int1 x int1 --> int2 */
1159 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1160 /* Mul: BB x float x float --> float */
1161 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1163 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1164 "/* Mul: BB x float x float --> float */");
1170 * verify a Quot node
1172 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1173 ir_mode *mymode = get_irn_mode(n);
1174 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1175 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1176 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1179 /* Quot: BB x M x float x float --> M x X x float */
1180 op1mode == mode_M && op2mode == op3mode &&
1181 get_mode_sort(op2mode) == irms_float_number &&
1184 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1190 * verify a DivMod node
1192 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1193 ir_mode *mymode = get_irn_mode(n);
1194 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1195 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1196 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1199 /* DivMod: BB x M x int x int --> M x X x int x int */
1200 op1mode == mode_M &&
1201 mode_is_int(op2mode) &&
1202 op3mode == op2mode &&
1212 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1213 ir_mode *mymode = get_irn_mode(n);
1214 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1215 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1216 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1219 /* Div: BB x M x int x int --> M x X x int */
1220 op1mode == mode_M &&
1221 op2mode == op3mode &&
1222 mode_is_int(op2mode) &&
1232 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1233 ir_mode *mymode = get_irn_mode(n);
1234 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1235 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1236 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1239 /* Mod: BB x M x int x int --> M x X x int */
1240 op1mode == mode_M &&
1241 op2mode == op3mode &&
1242 mode_is_int(op2mode) &&
1250 * verify an Abs node
1252 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1253 ir_mode *mymode = get_irn_mode(n);
1254 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1257 /* Abs: BB x num --> num */
1258 op1mode == mymode &&
1259 mode_is_num (op1mode),
1261 show_unop_failure(n, "/* Abs: BB x num --> num */");
1267 * verify a logical And, Or, Eor node
1269 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1270 ir_mode *mymode = get_irn_mode(n);
1271 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1272 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1275 /* And or Or or Eor: BB x int x int --> int */
1276 mode_is_int(mymode) &&
1277 op2mode == op1mode &&
1279 "And, Or or Eor node", 0,
1280 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1285 #define verify_node_And verify_node_Logic
1286 #define verify_node_Or verify_node_Logic
1287 #define verify_node_Eor verify_node_Logic
1292 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1293 ir_mode *mymode = get_irn_mode(n);
1294 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1297 /* Not: BB x int --> int */
1298 mode_is_int(mymode) &&
1301 show_unop_failure(n, "/* Not: BB x int --> int */");
1309 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1310 ir_mode *mymode = get_irn_mode(n);
1311 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1312 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1315 /* Cmp: BB x datab x datab --> b16 */
1316 mode_is_data (op1mode) &&
1317 op2mode == op1mode &&
1320 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1326 * verify a Shift node
1328 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1329 ir_mode *mymode = get_irn_mode(n);
1330 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1331 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1334 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1335 mode_is_int(op1mode) &&
1336 mode_is_int(op2mode) &&
1337 !mode_is_signed(op2mode) &&
1339 "Shl, Shr or Shrs node", 0,
1340 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1345 #define verify_node_Shl verify_node_Shift
1346 #define verify_node_Shr verify_node_Shift
1347 #define verify_node_Shrs verify_node_Shift
1352 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1353 ir_mode *mymode = get_irn_mode(n);
1354 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1355 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1358 /* Rot: BB x int x int --> int */
1359 mode_is_int(op1mode) &&
1360 mode_is_int(op2mode) &&
1363 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1369 * verify a Conv node
1371 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1372 ir_mode *mymode = get_irn_mode(n);
1373 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1376 /* Conv: BB x datab1 --> datab2 */
1377 mode_is_datab(op1mode) && mode_is_data(mymode),
1379 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1385 * verify a Cast node
1387 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1388 ir_mode *mymode = get_irn_mode(n);
1389 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1392 /* Conv: BB x datab1 --> datab2 */
1393 mode_is_data(op1mode) && op1mode == mymode,
1395 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1403 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1404 ir_mode *mymode = get_irn_mode(n);
1405 ir_node *block = get_nodes_block(n);
1408 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1409 /* a Phi node MUST have the same number of inputs as its block */
1411 get_irn_arity(n) == get_irn_arity(block),
1412 "wrong number of inputs in Phi node", 0,
1413 show_phi_inputs(n, block);
1417 /* Phi: BB x dataM^n --> dataM */
1418 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1419 ir_node *pred = get_irn_n(n, i);
1420 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1422 get_irn_mode(pred) == mymode,
1424 show_phi_failure(n, pred, i);
1427 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1432 * verify a Filter node
1434 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1435 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1436 "Filter may only appear if ip view is constructed.", 0);
1437 /* We should further do tests as for Proj and Phi. */
1442 * verify a Load node
1444 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1445 ir_mode *mymode = get_irn_mode(n);
1446 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1447 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1450 /* Load: BB x M x ref --> M x X x data */
1451 op1mode == mode_M && mode_is_reference(op2mode),
1454 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1457 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1458 * (Proj (Proj))) sometimes ...
1460 * interprete.c:ai_eval seems to assume that this happens, too
1462 * obset.c:get_abstval_any can't deal with this if the load has
1466 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1467 assert ((NULL != ent) || (mymode != mode_T));
1475 * verify a Store node
1477 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1480 ir_mode *mymode = get_irn_mode(n);
1481 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1482 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1483 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1486 /* Store: BB x M x ref x data --> M x X */
1487 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1490 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1492 target = get_ptr_entity(get_Store_ptr(n));
1493 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1495 * If lowered code, any Sels that add 0 may be removed, causing
1496 * an direct access to entities of array or compound type.
1497 * Prevent this by checking the phase.
1499 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1507 * verify an Alloc node
1509 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1510 ir_mode *mymode = get_irn_mode(n);
1511 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1512 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1515 /* Alloc: BB x M x int_u --> M x X x ref */
1516 op1mode == mode_M &&
1517 mode_is_int(op2mode) &&
1518 !mode_is_signed(op2mode) &&
1521 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1527 * verify a Free node
1529 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1530 ir_mode *mymode = get_irn_mode(n);
1531 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1532 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1533 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1536 /* Free: BB x M x ref x int_u --> M */
1537 op1mode == mode_M && mode_is_reference(op2mode) &&
1538 mode_is_int(op3mode) &&
1539 !mode_is_signed(op3mode) &&
1542 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1548 * verify a Sync node
1550 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1552 ir_mode *mymode = get_irn_mode(n);
1554 /* Sync: BB x M^n --> M */
1555 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1556 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1558 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1563 * verify a Confirm node
1565 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1566 ir_mode *mymode = get_irn_mode(n);
1567 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1568 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1571 /* Confirm: BB x T x T --> T */
1572 op1mode == mymode &&
1575 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1583 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1584 ir_mode *mymode = get_irn_mode(n);
1585 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1586 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1587 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1590 /* Mux: BB x b x numP x numP --> numP */
1591 op1mode == mode_b &&
1592 op2mode == mymode &&
1593 op3mode == mymode &&
1594 mode_is_numP(mymode),
1601 * verify a CopyB node
1603 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1604 ir_mode *mymode = get_irn_mode(n);
1605 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1606 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1607 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1608 ir_type *t = get_CopyB_type(n);
1610 /* CopyB: BB x M x ref x ref --> M x X */
1613 op1mode == mode_M &&
1614 mode_is_reference(op2mode) &&
1615 mode_is_reference(op3mode),
1616 "CopyB node", 0 ); /* operand M x ref x ref */
1619 is_compound_type(t),
1620 "CopyB node should copy compound types only", 0 );
1622 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1623 This should happen RARELY, as CopyB COPIES MEMORY */
1625 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1626 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1627 "CopyB node with wrong memory input", 0 );
1632 * verify a Bound node
1634 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1635 ir_mode *mymode = get_irn_mode(n);
1636 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1637 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1638 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1639 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1641 /* Bound: BB x M x ref x ref --> M x X */
1644 op1mode == mode_M &&
1645 op2mode == op3mode &&
1646 op3mode == op4mode &&
1647 mode_is_int(op3mode),
1648 "Bound node", 0 ); /* operand M x int x int x int */
1650 /* NoMem nodes are only allowed as memory input if the Bound is NOT pinned.
1651 This should happen RARELY, as Bound COPIES MEMORY */
1653 (get_irn_op(get_Bound_mem(n)) == op_NoMem) ||
1654 (get_irn_op(get_Bound_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1655 "Bound node with wrong memory input", 0 );
1661 * For each usage of a node, it is checked, if the block of the
1662 * node dominates the block of the usage (for phis: the predecessor
1663 * block of the phi for the corresponding edge).
1665 static int check_dominance_for_node(ir_node *use)
1667 /* This won't work for blocks and the end node */
1668 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1670 ir_node *bl = get_nodes_block(use);
1672 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1673 ir_node *def = get_irn_n(use, i);
1674 ir_node *def_bl = get_nodes_block(def);
1675 ir_node *use_bl = bl;
1677 /* ignore dead definition blocks, will be removed */
1678 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1682 use_bl = get_Block_cfgpred_block(bl, i);
1684 /* ignore dead use blocks, will be removed */
1685 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1689 block_dominates(def_bl, use_bl),
1690 "the definition of a value used violates the dominance property", 0,
1692 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1693 current_ir_graph, def_bl, def, use_bl, use, i
1701 /* Tests the modes of n and its predecessors. */
1702 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1707 if (!get_node_verification_mode())
1710 if (!get_interprocedural_view()) {
1712 * do NOT check placement in interprocedural view, as we don't always know
1713 * the "right" graph ...
1716 node_is_in_irgs_storage(irg, n),
1717 "Node is not stored on proper IR graph!", 0,
1718 show_node_on_graph(irg, n);
1720 assert(get_irn_irg(n) == irg);
1725 /* We don't want to test nodes whose predecessors are Bad,
1726 as we would have to special case that for each operation. */
1727 if (op != op_Phi && op != op_Block)
1728 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1729 if (is_Bad(get_irn_n(n, i)))
1733 if (op->ops.verify_node)
1734 return op->ops.verify_node(n, irg);
1740 int irn_vrfy(ir_node *n)
1743 #ifdef DEBUG_libfirm
1744 res = irn_vrfy_irg(n, current_ir_graph);
1749 /*-----------------------------------------------------------------*/
1750 /* Verify the whole graph. */
1751 /*-----------------------------------------------------------------*/
1753 #ifdef DEBUG_libfirm
1755 * Walker to check every node
1757 static void vrfy_wrap(ir_node *node, void *env) {
1759 *res = irn_vrfy(node);
1763 * Walker to check every node including SSA property.
1764 * Only called if dominance info is available.
1766 static void vrfy_wrap_ssa(ir_node *node, void *env)
1770 *res = irn_vrfy(node);
1772 *res = check_dominance_for_node(node);
1775 #endif /* DEBUG_libfirm */
1778 * Calls irn_vrfy for each node in irg.
1779 * Graph must be in state "op_pin_state_pinned".
1780 * If dominance info is available, check the SSA property.
1782 int irg_verify(ir_graph *irg, unsigned flags)
1785 #ifdef DEBUG_libfirm
1788 rem = current_ir_graph;
1789 current_ir_graph = irg;
1790 last_irg_error = NULL;
1792 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1794 if (flags & VRFY_ENFORCE_SSA)
1799 get_irg_dom_state(irg) == dom_consistent &&
1800 get_irg_pinned(irg) == op_pin_state_pinned ?
1801 vrfy_wrap_ssa : vrfy_wrap,
1805 current_ir_graph = rem;
1807 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1808 entity *ent = get_irg_entity(current_ir_graph);
1811 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1813 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1815 #endif /* DEBUG_libfirm */
1820 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1823 firm_verification_t old = get_node_verification_mode();
1825 firm_vrfy_failure_msg = NULL;
1826 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1827 res = irn_vrfy_irg(n, irg);
1828 if (! res && get_irg_dom_state(irg) == dom_consistent &&
1829 get_irg_pinned(irg) == op_pin_state_pinned)
1830 res = check_dominance_for_node(n);
1831 do_node_verification(old);
1832 *bad_string = firm_vrfy_failure_msg;
1838 typedef struct _vrfy_bad_env_t {
1844 * Pre-Walker: check Bad predecessors of node.
1846 static void check_bads(ir_node *node, void *env)
1848 vrfy_bad_env_t *venv = env;
1849 int i, arity = get_irn_arity(node);
1851 if (is_Block(node)) {
1852 if ((venv->flags & BAD_CF) == 0) {
1854 /* check for Bad Block predecessor */
1855 for (i = 0; i < arity; ++i) {
1856 ir_node *pred = get_irn_n(node, i);
1859 venv->res |= BAD_CF;
1861 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1862 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1864 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1865 assert(0 && "Bad CF detected");
1872 if ((venv->flags & BAD_BLOCK) == 0) {
1874 /* check for Bad Block */
1875 if (is_Bad(get_nodes_block(node))) {
1876 venv->res |= BAD_BLOCK;
1878 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1879 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1881 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1882 assert(0 && "Bad CF detected");
1887 if ((venv->flags & TUPLE) == 0) {
1888 if (get_irn_op(node) == op_Tuple) {
1891 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1892 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1894 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1895 assert(0 && "Tuple detected");
1900 for (i = 0; i < arity; ++i) {
1901 ir_node *pred = get_irn_n(node, i);
1904 /* check for Phi with Bad inputs */
1905 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1906 if (venv->flags & BAD_CF)
1909 venv->res |= BAD_CF;
1911 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1912 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1914 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1915 assert(0 && "Bad CF detected");
1920 /* Bad node input */
1921 if ((venv->flags & BAD_DF) == 0) {
1922 venv->res |= BAD_DF;
1924 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1925 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1927 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1928 assert(0 && "Bad NON-CF detected");
1937 * verify occurrence of bad nodes
1939 int irg_vrfy_bads(ir_graph *irg, int flags)
1946 irg_walk_graph(irg, check_bads, NULL, &env);
1952 * set the default verify operation
1954 void firm_set_default_verifyer(opcode code, ir_op_ops *ops)
1958 ops->verify_node = verify_node_##a; \
2014 ops->verify_proj_node = verify_node_Proj_##a; \