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);
134 } else if ((get_irn_op(ptr) == op_Const) &&
135 tarval_is_entity(get_Const_tarval(ptr))) {
136 ent = get_tarval_entity(get_Const_tarval(ptr));
139 ASSERT_AND_RET((mode == get_type_mode(get_entity_type(ent))),
140 "wrong data Proj from Load", 0);
142 ASSERT_AND_RET(mode_is_data(mode),
143 "wrong data Proj from Load", 0);
145 ASSERT_AND_RET(((proj == pn_Load_M && mode == mode_M) ||
146 (proj == pn_Load_X_except && mode == mode_X)),
147 "wrong Proj from Load", 0);
153 ((proj == 0 && mode == mode_M) ||
154 (proj == 1 && mode == mode_X)),
155 "wrong Proj from Store", 0);
161 (proj == 0 && mode == mode_M) ||
162 (proj == 1 /* && mode == mode_X*/) ||
163 (proj == 2 && mode_is_reference(mode))
165 "wrong Proj from Alloc", 0);
170 type *mt; /* A method type */
171 pred = skip_nop(get_Proj_pred(pred));
172 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
173 switch (get_irn_opcode(pred))
178 (proj >= 0 && mode_is_data(mode)),
179 "wrong Proj from Proj from Start", 0);
180 mt = get_entity_type(get_irg_ent(irg));
182 (proj < get_method_n_params(mt)),
183 "More Projs for args than args in type", 0);
184 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
185 /* value argument */ break;
188 (mode == get_type_mode(get_method_param_type(mt, proj))),
189 "Mode of Proj from Start doesn't match mode of param type.", 0);
196 (proj >= 0 && mode_is_data(mode)),
197 "wrong Proj from Proj from Call", 0);
198 mt = get_Call_type(pred);
200 (proj < get_method_n_ress(mt)),
201 "More Projs for results than results in type.", 0);
202 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
203 /* value result */ break;
206 (mode == get_type_mode(get_method_res_type(mt, proj))),
207 "Mode of Proj from Call doesn't match mode of result type.", 0);
216 ASSERT_AND_RET(0, "Unknown opcode", 0);
235 ASSERT_AND_RET(0, "Unknown opcode", 0);
242 int irn_vrfy_irg(ir_node *n, ir_graph *irg)
246 ir_mode *mymode, *op1mode = NULL, *op2mode, *op3mode;
247 int op_is_symmetric = 1; /* 0: asymmetric
248 1: operands have identical modes
249 2: modes of operands == mode of this node */
250 type *mt; /* A method type */
254 if (!opt_do_node_verification) return 1;
256 if (! interprocedural_view) {
258 * do NOT check placement in interprocedural view, as we don't always know
259 * the "right" graph ...
261 ASSERT_AND_RET(node_is_in_irgs_storage(irg, n), "Node is not stored on proper IR graph!", 0);
264 opcode = get_irn_opcode (n);
266 /* We don't want to test nodes whose predecessors are Bad or Unknown,
267 as we would have to special case that for each operation. */
268 if (opcode != iro_Phi && opcode != iro_Block)
269 for (i = 0; i < get_irn_arity(n); i++) {
270 opcode1 = get_irn_opcode(get_irn_n(n, i));
271 if (opcode1 == iro_Bad || opcode1 == iro_Unknown)
275 mymode = get_irn_mode (n);
282 for (i = 0; i < get_Block_n_cfgpreds(n); ++i) {
283 ir_node *pred = get_Block_cfgpred(n, i);
284 ASSERT_AND_RET((is_Bad(pred) ||
285 (get_irn_op(pred) == op_Unknown) ||
286 (get_irn_mode(pred) == mode_X) ),
289 // End block may only have Return, Raise or fragile ops as preds.
290 if (n == get_irg_end_block(irg))
291 for (i = 0; i < get_Block_n_cfgpreds(n); ++i) {
292 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
293 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
294 break; // We can not test properly. How many tuples are there?
295 ASSERT_AND_RET(((get_irn_op(pred) == op_Return) ||
297 (get_irn_op(pred) == op_Raise) ||
298 is_fragile_op(pred) ),
299 "End Block node", 0);
301 // irg attr must == graph we are in.
302 if (! interprocedural_view) {
303 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "", 0);
310 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
311 mymode == mode_T, "Start node", 0
318 mymode == mode_X, "Jmp node", 0
325 mymode == mode_X, "Jmp node", 0
330 op1mode = get_irn_mode(in[1]);
332 /* Cond: BB x b --> X x X */
333 (op1mode == mode_b ||
334 /* Cond: BB x int --> X^n */
335 mode_is_int(op1mode) ), "Cond node", 0
337 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
341 op1mode = get_irn_mode(in[1]);
342 /* Return: BB x M x data1 x ... x datan --> X */
343 /* printf("mode: %s, code %s\n", ID_TO_STR(n->mode->name), ID_TO_STR(n->op->name));*/
344 ASSERT_AND_RET( op1mode == mode_M, "Return node", 0 ); /* operand M */
345 for (i=2; i < get_irn_arity(n); i++) {
346 ASSERT_AND_RET( mode_is_data(get_irn_mode(in[i])), "Return node", 0 ); /* operand datai */
348 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
349 /* Compare returned results with result types of method type */
350 mt = get_entity_type(get_irg_ent(irg));
351 ASSERT_AND_RET( get_Return_n_ress(n) == get_method_n_ress(mt),
352 "Number of results for Return doesn't match number of results in type.", 0 );
353 for (i = 0; i < get_Return_n_ress(n); i++)
355 get_irn_mode(get_Return_res(n, i)) == get_type_mode(get_method_res_type(mt, i)),
356 "Mode of result for Return doesn't match mode of result type.", 0);
360 op1mode = get_irn_mode(in[1]);
361 op2mode = get_irn_mode(in[2]);
363 /* Sel: BB x M x ref --> X x M */
364 op1mode == mode_M && mode_is_reference(op2mode) &&
365 mymode == mode_T, "Raise node", 0
371 /* Const: BB --> data */
372 (mode_is_data (mymode) ||
373 mymode == mode_b) /* we want boolean constants for static evaluation */
374 ,"Const node", 0 /* of Cmp. */
380 /* SymConst: BB --> int*/
381 (mode_is_int(mymode) ||
382 /* SymConst: BB --> ref */
383 mode_is_reference(mymode))
384 ,"SymConst node", 0);
388 op1mode = get_irn_mode(in[1]);
389 op2mode = get_irn_mode(in[2]);
391 /* Sel: BB x M x ref x int^n --> ref */
392 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
395 for (i=3; i < get_irn_arity(n); i++)
397 ASSERT_AND_RET(mode_is_int(get_irn_mode(in[i])), "Sel node", 0);
402 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
403 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
407 op1mode = get_irn_mode(in[1]);
408 op2mode = get_irn_mode(in[2]);
409 /* Call: BB x M x ref x data1 x ... x datan
410 --> M x datan+1 x ... x data n+m */
411 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
412 for (i=3; i < get_irn_arity(n); i++) {
413 ASSERT_AND_RET( mode_is_data(get_irn_mode(in[i])), "Call node", 0 ); /* operand datai */
415 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
416 /* Compare arguments of node with those of type */
417 mt = get_Call_type(n);
419 if (get_method_variadicity(mt) == variadicity_variadic) {
421 get_Call_n_params(n) >= get_method_n_params(mt),
422 "Number of args for Call doesn't match number of args in variadic type.",
427 get_Call_n_params(n) == get_method_n_params(mt),
428 "Number of args for Call doesn't match number of args in non variadic type.",
432 for (i = 0; i < get_method_n_params(mt); i++) {
434 get_irn_mode(get_Call_param(n, i)) == get_type_mode(get_method_param_type(mt, i)),
435 "Mode of arg for Call doesn't match mode of arg type.", 0,
439 fprintf(stderr, "Assertion for Call type-check failed: %s(", get_type_name(mt));
440 for (i = 0; i < get_method_n_params(mt); ++i) {
441 fprintf(stderr, "%s ", get_mode_name(get_type_mode(get_method_param_type(mt, i))));
443 fprintf(stderr, ") != CALL(");
445 for (i = 0; i < get_Call_n_params(n); ++i) {
446 fprintf(stderr, "%s ", get_mode_name(get_irn_mode(get_Call_param(n, i))));
448 fprintf(stderr, ")\n");
456 op1mode = get_irn_mode(in[1]);
457 op2mode = get_irn_mode(in[2]);
460 /* common Add: BB x numP x numP --> numP */
461 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
462 /* Pointer Add: BB x ref x int --> ref */
463 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
464 /* Pointer Add: BB x int x ref --> ref */
465 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
469 if (mode_is_reference(op1mode) != mode_is_reference(op2mode)) {
470 /* BB x ref x int --> ref or BB x int x ref --> ref */
473 /* BB x num x num --> num or BB x ref x ref */
479 op1mode = get_irn_mode(in[1]);
480 op2mode = get_irn_mode(in[2]);
482 /* common Sub: BB x numP x numP --> numP */
483 ((mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
484 /* Pointer Sub: BB x ref x int --> ref */
485 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
486 /* Pointer Sub: BB x int x ref --> ref */
487 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
488 /* Pointer Sub: BB x ref x ref --> int */
489 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))),
492 if (mode_is_reference(op1mode) != mode_is_reference(op2mode)) {
500 op1mode = get_irn_mode(in[1]);
502 /* Minus: BB x float --> float */
503 op1mode == mymode && get_mode_sort(op1mode) == irms_float_number, "Minus node", 0
509 op1mode = get_irn_mode(in[1]);
510 op2mode = get_irn_mode(in[2]);
512 /* Mul: BB x int1 x int1 --> int2 */
513 ((mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
514 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)),
521 op1mode = get_irn_mode(in[1]);
522 op2mode = get_irn_mode(in[2]);
523 op3mode = get_irn_mode(in[3]);
525 /* Quot: BB x M x float x float --> M x X x float */
526 op1mode == mode_M && op2mode == op3mode &&
527 get_mode_sort(op2mode) == irms_float_number &&
535 op1mode = get_irn_mode(in[1]);
536 op2mode = get_irn_mode(in[2]);
537 op3mode = get_irn_mode(in[3]);
539 /* DivMod: BB x M x int x int --> M x X x int x int */
541 mode_is_int(op2mode) &&
542 op3mode == op2mode &&
551 op1mode = get_irn_mode(in[1]);
552 op2mode = get_irn_mode(in[2]);
553 op3mode = get_irn_mode(in[3]);
555 /* Div or Mod: BB x M x int x int --> M x X x int */
557 op2mode == op3mode &&
558 mode_is_int(op2mode) &&
566 op1mode = get_irn_mode(in[1]);
568 /* Abs: BB x num --> num */
570 mode_is_num (op1mode),
579 op1mode = get_irn_mode(in[1]);
580 op2mode = get_irn_mode(in[2]);
582 /* And or Or or Eor: BB x int x int --> int */
583 mode_is_int(mymode) &&
584 op2mode == op1mode &&
586 "And, Or or Eor node", 0
592 op1mode = get_irn_mode(in[1]);
594 /* Not: BB x int --> int */
595 mode_is_int(mymode) &&
604 op1mode = get_irn_mode(in[1]);
605 op2mode = get_irn_mode(in[2]);
607 /* Cmp: BB x datab x datab --> b16 */
608 mode_is_data (op1mode) &&
609 op2mode == op1mode &&
618 op1mode = get_irn_mode(in[1]);
619 op2mode = get_irn_mode(in[2]);
621 /* Shl, Shr or Shrs: BB x int x int_u --> int */
622 mode_is_int(op1mode) &&
623 mode_is_int(op2mode) &&
624 !mode_is_signed(op2mode) &&
626 "Shl, Shr, Shr or Rot node"
631 op1mode = get_irn_mode(in[1]);
632 op2mode = get_irn_mode(in[2]);
634 /* Rot: BB x int x int --> int */
635 mode_is_int(op1mode) &&
636 mode_is_int(op2mode) &&
643 op1mode = get_irn_mode(in[1]);
645 /* Conv: BB x datab1 --> datab2 */
646 mode_is_datab(op1mode) && mode_is_data(mymode),
652 op1mode = get_irn_mode(in[1]);
654 /* Conv: BB x datab1 --> datab2 */
655 mode_is_data(op1mode) && op1mode == mymode,
661 /* Phi: BB x dataM^n --> dataM */
662 /* for some reason "<=" aborts. int there a problem with get_store? */
663 for (i=1; i < get_irn_arity(n); i++) {
664 if (!is_Bad(in[i]) && (get_irn_op(in[i]) != op_Unknown))
665 ASSERT_AND_RET( get_irn_mode(in[i]) == mymode, "Phi node", 0);
667 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
671 op1mode = get_irn_mode(in[1]);
672 op2mode = get_irn_mode(in[2]);
674 /* Load: BB x M x ref --> M x X x data */
675 op1mode == mode_M && mode_is_reference(op2mode),
678 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
682 op1mode = get_irn_mode(in[1]);
683 op2mode = get_irn_mode(in[2]);
684 op3mode = get_irn_mode(in[3]);
686 /* Load: BB x M x ref data --> M x X */
687 op1mode == mode_M && mode_is_reference(op2mode) && mode_is_data(op3mode),
690 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
694 op1mode = get_irn_mode(in[1]);
695 op2mode = get_irn_mode(in[2]);
697 /* Alloc: BB x M x int_u --> M x X x ref */
699 mode_is_int(op2mode) &&
700 !mode_is_signed(op2mode) &&
707 op1mode = get_irn_mode(in[1]);
708 op2mode = get_irn_mode(in[2]);
710 /* Free: BB x M x ref --> M */
711 op1mode == mode_M && mode_is_reference(op2mode) &&
718 /* Sync: BB x M^n --> M */
719 for (i=1; i < get_irn_arity(n); i++) {
720 ASSERT_AND_RET( get_irn_mode(in[i]) == mode_M, "Sync node", 0 );
722 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
726 return vrfy_Proj_proj(n, irg);
730 op1mode = get_irn_mode(in[1]);
731 op2mode = get_irn_mode(in[2]);
733 /* Confirm: BB x T x T --> T */
749 int irn_vrfy(ir_node *n)
751 return irn_vrfy_irg(n, current_ir_graph);
754 /*******************************************************************/
755 /* Verify the whole graph. */
756 /*******************************************************************/
758 static void vrfy_wrap(ir_node *node, void *env)
762 *res = irn_vrfy(node);
765 int irg_vrfy(ir_graph *irg)
770 rem = current_ir_graph;
771 current_ir_graph = irg;
773 assert(get_irg_pinned(irg) == pinned);
775 irg_walk(irg->end, vrfy_wrap, NULL, &res);
777 current_ir_graph = rem;