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:
10 * PROG -i INPUTFILE -o OUTPUTFILE
12 * 1) Input file defines the interference graph
13 * 2) Output file contains the instructions to perform
18 ----------------------
20 inputfile ::= regs nodes interf affinities .
22 regs ::= 'regs' regcount . // Anzahl der register (0..regcount-1), die zur Verfuegung stehen
24 nodes ::= 'nodes' '{' node* '}' . // All nodes in the graph
27 | node-info '<' reg-nr '>' . // Reg-nr is present in case of constraints
29 node-info ::= node-nr spill-costs .
31 interf ::= 'interferences' '{' i-edge* '}' . // Interference edges of the graph
33 i-edge ::= '(' node-nr ',' node-nr ')' .
35 affinities ::= 'affinities' '{' a-edge* '}' . // Affinity edges of the graph
37 a-edge ::= '(' node-nr ',' node-nr ',' weight ')' .
40 weight, regcount, node-nr ::= int32 .
41 spill-costs ::= int32 . // negative spill costs indicate unspillable
43 The output file format
44 -----------------------
46 outputfile ::= spills | allocs .
48 spills ::= 'spills' node-nr+ .
50 allocs ::= 'allocs' alloc* .
52 alloc ::= node-nr reg-nr .
55 ******** End of file format docu ********/
71 #include <libcore/lc_opts.h>
72 #include <libcore/lc_opts_enum.h>
80 #include "irprintf_t.h"
82 #include "irgraph_t.h"
84 #include "iredges_t.h"
88 #include "beraextern.h"
93 #include "besched_t.h"
99 typedef struct _var_info_t var_info_t;
102 * Environment with all the needed stuff
104 typedef struct _be_raext_env_t {
105 firm_dbg_module_t *dbg;
107 const arch_register_class_t *cls;
109 dom_front_info_t *dom_info;
111 FILE *f; /**< file handle used for out- and input file */
112 set *vars; /**< contains all var_info_t */
113 int n_cls_vars; /**< length of the array cls_vars */
114 var_info_t **cls_vars; /**< only the var_infos for current cls. needed for double iterating */
119 /******************************************************************************
122 | |__| | ___| |_ __ ___ _ __ ___
123 | __ |/ _ \ | '_ \ / _ \ '__/ __|
124 | | | | __/ | |_) | __/ | \__ \
125 |_| |_|\___|_| .__/ \___|_| |___/
128 *****************************************************************************/
131 #define pset_foreach(pset, irn) for(irn=pset_first(pset); irn; irn=pset_next(pset))
132 #define set_foreach(set, e) for(e=set_first(set); e; e=set_next(set))
135 * Checks if _the_ result of the irn belongs to the
136 * current register class (raenv->cls)
137 * NOTE: Only the first result is checked.
139 #define is_res_in_reg_class(irn) arch_irn_has_reg_class(raenv->aenv, irn, -1, raenv->cls)
141 static INLINE ir_node *get_first_non_phi(pset *s) {
150 assert(0 && "There must be a non-phi-irn in this");
154 static INLINE ir_node *get_first_phi(pset *s) {
163 assert(0 && "There must be a phi in this");
167 static int get_loop_weight(ir_node *irn) {
169 ir_loop *loop = get_irn_loop(get_nodes_block(irn));
172 int d = get_loop_depth(loop);
178 #define get_const_weight(irn) (1)
180 #define get_spill_weight(irn) get_loop_weight(irn)
181 #define get_reload_weight(irn) get_loop_weight(irn)
182 #define get_affinity_weight(irn) get_loop_weight(irn)
184 /******************************************************************************
186 / ____| | | / ____| (_)
187 | | ___ _ __ ___| |_ _ __ | | ___ _ __ _ ___ ___
188 | | / _ \| '_ \/ __| __| '__| | | / _ \| '_ \| |/ _ \/ __|
189 | |___| (_) | | | \__ \ |_| | | |___| (_) | |_) | | __/\__ \
190 \_____\___/|_| |_|___/\__|_| \_____\___/| .__/|_|\___||___/
193 *****************************************************************************/
195 static void handle_constraints_walker(ir_node *irn, void *env) {
196 be_raext_env_t *raenv = env;
197 arch_register_req_t req;
200 /* handle output constraints
201 * user -> irn becomes user -> cpy -> irn
203 arch_get_register_req(raenv->aenv, &req, irn, -1);
204 if (arch_register_req_is(&req, limited)) {
205 ir_node *cpy = be_new_Copy(req.cls, raenv->irg, get_nodes_block(irn), irn);
207 /* all users of the irn use the copy instead */
208 sched_add_after(irn, cpy);
209 edges_reroute(irn, cpy, raenv->irg);
213 /* handle input constraints by converting them into output constraints
214 * of copies of the former argument
215 * irn -> arg becomes irn -> copy -> arg
217 for (pos = 0, max = get_irn_arity(irn); pos<max; ++pos) {
218 arch_get_register_req(raenv->aenv, &req, irn, pos);
219 if (arch_register_req_is(&req, limited)) {
220 ir_node *arg = get_irn_n(irn, pos);
221 ir_node *cpy = be_new_Copy(req.cls, raenv->irg, get_nodes_block(irn), arg);
223 /* use the copy instead */
224 sched_add_before(irn, cpy);
225 set_irn_n(irn, pos, cpy);
227 /* set an out constraint for the copy */
228 be_set_constr_limited(cpy, -1, &req);
233 static void handle_constraints(be_raext_env_t *raenv) {
234 irg_walk_graph(raenv->irg, NULL, handle_constraints_walker, raenv);
238 /******************************************************************************
240 / ____/ ____| /\ | __ \ | |
241 | (___| (___ / \ ______| | | | ___ ___| |_ _ __
242 \___ \\___ \ / /\ \______| | | |/ _ \/ __| __| '__|
243 ____) |___) / ____ \ | |__| | __/\__ \ |_| |
244 |_____/_____/_/ \_\ |_____/ \___||___/\__|_|
246 *****************************************************************************/
248 #define mark_as_done(irn, pos) set_irn_link(irn, INT_TO_PTR(pos+1))
249 #define has_been_done(irn, pos) (PTR_TO_INT(get_irn_link(irn)) > pos)
252 * Insert a copy for the argument of @p start_phi found at position @p pos.
253 * Also searches a phi-loop of arbitrary length to detect and resolve
254 * the class of phi-swap-problems. To search for a loop recursion is used.
256 * 1) Simplest case (phi with a non-phi arg):
257 * A single copy is inserted.
259 * 2) Phi chain (phi (with phi-arg)* with non=phi arg):
260 * Several copies are placed, each after returning from recursion.
263 * On detection a loop breaker is inserted, which is a copy of the start_phi.
264 * This copy then pretends beeing the argumnent of the last phi.
265 * Now case 2) can be used.
267 * The values of @p start_phi and @p pos never change during recursion.
269 * @p raenv Environment with all the stuff needed
270 * @p start_phi Phi node to process
271 * @p pos Argument position to insert copy/copies for
272 * @p curr_phi Phi node currently processed during recursion. Equals start_phi on initial call
274 * @return NULL If no copy is necessary
275 * NULL If the phi has already been processed at this pos
276 * Link field is used to keep track of processed positions
277 * In all other cases the ir_node *copy which was placed is returned.
279 static ir_node *insert_copies(be_raext_env_t *raenv, ir_node *start_phi, int pos, ir_node *curr_phi) {
280 ir_node *arg = get_irn_n(curr_phi, pos);
281 ir_node *arg_blk = get_nodes_block(arg);
282 ir_node *pred_blk = get_Block_cfgpred_block(get_nodes_block(curr_phi), pos);
283 ir_node *curr_cpy, *last_cpy;
285 assert(is_Phi(start_phi) && is_Phi(curr_phi));
287 if (has_been_done(start_phi, pos))
290 /* In case this is a 'normal' phi we insert at the
291 * end of the pred block before cf nodes */
292 last_cpy = sched_skip(pred_blk, 0, sched_skip_cf_predicator, raenv->aenv);
293 last_cpy = sched_next(last_cpy);
295 /* If we detect a loop stop recursion. */
296 if (arg == start_phi) {
297 ir_node *loop_breaker;
298 if (start_phi == curr_phi) {
299 /* Phi directly uses itself. No copy necessary */
303 /* At least 2 phis are involved */
304 /* Insert a loop breaking copy (an additional variable T) */
305 loop_breaker = be_new_Copy(raenv->cls, raenv->irg, pred_blk, start_phi);
306 sched_add_before(last_cpy, loop_breaker);
311 /* If arg is a phi in the same block we have to continue search */
312 if (is_Phi(arg) && arg_blk == get_nodes_block(start_phi))
313 last_cpy = insert_copies(raenv, start_phi, pos, arg);
315 /* Insert copy of argument (may be the loop-breaker) */
316 curr_cpy = be_new_Copy(raenv->cls, raenv->irg, pred_blk, arg);
317 set_irn_n(curr_phi, pos, curr_cpy);
318 mark_as_done(curr_phi, pos);
319 sched_add_before(last_cpy, curr_cpy);
325 * Perform simple SSA-destruction with copies.
326 * The order of processing _must_ be
327 * for all positions {
332 * else the magic to keep track of processed phi-positions will fail in
333 * function 'insert_copies'
335 static void ssa_destr_simple_walker(ir_node *blk, void *env) {
336 be_raext_env_t *raenv = env;
340 /* for all argument positions of the phis */
341 for (pos=0, max=get_irn_arity(blk); pos<max; ++pos) {
343 /* for all phi nodes (which are scheduled first) */
344 sched_foreach(blk, phi) {
348 if (arch_irn_is(raenv->aenv, phi, ignore))
351 raenv->cls = arch_get_irn_reg_class(raenv->aenv, phi, -1);
352 insert_copies(raenv, phi, pos, phi);
358 static void ssa_destr_simple(be_raext_env_t *raenv) {
359 be_clear_links(raenv->irg);
360 irg_block_walk_graph(raenv->irg, ssa_destr_simple_walker, NULL, raenv);
364 static void ssa_destr_rastello(be_raext_env_t *raenv) {
368 phi_class_compute(raenv->irg);
369 irg_block_walk_graph(irg, ssa_destr_rastello, NULL, &raenv);
373 /******************************************************************************
375 \ \ / / | | |__ \ \ \ / /
376 \ \ / /_ _| |___ ) | \ \ / /_ _ _ __ ___
377 \ \/ / _` | / __| / / \ \/ / _` | '__/ __|
378 \ / (_| | \__ \ / /_ \ / (_| | | \__ \
379 \/ \__,_|_|___/ |____| \/ \__,_|_| |___/
380 *****************************************************************************/
383 * This struct maps a variable (nr) to the values belonging to this variable
386 int var_nr; /* the key */
387 pset *values; /* the ssa-values belonging to this variable */
390 #define SET_REMOVED -1
393 * The link field of an irn points to the var_info struct
394 * representing the corresponding variable.
396 #define set_var_info(irn, vi) set_irn_link(irn, vi)
397 #define get_var_info(irn) ((var_info_t *)get_irn_link(irn))
399 #define HASH_VAR_NR(var_nr) var_nr
401 static int compare_var_infos(const void *e1, const void *e2, size_t size) {
402 const var_info_t *v1 = e1;
403 const var_info_t *v2 = e2;
405 if (v1->var_nr == SET_REMOVED || v2->var_nr == SET_REMOVED)
408 return v1->var_nr != v2->var_nr;
411 static INLINE var_info_t *var_find(set *vars, int var_nr) {
415 return set_find(vars, &vi, sizeof(vi), HASH_VAR_NR(var_nr));
418 static INLINE var_info_t *var_find_or_insert(set *vars, int var_nr) {
419 var_info_t vi, *found;
420 memset(&vi, 0, sizeof(vi));
423 found = set_insert(vars, &vi, sizeof(vi), HASH_VAR_NR(var_nr));
426 found->values = pset_new_ptr(1);
432 * Adds a value to a variable. Sets all pointers accordingly.
434 static INLINE var_info_t *var_add_value(be_raext_env_t *raenv, int var_nr, ir_node *irn) {
435 var_info_t *vi = var_find_or_insert(raenv->vars, var_nr);
437 /* var 2 value mapping */
438 pset_insert_ptr(vi->values, irn);
440 /* value 2 var mapping */
441 set_var_info(irn, vi);
446 static INLINE pset *get_var_values(be_raext_env_t *raenv, int var_nr) {
447 var_info_t *vi = var_find(raenv->vars, var_nr);
448 assert(vi && "Variable does not exist");
453 * Define variables (numbers) for all SSA-values.
454 * All values in a phi class get assigned the same variable name.
455 * The link field maps values to the var-name
457 static void values_to_vars(ir_node *irn, void *env) {
458 be_raext_env_t *raenv = env;
462 if(arch_get_irn_reg_class(raenv->aenv, irn, -1) == NULL)
465 vals = get_phi_class(irn);
468 nr = get_irn_node_nr(get_first_phi(vals));
470 /* not a phi class member, value == var */
471 nr = get_irn_node_nr(irn);
472 vals = pset_new_ptr(1);
473 pset_insert_ptr(vals, irn);
476 /* values <--> var mapping */
477 pset_foreach(vals, irn) {
478 DBG((raenv->dbg, 0, "Var %d contains %+F\n", nr, irn));
479 var_add_value(raenv, nr, irn);
484 /******************************************************************************
487 | | | |_ _ _ __ ___ _ __ ___ _ __
488 | | | | | | | '_ ` _ \| '_ \ / _ \ '__|
489 | |__| | |_| | | | | | | |_) | __/ |
490 |_____/ \__,_|_| |_| |_| .__/ \___|_|
493 *****************************************************************************/
496 static void extract_vars_of_cls(be_raext_env_t *raenv) {
500 raenv->cls_vars = malloc(set_count(raenv->vars) * sizeof(*raenv->cls_vars));
501 assert(raenv->cls_vars);
503 set_foreach(raenv->vars, vi)
504 if (is_res_in_reg_class(get_first_non_phi(vi->values)))
505 raenv->cls_vars[count++] = vi;
507 raenv->cls_vars = realloc(raenv->cls_vars, count * sizeof(*raenv->cls_vars));
508 assert(raenv->cls_vars);
510 raenv->n_cls_vars = count;
515 * Check if node irn has a limited-constraint at position pos.
516 * If yes, dump it to FILE raenv->f
518 static INLINE void dump_constraint(be_raext_env_t *raenv, ir_node *irn, int pos) {
519 bitset_t *bs = bitset_alloca(raenv->cls->n_regs);
520 arch_register_req_t req;
522 arch_get_register_req(raenv->aenv, &req, irn, pos);
523 if (arch_register_req_is(&req, limited)) {
525 req.limited(req.limited_env, bs);
526 reg_nr = bitset_next_set(bs, 0);
527 fprintf(raenv->f, "<%d>", reg_nr);
528 assert(-1 == bitset_next_set(bs, reg_nr+1) && "Constraints with more than 1 possible register are not supported");
532 #define UNSPILLABLE -1
534 static INLINE int get_spill_costs(be_raext_env_t *raenv, var_info_t *vi) {
536 int c_spills=0, c_reloads=0;
538 pset_foreach(vi->values, irn) {
539 if (arch_irn_is(raenv->aenv, irn, ignore) || be_is_Reload(irn)) {
540 pset_break(vi->values);
545 /* number of reloads is the number of non-phi uses of all values of this var */
546 const ir_edge_t *edge;
547 foreach_out_edge(irn, edge)
548 if (!is_Phi(edge->src))
549 c_reloads += get_reload_weight(edge->src);
551 /* number of spills is the number of non-phi values for this var */
552 c_spills += get_spill_weight(irn);
556 return c_spills + c_reloads;
559 static void dump_nodes(be_raext_env_t *raenv) {
563 fprintf(f, "\nnodes {\n");
565 for (i=0; i<raenv->n_cls_vars; ++i) {
566 var_info_t *vi = raenv->cls_vars[i];
568 if (vi->var_nr == SET_REMOVED)
571 fprintf(f, "%d %d", vi->var_nr, get_spill_costs(raenv, vi));
572 dump_constraint(raenv, get_first_non_phi(vi->values), -1);
581 static void dump_interferences(be_raext_env_t *raenv) {
583 var_info_t *vi1, *vi2;
584 ir_node *irn1, *irn2;
587 fprintf(f, "\ninterferences {\n");
589 for (i=0; i<raenv->n_cls_vars; ++i) {
590 vi1 = raenv->cls_vars[i];
592 if (vi1->var_nr == SET_REMOVED)
595 for (o=i+1; o<raenv->n_cls_vars; ++o) {
596 vi2 = raenv->cls_vars[o];
598 if (vi2->var_nr == SET_REMOVED)
601 pset_foreach(vi1->values, irn1)
602 pset_foreach(vi2->values, irn2)
603 if (values_interfere(irn1, irn2)) {
604 pset_break(vi1->values);
605 pset_break(vi2->values);
606 fprintf(f, "(%d, %d)\n", vi1->var_nr, vi2->var_nr);
616 static void dump_affinities_walker(ir_node *irn, void *env) {
617 be_raext_env_t *raenv = env;
618 arch_register_req_t req;
620 var_info_t *vi1, *vi2;
622 if (arch_get_irn_reg_class(raenv->aenv, irn, -1) != raenv->cls || arch_irn_is(raenv->aenv, irn, ignore))
625 vi1 = get_var_info(irn);
627 /* copies have affinities */
628 if (arch_irn_classify(raenv->aenv, irn) == arch_irn_class_copy) {
629 ir_node *other = get_irn_n(irn, be_pos_Copy_orig);
631 if (! arch_irn_is(raenv->aenv, other, ignore)) {
632 vi2 = get_var_info(other);
634 fprintf(raenv->f, "(%d, %d, %d)\n", vi1->var_nr, vi2->var_nr, get_affinity_weight(irn));
639 /* should_be_equal constraints are affinites */
640 for (pos = 0, max = get_irn_arity(irn); pos<max; ++pos) {
641 arch_get_register_req(raenv->aenv, &req, irn, pos);
643 if (arch_register_req_is(&req, should_be_same) && arch_irn_is(raenv->aenv, req.other_same, ignore)) {
644 vi2 = get_var_info(req.other_same);
646 fprintf(raenv->f, "(%d, %d, %d)\n", vi1->var_nr, vi2->var_nr, get_affinity_weight(irn));
652 static void dump_affinities(be_raext_env_t *raenv) {
653 fprintf(raenv->f, "\naffinities {\n");
654 irg_walk_graph(raenv->irg, NULL, dump_affinities_walker, raenv);
655 fprintf(raenv->f, "}\n");
659 * Dump all information needed by the external
660 * register allocator to a single file.
662 static void dump_to_file(be_raext_env_t *raenv, char *filename) {
665 if (!(f = fopen(filename, "wt"))) {
666 fprintf(stderr, "Could not open file %s for writing\n", filename);
672 /* dump register info */
673 fprintf(f, "regs %d\n", arch_register_class_n_regs(raenv->cls));
675 /* dump the interference graph */
677 dump_interferences(raenv);
678 dump_affinities(raenv);
683 /******************************************************************************
686 | |__ __ _____ ___ _ _| |_ ___
687 | __| \ \/ / _ \/ __| | | | __/ _ \
688 | |____ > < __/ (__| |_| | || __/
689 |______/_/\_\___|\___|\__,_|\__\___|
690 *****************************************************************************/
693 * Execute the external register allocator specified in the
694 * firm-option firm.be.ra.ext.callee
696 static void execute(char *prog_to_call, char *out_file, char *result_file) {
700 snprintf(cmd_line, sizeof(cmd_line), "%s -i %s -o %s", prog_to_call, out_file, result_file);
702 ret_status = system(cmd_line);
703 assert(ret_status != -1 && "Invokation of external register allocator failed");
704 assert(ret_status == 0 && "External register allocator is unhappy with sth.");
707 /******************************************************************************
710 / \ _ __ _ __ | |_ _ | |__) |___ ___ _ _| | |_
711 / /\ \ | '_ \| '_ \| | | | | | _ // _ \/ __| | | | | __|
712 / ____ \| |_) | |_) | | |_| | | | \ \ __/\__ \ |_| | | |_
713 /_/ \_\ .__/| .__/|_|\__, | |_| \_\___||___/\__,_|_|\__|
716 *****************************************************************************/
719 * Spill a variable and add reloads before all uses.
721 static INLINE void var_add_spills_and_reloads(be_raext_env_t *raenv, int var_nr) {
722 var_info_t *vi = var_find(raenv->vars, var_nr);
723 ir_node *spill=NULL, *ctx, *irn;
725 const ir_edge_t *edge, *ne;
726 pset *spills = pset_new_ptr(4); /* the spills of this variable */
727 pset *reloads = pset_new_ptr(4); /* the reloads of this variable */
728 int new_size, n_spills, n_reloads;
730 assert(vi && "Variable nr does not exist!");
731 assert(pset_count(vi->values) && "There are no values associated to this variable");
733 /* the spill context is set to an arbitrary node of the phi-class,
734 * or the node itself if it is not member of a phi class
736 if (pset_count(vi->values) == 1)
737 ctx = get_first_non_phi(vi->values);
739 ctx = get_first_phi(vi->values);
741 DBG((raenv->dbg, LEVEL_2, "Spill context: %+F\n", ctx));
743 /* for each value of this variable insert the spills */
744 pset_foreach(vi->values, irn) {
750 /* all ordinary nodes must be spilled */
751 DBG((raenv->dbg, LEVEL_2, " spilling %+F\n", irn));
752 spill = be_spill(raenv->aenv, irn, ctx);
754 /* remember the spill */
755 pset_insert_ptr(spills, spill);
758 assert(spill && "There must be at least one non-phi-node");
760 mode = get_irn_mode(get_irn_n(spill, be_pos_Spill_val));
762 /* insert reloads and wire them arbitrary*/
763 pset_foreach(vi->values, irn)
764 foreach_out_edge_safe(irn, edge, ne) {
765 ir_node *reload, *src = edge->src;
766 if (is_Phi(src) || be_is_Spill(src))
769 /* all real uses must be reloaded */
770 DBG((raenv->dbg, LEVEL_2, " reloading before %+F\n", src));
771 reload = be_reload(raenv->aenv, raenv->cls, edge->src, mode, spill);
772 set_irn_n(edge->src, edge->pos, reload);
774 /* remember the reload */
775 pset_insert_ptr(reloads, reload);
778 /* correct the reload->spill pointers... */
779 be_ssa_constr_set(raenv->dom_info, spills);
782 /****** correct the variable <--> values mapping: ******
784 * - if we had a phi class it gets split into several new variables
785 * - all reloads are new variables
787 n_spills = pset_count(spills);
788 n_reloads = pset_count(reloads);
790 /* first make room for new pointers in the cls_var array */
791 new_size = raenv->n_cls_vars + n_reloads + ((n_spills>1) ? n_spills : 0);
792 raenv->cls_vars = realloc(raenv->cls_vars, (new_size) * sizeof(*raenv->cls_vars));
793 assert(raenv->cls_vars && "Out of mem!?");
795 /* if we had a real phi-class, we must... */
796 if (pset_count(spills) > 1) {
797 /* ...remove the old variable corresponding to the phi class */
798 vi->var_nr = SET_REMOVED;
800 /* ...add new vars for each non-phi-member */
801 pset_foreach(spills, irn) {
802 ir_node *spilled = get_irn_n(irn, be_pos_Spill_val);
803 raenv->cls_vars[raenv->n_cls_vars++] = var_add_value(raenv, get_irn_node_nr(spilled), spilled);
807 /* add new variables for all reloads */
808 pset_foreach(reloads, irn) {
809 assert(get_irn_node_nr(irn) != 1089);
810 raenv->cls_vars[raenv->n_cls_vars++] = var_add_value(raenv, get_irn_node_nr(irn), irn);
817 #define INVALID_FILE_FORMAT assert(0 && "Invalid file format.")
819 #define BUFCONV " %32s "
822 * Read in the actions performed by the external allocator.
823 * Apply these transformations to the irg.
824 * @return 1 if an allocation was read in. 0 otherwise.
826 static int read_and_apply_results(be_raext_env_t *raenv, char *filename) {
829 int is_allocation = 0;
831 if (!(f = fopen(filename, "rt"))) {
832 fprintf(stderr, "Could not open file %s for reading\n", filename);
838 /* read the action */
839 if (fscanf(f, BUFCONV, buf) != 1)
843 if (!strcmp(buf, "spills")) {
845 while (fscanf(f, " %d ", &var_nr) == 1)
846 var_add_spills_and_reloads(raenv, var_nr);
849 /* or do we allocate */
850 if (!strcmp(buf, "allocs")) {
854 while (fscanf(f, " %d %d ", &var_nr, ®_nr) == 2) {
856 pset *vals = get_var_values(raenv, var_nr);
858 assert(vals && "Variable nr does not exist!");
859 pset_foreach(vals, irn)
860 arch_set_irn_register(raenv->aenv, irn, arch_register_for_index(raenv->cls, reg_nr));
870 return is_allocation;
873 static void check_allocation(be_raext_env_t *raenv) {
876 for (i=0; i<raenv->n_cls_vars; ++i) {
877 var_info_t *vi1 = raenv->cls_vars[i];
879 if (vi1->var_nr == SET_REMOVED)
882 for (o=0; o<i; ++o) {
883 var_info_t *vi2 = raenv->cls_vars[o];
884 ir_node *irn1, *irn2;
886 if (vi2->var_nr == SET_REMOVED)
889 pset_foreach(vi1->values, irn1)
890 pset_foreach(vi2->values, irn2)
891 if (values_interfere(irn1, irn2) && arch_get_irn_register(raenv->aenv, irn1) == arch_get_irn_register(raenv->aenv, irn2)) {
892 dump_ir_block_graph_sched(raenv->irg, "ERROR");
893 ir_fprintf(stdout, "SSA values %+F and %+F interfere. They belong to varible %d and %d respectively.\n", irn1, irn2, vi1->var_nr, vi2->var_nr);
894 assert(0 && "ERROR graph dumped");
900 /******************************************************************************
904 | |\/| |/ _` | | '_ \
905 | | | | (_| | | | | |
906 |_| |_|\__,_|_|_| |_|
907 *****************************************************************************/
910 * Default values for options
912 static void (*ssa_destr)(be_raext_env_t*) = ssa_destr_simple;
913 static char callee[128] = "\"E:/user/kimohoff/public/register allocator\"";
914 //static char callee[128] = "/ben/kimohoff/ipd-registerallocator/register_allocator";
918 * Allocate registers with an external program using a text-file interface.
920 * Do some computations (SSA-destruction and mapping of values--vars)
922 * Execute external program
923 * Read in results and apply them
926 static void be_ra_extern_main(const be_irg_t *bi) {
927 be_main_env_t *env = bi->main_env;
928 ir_graph *irg = bi->irg;
930 be_raext_env_t raenv;
938 raenv.aenv = env->arch_env;
939 raenv.dom_info = be_compute_dominance_frontiers(irg);
940 raenv.vars = new_set(compare_var_infos, 64);
941 raenv.dbg = firm_dbg_register("ir.be.raextern");
942 firm_dbg_set_mask(raenv.dbg, DBG_LEVEL);
944 /* Insert copies for constraints */
945 handle_constraints(&raenv);
946 be_dump(irg, "-extern-constr", dump_ir_block_graph_sched);
948 /* SSA destruction respectively transformation into "Conventional SSA" */
950 be_dump(irg, "-extern-ssadestr", dump_ir_block_graph_sched);
952 /* Mapping of SSA-Values <--> Variables */
953 phi_class_compute(irg);
955 irg_walk_graph(irg, values_to_vars, NULL, &raenv);
958 /* For all register classes */
959 for(clsnr = 0, clss = arch_isa_get_n_reg_class(raenv.aenv->isa); clsnr < clss; ++clsnr) {
961 char out[256], in[256];
963 raenv.cls = arch_isa_get_reg_class(raenv.aenv->isa, clsnr);
965 extract_vars_of_cls(&raenv);
968 ir_snprintf(out, sizeof(out), "%F-%s-%d.ra", irg, raenv.cls->name, round);
969 ir_snprintf(in, sizeof(in), "%F-%s-%d.ra.res", irg, raenv.cls->name, round);
973 dump_to_file(&raenv, out);
974 execute(callee, out, in);
975 done = read_and_apply_results(&raenv, in);
976 be_abi_fix_stack_nodes(bi->abi);
978 ir_snprintf(in, sizeof(in), "-extern-%s-round-%d", raenv.cls->name, round);
979 be_dump(irg, in, dump_ir_block_graph_sched);
984 check_allocation(&raenv);
986 free(raenv.cls_vars);
989 be_dump(irg, "-extern-alloc", dump_ir_block_graph_sched);
992 set_foreach(raenv.vars, vi)
993 del_pset(vi->values);
995 be_free_dominance_frontiers(raenv.dom_info);
998 /******************************************************************************
1001 | | | |_ __ | |_ _ ___ _ __ ___
1002 | | | | '_ \| __| |/ _ \| '_ \/ __|
1003 | |__| | |_) | |_| | (_) | | | \__ \
1004 \____/| .__/ \__|_|\___/|_| |_|___/
1007 *****************************************************************************/
1012 static const lc_opt_enum_func_ptr_items_t ssa_destr_items[] = {
1013 { "simple", (int (*)()) ssa_destr_simple }, /* TODO make (void*) casts nicer */
1014 { "rastello", (int (*)()) ssa_destr_rastello },
1018 static lc_opt_enum_func_ptr_var_t ssa_destr_var = {
1019 (int (**)()) &ssa_destr, ssa_destr_items
1022 static const lc_opt_table_entry_t be_ra_extern_options[] = {
1023 LC_OPT_ENT_ENUM_FUNC_PTR("ssa_destr", "SSA destruction flavor", &ssa_destr_var),
1024 LC_OPT_ENT_STR("callee", "The external program to call", callee, sizeof(callee)),
1028 static void be_ra_extern_register_options(lc_opt_entry_t *root) {
1029 lc_opt_entry_t *grp = lc_opt_get_grp(root, "ext");
1031 lc_opt_add_table(grp, be_ra_extern_options);
1034 #endif /* WITH_LIBCORE */
1036 const be_ra_t be_ra_external_allocator = {
1038 be_ra_extern_register_options,