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 #define LV_STD_SIZE 64
48 #define LV_USE_BINARY_SEARCH
49 #undef LV_INTESIVE_CHECKS
51 static INLINE int is_liveness_node(const ir_node *irn)
53 switch(get_irn_opcode(irn)) {
64 int (be_lv_next_irn)(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
66 return _be_lv_next_irn(lv, bl, flags, i);
69 const ir_node * (be_lv_get_irn)(const struct _be_lv_t *lv, const ir_node *bl, int i)
71 return _be_lv_get_irn(lv, bl, i);
74 int (be_is_live_in)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
76 return _be_is_live_xxx(lv, block, irn, be_lv_state_in);
79 int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
81 return _be_is_live_xxx(lv, block, irn, be_lv_state_out);
84 int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn)
86 return _be_is_live_xxx(lv, block, irn, be_lv_state_end);
90 #ifdef LV_USE_BINARY_SEARCH
91 static INLINE unsigned _be_liveness_bsearch(struct _be_lv_info_t *arr, unsigned idx)
93 struct _be_lv_info_t *payload = arr + 1;
95 unsigned n = arr[0].u.head.n_members;
104 if(idx < payload[0].u.node.idx)
107 if(idx > payload[n - 1].u.node.idx)
111 /* start a binary search for the requested node. */
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 = phase_get_irn_data(&li->ph, bl);
166 unsigned idx = get_irn_idx(irn);
168 /* Get the position of the index in the array. */
169 int pos = _be_liveness_bsearch(irn_live, idx);
171 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
172 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
174 /* Check, if the irn is in deed in the array. */
182 static struct _be_lv_info_node_t *be_lv_get_or_set(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
184 struct _be_lv_info_t *irn_live = phase_get_or_set_irn_data(&li->ph, bl);
186 unsigned idx = get_irn_idx(irn);
188 /* Get the position of the index in the array. */
189 unsigned pos = _be_liveness_bsearch(irn_live, idx);
191 /* Get the record in question. 1 must be added, since the first record contains information about the array and must be skipped. */
192 struct _be_lv_info_node_t *res = &irn_live[pos + 1].u.node;
194 /* Check, if the irn is in deed in the array. */
195 if(res->idx != idx) {
196 struct _be_lv_info_t *payload;
197 unsigned n_members = irn_live[0].u.head.n_members;
198 unsigned n_size = irn_live[0].u.head.n_size;
201 if(n_members + 1 >= n_size) {
202 /* double the array size. Remember that the first entry is
203 * metadata about the array and not a real array element */
204 unsigned old_size_bytes = (n_size + 1) * sizeof(irn_live[0]);
205 unsigned new_size = (2 * n_size) + 1;
206 size_t new_size_bytes = new_size * sizeof(irn_live[0]);
207 struct _be_lv_info_t *nw = phase_alloc(&li->ph, new_size_bytes);
208 memcpy(nw, irn_live, old_size_bytes);
209 memset(((char*) nw) + old_size_bytes, 0,
210 new_size_bytes - old_size_bytes);
211 nw[0].u.head.n_size = new_size - 1;
213 phase_set_irn_data(&li->ph, bl, nw);
216 payload = &irn_live[1];
217 for(i = n_members; i > pos; --i) {
218 payload[i] = payload[i - 1];
221 ++irn_live[0].u.head.n_members;
223 res = &payload[pos].u.node;
228 #ifdef LV_INTESIVE_CHECKS
231 unsigned n = irn_live[0].u.head.n_members;
233 struct _be_lv_info_t *payload = &irn_live[1];
235 for(i = 0; i < n; ++i) {
236 assert(payload[i].u.node.idx >= last);
237 last = payload[i].u.node.idx;
246 * Removes a node from the list of live variables of a block.
247 * @return 1 if the node was live at that block, 0 if not.
249 static int be_lv_remove(struct _be_lv_t *li, ir_node *bl, ir_node *irn)
251 struct _be_lv_info_t *irn_live = phase_get_irn_data(&li->ph, bl);
254 unsigned n = irn_live[0].u.head.n_members;
255 unsigned idx = get_irn_idx(irn);
256 unsigned pos = _be_liveness_bsearch(irn_live, idx);
257 struct _be_lv_info_t *payload = irn_live + 1;
258 struct _be_lv_info_node_t *res = &payload[pos].u.node;
260 /* The node is in deed in the block's array. Let's remove it. */
261 if(res->idx == idx) {
264 for(i = pos + 1; i < n; ++i)
265 payload[i - 1] = payload[i];
267 payload[n - 1].u.node.idx = 0;
268 payload[n - 1].u.node.flags = 0;
270 --irn_live[0].u.head.n_members;
271 DBG((dbg, LEVEL_3, "\tdeleting %+F from %+F at pos %d\n", irn, bl, pos));
279 static void register_node(be_lv_t *lv, const ir_node *irn)
281 unsigned idx = get_irn_idx(irn);
282 if(idx >= bitset_size(lv->nodes)) {
283 bitset_t *nw = bitset_malloc(2 * idx);
284 bitset_copy(nw, lv->nodes);
285 bitset_free(lv->nodes);
289 bitset_set(lv->nodes, idx);
293 * Mark a node as live-in in a block.
295 static INLINE void mark_live_in(be_lv_t *lv, ir_node *block, ir_node *irn)
297 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
298 DBG((dbg, LEVEL_2, "marking %+F live in at %+F\n", irn, block));
299 n->flags |= be_lv_state_in;
300 register_node(lv, irn);
304 * Mark a node as live-out in a block.
306 static INLINE void mark_live_out(be_lv_t *lv, ir_node *block, ir_node *irn)
308 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
309 DBG((dbg, LEVEL_2, "marking %+F live out at %+F\n", irn, block));
310 n->flags |= be_lv_state_out | be_lv_state_end;
311 register_node(lv, irn);
315 * Mark a node as live-end in a block.
317 static INLINE void mark_live_end(be_lv_t *lv, ir_node *block, ir_node *irn)
319 struct _be_lv_info_node_t *n = be_lv_get_or_set(lv, block, irn);
320 DBG((dbg, LEVEL_2, "marking %+F live end at %+F\n", irn, block));
321 n->flags |= be_lv_state_end;
322 register_node(lv, irn);
326 * Mark a node (value) live out at a certain block. Do this also
327 * transitively, i.e. if the block is not the block of the value's
328 * definition, all predecessors are also marked live.
329 * @param def The node (value).
330 * @param block The block to mark the value live out of.
331 * @param visited A set were all visited blocks are recorded.
332 * @param is_true_out Is the node real out there or only live at the end
335 static void live_end_at_block(be_lv_t *lv, ir_node *def, ir_node *block, bitset_t *visited, int is_true_out)
337 mark_live_end(lv, block, def);
339 mark_live_out(lv, block, def);
341 if(!bitset_contains_irn(visited, block)) {
342 bitset_add_irn(visited, block);
345 * If this block is not the definition block, we have to go up
348 if(get_nodes_block(def) != block) {
351 mark_live_in(lv, block, def);
353 for(i = 0, n = get_Block_n_cfgpreds(block); i < n; ++i)
354 live_end_at_block(lv, def, get_Block_cfgpred_block(block, i), visited, 1);
360 struct _lv_walker_t {
366 * Liveness analysis for a value.
367 * This functions is meant to be called by a firm walker, to compute the
368 * set of all blocks a value is live in.
369 * @param irn The node (value).
370 * @param env Ignored.
372 static void liveness_for_node(ir_node *irn, void *data)
374 struct _lv_walker_t *walker = data;
375 be_lv_t *lv = walker->lv;
376 bitset_t *visited = walker->data;
377 const ir_edge_t *edge;
380 /* Don't compute liveness information for non-data nodes. */
381 if(!is_liveness_node(irn))
384 bitset_clear_all(visited);
385 def_block = get_nodes_block(irn);
387 /* Go over all uses of the value */
388 foreach_out_edge(irn, edge) {
389 ir_node *use = edge->src;
393 * If the usage is no data node, skip this use, since it does not
394 * affect the liveness of the node.
396 if(!is_liveness_node(use))
399 /* Get the block where the usage is in. */
400 use_block = get_nodes_block(use);
403 * If the use is a phi function, determine the corresponding block
404 * through which the value reaches the phi function and mark the
405 * value as live out of that block.
408 ir_node *pred_block = get_Block_cfgpred_block(use_block, edge->pos);
409 live_end_at_block(lv, irn, pred_block, visited, 0);
413 * Else, the value is live in at this block. Mark it and call live
414 * out on the predecessors.
416 else if(def_block != use_block) {
419 mark_live_in(lv, use_block, irn);
421 for(i = 0, n = get_Block_n_cfgpreds(use_block); i < n; ++i) {
422 ir_node *pred_block = get_Block_cfgpred_block(use_block, i);
423 live_end_at_block(lv, irn, pred_block, visited, 1);
429 static void lv_remove_irn_walker(ir_node *bl, void *data)
431 struct _lv_walker_t *w = data;
433 ir_node *irn = w->data;
434 be_lv_remove(lv, bl, irn);
437 static const char *lv_flags_to_str(unsigned flags)
439 static const char *states[] = {
450 return states[flags & 7];
453 static void lv_dump_block(void *context, FILE *f, const ir_node *bl)
456 be_lv_t *lv = context;
457 struct _be_lv_info_t *info = phase_get_irn_data(&lv->ph, bl);
459 fprintf(f, "liveness:\n");
461 unsigned n = info[0].u.head.n_members;
464 for(i = 0; i < n; ++i) {
465 struct _be_lv_info_node_t *n = &info[i+1].u.node;
466 ir_fprintf(f, "%s %+F\n", lv_flags_to_str(n->flags), get_idx_irn(lv->irg, n->idx));
472 static void *lv_phase_data_init(ir_phase *phase, ir_node *irn, void *old)
474 struct _be_lv_info_t *info = phase_alloc(phase, LV_STD_SIZE * sizeof(info[0]));
475 memset(info, 0, LV_STD_SIZE * sizeof(info[0]));
476 info[0].u.head.n_size = LV_STD_SIZE - 1;
480 static void compute_liveness(be_lv_t *lv)
482 struct _lv_walker_t w;
484 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
485 irg_walk_graph(lv->irg, liveness_for_node, NULL, &w);
489 /* Compute the inter block liveness for a graph. */
490 be_lv_t *be_liveness(ir_graph *irg)
492 be_lv_t *lv = xmalloc(sizeof(lv[0]));
494 memset(lv, 0, sizeof(lv[0]));
496 lv->nodes = bitset_malloc(2 * get_irg_last_idx(irg));
497 lv->hook_info.context = lv;
498 lv->hook_info.hook._hook_node_info = lv_dump_block;
499 register_hook(hook_node_info, &lv->hook_info);
500 phase_init(&lv->ph, "liveness", irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
501 compute_liveness(lv);
506 void be_liveness_recompute(be_lv_t *lv)
508 unsigned last_idx = get_irg_last_idx(lv->irg);
509 if(last_idx >= bitset_size(lv->nodes)) {
510 bitset_free(lv->nodes);
511 lv->nodes = bitset_malloc(last_idx * 2);
515 bitset_clear_all(lv->nodes);
518 phase_init(&lv->ph, "liveness", lv->irg, PHASE_DEFAULT_GROWTH, lv_phase_data_init, NULL);
519 compute_liveness(lv);
523 void be_liveness_free(be_lv_t *lv)
525 unregister_hook(hook_node_info, &lv->hook_info);
527 bitset_free(lv->nodes);
531 void be_liveness_remove(be_lv_t *lv, ir_node *irn)
533 unsigned idx = get_irn_idx(irn);
534 struct _lv_walker_t w;
537 * Removes a single irn from the liveness information.
538 * Since an irn can only be live at blocks dominated by the block of its
539 * definition, we only have to process that dominance subtree.
543 dom_tree_walk(get_nodes_block(irn), lv_remove_irn_walker, NULL, &w);
544 if(idx < bitset_size(lv->nodes))
545 bitset_clear(lv->nodes, idx);
548 void be_liveness_introduce(be_lv_t *lv, ir_node *irn)
550 struct _lv_walker_t w;
552 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
553 liveness_for_node(irn, &w);
557 void be_liveness_update(be_lv_t *lv, ir_node *irn)
559 be_liveness_remove(lv, irn);
560 be_liveness_introduce(lv, irn);
563 static void lv_add_missing_walker(ir_node *irn, void *data)
565 struct _lv_walker_t *w = data;
566 if(!is_Block(irn) && !bitset_contains_irn(w->lv->nodes, irn)) {
567 liveness_for_node(irn, w);
571 void be_liveness_add_missing(be_lv_t *lv)
573 struct _lv_walker_t w;
575 w.data = bitset_malloc(get_irg_last_idx(lv->irg));
576 irg_walk_graph(lv->irg, lv_add_missing_walker, NULL, &w);
580 static void lv_check_walker(ir_node *bl, void *data)
582 struct _lv_walker_t *w = data;
584 be_lv_t *fresh = w->data;
586 struct _be_lv_info_t *curr = phase_get_irn_data(&lv->ph, bl);
587 struct _be_lv_info_t *fr = phase_get_irn_data(&fresh->ph, bl);
589 if(!fr && curr && curr[0].u.head.n_members > 0) {
592 ir_fprintf(stderr, "%+F liveness should be empty but current liveness contains:\n", bl);
593 for(i = 0; i < curr[0].u.head.n_members; ++i) {
594 ir_fprintf(stderr, "\t%+F\n", get_idx_irn(lv->irg, curr[1 + i].u.node.idx));
599 unsigned n_curr = curr[0].u.head.n_members;
600 unsigned n_fresh = fr[0].u.head.n_members;
604 if(n_curr != n_fresh) {
605 ir_fprintf(stderr, "%+F: liveness set sizes differ. curr %d, correct %d\n", bl, n_curr, n_fresh);
607 ir_fprintf(stderr, "current:\n");
608 for(i = 0; i < n_curr; ++i) {
609 struct _be_lv_info_node_t *n = &curr[1 + i].u.node;
610 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
613 ir_fprintf(stderr, "correct:\n");
614 for(i = 0; i < n_fresh; ++i) {
615 struct _be_lv_info_node_t *n = &fr[1 + i].u.node;
616 ir_fprintf(stderr, "%+F %u %+F %s\n", bl, i, get_idx_irn(lv->irg, n->idx), lv_flags_to_str(n->flags));
622 void be_liveness_check(be_lv_t *lv)
624 struct _lv_walker_t w;
625 be_lv_t *fresh = be_liveness(lv->irg);
629 irg_block_walk_graph(lv->irg, lv_check_walker, NULL, &w);
630 be_liveness_free(fresh);
634 static void lv_dump_block_walker(ir_node *irn, void *data)
636 struct _lv_walker_t *w = data;
638 lv_dump_block(w->lv, w->data, irn);
642 /* Dump the liveness information for a graph. */
643 void be_liveness_dump(const be_lv_t *lv, FILE *f)
645 struct _lv_walker_t w;
647 w.lv = (be_lv_t *) lv;
649 irg_block_walk_graph(lv->irg, lv_dump_block_walker, NULL, &w);
652 /* Dump the liveness information for a graph. */
653 void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name)
657 ir_snprintf(buf, sizeof(buf), "%F_%s-live.txt", lv->irg, cls_name);
658 if((f = fopen(buf, "wt")) != NULL) {
659 be_liveness_dump(lv, f);
665 * Walker: checks the every predecessors of a node dominate
668 static void dom_check(ir_node *irn, void *data)
670 int *problem_found = data;
672 if(!is_Block(irn) && irn != get_irg_end(get_irn_irg(irn))) {
674 ir_node *bl = get_nodes_block(irn);
676 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
677 ir_node *op = get_irn_n(irn, i);
678 ir_node *def_bl = get_nodes_block(op);
679 ir_node *use_bl = bl;
682 use_bl = get_Block_cfgpred_block(bl, i);
684 if(get_irn_opcode(use_bl) != iro_Bad
685 && get_irn_opcode(def_bl) != iro_Bad
686 && !block_dominates(def_bl, use_bl)) {
687 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)));
694 /* Check, if the SSA dominance property is fulfilled. */
695 int be_check_dominance(ir_graph *irg)
697 int problem_found = 0;
700 irg_walk_graph(irg, dom_check, NULL, &problem_found);
702 return !problem_found;
705 pset *be_liveness_transfer(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, pset *live)
709 /* You should better break out of your loop when hitting the first phi function. */
710 assert(!is_Phi(irn) && "liveness_transfer produces invalid results for phi nodes");
712 if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) {
713 ir_node *del = pset_remove_ptr(live, irn);
718 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
719 ir_node *op = get_irn_n(irn, i);
721 if(arch_irn_consider_in_reg_alloc(arch_env, cls, op))
722 pset_insert_ptr(live, op);
728 void be_liveness_transfer_ir_nodeset(const arch_env_t *arch_env,
729 const arch_register_class_t *cls,
730 ir_node *node, ir_nodeset_t *nodeset)
734 /* You should better break out of your loop when hitting the first phi
736 assert(!is_Phi(node) && "liveness_transfer produces invalid results for phi nodes");
738 if(arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
739 ir_nodeset_remove(nodeset, node);
742 arity = get_irn_arity(node);
743 for(i = 0; i < arity; ++i) {
744 ir_node *op = get_irn_n(node, i);
746 if(arch_irn_consider_in_reg_alloc(arch_env, cls, op))
747 ir_nodeset_insert(nodeset, op);
753 pset *be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *bl, pset *live)
756 be_lv_foreach(lv, bl, be_lv_state_end, i) {
757 ir_node *irn = be_lv_get_irn(lv, bl, i);
758 if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
759 pset_insert_ptr(live, irn);
765 void be_liveness_end_of_block_ir_nodeset(const be_lv_t *lv,
766 const arch_env_t *arch_env,
767 const arch_register_class_t *cls,
768 const ir_node *block,
773 be_lv_foreach(lv, block, be_lv_state_end, i) {
774 ir_node *node = be_lv_get_irn(lv, block, i);
775 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
778 ir_nodeset_insert(live, node);
784 pset *be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live)
786 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
789 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
790 sched_foreach_reverse(bl, irn) {
792 * If we encounter the node we want to insert the Perm after,
793 * exit immediately, so that this node is still live
798 be_liveness_transfer(arch_env, cls, irn, live);
804 pset *be_liveness_nodes_live_at_input(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live)
806 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
809 be_liveness_end_of_block(lv, arch_env, cls, bl, live);
810 sched_foreach_reverse(bl, irn) {
811 be_liveness_transfer(arch_env, cls, irn, live);
819 static void collect_node(ir_node *irn, void *data)
821 struct obstack *obst = data;
822 obstack_ptr_grow(obst, irn);
825 void be_live_chk_compare(be_irg_t *birg)
827 ir_graph *irg = be_get_birg_irg(birg);
836 be_assure_liveness(birg);
837 be_assure_liveness_chk(birg);
838 lv = be_get_birg_liveness(birg);
839 lvc = be_get_birg_liveness_chk(birg);
843 irg_block_walk_graph(irg, collect_node, NULL, &obst);
844 obstack_ptr_grow(&obst, NULL);
845 blocks = obstack_finish(&obst);
847 irg_walk_graph(irg, collect_node, NULL, &obst);
848 obstack_ptr_grow(&obst, NULL);
849 nodes = obstack_finish(&obst);
851 for (i = 0; blocks[i]; ++i) {
852 ir_node *bl = blocks[i];
854 for (j = 0; nodes[j]; ++j) {
855 ir_node *irn = nodes[j];
856 if (!is_Block(irn)) {
857 int lvr_in = be_is_live_in (lv, bl, irn);
858 int lvr_out = be_is_live_out(lv, bl, irn);
859 int lvr_end = be_is_live_end(lv, bl, irn);
861 int lvc_in = lv_chk_bl_in (lvc, bl, irn);
862 int lvc_out = lv_chk_bl_out(lvc, bl, irn);
863 int lvc_end = lv_chk_bl_end(lvc, bl, irn);
865 if (lvr_in - lvc_in != 0)
866 ir_fprintf(stderr, "live in info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_in, lvc_in);
868 if (lvr_end - lvc_end != 0)
869 ir_fprintf(stderr, "live end info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_end, lvc_end);
871 if (lvr_out - lvc_out != 0)
872 ir_fprintf(stderr, "live out info for %+F at %+F differs: nml: %d, chk: %d\n", irn, bl, lvr_out, lvc_out);
878 obstack_free(&obst, NULL);
881 void be_init_live(void)
883 FIRM_DBG_REGISTER(dbg, "firm.be.liveness");
886 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_live);