X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyheur2.c;h=f221136fcd4d81c4a92e81b55356d3633c8d8172;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=c2478654efd9104c90047f942ad99771464c0a0f;hpb=1a26f4853c07d1ecd68a097409dd602edfe29eff;p=libfirm diff --git a/ir/be/becopyheur2.c b/ir/be/becopyheur2.c index c2478654e..f221136fc 100644 --- a/ir/be/becopyheur2.c +++ b/ir/be/becopyheur2.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -22,7 +22,6 @@ * @brief More experiments on coalescing. * @author Sebastian Hack * @date 14.04.2006 - * @version $Id$ */ #include "config.h" @@ -40,11 +39,12 @@ #include "debug.h" #include "bitfiddle.h" -#include "irphase_t.h" #include "irgraph_t.h" #include "irnode_t.h" #include "irprintf.h" +#include "util.h" #include "irtools.h" +#include "irnodemap.h" #include "bemodule.h" #include "beabi.h" @@ -95,13 +95,11 @@ static const lc_opt_table_entry_t options[] = { #define INFEASIBLE(cost) ((cost) == INT_MAX) -static be_ifg_dump_dot_cb_t ifg_dot_cb; - typedef unsigned col_t; -typedef struct _co2_irn_t co2_irn_t; -typedef struct _co2_cloud_t co2_cloud_t; -typedef struct _co2_cloud_irn_t co2_cloud_irn_t; +typedef struct co2_irn_t co2_irn_t; +typedef struct co2_cloud_t co2_cloud_t; +typedef struct co2_cloud_irn_t co2_cloud_irn_t; typedef struct { col_t col; @@ -109,9 +107,10 @@ typedef struct { } col_cost_pair_t; typedef struct { - ir_phase ph; + ir_nodemap map; + struct obstack obst; copy_opt_t *co; - bitset_t *ignore_regs; + bitset_t *allocatable_regs; co2_irn_t *touched; int visited; int n_regs; @@ -119,13 +118,13 @@ typedef struct { DEBUG_ONLY(firm_dbg_module_t *dbg;) } co2_t; -struct _co2_irn_t { +struct co2_irn_t { const ir_node *irn; affinity_node_t *aff; co2_irn_t *touched_next; col_t tmp_col; col_t orig_col; - int last_color_change; + int last_color_change; bitset_t *adm_cache; unsigned fixed : 1; unsigned tmp_fixed : 1; @@ -133,8 +132,8 @@ struct _co2_irn_t { struct list_head changed_list; }; -struct _co2_cloud_irn_t { - struct _co2_irn_t inh; +struct co2_cloud_irn_t { + struct co2_irn_t inh; co2_cloud_t *cloud; int visited; int index; @@ -151,7 +150,7 @@ struct _co2_cloud_irn_t { struct list_head mst_list; }; -struct _co2_cloud_t { +struct co2_cloud_t { co2_t *env; struct obstack obst; int costs; @@ -161,7 +160,7 @@ struct _co2_cloud_t { int n_memb; int n_constr; int max_degree; - int ticks; + int ticks; double freedom; co2_cloud_irn_t *master; co2_cloud_irn_t *mst_root; @@ -177,30 +176,42 @@ typedef struct { #define FRONT_BASE(ci,col) ((ci)->fronts + col * (ci)->mst_n_childs) -#define get_co2_irn(co2, irn) ((co2_irn_t *) phase_get_or_set_irn_data(&co2->ph, irn)) -#define get_co2_cloud_irn(co2, irn) ((co2_cloud_irn_t *) phase_get_or_set_irn_data(&co2->ph, irn)) +static co2_irn_t *get_co2_irn(co2_t *env, const ir_node *node) +{ + co2_irn_t *ci = ir_nodemap_get(&env->map, node); + if (ci == NULL) { + ci = OALLOCZ(&env->obst, co2_irn_t); + + INIT_LIST_HEAD(&ci->changed_list); + ci->touched_next = env->touched; + ci->orig_col = get_irn_col(node); + env->touched = ci; + ci->irn = node; + ci->aff = NULL; + + ir_nodemap_insert(&env->map, node, ci); + } + return ci; +} -static void *co2_irn_init(ir_phase *ph, const ir_node *irn, void *data) +static co2_cloud_irn_t *get_co2_cloud_irn(co2_t *env, const ir_node *node) { - co2_t *env = (co2_t *) ph; - affinity_node_t *a = get_affinity_info(env->co, irn); - size_t size = a ? sizeof(co2_cloud_irn_t) : sizeof(co2_irn_t); - co2_irn_t *ci = data ? data : phase_alloc(ph, size); - - memset(ci, 0, size); - INIT_LIST_HEAD(&ci->changed_list); - ci->touched_next = env->touched; - ci->orig_col = get_irn_col(irn); - env->touched = ci; - ci->irn = irn; - ci->aff = a; + co2_cloud_irn_t *ci = ir_nodemap_get(&env->map, node); + if (ci == NULL) { + ci = OALLOCZ(&env->obst, co2_cloud_irn_t); - if (a) { - co2_cloud_irn_t *cci = (co2_cloud_irn_t *) ci; - INIT_LIST_HEAD(&cci->cloud_list); - cci->mst_parent = cci; - } + INIT_LIST_HEAD(&ci->inh.changed_list); + ci->inh.touched_next = env->touched; + ci->inh.orig_col = get_irn_col(node); + env->touched = &ci->inh; + ci->inh.irn = node; + ci->inh.aff = get_affinity_info(env->co, node); + + INIT_LIST_HEAD(&ci->cloud_list); + ci->mst_parent = ci; + ir_nodemap_insert(&env->map, node, ci); + } return ci; } @@ -208,8 +219,8 @@ static void *co2_irn_init(ir_phase *ph, const ir_node *irn, void *data) static int cmp_clouds_gt(const void *a, const void *b) { - const co2_cloud_t * const *p = a; - const co2_cloud_t * const *q = b; + const co2_cloud_t * const *p = (const co2_cloud_t*const*)a; + const co2_cloud_t * const *q = (const co2_cloud_t*const*)b; double c = CLOUD_WEIGHT(*p); double d = CLOUD_WEIGHT(*q); return QSORT_CMP(d, c); @@ -221,17 +232,17 @@ static int cmp_clouds_gt(const void *a, const void *b) */ static int col_cost_pair_lt(const void *a, const void *b) { - const col_cost_pair_t *p = a; - const col_cost_pair_t *q = b; + const col_cost_pair_t *p = (const col_cost_pair_t*)a; + const col_cost_pair_t *q = (const col_cost_pair_t*)b; int c = p->costs; int d = q->costs; return QSORT_CMP(c, d); } -int cmp_edges(const void *a, const void *b) +static int cmp_edges(const void *a, const void *b) { - const edge_t *p = a; - const edge_t *q = b; + const edge_t *p = (const edge_t*)a; + const edge_t *q = (const edge_t*)b; return QSORT_CMP(q->costs, p->costs); } @@ -251,8 +262,8 @@ static inline bitset_t *get_adm(co2_t *env, co2_irn_t *ci) { if (ci->adm_cache == NULL) { const arch_register_req_t *req; - ci->adm_cache = bitset_obstack_alloc(phase_obst(&env->ph), env->n_regs); - req = arch_get_register_req_out(ci->irn); + ci->adm_cache = bitset_obstack_alloc(&env->obst, env->n_regs); + req = arch_get_irn_register_req(ci->irn); if (arch_register_req_is(req, limited)) { int i, n; @@ -264,8 +275,7 @@ static inline bitset_t *get_adm(co2_t *env, co2_irn_t *ci) } ci->is_constrained = 1; } else { - bitset_copy(ci->adm_cache, env->ignore_regs); - bitset_flip_all(ci->adm_cache); + bitset_copy(ci->adm_cache, env->allocatable_regs); } } @@ -293,14 +303,14 @@ static inline int is_constrained(co2_t *env, co2_irn_t *ci) static void incur_constraint_costs(co2_t *env, const ir_node *irn, col_cost_pair_t *col_costs, int costs) { - const arch_register_req_t *req = arch_get_register_req_out(irn); + const arch_register_req_t *req = arch_get_irn_register_req(irn); if (arch_register_req_is(req, limited)) { unsigned n_regs = env->co->cls->n_regs; unsigned n_constr = 0; unsigned i; - n_constr = rbitset_popcnt(req->limited, n_regs); + n_constr = rbitset_popcount(req->limited, n_regs); for (i = 0; i < n_regs; ++i) { if (rbitset_is_set(req->limited, i)) { col_costs[i].costs = add_saturated(col_costs[i].costs, costs / n_constr); @@ -327,9 +337,9 @@ static void determine_color_costs(co2_t *env, co2_irn_t *ci, col_cost_pair_t *co bitset_t *forb = bitset_alloca(n_regs); affinity_node_t *a = ci->aff; - bitset_pos_t elm; + size_t elm; const ir_node *pos; - void *it; + neighbours_iter_t it; int i; /* Put all forbidden colors into the aux bitset. */ @@ -354,8 +364,7 @@ static void determine_color_costs(co2_t *env, co2_irn_t *ci, col_cost_pair_t *co } } - it = be_ifg_neighbours_iter_alloca(ifg); - be_ifg_foreach_neighbour(ifg, it, irn, pos) { + be_ifg_foreach_neighbour(ifg, &it, irn, pos) { col_t col = get_col(env, pos); if (color_is_fix(env, pos)) { col_costs[col].costs = INT_MAX; @@ -365,7 +374,7 @@ static void determine_color_costs(co2_t *env, co2_irn_t *ci, col_cost_pair_t *co col_costs[col].costs = add_saturated(col_costs[col].costs, 8 * be_ifg_degree(ifg, pos)); } } - be_ifg_neighbours_break(ifg, it); + be_ifg_neighbours_break(&it); /* Set the costs to infinity for each color which is not allowed at this node. */ bitset_foreach(forb, elm) { @@ -430,7 +439,7 @@ static int recolor(co2_t *env, const ir_node *irn, col_cost_pair_t *col_list, st struct list_head changed; const ir_node *n; - void *it; + neighbours_iter_t it; DBG((env->dbg, LEVEL_3, "\t\t%2{firm:indent}trying color %d(%d) on %+F\n", depth, tgt_col, costs, irn)); @@ -452,8 +461,7 @@ static int recolor(co2_t *env, const ir_node *irn, col_cost_pair_t *col_list, st INIT_LIST_HEAD(&changed); list_add(&ci->changed_list, &changed); - it = be_ifg_neighbours_iter_alloca(ifg); - be_ifg_foreach_neighbour(ifg, it, irn, n) { + be_ifg_foreach_neighbour(ifg, &it, irn, n) { /* try to re-color the neighbor if it has the target color. */ if (get_col(env, n) == tgt_col) { @@ -472,7 +480,7 @@ static int recolor(co2_t *env, const ir_node *irn, col_cost_pair_t *col_list, st break; } } - be_ifg_neighbours_break(ifg, it); + be_ifg_neighbours_break(&it); /* We managed to assign the target color to all neighbors, so from the perspective @@ -614,9 +622,9 @@ static void node_color_badness(co2_cloud_irn_t *ci, int *badness) be_ifg_t *ifg = env->co->cenv->ifg; bitset_t *bs = bitset_alloca(n_regs); - bitset_pos_t elm; + size_t elm; const ir_node *irn; - void *it; + neighbours_iter_t it; admissible_colors(env, &ci->inh, bs); bitset_flip_all(bs); @@ -624,13 +632,12 @@ static void node_color_badness(co2_cloud_irn_t *ci, int *badness) badness[elm] = ci->costs; /* Use constrained/fixed interfering neighbors to influence the color badness */ - it = be_ifg_neighbours_iter_alloca(ifg); - be_ifg_foreach_neighbour(ifg, it, ir->irn, irn) { + be_ifg_foreach_neighbour(ifg, &it, ir->irn, irn) { co2_irn_t *ni = get_co2_irn(env, irn); admissible_colors(env, ni, bs); - if (bitset_popcnt(bs) == 1) { - bitset_pos_t c = bitset_next_set(bs, 0); + if (bitset_popcount(bs) == 1) { + size_t c = bitset_next_set(bs, 0); badness[c] += ci->costs; } @@ -639,7 +646,7 @@ static void node_color_badness(co2_cloud_irn_t *ci, int *badness) badness[c] += ci->costs; } } - be_ifg_neighbours_break(ifg, it); + be_ifg_neighbours_break(&it); } /** @@ -796,7 +803,7 @@ static void populate_cloud(co2_t *env, co2_cloud_t *cloud, affinity_node_t *a, i ci->costs = costs; cloud->costs += costs; cloud->n_constr += is_constrained(env, &ci->inh); - cloud->freedom += bitset_popcnt(get_adm(env, &ci->inh)); + cloud->freedom += bitset_popcount(get_adm(env, &ci->inh)); cloud->max_degree = MAX(cloud->max_degree, ci->inh.aff->degree); cloud->n_memb++; @@ -816,7 +823,7 @@ static void populate_cloud(co2_t *env, co2_cloud_t *cloud, affinity_node_t *a, i static co2_cloud_t *new_cloud(co2_t *env, affinity_node_t *a) { - co2_cloud_t *cloud = phase_alloc(&env->ph, sizeof(cloud[0])); + co2_cloud_t *cloud = OALLOC(&env->obst, co2_cloud_t); co2_cloud_irn_t *ci; int i; @@ -832,7 +839,7 @@ static co2_cloud_t *new_cloud(co2_t *env, affinity_node_t *a) cloud->freedom = (cloud->n_memb * env->n_regs) / cloud->freedom; /* Also allocate space for the node sequence and compute that sequence. */ - cloud->seq = phase_alloc(&env->ph, cloud->n_memb * sizeof(cloud->seq[0])); + cloud->seq = OALLOCN(&env->obst, co2_cloud_irn_t*, cloud->n_memb); i = 0; list_for_each_entry(co2_cloud_irn_t, ci, &cloud->members_head, cloud_list) { @@ -848,17 +855,16 @@ static void apply_coloring(co2_cloud_irn_t *ci, col_t col, int depth) { const ir_node *irn = ci->inh.irn; int *front = FRONT_BASE(ci, col); - int i, ok; + int i; struct list_head changed; INIT_LIST_HEAD(&changed); DBG((ci->cloud->env->dbg, LEVEL_2, "%2{firm:indent}setting %+F to %d\n", depth, irn, col)); - ok = change_color_single(ci->cloud->env, irn, col, &changed, depth); - // assert(ok && "Color changing may not fail while committing the coloring"); + change_color_single(ci->cloud->env, irn, col, &changed, depth); materialize_coloring(&changed); - for (i = 0; i < ci->mst_n_childs; ++i) { + for (i = 0; i < ci->mst_n_childs; ++i) { apply_coloring(ci->mst_childs[i], front[i], depth + 1); } } @@ -901,7 +907,7 @@ static void process_cloud(co2_cloud_t *cloud) } } } - edges = obstack_finish(&cloud->obst); + edges = (edge_t*)obstack_finish(&cloud->obst); qsort(edges, n_edges, sizeof(edges[0]), cmp_edges); /* Compute the maximum spanning tree using Kruskal/Union-Find */ @@ -931,7 +937,7 @@ static void process_cloud(co2_cloud_t *cloud) cloud->mst_root = cloud->master; q = new_pdeq1(cloud->master); while (!pdeq_empty(q)) { - co2_cloud_irn_t *ci = pdeq_getl(q); + co2_cloud_irn_t *ci = (co2_cloud_irn_t*)pdeq_getl(q); int ofs = ci->index * cloud->n_memb; int end = ofs + cloud->n_memb; int i; @@ -957,7 +963,7 @@ static void process_cloud(co2_cloud_t *cloud) } obstack_ptr_grow(&cloud->obst, NULL); - ci->mst_childs = obstack_finish(&cloud->obst); + ci->mst_childs = (co2_cloud_irn_t**)obstack_finish(&cloud->obst); } del_pdeq(q); free(mst_edges); @@ -965,7 +971,7 @@ static void process_cloud(co2_cloud_t *cloud) DBG((env->dbg, LEVEL_3, "mst:\n")); for (i = 0; i < cloud->n_memb; ++i) { - DEBUG_ONLY(co2_cloud_irn_t *ci = cloud->seq[i]); + DEBUG_ONLY(co2_cloud_irn_t *ci = cloud->seq[i];) DBG((env->dbg, LEVEL_3, "\t%+F -> %+F\n", ci->inh.irn, ci->mst_parent->inh.irn)); } @@ -1018,6 +1024,16 @@ static int cloud_costs(co2_cloud_t *cloud) return costs / 2; } +static void writeback_colors(co2_t *env) +{ + co2_irn_t *irn; + + for (irn = env->touched; irn; irn = irn->touched_next) { + const arch_register_t *reg = arch_register_for_index(env->co->cls, irn->orig_col); + arch_set_irn_register((ir_node*)irn->irn, reg); + } +} + static void process(co2_t *env) { affinity_node_t *a; @@ -1053,19 +1069,6 @@ static void process(co2_t *env) all_costs += clouds[i]->costs; final_costs += cloud_costs(clouds[i]); - - /* Dump the IFG if the user demanded it. */ - if (dump_flags & DUMP_CLOUD) { - char buf[256]; - FILE *f; - - ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_cloud_%d.dot", env->co->irg, env->co->cls->name, i); - f = fopen(buf, "wt"); - if (f != NULL) { - be_ifg_dump_dot(env->co->cenv->ifg, env->co->irg, f, &ifg_dot_cb, env); - fclose(f); - } - } } DB((env->dbg, LEVEL_1, "all costs: %d, init costs: %d, final costs: %d\n", all_costs, init_costs, final_costs)); @@ -1073,198 +1076,30 @@ static void process(co2_t *env) xfree(clouds); } -static void writeback_colors(co2_t *env) -{ - co2_irn_t *irn; - - for (irn = env->touched; irn; irn = irn->touched_next) { - const arch_register_t *reg = arch_register_for_index(env->co->cls, irn->orig_col); - arch_set_irn_register((ir_node*)irn->irn, reg); - } -} - - -/* - ___ _____ ____ ____ ___ _____ ____ _ - |_ _| ___/ ___| | _ \ / _ \_ _| | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ - | || |_ | | _ | | | | | | || | | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | - | || _|| |_| | | |_| | |_| || | | |_| | |_| | | | | | | |_) | | | | | (_| | - |___|_| \____| |____/ \___/ |_| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | - |_| |___/ -*/ - -static const char *get_dot_color_name(size_t col) -{ - static const char *const names[] = { - "blue", - "red", - "green", - "yellow", - "cyan", - "magenta", - "orange", - "chocolate", - "beige", - "navy", - "darkgreen", - "darkred", - "lightPink", - "chartreuse", - "lightskyblue", - "linen", - "pink", - "lightslateblue", - "mintcream", - "red", - "darkolivegreen", - "mediumblue", - "mistyrose", - "salmon", - "darkseagreen", - "mediumslateblue" - "moccasin", - "tomato", - "forestgreen", - "darkturquoise", - "palevioletred" - }; - - return col < (sizeof(names)/sizeof(names[0])) ? names[col] : "white"; -} - -static const char *get_dot_shape_name(co2_irn_t *ci) -{ - const arch_register_req_t *req = arch_get_register_req_out(ci->irn); - - if (arch_register_req_is(req, limited)) - return "diamond"; - - if (ci->fixed) - return "rectangle"; - - if (ci->tmp_fixed) - return "hexagon"; - - return "ellipse"; -} - -static void ifg_dump_graph_attr(FILE *f, void *self) -{ - (void) self; - fprintf(f, "overlay=false"); -} - -static int ifg_is_dump_node(void *self, ir_node *irn) -{ - const arch_register_req_t *req = arch_get_register_req_out(irn); - (void)self; - return !(req->type & arch_register_req_type_ignore); -} - -static void ifg_dump_node_attr(FILE *f, void *self, ir_node *irn) -{ - co2_t *env = self; - co2_irn_t *ci = get_co2_irn(env, irn); - int peri = 1; - - char buf[128] = ""; - - if (ci->aff) { - co2_cloud_irn_t *cci = (void *) ci; - if (cci->cloud && cci->cloud->mst_root == cci) - peri = 2; - - if (cci->cloud && cci->cloud->mst_root) - ir_snprintf(buf, sizeof(buf), "%+F", cci->cloud->mst_root->inh.irn); - } - - ir_fprintf(f, "label=\"%+F%s\" style=filled peripheries=%d color=%s shape=%s", irn, buf, peri, - get_dot_color_name(get_col(env, irn)), get_dot_shape_name(ci)); -} - -static void ifg_dump_at_end(FILE *file, void *self) -{ - co2_t *env = self; - affinity_node_t *a; - - co_gs_foreach_aff_node(env->co, a) { - co2_cloud_irn_t *ai = get_co2_cloud_irn(env, a->irn); - int idx = get_irn_idx(a->irn); - neighb_t *n; - - if (ai->mst_parent != ai) - fprintf(file, "\tn%d -- n%d [style=dotted color=blue arrowhead=normal];\n", idx, get_irn_idx(ai->mst_parent->inh.irn)); - - co_gs_foreach_neighb(a, n) { - int nidx = get_irn_idx(n->irn); - co2_cloud_irn_t *ci = get_co2_cloud_irn(env, n->irn); - - if (idx < nidx) { - const char *color = get_col(env, a->irn) == get_col(env, n->irn) ? "black" : "red"; - const char *arr = "arrowhead=dot arrowtail=dot"; - - if (ci->mst_parent == ai) - arr = "arrowtail=normal"; - else if (ai->mst_parent == ci) - arr = "arrowhead=normal"; - - fprintf(file, "\tn%d -- n%d [label=\"%d\" %s style=dashed color=%s weight=0.01];\n", idx, nidx, n->costs, arr, color); - } - } - } -} - - -static be_ifg_dump_dot_cb_t ifg_dot_cb = { - ifg_is_dump_node, - ifg_dump_graph_attr, - ifg_dump_node_attr, - NULL, - NULL, - ifg_dump_at_end -}; - -int co_solve_heuristic_new(copy_opt_t *co) +static int co_solve_heuristic_new(copy_opt_t *co) { - char buf[256]; co2_t env; - FILE *f; - phase_init(&env.ph, "co2", co->cenv->birg->irg, PHASE_DEFAULT_GROWTH, co2_irn_init, NULL); + ir_nodemap_init(&env.map, co->irg); + obstack_init(&env.obst); env.touched = NULL; env.visited = 0; env.co = co; env.n_regs = co->cls->n_regs; - env.ignore_regs = bitset_alloca(co->cls->n_regs); - be_put_ignore_regs(co->cenv->birg, co->cls, env.ignore_regs); + env.allocatable_regs = bitset_alloca(co->cls->n_regs); + be_put_allocatable_regs(co->cenv->irg, co->cls, env.allocatable_regs); FIRM_DBG_REGISTER(env.dbg, "firm.be.co2"); INIT_LIST_HEAD(&env.cloud_head); - if (dump_flags & DUMP_BEFORE) { - ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_before.dot", co->irg, co->cls->name); - f = fopen(buf, "wt"); - if (f != NULL) { - be_ifg_dump_dot(co->cenv->ifg, co->irg, f, &ifg_dot_cb, &env); - fclose(f); - } - } - process(&env); - if (dump_flags & DUMP_AFTER) { - ir_snprintf(buf, sizeof(buf), "ifg_%F_%s_after.dot", co->irg, co->cls->name); - f = fopen(buf, "wt"); - if (f != NULL) { - be_ifg_dump_dot(co->cenv->ifg, co->irg, f, &ifg_dot_cb, &env); - fclose(f); - } - } - writeback_colors(&env); - phase_free(&env.ph); + obstack_free(&env.obst, NULL); + ir_nodemap_destroy(&env.map); return 0; } +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur2) void be_init_copyheur2(void) { lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); @@ -1279,5 +1114,3 @@ void be_init_copyheur2(void) lc_opt_add_table(co2_grp, options); be_register_copyopt("heur2", ©heur); } - -BE_REGISTER_MODULE_CONSTRUCTOR(be_init_copyheur2);