3 * File name: ir/ir/irvrfy.c
4 * Purpose: Check irnodes for correctness.
5 * Author: Christian Schaefer
6 * Modified by: Goetz Lindenmaier. Till Riedel
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 # include "irgraph_t.h"
23 * in RELEASE mode, returns ret if the expression expr evaluates to zero
24 * in ASSERT mode, asserts the expression expr (and the string string).
26 #define ASSERT_AND_RET(expr, string, ret) if (!(expr)) return (ret)
29 * in RELEASE mode, returns ret if the expression expr evaluates to zero
30 * in ASSERT mode, executes blk if the expression expr evaluates to zero and asserts
32 #define ASSERT_AND_RET_DBG(expr, string, ret, blk) if (!(expr)) return (ret)
34 #define ASSERT_AND_RET(expr, string, ret) do { assert((expr) && string); if (!(expr)) return (ret); } while(0)
35 #define ASSERT_AND_RET_DBG(expr, string, ret, blk) do { if (!(expr)) { { blk } assert(0 && string); return (ret); } } while(0)
38 /* @@@ replace use of array "in" by access functions. */
39 ir_node **get_irn_in(ir_node *node);
41 bool opt_do_node_verification = 1;
42 void do_node_verification(bool b) {
43 opt_do_node_verification = b;
48 vrfy_Proj_proj(ir_node *p, ir_graph *irg) {
53 pred = skip_nop(get_Proj_pred(p));
54 assert(get_irn_mode(pred) == mode_T);
55 mode = get_irn_mode(p);
56 proj = get_Proj_proj(p);
58 switch (get_irn_opcode(pred)) {
62 (proj == pns_initial_exec && mode == mode_X) ||
63 (proj == pns_global_store && mode == mode_M) ||
64 (proj == pns_frame_base && mode_is_reference(mode)) ||
65 (proj == pns_globals && mode_is_reference(mode)) ||
66 (proj == pns_args && mode == mode_T) ||
67 (proj == pns_value_arg_base && mode_is_reference(mode))
69 "wrong Proj from Start", 0);
73 ASSERT_AND_RET( (proj >= 0 && mode == mode_X), "wrong Proj from Cond", 0);
78 ((proj == 0 && mode == mode_X) ||
79 (proj == 1 && mode == mode_M)),
80 "wrong Proj from Raise", 0);
84 ASSERT_AND_RET( (proj >= 0 && mode == mode_X), "wrong Proj from InstOf", 0);
89 ((proj == 0 && mode == mode_M) ||
90 (proj == 1 && mode == mode_X) ||
91 (proj == 2 && mode == mode_T) ||
92 (proj == 3 && mode == mode_M)),
93 "wrong Proj from Call", 0);
98 ((proj == 0 && mode == mode_M) ||
99 (proj == 1 && mode == mode_X) ||
100 (proj == 2 && mode_is_float(mode))),
101 "wrong Proj from Quot", 0);
106 ((proj == 0 && mode == mode_M) ||
107 (proj == 1 && mode == mode_X) ||
108 (proj == 2 && mode == mode_Is) ||
109 (proj == 3 && mode_is_int(mode))),
110 "wrong Proj from DivMod", 0);
116 ((proj == 0 && mode == mode_M) ||
117 (proj == 1 && mode == mode_X) ||
118 (proj == 2 && mode_is_int(mode))),
119 "wrong Proj from Div or Mod", 0);
124 (proj >= 0 && proj <= 15 && mode == mode_b),
125 "wrong Proj from Cmp", 0);
129 if (proj == pn_Load_res) {
130 ir_node *ptr = get_Load_ptr(pred);
132 if (get_irn_op(ptr) == op_Sel) {
133 ent = get_Sel_entity(ptr);
135 We may not test this, after lowering and optimization the Const can
136 have an unexpected type.
137 else if ((get_irn_op(ptr) == op_Const) &&
138 tarval_is_entity(get_Const_tarval(ptr))) {
139 ent = get_tarval_entity(get_Const_tarval(ptr));
142 ASSERT_AND_RET((mode == get_type_mode(get_entity_type(ent))),
143 "wrong data Proj from Load", 0);
145 ASSERT_AND_RET(mode_is_data(mode),
146 "wrong data Proj from Load", 0);
148 ASSERT_AND_RET(((proj == pn_Load_M && mode == mode_M) ||
149 (proj == pn_Load_X_except && mode == mode_X)),
150 "wrong Proj from Load", 0);
156 ((proj == 0 && mode == mode_M) ||
157 (proj == 1 && mode == mode_X)),
158 "wrong Proj from Store", 0);
164 (proj == 0 && mode == mode_M) ||
165 (proj == 1 /* && mode == mode_X*/) ||
166 (proj == 2 && mode_is_reference(mode))
168 "wrong Proj from Alloc", 0);
173 type *mt; /* A method type */
174 pred = skip_nop(get_Proj_pred(pred));
175 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
176 switch (get_irn_opcode(pred))
181 (proj >= 0 && mode_is_data(mode)),
182 "wrong Proj from Proj from Start", 0);
183 mt = get_entity_type(get_irg_ent(irg));
185 (proj < get_method_n_params(mt)),
186 "More Projs for args than args in type", 0);
187 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
188 /* value argument */ break;
191 (mode == get_type_mode(get_method_param_type(mt, proj))),
192 "Mode of Proj from Start doesn't match mode of param type.", 0);
199 (proj >= 0 && mode_is_data(mode)),
200 "wrong Proj from Proj from Call", 0);
201 mt = get_Call_type(pred);
203 (proj < get_method_n_ress(mt)),
204 "More Projs for results than results in type.", 0);
205 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
206 /* value result */ break;
209 (mode == get_type_mode(get_method_res_type(mt, proj))),
210 "Mode of Proj from Call doesn't match mode of result type.", 0);
219 ASSERT_AND_RET(0, "Unknown opcode", 0);
238 ASSERT_AND_RET(0, "Unknown opcode", 0);
245 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
249 ir_mode *mymode, *op1mode = NULL, *op2mode, *op3mode;
250 int op_is_symmetric = 1; /* 0: asymmetric
251 1: operands have identical modes
252 2: modes of operands == mode of this node */
253 type *mt; /* A method type */
257 if (!opt_do_node_verification) return 1;
259 if (! interprocedural_view) {
261 * do NOT check placement in interprocedural view, as we don't always know
262 * the "right" graph ...
264 ASSERT_AND_RET(node_is_in_irgs_storage(irg, n), "Node is not stored on proper IR graph!", 0);
267 opcode = get_irn_opcode (n);
269 /* We don't want to test nodes whose predecessors are Bad or Unknown,
270 as we would have to special case that for each operation. */
271 if (opcode != iro_Phi && opcode != iro_Block)
272 for (i = 0; i < get_irn_arity(n); i++) {
273 opcode1 = get_irn_opcode(get_irn_n(n, i));
274 if (opcode1 == iro_Bad || opcode1 == iro_Unknown)
278 mymode = get_irn_mode (n);
285 for (i = 0; i < get_Block_n_cfgpreds(n); ++i) {
286 ir_node *pred = get_Block_cfgpred(n, i);
287 ASSERT_AND_RET((is_Bad(pred) ||
288 (get_irn_op(pred) == op_Unknown) ||
289 (get_irn_mode(pred) == mode_X) ),
292 // End block may only have Return, Raise or fragile ops as preds.
293 if (n == get_irg_end_block(irg))
294 for (i = 0; i < get_Block_n_cfgpreds(n); ++i) {
295 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
296 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
297 break; // We can not test properly. How many tuples are there?
298 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
300 (get_irn_op(pred) == op_Raise) ||
301 is_fragile_op(pred) ),
302 "End Block node", 0);
304 // irg attr must == graph we are in.
305 if (! interprocedural_view) {
306 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "", 0);
313 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
314 mymode == mode_T, "Start node", 0
321 mymode == mode_X, "Jmp node", 0
328 mymode == mode_X, "Jmp node", 0
333 op1mode = get_irn_mode(in[1]);
335 /* Cond: BB x b --> X x X */
336 (op1mode == mode_b ||
337 /* Cond: BB x int --> X^n */
338 mode_is_int(op1mode) ), "Cond node", 0
340 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
344 op1mode = get_irn_mode(in[1]);
345 /* Return: BB x M x data1 x ... x datan --> X */
346 /* printf("mode: %s, code %s\n", ID_TO_STR(n->mode->name), ID_TO_STR(n->op->name));*/
347 ASSERT_AND_RET( op1mode == mode_M, "Return node", 0 ); /* operand M */
348 for (i=2; i < get_irn_arity(n); i++) {
349 ASSERT_AND_RET( mode_is_data(get_irn_mode(in[i])), "Return node", 0 ); /* operand datai */
351 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
352 /* Compare returned results with result types of method type */
353 mt = get_entity_type(get_irg_ent(irg));
354 ASSERT_AND_RET( get_Return_n_ress(n) == get_method_n_ress(mt),
355 "Number of results for Return doesn't match number of results in type.", 0 );
356 for (i = 0; i < get_Return_n_ress(n); i++)
358 get_irn_mode(get_Return_res(n, i)) == get_type_mode(get_method_res_type(mt, i)),
359 "Mode of result for Return doesn't match mode of result type.", 0);
363 op1mode = get_irn_mode(in[1]);
364 op2mode = get_irn_mode(in[2]);
366 /* Sel: BB x M x ref --> X x M */
367 op1mode == mode_M && mode_is_reference(op2mode) &&
368 mymode == mode_T, "Raise node", 0
374 /* Const: BB --> data */
375 (mode_is_data (mymode) ||
376 mymode == mode_b) /* we want boolean constants for static evaluation */
377 ,"Const node", 0 /* of Cmp. */
383 /* SymConst: BB --> int*/
384 (mode_is_int(mymode) ||
385 /* SymConst: BB --> ref */
386 mode_is_reference(mymode))
387 ,"SymConst node", 0);
391 op1mode = get_irn_mode(in[1]);
392 op2mode = get_irn_mode(in[2]);
394 /* Sel: BB x M x ref x int^n --> ref */
395 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
398 for (i=3; i < get_irn_arity(n); i++)
400 ASSERT_AND_RET(mode_is_int(get_irn_mode(in[i])), "Sel node", 0);
405 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
406 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
410 op1mode = get_irn_mode(in[1]);
411 op2mode = get_irn_mode(in[2]);
412 /* Call: BB x M x ref x data1 x ... x datan
413 --> M x datan+1 x ... x data n+m */
414 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
415 for (i=3; i < get_irn_arity(n); i++) {
416 ASSERT_AND_RET( mode_is_data(get_irn_mode(in[i])), "Call node", 0 ); /* operand datai */
418 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
419 /* Compare arguments of node with those of type */
420 mt = get_Call_type(n);
422 if (get_method_variadicity(mt) == variadicity_variadic) {
424 get_Call_n_params(n) >= get_method_n_params(mt),
425 "Number of args for Call doesn't match number of args in variadic type.",
430 get_Call_n_params(n) == get_method_n_params(mt),
431 "Number of args for Call doesn't match number of args in non variadic type.",
435 for (i = 0; i < get_method_n_params(mt); i++) {
437 get_irn_mode(get_Call_param(n, i)) == get_type_mode(get_method_param_type(mt, i)),
438 "Mode of arg for Call doesn't match mode of arg type.", 0,
442 fprintf(stderr, "Assertion for Call type-check failed: %s(", get_type_name(mt));
443 for (i = 0; i < get_method_n_params(mt); ++i) {
444 fprintf(stderr, "%s ", get_mode_name(get_type_mode(get_method_param_type(mt, i))));
446 fprintf(stderr, ") != CALL(");
448 for (i = 0; i < get_Call_n_params(n); ++i) {
449 fprintf(stderr, "%s ", get_mode_name(get_irn_mode(get_Call_param(n, i))));
451 fprintf(stderr, ")\n");
459 op1mode = get_irn_mode(in[1]);
460 op2mode = get_irn_mode(in[2]);
463 /* common Add: BB x numP x numP --> numP */
464 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
465 /* Pointer Add: BB x ref x int --> ref */
466 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
467 /* Pointer Add: BB x int x ref --> ref */
468 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
472 if (mode_is_reference(op1mode) != mode_is_reference(op2mode)) {
473 /* BB x ref x int --> ref or BB x int x ref --> ref */
476 /* BB x num x num --> num or BB x ref x ref */
482 op1mode = get_irn_mode(in[1]);
483 op2mode = get_irn_mode(in[2]);
485 /* common Sub: BB x numP x numP --> numP */
486 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
487 /* Pointer Sub: BB x ref x int --> ref */
488 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
489 /* Pointer Sub: BB x int x ref --> ref */
490 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
491 /* Pointer Sub: BB x ref x ref --> int */
492 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
495 if (mode_is_reference(op1mode) != mode_is_reference(op2mode)) {
503 op1mode = get_irn_mode(in[1]);
505 /* Minus: BB x float --> float */
506 op1mode == mymode && get_mode_sort(op1mode) == irms_float_number, "Minus node", 0
512 op1mode = get_irn_mode(in[1]);
513 op2mode = get_irn_mode(in[2]);
515 /* Mul: BB x int1 x int1 --> int2 */
516 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
517 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
524 op1mode = get_irn_mode(in[1]);
525 op2mode = get_irn_mode(in[2]);
526 op3mode = get_irn_mode(in[3]);
528 /* Quot: BB x M x float x float --> M x X x float */
529 op1mode == mode_M && op2mode == op3mode &&
530 get_mode_sort(op2mode) == irms_float_number &&
538 op1mode = get_irn_mode(in[1]);
539 op2mode = get_irn_mode(in[2]);
540 op3mode = get_irn_mode(in[3]);
542 /* DivMod: BB x M x int x int --> M x X x int x int */
544 mode_is_int(op2mode) &&
545 op3mode == op2mode &&
554 op1mode = get_irn_mode(in[1]);
555 op2mode = get_irn_mode(in[2]);
556 op3mode = get_irn_mode(in[3]);
558 /* Div or Mod: BB x M x int x int --> M x X x int */
560 op2mode == op3mode &&
561 mode_is_int(op2mode) &&
569 op1mode = get_irn_mode(in[1]);
571 /* Abs: BB x num --> num */
573 mode_is_num (op1mode),
582 op1mode = get_irn_mode(in[1]);
583 op2mode = get_irn_mode(in[2]);
585 /* And or Or or Eor: BB x int x int --> int */
586 mode_is_int(mymode) &&
587 op2mode == op1mode &&
589 "And, Or or Eor node", 0
595 op1mode = get_irn_mode(in[1]);
597 /* Not: BB x int --> int */
598 mode_is_int(mymode) &&
607 op1mode = get_irn_mode(in[1]);
608 op2mode = get_irn_mode(in[2]);
610 /* Cmp: BB x datab x datab --> b16 */
611 mode_is_data (op1mode) &&
612 op2mode == op1mode &&
621 op1mode = get_irn_mode(in[1]);
622 op2mode = get_irn_mode(in[2]);
624 /* Shl, Shr or Shrs: BB x int x int_u --> int */
625 mode_is_int(op1mode) &&
626 mode_is_int(op2mode) &&
627 !mode_is_signed(op2mode) &&
629 "Shl, Shr, Shr or Rot node"
634 op1mode = get_irn_mode(in[1]);
635 op2mode = get_irn_mode(in[2]);
637 /* Rot: BB x int x int --> int */
638 mode_is_int(op1mode) &&
639 mode_is_int(op2mode) &&
646 op1mode = get_irn_mode(in[1]);
648 /* Conv: BB x datab1 --> datab2 */
649 mode_is_datab(op1mode) && mode_is_data(mymode),
655 op1mode = get_irn_mode(in[1]);
657 /* Conv: BB x datab1 --> datab2 */
658 mode_is_data(op1mode) && op1mode == mymode,
664 /* Phi: BB x dataM^n --> dataM */
665 /* for some reason "<=" aborts. int there a problem with get_store? */
666 for (i=1; i < get_irn_arity(n); i++) {
667 if (!is_Bad(in[i]) && (get_irn_op(in[i]) != op_Unknown))
668 ASSERT_AND_RET( get_irn_mode(in[i]) == mymode, "Phi node", 0);
670 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
674 op1mode = get_irn_mode(in[1]);
675 op2mode = get_irn_mode(in[2]);
677 /* Load: BB x M x ref --> M x X x data */
678 op1mode == mode_M && mode_is_reference(op2mode),
681 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
685 op1mode = get_irn_mode(in[1]);
686 op2mode = get_irn_mode(in[2]);
687 op3mode = get_irn_mode(in[3]);
689 /* Load: BB x M x ref data --> M x X */
690 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
693 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
697 op1mode = get_irn_mode(in[1]);
698 op2mode = get_irn_mode(in[2]);
700 /* Alloc: BB x M x int_u --> M x X x ref */
702 mode_is_int(op2mode) &&
703 !mode_is_signed(op2mode) &&
710 op1mode = get_irn_mode(in[1]);
711 op2mode = get_irn_mode(in[2]);
713 /* Free: BB x M x ref --> M */
714 op1mode == mode_M && mode_is_reference(op2mode) &&
721 /* Sync: BB x M^n --> M */
722 for (i=1; i < get_irn_arity(n); i++) {
723 ASSERT_AND_RET( get_irn_mode(in[i]) == mode_M, "Sync node", 0 );
725 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
729 return vrfy_Proj_proj(n, irg);
733 op1mode = get_irn_mode(in[1]);
734 op2mode = get_irn_mode(in[2]);
736 /* Confirm: BB x T x T --> T */
752 int irn_vrfy(ir_node *n)
754 return irn_vrfy_irg(n, current_ir_graph);
757 /*******************************************************************/
758 /* Verify the whole graph. */
759 /*******************************************************************/
761 static void vrfy_wrap(ir_node *node, void *env)
765 *res = irn_vrfy(node);
768 int irg_vrfy(ir_graph *irg)
773 rem = current_ir_graph;
774 current_ir_graph = irg;
776 assert(get_irg_pinned(irg) == pinned);
778 irg_walk(irg->end, vrfy_wrap, NULL, &res);
780 current_ir_graph = rem;