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
29 /* statev is expensive here, only enable when needed */
30 #define DISABLE_STATEV
33 #include "iredges_t.h"
35 #include "irprintf_t.h"
38 #include "irnodeset.h"
47 #include "besched_t.h"
50 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
52 /* see comment in compute_liveness() */
53 #define LV_COMPUTE_SORTED
54 #define LV_STD_SIZE 64
55 #define LV_USE_BINARY_SEARCH
56 #undef LV_INTESIVE_CHECKS
58 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc);
60 static INLINE int is_liveness_node(const ir_node *irn)
62 switch(get_irn_opcode(irn)) {
75 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
77 return _be_lv_next_irn(lv, bl, flags, i);
80 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
82 return _be_lv_get_irn(lv, bl, i);
85 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
87 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
90 int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
92 return _be_is_live_xxx(lv, block, irn, be_lv_state_out);
95 int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
97 return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
101 #ifdef LV_USE_BINARY_SEARCH
102 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
104 struct _be_lv_info_t *payload = arr + 1;
106 unsigned n = arr[0].u.head.n_members;
115 int md = lo + ((hi - lo) >> 1);
116 unsigned md_idx = payload[md].u.node.idx;
120 else if(idx < md_idx)
124 assert(payload[res].u.node.idx == idx);
131 #ifdef LV_INTESIVE_CHECKS
134 for(i = res; i < n; ++i)
135 assert(payload[i].u.node.idx >= idx);
137 for(i = 0; i < res; ++i)
138 assert(payload[i].u.node.idx < idx);
148 * This function searches linearly for the node in the array.
150 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
151 unsigned n = arr[0].u.head.n_members;
154 for(i = 0; i < n; ++i) {
155 if(arr[i + 1].u.node.idx == idx)
163 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
165 struct _be_lv_info_t *irn_live;
166 struct _be_lv_info_node_t *res = NULL;
169 irn_live = phase_get_irn_data(&li->ph, bl);
171 unsigned idx = get_irn_idx(irn);
173 /* Get the position of the index in the array. */
174 int pos = _be_liveness_bsearch(irn_live, idx);
176 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
177 struct _be_lv_info_node_t *rec = &irn_live[pos + 1].u.node;
179 /* Check, if the irn is in deed in the array. */
183 stat_ev_tim_pop("be_lv_get");
188 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
190 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
192 unsigned idx = get_irn_idx(irn);
194 /* Get the position of the index in the array. */
195 unsigned pos = _be_liveness_bsearch(irn_live, idx);
197 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
198 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
200 /* Check, if the irn is in deed in the array. */
201 if(res->idx != idx) {
202 struct _be_lv_info_t *payload;
203 unsigned n_members = irn_live[0].u.head.n_members;
204 unsigned n_size = irn_live[0].u.head.n_size;
207 if(n_members + 1 >= n_size) {
208 /* double the array size. Remember that the first entry is
209 * metadata about the array and not a real array element */
210 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
211 unsigned new_size = (2 * n_size) + 1;
212 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
213 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
214 memcpy(nw, irn_live, old_size_bytes);
215 memset(((char*) nw) + old_size_bytes, 0,
216 new_size_bytes - old_size_bytes);
217 nw[0].u.head.n_size = new_size - 1;
219 phase_set_irn_data(&li->ph, bl, nw);
222 payload = &irn_live[1];
223 for(i = n_members; i > pos; --i) {
224 payload[i] = payload[i - 1];
227 ++irn_live[0].u.head.n_members;
229 res = &payload[pos].u.node;
234 #ifdef LV_INTESIVE_CHECKS
237 unsigned n = irn_live[0].u.head.n_members;
239 struct _be_lv_info_t *payload = &irn_live[1];
241 for(i = 0; i < n; ++i) {
242 assert(payload[i].u.node.idx >= last);
243 last = payload[i].u.node.idx;
252 * Removes a node from the list of live variables of a block.
253 * @return 1 if the node was live at that block, 0 if not.
255 static int be_lv_remove(struct _be_lv_t *li, const ir_node *bl,
258 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
261 unsigned n = irn_live[0].u.head.n_members;
262 unsigned idx = get_irn_idx(irn);
263 unsigned pos = _be_liveness_bsearch(irn_live, idx);
264 struct _be_lv_info_t *payload = irn_live + 1;
265 struct _be_lv_info_node_t *res = &payload[pos].u.node;
267 /* The node is in deed in the block's array. Let's remove it. */
268 if(res->idx == idx) {
271 for(i = pos + 1; i < n; ++i)
272 payload[i - 1] = payload[i];
274 payload[n - 1].u.node.idx = 0;
275 payload[n - 1].u.node.flags = 0;
277 --irn_live[0].u.head.n_members;
278 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
286 static void register_node(be_lv_t *lv, const ir_node *irn)
288 unsigned idx = get_irn_idx(irn);
289 if(idx >= bitset_size(lv->nodes)) {
290 bitset_t *nw = bitset_malloc(2 * idx);
291 bitset_copy(nw, lv->nodes);
292 bitset_free(lv->nodes);
296 bitset_set(lv->nodes, idx);
300 * Mark a node as live-in in a block.
302 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
304 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
305 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
306 n->flags |= be_lv_state_in;
307 register_node(lv, irn);
311 * Mark a node as live-out in a block.
313 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
315 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
316 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
317 n->flags |= be_lv_state_out | be_lv_state_end;
318 register_node(lv, irn);
322 * Mark a node as live-end in a block.
324 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
326 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
327 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
328 n->flags |= be_lv_state_end;
329 register_node(lv, irn);
333 * Mark a node (value) live out at a certain block. Do this also
334 * transitively, i.e. if the block is not the block of the value's
335 * definition, all predecessors are also marked live.
336 * @param def The node (value).
337 * @param block The block to mark the value live out of.
338 * @param visited A set were all visited blocks are recorded.
339 * @param is_true_out Is the node real out there or only live at the end
342 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
344 mark_live_end(lv, block, def);
346 mark_live_out(lv, block, def);
348 if(!bitset_contains_irn(visited, block)) {
349 bitset_add_irn(visited, block);
352 * If this block is not the definition block, we have to go up
355 if(get_nodes_block(def) != block) {
358 mark_live_in(lv, block, def);
360 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
361 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
367 struct _lv_walker_t {
372 typedef struct lv_remove_walker_t {
375 } lv_remove_walker_t;
379 * Liveness analysis for a value.
380 * This functions is meant to be called by a firm walker, to compute the
381 * set of all blocks a value is live in.
382 * @param irn The node (value).
383 * @param env Ignored.
385 static void liveness_for_node(ir_node *irn, void *data)
387 struct _lv_walker_t *walker = data;
388 be_lv_t *lv = walker->lv;
389 bitset_t *visited = walker->data;
390 const ir_edge_t *edge;
393 /* Don't compute liveness information for non-data nodes. */
394 if(!is_liveness_node(irn))
397 bitset_clear_all(visited);
398 def_block = get_nodes_block(irn);
400 /* Go over all uses of the value */
401 foreach_out_edge(irn, edge) {
402 ir_node *use = edge->src;
405 DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use)));
406 assert(get_irn_n(use, edge->pos) == irn);
409 * If the usage is no data node, skip this use, since it does not
410 * affect the liveness of the node.
412 if(!is_liveness_node(use))
415 /* Get the block where the usage is in. */
416 use_block = get_nodes_block(use);
419 * If the use is a phi function, determine the corresponding block
420 * through which the value reaches the phi function and mark the
421 * value as live out of that block.
424 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
425 live_end_at_block(lv, irn, pred_block, visited, 0);
429 * Else, the value is live in at this block. Mark it and call live
430 * out on the predecessors.
432 else if(def_block != use_block) {
435 mark_live_in(lv, use_block, irn);
437 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
438 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
439 live_end_at_block(lv, irn, pred_block, visited, 1);
445 static void lv_remove_irn_walker(ir_node *bl, void *data)
447 lv_remove_walker_t *w = data;
448 be_lv_remove(w->lv, bl, w->irn);
451 static const char *lv_flags_to_str(unsigned flags)
453 static const char *states[] = {
464 return states[flags & 7];
467 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
470 be_lv_t *lv = context;
471 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
473 fprintf(f, "liveness:\n");
475 unsigned n = info[0].u.head.n_members;
478 for(i = 0; i < n; ++i) {
479 struct _be_lv_info_node_t *n = &info[i+1].u.node;
480 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
486 static void *lv_phase_data_init(ir_phase *phase, const ir_node *irn, void *old)
488 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
492 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
493 info[0].u.head.n_size = LV_STD_SIZE - 1;
497 static void collect_nodes(ir_node *irn, void *data)
499 struct obstack *obst = data;
500 if (is_liveness_node(irn))
501 obstack_ptr_grow(obst, irn);
504 static int node_idx_cmp(const void *a, const void *b)
506 const ir_node *p = *(ir_node **) a;
507 const ir_node *q = *(ir_node **) b;
508 int ia = get_irn_idx(p);
509 int ib = get_irn_idx(q);
513 static void compute_liveness(be_lv_t *lv)
516 struct _lv_walker_t w;
522 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
523 n = obstack_object_size(&obst) / sizeof(nodes[0]);
524 nodes = obstack_finish(&obst);
527 * inserting the variables sorted by their ID is probably
528 * more efficient since the binary sorted set insertion
529 * will not need to move around the data.
530 * However, if sorting the variables a priori pays off
531 * needs to be checked, hence the define.
533 #ifdef LV_COMPUTE_SORTED
534 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
538 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
540 for (i = 0; i < n; ++i)
541 liveness_for_node(nodes[i], &w);
543 obstack_free(&obst, NULL);
544 register_hook(hook_node_info, &lv->hook_info);
545 stat_ev_tim_pop("be_lv_sets_cons");
548 void be_liveness_assure_sets(be_lv_t *lv)
551 BE_TIMER_PUSH(t_live);
553 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
554 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
555 compute_liveness(lv);
556 /* be_live_chk_compare(lv, lv->lvc); */
558 BE_TIMER_POP(t_live);
562 void be_liveness_assure_chk(be_lv_t *lv)
565 BE_TIMER_PUSH(t_verify);
566 be_liveness_assure_sets(lv);
567 BE_TIMER_POP(t_verify);
573 void be_liveness_invalidate(be_lv_t *lv)
575 if (lv && lv->nodes) {
576 unregister_hook(hook_node_info, &lv->hook_info);
578 bitset_free(lv->nodes);
583 /* Compute the inter block liveness for a graph. */
584 be_lv_t *be_liveness(const be_irg_t *birg)
586 be_lv_t *lv = XMALLOCZ(be_lv_t);
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);
624 lv_chk_free(lv->lvc);
630 void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
633 unsigned idx = get_irn_idx(irn);
634 lv_remove_walker_t w;
637 * Removes a single irn from the liveness information.
638 * Since an irn can only be live at blocks dominated by the block of its
639 * definition, we only have to process that dominance subtree.
643 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
644 if(idx < bitset_size(lv->nodes))
645 bitset_clear(lv->nodes, idx);
649 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
652 struct _lv_walker_t w;
654 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
655 liveness_for_node(irn, &w);
660 void be_liveness_update(be_lv_t *lv, ir_node *irn)
662 be_liveness_remove(lv, irn);
663 be_liveness_introduce(lv, irn);
666 static void lv_check_walker(ir_node *bl, void *data)
668 struct _lv_walker_t *w = data;
670 be_lv_t *fresh = w->data;
672 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
673 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
675 if(!fr && curr && curr[0].u.head.n_members > 0) {
678 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
679 for(i = 0; i < curr[0].u.head.n_members; ++i) {
680 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
685 unsigned n_curr = curr[0].u.head.n_members;
686 unsigned n_fresh = fr[0].u.head.n_members;
690 if(n_curr != n_fresh) {
691 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
693 ir_fprintf(stderr, "current:\n");
694 for(i = 0; i < n_curr; ++i) {
695 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
696 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
699 ir_fprintf(stderr, "correct:\n");
700 for(i = 0; i < n_fresh; ++i) {
701 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
702 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
708 void be_liveness_check(be_lv_t *lv)
710 struct _lv_walker_t w;
711 be_lv_t *fresh = be_liveness(lv->birg);
715 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
716 be_liveness_free(fresh);
720 static void lv_dump_block_walker(ir_node *irn, void *data)
722 struct _lv_walker_t *w = data;
724 lv_dump_block(w->lv, w->data, irn);
728 /* Dump the liveness information for a graph. */
729 void be_liveness_dump(const be_lv_t *lv, FILE *f)
731 struct _lv_walker_t w;
733 w.lv = (be_lv_t *) lv;
735 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
738 /* Dump the liveness information for a graph. */
739 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
743 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
744 if((f = fopen(buf, "wt")) != NULL) {
745 be_liveness_dump(lv, f);
751 * Walker: checks the every predecessors of a node dominate
754 static void dom_check(ir_node *irn, void *data)
756 int *problem_found = data;
758 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
760 ir_node *bl = get_nodes_block(irn);
762 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
763 ir_node *op = get_irn_n(irn, i);
764 ir_node *def_bl = get_nodes_block(op);
765 ir_node *use_bl = bl;
768 use_bl = get_Block_cfgpred_block(bl, i);
770 if(get_irn_opcode(use_bl) != iro_Bad
771 && get_irn_opcode(def_bl) != iro_Bad
772 && !block_dominates(def_bl, use_bl)) {
773 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)));
780 /* Check, if the SSA dominance property is fulfilled. */
781 int be_check_dominance(ir_graph *irg)
783 int problem_found = 0;
786 irg_walk_graph(irg, dom_check, NULL, &problem_found);
788 return !problem_found;
791 void be_liveness_transfer(const arch_register_class_t *cls,
792 ir_node *node, ir_nodeset_t *nodeset)
796 /* You should better break out of your loop when hitting the first phi
798 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
800 if (get_irn_mode(node) == mode_T) {
801 const ir_edge_t *edge;
803 foreach_out_edge(node, edge) {
804 ir_node *proj = get_edge_src_irn(edge);
806 if (arch_irn_consider_in_reg_alloc(cls, proj)) {
807 ir_nodeset_remove(nodeset, proj);
810 } else if (arch_irn_consider_in_reg_alloc(cls, node)) {
811 ir_nodeset_remove(nodeset, node);
814 arity = get_irn_arity(node);
815 for (i = 0; i < arity; ++i) {
816 ir_node *op = get_irn_n(node, i);
818 if (arch_irn_consider_in_reg_alloc(cls, op))
819 ir_nodeset_insert(nodeset, op);
825 void be_liveness_end_of_block(const be_lv_t *lv,
826 const arch_register_class_t *cls,
827 const ir_node *block, ir_nodeset_t *live)
831 assert(lv->nodes && "live sets must be computed");
832 be_lv_foreach(lv, block, be_lv_state_end, i) {
833 ir_node *node = be_lv_get_irn(lv, block, i);
834 if (!arch_irn_consider_in_reg_alloc(cls, node))
837 ir_nodeset_insert(live, node);
843 void be_liveness_nodes_live_at(const be_lv_t *lv,
844 const arch_register_class_t *cls,
845 const ir_node *pos, ir_nodeset_t *live)
847 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
850 be_liveness_end_of_block(lv, cls, bl, live);
851 sched_foreach_reverse(bl, irn) {
853 * If we encounter the node we want to insert the Perm after,
854 * exit immediately, so that this node is still live
859 be_liveness_transfer(cls, irn, live);
863 static void collect_node(ir_node *irn, void *data)
865 struct obstack *obst = data;
866 obstack_ptr_grow(obst, irn);
869 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
871 ir_graph *irg = lv->irg;
880 irg_block_walk_graph(irg, collect_node, NULL, &obst);
881 obstack_ptr_grow(&obst, NULL);
882 blocks = obstack_finish(&obst);
884 irg_walk_graph(irg, collect_node, NULL, &obst);
885 obstack_ptr_grow(&obst, NULL);
886 nodes = obstack_finish(&obst);
888 stat_ev_ctx_push("be_lv_chk_compare");
889 for (j = 0; nodes[j]; ++j) {
890 ir_node *irn = nodes[j];
891 for (i = 0; blocks[i]; ++i) {
892 ir_node *bl = blocks[i];
894 if (!is_Block(irn)) {
895 int lvr_in = be_is_live_in (lv, bl, irn);
896 int lvr_out = be_is_live_out(lv, bl, irn);
897 int lvr_end = be_is_live_end(lv, bl, irn);
899 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
900 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
901 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
903 if (lvr_in - lvc_in != 0)
904 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
906 if (lvr_end - lvc_end != 0)
907 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
909 if (lvr_out - lvc_out != 0)
910 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
914 stat_ev_ctx_pop("be_lv_chk_compare");
916 obstack_free(&obst, NULL);
919 void be_init_live(void)
921 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
924 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);