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_P_tls && mode_is_reference(mode)) ||
304 (proj == pn_Start_T_args && mode == mode_T) ||
305 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
306 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
308 "wrong Proj from Start", 0,
309 show_proj_failure(p);
315 * verify a Proj(Cond) node
317 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
318 ir_mode *mode = get_irn_mode(p);
319 long proj = get_Proj_proj(p);
323 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
324 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
325 is_Bad(get_Cond_selector(pred)) /* rare */
327 "wrong Proj from Cond", 0,
328 show_proj_failure(p);
334 * verify a Proj(Raise) node
336 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
337 ir_mode *mode = get_irn_mode(p);
338 long proj = get_Proj_proj(p);
341 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
342 "wrong Proj from Raise", 0,
343 show_proj_failure(p);
349 * verify a Proj(InstOf) node
351 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
352 ir_mode *mode = get_irn_mode(p);
353 long proj = get_Proj_proj(p);
356 (proj >= 0 && mode == mode_X),
357 "wrong Proj from InstOf", 0,
358 show_proj_failure(p);
364 * verify a Proj(Call) node
366 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
367 ir_mode *mode = get_irn_mode(p);
368 long proj = get_Proj_proj(p);
371 ((proj == pn_Call_M_regular && mode == mode_M) ||
372 (proj == pn_Call_X_except && mode == mode_X) ||
373 (proj == pn_Call_T_result && mode == mode_T) ||
374 (proj == pn_Call_M_except && mode == mode_M) ||
375 (proj == pn_Call_P_value_res_base && mode == mode_P)),
376 "wrong Proj from Call", 0,
377 show_proj_failure(p);
379 if (proj == pn_Call_X_except)
381 get_irn_op(get_Call_mem(n)) != op_NoMem,
382 "Exception Proj from FunctionCall", 0);
383 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
385 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
386 "Memory Proj from FunctionCall", 0);
391 * verify a Proj(Quot) node
393 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
394 ir_mode *mode = get_irn_mode(p);
395 long proj = get_Proj_proj(p);
398 ((proj == pn_Quot_M && mode == mode_M) ||
399 (proj == pn_Quot_X_except && mode == mode_X) ||
400 (proj == pn_Quot_res && mode_is_float(mode))),
401 "wrong Proj from Quot", 0,
402 show_proj_failure(p);
404 if (proj == pn_Quot_X_except)
406 get_irn_pinned(n) == op_pin_state_pinned,
407 "Exception Proj from unpinned Quot", 0);
408 else if (proj == pn_Quot_M)
410 get_irn_pinned(n) == op_pin_state_pinned,
411 "Memory Proj from unpinned Quot", 0);
416 * verify a Proj(DivMod) node
418 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
419 ir_mode *mode = get_irn_mode(p);
420 long proj = get_Proj_proj(p);
423 ((proj == pn_DivMod_M && mode == mode_M) ||
424 (proj == pn_DivMod_X_except && mode == mode_X) ||
425 (proj == pn_DivMod_res_div && mode_is_int(mode)) ||
426 (proj == pn_DivMod_res_mod && mode_is_int(mode))),
427 "wrong Proj from DivMod", 0,
428 show_proj_failure(p);
430 if (proj == pn_DivMod_X_except)
432 get_irn_pinned(n) == op_pin_state_pinned,
433 "Exception Proj from unpinned DivMod", 0);
434 else if (proj == pn_DivMod_M)
436 get_irn_pinned(n) == op_pin_state_pinned,
437 "Memory Proj from unpinned DivMod", 0);
442 * verify a Proj(Div) node
444 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
445 ir_mode *mode = get_irn_mode(p);
446 long proj = get_Proj_proj(p);
449 ((proj == pn_Div_M && mode == mode_M) ||
450 (proj == pn_Div_X_except && mode == mode_X) ||
451 (proj == pn_Div_res && mode_is_int(mode))),
452 "wrong Proj from Div", 0,
453 show_proj_failure(p);
455 if (proj == pn_Div_X_except)
457 get_irn_pinned(n) == op_pin_state_pinned,
458 "Exception Proj from unpinned Div", 0);
459 else if (proj == pn_Div_M)
461 get_irn_pinned(n) == op_pin_state_pinned,
462 "Memory Proj from unpinned Div", 0);
467 * verify a Proj(Mod) node
469 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
470 ir_mode *mode = get_irn_mode(p);
471 long proj = get_Proj_proj(p);
474 ((proj == pn_Mod_M && mode == mode_M) ||
475 (proj == pn_Mod_X_except && mode == mode_X) ||
476 (proj == pn_Mod_res && mode_is_int(mode))),
477 "wrong Proj from Mod", 0,
478 show_proj_failure(p);
480 if (proj == pn_Mod_X_except)
482 get_irn_pinned(n) == op_pin_state_pinned,
483 "Exception Proj from unpinned Mod", 0);
484 else if (proj == pn_Mod_M)
486 get_irn_pinned(n) == op_pin_state_pinned,
487 "Memory Proj from unpinned Div", 0);
492 * verify a Proj(Cmp) node
494 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
495 ir_mode *mode = get_irn_mode(p);
496 long proj = get_Proj_proj(p);
499 (proj >= 0 && proj <= 15 && mode == mode_b),
500 "wrong Proj from Cmp", 0,
501 show_proj_failure(p);
507 * verify a Proj(Load) node
509 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
510 ir_mode *mode = get_irn_mode(p);
511 long proj = get_Proj_proj(p);
513 if (proj == pn_Load_res) {
514 ir_node *ptr = get_Load_ptr(n);
515 entity *ent = get_ptr_entity(ptr);
517 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
518 /* do NOT check this for lowered phases, see comment on Store */
520 (mode == get_type_mode(get_entity_type(ent))),
521 "wrong data Proj from Load, entity type_mode failed", 0,
522 show_proj_failure_ent(p, ent);
527 mode_is_data(mode) && mode == get_Load_mode(n),
528 "wrong data Proj from Load", 0,
529 show_proj_failure(p);
535 ((proj == pn_Load_M && mode == mode_M) ||
536 (proj == pn_Load_X_except && mode == mode_X)),
537 "wrong Proj from Load", 0,
538 show_proj_failure(p);
541 if (proj == pn_Load_X_except)
543 get_irn_pinned(n) == op_pin_state_pinned,
544 "Exception Proj from unpinned Load", 0);
549 * verify a Proj(Store) node
551 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
552 ir_mode *mode = get_irn_mode(p);
553 long proj = get_Proj_proj(p);
556 ((proj == pn_Store_M && mode == mode_M) ||
557 (proj == pn_Store_X_except && mode == mode_X)),
558 "wrong Proj from Store", 0,
559 show_proj_failure(p);
561 if (proj == pn_Store_X_except)
563 get_irn_pinned(n) == op_pin_state_pinned,
564 "Exception Proj from unpinned Store", 0);
569 * verify a Proj(Alloc) node
571 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
572 ir_mode *mode = get_irn_mode(p);
573 long proj = get_Proj_proj(p);
577 (proj == pn_Alloc_M && mode == mode_M) ||
578 (proj == pn_Alloc_X_except /* && mode == mode_X*/) ||
579 (proj == pn_Alloc_res && mode_is_reference(mode))
581 "wrong Proj from Alloc", 0,
582 show_proj_failure(p);
588 * verify a Proj(Proj) node
590 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
591 ir_mode *mode = get_irn_mode(p);
592 long proj = get_Proj_proj(p);
593 long nr = get_Proj_proj(pred);
594 ir_type *mt; /* A method type */
596 pred = skip_Id(get_Proj_pred(pred));
597 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
599 switch (get_irn_opcode(pred)) {
601 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
603 if (nr == pn_Start_T_args) {
605 (proj >= 0 && mode_is_data(mode)),
606 "wrong Proj from Proj from Start", 0);
608 (proj < get_method_n_params(mt)),
609 "More Projs for args than args in type", 0
611 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
612 /* value argument */ break;
615 (mode == get_type_mode(get_method_param_type(mt, proj))),
616 "Mode of Proj from Start doesn't match mode of param type.", 0,
617 show_proj_mode_failure(p, get_method_param_type(mt, proj));
620 else if (nr == pn_Start_P_value_arg_base) {
622 (proj >= 0 && mode_is_reference(mode)),
623 "wrong Proj from Proj from Start", 0
626 (proj < get_method_n_params(mt)),
627 "More Projs for args than args in type", 0
635 (proj >= 0 && mode_is_data(mode)),
636 "wrong Proj from Proj from Call", 0);
637 mt = get_Call_type(pred);
639 (proj < get_method_n_ress(mt)),
640 "More Projs for results than results in type.", 0);
641 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
642 /* value result */ break;
645 (mode == get_type_mode(get_method_res_type(mt, proj))),
646 "Mode of Proj from Call doesn't match mode of result type.", 0);
655 /* hmm, optimization did not remove it */
659 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
666 * verify a Proj(Tuple) node
668 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
674 * verify a Proj(CallBegin) node
676 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
681 * verify a Proj(EndReg) node
683 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
684 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
685 "EndReg may only appear if ip view is constructed.", 0);
690 * verify a Proj(EndExcept) node
692 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
693 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
694 "EndExcept may only appear if ip view is constructed.", 0);
699 * verify a Proj(CopyB) node
701 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
702 ir_mode *mode = get_irn_mode(p);
703 long proj = get_Proj_proj(p);
706 ((proj == pn_CopyB_M_regular && mode == mode_M) ||
707 (proj == pn_CopyB_X_except && mode == mode_X) ||
708 (proj == pn_CopyB_M_except && mode == mode_M)),
709 "wrong Proj from CopyB", 0,
710 show_proj_failure(p);
712 if (proj == pn_CopyB_X_except)
714 get_irn_pinned(n) == op_pin_state_pinned,
715 "Exception Proj from unpinned CopyB", 0);
720 * verify a Proj(Bound) node
722 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
723 ir_mode *mode = get_irn_mode(p);
724 long proj = get_Proj_proj(p);
727 ((proj == pn_Bound_M && mode == mode_M) ||
728 (proj == pn_Bound_X_except && mode == mode_X) ||
729 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))),
730 "wrong Proj from Bound", 0,
731 show_proj_failure(p);
733 if (proj == pn_Bound_X_except)
735 get_irn_pinned(n) == op_pin_state_pinned,
736 "Exception Proj from unpinned Bound", 0);
744 verify_node_Proj(ir_node *p, ir_graph *irg) {
748 pred = skip_Id(get_Proj_pred(p));
749 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
751 op = get_irn_op(pred);
753 if (op->ops.verify_proj_node)
754 return op->ops.verify_proj_node(pred, p);
761 * verify a Block node
763 static int verify_node_Block(ir_node *n, ir_graph *irg) {
766 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
767 ir_node *pred = get_Block_cfgpred(n, i);
771 (get_irn_mode(pred) == mode_X)
775 /* End block may only have Return, Raise or fragile ops as preds. */
776 if (n == get_irg_end_block(irg))
777 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
778 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
779 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
780 break; /* We can not test properly. How many tuples are there? */
781 ASSERT_AND_RET((is_Return(pred) ||
783 (get_irn_op(pred) == op_Raise) ||
784 is_fragile_op(pred) ),
785 "End Block node", 0);
787 /* irg attr must == graph we are in. */
788 if (! get_interprocedural_view()) {
789 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
795 * verify a Start node
797 static int verify_node_Start(ir_node *n, ir_graph *irg) {
798 ir_mode *mymode = get_irn_mode(n);
801 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
802 mymode == mode_T, "Start node", 0
810 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
811 ir_mode *mymode = get_irn_mode(n);
815 mymode == mode_X, "Jmp node", 0
821 * verify an IJmp node
823 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
824 ir_mode *mymode = get_irn_mode(n);
825 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
828 /* IJmp: BB x ref --> X */
829 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
835 * verify a Break node
837 static int verify_node_Break(ir_node *n, ir_graph *irg) {
838 ir_mode *mymode = get_irn_mode(n);
840 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
841 "Break may only appear if ip view is constructed.", 0);
844 mymode == mode_X, "Break node", 0
852 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
853 ir_mode *mymode = get_irn_mode(n);
854 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
857 /* Cond: BB x b --> X x X */
858 (op1mode == mode_b ||
859 /* Cond: BB x int --> X^n */
860 mode_is_int(op1mode) ), "Cond node", 0
862 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
868 * verify a Return node
870 static int verify_node_Return(ir_node *n, ir_graph *irg) {
872 ir_mode *mymode = get_irn_mode(n);
873 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
876 /* Return: BB x M x data1 x ... x datan --> X */
878 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
880 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
881 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
883 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
884 /* Compare returned results with result types of method type */
885 mt = get_entity_type(get_irg_entity(irg));
886 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
887 "Number of results for Return doesn't match number of results in type.", 0,
888 show_return_nres(irg, n, mt););
889 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
890 ir_type *res_type = get_method_res_type(mt, i);
892 if (is_atomic_type(res_type)) {
894 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
895 "Mode of result for Return doesn't match mode of result type.", 0,
896 show_return_modes(irg, n, mt, i);
901 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
902 "Mode of result for Return doesn't match mode of result type.", 0,
903 show_return_modes(irg, n, mt, i);
911 * verify a Raise node
913 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
914 ir_mode *mymode = get_irn_mode(n);
915 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
916 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
919 /* Sel: BB x M x ref --> X x M */
920 op1mode == mode_M && mode_is_reference(op2mode) &&
921 mymode == mode_T, "Raise node", 0
927 * verify a Const node
929 static int verify_node_Const(ir_node *n, ir_graph *irg) {
930 ir_mode *mymode = get_irn_mode(n);
933 /* Const: BB --> data */
934 (mode_is_data(mymode) ||
935 mymode == mode_b) /* we want boolean constants for static evaluation */
936 ,"Const node", 0 /* of Cmp. */
939 /* the modes of the constant and teh tarval must match */
940 mymode == get_tarval_mode(get_Const_tarval(n)),
941 "Const node, tarval and node mode mismatch", 0
947 * verify a SymConst node
949 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
950 ir_mode *mymode = get_irn_mode(n);
952 if (get_SymConst_kind(n) == symconst_addr_ent) {
953 entity *ent = get_SymConst_entity(n);
954 if (is_Method_type(get_entity_type(ent)) &&
955 get_irn_irg(n) != get_const_code_irg()) {
957 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
958 "A constant must address an existing method.", 0);
963 /* SymConst: BB --> int*/
964 (mode_is_int(mymode) ||
965 /* SymConst: BB --> ref */
966 mode_is_reference(mymode))
967 ,"SymConst node", 0);
974 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
976 ir_mode *mymode = get_irn_mode(n);
977 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
978 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
982 /* Sel: BB x M x ref x int^n --> ref */
983 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
984 "Sel node", 0, show_node_failure(n)
987 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
988 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
990 ent = get_Sel_entity(n);
991 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
996 * verify an InstOf node
998 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
999 ir_mode *mymode = get_irn_mode(n);
1000 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1002 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1003 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1008 * verify a Call node
1010 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1011 ir_mode *mymode = get_irn_mode(n);
1012 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1013 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1017 /* Call: BB x M x ref x data1 x ... x datan
1018 --> M x datan+1 x ... x data n+m */
1019 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1021 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1023 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
1024 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1025 "Call node with wrong memory input", 0 );
1027 mt = get_Call_type(n);
1028 if(get_unknown_type() == mt) {
1032 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1033 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1036 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1037 /* Compare arguments of node with those of type */
1039 if (get_method_variadicity(mt) == variadicity_variadic) {
1041 get_Call_n_params(n) >= get_method_n_params(mt),
1042 "Number of args for Call doesn't match number of args in variadic type.",
1044 fprintf(stderr, "Call has %d params, method %s type %d\n",
1045 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1050 get_Call_n_params(n) == get_method_n_params(mt),
1051 "Number of args for Call doesn't match number of args in non variadic type.",
1055 for (i = 0; i < get_method_n_params(mt); i++) {
1056 ir_type *t = get_method_param_type(mt, i);
1058 if (is_atomic_type(t)) {
1060 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1061 "Mode of arg for Call doesn't match mode of arg type.", 0,
1062 show_call_param(n, mt);
1066 /* call with a compound type, mode must be reference */
1068 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1069 "Mode of arg for Call doesn't match mode of arg type.", 0,
1070 show_call_param(n, mt);
1076 if (Call_has_callees(n)) {
1077 for (i = 0; i < get_Call_n_callees(n); i++) {
1078 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1086 * verify an Add node
1088 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1089 ir_mode *mymode = get_irn_mode(n);
1090 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1091 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1095 /* common Add: BB x numP x numP --> numP */
1096 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1097 /* Pointer Add: BB x ref x int --> ref */
1098 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1099 /* Pointer Add: BB x int x ref --> ref */
1100 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1103 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1104 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1105 "/* Pointer Add: BB x int x ref --> ref */");
1113 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1114 ir_mode *mymode = get_irn_mode(n);
1115 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1116 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1119 /* common Sub: BB x numP x numP --> numP */
1120 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1121 /* Pointer Sub: BB x ref x int --> ref */
1122 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1123 /* Pointer Sub: BB x int x ref --> ref */
1124 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1125 /* Pointer Sub: BB x ref x ref --> int */
1126 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
1128 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1129 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1130 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1131 "/* Pointer Sub: BB x ref x ref --> int */" );
1137 * verify a Minus node
1139 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1140 ir_mode *mymode = get_irn_mode(n);
1141 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1144 /* Minus: BB x num --> num */
1145 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1146 show_unop_failure(n , "/* Minus: BB x num --> num */");
1154 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1155 ir_mode *mymode = get_irn_mode(n);
1156 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1157 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1160 /* Mul: BB x int1 x int1 --> int2 */
1161 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1162 /* Mul: BB x float x float --> float */
1163 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
1165 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1166 "/* Mul: BB x float x float --> float */");
1172 * verify a Quot node
1174 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1175 ir_mode *mymode = get_irn_mode(n);
1176 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1177 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1178 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1181 /* Quot: BB x M x float x float --> M x X x float */
1182 op1mode == mode_M && op2mode == op3mode &&
1183 get_mode_sort(op2mode) == irms_float_number &&
1186 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1192 * verify a DivMod node
1194 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1195 ir_mode *mymode = get_irn_mode(n);
1196 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1197 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1198 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1201 /* DivMod: BB x M x int x int --> M x X x int x int */
1202 op1mode == mode_M &&
1203 mode_is_int(op2mode) &&
1204 op3mode == op2mode &&
1214 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1215 ir_mode *mymode = get_irn_mode(n);
1216 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1217 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1218 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1221 /* Div: BB x M x int x int --> M x X x int */
1222 op1mode == mode_M &&
1223 op2mode == op3mode &&
1224 mode_is_int(op2mode) &&
1234 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1235 ir_mode *mymode = get_irn_mode(n);
1236 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1237 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1238 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1241 /* Mod: BB x M x int x int --> M x X x int */
1242 op1mode == mode_M &&
1243 op2mode == op3mode &&
1244 mode_is_int(op2mode) &&
1252 * verify an Abs node
1254 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1255 ir_mode *mymode = get_irn_mode(n);
1256 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1259 /* Abs: BB x num --> num */
1260 op1mode == mymode &&
1261 mode_is_num (op1mode),
1263 show_unop_failure(n, "/* Abs: BB x num --> num */");
1269 * verify a logical And, Or, Eor node
1271 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1272 ir_mode *mymode = get_irn_mode(n);
1273 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1274 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1277 /* And or Or or Eor: BB x int x int --> int */
1278 (mode_is_int(mymode) || mymode == mode_b) &&
1279 op2mode == op1mode &&
1281 "And, Or or Eor node", 0,
1282 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1287 #define verify_node_And verify_node_Logic
1288 #define verify_node_Or verify_node_Logic
1289 #define verify_node_Eor verify_node_Logic
1294 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1295 ir_mode *mymode = get_irn_mode(n);
1296 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1299 /* Not: BB x int --> int */
1300 mode_is_int(mymode) &&
1303 show_unop_failure(n, "/* Not: BB x int --> int */");
1311 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1312 ir_mode *mymode = get_irn_mode(n);
1313 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1314 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1317 /* Cmp: BB x datab x datab --> b16 */
1318 mode_is_data (op1mode) &&
1319 op2mode == op1mode &&
1322 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1328 * verify a Shift node
1330 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1331 ir_mode *mymode = get_irn_mode(n);
1332 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1333 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1336 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1337 mode_is_int(op1mode) &&
1338 mode_is_int(op2mode) &&
1339 !mode_is_signed(op2mode) &&
1341 "Shl, Shr or Shrs node", 0,
1342 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1347 #define verify_node_Shl verify_node_Shift
1348 #define verify_node_Shr verify_node_Shift
1349 #define verify_node_Shrs verify_node_Shift
1354 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1355 ir_mode *mymode = get_irn_mode(n);
1356 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1357 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1360 /* Rot: BB x int x int --> int */
1361 mode_is_int(op1mode) &&
1362 mode_is_int(op2mode) &&
1365 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1371 * verify a Conv node
1373 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1374 ir_mode *mymode = get_irn_mode(n);
1375 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1378 /* Conv: BB x datab1 --> datab2 */
1379 mode_is_datab(op1mode) && mode_is_data(mymode),
1381 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1387 * verify a Cast node
1389 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1390 ir_mode *mymode = get_irn_mode(n);
1391 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1394 /* Conv: BB x datab1 --> datab2 */
1395 mode_is_data(op1mode) && op1mode == mymode,
1397 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1405 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1406 ir_mode *mymode = get_irn_mode(n);
1407 ir_node *block = get_nodes_block(n);
1410 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1411 /* a Phi node MUST have the same number of inputs as its block */
1413 get_irn_arity(n) == get_irn_arity(block),
1414 "wrong number of inputs in Phi node", 0,
1415 show_phi_inputs(n, block);
1419 /* Phi: BB x dataM^n --> dataM */
1420 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1421 ir_node *pred = get_irn_n(n, i);
1422 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown))
1424 get_irn_mode(pred) == mymode,
1426 show_phi_failure(n, pred, i);
1429 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1431 if (mymode == mode_M) {
1432 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1434 ir_node *pred_i = get_Phi_pred(n, i);
1438 for (j = i - 1; j >= 0; --j) {
1439 ir_node *pred_j = get_Phi_pred(n, j);
1444 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1445 "At least two different PhiM predecessors are in the same block",
1447 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1456 * verify a Filter node
1458 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1459 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1460 "Filter may only appear if ip view is constructed.", 0);
1461 /* We should further do tests as for Proj and Phi. */
1466 * verify a Load node
1468 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1469 ir_mode *mymode = get_irn_mode(n);
1470 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1471 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1474 /* Load: BB x M x ref --> M x X x data */
1475 op1mode == mode_M && mode_is_reference(op2mode),
1478 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1481 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1482 * (Proj (Proj))) sometimes ...
1484 * interprete.c:ai_eval seems to assume that this happens, too
1486 * obset.c:get_abstval_any can't deal with this if the load has
1490 entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1491 assert ((NULL != ent) || (mymode != mode_T));
1499 * verify a Store node
1501 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1504 ir_mode *mymode = get_irn_mode(n);
1505 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1506 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1507 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1510 /* Store: BB x M x ref x data --> M x X */
1511 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
1514 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1516 target = get_ptr_entity(get_Store_ptr(n));
1517 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1519 * If lowered code, any Sels that add 0 may be removed, causing
1520 * an direct access to entities of array or compound type.
1521 * Prevent this by checking the phase.
1523 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1531 * verify an Alloc node
1533 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1534 ir_mode *mymode = get_irn_mode(n);
1535 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1536 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1539 /* Alloc: BB x M x int_u --> M x X x ref */
1540 op1mode == mode_M &&
1541 mode_is_int(op2mode) &&
1542 !mode_is_signed(op2mode) &&
1545 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1551 * verify a Free node
1553 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1554 ir_mode *mymode = get_irn_mode(n);
1555 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1556 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1557 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1560 /* Free: BB x M x ref x int_u --> M */
1561 op1mode == mode_M && mode_is_reference(op2mode) &&
1562 mode_is_int(op3mode) &&
1563 !mode_is_signed(op3mode) &&
1566 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1572 * verify a Sync node
1574 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1576 ir_mode *mymode = get_irn_mode(n);
1578 /* Sync: BB x M^n --> M */
1579 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1580 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1582 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1587 * verify a Confirm node
1589 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1590 ir_mode *mymode = get_irn_mode(n);
1591 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1592 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1595 /* Confirm: BB x T x T --> T */
1596 op1mode == mymode &&
1599 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1607 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1608 ir_mode *mymode = get_irn_mode(n);
1609 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1610 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1611 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1614 /* Mux: BB x b x numP x numP --> numP */
1615 op1mode == mode_b &&
1616 op2mode == mymode &&
1617 op3mode == mymode &&
1618 mode_is_numP(mymode),
1625 * verify a CopyB node
1627 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1628 ir_mode *mymode = get_irn_mode(n);
1629 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1630 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1631 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1632 ir_type *t = get_CopyB_type(n);
1634 /* CopyB: BB x M x ref x ref --> M x X */
1637 op1mode == mode_M &&
1638 mode_is_reference(op2mode) &&
1639 mode_is_reference(op3mode),
1640 "CopyB node", 0 ); /* operand M x ref x ref */
1643 is_compound_type(t),
1644 "CopyB node should copy compound types only", 0 );
1646 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1647 This should happen RARELY, as CopyB COPIES MEMORY */
1649 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1650 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1651 "CopyB node with wrong memory input", 0 );
1656 * verify a Bound node
1658 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1659 ir_mode *mymode = get_irn_mode(n);
1660 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1661 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1662 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1663 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1665 /* Bound: BB x M x ref x ref --> M x X */
1668 op1mode == mode_M &&
1669 op2mode == op3mode &&
1670 op3mode == op4mode &&
1671 mode_is_int(op3mode),
1672 "Bound node", 0 ); /* operand M x int x int x int */
1674 /* NoMem nodes are only allowed as memory input if the Bound is NOT pinned.
1675 This should happen RARELY, as Bound COPIES MEMORY */
1677 (get_irn_op(get_Bound_mem(n)) == op_NoMem) ||
1678 (get_irn_op(get_Bound_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1679 "Bound node with wrong memory input", 0 );
1685 * For each usage of a node, it is checked, if the block of the
1686 * node dominates the block of the usage (for phis: the predecessor
1687 * block of the phi for the corresponding edge).
1689 * @return non-zero on success, 0 on dominance error
1691 static int check_dominance_for_node(ir_node *use)
1693 /* This won't work for blocks and the end node */
1694 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1696 ir_node *bl = get_nodes_block(use);
1698 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1699 ir_node *def = get_irn_n(use, i);
1700 ir_node *def_bl = get_nodes_block(def);
1701 ir_node *use_bl = bl;
1703 /* ignore dead definition blocks, will be removed */
1704 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1708 use_bl = get_Block_cfgpred_block(bl, i);
1710 /* ignore dead use blocks, will be removed */
1711 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1715 block_dominates(def_bl, use_bl),
1716 "the definition of a value used violates the dominance property", 0,
1718 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1719 current_ir_graph, def_bl, def, use_bl, use, i
1727 /* Tests the modes of n and its predecessors. */
1728 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
1733 if (!get_node_verification_mode())
1736 if (!get_interprocedural_view()) {
1738 * do NOT check placement in interprocedural view, as we don't always know
1739 * the "right" graph ...
1742 node_is_in_irgs_storage(irg, n),
1743 "Node is not stored on proper IR graph!", 0,
1744 show_node_on_graph(irg, n);
1746 assert(get_irn_irg(n) == irg);
1748 unsigned idx = get_irn_idx(n);
1749 ir_node *node_from_map = get_idx_irn(irg, idx);
1750 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));
1756 /* We don't want to test nodes whose predecessors are Bad,
1757 as we would have to special case that for each operation. */
1758 if (op != op_Phi && op != op_Block)
1759 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1760 if (is_Bad(get_irn_n(n, i)))
1764 if (op->ops.verify_node)
1765 return op->ops.verify_node(n, irg);
1771 int irn_vrfy(ir_node *n)
1774 #ifdef DEBUG_libfirm
1775 res = irn_vrfy_irg(n, current_ir_graph);
1780 /*-----------------------------------------------------------------*/
1781 /* Verify the whole graph. */
1782 /*-----------------------------------------------------------------*/
1784 #ifdef DEBUG_libfirm
1786 * Walker to check every node
1788 static void vrfy_wrap(ir_node *node, void *env) {
1790 *res = irn_vrfy(node);
1794 * Walker to check every node including SSA property.
1795 * Only called if dominance info is available.
1797 static void vrfy_wrap_ssa(ir_node *node, void *env)
1801 *res = irn_vrfy(node);
1803 *res = check_dominance_for_node(node);
1806 #endif /* DEBUG_libfirm */
1809 * Calls irn_vrfy for each node in irg.
1810 * Graph must be in state "op_pin_state_pinned".
1811 * If dominance info is available, check the SSA property.
1813 int irg_verify(ir_graph *irg, unsigned flags)
1816 #ifdef DEBUG_libfirm
1819 rem = current_ir_graph;
1820 current_ir_graph = irg;
1821 last_irg_error = NULL;
1823 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1825 if (flags & VRFY_ENFORCE_SSA)
1830 get_irg_dom_state(irg) == dom_consistent &&
1831 get_irg_pinned(irg) == op_pin_state_pinned ?
1832 vrfy_wrap_ssa : vrfy_wrap,
1836 current_ir_graph = rem;
1838 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1839 entity *ent = get_irg_entity(current_ir_graph);
1842 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1844 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1846 #endif /* DEBUG_libfirm */
1851 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string)
1854 firm_verification_t old = get_node_verification_mode();
1856 firm_vrfy_failure_msg = NULL;
1857 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1858 res = irn_vrfy_irg(n, irg);
1859 if (res && get_irg_dom_state(irg) == dom_consistent &&
1860 get_irg_pinned(irg) == op_pin_state_pinned)
1861 res = check_dominance_for_node(n);
1862 do_node_verification(old);
1863 *bad_string = firm_vrfy_failure_msg;
1869 typedef struct _vrfy_bad_env_t {
1875 * Pre-Walker: check Bad predecessors of node.
1877 static void check_bads(ir_node *node, void *env)
1879 vrfy_bad_env_t *venv = env;
1880 int i, arity = get_irn_arity(node);
1882 if (is_Block(node)) {
1883 if ((venv->flags & BAD_CF) == 0) {
1885 /* check for Bad Block predecessor */
1886 for (i = 0; i < arity; ++i) {
1887 ir_node *pred = get_irn_n(node, i);
1890 venv->res |= BAD_CF;
1892 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1893 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1895 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1896 assert(0 && "Bad CF detected");
1903 if ((venv->flags & BAD_BLOCK) == 0) {
1905 /* check for Bad Block */
1906 if (is_Bad(get_nodes_block(node))) {
1907 venv->res |= BAD_BLOCK;
1909 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1910 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1912 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1913 assert(0 && "Bad CF detected");
1918 if ((venv->flags & TUPLE) == 0) {
1919 if (get_irn_op(node) == op_Tuple) {
1922 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1923 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
1925 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1926 assert(0 && "Tuple detected");
1931 for (i = 0; i < arity; ++i) {
1932 ir_node *pred = get_irn_n(node, i);
1935 /* check for Phi with Bad inputs */
1936 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
1937 if (venv->flags & BAD_CF)
1940 venv->res |= BAD_CF;
1942 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1943 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
1945 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1946 assert(0 && "Bad CF detected");
1951 /* Bad node input */
1952 if ((venv->flags & BAD_DF) == 0) {
1953 venv->res |= BAD_DF;
1955 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1956 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
1958 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1959 assert(0 && "Bad NON-CF detected");
1968 * verify occurrence of bad nodes
1970 int irg_vrfy_bads(ir_graph *irg, int flags)
1977 irg_walk_graph(irg, check_bads, NULL, &env);
1983 * set the default verify operation
1985 void firm_set_default_verifyer(opcode code, ir_op_ops *ops)
1989 ops->verify_node = verify_node_##a; \
2045 ops->verify_proj_node = verify_node_Proj_##a; \