2 * Copyright (C) 1995-2008 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 Interblock liveness analysis.
23 * @author Sebastian Hack
32 #include "iredges_t.h"
34 #include "irprintf_t.h"
37 #include "irnodeset.h"
46 #include "besched_t.h"
49 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
51 /* see comment in compute_liveness() */
52 #define LV_COMPUTE_SORTED
53 #define LV_STD_SIZE 64
54 #define LV_USE_BINARY_SEARCH
55 #undef LV_INTESIVE_CHECKS
57 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc);
59 static INLINE int is_liveness_node(const ir_node *irn)
61 switch(get_irn_opcode(irn)) {
74 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
76 return _be_lv_next_irn(lv, bl, flags, i);
79 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
81 return _be_lv_get_irn(lv, bl, i);
84 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
86 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
89 int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
91 return _be_is_live_xxx(lv, block, irn, be_lv_state_out);
94 int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
96 return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
100 #ifdef LV_USE_BINARY_SEARCH
101 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
103 struct _be_lv_info_t *payload = arr + 1;
105 unsigned n = arr[0].u.head.n_members;
114 int md = lo + ((hi - lo) >> 1);
115 unsigned md_idx = payload[md].u.node.idx;
119 else if(idx < md_idx)
123 assert(payload[res].u.node.idx == idx);
130 #ifdef LV_INTESIVE_CHECKS
133 for(i = res; i < n; ++i)
134 assert(payload[i].u.node.idx >= idx);
136 for(i = 0; i < res; ++i)
137 assert(payload[i].u.node.idx < idx);
147 * This function searches linearly for the node in the array.
149 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
150 unsigned n = arr[0].u.head.n_members;
153 for(i = 0; i < n; ++i) {
154 if(arr[i + 1].u.node.idx == idx)
162 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
164 struct _be_lv_info_t *irn_live;
165 struct _be_lv_info_node_t *res = NULL;
168 irn_live = phase_get_irn_data(&li->ph, bl);
170 unsigned idx = get_irn_idx(irn);
172 /* Get the position of the index in the array. */
173 int pos = _be_liveness_bsearch(irn_live, idx);
175 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
176 struct _be_lv_info_node_t *rec = &irn_live[pos + 1].u.node;
178 /* Check, if the irn is in deed in the array. */
182 stat_ev_tim_pop("be_lv_get");
187 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
189 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
191 unsigned idx = get_irn_idx(irn);
193 /* Get the position of the index in the array. */
194 unsigned pos = _be_liveness_bsearch(irn_live, idx);
196 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
197 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
199 /* Check, if the irn is in deed in the array. */
200 if(res->idx != idx) {
201 struct _be_lv_info_t *payload;
202 unsigned n_members = irn_live[0].u.head.n_members;
203 unsigned n_size = irn_live[0].u.head.n_size;
206 if(n_members + 1 >= n_size) {
207 /* double the array size. Remember that the first entry is
208 * metadata about the array and not a real array element */
209 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
210 unsigned new_size = (2 * n_size) + 1;
211 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
212 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
213 memcpy(nw, irn_live, old_size_bytes);
214 memset(((char*) nw) + old_size_bytes, 0,
215 new_size_bytes - old_size_bytes);
216 nw[0].u.head.n_size = new_size - 1;
218 phase_set_irn_data(&li->ph, bl, nw);
221 payload = &irn_live[1];
222 for(i = n_members; i > pos; --i) {
223 payload[i] = payload[i - 1];
226 ++irn_live[0].u.head.n_members;
228 res = &payload[pos].u.node;
233 #ifdef LV_INTESIVE_CHECKS
236 unsigned n = irn_live[0].u.head.n_members;
238 struct _be_lv_info_t *payload = &irn_live[1];
240 for(i = 0; i < n; ++i) {
241 assert(payload[i].u.node.idx >= last);
242 last = payload[i].u.node.idx;
251 * Removes a node from the list of live variables of a block.
252 * @return 1 if the node was live at that block, 0 if not.
254 static int be_lv_remove(struct _be_lv_t *li, const ir_node *bl,
257 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
260 unsigned n = irn_live[0].u.head.n_members;
261 unsigned idx = get_irn_idx(irn);
262 unsigned pos = _be_liveness_bsearch(irn_live, idx);
263 struct _be_lv_info_t *payload = irn_live + 1;
264 struct _be_lv_info_node_t *res = &payload[pos].u.node;
266 /* The node is in deed in the block's array. Let's remove it. */
267 if(res->idx == idx) {
270 for(i = pos + 1; i < n; ++i)
271 payload[i - 1] = payload[i];
273 payload[n - 1].u.node.idx = 0;
274 payload[n - 1].u.node.flags = 0;
276 --irn_live[0].u.head.n_members;
277 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
285 static void register_node(be_lv_t *lv, const ir_node *irn)
287 unsigned idx = get_irn_idx(irn);
288 if(idx >= bitset_size(lv->nodes)) {
289 bitset_t *nw = bitset_malloc(2 * idx);
290 bitset_copy(nw, lv->nodes);
291 bitset_free(lv->nodes);
295 bitset_set(lv->nodes, idx);
299 * Mark a node as live-in in a block.
301 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
303 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
304 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
305 n->flags |= be_lv_state_in;
306 register_node(lv, irn);
310 * Mark a node as live-out in a block.
312 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
314 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
315 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
316 n->flags |= be_lv_state_out | be_lv_state_end;
317 register_node(lv, irn);
321 * Mark a node as live-end in a block.
323 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
325 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
326 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
327 n->flags |= be_lv_state_end;
328 register_node(lv, irn);
332 * Mark a node (value) live out at a certain block. Do this also
333 * transitively, i.e. if the block is not the block of the value's
334 * definition, all predecessors are also marked live.
335 * @param def The node (value).
336 * @param block The block to mark the value live out of.
337 * @param visited A set were all visited blocks are recorded.
338 * @param is_true_out Is the node real out there or only live at the end
341 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
343 mark_live_end(lv, block, def);
345 mark_live_out(lv, block, def);
347 if(!bitset_contains_irn(visited, block)) {
348 bitset_add_irn(visited, block);
351 * If this block is not the definition block, we have to go up
354 if(get_nodes_block(def) != block) {
357 mark_live_in(lv, block, def);
359 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
360 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
366 struct _lv_walker_t {
371 typedef struct lv_remove_walker_t {
374 } lv_remove_walker_t;
378 * Liveness analysis for a value.
379 * This functions is meant to be called by a firm walker, to compute the
380 * set of all blocks a value is live in.
381 * @param irn The node (value).
382 * @param env Ignored.
384 static void liveness_for_node(ir_node *irn, void *data)
386 struct _lv_walker_t *walker = data;
387 be_lv_t *lv = walker->lv;
388 bitset_t *visited = walker->data;
389 const ir_edge_t *edge;
392 /* Don't compute liveness information for non-data nodes. */
393 if(!is_liveness_node(irn))
396 bitset_clear_all(visited);
397 def_block = get_nodes_block(irn);
399 /* Go over all uses of the value */
400 foreach_out_edge(irn, edge) {
401 ir_node *use = edge->src;
404 DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use)));
405 assert(get_irn_n(use, edge->pos) == irn);
408 * If the usage is no data node, skip this use, since it does not
409 * affect the liveness of the node.
411 if(!is_liveness_node(use))
414 /* Get the block where the usage is in. */
415 use_block = get_nodes_block(use);
418 * If the use is a phi function, determine the corresponding block
419 * through which the value reaches the phi function and mark the
420 * value as live out of that block.
423 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
424 live_end_at_block(lv, irn, pred_block, visited, 0);
428 * Else, the value is live in at this block. Mark it and call live
429 * out on the predecessors.
431 else if(def_block != use_block) {
434 mark_live_in(lv, use_block, irn);
436 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
437 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
438 live_end_at_block(lv, irn, pred_block, visited, 1);
444 static void lv_remove_irn_walker(ir_node *bl, void *data)
446 lv_remove_walker_t *w = data;
447 be_lv_remove(w->lv, bl, w->irn);
450 static const char *lv_flags_to_str(unsigned flags)
452 static const char *states[] = {
463 return states[flags & 7];
466 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
469 be_lv_t *lv = context;
470 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
472 fprintf(f, "liveness:\n");
474 unsigned n = info[0].u.head.n_members;
477 for(i = 0; i < n; ++i) {
478 struct _be_lv_info_node_t *n = &info[i+1].u.node;
479 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
485 static void *lv_phase_data_init(ir_phase *phase, const ir_node *irn, void *old)
487 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
491 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
492 info[0].u.head.n_size = LV_STD_SIZE - 1;
496 static void collect_nodes(ir_node *irn, void *data)
498 struct obstack *obst = data;
499 if (is_liveness_node(irn))
500 obstack_ptr_grow(obst, irn);
503 static int node_idx_cmp(const void *a, const void *b)
505 const ir_node *p = *(ir_node **) a;
506 const ir_node *q = *(ir_node **) b;
507 int ia = get_irn_idx(p);
508 int ib = get_irn_idx(q);
512 static void compute_liveness(be_lv_t *lv)
515 struct _lv_walker_t w;
521 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
522 n = obstack_object_size(&obst) / sizeof(nodes[0]);
523 nodes = obstack_finish(&obst);
526 * inserting the variables sorted by their ID is probably
527 * more efficient since the binary sorted set insertion
528 * will not need to move arounf the data.
529 * However, if sorting the variables a priori pays off
530 * needs to be checked, hence the define.
532 #ifdef LV_COMPUTE_SORTED
533 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
537 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
539 for (i = 0; i < n; ++i)
540 liveness_for_node(nodes[i], &w);
542 obstack_free(&obst, NULL);
543 register_hook(hook_node_info, &lv->hook_info);
544 stat_ev_tim_pop("be_lv_sets_cons");
547 void be_liveness_assure_sets(be_lv_t *lv)
550 BE_TIMER_PUSH(t_live);
552 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
553 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
554 compute_liveness(lv);
555 /* be_live_chk_compare(lv, lv->lvc); */
557 BE_TIMER_POP(t_live);
561 void be_liveness_assure_chk(be_lv_t *lv)
564 BE_TIMER_PUSH(t_verify);
565 be_liveness_assure_sets(lv);
566 BE_TIMER_POP(t_verify);
572 void be_liveness_invalidate(be_lv_t *lv)
574 if (lv && lv->nodes) {
575 unregister_hook(hook_node_info, &lv->hook_info);
577 bitset_free(lv->nodes);
582 /* Compute the inter block liveness for a graph. */
583 be_lv_t *be_liveness(const be_irg_t *birg)
585 be_lv_t *lv = xmalloc(sizeof(lv[0]));
587 memset(lv, 0, sizeof(lv[0]));
588 lv->irg = be_get_birg_irg(birg);
591 lv->dfs = dfs_new(&absgraph_irg_cfg_succ, lv->irg);
592 lv->lvc = lv_chk_new(lv->irg, lv->dfs);
594 lv->hook_info.context = lv;
595 lv->hook_info.hook._hook_node_info = lv_dump_block;
600 void be_liveness_recompute(be_lv_t *lv)
604 BE_TIMER_PUSH(t_live);
605 last_idx = get_irg_last_idx(lv->irg);
606 if(last_idx >= bitset_size(lv->nodes)) {
607 bitset_free(lv->nodes);
608 lv->nodes = bitset_malloc(last_idx * 2);
610 bitset_clear_all(lv->nodes);
613 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
614 compute_liveness(lv);
616 BE_TIMER_POP(t_live);
620 void be_liveness_free(be_lv_t *lv)
622 be_liveness_invalidate(lv);
626 void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
629 unsigned idx = get_irn_idx(irn);
630 lv_remove_walker_t w;
633 * Removes a single irn from the liveness information.
634 * Since an irn can only be live at blocks dominated by the block of its
635 * definition, we only have to process that dominance subtree.
639 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
640 if(idx < bitset_size(lv->nodes))
641 bitset_clear(lv->nodes, idx);
645 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
648 struct _lv_walker_t w;
650 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
651 liveness_for_node(irn, &w);
656 void be_liveness_update(be_lv_t *lv, ir_node *irn)
658 be_liveness_remove(lv, irn);
659 be_liveness_introduce(lv, irn);
662 static void lv_check_walker(ir_node *bl, void *data)
664 struct _lv_walker_t *w = data;
666 be_lv_t *fresh = w->data;
668 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
669 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
671 if(!fr && curr && curr[0].u.head.n_members > 0) {
674 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
675 for(i = 0; i < curr[0].u.head.n_members; ++i) {
676 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
681 unsigned n_curr = curr[0].u.head.n_members;
682 unsigned n_fresh = fr[0].u.head.n_members;
686 if(n_curr != n_fresh) {
687 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
689 ir_fprintf(stderr, "current:\n");
690 for(i = 0; i < n_curr; ++i) {
691 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
692 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
695 ir_fprintf(stderr, "correct:\n");
696 for(i = 0; i < n_fresh; ++i) {
697 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
698 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
704 void be_liveness_check(be_lv_t *lv)
706 struct _lv_walker_t w;
707 be_lv_t *fresh = be_liveness(lv->birg);
711 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
712 be_liveness_free(fresh);
716 static void lv_dump_block_walker(ir_node *irn, void *data)
718 struct _lv_walker_t *w = data;
720 lv_dump_block(w->lv, w->data, irn);
724 /* Dump the liveness information for a graph. */
725 void be_liveness_dump(const be_lv_t *lv, FILE *f)
727 struct _lv_walker_t w;
729 w.lv = (be_lv_t *) lv;
731 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
734 /* Dump the liveness information for a graph. */
735 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
739 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
740 if((f = fopen(buf, "wt")) != NULL) {
741 be_liveness_dump(lv, f);
747 * Walker: checks the every predecessors of a node dominate
750 static void dom_check(ir_node *irn, void *data)
752 int *problem_found = data;
754 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
756 ir_node *bl = get_nodes_block(irn);
758 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
759 ir_node *op = get_irn_n(irn, i);
760 ir_node *def_bl = get_nodes_block(op);
761 ir_node *use_bl = bl;
764 use_bl = get_Block_cfgpred_block(bl, i);
766 if(get_irn_opcode(use_bl) != iro_Bad
767 && get_irn_opcode(def_bl) != iro_Bad
768 && !block_dominates(def_bl, use_bl)) {
769 ir_fprintf(stderr, "Verify warning: %+F in %+F must dominate %+F for user %+F (%s)\n", op, def_bl, use_bl, irn, get_irg_dump_name(get_irn_irg(op)));
776 /* Check, if the SSA dominance property is fulfilled. */
777 int be_check_dominance(ir_graph *irg)
779 int problem_found = 0;
782 irg_walk_graph(irg, dom_check, NULL, &problem_found);
784 return !problem_found;
787 void be_liveness_transfer(const arch_env_t *arch_env,
788 const arch_register_class_t *cls,
789 ir_node *node, ir_nodeset_t *nodeset)
793 /* You should better break out of your loop when hitting the first phi
795 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
797 if (get_irn_mode(node) == mode_T) {
798 const ir_edge_t *edge;
800 foreach_out_edge(node, edge) {
801 ir_node *proj = get_edge_src_irn(edge);
803 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
804 ir_nodeset_remove(nodeset, proj);
807 } else if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
808 ir_nodeset_remove(nodeset, node);
811 arity = get_irn_arity(node);
812 for (i = 0; i < arity; ++i) {
813 ir_node *op = get_irn_n(node, i);
815 if (arch_irn_consider_in_reg_alloc(arch_env, cls, op))
816 ir_nodeset_insert(nodeset, op);
822 void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env,
823 const arch_register_class_t *cls,
824 const ir_node *block, ir_nodeset_t *live)
828 assert(lv->nodes && "live sets must be computed");
829 be_lv_foreach(lv, block, be_lv_state_end, i) {
830 ir_node *node = be_lv_get_irn(lv, block, i);
831 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
834 ir_nodeset_insert(live, node);
840 void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env,
841 const arch_register_class_t *cls,
842 const ir_node *pos, ir_nodeset_t *live)
844 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
847 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
848 sched_foreach_reverse(bl, irn) {
850 * If we encounter the node we want to insert the Perm after,
851 * exit immediately, so that this node is still live
856 be_liveness_transfer(arch_env, cls, irn, live);
860 void be_liveness_nodes_live_at_input(const be_lv_t *lv,
861 const arch_env_t *arch_env,
862 const arch_register_class_t *cls,
863 const ir_node *pos, ir_nodeset_t *live)
865 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
868 assert(lv->nodes && "live sets must be computed");
869 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
870 sched_foreach_reverse(bl, irn) {
871 be_liveness_transfer(arch_env, cls, irn, live);
877 static void collect_node(ir_node *irn, void *data)
879 struct obstack *obst = data;
880 obstack_ptr_grow(obst, irn);
883 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
885 ir_graph *irg = lv->irg;
894 irg_block_walk_graph(irg, collect_node, NULL, &obst);
895 obstack_ptr_grow(&obst, NULL);
896 blocks = obstack_finish(&obst);
898 irg_walk_graph(irg, collect_node, NULL, &obst);
899 obstack_ptr_grow(&obst, NULL);
900 nodes = obstack_finish(&obst);
902 stat_ev_ctx_push("be_lv_chk_compare");
903 for (j = 0; nodes[j]; ++j) {
904 ir_node *irn = nodes[j];
905 for (i = 0; blocks[i]; ++i) {
906 ir_node *bl = blocks[i];
908 if (!is_Block(irn)) {
909 int lvr_in = be_is_live_in (lv, bl, irn);
910 int lvr_out = be_is_live_out(lv, bl, irn);
911 int lvr_end = be_is_live_end(lv, bl, irn);
913 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
914 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
915 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
917 if (lvr_in - lvc_in != 0)
918 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
920 if (lvr_end - lvc_end != 0)
921 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
923 if (lvr_out - lvc_out != 0)
924 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
928 stat_ev_ctx_pop("be_lv_chk_compare");
930 obstack_free(&obst, NULL);
933 void be_init_live(void)
935 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
938 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);