X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal.c;h=95e28d3f5cd78cb3e922779e1e62a48e67bccc5c;hb=1345e0ae4de685dbb4012d7f66b6a54c3cf1f27b;hp=817a3b952bf64abd76e37d418143af126c396b36;hpb=8e0086dfdf3c7706b8bc4ee0e54097b4ed63d1e7;p=libfirm diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c index 817a3b952..95e28d3f5 100644 --- a/ir/be/bechordal.c +++ b/ir/be/bechordal.c @@ -2,7 +2,11 @@ * Chordal register allocation. * @author Sebastian Hack * @date 8.12.2004 + * + * Copyright (C) Universitaet Karlsruhe + * Released under the GPL */ + #ifdef HAVE_CONFIG_H #include "config.h" #endif @@ -10,6 +14,7 @@ #include #include "obst.h" +#include "pset.h" #include "list.h" #include "bitset.h" #include "iterator.h" @@ -25,411 +30,53 @@ #include "beutil.h" #include "besched.h" -#include "bera_t.h" #include "benumb_t.h" #include "besched_t.h" #include "belive_t.h" -#include "bechordal_t.h" - -#undef DUMP_INTERVALS -#undef DUMP_PRESSURE -#define DUMP_IFG - -#define BUILD_GRAPH +#include "bearch.h" +#include "beifg.h" -#ifdef DEBUG_libfirm -#include "fourcc.h" - -/* Make a fourcc for border checking. */ -#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D') +#include "bechordal_t.h" +#include "bechordal_draw.h" -#endif /* DEBUG_libfirm */ +#define DBG_LEVEL SET_LEVEL_0 +#define DBG_LEVEL_CHECK SET_LEVEL_0 -#define TEST_COLORS 2048 +#define NO_COLOR (-1) -static firm_dbg_module_t *dbg; +#undef DUMP_INTERVALS -/** - * Environment for each of the chordal register allocator phases - */ -typedef struct _env_t { - struct obstack obst; /**< An obstack for temporary storage. */ -#ifdef BUILD_GRAPH - set *graph; /**< The interference graph. */ -#endif +typedef struct _be_chordal_alloc_env_t { + be_chordal_env_t *chordal_env; bitset_t *live; /**< A liveness bitset. */ bitset_t *colors; /**< The color mask. */ - bitset_t *in_colors; /**< Colors used by live in values. */ - int colors_n; /**< The number of colors. */ -} env_t; - - -typedef struct _be_chordal_dump_params_t { - int x_dist; - int y_dist; - double font_scale; -} be_chordal_dump_params_t; - -static const be_chordal_dump_params_t dump_params = { - 30, - 10, - 4 -}; - -static void draw_interval_graphs(ir_node *block, - struct list_head *border_head, - const be_chordal_dump_params_t *params) -{ - int i; - int x_dist = params->x_dist; - int y_dist = params->y_dist; - ir_graph *irg = get_irn_irg(block); - - FILE *f; - char buf[1024]; - - ir_snprintf(buf, sizeof(buf), "intv_%s_bl%N.eps", - get_entity_name(get_irg_entity(irg)), block); - - if((f = fopen(buf, "wt")) != NULL) { - border_t *b; - int *seen = xcalloc(get_graph_node_count(irg), sizeof(seen[0])); - int last_pos = list_empty(border_head) ? 0 : list_entry(border_head->prev, border_t, list)->step; - int max_col = 0; - - list_for_each_entry_reverse(border_t, b, border_head, list) { - const ir_node *irn = b->irn; - int col = get_irn_color(irn); - max_col = max_col > col ? max_col : col; - } - - fprintf(f, "%%!PS-Adobe-2.0\n"); - fprintf(f, "%%%%BoundingBox: -10 -10 %d %d\n", - x_dist * last_pos + x_dist, y_dist * max_col + y_dist); - fprintf(f, "/mainfont /Courier findfont %f scalefont def\n", params->font_scale); - fprintf(f, "mainfont setfont\n"); - fprintf(f, "0.2 setlinewidth\n"); - - for(i = 0; i <= last_pos; ++i) { - fprintf(f, "0 0 0 setrgbcolor\n"); - fprintf(f, "%d %d moveto\n", i * x_dist, -2); - fprintf(f, "%d %d lineto\n", i * x_dist, max_col * y_dist + 2); - fprintf(f, "stroke\n"); - } - fprintf(f, "0.5 setlinewidth\n"); - - list_for_each_entry_reverse(border_t, b, border_head, list) { - const ir_node *irn = b->irn; - int nr = get_irn_graph_nr(irn); - - if(b->is_def) - seen[nr] = b->step; - else { - int col = get_irn_color(irn); - - int pos = last_pos - seen[nr]; - int end_pos = last_pos - b->step; - int live_in = is_live_in(block, irn); - int live_end = is_live_end(block, irn); - int y_val = y_dist * col; - - int red = 0; - int green = live_end; - int blue = live_in; - - fprintf(f, "0 0 0 setrgbcolor\n"); - fprintf(f, "%d %d moveto\n", x_dist * pos + 2, y_val + 2); - ir_fprintf(f, "(%n/%d%s) show\n", irn, nr, is_phi_operand(irn) ? "*" : ""); - fprintf(f, "%d %d %d setrgbcolor\n", red, green, blue); - fprintf(f, "%d %d moveto\n", x_dist * pos, y_val); - fprintf(f, "%d %d lineto\n", (x_dist * end_pos) - 5, y_val); - fprintf(f, "stroke\n"); - } - } - - free(seen); - fclose(f); - } -} - -#if 0 -typedef struct _tree_layout_info_t { - ir_node *block; - int is_child; - int child_slot; - unsigned x; - unsigned y; - int steps; -} tree_layout_info_t; - -typedef struct _tree_layout_params_t { - int interval_dist; - int x_block_dist; - int y_block_dist; - int step_len; -} tree_layout_params_t; - -static const tree_layout_params_t tree_layout_params = { - 10, 20, 20, 5 -}; - -static void dump_tree_collect(ir_node *block, void *env) -{ - ir_block *curr; - struct list_head *border_head; - - int pre_num = get_Block_dom_tree_pre_num(block); - tree_layout_info_t *info = env; - tree_layout_info_t *i = &info[pre_num]; - - i->block = block; - i->child_slot = -1; - i->steps = list_empty(border_head) ? 0 : list_entry(border_head->prev, border_t, list)->step; - i->is_child = 1; - - dominates_for_each(block, curr) - i->is_child = 0; -} - -static void dump_tree_assign_x(ir_node *block, void *env) -{ - unsigned min_x = -1, max_x = 0; - int n_childs = 0; - ir_block *curr; - - int pre_num = get_Block_dom_tree_pre_num(block); - tree_layout_info_t *info = env; - tree_layout_info_t *i = &info[pre_num]; - - if(i->is_child) - return; - - dominates_for_each(block, curr) { - tree_layout_info_t *ci = &info[get_Block_dom_tree_pre_num(curr)]; - max_x = MAX(max_x, ci->x); - min_x = MIN(min_x, ci->x); - n_childs++; - } - - i->x = (max_x - mix_x) / n_childs; -} + bitset_t *in_colors; /**< Colors used by live in values. */ + int colors_n; /**< The number of colors. */ +} be_chordal_alloc_env_t; -static void dump_tree_assign_y(ir_node *block, void *env) -{ - unsigned min_x = -1, max_x = 0; - int n_childs = 0; - ir_block *curr; - - int pre_num = get_Block_dom_tree_pre_num(block); - tree_layout_info_t *info = env; - tree_layout_info_t *i = &info[pre_num]; - ir_block *idom = get_Block_idom(block); - - i->y = 0; - if(idom) { - tree_layout_info_t *idom_info = &info[get_Block_dom_tree_pre_num(idom)]; - i->y = idom_info->y + idom_info->steps * params->step_len + params->y_dist; - } -} - -static void draw_block(ir_block *bl, void *env) -{ -} - -static void dump_interval_tree(ir_graph *irg, const tree_layout_params_t *params) -{ - int i, slot; - int n_blocks = get_Block_dom_max_subtree_pre_num(get_irg_start_block(irg)); - tree_layout_info_t *info = malloc(sizeof(info[0]) * n_blocks); - - /* Fill the info array. */ - dom_tree_walk_irg(irg, NULL, dump_tree_collect, info); - - /* Assign the child slots. */ - for(i = 0, slot = 0; i < n_blocks; ++i) { - tree_layout_info_t *i = &info[i]; - if(i->is_child) { - i->child_slot = slot++; - i->x = i->child_slot * params->max_color * params->interval_dist + params->block_dist; - } - } - - dom_tree_walk_irg(irg, NULL, dump_tree_assign_xy, info); - - free(info); -} -#endif - -#ifdef BUILD_GRAPH - -typedef struct _if_edge_t { - int src, tgt; -} if_edge_t; - -#define IF_EDGE_HASH(e) ((e)->src) - -static int if_edge_cmp(const void *p1, const void *p2, size_t size) -{ - const if_edge_t *e1 = p1; - const if_edge_t *e2 = p2; - - return !(e1->src == e2->src && e1->tgt == e2->tgt); -} - -static INLINE if_edge_t *edge_init(if_edge_t *edge, int src, int tgt) -{ - /* Bring the smaller entry to src. */ - if(src > tgt) { - edge->src = tgt; - edge->tgt = src; - } else { - edge->src = src; - edge->tgt = tgt; - } +#include "fourcc.h" - return edge; -} +/* Make a fourcc for border checking. */ +#define BORDER_FOURCC FOURCC('B', 'O', 'R', 'D') -static INLINE void add_if(const env_t *env, int src, int tgt) +static void check_border_list(struct list_head *head) { - if_edge_t edge; - edge_init(&edge, src, tgt); - set_insert(env->graph, &edge, sizeof(edge), IF_EDGE_HASH(&edge)); + border_t *x; + list_for_each_entry(border_t, x, head, list) { + assert(x->magic == BORDER_FOURCC); + } } -static INLINE int are_connected(const env_t *env, int src, int tgt) +static void check_heads(be_chordal_env_t *env) { - if_edge_t edge; - edge_init(&edge, src, tgt); - return set_find(env->graph, &edge, sizeof(edge), IF_EDGE_HASH(&edge)) != NULL; + pmap_entry *ent; + for(ent = pmap_first(env->border_heads); ent; ent = pmap_next(env->border_heads)) { + /* ir_printf("checking border list of block %+F\n", ent->key); */ + check_border_list(ent->value); + } } -static void dump_ifg(ir_graph *irg, set *edges, const char *filename) -{ - static const char *colors[] = { - "coral", - "azure", - "bisque", - "aliceblue", - "blanchedalmond", - "deeppink", - "cornsilk", - "blueviolet", - "floralwhite", - "hotpink", - "gainsboro", - "indianred", - "cornflowerblue", - "ghostwhite", - "lightpink", - "palegoldenrod", - "darkslateblue", - "honeydew", - "ivory", - "lavender", - "mediumvioletred", - "indigo", - "lavenderblush", - "lemonchiffon", - "linen", - "pink", - "mintcream", - "red", - "mediumblue", - "mistyrose", - "mediumslateblue", - "moccasin", - "tomato", - "forestgreen", - "midnightblue", - "navajowhite", - "navy", - "oldlace", - "greenyellow", - "navyblue", - "papayawhip", - "lawngreen", - "powderblue", - "peachpuff", - "seashell", - "snow", - "thistle", - "wheat", - "darkkhaki", - "mintcream", - "khaki", - "Magentas", - "whitesmoke", - "peru", - "palegreen", - "blueviolet", - "rosybrown", - "saddlebrown", - "springgreen", - "darkviolet", - "darkslategray", - "dimgray", - "sienna", - "gray", - "tan", - "gray", - "mediumvioletred", - "lightgray", - "Oranges", - "cyan", - "lightslategray", - "darkorange", - "slategray", - "orangered", - "mediumturquoise", - "violet", - "paleturquoise" - }; - - static const int n_colors = sizeof(colors) / sizeof(colors[0]); - - FILE *f; - - if((f = fopen(filename, "wt")) != NULL) { - long pos; - int n_edges = 0; - if_edge_t *edge; - bitset_t *bs = bitset_malloc(get_graph_node_count(irg)); - - ir_fprintf(f, "graph \"%F\" {\n", irg); - fprintf(f, "\tnode [shape=box,style=filled]\n"); - - for(edge = set_first(edges); edge; edge = set_next(edges)) { - bitset_set(bs, edge->src); - bitset_set(bs, edge->tgt); - n_edges++; - } - - fprintf(f, "\tx [label=\"nodes: %d, edges: %d\"]\n", bitset_popcnt(bs), n_edges); - - bitset_foreach(bs, pos) { - int nr = (int) pos; - ir_node *irn = get_irn_for_graph_nr(irg, nr); - int color = get_irn_color(irn); - - ir_fprintf(f, "\tn%d [label=\"%n\",color=\"%s\"]\n", nr, irn, - color >= 0 && color < n_colors ? colors[color] : "black"); - } - - for(edge = set_first(edges); edge; edge = set_next(edges)) { - fprintf(f, "\tn%d -- n%d [len=5]\n", edge->src, edge->tgt); - } - - fprintf(f, "}\n"); - fclose(f); - - bitset_free(bs); - } - -} - -#endif /* BUILD_GRAPH */ /** * Add an interval border to the list of a block's list @@ -443,7 +90,7 @@ static void dump_ifg(ir_graph *irg, set *edges, const char *filename) * @param is_def Is the border a use or a def. * @return The created border. */ -static INLINE border_t *border_add(env_t *env, struct list_head *head, +static INLINE border_t *border_add(be_chordal_env_t *env, struct list_head *head, ir_node *irn, unsigned step, unsigned pressure, unsigned is_def, unsigned is_real) { @@ -456,6 +103,7 @@ static INLINE border_t *border_add(env_t *env, struct list_head *head, /* also allocate the def and tie it to the use. */ def = obstack_alloc(&env->obst, sizeof(*def)); + memset(def, 0, sizeof(*def)); b->other_end = def; def->other_end = b; @@ -466,10 +114,8 @@ static INLINE border_t *border_add(env_t *env, struct list_head *head, */ set_irn_link(irn, def); -#ifdef DEBUG_libfirm b->magic = BORDER_FOURCC; def->magic = BORDER_FOURCC; -#endif } /* @@ -480,23 +126,32 @@ static INLINE border_t *border_add(env_t *env, struct list_head *head, else { b = get_irn_link(irn); -#ifdef DEBUG_libfirm assert(b && b->magic == BORDER_FOURCC && "Illegal border encountered"); -#endif } - + b->pressure = pressure; b->is_def = is_def; b->is_real = is_real; b->irn = irn; b->step = step; list_add_tail(&b->list, head); - DBG((dbg, LEVEL_5, "\t\t%s adding %n, step: %d\n", - is_def ? "def" : "use", irn, step)); + DBG((env->dbg, LEVEL_5, "\t\t%s adding %+F, step: %d\n", is_def ? "def" : "use", irn, step)); + return b; } +/** + * Check, if an irn is of the register class currently under processing. + * @param env The chordal environment. + * @param irn The node. + * @return 1, if the node is of that register class, 0 if not. + */ +static INLINE int has_reg_class(const be_chordal_env_t *env, const ir_node *irn) +{ + return arch_irn_has_reg_class(env->main_env->arch_env, irn, -1, env->cls); +} + /** * Annotate the register pressure to the nodes and compute * the liveness intervals. @@ -513,35 +168,39 @@ static void pressure(ir_node *block, void *env_ptr) #define border_use(irn, step, real) \ border_add(env, head, irn, step, ++pressure, 0, real) - env_t *env = env_ptr; - bitset_t *live = env->live; + be_chordal_alloc_env_t *alloc_env = env_ptr; + be_chordal_env_t *env = alloc_env->chordal_env; + bitset_t *live = alloc_env->live; + firm_dbg_module_t *dbg = env->dbg; ir_node *irn; int i, n; unsigned step = 0; unsigned pressure = 0; struct list_head *head; - pset *live_in = get_live_in(block); - pset *live_end = get_live_end(block); + pset *live_in = put_live_in(block, pset_new_ptr_default()); + pset *live_end = put_live_end(block, pset_new_ptr_default()); - DBG((dbg, LEVEL_1, "Computing pressure in block %n\n", block)); + DBG((dbg, LEVEL_1, "Computing pressure in block %+F\n", block)); bitset_clear_all(live); /* Set up the border list in the block info */ - head = &get_ra_block_info(block)->border_head; + head = obstack_alloc(&env->obst, sizeof(*head)); INIT_LIST_HEAD(head); + assert(pmap_get(env->border_heads, block) == NULL); + pmap_insert(env->border_heads, block, head); /* * Make final uses of all values live out of the block. - * They are neccessary to build up real intervals. + * They are necessary to build up real intervals. */ for(irn = pset_first(live_end); irn; irn = pset_next(live_end)) { - DBG((dbg, LEVEL_3, "\tMaking live: %n/%d\n", irn, get_irn_graph_nr(irn))); - bitset_set(live, get_irn_graph_nr(irn)); - if(is_allocatable_irn(irn)) + if(has_reg_class(env, irn)) { + DBG((dbg, LEVEL_3, "\tMaking live: %+F/%d\n", irn, get_irn_graph_nr(irn))); + bitset_set(live, get_irn_graph_nr(irn)); border_use(irn, step, 0); + } } - ++step; /* @@ -549,31 +208,18 @@ static void pressure(ir_node *block, void *env_ptr) * relevant for the interval borders. */ sched_foreach_reverse(block, irn) { - DBG((dbg, LEVEL_1, "\tinsn: %n, pressure: %d\n", irn, pressure)); + DBG((dbg, LEVEL_1, "\tinsn: %+F, pressure: %d\n", irn, pressure)); DBG((dbg, LEVEL_2, "\tlive: %b\n", live)); - /* Erase the color of each node encountered. */ - set_irn_color(irn, NO_COLOR); - - /* - * If the node defines a datab value, i.e. something, registers must - * be allocated for, add a new def border to the border list. - */ - if(is_allocatable_irn(irn)) { + /* + * If the node defines some value, which can put into a + * register of the current class, make a border for it. + */ + if(has_reg_class(env, irn)) { int nr = get_irn_graph_nr(irn); bitset_clear(live, nr); border_def(irn, step, 1); - -#ifdef BUILD_GRAPH - { - unsigned long elm; - bitset_foreach(live, elm) { - int live_nr = (int) elm; - add_if(env, nr, live_nr); - } - } -#endif } /* @@ -583,10 +229,10 @@ static void pressure(ir_node *block, void *env_ptr) for(i = 0, n = get_irn_arity(irn); i < n; ++i) { ir_node *op = get_irn_n(irn, i); - if(is_allocatable_irn(op)) { + if(has_reg_class(env, op)) { int nr = get_irn_graph_nr(op); - DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %n\n", i, op)); + DBG((dbg, LEVEL_4, "\t\tpos: %d, use: %+F\n", i, op)); if(!bitset_is_set(live, nr)) { border_use(op, step, 1); @@ -595,7 +241,6 @@ static void pressure(ir_node *block, void *env_ptr) } } } - ++step; } @@ -603,7 +248,7 @@ static void pressure(ir_node *block, void *env_ptr) * Add initial defs for all values live in. */ for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) { - if(is_allocatable_irn(irn)) { + if(has_reg_class(env, irn)) { /* Mark the value live in. */ bitset_set(live, get_irn_graph_nr(irn)); @@ -612,36 +257,35 @@ static void pressure(ir_node *block, void *env_ptr) border_def(irn, step, 0); } } + + + del_pset(live_in); + del_pset(live_end); } static void assign(ir_node *block, void *env_ptr) { - env_t *env = env_ptr; - struct obstack *obst = &env->obst; - bitset_t *live = env->live; - bitset_t *colors = env->colors; - bitset_t *in_colors = env->in_colors; - - /* The used colors will remain on the obstack. */ - bitset_t *used_colors = bitset_obstack_alloc(obst, env->colors_n); - - /* Mark the obstack level and allocate the temporary tmp_colors */ - void *obstack_level = obstack_base(obst); - bitset_t *tmp_colors = bitset_obstack_alloc(obst, env->colors_n); + be_chordal_alloc_env_t *alloc_env = env_ptr; + be_chordal_env_t *env = alloc_env->chordal_env; + firm_dbg_module_t *dbg = env->dbg; + bitset_t *live = alloc_env->live; + bitset_t *colors = alloc_env->colors; + bitset_t *in_colors = alloc_env->in_colors; + const arch_env_t *arch_env = env->main_env->arch_env; const ir_node *irn; border_t *b; - struct list_head *head = &get_ra_block_info(block)->border_head; - pset *live_in = get_live_in(block); + struct list_head *head = get_block_border_head(env, block); + pset *live_in = put_live_in(block, pset_new_ptr_default()); bitset_clear_all(live); bitset_clear_all(colors); bitset_clear_all(in_colors); - DBG((dbg, LEVEL_4, "Assigning colors for block %n\n", block)); + DBG((dbg, LEVEL_4, "Assigning colors for block %+F\n", block)); DBG((dbg, LEVEL_4, "\tusedef chain for block\n")); list_for_each_entry(border_t, b, head, list) { - DBG((dbg, LEVEL_4, "\t%s %n/%d\n", b->is_def ? "def" : "use", + DBG((dbg, LEVEL_4, "\t%s %+F/%d\n", b->is_def ? "def" : "use", b->irn, get_irn_graph_nr(b->irn))); } @@ -651,14 +295,16 @@ static void assign(ir_node *block, void *env_ptr) * allocated before), we have to mark their colors as used also. */ for(irn = pset_first(live_in); irn; irn = pset_next(live_in)) { - if(is_allocatable_irn(irn)) { - int col = get_irn_color(irn); + if(has_reg_class(env, irn)) { + const arch_register_t *reg = arch_get_irn_register(arch_env, irn); + int col; + + assert(reg && "Node must have been assigned a register"); + col = arch_register_get_index(reg); /* Mark the color of the live in value as used. */ - assert(is_color(col) && "Node must have been assigned a color."); bitset_set(colors, col); bitset_set(in_colors, col); - bitset_set(used_colors, col); /* Mark the value live in. */ bitset_set(live, get_irn_graph_nr(irn)); @@ -671,7 +317,7 @@ static void assign(ir_node *block, void *env_ptr) * will work. */ list_for_each_entry_reverse(border_t, b, head, list) { - const ir_node *irn = b->irn; + ir_node *irn = b->irn; int nr = get_irn_graph_nr(irn); /* @@ -679,159 +325,80 @@ static void assign(ir_node *block, void *env_ptr) * color. */ if(b->is_def && !is_live_in(block, irn)) { - ra_node_info_t *ri = get_ra_node_info(irn); + const arch_register_t *reg; int col = NO_COLOR; DBG((dbg, LEVEL_4, "\tcolors in use: %b\n", colors)); - /* - * Try to assign live out values colors which are not used by live - * in values. - */ -#if 0 - if(is_live_out(block, irn)) { - int next_clear; - - bitset_copy(tmp_colors, colors); - bitset_or(tmp_colors, in_colors); - next_clear = bitset_next_clear(tmp_colors, 0); - col = next_clear != -1 ? next_clear : NO_COLOR; + col = bitset_next_clear(colors, 0); + reg = arch_register_for_index(env->cls, col); - DBG((dbg, LEVEL_5, "next clear in only outs %b: %d\n", tmp_colors, col)); - } -#endif - - /* If a color is not yet assigned, do it now. */ - if(!is_color(col)) - col = bitset_next_clear(colors, 0); - - assert(!is_color(get_irn_color(irn)) && "Color must not have assigned"); - assert(!bitset_is_set(live, nr) && "Value def must not have been encountered"); + assert(arch_get_irn_register(arch_env, irn) == NULL && "This node must not have been assigned a register yet"); + assert(!bitset_is_set(live, nr) && "Value's definition must not have been encountered"); bitset_set(colors, col); - bitset_set(used_colors, col); bitset_set(live, nr); - ri->color = col; - - DBG((dbg, LEVEL_1, "\tassigning color %d to %n\n", col, irn)); + arch_set_irn_register(arch_env, irn, reg); + DBG((dbg, LEVEL_1, "\tassigning register %s(%d) to %+F\n", + arch_register_get_name(reg), col, irn)); } /* Clear the color upon a use. */ else if(!b->is_def) { - int col = get_irn_color(irn); + const arch_register_t *reg = arch_get_irn_register(arch_env, irn); + int col; + + assert(reg && "Register must have been assigned"); + col = arch_register_get_index(reg); assert(bitset_is_set(live, nr) && "Cannot have a non live use"); - assert(is_color(col) && "A color must have been assigned"); bitset_clear(colors, col); bitset_clear(live, nr); } } -#ifdef DUMP_INTERVALS - draw_interval_graphs(block, head, &dump_params); -#endif - -#ifdef DUMP_PRESSURE - { - char buf[128]; - FILE *f; - - ir_snprintf(buf, sizeof(buf), "pres_%s_bl_%N.txt", - get_entity_name(get_irg_entity(irg)), block); - - if((f = fopen(buf, "wt")) != NULL) { - sched_foreach_reverse(block, irn) { - if(is_allocatable_irn(irn)) - ir_fprintf(f, "\"%n\" %d %d\n", irn, sched_get_time_step(irn), - get_ra_node_info(irn)->pressure); - - } - fclose(f); - } - } -#endif - - - /* - * Allocate the used colors array in the blocks ra info structure and - * fill it. - */ - get_ra_block_info(block)->used_colors = used_colors; - - /* Free the auxillary data on the obstack. */ - obstack_free(obst, obstack_level); + del_pset(live_in); } -void be_ra_chordal_init(void) +void be_ra_chordal_color(be_chordal_env_t *chordal_env) { - dbg = firm_dbg_register(DBG_BERA); - /* firm_dbg_set_mask(dbg, -1); */ -} + int node_count = get_graph_node_count(chordal_env->irg); + int colors_n = arch_register_class_n_regs(chordal_env->cls); + ir_graph *irg = chordal_env->irg; -void be_ra_chordal(ir_graph *irg) -{ - int node_count = get_graph_node_count(irg); - env_t *env = malloc(sizeof(*env)); + be_chordal_alloc_env_t env; if(get_irg_dom_state(irg) != dom_consistent) compute_doms(irg); - obstack_init(&env->obst); - -#ifdef BUILD_GRAPH - env->graph = new_set(if_edge_cmp, node_count); -#endif - - env->live = bitset_obstack_alloc(&env->obst, node_count); - env->colors = bitset_obstack_alloc(&env->obst, TEST_COLORS); - env->in_colors = bitset_obstack_alloc(&env->obst, TEST_COLORS); - env->colors_n = TEST_COLORS; + env.chordal_env = chordal_env; + env.live = bitset_malloc(node_count); + env.colors = bitset_malloc(colors_n); + env.in_colors = bitset_malloc(colors_n); + env.colors_n = colors_n; /* First, determine the pressure */ - dom_tree_walk_irg(irg, pressure, NULL, env); - - /* Insert probable spills */ - be_ra_chordal_spill(irg); + dom_tree_walk_irg(irg, pressure, NULL, &env); /* Assign the colors */ - dom_tree_walk_irg(irg, assign, NULL, env); + dom_tree_walk_irg(irg, assign, NULL, &env); -#ifdef DUMP_IFG +#ifdef DUMP_INTERVALS { char buf[128]; + plotter_t *plotter; - ir_snprintf(buf, sizeof(buf), "ifg_%s.dot", get_entity_name(get_irg_entity(irg))); - dump_ifg(irg, env->graph, buf); - } -#endif - - set_irg_ra_link(irg, env); -} - -void be_ra_chordal_done(ir_graph *irg) -{ - env_t *env = get_irg_ra_link(irg); + ir_snprintf(buf, sizeof(buf), "ifg_%s_%F.eps", cls->name, irg); + plotter = new_plotter_ps(buf); -#ifdef BUILD_GRAPH - free(env->graph); + draw_interval_tree(&draw_chordal_def_opts, chordal_env, plotter, env->arch_env, cls); + plotter_free(plotter); + } #endif - obstack_free(&env->obst, NULL); - free(env); -} - -int phi_ops_interfere(const ir_node *a, const ir_node *b) -{ -#ifdef BUILD_GRAPH - ir_graph *irg = get_irn_irg(a); - env_t *env = get_irg_ra_link(irg); - - assert(irg == get_irn_irg(b) && "Both nodes must be in the same graph"); - - return are_connected(env, get_irn_graph_nr(a), get_irn_graph_nr(b)); -#else - return values_interfere(a, b); -#endif /* BUILD_GRAPH */ + free(env.live); + free(env.colors); + free(env.in_colors); }