* @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig,
* Sebastian Buchwald
* @date 04.05.2005
- * @version $Id$
*
* The problem: Given a value and a set of "copies" that are known to
* represent the same abstract value, rewire all usages of the original value
#include "ircons.h"
#include "iredges_t.h"
-#include "irphase_t.h"
+#include "statev_t.h"
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;)
ir_node *block);
struct constr_info {
- bool is_definition;
- bool is_use;
- bool already_processed;
+ bool is_definition : 1;
+ bool is_use : 1;
+ bool already_processed : 1;
union {
/* Since we only consider scheduled nodes,
* this points to the real definition (e.g. a Proj). */
/* Last definition of a block. */
ir_node *last_definition;
- };
+ } u;
};
typedef struct constr_info constr_info;
/**
* @return Whether the block contains a definition.
*/
-static inline bool has_definition(be_ssa_construction_env_t *env, ir_node *block)
+static bool has_definition(const ir_node *block)
{
- (void)env;
-
return irn_visited(block);
}
+static constr_info *get_or_set_info(be_ssa_construction_env_t *env,
+ const ir_node *node)
+{
+ constr_info *info = ir_nodemap_get(constr_info, &env->infos, node);
+ if (info == NULL) {
+ info = OALLOCZ(&env->obst, constr_info);
+ ir_nodemap_insert(&env->infos, node, info);
+ }
+ return info;
+}
+
+static constr_info *get_info(const be_ssa_construction_env_t *env,
+ const ir_node *node)
+{
+ return ir_nodemap_get(constr_info, &env->infos, node);
+}
+
/**
* @return Whether the block contains a use.
*/
static inline bool has_use(be_ssa_construction_env_t *env, ir_node *block)
{
- constr_info *info = phase_get_or_set_irn_data(env->phase, block);
-
+ constr_info *info = get_or_set_info(env, block);
return info->is_use;
}
/**
* @return Whether the node is a definition.
*/
-static inline bool is_definition(be_ssa_construction_env_t *env, ir_node *node)
+static bool is_definition(be_ssa_construction_env_t *env, ir_node *node)
{
- constr_info *info = phase_get_irn_data(env->phase, node);
-
- return info && info->is_definition;
+ constr_info *info = get_info(env, node);
+ return info != NULL && info->is_definition;
}
/**
* @return Whether the node is a use.
*/
-static inline bool is_use(const be_ssa_construction_env_t *env, ir_node *node)
+static bool is_use(const be_ssa_construction_env_t *env, ir_node *node)
{
- constr_info *info = phase_get_irn_data(env->phase, node);
-
- return info && info->is_use;
+ constr_info *info = get_info(env, node);
+ return info != NULL && info->is_use;
}
/**
static void introduce_definition(be_ssa_construction_env_t *env, ir_node *def)
{
ir_node *block = get_nodes_block(def);
- ir_phase *phase = env->phase;
- constr_info *def_info = phase_get_or_set_irn_data(phase, def);
+ constr_info *def_info = get_or_set_info(env, def);
ir_node *skip = skip_Proj(def);
- constr_info *skip_info = phase_get_or_set_irn_data(phase, skip);
- constr_info *block_info = phase_get_or_set_irn_data(phase, block);
+ constr_info *skip_info = get_or_set_info(env, skip);
+ constr_info *block_info = get_or_set_info(env, block);
DBG((dbg, LEVEL_2, "\tintroducing definition %+F in %+F\n", def, block));
def_info->is_definition = true;
skip_info->is_definition = true;
- skip_info->definition = def;
+ skip_info->u.definition = def;
// Set the last definition if we only introduce one definition for the block
- if (has_definition(env, block)) {
+ if (has_definition(block)) {
assert(!block_info->already_processed);
- block_info->last_definition = NULL;
- }
- else {
+ block_info->u.last_definition = NULL;
+ } else {
mark_irn_visited(block);
- block_info->last_definition = def;
+ block_info->u.last_definition = def;
}
}
static void introduce_use(be_ssa_construction_env_t *env, ir_node *use)
{
ir_node *block = get_nodes_block(use);
- ir_phase *phase = env->phase;
- constr_info *info = phase_get_or_set_irn_data(phase, use);
- constr_info *block_info = phase_get_or_set_irn_data(phase, block);
+ constr_info *info = get_or_set_info(env, use);
+ constr_info *block_info = get_or_set_info(env, block);
DBG((dbg, LEVEL_2, "\tintroducing use %+F in %+F\n", use, block));
* frontier to the block itself.
*/
static void mark_iterated_dominance_frontiers(
- const be_ssa_construction_env_t *env)
+ const be_ssa_construction_env_t *env)
{
stat_ev_cnt_decl(blocks);
DBG((dbg, LEVEL_3, "Dominance Frontier:"));
while (!waitq_empty(env->worklist)) {
int i;
ir_node *block = (ir_node*)waitq_get(env->worklist);
- ir_node **domfront = be_get_dominance_frontier(env->domfronts, block);
+ ir_node **domfront = ir_get_dominance_frontier(block);
int domfront_len = ARR_LEN(domfront);
for (i = 0; i < domfront_len; ++i) {
for (i = 0; i < n_preds; ++i) {
ins[i] = dummy;
}
- phi = be_new_Phi(block, n_preds, ins, env->mode, env->phi_cls);
+ phi = be_new_Phi(block, n_preds, ins, env->mode, env->phi_req);
sched_add_after(block, phi);
- if (env->new_phis != NULL) {
- ARR_APP1(ir_node*, env->new_phis, phi);
- }
+ ARR_APP1(ir_node*, env->new_phis, phi);
DBG((dbg, LEVEL_2, "\tcreating phi %+F in %+F\n", phi, block));
introduce_definition(env, phi);
*/
static void set_operands(be_ssa_construction_env_t *env, ir_node *use, ir_node *def)
{
- constr_info *info = phase_get_irn_data(env->phase, use);
+ constr_info *info = get_info(env, use);
int arity = get_irn_arity(use);
int i;
*/
static void process_block(be_ssa_construction_env_t *env, ir_node *block)
{
- ir_node *node;
ir_node *def = NULL;
- constr_info *block_info = phase_get_or_set_irn_data(env->phase, block);
+ constr_info *block_info = get_or_set_info(env, block);
- assert(has_definition(env, block));
+ assert(has_definition(block));
assert(!block_info->already_processed && "Block already processed");
DBG((dbg, LEVEL_3, "\tprocessing block %+F\n", block));
}
if (is_definition(env, node)) {
- constr_info *info = phase_get_irn_data(env->phase, node);
- def = info->definition;
+ constr_info *info = get_info(env, node);
+ def = info->u.definition;
DBG((dbg, LEVEL_3, "\t...found definition %+F\n", def));
}
}
block_info->already_processed = true;
- block_info->last_definition = def;
+ block_info->u.last_definition = def;
}
/**
static ir_node *search_def_end_of_block(be_ssa_construction_env_t *env,
ir_node *block)
{
- constr_info *block_info = phase_get_or_set_irn_data(env->phase, block);
- ir_node *last_definition = block_info->last_definition;
+ constr_info *block_info = get_or_set_info(env, block);
+ ir_node *last_definition = block_info->u.last_definition;
if (last_definition != NULL)
return last_definition;
- if (has_definition(env, block)) {
+ if (has_definition(block)) {
if (has_use(env, block)) {
if (!block_info->already_processed) {
process_block(env, block);
}
}
else {
- ir_node *def = NULL;
-
/* Search the last definition of the block. */
sched_foreach_reverse(block, def) {
if (is_definition(env, def)) {
- constr_info *info = phase_get_irn_data(env->phase, def);
- def = info->definition;
- DBG((dbg, LEVEL_3, "\t...found definition %+F\n", def));
-
+ constr_info *info = get_info(env, def);
+ DBG((dbg, LEVEL_3, "\t...found definition %+F\n", info->u.definition));
+ block_info->u.last_definition = info->u.definition;
break;
}
}
- assert(def && "No definition found");
-
- block_info->last_definition = def;
+ assert(block_info->u.last_definition && "No definition found");
}
- return block_info->last_definition;
+ return block_info->u.last_definition;
} else if (Block_block_visited(block)) {
ir_node *phi = insert_dummy_phi(env, block);
- block_info->last_definition = phi;
+ block_info->u.last_definition = phi;
return phi;
} else {
ir_node *def = get_def_at_idom(env, block);
- block_info->last_definition = def;
+ block_info->u.last_definition = def;
return def;
}
static void search_def_at_block(be_ssa_construction_env_t *env, ir_node *use)
{
ir_node *block = get_nodes_block(use);
- constr_info *block_info = phase_get_or_set_irn_data(env->phase, block);
+ constr_info *block_info = get_or_set_info(env, block);
if (block_info->already_processed)
return;
- if (has_definition(env, block)) {
+ if (has_definition(block)) {
process_block(env, block);
} else if (Block_block_visited(block)) {
ir_node *phi = insert_dummy_phi(env, block);
}
}
-static void *init_constr_info(ir_phase *phase, const ir_node *node)
-{
- constr_info *info = phase_alloc(phase, sizeof(constr_info));
- (void)node;
-
- info->is_definition = false;
- info->is_use = false;
- info->already_processed = false;
- info->definition = NULL;
-
- return info;
-}
-
void be_ssa_construction_init(be_ssa_construction_env_t *env, ir_graph *irg)
{
ir_node *sb = get_irg_start_block(irg);
int n_blocks = get_Block_dom_max_subtree_pre_num(sb);
- stat_ev_ctx_push_fobj("bessaconstr", irg);
+ stat_ev_ctx_push_fmt("bessaconstr", "%+F", irg);
stat_ev_tim_push();
(void) n_blocks;
stat_ev_dbl("bessaconstr_n_blocks", n_blocks);
memset(env, 0, sizeof(env[0]));
- be_assure_dom_front(irg);
env->irg = irg;
- env->domfronts = be_get_irg_dom_front(irg);
env->new_phis = NEW_ARR_F(ir_node*, 0);
env->worklist = new_waitq();
- env->phase = new_phase(irg, init_constr_info);
+ ir_nodemap_init(&env->infos, irg);
+ obstack_init(&env->obst);
+
+ assure_irg_properties(env->irg,
+ IR_GRAPH_PROPERTY_CONSISTENT_DOMINANCE_FRONTIERS);
ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED
| IR_RESOURCE_BLOCK_VISITED | IR_RESOURCE_IRN_LINK);
void be_ssa_construction_destroy(be_ssa_construction_env_t *env)
{
stat_ev_int("bessaconstr_phis", ARR_LEN(env->new_phis));
- phase_free(env->phase);
+ obstack_free(&env->obst, NULL);
+ ir_nodemap_destroy(&env->infos);
del_waitq(env->worklist);
DEL_ARR_F(env->new_phis);
stat_ev_ctx_pop("bessaconstr");
}
+static void determine_phi_req(be_ssa_construction_env_t *env, ir_node *value)
+{
+ const arch_register_req_t *req = arch_get_irn_register_req(value);
+ env->mode = get_irn_mode(value);
+ if (req->width == 1) {
+ env->phi_req = req->cls->class_req;
+ } else {
+ /* construct a new register req... */
+ ir_graph *irg = get_irn_irg(value);
+ struct obstack *obst = be_get_be_obst(irg);
+ arch_register_req_t *new_req = OALLOCZ(obst, arch_register_req_t);
+ new_req->cls = req->cls;
+ new_req->type = req->type & arch_register_req_type_aligned;
+ new_req->width = req->width;
+ env->phi_req = new_req;
+ }
+}
+
void be_ssa_construction_add_copy(be_ssa_construction_env_t *env,
ir_node *copy)
{
assert(env->iterated_domfront_calculated == 0);
if (env->mode == NULL) {
- env->mode = get_irn_mode(copy);
- env->phi_cls = arch_get_irn_reg_class_out(copy);
+ determine_phi_req(env, copy);
} else {
assert(env->mode == get_irn_mode(copy));
}
block = get_nodes_block(copy);
- if (!has_definition(env, block)) {
+ if (!has_definition(block)) {
waitq_put(env->worklist, block);
}
introduce_definition(env, copy);
assert(env->iterated_domfront_calculated == 0);
if (env->mode == NULL) {
- env->mode = get_irn_mode(copies[0]);
- env->phi_cls = arch_get_irn_reg_class_out(copies[0]);
+ determine_phi_req(env, copies[0]);
}
for (i = 0; i < copies_len; ++i) {
ir_node *block = get_nodes_block(copy);
assert(env->mode == get_irn_mode(copy));
- if (!has_definition(env, block)) {
+ if (!has_definition(block)) {
waitq_put(env->worklist, block);
}
introduce_definition(env, copy);
*/
static void fix_phi_arguments(be_ssa_construction_env_t *env, ir_node *phi)
{
- constr_info *info = phase_get_irn_data(env->phase, phi);
+ constr_info *info = get_info(env, phi);
ir_node *block = get_nodes_block(phi);
int i;
int n_preds = get_Block_n_cfgpreds(block);
stat_ev_tim_push();
for (i = 0; i < nodes_len; ++i) {
- const ir_edge_t *edge, *next;
ir_node *value = nodes[i];
DBG((dbg, LEVEL_3, "\tfixing users of %+F\n", value));
introduce_definition(env, value);
- foreach_out_edge_safe(value, edge, next) {
+ foreach_out_edge_safe(value, edge) {
ir_node *use = get_edge_src_irn(edge);
if (env->ignore_uses != NULL &&
while (!waitq_empty(env->worklist)) {
ir_node *use = (ir_node *)waitq_get(env->worklist);
- constr_info *info = phase_get_irn_data(env->phase, use);
+ constr_info *info = get_info(env, use);
if (info->already_processed)
continue;
be_timer_pop(T_SSA_CONSTR);
}
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ssaconstr);
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ssaconstr)
void be_init_ssaconstr(void)
{
FIRM_DBG_REGISTER(dbg, "firm.be.ssaconstr");
projects / libfirm / blobdiff