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 Beladys spillalgorithm.
23 * @author Daniel Grund, Matthias Braun
34 #include "irprintf_t.h"
40 #include "iredges_t.h"
43 #include "irnodeset.h"
50 #include "besched_t.h"
54 #include "bechordal_t.h"
55 #include "bespilloptions.h"
56 #include "beloopana.h"
68 #define DBG_WORKSET 128
69 DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
71 /* factor to weight the different costs of reloading/rematerializing a node
72 (see bespill.h be_get_reload_costs_no_weight) */
73 #define RELOAD_COST_FACTOR 10
75 #define TIME_UNDEFINED 6666
80 * An association between a node and a point in time.
82 typedef struct loc_t {
84 unsigned time; /**< A use time (see beuses.h). */
85 bool spilled; /**< the value was already spilled on this path */
88 typedef struct _workset_t {
89 int len; /**< current length */
90 loc_t vals[0]; /**< inlined array of the values/distances in this working set */
93 static struct obstack obst;
94 static const arch_env_t *arch_env;
95 static const arch_register_class_t *cls;
96 static const be_lv_t *lv;
97 static be_loopana_t *loop_ana;
99 static workset_t *ws; /**< the main workset used while
100 processing a block. */
101 static be_uses_t *uses; /**< env for the next-use magic */
102 static ir_node *instr; /**< current instruction */
103 static unsigned instr_nr; /**< current instruction number
104 (relative to block start) */
105 static ir_nodeset_t used;
106 static spill_env_t *senv; /**< see bespill.h */
107 static pdeq *worklist;
109 static int loc_compare(const void *a, const void *b)
113 return p->time - q->time;
116 void workset_print(const workset_t *w)
120 for(i = 0; i < w->len; ++i) {
121 ir_fprintf(stderr, "%+F %d\n", w->vals[i].node, w->vals[i].time);
126 * Alloc a new workset on obstack @p ob with maximum size @p max
128 static workset_t *new_workset(void)
131 size_t size = sizeof(*res) + n_regs * sizeof(res->vals[0]);
133 res = obstack_alloc(&obst, size);
134 memset(res, 0, size);
139 * Alloc a new instance on obstack and make it equal to @param workset
141 static workset_t *workset_clone(workset_t *workset)
144 size_t size = sizeof(*res) + n_regs * sizeof(res->vals[0]);
145 res = obstack_alloc(&obst, size);
146 memcpy(res, workset, size);
151 * Copy workset @param src to @param tgt
153 static void workset_copy(workset_t *dest, const workset_t *src)
155 size_t size = sizeof(*src) + n_regs * sizeof(src->vals[0]);
156 memcpy(dest, src, size);
160 * Overwrites the current content array of @param ws with the
161 * @param count locations given at memory @param locs.
162 * Set the length of @param ws to count.
164 static void workset_bulk_fill(workset_t *workset, int count, const loc_t *locs)
166 workset->len = count;
167 memcpy(&(workset->vals[0]), locs, count * sizeof(locs[0]));
171 * Inserts the value @p val into the workset, iff it is not
172 * already contained. The workset must not be full.
174 static void workset_insert(workset_t *workset, ir_node *val, bool spilled)
178 /* check for current regclass */
179 assert(arch_irn_consider_in_reg_alloc(arch_env, cls, val));
181 /* check if val is already contained */
182 for (i = 0; i < workset->len; ++i) {
183 loc = &workset->vals[i];
184 if (loc->node == val) {
193 assert(workset->len < n_regs && "Workset already full!");
194 loc = &workset->vals[workset->len];
196 loc->spilled = spilled;
197 loc->time = TIME_UNDEFINED;
202 * Removes all entries from this workset
204 static void workset_clear(workset_t *workset)
210 * Removes the value @p val from the workset if present.
212 static INLINE void workset_remove(workset_t *workset, ir_node *val)
215 for(i = 0; i < workset->len; ++i) {
216 if (workset->vals[i].node == val) {
217 workset->vals[i] = workset->vals[--workset->len];
223 static INLINE int workset_contains(const workset_t *ws, const ir_node *val)
227 for(i=0; i<ws->len; ++i) {
228 if (ws->vals[i].node == val)
236 * Iterates over all values in the working set.
237 * @p ws The workset to iterate
238 * @p v A variable to put the current value in
239 * @p i An integer for internal use
241 #define workset_foreach(ws, v, i) for(i=0; \
242 v=(i < ws->len) ? ws->vals[i].node : NULL, i < ws->len; \
245 #define workset_set_time(ws, i, t) (ws)->vals[i].time=t
246 #define workset_get_time(ws, i) (ws)->vals[i].time
247 #define workset_set_length(ws, length) (ws)->len = length
248 #define workset_get_length(ws) ((ws)->len)
249 #define workset_get_val(ws, i) ((ws)->vals[i].node)
250 #define workset_sort(ws) qsort((ws)->vals, (ws)->len, sizeof((ws)->vals[0]), loc_compare);
252 typedef struct _block_info_t
254 workset_t *start_workset;
255 workset_t *end_workset;
259 static void *new_block_info(void)
261 block_info_t *res = obstack_alloc(&obst, sizeof(res[0]));
262 memset(res, 0, sizeof(res[0]));
267 #define get_block_info(block) ((block_info_t *)get_irn_link(block))
268 #define set_block_info(block, info) set_irn_link(block, info)
271 * @return The distance to the next use or 0 if irn has dont_spill flag set
273 static INLINE unsigned get_distance(ir_node *from, unsigned from_step,
274 const ir_node *def, int skip_from_uses)
277 int flags = arch_irn_get_flags(arch_env, def);
281 assert(! (flags & arch_irn_flags_ignore));
283 use = be_get_next_use(uses, from, from_step, def, skip_from_uses);
284 if(USES_IS_INFINITE(use.time))
285 return USES_INFINITY;
287 /* We have to keep nonspillable nodes in the workingset */
288 if(flags & arch_irn_flags_dont_spill)
291 costs = be_get_reload_costs_no_weight(senv, def, use.before);
292 assert(costs * RELOAD_COST_FACTOR < 1000);
293 time = use.time + 1000 - (costs * RELOAD_COST_FACTOR);
299 * Performs the actions necessary to grant the request that:
300 * - new_vals can be held in registers
301 * - as few as possible other values are disposed
302 * - the worst values get disposed
304 * @p is_usage indicates that the values in new_vals are used (not defined)
305 * In this case reloads must be performed
307 static void displace(workset_t *new_vals, int is_usage)
309 ir_node **to_insert = alloca(n_regs * sizeof(to_insert[0]));
317 /* 1. Identify the number of needed slots and the values to reload */
319 workset_foreach(new_vals, val, iter) {
320 /* mark value as used */
322 ir_nodeset_insert(&used, val);
324 if (! workset_contains(ws, val)) {
325 DB((dbg, DBG_DECIDE, " insert %+F\n", val));
327 DB((dbg, DBG_SPILL, "Reload %+F before %+F\n", val, instr));
328 be_add_reload(senv, val, instr, cls, 1);
331 DB((dbg, DBG_DECIDE, " %+F already in workset\n", val));
333 /* remove the value from the current workset so it is not accidently
335 workset_remove(ws, val);
337 to_insert[demand++] = val;
340 /* 2. Make room for at least 'demand' slots */
341 len = workset_get_length(ws);
342 spills_needed = len + demand - n_regs;
343 assert(spills_needed <= len);
345 /* Only make more free room if we do not have enough */
346 if (spills_needed > 0) {
347 ir_node *curr_bb = get_nodes_block(instr);
348 workset_t *ws_start = get_block_info(curr_bb)->start_workset;
350 DB((dbg, DBG_DECIDE, " disposing %d values\n", spills_needed));
352 /* calculate current next-use distance for live values */
353 for (i = 0; i < len; ++i) {
354 ir_node *val = workset_get_val(ws, i);
355 unsigned dist = get_distance(instr, instr_nr, val, !is_usage);
356 workset_set_time(ws, i, dist);
359 /* sort entries by increasing nextuse-distance*/
362 /* Logic for not needed live-ins: If a value is disposed
363 * before its first usage, remove it from start workset
364 * We don't do this for phis though */
365 for (i = len - spills_needed; i < len; ++i) {
366 ir_node *val = ws->vals[i].node;
368 DB((dbg, DBG_DECIDE, " disposing node %+F (%u)\n", val,
369 workset_get_time(ws, i)));
372 if(!USES_IS_INFINITE(ws->vals[i].time) && !ws->vals[i].spilled) {
373 be_add_spill(senv, val, instr);
377 if (!is_Phi(val) && ! ir_nodeset_contains(&used, val)) {
378 workset_remove(ws_start, val);
379 DB((dbg, DBG_DECIDE, " (and removing %+F from start workset)\n", val));
383 /* kill the last 'demand' entries in the array */
384 workset_set_length(ws, len - spills_needed);
387 /* 3. Insert the new values into the workset */
388 for (i = 0; i < demand; ++i) {
389 ir_node *val = to_insert[i];
391 workset_insert(ws, val, false);
395 /** Decides whether a specific node should be in the start workset or not
397 * @param env belady environment
399 * @param node the node to test
400 * @param loop the loop of the node
402 static loc_t to_take_or_not_to_take(ir_node* first, ir_node *node,
405 be_next_use_t next_use;
408 loc.time = USES_INFINITY;
412 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
413 loc.time = USES_INFINITY;
417 /* We have to keep nonspillable nodes in the workingset */
418 if(arch_irn_get_flags(arch_env, node) & arch_irn_flags_dont_spill) {
420 DB((dbg, DBG_START, " %+F taken (dontspill node)\n", node, loc.time));
424 next_use = be_get_next_use(uses, first, 0, node, 0);
425 if(USES_IS_INFINITE(next_use.time)) {
426 // the nodes marked as live in shouldn't be dead, so it must be a phi
427 assert(is_Phi(node));
428 loc.time = USES_INFINITY;
429 DB((dbg, DBG_START, " %+F not taken (dead)\n", node));
431 be_spill_phi(senv, node);
436 loc.time = next_use.time;
438 if(next_use.outermost_loop >= get_loop_depth(loop)) {
439 DB((dbg, DBG_START, " %+F taken (%u, loop %d)\n", node, loc.time,
440 next_use.outermost_loop));
442 loc.time = USES_PENDING;
443 DB((dbg, DBG_START, " %+F delayed (outerdepth %d < loopdepth %d)\n",
444 node, next_use.outermost_loop, get_loop_depth(loop)));
450 * Computes the start-workset for a block with multiple predecessors. We assume
451 * that at least 1 of the predeccesors is a back-edge which means we're at the
452 * beginning of a loop. We try to reload as much values as possible now so they
453 * don't get reloaded inside the loop.
455 static void decide_start_workset(const ir_node *block)
457 ir_loop *loop = get_irn_loop(block);
463 int i, len, ws_count;
464 int free_slots, free_pressure_slots;
467 workset_t **pred_worksets;
469 /* Collect all values living at start of block */
470 starters = NEW_ARR_F(loc_t, 0);
471 delayed = NEW_ARR_F(loc_t, 0);
473 DB((dbg, DBG_START, "Living at start of %+F:\n", block));
474 first = sched_first(block);
476 /* check all Phis first */
477 sched_foreach(block, node) {
481 loc = to_take_or_not_to_take(first, node, loop);
483 if (! USES_IS_INFINITE(loc.time)) {
484 if (USES_IS_PENDING(loc.time))
485 ARR_APP1(loc_t, delayed, loc);
487 ARR_APP1(loc_t, starters, loc);
491 /* check all Live-Ins */
492 be_lv_foreach(lv, block, be_lv_state_in, i) {
493 ir_node *node = be_lv_get_irn(lv, block, i);
495 loc = to_take_or_not_to_take(first, node, loop);
497 if (! USES_IS_INFINITE(loc.time)) {
498 if (USES_IS_PENDING(loc.time))
499 ARR_APP1(loc_t, delayed, loc);
501 ARR_APP1(loc_t, starters, loc);
505 pressure = be_get_loop_pressure(loop_ana, cls, loop);
506 assert(ARR_LEN(delayed) <= (signed)pressure);
507 free_slots = n_regs - ARR_LEN(starters);
508 free_pressure_slots = n_regs - (pressure - ARR_LEN(delayed));
509 free_slots = MIN(free_slots, free_pressure_slots);
511 /* so far we only put nodes into the starters list that are used inside
512 * the loop. If register pressure in the loop is low then we can take some
513 * values and let them live through the loop */
514 if (free_slots > 0) {
515 qsort(delayed, ARR_LEN(delayed), sizeof(delayed[0]), loc_compare);
517 for (i = 0; i < ARR_LEN(delayed) && i < free_slots; ++i) {
519 loc_t *loc = & delayed[i];
521 /* don't use values which are dead in a known predecessors
522 * to not induce unnecessary reloads */
523 arity = get_irn_arity(block);
524 for (p = 0; p < arity; ++p) {
525 ir_node *pred_block = get_Block_cfgpred_block(block, p);
526 block_info_t *pred_info = get_block_info(pred_block);
528 if (pred_info == NULL)
531 if (!workset_contains(pred_info->end_workset, loc->node)) {
533 " delayed %+F not live at pred %+F\n", loc->node,
539 DB((dbg, DBG_START, " delayed %+F taken\n", loc->node));
540 ARR_APP1(loc_t, starters, *loc);
547 /* spill phis (the actual phis not just their values) that are in this block
548 * but not in the start workset */
549 for (i = ARR_LEN(delayed) - 1; i >= 0; --i) {
550 ir_node *node = delayed[i].node;
551 if(node == NULL || !is_Phi(node) || get_nodes_block(node) != block)
554 DB((dbg, DBG_START, " spilling delayed phi %+F\n", node));
555 be_spill_phi(senv, node);
559 /* Sort start values by first use */
560 qsort(starters, ARR_LEN(starters), sizeof(starters[0]), loc_compare);
562 /* Copy the best ones from starters to start workset */
563 ws_count = MIN(ARR_LEN(starters), n_regs);
565 workset_bulk_fill(ws, ws_count, starters);
567 /* spill phis (the actual phis not just their values) that are in this block
568 * but not in the start workset */
569 len = ARR_LEN(starters);
570 for (i = ws_count; i < len; ++i) {
571 ir_node *node = starters[i].node;
572 if (! is_Phi(node) || get_nodes_block(node) != block)
575 DB((dbg, DBG_START, " spilling phi %+F\n", node));
576 be_spill_phi(senv, node);
581 /* determine spill status of the values: If there's 1 pred block (which
582 * is no backedge) where the value is reloaded then we must set it to
583 * reloaded here. We place spills in all pred where the value was not yet
584 * reloaded to be sure we have a spill on each path */
585 arity = get_irn_arity(block);
586 pred_worksets = alloca(sizeof(pred_worksets[0]) * arity);
587 for(i = 0; i < arity; ++i) {
588 ir_node *pred_block = get_Block_cfgpred_block(block, i);
589 block_info_t *pred_info = get_block_info(pred_block);
591 if(pred_info == NULL)
592 pred_worksets[i] = NULL;
594 pred_worksets[i] = pred_info->end_workset;
597 for(i = 0; i < ws_count; ++i) {
598 loc_t *loc = &ws->vals[i];
599 ir_node *value = loc->node;
603 /* phis from this block aren't spilled */
604 if(get_nodes_block(value) == block) {
605 assert(is_Phi(value));
606 loc->spilled = false;
610 /* determine if value was spilled on any predecessor */
612 for(n = 0; n < arity; ++n) {
613 workset_t *pred_workset = pred_worksets[n];
617 if (pred_workset == NULL)
620 p_len = workset_get_length(pred_workset);
621 for(p = 0; p < p_len; ++p) {
622 loc_t *l = &pred_workset->vals[p];
624 if (l->node != value)
629 goto determined_spill;
635 goto determined_spill;
641 for (n = 0; n < arity; ++n) {
642 workset_t *pred_workset = pred_worksets[n];
646 if (pred_workset == NULL)
649 p_len = workset_get_length(pred_workset);
650 for (p = 0; p < p_len; ++p) {
651 loc_t *l = &pred_workset->vals[p];
653 if (l->node != value)
657 ir_node *pred_block = get_Block_cfgpred_block(block, n);
658 ir_node *insert_point
659 = be_get_end_of_block_insertion_point(pred_block);
660 DB((dbg, DBG_SPILL, "Spill %+F before %+F\n", node,
662 be_add_spill(senv, value, insert_point);
668 loc->spilled = spilled;
673 * For the given block @p block, decide for each values
674 * whether it is used from a register or is reloaded
677 static void belady(ir_node *block)
682 block_info_t *block_info;
684 int has_backedges = 0;
686 const ir_edge_t *edge;
688 /* no need to process a block twice */
689 if(get_block_info(block) != NULL) {
693 /* check if all predecessor blocks are processed yet (though for backedges
694 * we have to make an exception as we can't process them first) */
695 arity = get_Block_n_cfgpreds(block);
696 for(i = 0; i < arity; ++i) {
697 ir_node *pred_block = get_Block_cfgpred_block(block, i);
698 block_info_t *pred_info = get_block_info(pred_block);
700 if(pred_info == NULL) {
701 /* process predecessor first (it will be in the queue already) */
702 if(!is_backedge(block, i)) {
708 (void) has_backedges;
711 } else if(arity == 1) {
712 ir_node *pred_block = get_Block_cfgpred_block(block, 0);
713 block_info_t *pred_info = get_block_info(pred_block);
715 assert(pred_info != NULL);
716 workset_copy(ws, pred_info->end_workset);
718 /* we need 2 heuristics here, for the case when all predecessor blocks
719 * are known and when some are backedges (and therefore can't be known
721 decide_start_workset(block);
724 DB((dbg, DBG_DECIDE, "\n"));
725 DB((dbg, DBG_DECIDE, "Decide for %+F\n", block));
727 block_info = new_block_info();
728 set_block_info(block, block_info);
730 DB((dbg, DBG_WSETS, "Start workset for %+F:\n", block));
731 workset_foreach(ws, irn, iter) {
732 DB((dbg, DBG_WSETS, " %+F (%u)\n", irn,
733 workset_get_time(ws, iter)));
736 block_info->start_workset = workset_clone(ws);
738 /* process the block from start to end */
739 DB((dbg, DBG_WSETS, "Processing...\n"));
740 ir_nodeset_init(&used);
742 /* TODO: this leaks (into the obstack)... */
743 new_vals = new_workset();
745 sched_foreach(block, irn) {
747 assert(workset_get_length(ws) <= n_regs);
749 /* Phis are no real instr (see insert_starters()) */
753 DB((dbg, DBG_DECIDE, " ...%+F\n", irn));
755 /* set instruction in the workset */
758 /* allocate all values _used_ by this instruction */
759 workset_clear(new_vals);
760 for(i = 0, arity = get_irn_arity(irn); i < arity; ++i) {
761 ir_node *in = get_irn_n(irn, i);
762 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, in))
765 /* (note that "spilled" is irrelevant here) */
766 workset_insert(new_vals, in, false);
768 displace(new_vals, 1);
770 /* allocate all values _defined_ by this instruction */
771 workset_clear(new_vals);
772 if (get_irn_mode(irn) == mode_T) {
773 const ir_edge_t *edge;
775 foreach_out_edge(irn, edge) {
776 ir_node *proj = get_edge_src_irn(edge);
777 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, proj))
779 workset_insert(new_vals, proj, false);
782 if (!arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
784 workset_insert(new_vals, irn, false);
786 displace(new_vals, 0);
790 ir_nodeset_destroy(&used);
792 /* Remember end-workset for this block */
793 block_info->end_workset = workset_clone(ws);
794 DB((dbg, DBG_WSETS, "End workset for %+F:\n", block));
795 workset_foreach(ws, irn, iter)
796 DB((dbg, DBG_WSETS, " %+F (%u)\n", irn,
797 workset_get_time(ws, iter)));
799 /* add successor blocks into worklist */
800 foreach_block_succ(block, edge) {
801 ir_node *succ = get_edge_src_irn(edge);
802 pdeq_putr(worklist, succ);
807 * 'decide' is block-local and makes assumptions
808 * about the set of live-ins. Thus we must adapt the
809 * live-outs to the live-ins at each block-border.
811 static void fix_block_borders(ir_node *block, void *data)
813 workset_t *start_workset;
819 DB((dbg, DBG_FIX, "\n"));
820 DB((dbg, DBG_FIX, "Fixing %+F\n", block));
822 start_workset = get_block_info(block)->start_workset;
824 /* process all pred blocks */
825 arity = get_irn_arity(block);
826 for (i = 0; i < arity; ++i) {
827 ir_node *pred = get_Block_cfgpred_block(block, i);
828 workset_t *pred_end_workset = get_block_info(pred)->end_workset;
831 DB((dbg, DBG_FIX, " Pred %+F\n", pred));
833 /* spill all values not used anymore */
834 workset_foreach(pred_end_workset, node, iter) {
838 workset_foreach(start_workset, n2, iter2) {
843 /* note that we do not look at phi inputs, becuase the values
844 * will be either live-end and need no spill or
845 * they have other users in which must be somewhere else in the
853 if(be_is_live_in(lv, block, node)
854 && !pred_end_workset->vals[iter].spilled) {
855 ir_node *insert_point;
857 insert_point = be_get_end_of_block_insertion_point(pred);
859 insert_point = sched_first(block);
860 assert(!is_Phi(insert_point));
862 DB((dbg, DBG_SPILL, "Spill %+F before %+F\n", node,
864 be_add_spill(senv, node, insert_point);
869 /* reload missing values in predecessors */
870 workset_foreach(start_workset, node, iter) {
871 /* if node is a phi of the current block we reload
872 * the corresponding argument, else node itself */
873 if(is_Phi(node) && block == get_nodes_block(node)) {
874 node = get_irn_n(node, i);
876 /* we might have unknowns as argument for the phi */
877 if(!arch_irn_consider_in_reg_alloc(arch_env, cls, node))
881 /* check if node is in a register at end of pred */
882 if(workset_contains(pred_end_workset, node))
885 /* node is not in memory at the end of pred -> reload it */
886 DB((dbg, DBG_FIX, " reload %+F\n", node));
887 DB((dbg, DBG_SPILL, "Reload %+F before %+F,%d\n", node, block, i));
888 be_add_reload_on_edge(senv, node, block, i, cls, 1);
893 static void be_spill_belady(be_irg_t *birg, const arch_register_class_t *rcls)
895 ir_graph *irg = be_get_birg_irg(birg);
897 be_liveness_assure_sets(be_assure_liveness(birg));
899 /* construct control flow loop tree */
900 if(! (get_irg_loopinfo_state(irg) & loopinfo_cf_consistent)) {
901 construct_cf_backedges(irg);
906 /* init belady env */
908 arch_env = birg->main_env->arch_env;
910 lv = be_get_birg_liveness(birg);
911 n_regs = cls->n_regs - be_put_ignore_regs(birg, cls, NULL);
913 uses = be_begin_uses(irg, lv);
914 loop_ana = be_new_loop_pressure(birg);
915 senv = be_new_spill_env(birg);
916 worklist = new_pdeq();
918 pdeq_putr(worklist, get_irg_start_block(irg));
920 while(!pdeq_empty(worklist)) {
921 ir_node *block = pdeq_getl(worklist);
924 /* end block might not be reachable in endless loops */
925 belady(get_irg_end_block(irg));
929 /* belady was block-local, fix the global flow by adding reloads on the
931 irg_block_walk_graph(irg, fix_block_borders, NULL, NULL);
933 /* Insert spill/reload nodes into the graph and fix usages */
934 be_insert_spills_reloads(senv);
937 be_delete_spill_env(senv);
939 be_free_loop_pressure(loop_ana);
940 obstack_free(&obst, NULL);
943 void be_init_spillbelady(void)
945 static be_spiller_t belady_spiller = {
949 be_register_spiller("belady", &belady_spiller);
950 FIRM_DBG_REGISTER(dbg, "firm.be.spill.belady");
953 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_spillbelady);