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 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, 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, 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, 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, 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 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);
664 * verify a Proj(Tuple) node
666 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
672 * verify a Proj(CallBegin) node
674 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
679 * verify a Proj(EndReg) node
681 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
682 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
683 "EndReg may only appear if ip view is constructed.", 0);
688 * verify a Proj(EndExcept) node
690 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
691 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
692 "EndExcept may only appear if ip view is constructed.", 0);
700 verify_node_Proj(ir_node *p, ir_graph *irg) {
704 pred = skip_Id(get_Proj_pred(p));
705 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
707 op = get_irn_op(pred);
709 if (op->ops.verify_proj_node)
710 return op->ops.verify_proj_node(pred, p);
717 * verify a Block node
719 static int verify_node_Block(ir_node *n, ir_graph *irg) {
722 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
723 ir_node *pred = get_Block_cfgpred(n, i);
727 (get_irn_mode(pred) == mode_X)
731 /* End block may only have Return, Raise or fragile ops as preds. */
732 if (n == get_irg_end_block(irg))
733 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
734 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
735 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
736 break; /* We can not test properly. How many tuples are there? */
737 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
739 (get_irn_op(pred) == op_Raise) ||
740 is_fragile_op(pred) ),
741 "End Block node", 0);
743 /* irg attr must == graph we are in. */
744 if (! get_interprocedural_view()) {
745 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
751 * verify a Start node
753 static int verify_node_Start(ir_node *n, ir_graph *irg) {
754 ir_mode *mymode = get_irn_mode(n);
757 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
758 mymode == mode_T, "Start node", 0
766 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
767 ir_mode *mymode = get_irn_mode(n);
771 mymode == mode_X, "Jmp node", 0
777 * verify an IJmp node
779 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
780 ir_mode *mymode = get_irn_mode(n);
781 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
784 /* IJmp: BB x ref --> X */
785 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
791 * verify a Break node
793 static int verify_node_Break(ir_node *n, ir_graph *irg) {
794 ir_mode *mymode = get_irn_mode(n);
796 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
797 "Break may only appear if ip view is constructed.", 0);
800 mymode == mode_X, "Break node", 0
808 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
809 ir_mode *mymode = get_irn_mode(n);
810 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
813 /* Cond: BB x b --> X x X */
814 (op1mode == mode_b ||
815 /* Cond: BB x int --> X^n */
816 mode_is_int(op1mode) ), "Cond node", 0
818 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
824 * verify a Return node
826 static int verify_node_Return(ir_node *n, ir_graph *irg) {
828 ir_mode *mymode = get_irn_mode(n);
829 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
832 /* Return: BB x M x data1 x ... x datan --> X */
834 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
836 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
837 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
839 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
840 /* Compare returned results with result types of method type */
841 mt = get_entity_type(get_irg_entity(irg));
842 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
843 "Number of results for Return doesn't match number of results in type.", 0,
844 show_return_nres(irg, n, mt););
845 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
846 type *res_type = get_method_res_type(mt, i);
848 if (is_atomic_type(res_type)) {
850 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
851 "Mode of result for Return doesn't match mode of result type.", 0,
852 show_return_modes(irg, n, mt, i);
857 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
858 "Mode of result for Return doesn't match mode of result type.", 0,
859 show_return_modes(irg, n, mt, i);
867 * verify a Raise node
869 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
870 ir_mode *mymode = get_irn_mode(n);
871 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
872 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
875 /* Sel: BB x M x ref --> X x M */
876 op1mode == mode_M && mode_is_reference(op2mode) &&
877 mymode == mode_T, "Raise node", 0
883 * verify a Const node
885 static int verify_node_Const(ir_node *n, ir_graph *irg) {
886 ir_mode *mymode = get_irn_mode(n);
889 /* Const: BB --> data */
890 (mode_is_data(mymode) ||
891 mymode == mode_b) /* we want boolean constants for static evaluation */
892 ,"Const node", 0 /* of Cmp. */
898 * verify a SymConst node
900 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
901 ir_mode *mymode = get_irn_mode(n);
903 if (get_SymConst_kind(n) == symconst_addr_ent) {
904 entity *ent = get_SymConst_entity(n);
905 if (is_Method_type(get_entity_type(ent)) &&
906 get_irn_irg(n) != get_const_code_irg()) {
908 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
909 "A constant must address an existing method.", 0);
914 /* SymConst: BB --> int*/
915 (mode_is_int(mymode) ||
916 /* SymConst: BB --> ref */
917 mode_is_reference(mymode))
918 ,"SymConst node", 0);
925 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
927 ir_mode *mymode = get_irn_mode(n);
928 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
929 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
933 /* Sel: BB x M x ref x int^n --> ref */
934 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
935 "Sel node", 0, show_node_failure(n)
938 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
939 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
941 ent = get_Sel_entity(n);
942 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
947 * verify an InstOf node
949 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
950 ir_mode *mymode = get_irn_mode(n);
951 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
953 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
954 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
961 static int verify_node_Call(ir_node *n, ir_graph *irg) {
962 ir_mode *mymode = get_irn_mode(n);
963 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
964 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
968 /* Call: BB x M x ref x data1 x ... x datan
969 --> M x datan+1 x ... x data n+m */
970 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
972 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
974 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
975 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
976 "Call node with wrong memory input", 0 );
978 mt = get_Call_type(n);
979 if(get_unknown_type() == mt) {
983 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
984 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
987 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
988 /* Compare arguments of node with those of type */
990 if (get_method_variadicity(mt) == variadicity_variadic) {
992 get_Call_n_params(n) >= get_method_n_params(mt),
993 "Number of args for Call doesn't match number of args in variadic type.",
995 fprintf(stderr, "Call has %d params, method %s type %d\n",
996 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1001 get_Call_n_params(n) == get_method_n_params(mt),
1002 "Number of args for Call doesn't match number of args in non variadic type.",
1006 for (i = 0; i < get_method_n_params(mt); i++) {
1007 type *t = get_method_param_type(mt, i);
1009 if (is_atomic_type(t)) {
1011 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1012 "Mode of arg for Call doesn't match mode of arg type.", 0,
1013 show_call_param(n, mt);
1017 /* call with a compound type, mode must be reference */
1019 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1020 "Mode of arg for Call doesn't match mode of arg type.", 0,
1021 show_call_param(n, mt);
1027 if (Call_has_callees(n)) {
1028 for (i = 0; i < get_Call_n_callees(n); i++) {
1029 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1037 * verify an Add node
1039 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1040 ir_mode *mymode = get_irn_mode(n);
1041 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1042 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1046 /* common Add: BB x numP x numP --> numP */
1047 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1048 /* Pointer Add: BB x ref x int --> ref */
1049 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1050 /* Pointer Add: BB x int x ref --> ref */
1051 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1054 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1055 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1056 "/* Pointer Add: BB x int x ref --> ref */");
1064 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1065 ir_mode *mymode = get_irn_mode(n);
1066 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1067 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1070 /* common Sub: BB x numP x numP --> numP */
1071 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1072 /* Pointer Sub: BB x ref x int --> ref */
1073 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1074 /* Pointer Sub: BB x int x ref --> ref */
1075 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1076 /* Pointer Sub: BB x ref x ref --> int */
1077 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1079 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1080 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1081 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1082 "/* Pointer Sub: BB x ref x ref --> int */" );
1088 * verify a Minus node
1090 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1091 ir_mode *mymode = get_irn_mode(n);
1092 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1095 /* Minus: BB x num --> num */
1096 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1097 show_unop_failure(n , "/* Minus: BB x num --> num */");
1105 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1106 ir_mode *mymode = get_irn_mode(n);
1107 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1108 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1111 /* Mul: BB x int1 x int1 --> int2 */
1112 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1113 /* Mul: BB x float x float --> float */
1114 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1116 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1117 "/* Mul: BB x float x float --> float */");
1123 * verify a Quot node
1125 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1126 ir_mode *mymode = get_irn_mode(n);
1127 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1128 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1129 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1132 /* Quot: BB x M x float x float --> M x X x float */
1133 op1mode == mode_M && op2mode == op3mode &&
1134 get_mode_sort(op2mode) == irms_float_number &&
1137 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1143 * verify a DivMod node
1145 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1146 ir_mode *mymode = get_irn_mode(n);
1147 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1148 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1149 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1152 /* DivMod: BB x M x int x int --> M x X x int x int */
1153 op1mode == mode_M &&
1154 mode_is_int(op2mode) &&
1155 op3mode == op2mode &&
1165 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1166 ir_mode *mymode = get_irn_mode(n);
1167 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1168 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1169 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1172 /* Div: BB x M x int x int --> M x X x int */
1173 op1mode == mode_M &&
1174 op2mode == op3mode &&
1175 mode_is_int(op2mode) &&
1185 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1186 ir_mode *mymode = get_irn_mode(n);
1187 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1188 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1189 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1192 /* Mod: BB x M x int x int --> M x X x int */
1193 op1mode == mode_M &&
1194 op2mode == op3mode &&
1195 mode_is_int(op2mode) &&
1203 * verify an Abs node
1205 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1206 ir_mode *mymode = get_irn_mode(n);
1207 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1210 /* Abs: BB x num --> num */
1211 op1mode == mymode &&
1212 mode_is_num (op1mode),
1214 show_unop_failure(n, "/* Abs: BB x num --> num */");
1220 * verify a logical And, Or, Eor node
1222 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1223 ir_mode *mymode = get_irn_mode(n);
1224 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1225 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1228 /* And or Or or Eor: BB x int x int --> int */
1229 mode_is_int(mymode) &&
1230 op2mode == op1mode &&
1232 "And, Or or Eor node", 0,
1233 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1238 #define verify_node_And verify_node_Logic
1239 #define verify_node_Or verify_node_Logic
1240 #define verify_node_Eor verify_node_Logic
1245 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1246 ir_mode *mymode = get_irn_mode(n);
1247 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1250 /* Not: BB x int --> int */
1251 mode_is_int(mymode) &&
1254 show_unop_failure(n, "/* Not: BB x int --> int */");
1262 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1263 ir_mode *mymode = get_irn_mode(n);
1264 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1265 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1268 /* Cmp: BB x datab x datab --> b16 */
1269 mode_is_data (op1mode) &&
1270 op2mode == op1mode &&
1273 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1279 * verify a Shift node
1281 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1282 ir_mode *mymode = get_irn_mode(n);
1283 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1284 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1287 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1288 mode_is_int(op1mode) &&
1289 mode_is_int(op2mode) &&
1290 !mode_is_signed(op2mode) &&
1292 "Shl, Shr or Shrs node", 0,
1293 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1298 #define verify_node_Shl verify_node_Shift
1299 #define verify_node_Shr verify_node_Shift
1300 #define verify_node_Shrs verify_node_Shift
1305 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1306 ir_mode *mymode = get_irn_mode(n);
1307 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1308 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1311 /* Rot: BB x int x int --> int */
1312 mode_is_int(op1mode) &&
1313 mode_is_int(op2mode) &&
1316 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1322 * verify a Conv node
1324 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1325 ir_mode *mymode = get_irn_mode(n);
1326 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1329 /* Conv: BB x datab1 --> datab2 */
1330 mode_is_datab(op1mode) && mode_is_data(mymode),
1332 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1338 * verify a Cast node
1340 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1341 ir_mode *mymode = get_irn_mode(n);
1342 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1345 /* Conv: BB x datab1 --> datab2 */
1346 mode_is_data(op1mode) && op1mode == mymode,
1348 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1356 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1357 ir_mode *mymode = get_irn_mode(n);
1358 ir_node *block = get_nodes_block(n);
1361 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1362 /* a Phi node MUST have the same number of inputs as its block */
1364 get_irn_arity(n) == get_irn_arity(block),
1365 "wrong number of inputs in Phi node", 0,
1366 show_phi_inputs(n, block);
1370 /* Phi: BB x dataM^n --> dataM */
1371 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1372 ir_node *pred = get_irn_n(n, i);
1373 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1375 get_irn_mode(pred) == mymode,
1377 show_phi_failure(n, pred, i);
1380 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1385 * verify a Filter node
1387 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1388 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1389 "Filter may only appear if ip view is constructed.", 0);
1390 /* We should further do tests as for Proj and Phi. */
1395 * verify a Load node
1397 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1398 ir_mode *mymode = get_irn_mode(n);
1399 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1400 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1403 /* Load: BB x M x ref --> M x X x data */
1404 op1mode == mode_M && mode_is_reference(op2mode),
1407 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1410 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1411 * (Proj (Proj))) sometimes ...
1413 * interprete.c:ai_eval seems to assume that this happens, too
1415 * obset.c:get_abstval_any can't deal with this if the load has
1419 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1420 assert ((NULL != ent) || (mymode != mode_T));
1428 * verify a Store node
1430 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1433 ir_mode *mymode = get_irn_mode(n);
1434 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1435 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1436 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1439 /* Store: BB x M x ref x data --> M x X */
1440 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1443 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1445 target = get_ptr_entity(get_Store_ptr(n));
1446 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1448 * If lowered code, any Sels that add 0 may be removed, causing
1449 * an direct access to entities of array or compound type.
1450 * Prevent this by checking the phase.
1452 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1460 * verify an Alloc node
1462 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1463 ir_mode *mymode = get_irn_mode(n);
1464 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1465 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1468 /* Alloc: BB x M x int_u --> M x X x ref */
1469 op1mode == mode_M &&
1470 mode_is_int(op2mode) &&
1471 !mode_is_signed(op2mode) &&
1474 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1480 * verify a Free node
1482 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1483 ir_mode *mymode = get_irn_mode(n);
1484 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1485 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1486 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1489 /* Free: BB x M x ref x int_u --> M */
1490 op1mode == mode_M && mode_is_reference(op2mode) &&
1491 mode_is_int(op3mode) &&
1492 !mode_is_signed(op3mode) &&
1495 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1501 * verify a Sync node
1503 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1505 ir_mode *mymode = get_irn_mode(n);
1507 /* Sync: BB x M^n --> M */
1508 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1509 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1511 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1516 * verify a Confirm node
1518 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1519 ir_mode *mymode = get_irn_mode(n);
1520 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1521 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1524 /* Confirm: BB x T x T --> T */
1525 op1mode == mymode &&
1528 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1536 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1537 ir_mode *mymode = get_irn_mode(n);
1538 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1539 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1540 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1543 /* Mux: BB x b x numP x numP --> numP */
1544 op1mode == mode_b &&
1545 op2mode == mymode &&
1546 op3mode == mymode &&
1547 mode_is_numP(mymode),
1554 * verify a CopyB node
1556 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1557 ir_mode *mymode = get_irn_mode(n);
1558 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1559 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1560 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1561 type *t = get_CopyB_type(n);
1563 /* CopyB: BB x M x ref x ref --> M x X */
1566 op1mode == mode_M &&
1567 mode_is_reference(op2mode) &&
1568 mode_is_reference(op3mode),
1569 "CopyB node", 0 ); /* operand M x ref x ref */
1572 is_compound_type(t),
1573 "CopyB node should copy compound types only", 0 );
1575 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1576 This should happen RARELY, as CopyB COPIES MEMORY */
1578 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1579 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1580 "CopyB node with wrong memory input", 0 );
1586 * For each usage of a node, it is checked, if the block of the
1587 * node dominates the block of the usage (for phis: the predecessor
1588 * block of the phi for the corresponding edge).
1590 static int check_dominance_for_node(ir_node *use)
1592 /* This won't work for blocks and the end node */
1593 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1595 ir_node *bl = get_nodes_block(use);
1597 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1598 ir_node *def = get_irn_n(use, i);
1599 ir_node *def_bl = get_nodes_block(def);
1600 ir_node *use_bl = bl;
1602 /* ignore dead definition blocks, will be removed */
1603 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1607 use_bl = get_Block_cfgpred_block(bl, i);
1609 /* ignore dead use blocks, will be removed */
1610 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1614 block_dominates(def_bl, use_bl),
1615 "the definition of a value used violates the dominance property", 0,
1617 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1618 current_ir_graph, def_bl, def, use_bl, use, i
1626 /* Tests the modes of n and its predecessors. */
1627 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1632 if (!get_node_verification_mode())
1635 if (!get_interprocedural_view()) {
1637 * do NOT check placement in interprocedural view, as we don't always know
1638 * the "right" graph ...
1641 node_is_in_irgs_storage(irg, n),
1642 "Node is not stored on proper IR graph!", 0,
1643 show_node_on_graph(irg, n);
1645 assert(get_irn_irg(n) == irg);
1650 /* We don't want to test nodes whose predecessors are Bad,
1651 as we would have to special case that for each operation. */
1652 if (op != op_Phi && op != op_Block)
1653 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1654 if (is_Bad(get_irn_n(n, i)))
1658 if (op->ops.verify_node)
1659 return op->ops.verify_node(n, irg);
1665 int irn_vrfy(ir_node *n)
1668 #ifdef DEBUG_libfirm
1669 res = irn_vrfy_irg(n, current_ir_graph);
1674 /*-----------------------------------------------------------------*/
1675 /* Verify the whole graph. */
1676 /*-----------------------------------------------------------------*/
1678 #ifdef DEBUG_libfirm
1680 * Walker to check every node
1682 static void vrfy_wrap(ir_node *node, void *env) {
1684 *res = irn_vrfy(node);
1688 * Walker to check every node including SSA property.
1689 * Only called if dominance info is available.
1691 static void vrfy_wrap_ssa(ir_node *node, void *env)
1695 *res = irn_vrfy(node);
1697 *res = check_dominance_for_node(node);
1700 #endif /* DEBUG_libfirm */
1703 * Calls irn_vrfy for each node in irg.
1704 * Graph must be in state "op_pin_state_pinned".
1705 * If dominance info is available, check the SSA property.
1707 int irg_verify(ir_graph *irg, unsigned flags)
1710 #ifdef DEBUG_libfirm
1713 rem = current_ir_graph;
1714 current_ir_graph = irg;
1715 last_irg_error = NULL;
1717 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1719 if (flags & VRFY_ENFORCE_SSA)
1724 get_irg_dom_state(irg) == dom_consistent &&
1725 get_irg_pinned(irg) == op_pin_state_pinned ?
1726 vrfy_wrap_ssa : vrfy_wrap,
1730 current_ir_graph = rem;
1732 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1733 entity *ent = get_irg_entity(current_ir_graph);
1736 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1738 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1740 #endif /* DEBUG_libfirm */
1745 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1748 firm_verification_t old = get_node_verification_mode();
1750 firm_vrfy_failure_msg = NULL;
1751 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1752 res = irn_vrfy_irg(n, irg);
1753 if (! res && get_irg_dom_state(irg) == dom_consistent &&
1754 get_irg_pinned(irg) == op_pin_state_pinned)
1755 res = check_dominance_for_node(n);
1756 do_node_verification(old);
1757 *bad_string = firm_vrfy_failure_msg;
1763 typedef struct _vrfy_bad_env_t {
1769 * Pre-Walker: check Bad predecessors of node.
1771 static void check_bads(ir_node *node, void *env)
1773 vrfy_bad_env_t *venv = env;
1774 int i, arity = get_irn_arity(node);
1776 if (is_Block(node)) {
1777 if ((venv->flags & BAD_CF) == 0) {
1779 /* check for Bad Block predecessor */
1780 for (i = 0; i < arity; ++i) {
1781 ir_node *pred = get_irn_n(node, i);
1784 venv->res |= BAD_CF;
1786 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1787 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1789 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1790 assert(0 && "Bad CF detected");
1797 if ((venv->flags & BAD_BLOCK) == 0) {
1799 /* check for Bad Block */
1800 if (is_Bad(get_nodes_block(node))) {
1801 venv->res |= BAD_BLOCK;
1803 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1804 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1806 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1807 assert(0 && "Bad CF detected");
1812 if ((venv->flags & TUPLE) == 0) {
1813 if (get_irn_op(node) == op_Tuple) {
1816 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1817 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1819 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1820 assert(0 && "Tuple detected");
1825 for (i = 0; i < arity; ++i) {
1826 ir_node *pred = get_irn_n(node, i);
1829 /* check for Phi with Bad inputs */
1830 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1831 if (venv->flags & BAD_CF)
1834 venv->res |= BAD_CF;
1836 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1837 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1839 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1840 assert(0 && "Bad CF detected");
1845 /* Bad node input */
1846 if ((venv->flags & BAD_DF) == 0) {
1847 venv->res |= BAD_DF;
1849 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1850 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1852 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1853 assert(0 && "Bad NON-CF detected");
1862 * verify occurrence of bad nodes
1864 int irg_vrfy_bads(ir_graph *irg, int flags)
1871 irg_walk_graph(irg, check_bads, NULL, &env);
1877 * set the default verify operation
1879 void firm_set_default_verifyer(opcode code, ir_op_ops *ops)
1883 ops->verify_node = verify_node_##a; \
1938 ops->verify_proj_node = verify_node_Proj_##a; \