2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Check irnodes for correctness.
23 * @author Christian Schaefer, Goetz Lindenmaier, Till Riedel, Michael Beck
32 #include "irgraph_t.h"
42 /** if this flag is set, verify entity types in Load & Store nodes */
43 static int vrfy_entities = 0;
45 const char *firm_vrfy_failure_msg;
47 /* enable verification of Load/Store entities */
48 void vrfy_enable_entity_tests(int enable) {
49 vrfy_entities = enable;
53 * little helper for NULL modes
55 static const char *get_mode_name_ex(ir_mode *mode) {
58 return get_mode_name(mode);
61 /** the last IRG, on which a verify error was found */
62 static ir_graph *last_irg_error = NULL;
65 * print the name of the entity of an verification failure
67 static void show_entity_failure(ir_node *node) {
68 ir_graph *irg = get_irn_irg(node);
70 if (last_irg_error == irg)
75 if (irg == get_const_code_irg()) {
76 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <of CONST_CODE_IRG> failed\n");
78 ir_entity *ent = get_irg_entity(irg);
81 ir_type *ent_type = get_entity_owner(ent);
84 if (ent_type == get_glob_type())
85 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s failed\n", get_entity_name(ent));
87 fprintf(stderr, "\nFIRM: irn_vrfy_irg() %s::%s failed\n", get_type_name(ent_type), get_entity_name(ent));
89 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <NULL>::%s failed\n", get_entity_name(ent));
92 fprintf(stderr, "\nFIRM: irn_vrfy_irg() <IRG %p> failed\n", (void *)irg);
98 * Prints a failure for a Node
100 static void show_node_failure(ir_node *n) {
101 show_entity_failure(n);
102 fprintf(stderr, " node %ld %s%s\n" ,
104 get_irn_opname(n), get_irn_modename(n)
109 * Prints a failure message for a binop
111 static void show_binop_failure(ir_node *n, const char *text) {
112 ir_node *left = get_binop_left(n);
113 ir_node *right = get_binop_right(n);
115 show_entity_failure(n);
116 fprintf(stderr, " node %ld %s%s(%s%s, %s%s) did not match (%s)\n",
118 get_irn_opname(n), get_irn_modename(n),
119 get_irn_opname(left), get_irn_modename(left),
120 get_irn_opname(right), get_irn_modename(right),
125 * Prints a failure message for an unop
127 static void show_unop_failure(ir_node *n, const char *text) {
128 ir_node *op = get_unop_op(n);
130 show_entity_failure(n);
131 fprintf(stderr, " node %ld %s%s(%s%s) did not match (%s)\n",
133 get_irn_opname(n), get_irn_modename(n),
134 get_irn_opname(op), get_irn_modename(op),
139 * Prints a failure message for an op with 3 operands
141 static void show_triop_failure(ir_node *n, const char *text) {
142 ir_node *op0 = get_irn_n(n, 0);
143 ir_node *op1 = get_irn_n(n, 1);
144 ir_node *op2 = get_irn_n(n, 2);
146 show_entity_failure(n);
147 fprintf(stderr, " of node %ld %s%s(%s%s, %s%s, %s%s) did not match (%s)\n",
149 get_irn_opname(n), get_irn_modename(n),
150 get_irn_opname(op0), get_irn_modename(op0),
151 get_irn_opname(op1), get_irn_modename(op1),
152 get_irn_opname(op2), get_irn_modename(op2),
157 * Prints a failure message for a proj
159 static void show_proj_failure(ir_node *n) {
160 ir_node *op = get_Proj_pred(n);
161 int proj = get_Proj_proj(n);
163 show_entity_failure(n);
164 fprintf(stderr, " node %ld %s%s %d(%s%s) failed\n" ,
166 get_irn_opname(n), get_irn_modename(n), proj,
167 get_irn_opname(op), get_irn_modename(op));
171 * Prints a failure message for a proj from Start
173 static void show_proj_mode_failure(ir_node *n, ir_type *ty) {
174 long proj = get_Proj_proj(n);
175 ir_mode *m = get_type_mode(ty);
177 show_entity_failure(n);
178 fprintf(stderr, " Proj %ld mode %s proj %ld (type %s mode %s) failed\n" ,
183 get_mode_name_ex(m));
187 * Prints a failure message for a proj
189 static void show_proj_failure_ent(ir_node *n, ir_entity *ent) {
190 ir_node *op = get_Proj_pred(n);
191 int proj = get_Proj_proj(n);
192 ir_mode *m = get_type_mode(get_entity_type(ent));
194 show_entity_failure(n);
195 fprintf(stderr, " node %ld %s%s %d(%s%s) entity %s(type %s mode %s)failed\n" ,
197 get_irn_opname(n), get_irn_modename(n), proj,
198 get_irn_opname(op), get_irn_modename(op),
199 get_entity_name(ent), get_type_name(get_entity_type(ent)),
200 get_mode_name_ex(m));
204 * Show a node and a graph
206 static void show_node_on_graph(ir_graph *irg, ir_node *n) {
207 ir_fprintf(stderr, "\nFIRM: irn_vrfy_irg() of %+F, node %+F\n", irg, n);
211 * Show call parameters
213 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");
232 static void show_return_modes(ir_graph *irg, ir_node *n, ir_type *mt, int i) {
233 ir_entity *ent = get_irg_entity(irg);
235 show_entity_failure(n);
236 fprintf(stderr, " Return node %ld in entity \"%s\" mode %s different from type mode %s\n",
237 get_irn_node_nr(n), get_entity_name(ent),
238 get_mode_name_ex(get_irn_mode(get_Return_res(n, i))),
239 get_mode_name_ex(get_type_mode(get_method_res_type(mt, i)))
244 * Show return number of results
246 static void show_return_nres(ir_graph *irg, ir_node *n, ir_type *mt) {
247 ir_entity *ent = get_irg_entity(irg);
249 show_entity_failure(n);
250 fprintf(stderr, " Return node %ld in entity \"%s\" has %d results different from type %d\n",
251 get_irn_node_nr(n), get_entity_name(ent),
252 get_Return_n_ress(n), get_method_n_ress(mt));
258 static void show_phi_failure(ir_node *phi, ir_node *pred, int pos) {
259 show_entity_failure(phi);
260 fprintf(stderr, " Phi node %ld has mode %s different from predeccessor node %ld mode %s\n",
261 get_irn_node_nr(phi), get_mode_name_ex(get_irn_mode(phi)),
262 get_irn_node_nr(pred), get_mode_name_ex(get_irn_mode(pred)));
268 static void show_phi_inputs(ir_node *phi, ir_node *block) {
269 show_entity_failure(phi);
270 fprintf(stderr, " Phi node %ld has %d inputs, its Block %ld has %d\n",
271 get_irn_node_nr(phi), get_irn_arity(phi),
272 get_irn_node_nr(block), get_irn_arity(block));
275 /** If the address is Sel or SymConst, return the entity. */
276 static ir_entity *get_ptr_entity(ir_node *ptr) {
277 if (get_irn_op(ptr) == op_Sel) {
278 return get_Sel_entity(ptr);
279 } else if ((get_irn_op(ptr) == op_SymConst) && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
280 return get_SymConst_entity(ptr);
286 * verify a Proj(Start) node
288 static int verify_node_Proj_Start(ir_node *n, ir_node *p) {
289 ir_mode *mode = get_irn_mode(p);
290 long proj = get_Proj_proj(p);
294 (proj == pn_Start_X_initial_exec && mode == mode_X) ||
295 (proj == pn_Start_M && mode == mode_M) ||
296 (proj == pn_Start_P_frame_base && mode_is_reference(mode)) ||
297 (proj == pn_Start_P_globals && mode_is_reference(mode)) ||
298 (proj == pn_Start_P_tls && mode_is_reference(mode)) ||
299 (proj == pn_Start_T_args && mode == mode_T) ||
300 (proj == pn_Start_P_value_arg_base && mode_is_reference(mode)) ||
301 (proj == pn_Start_P_value_arg_base && mode == mode_T) /* FIXME: only one of those */
303 "wrong Proj from Start", 0,
304 show_proj_failure(p);
310 * verify a Proj(Cond) node
312 static int verify_node_Proj_Cond(ir_node *pred, ir_node *p) {
313 ir_mode *mode = get_irn_mode(p);
314 long proj = get_Proj_proj(p);
318 (proj >= 0 && mode == mode_X && get_irn_mode(get_Cond_selector(pred)) == mode_b) || /* compare */
319 (mode == mode_X && mode_is_int(get_irn_mode(get_Cond_selector(pred)))) || /* switch */
320 is_Bad(get_Cond_selector(pred)) /* rare */
322 "wrong Proj from Cond", 0,
323 show_proj_failure(p);
329 * verify a Proj(Raise) node
331 static int verify_node_Proj_Raise(ir_node *n, ir_node *p) {
332 ir_mode *mode = get_irn_mode(p);
333 long proj = get_Proj_proj(p);
336 ((proj == pn_Raise_X && mode == mode_X) || (proj == pn_Raise_M && mode == mode_M)),
337 "wrong Proj from Raise", 0,
338 show_proj_failure(p);
344 * verify a Proj(InstOf) node
346 static int verify_node_Proj_InstOf(ir_node *n, ir_node *p) {
347 ir_mode *mode = get_irn_mode(p);
348 long proj = get_Proj_proj(p);
352 (proj == pn_InstOf_M_regular && mode == mode_M) ||
353 (proj == pn_InstOf_X_regular && mode == mode_X) ||
354 (proj == pn_InstOf_X_except && mode == mode_X) ||
355 (proj == pn_InstOf_res && mode_is_reference(mode)) ||
356 (proj == pn_InstOf_M_except && mode == mode_M)
358 "wrong Proj from InstOf", 0,
359 show_proj_failure(p);
365 * verify a Proj(Call) node
367 static int verify_node_Proj_Call(ir_node *n, ir_node *p) {
368 ir_mode *mode = get_irn_mode(p);
369 long proj = get_Proj_proj(p);
373 (proj == pn_Call_M_regular && mode == mode_M) ||
374 (proj == pn_Call_X_regular && mode == mode_X) ||
375 (proj == pn_Call_X_except && mode == mode_X) ||
376 (proj == pn_Call_T_result && mode == mode_T) ||
377 (proj == pn_Call_M_except && mode == mode_M) ||
378 (proj == pn_Call_P_value_res_base && mode_is_reference(mode))
380 "wrong Proj from Call", 0,
381 show_proj_failure(p);
383 if (proj == pn_Call_X_regular)
385 get_irn_op(get_Call_mem(n)) != op_NoMem,
386 "Regular Proj from FunctionCall", 0);
387 else if (proj == pn_Call_X_except)
389 get_irn_op(get_Call_mem(n)) != op_NoMem,
390 "Exception Proj from FunctionCall", 0);
391 else if (proj == pn_Call_M_regular || proj == pn_Call_M_except)
393 (get_irn_op(get_Call_mem(n)) != op_NoMem || 1),
394 "Memory Proj from FunctionCall", 0);
399 * verify a Proj(Quot) node
401 static int verify_node_Proj_Quot(ir_node *n, ir_node *p) {
402 ir_mode *mode = get_irn_mode(p);
403 long proj = get_Proj_proj(p);
407 (proj == pn_Quot_M && mode == mode_M) ||
408 (proj == pn_Quot_X_regular && mode == mode_X) ||
409 (proj == pn_Quot_X_except && mode == mode_X) ||
410 (proj == pn_Quot_res && mode_is_float(mode) && mode == get_Quot_resmode(n))
412 "wrong Proj from Quot", 0,
413 show_proj_failure(p);
415 if (proj == pn_Quot_X_regular)
417 get_irn_pinned(n) == op_pin_state_pinned,
418 "Regular Proj from unpinned Quot", 0);
419 else if (proj == pn_Quot_X_except)
421 get_irn_pinned(n) == op_pin_state_pinned,
422 "Exception Proj from unpinned Quot", 0);
423 else if (proj == pn_Quot_M)
425 get_irn_pinned(n) == op_pin_state_pinned,
426 "Memory Proj from unpinned Quot", 0);
431 * verify a Proj(DivMod) node
433 static int verify_node_Proj_DivMod(ir_node *n, ir_node *p) {
434 ir_mode *mode = get_irn_mode(p);
435 long proj = get_Proj_proj(p);
439 (proj == pn_DivMod_M && mode == mode_M) ||
440 (proj == pn_DivMod_X_regular && mode == mode_X) ||
441 (proj == pn_DivMod_X_except && mode == mode_X) ||
442 (proj == pn_DivMod_res_div && mode_is_int(mode) && mode == get_DivMod_resmode(n)) ||
443 (proj == pn_DivMod_res_mod && mode_is_int(mode) && mode == get_DivMod_resmode(n))
445 "wrong Proj from DivMod", 0,
446 show_proj_failure(p);
448 if (proj == pn_DivMod_X_regular)
450 get_irn_pinned(n) == op_pin_state_pinned,
451 "Regular Proj from unpinned DivMod", 0);
452 else if (proj == pn_DivMod_X_except)
454 get_irn_pinned(n) == op_pin_state_pinned,
455 "Exception Proj from unpinned DivMod", 0);
456 else if (proj == pn_DivMod_M)
458 get_irn_pinned(n) == op_pin_state_pinned,
459 "Memory Proj from unpinned DivMod", 0);
464 * verify a Proj(Div) node
466 static int verify_node_Proj_Div(ir_node *n, ir_node *p) {
467 ir_mode *mode = get_irn_mode(p);
468 long proj = get_Proj_proj(p);
472 (proj == pn_Div_M && mode == mode_M) ||
473 (proj == pn_Div_X_regular && mode == mode_X) ||
474 (proj == pn_Div_X_except && mode == mode_X) ||
475 (proj == pn_Div_res && mode_is_int(mode) && mode == get_Div_resmode(n))
477 "wrong Proj from Div", 0,
478 show_proj_failure(p);
480 if (proj == pn_Div_X_regular)
482 get_irn_pinned(n) == op_pin_state_pinned,
483 "Regular Proj from unpinned Div", 0);
484 else if (proj == pn_Div_X_except)
486 get_irn_pinned(n) == op_pin_state_pinned,
487 "Exception Proj from unpinned Div", 0);
488 else if (proj == pn_Div_M)
490 get_irn_pinned(n) == op_pin_state_pinned,
491 "Memory Proj from unpinned Div", 0);
496 * verify a Proj(Mod) node
498 static int verify_node_Proj_Mod(ir_node *n, ir_node *p) {
499 ir_mode *mode = get_irn_mode(p);
500 long proj = get_Proj_proj(p);
504 (proj == pn_Mod_M && mode == mode_M) ||
505 (proj == pn_Mod_X_regular && mode == mode_X) ||
506 (proj == pn_Mod_X_except && mode == mode_X) ||
507 (proj == pn_Mod_res && mode_is_int(mode) && mode == get_Mod_resmode(n))
509 "wrong Proj from Mod", 0,
510 show_proj_failure(p);
512 if (proj == pn_Mod_X_regular)
514 get_irn_pinned(n) == op_pin_state_pinned,
515 "Regular Proj from unpinned Mod", 0);
516 else if (proj == pn_Mod_X_except)
518 get_irn_pinned(n) == op_pin_state_pinned,
519 "Exception Proj from unpinned Mod", 0);
520 else if (proj == pn_Mod_M)
522 get_irn_pinned(n) == op_pin_state_pinned,
523 "Memory Proj from unpinned Div", 0);
528 * verify a Proj(Cmp) node
530 static int verify_node_Proj_Cmp(ir_node *n, ir_node *p) {
531 ir_mode *mode = get_irn_mode(p);
532 long proj = get_Proj_proj(p);
535 (proj >= 0 && proj <= 15 && mode == mode_b),
536 "wrong Proj from Cmp", 0,
537 show_proj_failure(p);
543 * verify a Proj(Load) node
545 static int verify_node_Proj_Load(ir_node *n, ir_node *p) {
546 ir_mode *mode = get_irn_mode(p);
547 long proj = get_Proj_proj(p);
549 if (proj == pn_Load_res) {
550 ir_node *ptr = get_Load_ptr(n);
551 ir_entity *ent = get_ptr_entity(ptr);
553 if (vrfy_entities && ent && get_irg_phase_state(current_ir_graph) == phase_high) {
554 /* do NOT check this for lowered phases, see comment on Store */
556 (mode == get_type_mode(get_entity_type(ent))),
557 "wrong data Proj from Load, entity type_mode failed", 0,
558 show_proj_failure_ent(p, ent);
563 mode_is_data(mode) && mode == get_Load_mode(n),
564 "wrong data Proj from Load", 0,
565 show_proj_failure(p);
572 (proj == pn_Load_M && mode == mode_M) ||
573 (proj == pn_Load_X_regular && mode == mode_X) ||
574 (proj == pn_Load_X_except && mode == mode_X)
576 "wrong Proj from Load", 0,
577 show_proj_failure(p);
580 if (proj == pn_Load_X_regular) {
582 get_irn_pinned(n) == op_pin_state_pinned,
583 "Regular Proj from unpinned Load", 0);
584 } else if (proj == pn_Load_X_except) {
586 get_irn_pinned(n) == op_pin_state_pinned,
587 "Exception Proj from unpinned Load", 0);
593 * verify a Proj(Store) node
595 static int verify_node_Proj_Store(ir_node *n, ir_node *p) {
596 ir_mode *mode = get_irn_mode(p);
597 long proj = get_Proj_proj(p);
601 (proj == pn_Store_M && mode == mode_M) ||
602 (proj == pn_Store_X_regular && mode == mode_X) ||
603 (proj == pn_Store_X_except && mode == mode_X)
605 "wrong Proj from Store", 0,
606 show_proj_failure(p);
608 if (proj == pn_Store_X_regular) {
610 get_irn_pinned(n) == op_pin_state_pinned,
611 "Regular Proj from unpinned Store", 0);
612 } else if (proj == pn_Store_X_except) {
614 get_irn_pinned(n) == op_pin_state_pinned,
615 "Exception Proj from unpinned Store", 0);
621 * verify a Proj(Alloc) node
623 static int verify_node_Proj_Alloc(ir_node *n, ir_node *p) {
624 ir_mode *mode = get_irn_mode(p);
625 long proj = get_Proj_proj(p);
629 (proj == pn_Alloc_M && mode == mode_M) ||
630 (proj == pn_Alloc_X_regular && mode == mode_X) ||
631 (proj == pn_Alloc_X_except && mode == mode_X) ||
632 (proj == pn_Alloc_res && mode_is_reference(mode))
634 "wrong Proj from Alloc", 0,
635 show_proj_failure(p);
641 * verify a Proj(Proj) node
643 static int verify_node_Proj_Proj(ir_node *pred, ir_node *p) {
644 ir_mode *mode = get_irn_mode(p);
645 long proj = get_Proj_proj(p);
646 long nr = get_Proj_proj(pred);
647 ir_type *mt; /* A method type */
649 pred = skip_Id(get_Proj_pred(pred));
650 ASSERT_AND_RET((get_irn_mode(pred) == mode_T), "Proj from something not a tuple", 0);
652 switch (get_irn_opcode(pred)) {
654 mt = get_entity_type(get_irg_entity(get_irn_irg(pred)));
656 if (nr == pn_Start_T_args) {
658 (proj >= 0 && mode_is_data(mode)),
659 "wrong Proj from Proj from Start", 0);
661 (proj < get_method_n_params(mt)),
662 "More Projs for args than args in type", 0
664 if ((mode_is_reference(mode)) && is_compound_type(get_method_param_type(mt, proj)))
665 /* value argument */ break;
668 (mode == get_type_mode(get_method_param_type(mt, proj))),
669 "Mode of Proj from Start doesn't match mode of param type.", 0,
670 show_proj_mode_failure(p, get_method_param_type(mt, proj));
672 } else if (nr == pn_Start_P_value_arg_base) {
674 (proj >= 0 && mode_is_reference(mode)),
675 "wrong Proj from Proj from Start", 0
678 (proj < get_method_n_params(mt)),
679 "More Projs for args than args in type", 0
687 (proj >= 0 && mode_is_data(mode)),
688 "wrong Proj from Proj from Call", 0);
689 mt = get_Call_type(pred);
691 (proj < get_method_n_ress(mt)),
692 "More Projs for results than results in type.", 0);
693 if ((mode_is_reference(mode)) && is_compound_type(get_method_res_type(mt, proj)))
694 /* value result */ break;
697 (mode == get_type_mode(get_method_res_type(mt, proj))),
698 "Mode of Proj from Call doesn't match mode of result type.", 0);
707 /* hmm, optimization did not remove it */
711 /* ASSERT_AND_RET(0, "Unknown opcode", 0); */
718 * verify a Proj(Tuple) node
720 static int verify_node_Proj_Tuple(ir_node *n, ir_node *p) {
726 * verify a Proj(CallBegin) node
728 static int verify_node_Proj_CallBegin(ir_node *n, ir_node *p) {
733 * verify a Proj(EndReg) node
735 static int verify_node_Proj_EndReg(ir_node *n, ir_node *p) {
737 (get_irp_ip_view_state() != ip_view_no),
738 "EndReg may only appear if ip view is constructed.", 0);
743 * verify a Proj(EndExcept) node
745 static int verify_node_Proj_EndExcept(ir_node *n, ir_node *p) {
747 (get_irp_ip_view_state() != ip_view_no),
748 "EndExcept may only appear if ip view is constructed.", 0);
753 * verify a Proj(CopyB) node
755 static int verify_node_Proj_CopyB(ir_node *n, ir_node *p) {
756 ir_mode *mode = get_irn_mode(p);
757 long proj = get_Proj_proj(p);
761 (proj == pn_CopyB_M_regular && mode == mode_M) ||
762 (proj == pn_CopyB_X_regular && mode == mode_X) ||
763 (proj == pn_CopyB_X_except && mode == mode_X) ||
764 (proj == pn_CopyB_M_except && mode == mode_M)
766 "wrong Proj from CopyB", 0,
767 show_proj_failure(p);
769 if (proj == pn_CopyB_X_regular)
771 get_irn_pinned(n) == op_pin_state_pinned,
772 "Regular Proj from unpinned CopyB", 0);
773 else if (proj == pn_CopyB_X_except)
775 get_irn_pinned(n) == op_pin_state_pinned,
776 "Exception Proj from unpinned CopyB", 0);
781 * verify a Proj(Bound) node
783 static int verify_node_Proj_Bound(ir_node *n, ir_node *p) {
784 ir_mode *mode = get_irn_mode(p);
785 long proj = get_Proj_proj(p);
787 /* ignore Bound checks of Bad */
788 if (is_Bad(get_Bound_index(n)))
792 (proj == pn_Bound_M && mode == mode_M) ||
793 (proj == pn_Bound_X_regular && mode == mode_X) ||
794 (proj == pn_Bound_X_except && mode == mode_X) ||
795 (proj == pn_Bound_res && mode == get_irn_mode(get_Bound_index(n)))
797 "wrong Proj from Bound", 0,
798 show_proj_failure(p);
807 verify_node_Proj(ir_node *p, ir_graph *irg) {
811 pred = skip_Id(get_Proj_pred(p));
812 ASSERT_AND_RET(get_irn_mode(pred) == mode_T, "mode of a 'projed' node is not Tuple", 0);
814 op = get_irn_op(pred);
816 if (op->ops.verify_proj_node)
817 return op->ops.verify_proj_node(pred, p);
824 * verify a Block node
826 static int verify_node_Block(ir_node *n, ir_graph *irg) {
829 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
830 ir_node *pred = get_Block_cfgpred(n, i);
835 (get_irn_mode(pred) == mode_X)
840 /* End block may only have Return, Raise or fragile ops as preds. */
841 if (n == get_irg_end_block(irg) && get_irg_phase_state(irg) != phase_backend)
842 for (i = get_Block_n_cfgpreds(n) - 1; i >= 0; --i) {
843 ir_node *pred = skip_Proj(get_Block_cfgpred(n, i));
844 if (is_Proj(pred) || get_irn_op(pred) == op_Tuple)
845 break; /* We can not test properly. How many tuples are there? */
850 (get_irn_op(pred) == op_Raise) ||
853 "End Block node", 0);
855 /* irg attr must == graph we are in. */
856 if (! get_interprocedural_view()) {
857 ASSERT_AND_RET(((get_irn_irg(n) && get_irn_irg(n) == irg)), "Block node has wrong irg attribute", 0);
863 * verify a Start node
865 static int verify_node_Start(ir_node *n, ir_graph *irg) {
866 ir_mode *mymode = get_irn_mode(n);
869 /* Start: BB --> X x M x ref x data1 x ... x datan x ref */
870 mymode == mode_T, "Start node", 0
878 static int verify_node_Jmp(ir_node *n, ir_graph *irg) {
879 ir_mode *mymode = get_irn_mode(n);
883 mymode == mode_X, "Jmp node", 0
889 * verify an IJmp node
891 static int verify_node_IJmp(ir_node *n, ir_graph *irg) {
892 ir_mode *mymode = get_irn_mode(n);
893 ir_mode *op1mode = get_irn_mode(get_IJmp_target(n));
896 /* IJmp: BB x ref --> X */
897 mymode == mode_X && mode_is_reference(op1mode), "IJmp node", 0
903 * verify a Break node
905 static int verify_node_Break(ir_node *n, ir_graph *irg) {
906 ir_mode *mymode = get_irn_mode(n);
908 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
909 "Break may only appear if ip view is constructed.", 0);
912 mymode == mode_X, "Break node", 0
920 static int verify_node_Cond(ir_node *n, ir_graph *irg) {
921 ir_mode *mymode = get_irn_mode(n);
922 ir_mode *op1mode = get_irn_mode(get_Cond_selector(n));
925 /* Cond: BB x b --> X x X */
926 (op1mode == mode_b ||
927 /* Cond: BB x int --> X^n */
928 mode_is_int(op1mode) ), "Cond node", 0
930 ASSERT_AND_RET(mymode == mode_T, "Cond mode is not a tuple", 0);
936 * verify a Return node
938 static int verify_node_Return(ir_node *n, ir_graph *irg) {
940 ir_mode *mymode = get_irn_mode(n);
941 ir_mode *mem_mode = get_irn_mode(get_Return_mem(n));
944 /* Return: BB x M x data1 x ... x datan --> X */
946 ASSERT_AND_RET( mem_mode == mode_M, "Return node", 0 ); /* operand M */
948 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
949 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Return_res(n, i))), "Return node", 0 ); /* operand datai */
951 ASSERT_AND_RET( mymode == mode_X, "Result X", 0 ); /* result X */
952 /* Compare returned results with result types of method type */
953 mt = get_entity_type(get_irg_entity(irg));
954 ASSERT_AND_RET_DBG( get_Return_n_ress(n) == get_method_n_ress(mt),
955 "Number of results for Return doesn't match number of results in type.", 0,
956 show_return_nres(irg, n, mt););
957 for (i = get_Return_n_ress(n) - 1; i >= 0; --i) {
958 ir_type *res_type = get_method_res_type(mt, i);
960 if (is_atomic_type(res_type)) {
962 get_irn_mode(get_Return_res(n, i)) == get_type_mode(res_type),
963 "Mode of result for Return doesn't match mode of result type.", 0,
964 show_return_modes(irg, n, mt, i);
968 mode_is_reference(get_irn_mode(get_Return_res(n, i))),
969 "Mode of result for Return doesn't match mode of result type.", 0,
970 show_return_modes(irg, n, mt, i);
978 * verify a Raise node
980 static int verify_node_Raise(ir_node *n, ir_graph *irg) {
981 ir_mode *mymode = get_irn_mode(n);
982 ir_mode *op1mode = get_irn_mode(get_Raise_mem(n));
983 ir_mode *op2mode = get_irn_mode(get_Raise_exo_ptr(n));
986 /* Sel: BB x M x ref --> X x M */
987 op1mode == mode_M && mode_is_reference(op2mode) &&
988 mymode == mode_T, "Raise node", 0
994 * verify a Const node
996 static int verify_node_Const(ir_node *n, ir_graph *irg) {
997 ir_mode *mymode = get_irn_mode(n);
1000 /* Const: BB --> data */
1001 (mode_is_data(mymode) ||
1002 mymode == mode_b) /* we want boolean constants for static evaluation */
1003 ,"Const node", 0 /* of Cmp. */
1006 /* the modes of the constant and teh tarval must match */
1007 mymode == get_tarval_mode(get_Const_tarval(n)),
1008 "Const node, tarval and node mode mismatch", 0
1014 * verify a SymConst node
1016 static int verify_node_SymConst(ir_node *n, ir_graph *irg) {
1017 ir_mode *mymode = get_irn_mode(n);
1019 if (get_SymConst_kind(n) == symconst_addr_ent) {
1020 ir_entity *ent = get_SymConst_entity(n);
1021 if (is_Method_type(get_entity_type(ent)) &&
1022 get_irn_irg(n) != get_const_code_irg()) {
1024 ASSERT_AND_RET((get_entity_peculiarity(ent) != peculiarity_description),
1025 "A constant must address an existing method.", 0);
1030 /* SymConst: BB --> int*/
1031 (mode_is_int(mymode) ||
1032 /* SymConst: BB --> ref */
1033 mode_is_reference(mymode))
1034 ,"SymConst node", 0);
1041 static int verify_node_Sel(ir_node *n, ir_graph *irg) {
1043 ir_mode *mymode = get_irn_mode(n);
1044 ir_mode *op1mode = get_irn_mode(get_Sel_mem(n));
1045 ir_mode *op2mode = get_irn_mode(get_Sel_ptr(n));
1049 /* Sel: BB x M x ref x int^n --> ref */
1050 (op1mode == mode_M && op2mode == mymode && mode_is_reference(mymode)),
1051 "Sel node", 0, show_node_failure(n)
1054 for (i = get_Sel_n_indexs(n) - 1; i >= 0; --i) {
1055 ASSERT_AND_RET_DBG(mode_is_int(get_irn_mode(get_Sel_index(n, i))), "Sel node", 0, show_node_failure(n));
1057 ent = get_Sel_entity(n);
1058 ASSERT_AND_RET_DBG(ent, "Sel node with empty entity", 0, show_node_failure(n));
1063 * verify an InstOf node
1065 static int verify_node_InstOf(ir_node *n, ir_graph *irg) {
1066 ir_mode *mymode = get_irn_mode(n);
1067 ir_mode *op1mode = get_irn_mode(get_InstOf_obj(n));
1069 ASSERT_AND_RET(mode_T == mymode, "mode of Instof is not a tuple", 0);
1070 ASSERT_AND_RET(mode_is_data(op1mode), "Instof not on data", 0);
1075 * verify a Call node
1077 static int verify_node_Call(ir_node *n, ir_graph *irg) {
1078 ir_mode *mymode = get_irn_mode(n);
1079 ir_mode *op1mode = get_irn_mode(get_Call_mem(n));
1080 ir_mode *op2mode = get_irn_mode(get_Call_ptr(n));
1084 /* Call: BB x M x ref x data1 x ... x datan
1085 --> M x datan+1 x ... x data n+m */
1086 ASSERT_AND_RET( op1mode == mode_M && mode_is_reference(op2mode), "Call node", 0 ); /* operand M x ref */
1088 /* NoMem nodes are only allowed as memory input if the Call is NOT pinned */
1090 (get_irn_op(get_Call_mem(n)) == op_NoMem) ||
1091 (get_irn_op(get_Call_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1092 "Call node with wrong memory input", 0 );
1094 mt = get_Call_type(n);
1095 if(get_unknown_type() == mt) {
1099 for (i = get_Call_n_params(n) - 1; i >= 0; --i) {
1100 ASSERT_AND_RET( mode_is_data(get_irn_mode(get_Call_param(n, i))), "Call node", 0 ); /* operand datai */
1103 ASSERT_AND_RET( mymode == mode_T, "Call result not a tuple", 0 ); /* result T */
1104 /* Compare arguments of node with those of type */
1106 if (get_method_variadicity(mt) == variadicity_variadic) {
1108 get_Call_n_params(n) >= get_method_n_params(mt),
1109 "Number of args for Call doesn't match number of args in variadic type.",
1111 fprintf(stderr, "Call has %d params, method %s type %d\n",
1112 get_Call_n_params(n), get_type_name(mt), get_method_n_params(mt));
1116 get_Call_n_params(n) == get_method_n_params(mt),
1117 "Number of args for Call doesn't match number of args in non variadic type.",
1121 for (i = 0; i < get_method_n_params(mt); i++) {
1122 ir_type *t = get_method_param_type(mt, i);
1124 if (is_atomic_type(t)) {
1126 get_irn_mode(get_Call_param(n, i)) == get_type_mode(t),
1127 "Mode of arg for Call doesn't match mode of arg type.", 0,
1128 show_call_param(n, mt);
1131 /* call with a compound type, mode must be reference */
1133 mode_is_reference(get_irn_mode(get_Call_param(n, i))),
1134 "Mode of arg for Call doesn't match mode of arg type.", 0,
1135 show_call_param(n, mt);
1141 if (Call_has_callees(n)) {
1142 for (i = 0; i < get_Call_n_callees(n); i++) {
1143 ASSERT_AND_RET(is_entity(get_Call_callee(n, i)), "callee array must contain entities.", 0);
1151 * verify an Add node
1153 static int verify_node_Add(ir_node *n, ir_graph *irg) {
1154 ir_mode *mymode = get_irn_mode(n);
1155 ir_mode *op1mode = get_irn_mode(get_Add_left(n));
1156 ir_mode *op2mode = get_irn_mode(get_Add_right(n));
1160 /* common Add: BB x numP x numP --> numP */
1161 (op1mode == mymode && op2mode == op1mode && mode_is_numP(mymode)) ||
1162 /* Pointer Add: BB x ref x int --> ref */
1163 (mode_is_reference(op1mode) && mode_is_int(op2mode) && op1mode == mymode) ||
1164 /* Pointer Add: BB x int x ref --> ref */
1165 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode))
1168 show_binop_failure(n, "/* common Add: BB x numP x numP --> numP */ |\n"
1169 "/* Pointer Add: BB x ref x int --> ref */ |\n"
1170 "/* Pointer Add: BB x int x ref --> ref */");
1178 static int verify_node_Sub(ir_node *n, ir_graph *irg) {
1179 ir_mode *mymode = get_irn_mode(n);
1180 ir_mode *op1mode = get_irn_mode(get_Sub_left(n));
1181 ir_mode *op2mode = get_irn_mode(get_Sub_right(n));
1185 /* common Sub: BB x numP x numP --> numP */
1186 (mymode ==op1mode && mymode == op2mode && mode_is_numP(op1mode)) ||
1187 /* Pointer Sub: BB x ref x int --> ref */
1188 (op1mode == mymode && mode_is_int(op2mode) && mode_is_reference(mymode)) ||
1189 /* Pointer Sub: BB x int x ref --> ref */
1190 (mode_is_int(op1mode) && op2mode == mymode && mode_is_reference(mymode)) ||
1191 /* Pointer Sub: BB x ref x ref --> int */
1192 (op1mode == op2mode && mode_is_reference(op2mode) && mode_is_int(mymode))
1195 show_binop_failure(n, "/* common Sub: BB x numP x numP --> numP */ |\n"
1196 "/* Pointer Sub: BB x ref x int --> ref */ |\n"
1197 "/* Pointer Sub: BB x int x ref --> ref */ |\n"
1198 "/* Pointer Sub: BB x ref x ref --> int */" );
1204 * verify a Minus node
1206 static int verify_node_Minus(ir_node *n, ir_graph *irg) {
1207 ir_mode *mymode = get_irn_mode(n);
1208 ir_mode *op1mode = get_irn_mode(get_Minus_op(n));
1211 /* Minus: BB x num --> num */
1212 op1mode == mymode && mode_is_num(op1mode), "Minus node", 0,
1213 show_unop_failure(n , "/* Minus: BB x num --> num */");
1221 static int verify_node_Mul(ir_node *n, ir_graph *irg) {
1222 ir_mode *mymode = get_irn_mode(n);
1223 ir_mode *op1mode = get_irn_mode(get_Mul_left(n));
1224 ir_mode *op2mode = get_irn_mode(get_Mul_right(n));
1228 /* Mul: BB x int1 x int1 --> int2 */
1229 (mode_is_int(op1mode) && op2mode == op1mode && mode_is_int(mymode)) ||
1230 /* Mul: BB x float x float --> float */
1231 (mode_is_float(op1mode) && op2mode == op1mode && mymode == op1mode)
1234 show_binop_failure(n, "/* Mul: BB x int1 x int1 --> int2 */ |\n"
1235 "/* Mul: BB x float x float --> float */");
1241 * verify a Quot node
1243 static int verify_node_Quot(ir_node *n, ir_graph *irg) {
1244 ir_mode *mymode = get_irn_mode(n);
1245 ir_mode *op1mode = get_irn_mode(get_Quot_mem(n));
1246 ir_mode *op2mode = get_irn_mode(get_Quot_left(n));
1247 ir_mode *op3mode = get_irn_mode(get_Quot_right(n));
1250 /* Quot: BB x M x float x float --> M x X x float */
1251 op1mode == mode_M && op2mode == op3mode &&
1252 get_mode_sort(op2mode) == irms_float_number &&
1255 show_binop_failure(n, "/* Quot: BB x M x float x float --> M x X x float */");
1261 * verify a DivMod node
1263 static int verify_node_DivMod(ir_node *n, ir_graph *irg) {
1264 ir_mode *mymode = get_irn_mode(n);
1265 ir_mode *op1mode = get_irn_mode(get_DivMod_mem(n));
1266 ir_mode *op2mode = get_irn_mode(get_DivMod_left(n));
1267 ir_mode *op3mode = get_irn_mode(get_DivMod_right(n));
1270 /* DivMod: BB x M x int x int --> M x X x int x int */
1271 op1mode == mode_M &&
1272 mode_is_int(op2mode) &&
1273 op3mode == op2mode &&
1283 static int verify_node_Div(ir_node *n, ir_graph *irg) {
1284 ir_mode *mymode = get_irn_mode(n);
1285 ir_mode *op1mode = get_irn_mode(get_Div_mem(n));
1286 ir_mode *op2mode = get_irn_mode(get_Div_left(n));
1287 ir_mode *op3mode = get_irn_mode(get_Div_right(n));
1290 /* Div: BB x M x int x int --> M x X x int */
1291 op1mode == mode_M &&
1292 op2mode == op3mode &&
1293 mode_is_int(op2mode) &&
1303 static int verify_node_Mod(ir_node *n, ir_graph *irg) {
1304 ir_mode *mymode = get_irn_mode(n);
1305 ir_mode *op1mode = get_irn_mode(get_Mod_mem(n));
1306 ir_mode *op2mode = get_irn_mode(get_Mod_left(n));
1307 ir_mode *op3mode = get_irn_mode(get_Mod_right(n));
1310 /* Mod: BB x M x int x int --> M x X x int */
1311 op1mode == mode_M &&
1312 op2mode == op3mode &&
1313 mode_is_int(op2mode) &&
1321 * verify an Abs node
1323 static int verify_node_Abs(ir_node *n, ir_graph *irg) {
1324 ir_mode *mymode = get_irn_mode(n);
1325 ir_mode *op1mode = get_irn_mode(get_Abs_op(n));
1328 /* Abs: BB x num --> num */
1329 op1mode == mymode &&
1330 mode_is_num (op1mode),
1332 show_unop_failure(n, "/* Abs: BB x num --> num */");
1338 * verify a logical And, Or, Eor node
1340 static int verify_node_Logic(ir_node *n, ir_graph *irg) {
1341 ir_mode *mymode = get_irn_mode(n);
1342 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1343 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1346 /* And or Or or Eor: BB x int x int --> int */
1347 (mode_is_int(mymode) || mymode == mode_b) &&
1348 op2mode == op1mode &&
1350 "And, Or or Eor node", 0,
1351 show_binop_failure(n, "/* And or Or or Eor: BB x int x int --> int */");
1356 #define verify_node_And verify_node_Logic
1357 #define verify_node_Or verify_node_Logic
1358 #define verify_node_Eor verify_node_Logic
1363 static int verify_node_Not(ir_node *n, ir_graph *irg) {
1364 ir_mode *mymode = get_irn_mode(n);
1365 ir_mode *op1mode = get_irn_mode(get_Not_op(n));
1368 /* Not: BB x int --> int */
1369 mode_is_int(mymode) &&
1372 show_unop_failure(n, "/* Not: BB x int --> int */");
1380 static int verify_node_Cmp(ir_node *n, ir_graph *irg) {
1381 ir_mode *mymode = get_irn_mode(n);
1382 ir_mode *op1mode = get_irn_mode(get_Cmp_left(n));
1383 ir_mode *op2mode = get_irn_mode(get_Cmp_right(n));
1386 /* Cmp: BB x datab x datab --> b16 */
1387 mode_is_data (op1mode) &&
1388 op2mode == op1mode &&
1391 show_binop_failure(n, "/* Cmp: BB x datab x datab --> b16 */");
1397 * verify a Shift node
1399 static int verify_node_Shift(ir_node *n, ir_graph *irg) {
1400 ir_mode *mymode = get_irn_mode(n);
1401 ir_mode *op1mode = get_irn_mode(get_binop_left(n));
1402 ir_mode *op2mode = get_irn_mode(get_binop_right(n));
1405 /* Shl, Shr or Shrs: BB x int x int_u --> int */
1406 mode_is_int(op1mode) &&
1407 mode_is_int(op2mode) &&
1408 !mode_is_signed(op2mode) &&
1410 "Shl, Shr or Shrs node", 0,
1411 show_binop_failure(n, "/* Shl, Shr or Shrs: BB x int x int_u --> int */");
1416 #define verify_node_Shl verify_node_Shift
1417 #define verify_node_Shr verify_node_Shift
1418 #define verify_node_Shrs verify_node_Shift
1423 static int verify_node_Rot(ir_node *n, ir_graph *irg) {
1424 ir_mode *mymode = get_irn_mode(n);
1425 ir_mode *op1mode = get_irn_mode(get_Rot_left(n));
1426 ir_mode *op2mode = get_irn_mode(get_Rot_right(n));
1429 /* Rot: BB x int x int --> int */
1430 mode_is_int(op1mode) &&
1431 mode_is_int(op2mode) &&
1434 show_binop_failure(n, "/* Rot: BB x int x int --> int */");
1440 * verify a Conv node
1442 static int verify_node_Conv(ir_node *n, ir_graph *irg) {
1443 ir_mode *mymode = get_irn_mode(n);
1444 ir_mode *op1mode = get_irn_mode(get_Conv_op(n));
1447 /* Conv: BB x datab1 --> datab2 */
1448 mode_is_datab(op1mode) && mode_is_data(mymode),
1450 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1456 * verify a Cast node
1458 static int verify_node_Cast(ir_node *n, ir_graph *irg) {
1459 ir_mode *mymode = get_irn_mode(n);
1460 ir_mode *op1mode = get_irn_mode(get_Cast_op(n));
1463 /* Conv: BB x datab1 --> datab2 */
1464 mode_is_data(op1mode) && op1mode == mymode,
1466 show_unop_failure(n, "/* Conv: BB x datab1 --> datab2 */");
1474 static int verify_node_Phi(ir_node *n, ir_graph *irg) {
1475 ir_mode *mymode = get_irn_mode(n);
1476 ir_node *block = get_nodes_block(n);
1479 if (! is_Bad(block) && get_irg_phase_state(get_irn_irg(n)) != phase_building) {
1480 /* a Phi node MUST have the same number of inputs as its block */
1482 get_irn_arity(n) == get_irn_arity(block),
1483 "wrong number of inputs in Phi node", 0,
1484 show_phi_inputs(n, block);
1488 /* Phi: BB x dataM^n --> dataM */
1489 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1490 ir_node *pred = get_irn_n(n, i);
1491 if (!is_Bad(pred) && (get_irn_op(pred) != op_Unknown)) {
1493 get_irn_mode(pred) == mymode,
1495 show_phi_failure(n, pred, i);
1499 ASSERT_AND_RET( mode_is_dataM(mymode), "Phi node", 0 );
1501 if (mymode == mode_M) {
1502 for (i = get_Phi_n_preds(n) - 1; i >= 0; --i) {
1504 ir_node *pred_i = get_Phi_pred(n, i);
1508 for (j = i - 1; j >= 0; --j) {
1509 ir_node *pred_j = get_Phi_pred(n, j);
1514 /* currently this checks fails for blocks with exception
1515 outputs (and these are NOT basic blocks). So it is disabled yet. */
1517 (pred_i == pred_j) || (get_irn_n(pred_i, -1) != get_irn_n(pred_j, -1)),
1518 "At least two different PhiM predecessors are in the same block",
1520 ir_printf("%+F and %+F of %+F are in %+F\n", pred_i, pred_j, n, get_irn_n(pred_i, -1))
1530 * verify a Filter node
1532 static int verify_node_Filter(ir_node *n, ir_graph *irg) {
1533 ASSERT_AND_RET((get_irp_ip_view_state() != ip_view_no),
1534 "Filter may only appear if ip view is constructed.", 0);
1535 /* We should further do tests as for Proj and Phi. */
1540 * verify a Load node
1542 static int verify_node_Load(ir_node *n, ir_graph *irg) {
1543 ir_mode *mymode = get_irn_mode(n);
1544 ir_mode *op1mode = get_irn_mode(get_Load_mem(n));
1545 ir_mode *op2mode = get_irn_mode(get_Load_ptr(n));
1547 ASSERT_AND_RET(op1mode == mode_M, "Load node", 0);
1548 if (get_irg_phase_state(irg) != phase_backend) {
1549 ASSERT_AND_RET(mode_is_reference(op2mode), "Load node", 0 );
1551 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1552 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Load node", 0 );
1554 ASSERT_AND_RET( mymode == mode_T, "Load node", 0 );
1557 * jack's gen_add_firm_code:simpleSel seems to build Load (Load
1558 * (Proj (Proj))) sometimes ...
1560 * interprete.c:ai_eval seems to assume that this happens, too
1562 * obset.c:get_abstval_any can't deal with this if the load has
1566 ir_entity *ent = hunt_for_entity (get_Load_ptr (n), n);
1567 assert ((NULL != ent) || (mymode != mode_T));
1575 * verify a Store node
1577 static int verify_node_Store(ir_node *n, ir_graph *irg) {
1580 ir_mode *mymode = get_irn_mode(n);
1581 ir_mode *op1mode = get_irn_mode(get_Store_mem(n));
1582 ir_mode *op2mode = get_irn_mode(get_Store_ptr(n));
1583 ir_mode *op3mode = get_irn_mode(get_Store_value(n));
1585 ASSERT_AND_RET(op1mode == mode_M && mode_is_data(op3mode), "Store node", 0 );
1586 if (get_irg_phase_state(irg) != phase_backend) {
1587 ASSERT_AND_RET(mode_is_reference(op2mode), "Store node", 0 );
1589 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1590 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "Store node", 0 );
1592 ASSERT_AND_RET(mymode == mode_T, "Store node", 0);
1594 target = get_ptr_entity(get_Store_ptr(n));
1595 if (vrfy_entities && target && get_irg_phase_state(current_ir_graph) == phase_high) {
1597 * If lowered code, any Sels that add 0 may be removed, causing
1598 * an direct access to entities of array or compound type.
1599 * Prevent this by checking the phase.
1601 ASSERT_AND_RET( op3mode == get_type_mode(get_entity_type(target)),
1609 * verify an Alloc node
1611 static int verify_node_Alloc(ir_node *n, ir_graph *irg) {
1612 ir_mode *mymode = get_irn_mode(n);
1613 ir_mode *op1mode = get_irn_mode(get_Alloc_mem(n));
1614 ir_mode *op2mode = get_irn_mode(get_Alloc_size(n));
1617 /* Alloc: BB x M x int_u --> M x X x ref */
1618 op1mode == mode_M &&
1619 mode_is_int(op2mode) &&
1620 !mode_is_signed(op2mode) &&
1623 show_binop_failure(n, "/* Alloc: BB x M x int_u --> M x X x ref */");
1629 * verify a Free node
1631 static int verify_node_Free(ir_node *n, ir_graph *irg) {
1632 ir_mode *mymode = get_irn_mode(n);
1633 ir_mode *op1mode = get_irn_mode(get_Free_mem(n));
1634 ir_mode *op2mode = get_irn_mode(get_Free_ptr(n));
1635 ir_mode *op3mode = get_irn_mode(get_Free_size(n));
1638 /* Free: BB x M x ref x int_u --> M */
1639 op1mode == mode_M && mode_is_reference(op2mode) &&
1640 mode_is_int(op3mode) &&
1641 !mode_is_signed(op3mode) &&
1644 show_triop_failure(n, "/* Free: BB x M x ref x int_u --> M */");
1650 * verify a Sync node
1652 static int verify_node_Sync(ir_node *n, ir_graph *irg) {
1654 ir_mode *mymode = get_irn_mode(n);
1656 /* Sync: BB x M^n --> M */
1657 for (i = get_Sync_n_preds(n) - 1; i >= 0; --i) {
1658 ASSERT_AND_RET( get_irn_mode(get_Sync_pred(n, i)) == mode_M, "Sync node", 0 );
1660 ASSERT_AND_RET( mymode == mode_M, "Sync node", 0 );
1665 * verify a Confirm node
1667 static int verify_node_Confirm(ir_node *n, ir_graph *irg) {
1668 ir_mode *mymode = get_irn_mode(n);
1669 ir_mode *op1mode = get_irn_mode(get_Confirm_value(n));
1670 ir_mode *op2mode = get_irn_mode(get_Confirm_bound(n));
1673 /* Confirm: BB x T x T --> T */
1674 op1mode == mymode &&
1677 show_binop_failure(n, "/* Confirm: BB x T x T --> T */");
1685 static int verify_node_Mux(ir_node *n, ir_graph *irg) {
1686 ir_mode *mymode = get_irn_mode(n);
1687 ir_mode *op1mode = get_irn_mode(get_Mux_sel(n));
1688 ir_mode *op2mode = get_irn_mode(get_Mux_true(n));
1689 ir_mode *op3mode = get_irn_mode(get_Mux_false(n));
1692 /* Mux: BB x b x numP x numP --> numP */
1693 op1mode == mode_b &&
1694 op2mode == mymode &&
1695 op3mode == mymode &&
1696 mode_is_numP(mymode),
1703 * verify a CopyB node
1705 static int verify_node_CopyB(ir_node *n, ir_graph *irg) {
1706 ir_mode *mymode = get_irn_mode(n);
1707 ir_mode *op1mode = get_irn_mode(get_CopyB_mem(n));
1708 ir_mode *op2mode = get_irn_mode(get_CopyB_dst(n));
1709 ir_mode *op3mode = get_irn_mode(get_CopyB_src(n));
1710 ir_type *t = get_CopyB_type(n);
1712 /* CopyB: BB x M x ref x ref --> M x X */
1713 ASSERT_AND_RET(mymode == mode_T && op1mode == mode_M, "CopyB node", 0);
1714 if (get_irg_phase_state(irg) != phase_backend) {
1715 ASSERT_AND_RET(mode_is_reference(op2mode) && mode_is_reference(op3mode),
1718 ASSERT_AND_RET(mode_is_reference(op2mode) ||
1719 (mode_is_int(op2mode) && get_mode_size_bits(op2mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1720 ASSERT_AND_RET(mode_is_reference(op3mode) ||
1721 (mode_is_int(op3mode) && get_mode_size_bits(op3mode) == get_mode_size_bits(mode_P)), "CopyB node", 0 );
1725 is_compound_type(t),
1726 "CopyB node should copy compound types only", 0 );
1728 /* NoMem nodes are only allowed as memory input if the CopyB is NOT pinned.
1729 This should happen RARELY, as CopyB COPIES MEMORY */
1731 (get_irn_op(get_CopyB_mem(n)) == op_NoMem) ||
1732 (get_irn_op(get_CopyB_mem(n)) != op_NoMem && get_irn_pinned(n) == op_pin_state_pinned),
1733 "CopyB node with wrong memory input", 0 );
1738 * verify a Bound node
1740 static int verify_node_Bound(ir_node *n, ir_graph *irg) {
1741 ir_mode *mymode = get_irn_mode(n);
1742 ir_mode *op1mode = get_irn_mode(get_Bound_mem(n));
1743 ir_mode *op2mode = get_irn_mode(get_Bound_index(n));
1744 ir_mode *op3mode = get_irn_mode(get_Bound_lower(n));
1745 ir_mode *op4mode = get_irn_mode(get_Bound_upper(n));
1747 /* Bound: BB x M x int x int x int --> M x X */
1750 op1mode == mode_M &&
1751 op2mode == op3mode &&
1752 op3mode == op4mode &&
1753 mode_is_int(op3mode),
1760 * For each usage of a node, it is checked, if the block of the
1761 * node dominates the block of the usage (for phis: the predecessor
1762 * block of the phi for the corresponding edge).
1764 * @return non-zero on success, 0 on dominance error
1766 static int check_dominance_for_node(ir_node *use) {
1767 /* This won't work for blocks and the end node */
1768 if (!is_Block(use) && use != get_irg_end(current_ir_graph)) {
1770 ir_node *bl = get_nodes_block(use);
1772 for (i = get_irn_arity(use) - 1; i >= 0; --i) {
1773 ir_node *def = get_irn_n(use, i);
1774 ir_node *def_bl = get_nodes_block(def);
1775 ir_node *use_bl = bl;
1777 /* ignore dead definition blocks, will be removed */
1778 if (is_Block_dead(def_bl) || get_Block_dom_depth(def_bl) == -1)
1782 use_bl = get_Block_cfgpred_block(bl, i);
1784 /* ignore dead use blocks, will be removed */
1785 if (is_Block_dead(use_bl) || get_Block_dom_depth(use_bl) == -1)
1789 block_dominates(def_bl, use_bl),
1790 "the definition of a value used violates the dominance property", 0,
1792 "graph %+F: %+F of %+F must dominate %+F of user %+F input %d\n",
1793 current_ir_graph, def_bl, def, use_bl, use, i
1801 /* Tests the modes of n and its predecessors. */
1802 int irn_vrfy_irg(ir_node *n, ir_graph *irg) {
1806 if (!get_node_verification_mode())
1809 if (!get_interprocedural_view()) {
1811 * do NOT check placement in interprocedural view, as we don't always know
1812 * the "right" graph ...
1815 node_is_in_irgs_storage(irg, n),
1816 "Node is not stored on proper IR graph!", 0,
1817 show_node_on_graph(irg, n);
1819 assert(get_irn_irg(n) == irg);
1821 unsigned idx = get_irn_idx(n);
1822 ir_node *node_from_map = get_idx_irn(irg, idx);
1823 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));
1829 /* We don't want to test nodes whose predecessors are Bad,
1830 as we would have to special case that for each operation. */
1831 if (op != op_Phi && op != op_Block) {
1832 for (i = get_irn_arity(n) - 1; i >= 0; --i) {
1833 if (is_Bad(get_irn_n(n, i)))
1838 if (_get_op_pinned(op) >= op_pin_state_exc_pinned) {
1839 op_pin_state state = get_irn_pinned(n);
1841 state == op_pin_state_floats ||
1842 state == op_pin_state_pinned,
1843 "invalid pin state", 0,
1844 ir_printf("node %+F", n));
1847 if (op->ops.verify_node)
1848 return op->ops.verify_node(n, irg);
1854 int irn_vrfy(ir_node *n) {
1856 #ifdef DEBUG_libfirm
1857 res = irn_vrfy_irg(n, current_ir_graph);
1862 /*-----------------------------------------------------------------*/
1863 /* Verify the whole graph. */
1864 /*-----------------------------------------------------------------*/
1866 #ifdef DEBUG_libfirm
1868 * Walker to check every node
1870 static void vrfy_wrap(ir_node *node, void *env) {
1872 *res = irn_vrfy(node);
1876 * Walker to check every node including SSA property.
1877 * Only called if dominance info is available.
1879 static void vrfy_wrap_ssa(ir_node *node, void *env) {
1882 *res = irn_vrfy(node);
1884 *res = check_dominance_for_node(node);
1887 #endif /* DEBUG_libfirm */
1890 * Calls irn_vrfy for each node in irg.
1891 * Graph must be in state "op_pin_state_pinned".
1892 * If dominance info is available, check the SSA property.
1894 int irg_verify(ir_graph *irg, unsigned flags) {
1896 #ifdef DEBUG_libfirm
1899 rem = current_ir_graph;
1900 current_ir_graph = irg;
1901 last_irg_error = NULL;
1903 assert(get_irg_pinned(irg) == op_pin_state_pinned && "Verification need pinned graph");
1905 if (flags & VRFY_ENFORCE_SSA)
1910 get_irg_dom_state(irg) == dom_consistent &&
1911 get_irg_pinned(irg) == op_pin_state_pinned ? vrfy_wrap_ssa : vrfy_wrap,
1915 current_ir_graph = rem;
1917 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT && ! res) {
1918 ir_entity *ent = get_irg_entity(current_ir_graph);
1921 fprintf(stderr, "irg_verify: Verifying graph %s failed\n", get_entity_name(ent));
1923 fprintf(stderr, "irg_verify: Verifying graph %p failed\n", (void *)current_ir_graph);
1925 #endif /* DEBUG_libfirm */
1930 int irn_vrfy_irg_dump(ir_node *n, ir_graph *irg, const char **bad_string) {
1932 firm_verification_t old = get_node_verification_mode();
1934 firm_vrfy_failure_msg = NULL;
1935 do_node_verification(FIRM_VERIFICATION_ERROR_ONLY);
1936 res = irn_vrfy_irg(n, irg);
1937 if (res && get_irg_dom_state(irg) == dom_consistent &&
1938 get_irg_pinned(irg) == op_pin_state_pinned)
1939 res = check_dominance_for_node(n);
1940 do_node_verification(old);
1941 *bad_string = firm_vrfy_failure_msg;
1947 typedef struct _vrfy_bad_env_t {
1953 * Pre-Walker: check Bad predecessors of node.
1955 static void check_bads(ir_node *node, void *env) {
1956 vrfy_bad_env_t *venv = env;
1957 int i, arity = get_irn_arity(node);
1959 if (is_Block(node)) {
1960 if ((venv->flags & BAD_CF) == 0) {
1962 /* check for Bad Block predecessor */
1963 for (i = 0; i < arity; ++i) {
1964 ir_node *pred = get_irn_n(node, i);
1967 venv->res |= BAD_CF;
1969 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1970 fprintf(stderr, "irg_vrfy_bads: Block %ld has Bad predecessor\n", get_irn_node_nr(node));
1972 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1973 dump_ir_block_graph(current_ir_graph, "-assert");
1974 assert(0 && "Bad CF detected");
1980 if ((venv->flags & BAD_BLOCK) == 0) {
1982 /* check for Bad Block */
1983 if (is_Bad(get_nodes_block(node))) {
1984 venv->res |= BAD_BLOCK;
1986 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
1987 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Block\n", get_irn_node_nr(node));
1989 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
1990 dump_ir_block_graph(current_ir_graph, "-assert");
1991 assert(0 && "Bad CF detected");
1996 if ((venv->flags & TUPLE) == 0) {
1997 if (get_irn_op(node) == op_Tuple) {
2000 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2001 fprintf(stderr, "irg_vrfy_bads: node %ld is a Tuple\n", get_irn_node_nr(node));
2003 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2004 dump_ir_block_graph(current_ir_graph, "-assert");
2005 assert(0 && "Tuple detected");
2010 for (i = 0; i < arity; ++i) {
2011 ir_node *pred = get_irn_n(node, i);
2014 /* check for Phi with Bad inputs */
2015 if (is_Phi(node) && !is_Bad(get_nodes_block(node)) && is_Bad(get_irn_n(get_nodes_block(node), i))) {
2016 if (venv->flags & BAD_CF)
2019 venv->res |= BAD_CF;
2021 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2022 fprintf(stderr, "irg_vrfy_bads: Phi %ld has Bad Input\n", get_irn_node_nr(node));
2024 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2025 dump_ir_block_graph(current_ir_graph, "-assert");
2026 assert(0 && "Bad CF detected");
2031 /* Bad node input */
2032 if ((venv->flags & BAD_DF) == 0) {
2033 venv->res |= BAD_DF;
2035 if (get_node_verification_mode() == FIRM_VERIFICATION_REPORT) {
2036 fprintf(stderr, "irg_vrfy_bads: node %ld has Bad Input\n", get_irn_node_nr(node));
2038 if (get_node_verification_mode() == FIRM_VERIFICATION_ON) {
2039 dump_ir_block_graph(current_ir_graph, "-assert");
2040 assert(0 && "Bad NON-CF detected");
2049 * verify occurrence of bad nodes
2051 int irg_vrfy_bads(ir_graph *irg, int flags) {
2057 irg_walk_graph(irg, check_bads, NULL, &env);
2063 * set the default verify operation
2065 void firm_set_default_verifyer(ir_opcode code, ir_op_ops *ops) {
2068 ops->verify_node = verify_node_##a; \
2124 ops->verify_proj_node = verify_node_Proj_##a; \