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"
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)) {
73 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
75 return _be_lv_next_irn(lv, bl, flags, i);
78 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
80 return _be_lv_get_irn(lv, bl, i);
83 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
85 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
88 int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
90 return _be_is_live_xxx(lv, block, irn, be_lv_state_out);
93 int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
95 return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
99 #ifdef LV_USE_BINARY_SEARCH
100 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
102 struct _be_lv_info_t *payload = arr + 1;
104 unsigned n = arr[0].u.head.n_members;
113 int md = lo + ((hi - lo) >> 1);
114 unsigned md_idx = payload[md].u.node.idx;
118 else if(idx < md_idx)
122 assert(payload[res].u.node.idx == idx);
129 #ifdef LV_INTESIVE_CHECKS
132 for(i = res; i < n; ++i)
133 assert(payload[i].u.node.idx >= idx);
135 for(i = 0; i < res; ++i)
136 assert(payload[i].u.node.idx < idx);
146 * This function searches linearly for the node in the array.
148 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
149 unsigned n = arr[0].u.head.n_members;
152 for(i = 0; i < n; ++i) {
153 if(arr[i + 1].u.node.idx == idx)
161 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
163 struct _be_lv_info_t *irn_live;
164 struct _be_lv_info_node_t *res = NULL;
167 irn_live = phase_get_irn_data(&li->ph, bl);
169 unsigned idx = get_irn_idx(irn);
171 /* Get the position of the index in the array. */
172 int pos = _be_liveness_bsearch(irn_live, idx);
174 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
175 struct _be_lv_info_node_t *rec = &irn_live[pos + 1].u.node;
177 /* Check, if the irn is in deed in the array. */
181 stat_ev_tim_pop("be_lv_get");
186 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
188 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
190 unsigned idx = get_irn_idx(irn);
192 /* Get the position of the index in the array. */
193 unsigned pos = _be_liveness_bsearch(irn_live, idx);
195 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
196 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
198 /* Check, if the irn is in deed in the array. */
199 if(res->idx != idx) {
200 struct _be_lv_info_t *payload;
201 unsigned n_members = irn_live[0].u.head.n_members;
202 unsigned n_size = irn_live[0].u.head.n_size;
205 if(n_members + 1 >= n_size) {
206 /* double the array size. Remember that the first entry is
207 * metadata about the array and not a real array element */
208 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
209 unsigned new_size = (2 * n_size) + 1;
210 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
211 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
212 memcpy(nw, irn_live, old_size_bytes);
213 memset(((char*) nw) + old_size_bytes, 0,
214 new_size_bytes - old_size_bytes);
215 nw[0].u.head.n_size = new_size - 1;
217 phase_set_irn_data(&li->ph, bl, nw);
220 payload = &irn_live[1];
221 for(i = n_members; i > pos; --i) {
222 payload[i] = payload[i - 1];
225 ++irn_live[0].u.head.n_members;
227 res = &payload[pos].u.node;
232 #ifdef LV_INTESIVE_CHECKS
235 unsigned n = irn_live[0].u.head.n_members;
237 struct _be_lv_info_t *payload = &irn_live[1];
239 for(i = 0; i < n; ++i) {
240 assert(payload[i].u.node.idx >= last);
241 last = payload[i].u.node.idx;
250 * Removes a node from the list of live variables of a block.
251 * @return 1 if the node was live at that block, 0 if not.
253 static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
255 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
258 unsigned n = irn_live[0].u.head.n_members;
259 unsigned idx = get_irn_idx(irn);
260 unsigned pos = _be_liveness_bsearch(irn_live, idx);
261 struct _be_lv_info_t *payload = irn_live + 1;
262 struct _be_lv_info_node_t *res = &payload[pos].u.node;
264 /* The node is in deed in the block's array. Let's remove it. */
265 if(res->idx == idx) {
268 for(i = pos + 1; i < n; ++i)
269 payload[i - 1] = payload[i];
271 payload[n - 1].u.node.idx = 0;
272 payload[n - 1].u.node.flags = 0;
274 --irn_live[0].u.head.n_members;
275 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
283 static void register_node(be_lv_t *lv, const ir_node *irn)
285 unsigned idx = get_irn_idx(irn);
286 if(idx >= bitset_size(lv->nodes)) {
287 bitset_t *nw = bitset_malloc(2 * idx);
288 bitset_copy(nw, lv->nodes);
289 bitset_free(lv->nodes);
293 bitset_set(lv->nodes, idx);
297 * Mark a node as live-in in a block.
299 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
301 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
302 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
303 n->flags |= be_lv_state_in;
304 register_node(lv, irn);
308 * Mark a node as live-out in a block.
310 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
312 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
313 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
314 n->flags |= be_lv_state_out | be_lv_state_end;
315 register_node(lv, irn);
319 * Mark a node as live-end in a block.
321 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
323 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
324 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
325 n->flags |= be_lv_state_end;
326 register_node(lv, irn);
330 * Mark a node (value) live out at a certain block. Do this also
331 * transitively, i.e. if the block is not the block of the value's
332 * definition, all predecessors are also marked live.
333 * @param def The node (value).
334 * @param block The block to mark the value live out of.
335 * @param visited A set were all visited blocks are recorded.
336 * @param is_true_out Is the node real out there or only live at the end
339 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
341 mark_live_end(lv, block, def);
343 mark_live_out(lv, block, def);
345 if(!bitset_contains_irn(visited, block)) {
346 bitset_add_irn(visited, block);
349 * If this block is not the definition block, we have to go up
352 if(get_nodes_block(def) != block) {
355 mark_live_in(lv, block, def);
357 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
358 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
364 struct _lv_walker_t {
370 * Liveness analysis for a value.
371 * This functions is meant to be called by a firm walker, to compute the
372 * set of all blocks a value is live in.
373 * @param irn The node (value).
374 * @param env Ignored.
376 static void liveness_for_node(ir_node *irn, void *data)
378 struct _lv_walker_t *walker = data;
379 be_lv_t *lv = walker->lv;
380 bitset_t *visited = walker->data;
381 const ir_edge_t *edge;
384 /* Don't compute liveness information for non-data nodes. */
385 if(!is_liveness_node(irn))
388 bitset_clear_all(visited);
389 def_block = get_nodes_block(irn);
391 /* Go over all uses of the value */
392 foreach_out_edge(irn, edge) {
393 ir_node *use = edge->src;
396 DBG((dbg, LEVEL_4, "%+F: use at %+F, pos %d in %+F\n", irn, use, edge->pos, get_block(use)));
397 assert(get_irn_n(use, edge->pos) == irn);
400 * If the usage is no data node, skip this use, since it does not
401 * affect the liveness of the node.
403 if(!is_liveness_node(use))
406 /* Get the block where the usage is in. */
407 use_block = get_nodes_block(use);
410 * If the use is a phi function, determine the corresponding block
411 * through which the value reaches the phi function and mark the
412 * value as live out of that block.
415 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
416 live_end_at_block(lv, irn, pred_block, visited, 0);
420 * Else, the value is live in at this block. Mark it and call live
421 * out on the predecessors.
423 else if(def_block != use_block) {
426 mark_live_in(lv, use_block, irn);
428 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
429 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
430 live_end_at_block(lv, irn, pred_block, visited, 1);
436 static void lv_remove_irn_walker(ir_node *bl, void *data)
438 struct _lv_walker_t *w = data;
440 ir_node *irn = w->data;
441 be_lv_remove(lv, bl, irn);
444 static const char *lv_flags_to_str(unsigned flags)
446 static const char *states[] = {
457 return states[flags & 7];
460 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
463 be_lv_t *lv = context;
464 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
466 fprintf(f, "liveness:\n");
468 unsigned n = info[0].u.head.n_members;
471 for(i = 0; i < n; ++i) {
472 struct _be_lv_info_node_t *n = &info[i+1].u.node;
473 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
479 static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old)
481 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
485 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
486 info[0].u.head.n_size = LV_STD_SIZE - 1;
490 static void collect_nodes(ir_node *irn, void *data)
492 struct obstack *obst = data;
493 if (is_liveness_node(irn))
494 obstack_ptr_grow(obst, irn);
497 static int node_idx_cmp(const void *a, const void *b)
499 const ir_node *p = *(ir_node **) a;
500 const ir_node *q = *(ir_node **) b;
501 int ia = get_irn_idx(p);
502 int ib = get_irn_idx(q);
506 static void compute_liveness(be_lv_t *lv)
509 struct _lv_walker_t w;
515 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
516 n = obstack_object_size(&obst) / sizeof(nodes[0]);
517 nodes = obstack_finish(&obst);
520 * inserting the variables sorted by their ID is probably
521 * more efficient since the binary sorted set insertion
522 * will not need to move arounf the data.
523 * However, if sorting the variables a priori pays off
524 * needs to be checked, hence the define.
526 #ifdef LV_COMPUTE_SORTED
527 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
531 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
533 for (i = 0; i < n; ++i)
534 liveness_for_node(nodes[i], &w);
536 obstack_free(&obst, NULL);
537 register_hook(hook_node_info, &lv->hook_info);
538 stat_ev_tim_pop("be_lv_sets_cons");
541 void be_liveness_assure_sets(be_lv_t *lv)
544 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
545 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
546 compute_liveness(lv);
547 /* be_live_chk_compare(lv, lv->lvc); */
551 void be_liveness_assure_chk(be_lv_t *lv)
554 be_liveness_assure_sets(lv);
560 void be_liveness_invalidate(be_lv_t *lv)
562 if (lv && lv->nodes) {
563 unregister_hook(hook_node_info, &lv->hook_info);
565 bitset_free(lv->nodes);
570 /* Compute the inter block liveness for a graph. */
571 be_lv_t *be_liveness(const be_irg_t *birg)
573 be_lv_t *lv = xmalloc(sizeof(lv[0]));
575 memset(lv, 0, sizeof(lv[0]));
576 lv->irg = be_get_birg_irg(birg);
579 lv->dfs = dfs_new(&absgraph_irg_cfg_succ, lv->irg);
580 lv->lvc = lv_chk_new(lv->irg, lv->dfs);
582 lv->hook_info.context = lv;
583 lv->hook_info.hook._hook_node_info = lv_dump_block;
588 void be_liveness_recompute(be_lv_t *lv)
590 unsigned last_idx = get_irg_last_idx(lv->irg);
591 if(last_idx >= bitset_size(lv->nodes)) {
592 bitset_free(lv->nodes);
593 lv->nodes = bitset_malloc(last_idx * 2);
597 bitset_clear_all(lv->nodes);
600 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
601 compute_liveness(lv);
605 void be_liveness_free(be_lv_t *lv)
607 be_liveness_invalidate(lv);
611 void be_liveness_remove(be_lv_t *lv, ir_node *irn)
614 unsigned idx = get_irn_idx(irn);
615 struct _lv_walker_t w;
618 * Removes a single irn from the liveness information.
619 * Since an irn can only be live at blocks dominated by the block of its
620 * definition, we only have to process that dominance subtree.
624 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
625 if(idx < bitset_size(lv->nodes))
626 bitset_clear(lv->nodes, idx);
630 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
633 struct _lv_walker_t w;
635 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
636 liveness_for_node(irn, &w);
641 void be_liveness_update(be_lv_t *lv, ir_node *irn)
643 be_liveness_remove(lv, irn);
644 be_liveness_introduce(lv, irn);
647 static void lv_check_walker(ir_node *bl, void *data)
649 struct _lv_walker_t *w = data;
651 be_lv_t *fresh = w->data;
653 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
654 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
656 if(!fr && curr && curr[0].u.head.n_members > 0) {
659 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
660 for(i = 0; i < curr[0].u.head.n_members; ++i) {
661 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
666 unsigned n_curr = curr[0].u.head.n_members;
667 unsigned n_fresh = fr[0].u.head.n_members;
671 if(n_curr != n_fresh) {
672 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
674 ir_fprintf(stderr, "current:\n");
675 for(i = 0; i < n_curr; ++i) {
676 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
677 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
680 ir_fprintf(stderr, "correct:\n");
681 for(i = 0; i < n_fresh; ++i) {
682 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
683 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
689 void be_liveness_check(be_lv_t *lv)
691 struct _lv_walker_t w;
692 be_lv_t *fresh = be_liveness(lv->birg);
696 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
697 be_liveness_free(fresh);
701 static void lv_dump_block_walker(ir_node *irn, void *data)
703 struct _lv_walker_t *w = data;
705 lv_dump_block(w->lv, w->data, irn);
709 /* Dump the liveness information for a graph. */
710 void be_liveness_dump(const be_lv_t *lv, FILE *f)
712 struct _lv_walker_t w;
714 w.lv = (be_lv_t *) lv;
716 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
719 /* Dump the liveness information for a graph. */
720 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
724 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
725 if((f = fopen(buf, "wt")) != NULL) {
726 be_liveness_dump(lv, f);
732 * Walker: checks the every predecessors of a node dominate
735 static void dom_check(ir_node *irn, void *data)
737 int *problem_found = data;
739 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
741 ir_node *bl = get_nodes_block(irn);
743 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
744 ir_node *op = get_irn_n(irn, i);
745 ir_node *def_bl = get_nodes_block(op);
746 ir_node *use_bl = bl;
749 use_bl = get_Block_cfgpred_block(bl, i);
751 if(get_irn_opcode(use_bl) != iro_Bad
752 && get_irn_opcode(def_bl) != iro_Bad
753 && !block_dominates(def_bl, use_bl)) {
754 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)));
761 /* Check, if the SSA dominance property is fulfilled. */
762 int be_check_dominance(ir_graph *irg)
764 int problem_found = 0;
767 irg_walk_graph(irg, dom_check, NULL, &problem_found);
769 return !problem_found;
772 void be_liveness_transfer(const arch_env_t *arch_env,
773 const arch_register_class_t *cls,
774 ir_node *node, ir_nodeset_t *nodeset)
778 /* You should better break out of your loop when hitting the first phi
780 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
782 if (get_irn_mode(node) == mode_T) {
783 const ir_edge_t *edge;
785 foreach_out_edge(node, edge) {
786 ir_node *proj = get_edge_src_irn(edge);
788 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
789 ir_nodeset_remove(nodeset, proj);
794 if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
795 ir_nodeset_remove(nodeset, node);
798 arity = get_irn_arity(node);
799 for (i = 0; i < arity; ++i) {
800 ir_node *op = get_irn_n(node, i);
802 if (arch_irn_consider_in_reg_alloc(arch_env, cls, op))
803 ir_nodeset_insert(nodeset, op);
809 void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env,
810 const arch_register_class_t *cls,
811 const ir_node *block, ir_nodeset_t *live)
815 assert(lv->nodes && "live sets must be computed");
816 be_lv_foreach(lv, block, be_lv_state_end, i) {
817 ir_node *node = be_lv_get_irn(lv, block, i);
818 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
821 ir_nodeset_insert(live, node);
827 void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env,
828 const arch_register_class_t *cls,
829 const ir_node *pos, ir_nodeset_t *live)
831 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
834 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
835 sched_foreach_reverse(bl, irn) {
837 * If we encounter the node we want to insert the Perm after,
838 * exit immediately, so that this node is still live
843 be_liveness_transfer(arch_env, cls, irn, live);
847 void be_liveness_nodes_live_at_input(const be_lv_t *lv,
848 const arch_env_t *arch_env,
849 const arch_register_class_t *cls,
850 const ir_node *pos, ir_nodeset_t *live)
852 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
855 assert(lv->nodes && "live sets must be computed");
856 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
857 sched_foreach_reverse(bl, irn) {
858 be_liveness_transfer(arch_env, cls, irn, live);
864 static void collect_node(ir_node *irn, void *data)
866 struct obstack *obst = data;
867 obstack_ptr_grow(obst, irn);
870 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
872 ir_graph *irg = lv->irg;
881 irg_block_walk_graph(irg, collect_node, NULL, &obst);
882 obstack_ptr_grow(&obst, NULL);
883 blocks = obstack_finish(&obst);
885 irg_walk_graph(irg, collect_node, NULL, &obst);
886 obstack_ptr_grow(&obst, NULL);
887 nodes = obstack_finish(&obst);
889 stat_ev_ctx_push("be_lv_chk_compare");
890 for (j = 0; nodes[j]; ++j) {
891 ir_node *irn = nodes[j];
892 for (i = 0; blocks[i]; ++i) {
893 ir_node *bl = blocks[i];
895 if (!is_Block(irn)) {
896 int lvr_in = be_is_live_in (lv, bl, irn);
897 int lvr_out = be_is_live_out(lv, bl, irn);
898 int lvr_end = be_is_live_end(lv, bl, irn);
900 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
901 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
902 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
904 if (lvr_in - lvc_in != 0)
905 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
907 if (lvr_end - lvc_end != 0)
908 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
910 if (lvr_out - lvc_out != 0)
911 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
915 stat_ev_ctx_pop("be_lv_chk_compare");
917 obstack_free(&obst, NULL);
920 void be_init_live(void)
922 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
925 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);