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
31 /* statev is expensive here, only enable when needed */
32 #define DISABLE_STATEV
35 #include "iredges_t.h"
37 #include "irprintf_t.h"
40 #include "irnodeset.h"
49 #include "besched_t.h"
52 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
54 /* see comment in compute_liveness() */
55 #define LV_COMPUTE_SORTED
56 #define LV_STD_SIZE 64
57 #define LV_USE_BINARY_SEARCH
58 #undef LV_INTESIVE_CHECKS
60 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc);
62 static INLINE int is_liveness_node(const ir_node *irn)
64 switch(get_irn_opcode(irn)) {
77 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
79 return _be_lv_next_irn(lv, bl, flags, i);
82 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
84 return _be_lv_get_irn(lv, bl, i);
87 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
89 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
92 int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
94 return _be_is_live_xxx(lv, block, irn, be_lv_state_out);
97 int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
99 return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
103 #ifdef LV_USE_BINARY_SEARCH
104 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
106 struct _be_lv_info_t *payload = arr + 1;
108 unsigned n = arr[0].u.head.n_members;
117 int md = lo + ((hi - lo) >> 1);
118 unsigned md_idx = payload[md].u.node.idx;
122 else if(idx < md_idx)
126 assert(payload[res].u.node.idx == idx);
133 #ifdef LV_INTESIVE_CHECKS
136 for(i = res; i < n; ++i)
137 assert(payload[i].u.node.idx >= idx);
139 for(i = 0; i < res; ++i)
140 assert(payload[i].u.node.idx < idx);
150 * This function searches linearly for the node in the array.
152 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
153 unsigned n = arr[0].u.head.n_members;
156 for(i = 0; i < n; ++i) {
157 if(arr[i + 1].u.node.idx == idx)
165 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
167 struct _be_lv_info_t *irn_live;
168 struct _be_lv_info_node_t *res = NULL;
171 irn_live = phase_get_irn_data(&li->ph, bl);
173 unsigned idx = get_irn_idx(irn);
175 /* Get the position of the index in the array. */
176 int pos = _be_liveness_bsearch(irn_live, idx);
178 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
179 struct _be_lv_info_node_t *rec = &irn_live[pos + 1].u.node;
181 /* Check, if the irn is in deed in the array. */
185 stat_ev_tim_pop("be_lv_get");
190 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
192 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
194 unsigned idx = get_irn_idx(irn);
196 /* Get the position of the index in the array. */
197 unsigned pos = _be_liveness_bsearch(irn_live, idx);
199 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
200 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
202 /* Check, if the irn is in deed in the array. */
203 if(res->idx != idx) {
204 struct _be_lv_info_t *payload;
205 unsigned n_members = irn_live[0].u.head.n_members;
206 unsigned n_size = irn_live[0].u.head.n_size;
209 if(n_members + 1 >= n_size) {
210 /* double the array size. Remember that the first entry is
211 * metadata about the array and not a real array element */
212 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
213 unsigned new_size = (2 * n_size) + 1;
214 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
215 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
216 memcpy(nw, irn_live, old_size_bytes);
217 memset(((char*) nw) + old_size_bytes, 0,
218 new_size_bytes - old_size_bytes);
219 nw[0].u.head.n_size = new_size - 1;
221 phase_set_irn_data(&li->ph, bl, nw);
224 payload = &irn_live[1];
225 for(i = n_members; i > pos; --i) {
226 payload[i] = payload[i - 1];
229 ++irn_live[0].u.head.n_members;
231 res = &payload[pos].u.node;
236 #ifdef LV_INTESIVE_CHECKS
239 unsigned n = irn_live[0].u.head.n_members;
241 struct _be_lv_info_t *payload = &irn_live[1];
243 for(i = 0; i < n; ++i) {
244 assert(payload[i].u.node.idx >= last);
245 last = payload[i].u.node.idx;
254 * Removes a node from the list of live variables of a block.
255 * @return 1 if the node was live at that block, 0 if not.
257 static int be_lv_remove(struct _be_lv_t *li, const ir_node *bl,
260 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
263 unsigned n = irn_live[0].u.head.n_members;
264 unsigned idx = get_irn_idx(irn);
265 unsigned pos = _be_liveness_bsearch(irn_live, idx);
266 struct _be_lv_info_t *payload = irn_live + 1;
267 struct _be_lv_info_node_t *res = &payload[pos].u.node;
269 /* The node is in deed in the block's array. Let's remove it. */
270 if(res->idx == idx) {
273 for(i = pos + 1; i < n; ++i)
274 payload[i - 1] = payload[i];
276 payload[n - 1].u.node.idx = 0;
277 payload[n - 1].u.node.flags = 0;
279 --irn_live[0].u.head.n_members;
280 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
288 static void register_node(be_lv_t *lv, const ir_node *irn)
290 unsigned idx = get_irn_idx(irn);
291 if(idx >= bitset_size(lv->nodes)) {
292 bitset_t *nw = bitset_malloc(2 * idx);
293 bitset_copy(nw, lv->nodes);
294 bitset_free(lv->nodes);
298 bitset_set(lv->nodes, idx);
302 * Mark a node as live-in in a block.
304 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
306 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
307 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
308 n->flags |= be_lv_state_in;
309 register_node(lv, irn);
313 * Mark a node as live-out in a block.
315 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
317 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
318 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
319 n->flags |= be_lv_state_out | be_lv_state_end;
320 register_node(lv, irn);
324 * Mark a node as live-end in a block.
326 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
328 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
329 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
330 n->flags |= be_lv_state_end;
331 register_node(lv, irn);
335 * Mark a node (value) live out at a certain block. Do this also
336 * transitively, i.e. if the block is not the block of the value's
337 * definition, all predecessors are also marked live.
338 * @param def The node (value).
339 * @param block The block to mark the value live out of.
340 * @param visited A set were all visited blocks are recorded.
341 * @param is_true_out Is the node real out there or only live at the end
344 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
346 mark_live_end(lv, block, def);
348 mark_live_out(lv, block, def);
350 if(!bitset_contains_irn(visited, block)) {
351 bitset_add_irn(visited, block);
354 * If this block is not the definition block, we have to go up
357 if(get_nodes_block(def) != block) {
360 mark_live_in(lv, block, def);
362 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
363 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
369 struct _lv_walker_t {
374 typedef struct lv_remove_walker_t {
377 } lv_remove_walker_t;
381 * Liveness analysis for a value.
382 * This functions is meant to be called by a firm walker, to compute the
383 * set of all blocks a value is live in.
384 * @param irn The node (value).
385 * @param env Ignored.
387 static void liveness_for_node(ir_node *irn, void *data)
389 struct _lv_walker_t *walker = data;
390 be_lv_t *lv = walker->lv;
391 bitset_t *visited = walker->data;
392 const ir_edge_t *edge;
395 /* Don't compute liveness information for non-data nodes. */
396 if(!is_liveness_node(irn))
399 bitset_clear_all(visited);
400 def_block = get_nodes_block(irn);
402 /* Go over all uses of the value */
403 foreach_out_edge(irn, edge) {
404 ir_node *use = edge->src;
407 DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use)));
408 assert(get_irn_n(use, edge->pos) == irn);
411 * If the usage is no data node, skip this use, since it does not
412 * affect the liveness of the node.
414 if(!is_liveness_node(use))
417 /* Get the block where the usage is in. */
418 use_block = get_nodes_block(use);
421 * If the use is a phi function, determine the corresponding block
422 * through which the value reaches the phi function and mark the
423 * value as live out of that block.
426 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
427 live_end_at_block(lv, irn, pred_block, visited, 0);
431 * Else, the value is live in at this block. Mark it and call live
432 * out on the predecessors.
434 else if(def_block != use_block) {
437 mark_live_in(lv, use_block, irn);
439 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
440 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
441 live_end_at_block(lv, irn, pred_block, visited, 1);
447 static void lv_remove_irn_walker(ir_node *bl, void *data)
449 lv_remove_walker_t *w = data;
450 be_lv_remove(w->lv, bl, w->irn);
453 static const char *lv_flags_to_str(unsigned flags)
455 static const char *states[] = {
466 return states[flags & 7];
469 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
472 be_lv_t *lv = context;
473 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
475 fprintf(f, "liveness:\n");
477 unsigned n = info[0].u.head.n_members;
480 for(i = 0; i < n; ++i) {
481 struct _be_lv_info_node_t *n = &info[i+1].u.node;
482 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
488 static void *lv_phase_data_init(ir_phase *phase, const ir_node *irn, void *old)
490 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
494 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
495 info[0].u.head.n_size = LV_STD_SIZE - 1;
499 static void collect_nodes(ir_node *irn, void *data)
501 struct obstack *obst = data;
502 if (is_liveness_node(irn))
503 obstack_ptr_grow(obst, irn);
506 static int node_idx_cmp(const void *a, const void *b)
508 const ir_node *p = *(ir_node **) a;
509 const ir_node *q = *(ir_node **) b;
510 int ia = get_irn_idx(p);
511 int ib = get_irn_idx(q);
515 static void compute_liveness(be_lv_t *lv)
518 struct _lv_walker_t w;
524 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
525 n = obstack_object_size(&obst) / sizeof(nodes[0]);
526 nodes = obstack_finish(&obst);
529 * inserting the variables sorted by their ID is probably
530 * more efficient since the binary sorted set insertion
531 * will not need to move around the data.
532 * However, if sorting the variables a priori pays off
533 * needs to be checked, hence the define.
535 #ifdef LV_COMPUTE_SORTED
536 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
540 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
542 for (i = 0; i < n; ++i)
543 liveness_for_node(nodes[i], &w);
545 obstack_free(&obst, NULL);
546 register_hook(hook_node_info, &lv->hook_info);
547 stat_ev_tim_pop("be_lv_sets_cons");
550 void be_liveness_assure_sets(be_lv_t *lv)
553 BE_TIMER_PUSH(t_live);
555 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
556 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
557 compute_liveness(lv);
558 /* be_live_chk_compare(lv, lv->lvc); */
560 BE_TIMER_POP(t_live);
564 void be_liveness_assure_chk(be_lv_t *lv)
567 BE_TIMER_PUSH(t_verify);
568 be_liveness_assure_sets(lv);
569 BE_TIMER_POP(t_verify);
575 void be_liveness_invalidate(be_lv_t *lv)
577 if (lv && lv->nodes) {
578 unregister_hook(hook_node_info, &lv->hook_info);
580 bitset_free(lv->nodes);
585 /* Compute the inter block liveness for a graph. */
586 be_lv_t *be_liveness(const be_irg_t *birg)
588 be_lv_t *lv = XMALLOCZ(be_lv_t);
590 lv->irg = be_get_birg_irg(birg);
593 lv->dfs = dfs_new(&absgraph_irg_cfg_succ, lv->irg);
594 lv->lvc = lv_chk_new(lv->irg, lv->dfs);
596 lv->hook_info.context = lv;
597 lv->hook_info.hook._hook_node_info = lv_dump_block;
602 void be_liveness_recompute(be_lv_t *lv)
606 BE_TIMER_PUSH(t_live);
607 last_idx = get_irg_last_idx(lv->irg);
608 if(last_idx >= bitset_size(lv->nodes)) {
609 bitset_free(lv->nodes);
610 lv->nodes = bitset_malloc(last_idx * 2);
612 bitset_clear_all(lv->nodes);
615 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
616 compute_liveness(lv);
618 BE_TIMER_POP(t_live);
622 void be_liveness_free(be_lv_t *lv)
624 be_liveness_invalidate(lv);
626 lv_chk_free(lv->lvc);
632 void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
635 unsigned idx = get_irn_idx(irn);
636 lv_remove_walker_t w;
639 * Removes a single irn from the liveness information.
640 * Since an irn can only be live at blocks dominated by the block of its
641 * definition, we only have to process that dominance subtree.
645 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
646 if(idx < bitset_size(lv->nodes))
647 bitset_clear(lv->nodes, idx);
651 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
654 struct _lv_walker_t w;
656 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
657 liveness_for_node(irn, &w);
662 void be_liveness_update(be_lv_t *lv, ir_node *irn)
664 be_liveness_remove(lv, irn);
665 be_liveness_introduce(lv, irn);
668 static void lv_check_walker(ir_node *bl, void *data)
670 struct _lv_walker_t *w = data;
672 be_lv_t *fresh = w->data;
674 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
675 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
677 if(!fr && curr && curr[0].u.head.n_members > 0) {
680 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
681 for(i = 0; i < curr[0].u.head.n_members; ++i) {
682 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
687 unsigned n_curr = curr[0].u.head.n_members;
688 unsigned n_fresh = fr[0].u.head.n_members;
692 if(n_curr != n_fresh) {
693 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
695 ir_fprintf(stderr, "current:\n");
696 for(i = 0; i < n_curr; ++i) {
697 struct _be_lv_info_node_t *n = &curr[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));
701 ir_fprintf(stderr, "correct:\n");
702 for(i = 0; i < n_fresh; ++i) {
703 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
704 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
710 void be_liveness_check(be_lv_t *lv)
712 struct _lv_walker_t w;
713 be_lv_t *fresh = be_liveness(lv->birg);
717 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
718 be_liveness_free(fresh);
722 static void lv_dump_block_walker(ir_node *irn, void *data)
724 struct _lv_walker_t *w = data;
726 lv_dump_block(w->lv, w->data, irn);
730 /* Dump the liveness information for a graph. */
731 void be_liveness_dump(const be_lv_t *lv, FILE *f)
733 struct _lv_walker_t w;
735 w.lv = (be_lv_t *) lv;
737 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
740 /* Dump the liveness information for a graph. */
741 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
745 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
746 if((f = fopen(buf, "wt")) != NULL) {
747 be_liveness_dump(lv, f);
753 * Walker: checks the every predecessors of a node dominate
756 static void dom_check(ir_node *irn, void *data)
758 int *problem_found = data;
760 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
762 ir_node *bl = get_nodes_block(irn);
764 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
765 ir_node *op = get_irn_n(irn, i);
766 ir_node *def_bl = get_nodes_block(op);
767 ir_node *use_bl = bl;
770 use_bl = get_Block_cfgpred_block(bl, i);
772 if(get_irn_opcode(use_bl) != iro_Bad
773 && get_irn_opcode(def_bl) != iro_Bad
774 && !block_dominates(def_bl, use_bl)) {
775 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)));
782 /* Check, if the SSA dominance property is fulfilled. */
783 int be_check_dominance(ir_graph *irg)
785 int problem_found = 0;
788 irg_walk_graph(irg, dom_check, NULL, &problem_found);
790 return !problem_found;
793 void be_liveness_transfer(const arch_register_class_t *cls,
794 ir_node *node, ir_nodeset_t *nodeset)
798 /* You should better break out of your loop when hitting the first phi
800 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
802 if (get_irn_mode(node) == mode_T) {
803 const ir_edge_t *edge;
805 foreach_out_edge(node, edge) {
806 ir_node *proj = get_edge_src_irn(edge);
808 if (arch_irn_consider_in_reg_alloc(cls, proj)) {
809 ir_nodeset_remove(nodeset, proj);
812 } else if (arch_irn_consider_in_reg_alloc(cls, node)) {
813 ir_nodeset_remove(nodeset, node);
816 arity = get_irn_arity(node);
817 for (i = 0; i < arity; ++i) {
818 ir_node *op = get_irn_n(node, i);
820 if (arch_irn_consider_in_reg_alloc(cls, op))
821 ir_nodeset_insert(nodeset, op);
827 void be_liveness_end_of_block(const be_lv_t *lv,
828 const arch_register_class_t *cls,
829 const ir_node *block, ir_nodeset_t *live)
833 assert(lv->nodes && "live sets must be computed");
834 be_lv_foreach(lv, block, be_lv_state_end, i) {
835 ir_node *node = be_lv_get_irn(lv, block, i);
836 if (!arch_irn_consider_in_reg_alloc(cls, node))
839 ir_nodeset_insert(live, node);
845 void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env,
846 const arch_register_class_t *cls,
847 const ir_node *pos, ir_nodeset_t *live)
849 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
851 (void)arch_env; // TODO remove parameter
853 be_liveness_end_of_block(lv, cls, bl, live);
854 sched_foreach_reverse(bl, irn) {
856 * If we encounter the node we want to insert the Perm after,
857 * exit immediately, so that this node is still live
862 be_liveness_transfer(cls, irn, live);
866 void be_liveness_nodes_live_at_input(const be_lv_t *lv,
867 const arch_env_t *arch_env,
868 const arch_register_class_t *cls,
869 const ir_node *pos, ir_nodeset_t *live)
871 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
873 (void)arch_env; // TODO remove parameter
875 assert(lv->nodes && "live sets must be computed");
876 be_liveness_end_of_block(lv, cls, bl, live);
877 sched_foreach_reverse(bl, irn) {
878 be_liveness_transfer(cls, irn, live);
884 static void collect_node(ir_node *irn, void *data)
886 struct obstack *obst = data;
887 obstack_ptr_grow(obst, irn);
890 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
892 ir_graph *irg = lv->irg;
901 irg_block_walk_graph(irg, collect_node, NULL, &obst);
902 obstack_ptr_grow(&obst, NULL);
903 blocks = obstack_finish(&obst);
905 irg_walk_graph(irg, collect_node, NULL, &obst);
906 obstack_ptr_grow(&obst, NULL);
907 nodes = obstack_finish(&obst);
909 stat_ev_ctx_push("be_lv_chk_compare");
910 for (j = 0; nodes[j]; ++j) {
911 ir_node *irn = nodes[j];
912 for (i = 0; blocks[i]; ++i) {
913 ir_node *bl = blocks[i];
915 if (!is_Block(irn)) {
916 int lvr_in = be_is_live_in (lv, bl, irn);
917 int lvr_out = be_is_live_out(lv, bl, irn);
918 int lvr_end = be_is_live_end(lv, bl, irn);
920 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
921 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
922 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
924 if (lvr_in - lvc_in != 0)
925 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
927 if (lvr_end - lvc_end != 0)
928 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
930 if (lvr_out - lvc_out != 0)
931 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
935 stat_ev_ctx_pop("be_lv_chk_compare");
937 obstack_free(&obst, NULL);
940 void be_init_live(void)
942 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
945 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);