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 Interblock liveness analysis.
23 * @author Sebastian Hack
32 #include "iredges_t.h"
34 #include "irprintf_t.h"
37 #include "irnodeset.h"
45 #include "besched_t.h"
48 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
50 /* see comment in compute_liveness() */
51 #define LV_COMPUTE_SORTED
52 #define LV_STD_SIZE 64
53 #define LV_USE_BINARY_SEARCH
54 #undef LV_INTESIVE_CHECKS
56 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc);
58 static INLINE int is_liveness_node(const ir_node *irn)
60 switch(get_irn_opcode(irn)) {
72 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
74 return _be_lv_next_irn(lv, bl, flags, i);
77 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
79 return _be_lv_get_irn(lv, bl, i);
82 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
84 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
87 int (be_is_live_out)(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_out);
92 int (be_is_live_end)(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_end);
98 #ifdef LV_USE_BINARY_SEARCH
99 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
101 struct _be_lv_info_t *payload = arr + 1;
103 unsigned n = arr[0].u.head.n_members;
112 int md = lo + ((hi - lo) >> 1);
113 unsigned md_idx = payload[md].u.node.idx;
117 else if(idx < md_idx)
121 assert(payload[res].u.node.idx == idx);
128 #ifdef LV_INTESIVE_CHECKS
131 for(i = res; i < n; ++i)
132 assert(payload[i].u.node.idx >= idx);
134 for(i = 0; i < res; ++i)
135 assert(payload[i].u.node.idx < idx);
145 * This function searches linearly for the node in the array.
147 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
148 unsigned n = arr[0].u.head.n_members;
151 for(i = 0; i < n; ++i) {
152 if(arr[i + 1].u.node.idx == idx)
160 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
162 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
165 unsigned idx = get_irn_idx(irn);
167 /* Get the position of the index in the array. */
168 int pos = _be_liveness_bsearch(irn_live, idx);
170 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
171 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
173 /* Check, if the irn is in deed in the array. */
181 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
183 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
185 unsigned idx = get_irn_idx(irn);
187 /* Get the position of the index in the array. */
188 unsigned pos = _be_liveness_bsearch(irn_live, idx);
190 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
191 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
193 /* Check, if the irn is in deed in the array. */
194 if(res->idx != idx) {
195 struct _be_lv_info_t *payload;
196 unsigned n_members = irn_live[0].u.head.n_members;
197 unsigned n_size = irn_live[0].u.head.n_size;
200 if(n_members + 1 >= n_size) {
201 /* double the array size. Remember that the first entry is
202 * metadata about the array and not a real array element */
203 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
204 unsigned new_size = (2 * n_size) + 1;
205 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
206 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
207 memcpy(nw, irn_live, old_size_bytes);
208 memset(((char*) nw) + old_size_bytes, 0,
209 new_size_bytes - old_size_bytes);
210 nw[0].u.head.n_size = new_size - 1;
212 phase_set_irn_data(&li->ph, bl, nw);
215 payload = &irn_live[1];
216 for(i = n_members; i > pos; --i) {
217 payload[i] = payload[i - 1];
220 ++irn_live[0].u.head.n_members;
222 res = &payload[pos].u.node;
227 #ifdef LV_INTESIVE_CHECKS
230 unsigned n = irn_live[0].u.head.n_members;
232 struct _be_lv_info_t *payload = &irn_live[1];
234 for(i = 0; i < n; ++i) {
235 assert(payload[i].u.node.idx >= last);
236 last = payload[i].u.node.idx;
245 * Removes a node from the list of live variables of a block.
246 * @return 1 if the node was live at that block, 0 if not.
248 static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
250 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
253 unsigned n = irn_live[0].u.head.n_members;
254 unsigned idx = get_irn_idx(irn);
255 unsigned pos = _be_liveness_bsearch(irn_live, idx);
256 struct _be_lv_info_t *payload = irn_live + 1;
257 struct _be_lv_info_node_t *res = &payload[pos].u.node;
259 /* The node is in deed in the block's array. Let's remove it. */
260 if(res->idx == idx) {
263 for(i = pos + 1; i < n; ++i)
264 payload[i - 1] = payload[i];
266 payload[n - 1].u.node.idx = 0;
267 payload[n - 1].u.node.flags = 0;
269 --irn_live[0].u.head.n_members;
270 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
278 static void register_node(be_lv_t *lv, const ir_node *irn)
280 unsigned idx = get_irn_idx(irn);
281 if(idx >= bitset_size(lv->nodes)) {
282 bitset_t *nw = bitset_malloc(2 * idx);
283 bitset_copy(nw, lv->nodes);
284 bitset_free(lv->nodes);
288 bitset_set(lv->nodes, idx);
292 * Mark a node as live-in in a block.
294 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
296 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
297 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
298 n->flags |= be_lv_state_in;
299 register_node(lv, irn);
303 * Mark a node as live-out in a block.
305 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
307 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
308 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
309 n->flags |= be_lv_state_out | be_lv_state_end;
310 register_node(lv, irn);
314 * Mark a node as live-end in a block.
316 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
318 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
319 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
320 n->flags |= be_lv_state_end;
321 register_node(lv, irn);
325 * Mark a node (value) live out at a certain block. Do this also
326 * transitively, i.e. if the block is not the block of the value's
327 * definition, all predecessors are also marked live.
328 * @param def The node (value).
329 * @param block The block to mark the value live out of.
330 * @param visited A set were all visited blocks are recorded.
331 * @param is_true_out Is the node real out there or only live at the end
334 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
336 mark_live_end(lv, block, def);
338 mark_live_out(lv, block, def);
340 if(!bitset_contains_irn(visited, block)) {
341 bitset_add_irn(visited, block);
344 * If this block is not the definition block, we have to go up
347 if(get_nodes_block(def) != block) {
350 mark_live_in(lv, block, def);
352 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
353 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
359 struct _lv_walker_t {
365 * Liveness analysis for a value.
366 * This functions is meant to be called by a firm walker, to compute the
367 * set of all blocks a value is live in.
368 * @param irn The node (value).
369 * @param env Ignored.
371 static void liveness_for_node(ir_node *irn, void *data)
373 struct _lv_walker_t *walker = data;
374 be_lv_t *lv = walker->lv;
375 bitset_t *visited = walker->data;
376 const ir_edge_t *edge;
379 /* Don't compute liveness information for non-data nodes. */
380 if(!is_liveness_node(irn))
383 bitset_clear_all(visited);
384 def_block = get_nodes_block(irn);
386 /* Go over all uses of the value */
387 foreach_out_edge(irn, edge) {
388 ir_node *use = edge->src;
391 DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use)));
392 assert(get_irn_n(use, edge->pos) == irn);
395 * If the usage is no data node, skip this use, since it does not
396 * affect the liveness of the node.
398 if(!is_liveness_node(use))
401 /* Get the block where the usage is in. */
402 use_block = get_nodes_block(use);
405 * If the use is a phi function, determine the corresponding block
406 * through which the value reaches the phi function and mark the
407 * value as live out of that block.
410 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
411 live_end_at_block(lv, irn, pred_block, visited, 0);
415 * Else, the value is live in at this block. Mark it and call live
416 * out on the predecessors.
418 else if(def_block != use_block) {
421 mark_live_in(lv, use_block, irn);
423 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
424 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
425 live_end_at_block(lv, irn, pred_block, visited, 1);
431 static void lv_remove_irn_walker(ir_node *bl, void *data)
433 struct _lv_walker_t *w = data;
435 ir_node *irn = w->data;
436 be_lv_remove(lv, bl, irn);
439 static const char *lv_flags_to_str(unsigned flags)
441 static const char *states[] = {
452 return states[flags & 7];
455 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
458 be_lv_t *lv = context;
459 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
461 fprintf(f, "liveness:\n");
463 unsigned n = info[0].u.head.n_members;
466 for(i = 0; i < n; ++i) {
467 struct _be_lv_info_node_t *n = &info[i+1].u.node;
468 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
474 static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old)
476 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
480 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
481 info[0].u.head.n_size = LV_STD_SIZE - 1;
485 static void collect_nodes(ir_node *irn, void *data)
487 struct obstack *obst = data;
488 if (is_liveness_node(irn))
489 obstack_ptr_grow(obst, irn);
492 static int node_idx_cmp(const void *a, const void *b)
494 const ir_node *p = *(ir_node **) a;
495 const ir_node *q = *(ir_node **) b;
496 int ia = get_irn_idx(p);
497 int ib = get_irn_idx(q);
501 static void compute_liveness(be_lv_t *lv)
504 struct _lv_walker_t w;
509 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
510 n = obstack_object_size(&obst) / sizeof(nodes[0]);
511 nodes = obstack_finish(&obst);
514 * inserting the variables sorted by their ID is probably
515 * more efficient since the binary sorted set insertion
516 * will not need to move arounf the data.
517 * However, if sorting the variables a priori pays off
518 * needs to be checked, hence the define.
520 #ifdef LV_COMPUTE_SORTED
521 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
525 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
527 for (i = 0; i < n; ++i)
528 liveness_for_node(nodes[i], &w);
530 obstack_free(&obst, NULL);
531 register_hook(hook_node_info, &lv->hook_info);
534 void be_liveness_assure_sets(be_lv_t *lv)
537 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
538 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
539 compute_liveness(lv);
540 /* be_live_chk_compare(lv, lv->lvc); */
544 void be_liveness_assure_chk(be_lv_t *lv)
547 be_liveness_assure_sets(lv);
553 void be_liveness_invalidate(be_lv_t *lv)
555 if (lv && lv->nodes) {
556 unregister_hook(hook_node_info, &lv->hook_info);
558 bitset_free(lv->nodes);
563 /* Compute the inter block liveness for a graph. */
564 be_lv_t *be_liveness(const be_irg_t *birg)
566 be_lv_t *lv = xmalloc(sizeof(lv[0]));
568 memset(lv, 0, sizeof(lv[0]));
569 lv->irg = be_get_birg_irg(birg);
572 lv->dfs = dfs_new(&absgraph_irg_cfg_succ, lv->irg);
573 lv->lvc = lv_chk_new(lv->irg, lv->dfs);
575 lv->hook_info.context = lv;
576 lv->hook_info.hook._hook_node_info = lv_dump_block;
581 void be_liveness_recompute(be_lv_t *lv)
583 unsigned last_idx = get_irg_last_idx(lv->irg);
584 if(last_idx >= bitset_size(lv->nodes)) {
585 bitset_free(lv->nodes);
586 lv->nodes = bitset_malloc(last_idx * 2);
590 bitset_clear_all(lv->nodes);
593 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
594 compute_liveness(lv);
598 void be_liveness_free(be_lv_t *lv)
600 be_liveness_invalidate(lv);
604 void be_liveness_remove(be_lv_t *lv, ir_node *irn)
607 unsigned idx = get_irn_idx(irn);
608 struct _lv_walker_t w;
611 * Removes a single irn from the liveness information.
612 * Since an irn can only be live at blocks dominated by the block of its
613 * definition, we only have to process that dominance subtree.
617 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
618 if(idx < bitset_size(lv->nodes))
619 bitset_clear(lv->nodes, idx);
623 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
626 struct _lv_walker_t w;
628 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
629 liveness_for_node(irn, &w);
634 void be_liveness_update(be_lv_t *lv, ir_node *irn)
636 be_liveness_remove(lv, irn);
637 be_liveness_introduce(lv, irn);
640 static void lv_check_walker(ir_node *bl, void *data)
642 struct _lv_walker_t *w = data;
644 be_lv_t *fresh = w->data;
646 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
647 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
649 if(!fr && curr && curr[0].u.head.n_members > 0) {
652 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
653 for(i = 0; i < curr[0].u.head.n_members; ++i) {
654 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
659 unsigned n_curr = curr[0].u.head.n_members;
660 unsigned n_fresh = fr[0].u.head.n_members;
664 if(n_curr != n_fresh) {
665 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
667 ir_fprintf(stderr, "current:\n");
668 for(i = 0; i < n_curr; ++i) {
669 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
670 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
673 ir_fprintf(stderr, "correct:\n");
674 for(i = 0; i < n_fresh; ++i) {
675 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
676 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
682 void be_liveness_check(be_lv_t *lv)
684 struct _lv_walker_t w;
685 be_lv_t *fresh = be_liveness(lv->birg);
689 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
690 be_liveness_free(fresh);
694 static void lv_dump_block_walker(ir_node *irn, void *data)
696 struct _lv_walker_t *w = data;
698 lv_dump_block(w->lv, w->data, irn);
702 /* Dump the liveness information for a graph. */
703 void be_liveness_dump(const be_lv_t *lv, FILE *f)
705 struct _lv_walker_t w;
707 w.lv = (be_lv_t *) lv;
709 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
712 /* Dump the liveness information for a graph. */
713 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
717 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
718 if((f = fopen(buf, "wt")) != NULL) {
719 be_liveness_dump(lv, f);
725 * Walker: checks the every predecessors of a node dominate
728 static void dom_check(ir_node *irn, void *data)
730 int *problem_found = data;
732 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
734 ir_node *bl = get_nodes_block(irn);
736 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
737 ir_node *op = get_irn_n(irn, i);
738 ir_node *def_bl = get_nodes_block(op);
739 ir_node *use_bl = bl;
742 use_bl = get_Block_cfgpred_block(bl, i);
744 if(get_irn_opcode(use_bl) != iro_Bad
745 && get_irn_opcode(def_bl) != iro_Bad
746 && !block_dominates(def_bl, use_bl)) {
747 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)));
754 /* Check, if the SSA dominance property is fulfilled. */
755 int be_check_dominance(ir_graph *irg)
757 int problem_found = 0;
760 irg_walk_graph(irg, dom_check, NULL, &problem_found);
762 return !problem_found;
765 void be_liveness_transfer(const arch_env_t *arch_env,
766 const arch_register_class_t *cls,
767 ir_node *node, ir_nodeset_t *nodeset)
771 /* You should better break out of your loop when hitting the first phi
773 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
775 if (get_irn_mode(node) == mode_T) {
776 const ir_edge_t *edge;
778 foreach_out_edge(node, edge) {
779 ir_node *proj = get_edge_src_irn(edge);
781 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
782 ir_nodeset_remove(nodeset, proj);
787 if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
788 ir_nodeset_remove(nodeset, node);
791 arity = get_irn_arity(node);
792 for (i = 0; i < arity; ++i) {
793 ir_node *op = get_irn_n(node, i);
795 if (arch_irn_consider_in_reg_alloc(arch_env, cls, op))
796 ir_nodeset_insert(nodeset, op);
802 void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env,
803 const arch_register_class_t *cls,
804 const ir_node *block, ir_nodeset_t *live)
808 assert(lv->nodes && "live sets must be computed");
809 be_lv_foreach(lv, block, be_lv_state_end, i) {
810 ir_node *node = be_lv_get_irn(lv, block, i);
811 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
814 ir_nodeset_insert(live, node);
820 void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env,
821 const arch_register_class_t *cls,
822 const ir_node *pos, ir_nodeset_t *live)
824 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
827 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
828 sched_foreach_reverse(bl, irn) {
830 * If we encounter the node we want to insert the Perm after,
831 * exit immediately, so that this node is still live
836 be_liveness_transfer(arch_env, cls, irn, live);
840 void be_liveness_nodes_live_at_input(const be_lv_t *lv,
841 const arch_env_t *arch_env,
842 const arch_register_class_t *cls,
843 const ir_node *pos, ir_nodeset_t *live)
845 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
848 assert(lv->nodes && "live sets must be computed");
849 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
850 sched_foreach_reverse(bl, irn) {
851 be_liveness_transfer(arch_env, cls, irn, live);
857 static void collect_node(ir_node *irn, void *data)
859 struct obstack *obst = data;
860 obstack_ptr_grow(obst, irn);
863 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
865 ir_graph *irg = lv->irg;
874 irg_block_walk_graph(irg, collect_node, NULL, &obst);
875 obstack_ptr_grow(&obst, NULL);
876 blocks = obstack_finish(&obst);
878 irg_walk_graph(irg, collect_node, NULL, &obst);
879 obstack_ptr_grow(&obst, NULL);
880 nodes = obstack_finish(&obst);
882 for (i = 0; blocks[i]; ++i) {
883 ir_node *bl = blocks[i];
885 for (j = 0; nodes[j]; ++j) {
886 ir_node *irn = nodes[j];
887 if (!is_Block(irn)) {
888 int lvr_in = be_is_live_in (lv, bl, irn);
889 int lvr_out = be_is_live_out(lv, bl, irn);
890 int lvr_end = be_is_live_end(lv, bl, irn);
892 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
893 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
894 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
896 if (lvr_in - lvc_in != 0)
897 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
899 if (lvr_end - lvc_end != 0)
900 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
902 if (lvr_out - lvc_out != 0)
903 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
909 obstack_free(&obst, NULL);
912 void be_init_live(void)
914 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
917 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);