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"
42 #include "besched_t.h"
45 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
47 /* see comment in compute_liveness() */
48 #define LV_COMPUTE_SORTED
49 #define LV_STD_SIZE 64
50 #define LV_USE_BINARY_SEARCH
51 #undef LV_INTESIVE_CHECKS
53 static INLINE int is_liveness_node(const ir_node *irn)
55 switch(get_irn_opcode(irn)) {
67 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
69 return _be_lv_next_irn(lv, bl, flags, i);
72 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
74 return _be_lv_get_irn(lv, bl, i);
77 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
79 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
82 int (be_is_live_out)(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_out);
87 int (be_is_live_end)(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_end);
93 #ifdef LV_USE_BINARY_SEARCH
94 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
96 struct _be_lv_info_t *payload = arr + 1;
98 unsigned n = arr[0].u.head.n_members;
107 int md = lo + ((hi - lo) >> 1);
108 unsigned md_idx = payload[md].u.node.idx;
112 else if(idx < md_idx)
116 assert(payload[res].u.node.idx == idx);
123 #ifdef LV_INTESIVE_CHECKS
126 for(i = res; i < n; ++i)
127 assert(payload[i].u.node.idx >= idx);
129 for(i = 0; i < res; ++i)
130 assert(payload[i].u.node.idx < idx);
140 * This function searches linearly for the node in the array.
142 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx) {
143 unsigned n = arr[0].u.head.n_members;
146 for(i = 0; i < n; ++i) {
147 if(arr[i + 1].u.node.idx == idx)
155 struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn)
157 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
160 unsigned idx = get_irn_idx(irn);
162 /* Get the position of the index in the array. */
163 int pos = _be_liveness_bsearch(irn_live, idx);
165 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
166 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
168 /* Check, if the irn is in deed in the array. */
176 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
178 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
180 unsigned idx = get_irn_idx(irn);
182 /* Get the position of the index in the array. */
183 unsigned pos = _be_liveness_bsearch(irn_live, idx);
185 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
186 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
188 /* Check, if the irn is in deed in the array. */
189 if(res->idx != idx) {
190 struct _be_lv_info_t *payload;
191 unsigned n_members = irn_live[0].u.head.n_members;
192 unsigned n_size = irn_live[0].u.head.n_size;
195 if(n_members + 1 >= n_size) {
196 /* double the array size. Remember that the first entry is
197 * metadata about the array and not a real array element */
198 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
199 unsigned new_size = (2 * n_size) + 1;
200 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
201 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
202 memcpy(nw, irn_live, old_size_bytes);
203 memset(((char*) nw) + old_size_bytes, 0,
204 new_size_bytes - old_size_bytes);
205 nw[0].u.head.n_size = new_size - 1;
207 phase_set_irn_data(&li->ph, bl, nw);
210 payload = &irn_live[1];
211 for(i = n_members; i > pos; --i) {
212 payload[i] = payload[i - 1];
215 ++irn_live[0].u.head.n_members;
217 res = &payload[pos].u.node;
222 #ifdef LV_INTESIVE_CHECKS
225 unsigned n = irn_live[0].u.head.n_members;
227 struct _be_lv_info_t *payload = &irn_live[1];
229 for(i = 0; i < n; ++i) {
230 assert(payload[i].u.node.idx >= last);
231 last = payload[i].u.node.idx;
240 * Removes a node from the list of live variables of a block.
241 * @return 1 if the node was live at that block, 0 if not.
243 static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
245 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
248 unsigned n = irn_live[0].u.head.n_members;
249 unsigned idx = get_irn_idx(irn);
250 unsigned pos = _be_liveness_bsearch(irn_live, idx);
251 struct _be_lv_info_t *payload = irn_live + 1;
252 struct _be_lv_info_node_t *res = &payload[pos].u.node;
254 /* The node is in deed in the block's array. Let's remove it. */
255 if(res->idx == idx) {
258 for(i = pos + 1; i < n; ++i)
259 payload[i - 1] = payload[i];
261 payload[n - 1].u.node.idx = 0;
262 payload[n - 1].u.node.flags = 0;
264 --irn_live[0].u.head.n_members;
265 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
273 static void register_node(be_lv_t *lv, const ir_node *irn)
275 unsigned idx = get_irn_idx(irn);
276 if(idx >= bitset_size(lv->nodes)) {
277 bitset_t *nw = bitset_malloc(2 * idx);
278 bitset_copy(nw, lv->nodes);
279 bitset_free(lv->nodes);
283 bitset_set(lv->nodes, idx);
287 * Mark a node as live-in in a block.
289 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
291 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
292 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
293 n->flags |= be_lv_state_in;
294 register_node(lv, irn);
298 * Mark a node as live-out in a block.
300 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
302 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
303 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
304 n->flags |= be_lv_state_out | be_lv_state_end;
305 register_node(lv, irn);
309 * Mark a node as live-end in a block.
311 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
313 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
314 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
315 n->flags |= be_lv_state_end;
316 register_node(lv, irn);
320 * Mark a node (value) live out at a certain block. Do this also
321 * transitively, i.e. if the block is not the block of the value's
322 * definition, all predecessors are also marked live.
323 * @param def The node (value).
324 * @param block The block to mark the value live out of.
325 * @param visited A set were all visited blocks are recorded.
326 * @param is_true_out Is the node real out there or only live at the end
329 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
331 mark_live_end(lv, block, def);
333 mark_live_out(lv, block, def);
335 if(!bitset_contains_irn(visited, block)) {
336 bitset_add_irn(visited, block);
339 * If this block is not the definition block, we have to go up
342 if(get_nodes_block(def) != block) {
345 mark_live_in(lv, block, def);
347 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
348 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
354 struct _lv_walker_t {
360 * Liveness analysis for a value.
361 * This functions is meant to be called by a firm walker, to compute the
362 * set of all blocks a value is live in.
363 * @param irn The node (value).
364 * @param env Ignored.
366 static void liveness_for_node(ir_node *irn, void *data)
368 struct _lv_walker_t *walker = data;
369 be_lv_t *lv = walker->lv;
370 bitset_t *visited = walker->data;
371 const ir_edge_t *edge;
374 /* Don't compute liveness information for non-data nodes. */
375 if(!is_liveness_node(irn))
378 bitset_clear_all(visited);
379 def_block = get_nodes_block(irn);
381 /* Go over all uses of the value */
382 foreach_out_edge(irn, edge) {
383 ir_node *use = edge->src;
387 * If the usage is no data node, skip this use, since it does not
388 * affect the liveness of the node.
390 if(!is_liveness_node(use))
393 /* Get the block where the usage is in. */
394 use_block = get_nodes_block(use);
397 * If the use is a phi function, determine the corresponding block
398 * through which the value reaches the phi function and mark the
399 * value as live out of that block.
402 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
403 live_end_at_block(lv, irn, pred_block, visited, 0);
407 * Else, the value is live in at this block. Mark it and call live
408 * out on the predecessors.
410 else if(def_block != use_block) {
413 mark_live_in(lv, use_block, irn);
415 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
416 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
417 live_end_at_block(lv, irn, pred_block, visited, 1);
423 static void lv_remove_irn_walker(ir_node *bl, void *data)
425 struct _lv_walker_t *w = data;
427 ir_node *irn = w->data;
428 be_lv_remove(lv, bl, irn);
431 static const char *lv_flags_to_str(unsigned flags)
433 static const char *states[] = {
444 return states[flags & 7];
447 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
450 be_lv_t *lv = context;
451 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
453 fprintf(f, "liveness:\n");
455 unsigned n = info[0].u.head.n_members;
458 for(i = 0; i < n; ++i) {
459 struct _be_lv_info_node_t *n = &info[i+1].u.node;
460 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
466 static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old)
468 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
472 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
473 info[0].u.head.n_size = LV_STD_SIZE - 1;
477 static void collect_nodes(ir_node *irn, void *data)
479 struct obstack *obst = data;
480 if (is_liveness_node(irn))
481 obstack_ptr_grow(obst, irn);
484 static int node_idx_cmp(const void *a, const void *b)
486 const ir_node *p = *(ir_node **) a;
487 const ir_node *q = *(ir_node **) b;
488 int ia = get_irn_idx(p);
489 int ib = get_irn_idx(q);
493 static void compute_liveness(be_lv_t *lv)
496 struct _lv_walker_t w;
501 irg_walk_graph(lv->irg, collect_nodes, NULL, &obst);
502 n = obstack_object_size(&obst) / sizeof(nodes[0]);
503 nodes = obstack_finish(&obst);
506 * inserting the variables sorted by their ID is probably
507 * more efficient since the binary sorted set insertion
508 * will not need to move arounf the data.
509 * However, if sorting the variables a priori pays off
510 * needs to be checked, hence the define.
512 #ifdef LV_COMPUTE_SORTED
513 qsort(nodes, n, sizeof(nodes[0]), node_idx_cmp);
517 w.data = bitset_obstack_alloc(&obst, get_irg_last_idx(lv->irg));
519 for (i = 0; i < n; ++i)
520 liveness_for_node(nodes[i], &w);
522 obstack_free(&obst, NULL);
523 register_hook(hook_node_info, &lv->hook_info);
526 void be_liveness_assure_sets(be_lv_t *lv)
529 lv->nodes = bitset_malloc(2 * get_irg_last_idx(lv->irg));
530 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
531 compute_liveness(lv);
535 void be_liveness_assure_chk(be_lv_t *lv)
538 be_liveness_assure_sets(lv);
544 void be_liveness_invalidate(be_lv_t *lv)
546 if (lv && lv->nodes) {
547 unregister_hook(hook_node_info, &lv->hook_info);
549 bitset_free(lv->nodes);
554 /* Compute the inter block liveness for a graph. */
555 be_lv_t *be_liveness(ir_graph *irg)
557 be_lv_t *lv = xmalloc(sizeof(lv[0]));
559 memset(lv, 0, sizeof(lv[0]));
562 lv->lvc = lv_chk_new(irg);
564 lv->hook_info.context = lv;
565 lv->hook_info.hook._hook_node_info = lv_dump_block;
570 void be_liveness_recompute(be_lv_t *lv)
572 unsigned last_idx = get_irg_last_idx(lv->irg);
573 if(last_idx >= bitset_size(lv->nodes)) {
574 bitset_free(lv->nodes);
575 lv->nodes = bitset_malloc(last_idx * 2);
579 bitset_clear_all(lv->nodes);
582 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
583 compute_liveness(lv);
587 void be_liveness_free(be_lv_t *lv)
589 be_liveness_invalidate(lv);
593 void be_liveness_remove(be_lv_t *lv, ir_node *irn)
596 unsigned idx = get_irn_idx(irn);
597 struct _lv_walker_t w;
600 * Removes a single irn from the liveness information.
601 * Since an irn can only be live at blocks dominated by the block of its
602 * definition, we only have to process that dominance subtree.
606 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
607 if(idx < bitset_size(lv->nodes))
608 bitset_clear(lv->nodes, idx);
612 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
615 struct _lv_walker_t w;
617 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
618 liveness_for_node(irn, &w);
623 void be_liveness_update(be_lv_t *lv, ir_node *irn)
625 be_liveness_remove(lv, irn);
626 be_liveness_introduce(lv, irn);
629 static void lv_check_walker(ir_node *bl, void *data)
631 struct _lv_walker_t *w = data;
633 be_lv_t *fresh = w->data;
635 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
636 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
638 if(!fr && curr && curr[0].u.head.n_members > 0) {
641 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
642 for(i = 0; i < curr[0].u.head.n_members; ++i) {
643 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
648 unsigned n_curr = curr[0].u.head.n_members;
649 unsigned n_fresh = fr[0].u.head.n_members;
653 if(n_curr != n_fresh) {
654 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
656 ir_fprintf(stderr, "current:\n");
657 for(i = 0; i < n_curr; ++i) {
658 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
659 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
662 ir_fprintf(stderr, "correct:\n");
663 for(i = 0; i < n_fresh; ++i) {
664 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
665 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
671 void be_liveness_check(be_lv_t *lv)
673 struct _lv_walker_t w;
674 be_lv_t *fresh = be_liveness(lv->irg);
678 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
679 be_liveness_free(fresh);
683 static void lv_dump_block_walker(ir_node *irn, void *data)
685 struct _lv_walker_t *w = data;
687 lv_dump_block(w->lv, w->data, irn);
691 /* Dump the liveness information for a graph. */
692 void be_liveness_dump(const be_lv_t *lv, FILE *f)
694 struct _lv_walker_t w;
696 w.lv = (be_lv_t *) lv;
698 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
701 /* Dump the liveness information for a graph. */
702 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
706 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
707 if((f = fopen(buf, "wt")) != NULL) {
708 be_liveness_dump(lv, f);
714 * Walker: checks the every predecessors of a node dominate
717 static void dom_check(ir_node *irn, void *data)
719 int *problem_found = data;
721 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
723 ir_node *bl = get_nodes_block(irn);
725 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
726 ir_node *op = get_irn_n(irn, i);
727 ir_node *def_bl = get_nodes_block(op);
728 ir_node *use_bl = bl;
731 use_bl = get_Block_cfgpred_block(bl, i);
733 if(get_irn_opcode(use_bl) != iro_Bad
734 && get_irn_opcode(def_bl) != iro_Bad
735 && !block_dominates(def_bl, use_bl)) {
736 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)));
743 /* Check, if the SSA dominance property is fulfilled. */
744 int be_check_dominance(ir_graph *irg)
746 int problem_found = 0;
749 irg_walk_graph(irg, dom_check, NULL, &problem_found);
751 return !problem_found;
754 void be_liveness_transfer(const arch_env_t *arch_env,
755 const arch_register_class_t *cls,
756 ir_node *node, ir_nodeset_t *nodeset)
760 /* You should better break out of your loop when hitting the first phi
762 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
764 if (get_irn_mode(node) == mode_T) {
765 const ir_edge_t *edge;
767 foreach_out_edge(node, edge) {
768 ir_node *proj = get_edge_src_irn(edge);
770 if (arch_irn_consider_in_reg_alloc(arch_env, cls, proj)) {
771 ir_nodeset_remove(nodeset, proj);
776 if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
777 ir_nodeset_remove(nodeset, node);
780 arity = get_irn_arity(node);
781 for (i = 0; i < arity; ++i) {
782 ir_node *op = get_irn_n(node, i);
784 if (arch_irn_consider_in_reg_alloc(arch_env, cls, op))
785 ir_nodeset_insert(nodeset, op);
791 void be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env,
792 const arch_register_class_t *cls,
793 const ir_node *block, ir_nodeset_t *live)
797 assert(lv->nodes && "live sets must be computed");
798 be_lv_foreach(lv, block, be_lv_state_end, i) {
799 ir_node *node = be_lv_get_irn(lv, block, i);
800 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
803 ir_nodeset_insert(live, node);
809 void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env,
810 const arch_register_class_t *cls,
811 const ir_node *pos, ir_nodeset_t *live)
813 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
816 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
817 sched_foreach_reverse(bl, irn) {
819 * If we encounter the node we want to insert the Perm after,
820 * exit immediately, so that this node is still live
825 be_liveness_transfer(arch_env, cls, irn, live);
829 void be_liveness_nodes_live_at_input(const be_lv_t *lv,
830 const arch_env_t *arch_env,
831 const arch_register_class_t *cls,
832 const ir_node *pos, ir_nodeset_t *live)
834 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
837 assert(lv->nodes && "live sets must be computed");
838 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
839 sched_foreach_reverse(bl, irn) {
840 be_liveness_transfer(arch_env, cls, irn, live);
846 static void collect_node(ir_node *irn, void *data)
848 struct obstack *obst = data;
849 obstack_ptr_grow(obst, irn);
852 void be_live_chk_compare(be_lv_t *lv, lv_chk_t *lvc)
854 ir_graph *irg = lv->irg;
863 irg_block_walk_graph(irg, collect_node, NULL, &obst);
864 obstack_ptr_grow(&obst, NULL);
865 blocks = obstack_finish(&obst);
867 irg_walk_graph(irg, collect_node, NULL, &obst);
868 obstack_ptr_grow(&obst, NULL);
869 nodes = obstack_finish(&obst);
871 for (i = 0; blocks[i]; ++i) {
872 ir_node *bl = blocks[i];
874 for (j = 0; nodes[j]; ++j) {
875 ir_node *irn = nodes[j];
876 if (!is_Block(irn)) {
877 int lvr_in = be_is_live_in (lv, bl, irn);
878 int lvr_out = be_is_live_out(lv, bl, irn);
879 int lvr_end = be_is_live_end(lv, bl, irn);
881 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
882 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
883 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
885 if (lvr_in - lvc_in != 0)
886 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
888 if (lvr_end - lvc_end != 0)
889 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
891 if (lvr_out - lvc_out != 0)
892 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
898 obstack_free(&obst, NULL);
901 void be_init_live(void)
903 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
906 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);