4 * Copyright: (c) Universitaet Karlsruhe
5 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
7 * Implementation of the RA-Interface for an external, (non-SSA) register allocator.
9 * The external register allocator is a program taking 2 arguments:
10 * 1) An input file in which the cfg is defined
11 * 2) An output file containing the essential actions performed during allocation
16 ----------------------
18 inputfile ::= regs nodes interf affinities .
20 regs ::= 'regs' regcount . // Anzahl der register (0..regcount-1), die zur Verfuegung stehen
22 nodes ::= 'nodes' '{' node* '}' . // All nodes in the graph
24 interf ::= 'interferences' '{' edge* '}' . // Interference edges of the graph
26 affinities ::= 'affinities' '{' edge* '}' . // Affinity edges of the graph
29 | node-nr '<' reg-nr '>' . // Reg-nr is present in case of constraints
31 edge ::= '(' node-nr node-nr ')' .
34 regcount, node-nr ::= integer .
37 The output file format
38 -----------------------
40 outputfile ::= spills | allocs .
42 spills ::= 'spills' node-nr+ .
44 allocs ::= 'allocs' alloc* .
46 alloc ::= node-nr reg-nr .
49 ******** End of file format docu ********/
64 #include <libcore/lc_opts.h>
65 #include <libcore/lc_opts_enum.h>
73 #include "irprintf_t.h"
75 #include "irgraph_t.h"
77 #include "iredges_t.h"
81 #include "beraextern.h"
88 typedef struct _var_info_t var_info_t;
91 * Environment with all the needed stuff
93 typedef struct _be_raext_env_t {
95 const arch_register_class_t *cls;
97 dom_front_info_t *dom_info;
99 FILE *f; /**< file handle used for out- and input file */
100 set *vars; /**< contains all var_info_t */
101 int n_cls_vars; /**< length of the array cls_vars */
102 var_info_t **cls_vars; /**< only the var_infos for current cls. needed for double iterating */
107 /******************************************************************************
110 | |__| | ___| |_ __ ___ _ __ ___
111 | __ |/ _ \ | '_ \ / _ \ '__/ __|
112 | | | | __/ | |_) | __/ | \__ \
113 |_| |_|\___|_| .__/ \___|_| |___/
116 *****************************************************************************/
119 #define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset))
120 #define set_foreach(set, e) for(e=set_first(set); e; e=set_next(set))
123 * Checks if _the_ result of the irn belongs to the
124 * current register class (raenv->cls)
125 * NOTE: Only the first result is checked.
127 #define is_res_in_reg_class(irn) arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls)
129 static INLINE ir_node *get_first_non_phi(pset *s) {
138 assert(0 && "There must be a non-phi-irn in this");
142 static INLINE ir_node *get_first_phi(pset *s) {
151 assert(0 && "There must be a phi in this");
155 /******************************************************************************
157 / ____| | | / ____| (_)
158 | | ___ _ __ ___| |_ _ __ | | ___ _ __ _ ___ ___
159 | | / _ \| '_ \/ __| __| '__| | | / _ \| '_ \| |/ _ \/ __|
160 | |___| (_) | | | \__ \ |_| | | |___| (_) | |_) | | __/\__ \
161 \_____\___/|_| |_|___/\__|_| \_____\___/| .__/|_|\___||___/
164 *****************************************************************************/
166 static void handle_constraints_walker(ir_node *irn, void *env) {
167 be_raext_env_t *raenv = env;
168 arch_register_req_t req;
171 /* handle output constraints
172 * user -> irn becomes user -> cpy -> irn
174 arch_get_register_req(raenv->aenv, &req, irn, -1);
175 if (arch_register_req_is(&req, limited)) {
176 ir_node *cpy = be_new_Copy(req.cls, raenv->irg, get_nodes_block(irn), irn);
177 const ir_edge_t *edge;
179 /* all users of the irn use the copy instead */
180 sched_add_after(irn, cpy);
181 foreach_out_edge(irn, edge)
182 set_irn_n(edge->src, edge->pos, cpy);
186 /* handle input constraints by converting them into output constraints
187 * of copies of the former argument
188 * irn -> arg becomes irn -> copy -> arg
190 for (pos = 0, max = get_irn_arity(irn); pos<max; ++pos) {
191 arch_get_register_req(raenv->aenv, &req, irn, pos);
192 if (arch_register_req_is(&req, limited)) {
193 ir_node *arg = get_irn_n(irn, pos);
194 ir_node *cpy = be_new_Copy(req.cls, raenv->irg, get_nodes_block(irn), arg);
196 /* use the copy instead */
197 sched_add_before(irn, cpy);
198 set_irn_n(irn, pos, cpy);
200 /* set an out constraint for the copy */
201 arch_set_register_req(raenv->aenv, -1, &req); /* TODO */
206 static void handle_constraints(be_raext_env_t *raenv) {
207 irg_block_walk_graph(raenv->irg, NULL, handle_constraints_walker, raenv);
211 /******************************************************************************
213 / ____/ ____| /\ | __ \ | |
214 | (___| (___ / \ ______| | | | ___ ___| |_ _ __
215 \___ \\___ \ / /\ \______| | | |/ _ \/ __| __| '__|
216 ____) |___) / ____ \ | |__| | __/\__ \ |_| |
217 |_____/_____/_/ \_\ |_____/ \___||___/\__|_|
219 *****************************************************************************/
221 #define mark_as_done(irn, pos) set_irn_link(irn, INT_TO_PTR(pos+1))
222 #define has_been_done(irn, pos) (PTR_TO_INT(get_irn_link(irn)) > pos)
225 * Insert a copy for the argument of @p start_phi found at position @p pos.
226 * Also searches a phi-loop of arbitrary length to detect and resolve
227 * the class of phi-swap-problems. To search for a loop recursion is used.
229 * 1) Simplest case (phi with a non-phi arg):
230 * A single copy is inserted.
232 * 2) Phi chain (phi (with phi-arg)* with non=phi arg):
233 * Several copies are placed, each after returning from recursion.
236 * On detection a loop breaker is inserted, which is a copy of the start_phi.
237 * This copy then pretends beeing the argumnent of the last phi.
238 * Now case 2) can be used.
240 * The values of @p start_phi and @p pos never change during recursion.
242 * @p raenv Environment with all the stuff needed
243 * @p start_phi Phi node to process
244 * @p pos Argument position to insert copy/copies for
245 * @p curr_phi Phi node currently processed during recursion. Equals start_phi on initial call
247 * @return NULL If no copy is necessary
248 * NULL If the phi has already been processed at this pos
249 * Link field is used to keep track of processed positions
250 * In all other cases the ir_node *copy which was placed is returned.
252 static ir_node *insert_copies(be_raext_env_t *raenv, ir_node *start_phi, int pos, ir_node *curr_phi) {
253 ir_node *arg = get_irn_n(curr_phi, pos);
254 ir_node *arg_blk = get_nodes_block(arg);
255 ir_node *pred_blk = get_Block_cfgpred_block(get_nodes_block(curr_phi), pos);
256 ir_node *curr_cpy, *last_cpy;
258 assert(is_Phi(start_phi) && is_Phi(curr_phi));
260 if (has_been_done(start_phi, pos))
263 /* In case this is a 'normal' phi we insert into
264 * the schedule before the pred_blk irn */
267 /* If we detect a loop stop recursion. */
268 if (arg == start_phi) {
269 ir_node *loop_breaker;
270 if (start_phi == curr_phi) {
271 /* Phi directly uses itself. No copy necessary */
275 /* At least 2 phis are involved */
276 /* Insert a loop breaking copy (an additional variable T) */
277 loop_breaker = be_new_Copy(raenv->cls, raenv->irg, pred_blk, start_phi);
278 sched_add_before(pred_blk, loop_breaker);
283 /* If arg is a phi in the same block we have to continue search */
284 if (is_Phi(arg) && arg_blk == get_nodes_block(start_phi))
285 last_cpy = insert_copies(raenv, start_phi, pos, arg);
287 /* Insert copy of argument (may be the loop-breaker) */
288 curr_cpy = be_new_Copy(raenv->cls, raenv->irg, pred_blk, arg);
289 set_irn_n(curr_phi, pos, curr_cpy);
290 mark_as_done(curr_phi, pos);
291 sched_add_before(last_cpy, curr_cpy);
297 * Perform simple SSA-destruction with copies.
298 * The order of processing _must_ be
299 * for all positions {
304 * else the magic to keep track of processed phi-positions will fail in
305 * function 'insert_copies'
307 static void ssa_destr_simple_walker(ir_node *blk, void *env) {
308 be_raext_env_t *raenv = env;
312 /* for all argument positions of the phis */
313 for (pos=0, max=get_irn_arity(blk); pos<max; ++pos) {
315 /* for all phi nodes (which are scheduled first) */
316 sched_foreach(blk, phi) {
320 raenv->cls = arch_get_irn_reg_class(raenv->aenv, phi, -1);
321 insert_copies(raenv, phi, pos, phi);
327 static void ssa_destr_simple(be_raext_env_t *raenv) {
328 be_clear_links(raenv->irg);
329 irg_block_walk_graph(raenv->irg, ssa_destr_simple_walker, NULL, raenv);
333 static void ssa_destr_rastello(be_raext_env_t *raenv) {
336 phi_class_compute(raenv->irg);
337 irg_block_walk_graph(irg, ssa_destr_rastello, NULL, &raenv);
341 /******************************************************************************
343 \ \ / / | | |__ \ \ \ / /
344 \ \ / /_ _| |___ ) | \ \ / /_ _ _ __ ___
345 \ \/ / _` | / __| / / \ \/ / _` | '__/ __|
346 \ / (_| | \__ \ / /_ \ / (_| | | \__ \
347 \/ \__,_|_|___/ |____| \/ \__,_|_| |___/
348 *****************************************************************************/
351 * This struct maps a variable (nr) to the values belonging to this variable
354 int var_nr; /* the key */
355 pset *values; /* the ssa-values belonging to this variable */
358 #define SET_REMOVED -1
361 * The link field of an irn points to the var_info struct
362 * representing the corresponding variable.
364 #define set_var_info(irn, vi) set_irn_link(irn, vi)
365 #define get_var_info(irn) ((var_info_t *)get_irn_link(irn))
367 #define HASH_VAR_NR(var_nr) var_nr
369 static int compare_var_infos(const void *e1, const void *e2, size_t size) {
370 const var_info_t *v1 = e1;
371 const var_info_t *v2 = e2;
373 if (v1->var_nr == SET_REMOVED || v2->var_nr == SET_REMOVED)
376 return v1->var_nr != v2->var_nr;
379 static INLINE var_info_t *var_find(set *vars, int var_nr) {
383 return set_find(vars, &vi, sizeof(vi), HASH_VAR_NR(var_nr));
386 static INLINE var_info_t *var_find_or_insert(set *vars, int var_nr) {
387 var_info_t vi, *found;
388 memset(&vi, 0, sizeof(vi));
391 found = set_insert(vars, &vi, sizeof(vi), HASH_VAR_NR(var_nr));
394 found->values = pset_new_ptr(1);
400 * Adds a value to a variable. Sets all pointers accordingly.
402 static INLINE var_info_t *var_add_value(be_raext_env_t *raenv, int var_nr, ir_node *irn) {
403 var_info_t *vi = var_find_or_insert(raenv->vars, var_nr);
405 /* var 2 value mapping */
406 pset_insert_ptr(vi->values, irn);
408 /* value 2 var mapping */
409 set_var_info(irn, vi);
414 static INLINE pset *get_var_values(be_raext_env_t *raenv, int var_nr) {
415 var_info_t *vi = var_find(raenv->vars, var_nr);
416 assert(vi && "Variable does not exist");
421 * Define variables (numbers) for all SSA-values.
422 * All values in a phi class get assigned the same variable name.
423 * The link field maps values to the var-name
425 static void values_to_vars(ir_node *irn, void *env) {
426 be_raext_env_t *raenv = env;
430 vals = get_phi_class(irn);
433 nr = get_irn_node_nr(get_first_phi(vals));
435 /* not a phi class member, value == var */
436 nr = get_irn_node_nr(irn);
437 vals = pset_new_ptr(1);
438 pset_insert_ptr(vals, irn);
441 /* values <--> var mapping */
442 pset_foreach(vals, irn)
443 var_add_value(raenv, nr, irn);
447 /******************************************************************************
450 | | | |_ _ _ __ ___ _ __ ___ _ __
451 | | | | | | | '_ ` _ \| '_ \ / _ \ '__|
452 | |__| | |_| | | | | | | |_) | __/ |
453 |_____/ \__,_|_| |_| |_| .__/ \___|_|
456 *****************************************************************************/
459 static void extract_vars_of_cls(be_raext_env_t *raenv) {
463 raenv->cls_vars = malloc(set_count(raenv->vars) * sizeof(*raenv->cls_vars));
464 assert(raenv->cls_vars);
466 set_foreach(raenv->vars, vi)
467 if (is_res_in_reg_class(get_first_non_phi(vi->values)))
468 raenv->cls_vars[count++] = vi;
470 raenv->cls_vars = realloc(raenv->cls_vars, count * sizeof(*raenv->cls_vars));
471 assert(raenv->cls_vars);
473 raenv->n_cls_vars = count;
478 * Check if node irn has a limited-constraint at position pos.
479 * If yes, dump it to FILE raenv->f
481 static INLINE void dump_constraint(be_raext_env_t *raenv, ir_node *irn, int pos) {
482 bitset_t *bs = bitset_alloca(raenv->cls->n_regs);
483 arch_register_req_t req;
485 arch_get_register_req(raenv->aenv, &req, irn, pos);
486 if (arch_register_req_is(&req, limited)) {
488 req.limited(req.limited_env, bs);
489 reg_nr = bitset_next_set(bs, 0);
490 fprintf(raenv->f, "<%d>", reg_nr);
491 assert(-1 == bitset_next_set(bs, reg_nr+1) && "Constraints with more than 1 possible register are not supported");
496 static void dump_nodes(be_raext_env_t *raenv) {
500 fprintf(f, "\nnodes {\n");
502 for (i=0; i<raenv->n_cls_vars; ++i) {
503 var_info_t *vi = raenv->cls_vars[i];
505 if (vi->var_nr == SET_REMOVED)
508 fprintf(f, "%d", vi->var_nr);
509 dump_constraint(raenv, get_first_non_phi(vi->values), -1);
517 static void dump_interferences(be_raext_env_t *raenv) {
519 var_info_t *vi1, *vi2;
520 ir_node *irn1, *irn2;
523 fprintf(f, "\ninterferences {\n");
525 for (i=0; i<raenv->n_cls_vars; ++i) {
526 vi1 = raenv->cls_vars[i];
528 if (vi1->var_nr == SET_REMOVED)
531 for (o=i+1; o<raenv->n_cls_vars; ++o) {
532 vi2 = raenv->cls_vars[o];
534 if (vi2->var_nr == SET_REMOVED)
537 pset_foreach(vi1->values, irn1)
538 pset_foreach(vi2->values, irn2)
539 if (values_interfere(irn1, irn2)) {
540 pset_break(vi1->values);
541 pset_break(vi2->values);
542 fprintf(f, "(%d %d)\n", vi1->var_nr, vi2->var_nr);
550 static void dump_affinities_walker(ir_node *irn, void *env) {
551 be_raext_env_t *raenv = env;
553 if (arch_irn_classify(raenv->aenv, irn) == arch_irn_class_copy) {
554 ir_node *src = get_irn_n(irn, 0);
555 var_info_t *vi1 = get_irn_link(irn);
556 var_info_t *vi2 = get_irn_link(src);
558 fprintf(raenv->f, "(%d %d)\n", vi1->var_nr, vi2->var_nr);
563 static void dump_affinities(be_raext_env_t *raenv) {
564 fprintf(raenv->f, "\ninterferences {\n");
565 irg_walk_graph(raenv->irg, NULL, dump_affinities_walker, raenv);
566 fprintf(raenv->f, "}\n");
570 * Dump all information needed by the external
571 * register allocator to a single file.
573 static void dump_to_file(be_raext_env_t *raenv, char *filename) {
576 if (!(f = fopen(filename, "wt"))) {
577 fprintf(stderr, "Could not open file %s for writing\n", filename);
582 /* dump register info */
583 fprintf(f, "regs %d\n", arch_register_class_n_regs(raenv->cls));
585 /* dump the interference graph */
587 dump_interferences(raenv);
588 dump_affinities(raenv);
593 /******************************************************************************
596 | |__ __ _____ ___ _ _| |_ ___
597 | __| \ \/ / _ \/ __| | | | __/ _ \
598 | |____ > < __/ (__| |_| | || __/
599 |______/_/\_\___|\___|\__,_|\__\___|
600 *****************************************************************************/
603 * Execute the external register allocator specified in the
604 * firm-option firm.be.ra.ext.callee
606 static void execute(char *prog_to_call, char *out_file, char *result_file) {
610 snprintf(cmd_line, sizeof(cmd_line), "%s %s %s", prog_to_call, out_file, result_file);
612 ret_status = system(cmd_line);
613 assert(ret_status != -1 && "Invokation of external register allocator failed");
616 /******************************************************************************
619 / \ _ __ _ __ | |_ _ | |__) |___ ___ _ _| | |_
620 / /\ \ | '_ \| '_ \| | | | | | _ // _ \/ __| | | | | __|
621 / ____ \| |_) | |_) | | |_| | | | \ \ __/\__ \ |_| | | |_
622 /_/ \_\ .__/| .__/|_|\__, | |_| \_\___||___/\__,_|_|\__|
625 *****************************************************************************/
628 * Spill a variable and add reloads before all uses.
630 static INLINE void var_add_spills_and_reloads(be_raext_env_t *raenv, int var_nr) {
631 var_info_t *vi = var_find(raenv->vars, var_nr);
632 ir_node *spill=NULL, *ctx, *irn;
633 const ir_edge_t *edge;
634 pset *spills = pset_new_ptr(4); /* the spills of this variable */
635 pset *reloads = pset_new_ptr(4); /* the reloads of this variable */
636 int new_size, n_spills, n_reloads;
638 assert(vi && "Variable nr does not exist!");
639 assert(pset_count(vi->values) && "There are no values associated to this variable");
641 /* the spill context is set to an arbitrary node of the phi-class */
642 ctx = get_first_phi(vi->values);
644 /* for each value of this variable insert the spills */
645 pset_foreach(vi->values, irn) {
649 /* all ordinary nodes must be spilled */
650 spill = be_new_Spill(raenv->cls, raenv->irg, get_nodes_block(irn), irn, ctx);
651 sched_add_after(irn, spill);
653 /* remember the spill */
654 pset_insert_ptr(spills, spill);
657 assert(spill && "There must be at least one non-phi-node");
659 /* insert reloads and wire them arbitrary*/
660 pset_foreach(vi->values, irn)
661 foreach_out_edge(irn, edge) {
662 ir_node *reload, *src = edge->src;
666 /* all real uses must be reloaded */
667 reload = be_new_Reload(raenv->cls, raenv->irg, get_nodes_block(src), get_irn_mode(get_irn_n(spill, 0)), spill);
668 sched_add_before(src, reload);
670 /* remember the reload */
671 pset_insert_ptr(reloads, reload);
674 /* correct the reload->spill pointers... */
675 be_introduce_copies_for_set(raenv->dom_info, spills, reloads);
678 /****** correct the variable <--> values mapping: ******
680 * - if we had a phi class it gets split into several new variables
681 * - all reloads are new variables
683 n_spills = pset_count(spills);
684 n_reloads = pset_count(reloads);
686 /* first make room for new pointers in the cls_var array */
687 new_size = raenv->n_cls_vars + n_reloads + ((n_spills>1) ? n_spills : 0);
688 raenv->cls_vars = realloc(raenv->cls_vars, (new_size) * sizeof(*raenv->cls_vars));
689 assert(raenv->cls_vars && "Out of mem!?");
691 /* if we had a real phi-class, we must... */
692 if (pset_count(spills) > 1) {
693 /* ...remove the old variable corresponding to the phi class */
694 vi->var_nr = SET_REMOVED;
696 /* ...add new vars for each non-phi-member */
697 pset_foreach(spills, irn) {
698 ir_node *spilled = get_irn_n(irn, 0);
699 raenv->cls_vars[raenv->n_cls_vars++] = var_add_value(raenv, get_irn_node_nr(spilled), spilled);
703 /* add new variables for all reloads */
704 pset_foreach(reloads, irn)
705 raenv->cls_vars[raenv->n_cls_vars++] = var_add_value(raenv, get_irn_node_nr(irn), irn);
713 #define INVALID_FILE_FORMAT assert(0 && "Invalid file format.")
715 #define BUFCONV " %32s "
718 * Read in the actions performed by the external allocator.
719 * Apply these transformations to the irg.
720 * @return 1 if an allocation was read in. 0 otherwise.
722 static int read_and_apply_results(be_raext_env_t *raenv, char *filename) {
725 int is_allocation = 0;
727 if (!(f = fopen(filename, "rt"))) {
728 fprintf(stderr, "Could not open file %s for reading\n", filename);
733 /* read the action */
734 if (fscanf(f, BUFCONV, buf) != 1)
738 if (!strcmp(buf, "spills")) {
740 while (fscanf(f, " %d ", &var_nr) == 1)
741 var_add_spills_and_reloads(raenv, var_nr);
744 /* or do we allocate */
745 if (!strcmp(buf, "allocs")) {
749 while (fscanf(f, " %d %d ", &var_nr, ®_nr) == 2) {
751 pset *vals = get_var_values(raenv, var_nr);
753 assert(vals && "Variable nr does not exist!");
754 pset_foreach(vals, irn)
755 arch_set_irn_register(raenv->aenv, irn, arch_register_for_index(raenv->cls, reg_nr));
765 return is_allocation;
768 /******************************************************************************
772 | |\/| |/ _` | | '_ \
773 | | | | (_| | | | | |
774 |_| |_|\__,_|_|_| |_|
775 *****************************************************************************/
778 * Default values for options
780 static void (*ssa_destr)(be_raext_env_t*) = ssa_destr_simple;
781 static char callee[128] = "echo";
785 * Allocate registers with an external program using a text-file interface.
787 * Do some computations (SSA-destruction and mapping of values--vars)
789 * Execute external program
790 * Read in results and apply them
793 static void be_ra_extern_main(const be_main_env_t *env, ir_graph *irg) {
794 be_raext_env_t raenv;
801 raenv.aenv = env->arch_env;
802 raenv.dom_info = be_compute_dominance_frontiers(irg);
803 raenv.vars = new_set(compare_var_infos, 64);
805 /* Insert copies for constraints */
806 handle_constraints(&raenv);
808 /* SSA destruction */
811 /* Mapping of SSA-Values <--> Variables */
812 phi_class_compute(irg);
814 irg_walk_graph(irg, values_to_vars, NULL, &raenv);
816 dump_ir_block_graph_sched(irg, "-extern-ssadestr");
818 /* For all register classes */
819 for(clsnr = 0, clss = arch_isa_get_n_reg_class(raenv.aenv->isa); clsnr < clss; ++clsnr) {
821 char out[256], in[256];
823 raenv.cls = arch_isa_get_reg_class(raenv.aenv->isa, clsnr);
824 ir_snprintf(out, sizeof(out), "%F-%s.ra", irg, raenv.cls->name);
825 ir_snprintf(in, sizeof(in), "%F-%s.ra.res", irg, raenv.cls->name);
827 extract_vars_of_cls(&raenv);
830 dump_to_file(&raenv, out);
831 execute(callee, out, in);
832 done = read_and_apply_results(&raenv, in);
835 free(raenv.cls_vars);
839 set_foreach(raenv.vars, vi)
840 del_pset(vi->values);
842 be_free_dominance_frontiers(raenv.dom_info);
845 /******************************************************************************
848 | | | |_ __ | |_ _ ___ _ __ ___
849 | | | | '_ \| __| |/ _ \| '_ \/ __|
850 | |__| | |_) | |_| | (_) | | | \__ \
851 \____/| .__/ \__|_|\___/|_| |_|___/
854 *****************************************************************************/
858 static const lc_opt_enum_const_ptr_items_t ssa_destr_items[] = {
859 { "simple", ssa_destr_simple },
860 { "rastello", ssa_destr_rastello },
864 static lc_opt_enum_const_ptr_var_t ssa_destr_var = {
865 (const void **) &ssa_destr, ssa_destr_items
868 static const lc_opt_table_entry_t be_ra_extern_options[] = {
869 LC_OPT_ENT_ENUM_FUNC_PTR("ssa_destr", "SSA destruction flavor", &ssa_destr_var),
870 LC_OPT_ENT_STR("callee", "The external program to call", callee, sizeof(callee)),
874 static void be_ra_extern_register_options(lc_opt_entry_t *root) {
875 lc_opt_entry_t *grp = lc_opt_get_grp(root, "ext");
877 lc_opt_add_table(grp, be_ra_extern_options);
880 #endif /* WITH_LIBCORE */
882 const be_ra_t be_ra_external_allocator = {
884 be_ra_extern_register_options,