static htab_t def_blocks;
/* Stack of trees used to restore the global currdefs to its original
- state after completing rewriting of a block and its dominator children.
+ state after completing rewriting of a block and its dominator
+ children. Its elements have the following properties:
- This vector is used in two contexts. The first is rewriting of _DECL
- nodes into SSA_NAMEs. In that context its elements have the
- following properties:
+ - An SSA_NAME indicates that the current definition of the
+ underlying variable should be set to the given SSA_NAME.
- An SSA_NAME indicates that the current definition of the underlying
- variable should be set to the given SSA_NAME.
+ - A _DECL node indicates that the underlying variable has no
+ current definition.
- A _DECL node indicates that the underlying variable has no current
- definition.
+ - A NULL node is used to mark the last node associated with the
+ current block.
- A NULL node is used to mark the last node associated with the
- current block.
-
- This vector is also used when rewriting an SSA_NAME which has multiple
- definition sites into multiple SSA_NAMEs. In that context entries come
- in pairs.
-
- The top entry is an SSA_NAME and the top-1 entry is the
- current value for that SSA_NAME.
-
- A NULL node at the top entry is used to mark the last node associated
- with the current block. */
+ - A NULL node at the top entry is used to mark the last node
+ associated with the current block. */
static VEC(tree_on_heap) *block_defs_stack;
/* Basic block vectors used in this file ought to be allocated in the heap. */
DEF_VEC_MALLOC_P(int);
+/* Set of existing SSA names being replaced by update_ssa. */
+static sbitmap old_ssa_names;
+
+/* Set of new SSA names being added by update_ssa. Note that both
+ NEW_SSA_NAMES and OLD_SSA_NAMES are dense bitmaps because most of
+ the operations done on them are presence tests. */
+static sbitmap new_ssa_names;
+
+/* Set of virtual SSA names to be updated. Since virtuals are always
+ in FUD chain form, these names are not used as a mapping mechanism
+ like OLD_SSA_NAMES and NEW_SSA_NAMES. Instead, the names in this
+ set are used by ssa_names_to_replace to inform its caller which
+ names are going to be updated. */
+static bitmap old_virtual_ssa_names;
+
+/* Symbols whose SSA form needs to be updated or created for the first
+ time. */
+static bitmap syms_to_rename;
+
+/* Set of SSA names that have been marked to be released after they
+ were registered in the replacement table. They will be finally
+ released after we finish updating the SSA web. */
+static bitmap names_to_release;
+
+/* Growth factor for NEW_SSA_NAMES and OLD_SSA_NAMES. These sets need
+ to grow as the callers to register_new_name_mapping will typically
+ create new names on the fly. FIXME. Currently set to 1/3 to avoid
+ frequent reallocations but still need to find a reasonable growth
+ strategy. */
+#define NAME_SETS_GROWTH_FACTOR (MAX (3, num_ssa_names / 3))
+
+/* Tuple used to represent replacement mappings. */
+struct repl_map_d
+{
+ tree name;
+ bitmap set;
+};
+
+/* NEW -> OLD_SET replacement table. If we are replacing several
+ existing SSA names O_1, O_2, ..., O_j with a new name N_i,
+ then REPL_TBL[N_i] = { O_1, O_2, ..., O_j }. */
+static htab_t repl_tbl;
+
+/* true if register_new_name_mapping needs to initialize the data
+ structures needed by update_ssa. */
+static bool need_to_initialize_update_ssa_p = true;
+
+/* true if update_ssa needs to update virtual operands. */
+static bool need_to_update_vops_p = false;
+
+/* true if update_ssa is replacing existing SSA names. */
+static bool need_to_replace_names_p = false;
+
/* Global data to attach to the main dominator walk structure. */
struct mark_def_sites_global_data
{
- /* This sbitmap contains the variables which are set before they
- are used in a basic block. We keep it as a global variable
- solely to avoid the overhead of allocating and deallocating
- the bitmap. */
+ /* This bitmap contains the variables which are set before they
+ are used in a basic block. */
bitmap kills;
/* Bitmap of names to rename. */
sbitmap names_to_rename;
+
+ /* Set of blocks that mark_def_sites deems interesting for the
+ renamer to process. */
+ sbitmap interesting_blocks;
};
-/* Information stored for ssa names. */
+/* Information stored for SSA names. */
struct ssa_name_info
{
/* This field indicates whether or not the variable may need PHI nodes.
};
+/* The main entry point to the SSA renamer (rewrite_blocks) may be
+ called several times to do different, but related, tasks.
+ Initially, we need it to rename the whole program into SSA form.
+ At other times, we may need it to only rename into SSA newly
+ exposed symbols. Finally, we can also call it to incrementally fix
+ an already built SSA web. */
+enum rewrite_mode {
+ /* Convert the whole function into SSA form. */
+ REWRITE_ALL,
+
+ /* Incrementally update the SSA web by replacing existing SSA
+ names with new ones. See update_ssa for details. */
+ REWRITE_UPDATE
+};
+
+
/* Use TREE_VISITED to keep track of which statements we want to
rename. When renaming a subset of the variables, not all
statements will be processed. This is decided in mark_def_sites. */
#define REWRITE_THIS_STMT(T) TREE_VISITED (T)
+/* Use the unsigned flag to keep track of which statements we want to
+ visit when marking new definition sites. This is slightly
+ different than REWRITE_THIS_STMT: it's used by update_ssa to
+ distinguish statements that need to have both uses and defs
+ processed from those that only need to have their defs processed.
+ Statements that define new SSA names only need to have their defs
+ registered, but they don't need to have their uses renamed. */
+#define REGISTER_DEFS_IN_THIS_STMT(T) (T)->common.unsigned_flag
+
/* Get the information associated with NAME. */
bitmap_iterator bi;
tos = worklist
- = (basic_block *) xmalloc (sizeof (basic_block) * (n_basic_blocks + 1));
+ = (basic_block *) xmalloc (sizeof (basic_block) * (last_basic_block + 1));
EXECUTE_IF_SET_IN_BITMAP (livein, 0, i, bi)
{
/* Mark block BB as the definition site for variable VAR. PHI_P is true if
- VAR is defined by a PHI node. IS_UPDATE is true if the caller is
- updating an existing SSA form. */
+ VAR is defined by a PHI node. */
static void
-set_def_block (tree var, basic_block bb, bool phi_p, bool is_update)
+set_def_block (tree var, basic_block bb, bool phi_p)
{
struct def_blocks_d *db_p;
enum need_phi_state state;
- if (!is_update && TREE_CODE (var) == SSA_NAME)
- var = SSA_NAME_VAR (var);
-
state = get_phi_state (var);
db_p = get_def_blocks_for (var);
}
-/* If the use operand pointed to by OP_P needs to be renamed, then strip away
- any SSA_NAME wrapping the operand, set *UID_P to the underlying variable's
- uid, and return true. Otherwise return false. If the operand was an
- SSA_NAME, change it to the stripped name. */
+/* Return true if symbol SYM is marked for renaming. */
-static bool
-prepare_use_operand_for_rename (use_operand_p op_p, size_t *uid_p)
+static inline bool
+symbol_marked_for_renaming (tree sym)
{
- tree use = USE_FROM_PTR (op_p);
- tree var = (TREE_CODE (use) != SSA_NAME) ? use : SSA_NAME_VAR (use);
- *uid_p = var_ann (var)->uid;
+ gcc_assert (DECL_P (sym));
+ return bitmap_bit_p (syms_to_rename, var_ann (sym)->uid);
+}
+
+
+/* Return true if NAME is in OLD_SSA_NAMES. */
- /* Ignore variables that don't need to be renamed. */
- if (vars_to_rename && !bitmap_bit_p (vars_to_rename, *uid_p))
+static inline bool
+is_old_name (tree name)
+{
+ if (!need_to_replace_names_p)
return false;
- /* The variable needs to be renamed. If this is a use which already
- has an SSA_NAME, then strip it off.
+ return TEST_BIT (old_ssa_names, SSA_NAME_VERSION (name));
+}
+
+
+/* Return true if NAME is in NEW_SSA_NAMES. */
- By not throwing away SSA_NAMEs on assignments, we avoid a lot of
- useless churn of SSA_NAMEs without having to overly complicate the
- renamer. */
- if (TREE_CODE (use) == SSA_NAME)
- SET_USE (op_p, var);
+static inline bool
+is_new_name (tree name)
+{
+ if (!need_to_replace_names_p)
+ return false;
- return true;
+ return TEST_BIT (new_ssa_names, SSA_NAME_VERSION (name));
}
-/* If the def variable DEF needs to be renamed, then strip away any SSA_NAME
- wrapping the operand, set *UID_P to the underlying variable's uid and return
- true. Otherwise return false. */
+/* Hashing and equality functions for REPL_TBL. */
-static bool
-prepare_def_operand_for_rename (tree def, size_t *uid_p)
+static hashval_t
+repl_map_hash (const void *p)
{
- tree var = (TREE_CODE (def) != SSA_NAME) ? def : SSA_NAME_VAR (def);
- *uid_p = var_ann (var)->uid;
+ return htab_hash_pointer ((const void *)((const struct repl_map_d *)p)->name);
+}
- /* Ignore variables that don't need to be renamed. */
- if (vars_to_rename && !bitmap_bit_p (vars_to_rename, *uid_p))
- return false;
+static int
+repl_map_eq (const void *p1, const void *p2)
+{
+ return ((const struct repl_map_d *)p1)->name
+ == ((const struct repl_map_d *)p2)->name;
+}
+
+static void
+repl_map_free (void *p)
+{
+ BITMAP_FREE (((struct repl_map_d *)p)->set);
+ free (p);
+}
+
+
+/* Return the names replaced by NEW (i.e., REPL_TBL[NEW].SET). */
+
+static inline bitmap
+names_replaced_by (tree new)
+{
+ struct repl_map_d m;
+ void **slot;
+
+ m.name = new;
+ slot = htab_find_slot (repl_tbl, (void *) &m, NO_INSERT);
+
+ /* If N was not registered in the replacement table, return NULL. */
+ if (slot == NULL || *slot == NULL)
+ return NULL;
+
+ return ((struct repl_map_d *) *slot)->set;
+}
+
+
+/* Add OLD to REPL_TBL[NEW].SET. */
+
+static inline void
+add_to_repl_tbl (tree new, tree old)
+{
+ struct repl_map_d m, *mp;
+ void **slot;
+
+ m.name = new;
+ slot = htab_find_slot (repl_tbl, (void *) &m, INSERT);
+ if (*slot == NULL)
+ {
+ mp = xmalloc (sizeof (*mp));
+ mp->name = new;
+ mp->set = BITMAP_ALLOC (NULL);
+ *slot = (void *) mp;
+ }
+ else
+ mp = (struct repl_map_d *) *slot;
+
+ bitmap_set_bit (mp->set, SSA_NAME_VERSION (old));
+}
+
+
+/* Add a new mapping NEW -> OLD REPL_TBL. Every entry N_i in REPL_TBL
+ represents the set of names O_1 ... O_j replaced by N_i. This is
+ used by update_ssa and its helpers to introduce new SSA names in an
+ already formed SSA web. */
+
+static void
+add_new_name_mapping (tree new, tree old)
+{
+ timevar_push (TV_TREE_SSA_INCREMENTAL);
+
+ /* We may need to grow NEW_SSA_NAMES and OLD_SSA_NAMES because our
+ caller may have created new names since the set was created. */
+ if (new_ssa_names->n_bits <= num_ssa_names - 1)
+ {
+ unsigned int new_sz = num_ssa_names + NAME_SETS_GROWTH_FACTOR;
+ new_ssa_names = sbitmap_resize (new_ssa_names, new_sz, 0);
+ old_ssa_names = sbitmap_resize (old_ssa_names, new_sz, 0);
+ }
+
+ /* We don't need to keep replacement mappings for virtual names.
+ Since these names are kept in FUD-chain form, we need to traverse
+ the CFG from ENTRY to repair FUD chains. */
+ if (!is_gimple_reg (new))
+ {
+ tree sym;
+
+ gcc_assert (!is_gimple_reg (old));
+
+ if (DECL_P (old))
+ sym = new;
+ else
+ {
+ sym = SSA_NAME_VAR (old);
+ bitmap_set_bit (old_virtual_ssa_names, SSA_NAME_VERSION (old));
+ }
+
+ mark_sym_for_renaming (sym);
+ need_to_update_vops_p = true;
+
+ timevar_pop (TV_TREE_SSA_INCREMENTAL);
+
+ return;
+ }
+
+ /* Assume that OLD and NEW are different GIMPLE register names. */
+ gcc_assert (new != old && is_gimple_reg (old));
+
+ /* Update the REPL_TBL table. */
+ add_to_repl_tbl (new, old);
- return true;
+ /* If OLD had already been registered as a new name, then all the
+ names that OLD replaces should also be replaced by NEW. */
+ if (is_new_name (old))
+ bitmap_ior_into (names_replaced_by (new), names_replaced_by (old));
+
+ /* Register NEW and OLD in NEW_SSA_NAMES and OLD_SSA_NAMES,
+ respectively. */
+ SET_BIT (new_ssa_names, SSA_NAME_VERSION (new));
+ SET_BIT (old_ssa_names, SSA_NAME_VERSION (old));
+
+ /* Indicate that we are going to be replacing existing names. */
+ need_to_replace_names_p = true;
+
+ timevar_pop (TV_TREE_SSA_INCREMENTAL);
}
{
struct mark_def_sites_global_data *gd = walk_data->global_data;
bitmap kills = gd->kills;
- size_t uid;
tree stmt, def;
use_operand_p use_p;
def_operand_p def_p;
ssa_op_iter iter;
- /* Mark all the blocks that have definitions for each variable in the
- VARS_TO_RENAME bitmap. */
stmt = bsi_stmt (bsi);
update_stmt_if_modified (stmt);
+ REGISTER_DEFS_IN_THIS_STMT (stmt) = 0;
REWRITE_THIS_STMT (stmt) = 0;
/* If a variable is used before being set, then the variable is live
across a block boundary, so mark it live-on-entry to BB. */
-
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter,
SSA_OP_USE | SSA_OP_VUSE | SSA_OP_VMUSTDEFKILL)
{
- if (prepare_use_operand_for_rename (use_p, &uid))
- {
- REWRITE_THIS_STMT (stmt) = 1;
- if (!bitmap_bit_p (kills, uid))
- set_livein_block (USE_FROM_PTR (use_p), bb);
- }
+ tree sym = USE_FROM_PTR (use_p);
+ gcc_assert (DECL_P (sym));
+ if (!bitmap_bit_p (kills, var_ann (sym)->uid))
+ set_livein_block (sym, bb);
+ REWRITE_THIS_STMT (stmt) = 1;
}
/* Note that virtual definitions are irrelevant for computing KILLS
live-on-entry. */
FOR_EACH_SSA_MAYDEF_OPERAND (def_p, use_p, stmt, iter)
{
- if (prepare_use_operand_for_rename (use_p, &uid))
- {
- /* If we do not already have an SSA_NAME for our destination,
- then set the destination to the source. */
- if (TREE_CODE (DEF_FROM_PTR (def_p)) != SSA_NAME)
- SET_DEF (def_p, USE_FROM_PTR (use_p));
-
- set_livein_block (USE_FROM_PTR (use_p), bb);
- set_def_block (DEF_FROM_PTR (def_p), bb, false, false);
- REWRITE_THIS_STMT (stmt) = 1;
- }
+ tree sym = USE_FROM_PTR (use_p);
+ gcc_assert (DECL_P (sym));
+ set_livein_block (sym, bb);
+ set_def_block (sym, bb, false);
+ REGISTER_DEFS_IN_THIS_STMT (stmt) = 1;
+ REWRITE_THIS_STMT (stmt) = 1;
}
/* Now process the defs and must-defs made by this statement. */
FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF | SSA_OP_VMUSTDEF)
{
- if (prepare_def_operand_for_rename (def, &uid))
- {
- set_def_block (def, bb, false, false);
- bitmap_set_bit (kills, uid);
- REWRITE_THIS_STMT (stmt) = 1;
- }
+ gcc_assert (DECL_P (def));
+ set_def_block (def, bb, false);
+ bitmap_set_bit (kills, var_ann (def)->uid);
+ REGISTER_DEFS_IN_THIS_STMT (stmt) = 1;
}
+
+ /* If we found the statement interesting then also mark the block BB
+ as interesting. */
+ if (REWRITE_THIS_STMT (stmt) || REGISTER_DEFS_IN_THIS_STMT (stmt))
+ SET_BIT (gd->interesting_blocks, bb->index);
}
while (VEC_length (int, work_stack) > 0)
{
bb_index = VEC_pop (int, work_stack);
-
+
+ /* Since the registration of NEW -> OLD name mappings is done
+ separately from the call to update_ssa, when updating the SSA
+ form, the basic blocks where new and/or old names are defined
+ may have disappeared by CFG cleanup calls. In this case,
+ we may pull a non-existing block from the work stack. */
+ gcc_assert (bb_index < (unsigned) last_basic_block);
+
EXECUTE_IF_AND_COMPL_IN_BITMAP (dfs[bb_index], phi_insertion_points,
- 0, bb_index, bi)
+ 0, bb_index, bi)
{
/* Use a safe push because if there is a definition of VAR
in every basic block, then WORK_STACK may eventually have
}
+/* Retrieve or create a default definition for symbol SYM. */
+
+static inline tree
+get_default_def_for (tree sym)
+{
+ tree ddef = default_def (sym);
+
+ if (ddef == NULL_TREE)
+ {
+ ddef = make_ssa_name (sym, build_empty_stmt ());
+ set_default_def (sym, ddef);
+ }
+
+ return ddef;
+}
+
+
/* Insert PHI nodes for variable VAR using the iterated dominance
- frontier given in PHI_INSERTION_POINTS. */
+ frontier given in PHI_INSERTION_POINTS. If UPDATE_P is true, this
+ function assumes that the caller is incrementally updating the SSA
+ form, in which case (1) VAR is assumed to be an SSA name, (2) a new
+ SSA name is created for VAR's symbol, and, (3) all the arguments
+ for the newly created PHI node are set to VAR.
+
+ PHI_INSERTION_POINTS is updated to reflect nodes that already had a
+ PHI node for VAR. On exit, only the nodes that received a PHI node
+ for VAR will be present in PHI_INSERTION_POINTS. */
static void
-insert_phi_nodes_for (tree var, bitmap phi_insertion_points)
+insert_phi_nodes_for (tree var, bitmap phi_insertion_points, bool update_p)
{
unsigned bb_index;
edge e;
struct def_blocks_d *def_map;
def_map = find_def_blocks_for (var);
+ gcc_assert (def_map);
/* Remove the blocks where we already have PHI nodes for VAR. */
bitmap_and_compl_into (phi_insertion_points, def_map->phi_blocks);
bb = BASIC_BLOCK (bb_index);
phi = create_phi_node (var, bb);
- /* If we are rewriting SSA names, add also the PHI arguments. */
if (TREE_CODE (var) == SSA_NAME)
{
edge_iterator ei;
+
+ /* FIXME. After removing rewrite_ssa_into_ssa, change this
+ if() to gcc_assert(). */
+ if (update_p)
+ {
+ /* If we are rewriting SSA names, create the LHS of the
+ PHI node by duplicating VAR. This is useful in the
+ case of pointers, to also duplicate pointer
+ attributes (alias information, in particular). */
+ tree new_lhs = duplicate_ssa_name (var, phi);
+ SET_PHI_RESULT (phi, new_lhs);
+ add_new_name_mapping (new_lhs, var);
+ }
+
+ /* Add VAR to every argument slot of PHI. We need VAR in
+ every argument so that rewrite_update_phi_arguments knows
+ which name is this PHI node replacing. If VAR is a
+ symbol marked for renaming, this is not necessary, the
+ renamer will use the symbol on the LHS to get its
+ reaching definition. */
FOR_EACH_EDGE (e, ei, bb->preds)
add_phi_arg (phi, var, e);
}
+
+ /* Mark this PHI node as interesting for update_ssa. */
+ REGISTER_DEFS_IN_THIS_STMT (phi) = 1;
+ REWRITE_THIS_STMT (phi) = 1;
}
}
if (def_map == NULL)
return;
- idf = find_idf (def_map->def_blocks, dfs);
-
if (get_phi_state (var) != NEED_PHI_STATE_NO)
- insert_phi_nodes_for (var, idf);
-
- BITMAP_FREE (idf);
+ {
+ idf = find_idf (def_map->def_blocks, dfs);
+ insert_phi_nodes_for (var, idf, false);
+ BITMAP_FREE (idf);
+ }
}
insert_phi_nodes (bitmap *dfs, bitmap names_to_rename)
{
unsigned i;
- bitmap_iterator bi;
timevar_push (TV_TREE_INSERT_PHI_NODES);
- /* Iterate over all variables in VARS_TO_RENAME. For each variable, add
- to the work list all the blocks that have a definition for the
- variable. PHI nodes will be added to the dominance frontier blocks of
- each definition block. */
if (names_to_rename)
{
+ bitmap_iterator bi;
+
EXECUTE_IF_SET_IN_BITMAP (names_to_rename, 0, i, bi)
if (ssa_name (i))
insert_phi_nodes_1 (ssa_name (i), dfs);
}
- else if (vars_to_rename)
- {
- EXECUTE_IF_SET_IN_BITMAP (vars_to_rename, 0, i, bi)
- insert_phi_nodes_1 (referenced_var (i), dfs);
- }
else
{
for (i = 0; i < num_referenced_vars; i++)
static tree
get_reaching_def (tree var)
{
- tree default_d, currdef_var, avar;
+ tree currdef_var, avar;
/* Lookup the current reaching definition for VAR. */
- default_d = NULL_TREE;
currdef_var = get_current_def (var);
/* If there is no reaching definition for VAR, create and register a
default definition for it (if needed). */
if (currdef_var == NULL_TREE)
{
- if (TREE_CODE (var) == SSA_NAME)
- avar = SSA_NAME_VAR (var);
- else
- avar = var;
-
- default_d = default_def (avar);
- if (default_d == NULL_TREE)
- {
- default_d = make_ssa_name (avar, build_empty_stmt ());
- set_default_def (avar, default_d);
- }
- set_current_def (var, default_d);
+ avar = DECL_P (var) ? var : SSA_NAME_VAR (var);
+ currdef_var = get_default_def_for (avar);
+ set_current_def (var, currdef_var);
}
/* Return the current reaching definition for VAR, or the default
definition, if we had to create one. */
- return (currdef_var) ? currdef_var : default_d;
-}
-
-
-/* Replace the operand pointed by OP_P with its immediate reaching
- definition. */
-
-static inline void
-rewrite_operand (use_operand_p op_p)
-{
- tree var = USE_FROM_PTR (op_p);
- if (TREE_CODE (var) != SSA_NAME)
- SET_USE (op_p, get_reaching_def (var));
- else
- {
-#if defined ENABLE_CHECKING
- /* If we get to this point, VAR is an SSA_NAME. If VAR's symbol
- was marked for renaming, make sure that its reaching
- definition is VAR itself. Otherwise, something has gone
- wrong. */
- tree sym = SSA_NAME_VAR (var);
- if (bitmap_bit_p (vars_to_rename, var_ann (sym)->uid))
- gcc_assert (var == get_reaching_def (SSA_NAME_VAR (var)));
-#endif
- }
+ return currdef_var;
}
/* If mark_def_sites decided that we don't need to rewrite this
statement, ignore it. */
- if (!REWRITE_THIS_STMT (stmt))
+ if (!REWRITE_THIS_STMT (stmt) && !REGISTER_DEFS_IN_THIS_STMT (stmt))
return;
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "\n");
}
- get_stmt_operands (stmt);
-
/* Step 1. Rewrite USES and VUSES in the statement. */
- FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES | SSA_OP_ALL_KILLS)
- rewrite_operand (use_p);
+ if (REWRITE_THIS_STMT (stmt))
+ FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter,
+ SSA_OP_ALL_USES|SSA_OP_ALL_KILLS)
+ {
+ tree var = USE_FROM_PTR (use_p);
+ gcc_assert (DECL_P (var));
+ SET_USE (use_p, get_reaching_def (var));
+ }
/* Step 2. Register the statement's DEF and VDEF operands. */
- FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, iter, SSA_OP_ALL_DEFS)
- {
- if (TREE_CODE (DEF_FROM_PTR (def_p)) != SSA_NAME)
- SET_DEF (def_p, make_ssa_name (DEF_FROM_PTR (def_p), stmt));
-
- /* FIXME: We shouldn't be registering new defs if the variable
- doesn't need to be renamed. */
- register_new_def (DEF_FROM_PTR (def_p), &block_defs_stack);
- }
+ if (REGISTER_DEFS_IN_THIS_STMT (stmt))
+ FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, iter, SSA_OP_ALL_DEFS)
+ {
+ tree var = DEF_FROM_PTR (def_p);
+ gcc_assert (DECL_P (var));
+ SET_DEF (def_p, make_ssa_name (var, stmt));
+ register_new_def (DEF_FROM_PTR (def_p), &block_defs_stack);
+ }
}
for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
{
tree currdef;
-
- /* If this PHI node has already been rewritten, then there is
- nothing to do for this PHI or any following PHIs since we
- always add new PHI nodes at the start of the PHI chain. */
- if (PHI_REWRITTEN (phi))
- break;
-
currdef = get_reaching_def (SSA_NAME_VAR (PHI_RESULT (phi)));
add_phi_arg (phi, currdef, e);
}
}
-/* Rewrite existing virtual PHI arguments so that they have the correct
- reaching definitions. BB is the basic block whose successors contain the
- PHI nodes we want to add arguments for. */
-
-static void
-rewrite_virtual_phi_arguments (struct dom_walk_data *walk_data ATTRIBUTE_UNUSED,
- basic_block bb)
-{
- edge e;
- use_operand_p op;
- edge_iterator ei;
-
- FOR_EACH_EDGE (e, ei, bb->succs)
- {
- tree phi;
-
- if (e->dest == EXIT_BLOCK_PTR)
- continue;
-
- for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
- {
- tree result = PHI_RESULT (phi);
- op = PHI_ARG_DEF_PTR_FROM_EDGE (phi, e);
-
- if (is_gimple_reg (result)
- || !bitmap_bit_p (vars_to_rename,
- var_ann (SSA_NAME_VAR (result))->uid))
- continue;
-
- SET_USE (op, get_reaching_def (SSA_NAME_VAR (result)));
- if (e->flags & EDGE_ABNORMAL)
- SSA_NAME_OCCURS_IN_ABNORMAL_PHI (USE_FROM_PTR (op)) = 1;
- }
- }
-}
-
-
/* Called after visiting basic block BB. Restore CURRDEFS to its
original value. */
}
-/* If a variable V in VARS_TO_RENAME is a pointer, the renaming
- process will cause us to lose the name memory tags that may have
- been associated with the various SSA_NAMEs of V. This means that
- the variables aliased to those name tags also need to be renamed
- again.
+/* Register NEW_NAME to be the new reaching definition for OLD_NAME. */
- FIXME 1- We should either have a better scheme for renaming
- pointers that doesn't lose name tags or re-run alias
- analysis to recover points-to information.
+static inline void
+register_new_update_single (tree new_name, tree old_name)
+{
+ tree currdef = get_current_def (old_name);
- 2- Currently we just invalidate *all* the name tags. This
- should be more selective. */
+ /* Push the current reaching definition into *BLOCK_DEFS_P.
+ This stack is later used by the dominator tree callbacks to
+ restore the reaching definitions for all the variables
+ defined in the block after a recursive visit to all its
+ immediately dominated blocks. */
+ VEC_safe_push (tree_on_heap, block_defs_stack, currdef);
+ VEC_safe_push (tree_on_heap, block_defs_stack, old_name);
-static void
-invalidate_name_tags (bitmap vars_to_rename)
-{
- unsigned i;
- bool rename_name_tags_p;
- bitmap_iterator bi;
+ /* Set the current reaching definition for OLD_NAME to be
+ NEW_NAME. */
+ set_current_def (old_name, new_name);
+}
- rename_name_tags_p = false;
- EXECUTE_IF_SET_IN_BITMAP (vars_to_rename, 0, i, bi)
- {
- if (POINTER_TYPE_P (TREE_TYPE (referenced_var (i))))
- {
- rename_name_tags_p = true;
- break;
- }
- }
- if (rename_name_tags_p)
- for (i = 0; i < num_referenced_vars; i++)
- {
- var_ann_t ann = var_ann (referenced_var (i));
+/* Register NEW_NAME to be the new reaching definition for all the
+ names in OLD_NAMES. Used by the incremental SSA update routines to
+ replace old SSA names with new ones. */
- if (ann->mem_tag_kind == NAME_TAG)
- {
- size_t j;
- varray_type may_aliases = ann->may_aliases;
+static inline void
+register_new_update_set (tree new_name, bitmap old_names)
+{
+ bitmap_iterator bi;
+ unsigned i;
- bitmap_set_bit (vars_to_rename, ann->uid);
- if (ann->may_aliases)
- for (j = 0; j < VARRAY_ACTIVE_SIZE (may_aliases); j++)
- {
- tree var = VARRAY_TREE (may_aliases, j);
- bitmap_set_bit (vars_to_rename, var_ann (var)->uid);
- }
- }
- }
+ EXECUTE_IF_SET_IN_BITMAP (old_names, 0, i, bi)
+ register_new_update_single (new_name, ssa_name (i));
}
-/* Rewrite the actual blocks, statements, and PHI arguments, to be in SSA
- form. FIX_VIRTUAL_PHIS is true if we should only be fixing up virtual
- PHI arguments, instead of adding new PHI arguments for just added PHI
- nodes. */
+/* Initialization of block data structures for the incremental SSA
+ update pass. Create a block local stack of reaching definitions
+ for new SSA names produced in this block (BLOCK_DEFS). Register
+ new definitions for every PHI node in the block. */
static void
-rewrite_blocks (bool fix_virtual_phis)
+rewrite_update_init_block (struct dom_walk_data *walk_data ATTRIBUTE_UNUSED,
+ basic_block bb)
{
- struct dom_walk_data walk_data;
-
- /* Rewrite all the basic blocks in the program. */
- timevar_push (TV_TREE_SSA_REWRITE_BLOCKS);
-
- /* Setup callbacks for the generic dominator tree walker. */
- walk_data.walk_stmts_backward = false;
- walk_data.dom_direction = CDI_DOMINATORS;
- walk_data.initialize_block_local_data = NULL;
- walk_data.before_dom_children_before_stmts = rewrite_initialize_block;
- walk_data.before_dom_children_walk_stmts = rewrite_stmt;
- walk_data.before_dom_children_after_stmts = NULL;
- if (!fix_virtual_phis)
- walk_data.before_dom_children_after_stmts = rewrite_add_phi_arguments;
- else
- walk_data.before_dom_children_after_stmts = rewrite_virtual_phi_arguments;
-
- walk_data.after_dom_children_before_stmts = NULL;
- walk_data.after_dom_children_walk_stmts = NULL;
- walk_data.after_dom_children_after_stmts = rewrite_finalize_block;
- walk_data.global_data = NULL;
- walk_data.block_local_data_size = 0;
-
- block_defs_stack = VEC_alloc (tree_on_heap, 10);
+ edge e;
+ edge_iterator ei;
+ tree phi;
+ bool is_abnormal_phi;
- /* Initialize the dominator walker. */
- init_walk_dominator_tree (&walk_data);
+ if (dump_file && (dump_flags & TDF_DETAILS))
+ fprintf (dump_file, "\n\nRegistering new PHI nodes in block #%d\n\n",
+ bb->index);
- /* Recursively walk the dominator tree rewriting each statement in
- each basic block. */
- walk_dominator_tree (&walk_data, ENTRY_BLOCK_PTR);
+ /* Mark the unwind point for this block. */
+ VEC_safe_push (tree_on_heap, block_defs_stack, NULL_TREE);
- /* Finalize the dominator walker. */
- fini_walk_dominator_tree (&walk_data);
+ /* Mark the LHS if any of the arguments flows through an abnormal
+ edge. */
+ is_abnormal_phi = false;
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ if (e->flags & EDGE_ABNORMAL)
+ {
+ is_abnormal_phi = true;
+ break;
+ }
- /* Debugging dumps. */
- if (dump_file && (dump_flags & TDF_STATS))
+ /* If any of the PHI nodes is a replacement for a name in
+ OLD_SSA_NAMES or it's one of the names in NEW_SSA_NAMES, then
+ register it as a new definition for its corresponding name. Also
+ register definitions for names whose underlying symbols are
+ marked for renaming. */
+ for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
{
- dump_dfa_stats (dump_file);
- dump_tree_ssa_stats (dump_file);
- }
+ tree lhs, lhs_sym;
- htab_delete (def_blocks);
- def_blocks = NULL;
-
- VEC_free (tree_on_heap, block_defs_stack);
- block_defs_stack = NULL;
+ if (!REGISTER_DEFS_IN_THIS_STMT (phi))
+ continue;
+
+ lhs = PHI_RESULT (phi);
+ lhs_sym = SSA_NAME_VAR (lhs);
- timevar_pop (TV_TREE_SSA_REWRITE_BLOCKS);
+ if (symbol_marked_for_renaming (lhs_sym))
+ register_new_update_single (lhs, lhs_sym);
+ else
+ {
+ /* If LHS is a new name, register a new definition for all
+ the names replaced by LHS. */
+ if (is_new_name (lhs))
+ register_new_update_set (lhs, names_replaced_by (lhs));
+
+ /* If LHS is an OLD name, register it as a new definition
+ for itself. */
+ if (is_old_name (lhs))
+ register_new_update_single (lhs, lhs);
+ }
+
+ if (is_abnormal_phi)
+ SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs) = 1;
+ }
+}
+
+
+/* Replace the operand pointed by USE_P with USE's current reaching
+ definition. */
+
+static inline void
+replace_use (use_operand_p use_p, tree use)
+{
+ tree rdef = get_reaching_def (use);
+ if (rdef != use)
+ SET_USE (use_p, rdef);
+}
+
+
+/* Called after visiting block BB. Unwind BLOCK_DEFS_STACK to restore
+ the current reaching definition of every name re-written in BB to
+ the original reaching definition before visiting BB. This
+ unwinding must be done in the opposite order to what is done in
+ register_new_update_set. */
+
+static void
+rewrite_update_fini_block (struct dom_walk_data *walk_data ATTRIBUTE_UNUSED,
+ basic_block bb ATTRIBUTE_UNUSED)
+{
+ while (VEC_length (tree_on_heap, block_defs_stack) > 0)
+ {
+ tree var = VEC_pop (tree_on_heap, block_defs_stack);
+ tree saved_def;
+
+ /* NULL indicates the unwind stop point for this block (see
+ rewrite_update_init_block). */
+ if (var == NULL)
+ return;
+
+ saved_def = VEC_pop (tree_on_heap, block_defs_stack);
+ set_current_def (var, saved_def);
+ }
+}
+
+
+/* Update every variable used in the statement pointed-to by SI. The
+ statement is assumed to be in SSA form already. Names in
+ OLD_SSA_NAMES used by SI will be updated to their current reaching
+ definition. Names in OLD_SSA_NAMES or NEW_SSA_NAMES defined by SI
+ will be registered as a new definition for their corresponding name
+ in OLD_SSA_NAMES. */
+
+static void
+rewrite_update_stmt (struct dom_walk_data *walk_data ATTRIBUTE_UNUSED,
+ basic_block bb ATTRIBUTE_UNUSED,
+ block_stmt_iterator si)
+{
+ stmt_ann_t ann;
+ tree stmt;
+ use_operand_p use_p;
+ def_operand_p def_p;
+ ssa_op_iter iter;
+
+ stmt = bsi_stmt (si);
+ ann = stmt_ann (stmt);
+
+ /* Only update marked statements. */
+ if (!REWRITE_THIS_STMT (stmt) && !REGISTER_DEFS_IN_THIS_STMT (stmt))
+ return;
+
+ if (dump_file && (dump_flags & TDF_DETAILS))
+ {
+ fprintf (dump_file, "Updating SSA information for statement ");
+ print_generic_stmt (dump_file, stmt, TDF_SLIM);
+ fprintf (dump_file, "\n");
+ }
+
+ /* Rewrite USES included in OLD_SSA_NAMES and USES whose underlying
+ symbol is marked for renaming. */
+ if (REWRITE_THIS_STMT (stmt))
+ {
+ FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_USE)
+ {
+ tree use = USE_FROM_PTR (use_p);
+ tree sym = DECL_P (use) ? use : SSA_NAME_VAR (use);
+
+ if (symbol_marked_for_renaming (sym))
+ replace_use (use_p, sym);
+ else if (is_old_name (use))
+ replace_use (use_p, use);
+ }
+
+ if (need_to_update_vops_p)
+ FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter,
+ SSA_OP_VIRTUAL_USES | SSA_OP_VIRTUAL_KILLS)
+ {
+ tree use = USE_FROM_PTR (use_p);
+ tree sym = DECL_P (use) ? use : SSA_NAME_VAR (use);
+
+ if (symbol_marked_for_renaming (sym))
+ replace_use (use_p, sym);
+ }
+ }
+
+ /* Register definitions of names in NEW_SSA_NAMES and OLD_SSA_NAMES.
+ Also register definitions for names whose underlying symbol is
+ marked for renaming. */
+ if (REGISTER_DEFS_IN_THIS_STMT (stmt))
+ {
+ FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, iter, SSA_OP_DEF)
+ {
+ tree def = DEF_FROM_PTR (def_p);
+ tree sym = DECL_P (def) ? def : SSA_NAME_VAR (def);
+
+ /* If DEF is a naked symbol that needs renaming, create a
+ new name for it. */
+ if (symbol_marked_for_renaming (sym))
+ {
+ if (DECL_P (def))
+ {
+ def = make_ssa_name (def, stmt);
+ SET_DEF (def_p, def);
+ }
+
+ register_new_update_single (def, sym);
+ }
+ else
+ {
+ /* If DEF is a new name, register it as a new definition
+ for all the names replaced by DEF. */
+ if (is_new_name (def))
+ register_new_update_set (def, names_replaced_by (def));
+
+ /* If DEF is an old name, register DEF as a new
+ definition for itself. */
+ if (is_old_name (def))
+ register_new_update_single (def, def);
+ }
+ }
+
+ if (need_to_update_vops_p)
+ FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, iter, SSA_OP_VIRTUAL_DEFS)
+ {
+ tree def = DEF_FROM_PTR (def_p);
+ tree sym = DECL_P (def) ? def : SSA_NAME_VAR (def);
+
+ if (symbol_marked_for_renaming (sym))
+ {
+ if (DECL_P (def))
+ {
+ def = make_ssa_name (def, stmt);
+ SET_DEF (def_p, def);
+ }
+
+ register_new_update_single (def, sym);
+ }
+ }
+ }
+}
+
+
+/* Visit all the successor blocks of BB looking for PHI nodes. For
+ every PHI node found, check if any of its arguments is in
+ OLD_SSA_NAMES. If so, and if the argument has a current reaching
+ definition, replace it. */
+
+static void
+rewrite_update_phi_arguments (struct dom_walk_data *walk_data ATTRIBUTE_UNUSED,
+ basic_block bb)
+{
+ edge e;
+ edge_iterator ei;
+
+ FOR_EACH_EDGE (e, ei, bb->succs)
+ {
+ tree phi;
+
+ for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
+ {
+ tree arg;
+ use_operand_p arg_p;
+
+ /* Skip PHI nodes that are not marked for rewrite. */
+ if (!REWRITE_THIS_STMT (phi))
+ continue;
+
+ arg_p = PHI_ARG_DEF_PTR_FROM_EDGE (phi, e);
+ arg = USE_FROM_PTR (arg_p);
+
+ if (arg && !DECL_P (arg) && TREE_CODE (arg) != SSA_NAME)
+ continue;
+
+ if (arg == NULL_TREE)
+ {
+ /* When updating a PHI node for a recently introduced
+ symbol we may find NULL arguments. That's why we
+ take the symbol from the LHS of the PHI node. */
+ replace_use (arg_p, SSA_NAME_VAR (PHI_RESULT (phi)));
+ }
+ else
+ {
+ tree sym = DECL_P (arg) ? arg : SSA_NAME_VAR (arg);
+
+ if (symbol_marked_for_renaming (sym))
+ replace_use (arg_p, sym);
+ else if (is_old_name (arg))
+ replace_use (arg_p, arg);
+ }
+
+ if (e->flags & EDGE_ABNORMAL)
+ SSA_NAME_OCCURS_IN_ABNORMAL_PHI (USE_FROM_PTR (arg_p)) = 1;
+ }
+ }
+}
+
+
+/* Rewrite the actual blocks, statements, and PHI arguments, to be in SSA
+ form.
+
+ ENTRY indicates the block where to start. Every block dominated by
+ ENTRY will be rewritten.
+
+ WHAT indicates what actions will be taken by the renamer (see enum
+ rewrite_mode).
+
+ BLOCKS are the set of interesting blocks for the dominator walker
+ to process. If this set is NULL, then all the nodes dominated
+ by ENTRY are walked. Otherwise, blocks dominated by ENTRY that
+ are not present in BLOCKS are ignored. */
+
+static void
+rewrite_blocks (basic_block entry, enum rewrite_mode what, sbitmap blocks)
+{
+ struct dom_walk_data walk_data;
+
+ /* Rewrite all the basic blocks in the program. */
+ timevar_push (TV_TREE_SSA_REWRITE_BLOCKS);
+
+ /* Setup callbacks for the generic dominator tree walker. */
+ memset (&walk_data, 0, sizeof (walk_data));
+
+ walk_data.dom_direction = CDI_DOMINATORS;
+ walk_data.interesting_blocks = blocks;
+
+ if (what == REWRITE_UPDATE)
+ walk_data.before_dom_children_before_stmts = rewrite_update_init_block;
+ else
+ walk_data.before_dom_children_before_stmts = rewrite_initialize_block;
+
+ if (what == REWRITE_ALL)
+ walk_data.before_dom_children_walk_stmts = rewrite_stmt;
+ else if (what == REWRITE_UPDATE)
+ walk_data.before_dom_children_walk_stmts = rewrite_update_stmt;
+ else
+ gcc_unreachable ();
+
+ if (what == REWRITE_ALL)
+ walk_data.before_dom_children_after_stmts = rewrite_add_phi_arguments;
+ else if (what == REWRITE_UPDATE)
+ walk_data.before_dom_children_after_stmts = rewrite_update_phi_arguments;
+ else
+ gcc_unreachable ();
+
+ if (what == REWRITE_ALL)
+ walk_data.after_dom_children_after_stmts = rewrite_finalize_block;
+ else if (what == REWRITE_UPDATE)
+ walk_data.after_dom_children_after_stmts = rewrite_update_fini_block;
+ else
+ gcc_unreachable ();
+
+ block_defs_stack = VEC_alloc (tree_on_heap, 10);
+
+ /* Initialize the dominator walker. */
+ init_walk_dominator_tree (&walk_data);
+
+ /* Recursively walk the dominator tree rewriting each statement in
+ each basic block. */
+ walk_dominator_tree (&walk_data, entry);
+
+ /* Finalize the dominator walker. */
+ fini_walk_dominator_tree (&walk_data);
+
+ /* Debugging dumps. */
+ if (dump_file && (dump_flags & TDF_STATS))
+ {
+ dump_dfa_stats (dump_file);
+ if (def_blocks)
+ dump_tree_ssa_stats (dump_file);
+ }
+
+ if (def_blocks)
+ {
+ htab_delete (def_blocks);
+ def_blocks = NULL;
+ }
+
+ VEC_free (tree_on_heap, block_defs_stack);
+ block_defs_stack = NULL;
+
+ timevar_pop (TV_TREE_SSA_REWRITE_BLOCKS);
}
}
-/* Mark the definition site blocks for each variable, so that we know where
- the variable is actually live. */
+/* Mark the definition site blocks for each variable, so that we know
+ where the variable is actually live.
+
+ INTERESTING_BLOCKS will be filled in with all the blocks that
+ should be processed by the renamer. It is assumed to be
+ initialized and zeroed by the caller. */
-static void
-mark_def_site_blocks (void)
+static void
+mark_def_site_blocks (sbitmap interesting_blocks)
{
size_t i;
struct dom_walk_data walk_data;
for (i = 0; i < num_referenced_vars; i++)
set_current_def (referenced_var (i), NULL_TREE);
- /* Ensure that the dominance information is OK. */
- calculate_dominance_info (CDI_DOMINATORS);
-
/* Setup callbacks for the generic dominator tree walker to find and
mark definition sites. */
walk_data.walk_stmts_backward = false;
walk_data.after_dom_children_before_stmts = NULL;
walk_data.after_dom_children_walk_stmts = NULL;
walk_data.after_dom_children_after_stmts = NULL;
+ walk_data.interesting_blocks = NULL;
/* Notice that this bitmap is indexed using variable UIDs, so it must be
large enough to accommodate all the variables referenced in the
function, not just the ones we are renaming. */
mark_def_sites_global_data.kills = BITMAP_ALLOC (NULL);
+
+ /* Create the set of interesting blocks that will be filled by
+ mark_def_sites. */
+ mark_def_sites_global_data.interesting_blocks = interesting_blocks;
walk_data.global_data = &mark_def_sites_global_data;
/* We do not have any local data. */
/* Main entry point into the SSA builder. The renaming process
- proceeds in five main phases:
-
- 1- If VARS_TO_RENAME has any entries, any existing PHI nodes for
- those variables are removed from the flow graph so that they can
- be computed again.
+ proceeds in four main phases:
- 2- Compute dominance frontier, needed to insert PHI nodes and
- rename the function in dominator tree order.
+ 1- Compute dominance frontier and immediate dominators, needed to
+ insert PHI nodes and rename the function in dominator tree
+ order.
- 3- Find and mark all the blocks that define variables
+ 2- Find and mark all the blocks that define variables
(mark_def_site_blocks).
- 4- Insert PHI nodes at dominance frontiers (insert_phi_nodes).
+ 3- Insert PHI nodes at dominance frontiers (insert_phi_nodes).
- 5- Rename all the blocks (rewrite_blocks) and statements in the program.
+ 4- Rename all the blocks (rewrite_blocks) and statements in the program.
Steps 3 and 5 are done using the dominator tree walker
- (walk_dominator_tree).
+ (walk_dominator_tree). */
- ALL is true if all variables should be renamed (otherwise just those
- mentioned in vars_to_rename are taken into account). */
-
-void
-rewrite_into_ssa (bool all)
+static void
+rewrite_into_ssa (void)
{
bitmap *dfs;
basic_block bb;
- bitmap old_vars_to_rename = vars_to_rename;
+ sbitmap interesting_blocks;
timevar_push (TV_TREE_SSA_OTHER);
- if (all)
- vars_to_rename = NULL;
- else
- {
- /* Initialize the array of variables to rename. */
- gcc_assert (vars_to_rename);
-
- if (bitmap_empty_p (vars_to_rename))
- {
- timevar_pop (TV_TREE_SSA_OTHER);
- return;
- }
-
- invalidate_name_tags (vars_to_rename);
-
- /* Now remove all the existing PHI nodes (if any) for the variables
- that we are about to rename into SSA. */
- remove_all_phi_nodes_for (vars_to_rename);
- }
+ /* Initialize operand data structures. */
+ init_ssa_operands ();
- mark_def_site_blocks ();
+ /* Initialize the set of interesting blocks. The callback
+ mark_def_sites will add to this set those blocks that the renamer
+ should process. */
+ interesting_blocks = sbitmap_alloc (last_basic_block);
+ sbitmap_zero (interesting_blocks);
/* Initialize dominance frontier. */
dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap *));
FOR_EACH_BB (bb)
dfs[bb->index] = BITMAP_ALLOC (NULL);
- /* Compute dominance frontiers. */
+ /* 1- Compute dominance frontiers. */
+ calculate_dominance_info (CDI_DOMINATORS);
compute_dominance_frontiers (dfs);
- /* Insert PHI nodes at dominance frontiers of definition blocks. */
+ /* 2- Find and mark definition sites. */
+ mark_def_site_blocks (interesting_blocks);
+
+ /* 3- Insert PHI nodes at dominance frontiers of definition blocks. */
insert_phi_nodes (dfs, NULL);
- rewrite_blocks (false);
+ /* 4- Rename all the blocks. */
+ rewrite_blocks (ENTRY_BLOCK_PTR, REWRITE_ALL, interesting_blocks);
/* Free allocated memory. */
FOR_EACH_BB (bb)
BITMAP_FREE (dfs[bb->index]);
free (dfs);
+ sbitmap_free (interesting_blocks);
- vars_to_rename = old_vars_to_rename;
timevar_pop (TV_TREE_SSA_OTHER);
}
-/* Rewrites all variables into SSA. */
-
-static void
-rewrite_all_into_ssa (void)
-{
- init_ssa_operands ();
- rewrite_into_ssa (true);
-}
-
struct tree_opt_pass pass_build_ssa =
{
"ssa", /* name */
NULL, /* gate */
- rewrite_all_into_ssa, /* execute */
+ rewrite_into_ssa, /* execute */
NULL, /* sub */
NULL, /* next */
0, /* static_pass_number */
};
-/* Rewrite the def-def chains of virtual operands so that they have
- the correct reaching definitions. */
+/* Mark the definition of VAR at STMT and BB as interesting for the
+ renamer. BLOCKS is the set of blocks that need updating. */
-void
-rewrite_def_def_chains (void)
+static void
+mark_def_interesting (tree var, tree stmt, basic_block bb, bitmap blocks,
+ bool insert_phi_p)
{
- /* Ensure that the dominance information is OK. */
- calculate_dominance_info (CDI_DOMINATORS);
- mark_def_site_blocks ();
- rewrite_blocks (true);
+ REGISTER_DEFS_IN_THIS_STMT (stmt) = 1;
+ bitmap_set_bit (blocks, bb->index);
+
+ if (insert_phi_p)
+ {
+ bool is_phi_p = TREE_CODE (stmt) == PHI_NODE;
+
+#if defined ENABLE_CHECKING
+ /* If VAR is a virtual, then it had better be a symbol.
+ Virtuals are in FUD-chain form, so we are interested in the
+ definition and use sites of the symbol, not the individual
+ SSA names. */
+ if (!is_gimple_reg (var))
+ gcc_assert (DECL_P (var));
+#endif
+
+ set_def_block (var, bb, is_phi_p);
+
+ /* If VAR is an SSA name in NEW_SSA_NAMES, this is a definition
+ site for both itself and all the old names replaced by it. */
+ if (TREE_CODE (var) == SSA_NAME && is_new_name (var))
+ {
+ bitmap_iterator bi;
+ unsigned i;
+ bitmap set = names_replaced_by (var);
+ if (set)
+ EXECUTE_IF_SET_IN_BITMAP (set, 0, i, bi)
+ set_def_block (ssa_name (i), bb, is_phi_p);
+ }
+ }
+}
+
+
+/* Mark the use of VAR at STMT and BB as interesting for the
+ renamer. INSERT_PHI_P is true if we are going to insert new PHI
+ nodes. BLOCKS is the set of blocks that need updating. */
+
+static inline void
+mark_use_interesting (tree var, tree stmt, basic_block bb, bitmap blocks,
+ bool insert_phi_p)
+{
+ REWRITE_THIS_STMT (stmt) = 1;
+ bitmap_set_bit (blocks, bb->index);
+
+ /* If VAR has not been defined in BB, then it is live-on-entry
+ to BB. Note that we cannot just use the block holding VAR's
+ definition because if VAR is one of the names in OLD_SSA_NAMES,
+ it will have several definitions (itself and all the names that
+ replace it). */
+ if (insert_phi_p)
+ {
+ struct def_blocks_d *db_p;
+
+#if defined ENABLE_CHECKING
+ /* If VAR is a virtual, then it had better be a symbol.
+ Virtuals are in FUD-chain form, so we are interested in the
+ definition and use sites of the symbol, not the individual
+ SSA names. */
+ if (!is_gimple_reg (var))
+ gcc_assert (DECL_P (var));
+#endif
+
+ db_p = get_def_blocks_for (var);
+ if (!bitmap_bit_p (db_p->def_blocks, bb->index))
+ set_livein_block (var, bb);
+ }
}
+/* If any of the arguments of PHI is in OLD_SSA_NAMES, mark PHI to
+ be rewritten. BB is the block where PHI resides, BLOCKS is the
+ region to be renamed and INSERT_PHI_P is true if the updating
+ process should insert new PHI nodes. */
+
+static void
+prepare_phi_args_for_update (tree phi, basic_block bb, bitmap blocks,
+ bool insert_phi_p)
+{
+ int i;
+
+ for (i = 0; i < PHI_NUM_ARGS (phi); i++)
+ {
+ tree arg = PHI_ARG_DEF (phi, i);
+
+ if (TREE_CODE (arg) == SSA_NAME && is_old_name (arg))
+ {
+ /* Mark this use of ARG interesting for the renamer. Notice
+ that we explicitly call mark_use_interesting with
+ INSERT_PHI_P == false.
+
+ This is to avoid marking ARG as live-in in this block BB.
+ If we were to mark ARG live-in to BB, then ARG would be
+ considered live-in through ALL incoming edges to BB which
+ is not what we want. Since we are updating the SSA form
+ for ARG, we don't really know what other names of ARG are
+ coming in through other edges into BB.
+
+ If we considered ARG live-in at BB, then the PHI
+ placement algorithm may try to insert PHI nodes in blocks
+ that are not only unnecessary but also the renamer would
+ not know how to fill in. */
+ mark_use_interesting (arg, phi, bb, blocks, false);
+
+ /* As discussed above, we only want to mark ARG live-in
+ through the edge corresponding to its slot inside the PHI
+ argument list. So, we look for the block BB1 where ARG is
+ flowing through. If BB1 does not contain a definition of
+ ARG, then consider ARG live-in at BB1. */
+ if (insert_phi_p)
+ {
+ edge e = PHI_ARG_EDGE (phi, i);
+ basic_block bb1 = e->src;
+ struct def_blocks_d *db = get_def_blocks_for (arg);
+
+ if (!bitmap_bit_p (db->def_blocks, bb1->index))
+ set_livein_block (arg, bb1);
+ }
+ }
+ }
+}
+
+
+/* Do a dominator walk starting at BB processing statements that
+ reference variables in OLD_SSA_NAMES and NEW_SSA_NAMES.
+
+ 1- Mark in BLOCKS the defining block of every name N in
+ NEW_SSA_NAMES.
+
+ 2- Mark in BLOCKS the defining block of every name O in
+ OLD_SSA_NAMES.
+
+ 3- For every statement or PHI node that uses a name O in
+ OLD_SSA_NAMES. If INSERT_PHI_P is true, mark those uses as live
+ in the corresponding block. This is later used by the PHI
+ placement algorithm to make PHI pruning decisions.
+
+ If VISIT_DOM_P is true, all the dominator children of BB are also
+ visited.
+
+ FIXME. This process is slower than necessary. Once we have
+ immediate uses merged in, we should be able to just visit the
+ immediate uses of all the names that we are about to replace,
+ instead of visiting the whole block. */
+
+static void
+prepare_block_for_update (basic_block bb, bool insert_phi_p,
+ bitmap blocks, bool visit_dom_p)
+{
+ basic_block son;
+ block_stmt_iterator si;
+ tree phi;
+
+ /* Process PHI nodes marking interesting those that define or use
+ the names that we are interested in. */
+ for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
+ {
+ tree lhs_sym, lhs = PHI_RESULT (phi);
+
+ REWRITE_THIS_STMT (phi) = 0;
+ REGISTER_DEFS_IN_THIS_STMT (phi) = 0;
+
+ /* Ignore virtual PHIs if we are not updating virtual operands.
+ Note that even if NEED_TO_REPLACE_NAMES_P is false, we need
+ to process real PHIs because we may be rewriting GIMPLE regs
+ into SSA for the first time. Therefore, we cannot do a
+ similar shortcut for real PHIs. */
+ if (!need_to_update_vops_p && !is_gimple_reg (lhs))
+ continue;
+
+ lhs_sym = DECL_P (lhs) ? lhs : SSA_NAME_VAR (lhs);
+
+ if (symbol_marked_for_renaming (lhs_sym))
+ {
+ /* If the LHS is a virtual symbol marked for renaming, then
+ we don't need to scan the argument list. Since virtual
+ operands are in FUD-chain form, all the arguments of this
+ PHI must be the same symbol as the LHS. So, we just need
+ to mark this site as both an interesting use and an
+ interesting def for the symbol. */
+ mark_use_interesting (lhs_sym, phi, bb, blocks, insert_phi_p);
+ mark_def_interesting (lhs_sym, phi, bb, blocks, insert_phi_p);
+ }
+ else if (need_to_replace_names_p)
+ {
+ /* If the LHS is in OLD_SSA_NAMES or NEW_SSA_NAMES, this is
+ a definition site for it. */
+ if (is_old_name (lhs) || is_new_name (lhs))
+ mark_def_interesting (lhs, phi, bb, blocks, insert_phi_p);
+
+ prepare_phi_args_for_update (phi, bb, blocks, insert_phi_p);
+ }
+ }
+
+ /* Process the statements. */
+ for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
+ {
+ tree stmt;
+ ssa_op_iter i;
+ use_operand_p use_p;
+ def_operand_p def_p;
+
+ stmt = bsi_stmt (si);
+
+ REWRITE_THIS_STMT (stmt) = 0;
+ REGISTER_DEFS_IN_THIS_STMT (stmt) = 0;
+
+ /* Note, even if NEED_TO_REPLACE_NAMES_P is false, we need to
+ scan real uses and defs, as we may be renaming a GIMPLE
+ register for the first time. */
+ FOR_EACH_SSA_USE_OPERAND (use_p, stmt, i, SSA_OP_USE)
+ {
+ tree use = USE_FROM_PTR (use_p);
+ tree sym = DECL_P (use) ? use : SSA_NAME_VAR (use);
+ if (symbol_marked_for_renaming (sym) || is_old_name (use))
+ mark_use_interesting (use, stmt, bb, blocks, insert_phi_p);
+ }
+
+ FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, i, SSA_OP_DEF)
+ {
+ tree def = DEF_FROM_PTR (def_p);
+ tree sym = DECL_P (def) ? def : SSA_NAME_VAR (def);
+
+ if (symbol_marked_for_renaming (sym)
+ || is_new_name (def)
+ || is_old_name (def))
+ mark_def_interesting (def, stmt, bb, blocks, insert_phi_p);
+ }
+
+ /* If we don't need to update virtual operands, continue to the
+ next statement. */
+ if (!need_to_update_vops_p)
+ continue;
+
+ /* For every interesting N_i = V_MAY_DEF <N_j> and
+ N_i = V_MUST_DEF <N_j>, mark the statement as interesting.
+ Notice that N_j may in fact be a naked symbol (if this
+ statement is the result of basic block duplication). The
+ rename process will later fill in the appropriate reaching
+ definition for the symbol. */
+ FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, i, SSA_OP_VIRTUAL_DEFS)
+ {
+ tree def = DEF_FROM_PTR (def_p);
+ tree sym = DECL_P (def) ? def : SSA_NAME_VAR (def);
+
+ if (symbol_marked_for_renaming (sym))
+ {
+ mark_use_interesting (sym, stmt, bb, blocks, insert_phi_p);
+ mark_def_interesting (sym, stmt, bb, blocks, insert_phi_p);
+ }
+ }
+
+ /* Similarly, for V_USE <N_i>. */
+ FOR_EACH_SSA_USE_OPERAND (use_p, stmt, i, SSA_OP_VUSE)
+ {
+ tree use = USE_FROM_PTR (use_p);
+ tree sym = DECL_P (use) ? use : SSA_NAME_VAR (use);
+
+ if (symbol_marked_for_renaming (sym))
+ mark_use_interesting (sym, stmt, bb, blocks, insert_phi_p);
+ }
+ }
+
+ /* Now visit all the blocks dominated by BB. */
+ if (visit_dom_p)
+ for (son = first_dom_son (CDI_DOMINATORS, bb);
+ son;
+ son = next_dom_son (CDI_DOMINATORS, son))
+ prepare_block_for_update (son, insert_phi_p, blocks, true);
+}
+
+
+/* Helper for prepare_def_sites. Mark the definition site for NAME as
+ interesting. BLOCKS and INSERT_PHI_P are as in prepare_def_sites. */
+
+static void
+prepare_def_site_for (tree name, bitmap blocks, bool insert_phi_p)
+{
+ tree stmt;
+ basic_block bb;
+
+ gcc_assert (name && is_gimple_reg (name));
+ gcc_assert (names_to_release == NULL
+ || !bitmap_bit_p (names_to_release, SSA_NAME_VERSION (name)));
+
+ stmt = SSA_NAME_DEF_STMT (name);
+ bb = bb_for_stmt (stmt);
+ if (bb)
+ {
+ gcc_assert (bb->index < last_basic_block);
+ mark_def_interesting (name, stmt, bb, blocks, insert_phi_p);
+ }
+}
+
+
+/* Mark definition sites of names in NEW_SSA_NAMES and OLD_SSA_NAMES.
+ Add each definition block to BLOCKS. INSERT_PHI_P is true if the
+ caller wants to insert PHI nodes for newly created names. */
+
+static void
+prepare_def_sites (bitmap blocks, bool insert_phi_p)
+{
+ unsigned i;
+ bitmap_iterator bi;
+
+ /* If a name N from NEW_SSA_NAMES is also marked to be released,
+ remove it from NEW_SSA_NAMES so that we don't try to visit its
+ defining basic block (which most likely doesn't exist). Notice
+ that we cannot do the same with names in OLD_SSA_NAMES because we
+ want to replace existing instances. */
+ if (names_to_release)
+ EXECUTE_IF_SET_IN_BITMAP (names_to_release, 0, i, bi)
+ RESET_BIT (new_ssa_names, i);
+
+ /* If an old name is in NAMES_TO_RELEASE, we cannot remove it from
+ OLD_SSA_NAMES, but we have to ignore its definition site. */
+ EXECUTE_IF_SET_IN_SBITMAP (old_ssa_names, 0, i,
+ if (names_to_release == NULL || !bitmap_bit_p (names_to_release, i))
+ prepare_def_site_for (ssa_name (i), blocks, insert_phi_p));
+
+ EXECUTE_IF_SET_IN_SBITMAP (new_ssa_names, 0, i,
+ prepare_def_site_for (ssa_name (i), blocks, insert_phi_p));
+}
+
+
+/* Dump all the names replaced by NAME to FILE. */
+
+void
+dump_names_replaced_by (FILE *file, tree name)
+{
+ unsigned i;
+ bitmap old_set;
+ bitmap_iterator bi;
+
+ print_generic_expr (file, name, 0);
+ fprintf (file, " -> { ");
+
+ old_set = names_replaced_by (name);
+ EXECUTE_IF_SET_IN_BITMAP (old_set, 0, i, bi)
+ {
+ print_generic_expr (file, ssa_name (i), 0);
+ fprintf (file, " ");
+ }
+
+ fprintf (file, "}\n");
+}
+
+
+/* Dump all the names replaced by NAME to stderr. */
+
+void
+debug_names_replaced_by (tree name)
+{
+ dump_names_replaced_by (stderr, name);
+}
+
+
+/* Dump the SSA name replacement table to FILE. */
+
+void
+dump_repl_tbl (FILE *file)
+{
+ unsigned i;
+ bitmap_iterator bi;
+
+ if (!need_ssa_update_p ())
+ return;
+
+ if (new_ssa_names && sbitmap_first_set_bit (new_ssa_names) >= 0)
+ {
+ fprintf (file, "\nSSA replacement table\n");
+ fprintf (file, "N_i -> { O_1 ... O_j } means that N_i replaces "
+ "O_1, ..., O_j\n\n");
+
+ EXECUTE_IF_SET_IN_SBITMAP (new_ssa_names, 0, i,
+ dump_names_replaced_by (file, ssa_name (i)));
+ }
+
+ if (syms_to_rename && !bitmap_empty_p (syms_to_rename))
+ {
+ fprintf (file, "\n\nSymbols to be put in SSA form\n\n");
+ EXECUTE_IF_SET_IN_BITMAP (syms_to_rename, 0, i, bi)
+ {
+ print_generic_expr (file, referenced_var (i), 0);
+ fprintf (file, " ");
+ }
+ }
+
+ if (old_virtual_ssa_names && !bitmap_empty_p (old_virtual_ssa_names))
+ {
+ fprintf (file, "\n\nVirtual SSA names to be updated\n\n");
+ EXECUTE_IF_SET_IN_BITMAP (old_virtual_ssa_names, 0, i, bi)
+ {
+ print_generic_expr (file, ssa_name (i), 0);
+ fprintf (file, " ");
+ }
+ }
+
+ if (names_to_release && !bitmap_empty_p (names_to_release))
+ {
+ fprintf (file, "\n\nSSA names to release after updating the SSA web\n\n");
+ EXECUTE_IF_SET_IN_BITMAP (names_to_release, 0, i, bi)
+ {
+ print_generic_expr (file, ssa_name (i), 0);
+ fprintf (file, " ");
+ }
+ }
+
+ fprintf (file, "\n\n");
+}
+
+
+/* Dump the SSA name replacement table to stderr. */
+
+void
+debug_repl_tbl (void)
+{
+ dump_repl_tbl (stderr);
+}
+
+
+/* Initialize data structures used for incremental SSA updates. */
+
+static void
+init_update_ssa (void)
+{
+ /* Reserve 1/3 more than the current number of names. The calls to
+ add_new_name_mapping are typically done after creating new SSA
+ names, so we'll need to reallocate these arrays. */
+ old_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR);
+ sbitmap_zero (old_ssa_names);
+
+ new_ssa_names = sbitmap_alloc (num_ssa_names + NAME_SETS_GROWTH_FACTOR);
+ sbitmap_zero (new_ssa_names);
+
+ repl_tbl = htab_create (20, repl_map_hash, repl_map_eq, repl_map_free);
+ need_to_initialize_update_ssa_p = false;
+ need_to_update_vops_p = false;
+ need_to_replace_names_p = false;
+ syms_to_rename = BITMAP_ALLOC (NULL);
+ old_virtual_ssa_names = BITMAP_ALLOC (NULL);
+ names_to_release = NULL;
+}
+
+
+/* Deallocate data structures used for incremental SSA updates. */
+
+static void
+delete_update_ssa (void)
+{
+ unsigned i;
+ bitmap_iterator bi;
+
+ sbitmap_free (old_ssa_names);
+ old_ssa_names = NULL;
+
+ sbitmap_free (new_ssa_names);
+ new_ssa_names = NULL;
+
+ htab_delete (repl_tbl);
+ repl_tbl = NULL;
+
+ need_to_initialize_update_ssa_p = true;
+ need_to_update_vops_p = false;
+ need_to_replace_names_p = false;
+ BITMAP_FREE (syms_to_rename);
+ BITMAP_FREE (old_virtual_ssa_names);
+
+ if (names_to_release)
+ {
+ EXECUTE_IF_SET_IN_BITMAP (names_to_release, 0, i, bi)
+ release_ssa_name (ssa_name (i));
+ BITMAP_FREE (names_to_release);
+ }
+
+ for (i = 1; i < num_ssa_names; i++)
+ {
+ tree n = ssa_name (i);
+
+ if (n)
+ {
+ free (SSA_NAME_AUX (n));
+ SSA_NAME_AUX (n) = NULL;
+ }
+ }
+
+ /* Unmark all the names we may have protected from being released in
+ insert_updated_phi_nodes_for. */
+ unmark_all_for_rewrite ();
+}
+
+
+/* Create a new name for OLD_NAME in statement STMT and replace the
+ operand pointed to by DEF_P with the newly created name. Return
+ the new name and register the replacement mapping <NEW, OLD> in
+ update_ssa's tables. */
+
+tree
+create_new_def_for (tree old_name, tree stmt, def_operand_p def)
+{
+ tree new_name = duplicate_ssa_name (old_name, stmt);
+
+ SET_DEF (def, new_name);
+
+ if (TREE_CODE (stmt) == PHI_NODE)
+ {
+ edge e;
+ edge_iterator ei;
+ basic_block bb = bb_for_stmt (stmt);
+
+ /* If needed, mark NEW_NAME as occurring in an abnormal PHI node. */
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ if (e->flags & EDGE_ABNORMAL)
+ {
+ SSA_NAME_OCCURS_IN_ABNORMAL_PHI (new_name) = 1;
+ break;
+ }
+ }
+
+ register_new_name_mapping (new_name, old_name);
+
+ /* For the benefit of passes that will be updating the SSA form on
+ their own, set the current reaching definition of OLD_NAME to be
+ NEW_NAME. */
+ set_current_def (old_name, new_name);
+
+ return new_name;
+}
+
+
+/* Register name NEW to be a replacement for name OLD. This function
+ must be called for every replacement that should be performed by
+ update_ssa. */
+
+void
+register_new_name_mapping (tree new, tree old)
+{
+ if (need_to_initialize_update_ssa_p)
+ init_update_ssa ();
+
+ add_new_name_mapping (new, old);
+}
+
+
+/* Register symbol SYM to be renamed by update_ssa. */
+
+void
+mark_sym_for_renaming (tree sym)
+{
+ if (need_to_initialize_update_ssa_p)
+ init_update_ssa ();
+
+ bitmap_set_bit (syms_to_rename, var_ann (sym)->uid);
+
+ if (!is_gimple_reg (sym))
+ need_to_update_vops_p = true;
+}
+
+
+/* Register all the symbols in SET to be renamed by update_ssa. */
+
+void
+mark_set_for_renaming (bitmap set)
+{
+ bitmap_iterator bi;
+ unsigned i;
+
+ if (need_to_initialize_update_ssa_p)
+ init_update_ssa ();
+
+ bitmap_ior_into (syms_to_rename, set);
+
+ EXECUTE_IF_SET_IN_BITMAP (set, 0, i, bi)
+ if (!is_gimple_reg (referenced_var (i)))
+ {
+ need_to_update_vops_p = true;
+ break;
+ }
+}
+
+
+/* Return true if there is any work to be done by update_ssa. */
+
+bool
+need_ssa_update_p (void)
+{
+ return syms_to_rename || old_ssa_names || new_ssa_names;
+}
+
+
+/* Return true if name N has been registered in the replacement table. */
+
+bool
+name_registered_for_update_p (tree n)
+{
+ if (!need_ssa_update_p ())
+ return false;
+
+ return is_new_name (n)
+ || is_old_name (n)
+ || symbol_marked_for_renaming (SSA_NAME_VAR (n));
+}
+
+
+/* Return the set of all the SSA names marked to be replaced. */
+
+bitmap
+ssa_names_to_replace (void)
+{
+ unsigned i;
+ bitmap ret;
+
+ ret = BITMAP_ALLOC (NULL);
+ EXECUTE_IF_SET_IN_SBITMAP (old_ssa_names, 0, i,
+ bitmap_set_bit (ret, i));
+
+ bitmap_ior_into (ret, old_virtual_ssa_names);
+
+ return ret;
+}
+
+
+/* Mark NAME to be released after update_ssa has finished. */
+
+void
+release_ssa_name_after_update_ssa (tree name)
+{
+ gcc_assert (!need_to_initialize_update_ssa_p);
+
+ if (names_to_release == NULL)
+ names_to_release = BITMAP_ALLOC (NULL);
+
+ bitmap_set_bit (names_to_release, SSA_NAME_VERSION (name));
+}
+
+
+/* Insert new PHI nodes to replace VAR. DFS contains dominance
+ frontier information. BLOCKS is the set of blocks to be updated.
+
+ This is slightly different than the regular PHI insertion
+ algorithm. The value of UPDATE_FLAGS controls how PHI nodes for
+ real names (i.e., GIMPLE registers) are inserted:
+
+ - If UPDATE_FLAGS == TODO_update_ssa, we are only interested in PHI
+ nodes inside the region affected by the block that defines VAR
+ and the blocks that define all its replacements. All these
+ definition blocks have been gathered by prepare_block_for_update
+ and they are stored in DEF_BLOCKS[VAR]->DEF_BLOCKS.
+
+ First, we compute the entry point to the region (ENTRY). This is
+ given by the nearest common dominator to all the definition
+ blocks. When computing the iterated dominance frontier (IDF), any
+ block not strictly dominated by ENTRY is ignored.
+
+ We then call the standard PHI insertion algorithm with the pruned
+ IDF.
+
+ - If UPDATE_FLAGS == TODO_update_ssa_full_phi, the IDF for real
+ names is not pruned. PHI nodes are inserted at every IDF block. */
+
+static void
+insert_updated_phi_nodes_for (tree var, bitmap *dfs, bitmap blocks,
+ unsigned update_flags)
+{
+ basic_block entry;
+ struct def_blocks_d *db;
+ bitmap idf, pruned_idf;
+ bitmap_iterator bi;
+ unsigned i;
+
+#if defined ENABLE_CHECKING
+ if (TREE_CODE (var) == SSA_NAME)
+ gcc_assert (is_old_name (var));
+ else
+ gcc_assert (symbol_marked_for_renaming (var));
+#endif
+
+ /* Get all the definition sites for VAR. */
+ db = find_def_blocks_for (var);
+
+ /* No need to do anything if there were no definitions to VAR. */
+ if (db == NULL || bitmap_empty_p (db->def_blocks))
+ return;
+
+ /* Compute the initial iterated dominance frontier. */
+ idf = find_idf (db->def_blocks, dfs);
+ pruned_idf = BITMAP_ALLOC (NULL);
+
+ if (TREE_CODE (var) == SSA_NAME)
+ {
+ if (update_flags == TODO_update_ssa)
+ {
+ /* If doing regular SSA updates for GIMPLE registers, we are
+ only interested in IDF blocks dominated by the nearest
+ common dominator of all the definition blocks. */
+ entry = nearest_common_dominator_for_set (CDI_DOMINATORS,
+ db->def_blocks);
+
+ if (entry != ENTRY_BLOCK_PTR)
+ EXECUTE_IF_SET_IN_BITMAP (idf, 0, i, bi)
+ if (BASIC_BLOCK (i) != entry
+ && dominated_by_p (CDI_DOMINATORS, BASIC_BLOCK (i), entry))
+ bitmap_set_bit (pruned_idf, i);
+ }
+ else
+ {
+ /* Otherwise, do not prune the IDF for VAR. */
+ gcc_assert (update_flags == TODO_update_ssa_full_phi);
+ bitmap_copy (pruned_idf, idf);
+ }
+ }
+ else
+ {
+ /* Otherwise, VAR is a symbol that needs to be put into SSA form
+ for the first time, so we need to compute the full IDF for
+ it. */
+ bitmap_copy (pruned_idf, idf);
+
+ /* There may already be PHI nodes for VAR in the flowgraph.
+ Some of them are no longer necessary. PRUNED_IDF is
+ the set of blocks that need PHI nodes for VAR and
+ DB.PHI_BLOCKS is the set of blocks that already contain a PHI
+ node for VAR. Therefore, the set DB.PHI_BLOCKS - PRUNED_IDF
+ gives us the set of blocks that contain PHI nodes which are
+ no longer needed. */
+ if (!bitmap_empty_p (db->phi_blocks) && !bitmap_empty_p (pruned_idf))
+ EXECUTE_IF_AND_COMPL_IN_BITMAP (db->phi_blocks, pruned_idf, 0, i, bi)
+ {
+ tree phi, prev;
+ unsigned ver;
+
+ phi = find_phi_node_for (BASIC_BLOCK (i), var, &prev);
+
+ /* Protect the name on PHI's LHS from being released into
+ the SSA name free list. Since we have still not
+ updated the SSA form of the program, there may be
+ instances of PHI's LHS in the IL. */
+ ver = SSA_NAME_VERSION (PHI_RESULT (phi));
+ mark_for_rewrite (PHI_RESULT (phi));
+ release_ssa_name_after_update_ssa (PHI_RESULT (phi));
+ remove_phi_node (phi, prev);
+ }
+ }
+
+ if (!bitmap_empty_p (pruned_idf))
+ {
+ /* Make sure that PRUNED_IDF blocks and all their feeding blocks
+ are included in the region to be updated. The feeding blocks
+ are important to guarantee that the PHI arguments are renamed
+ properly. */
+ bitmap_ior_into (blocks, pruned_idf);
+ EXECUTE_IF_SET_IN_BITMAP (pruned_idf, 0, i, bi)
+ {
+ edge e;
+ edge_iterator ei;
+ basic_block bb = BASIC_BLOCK (i);
+
+ FOR_EACH_EDGE (e, ei, bb->preds)
+ if (e->src->index >= 0)
+ bitmap_set_bit (blocks, e->src->index);
+ }
+
+ insert_phi_nodes_for (var, pruned_idf, true);
+ }
+
+ BITMAP_FREE (pruned_idf);
+ BITMAP_FREE (idf);
+}
+
+
+/* Given a set of newly created SSA names (NEW_SSA_NAMES) and a set of
+ existing SSA names (OLD_SSA_NAMES), update the SSA form so that:
+
+ 1- The names in OLD_SSA_NAMES dominated by the definitions of
+ NEW_SSA_NAMES are all re-written to be reached by the
+ appropriate definition from NEW_SSA_NAMES.
+
+ 2- If needed, new PHI nodes are added to the iterated dominance
+ frontier of the blocks where each of NEW_SSA_NAMES are defined.
+
+ The mapping between OLD_SSA_NAMES and NEW_SSA_NAMES is setup by
+ calling register_new_name_mapping for every pair of names that the
+ caller wants to replace.
+
+ The caller identifies the new names that have been inserted and the
+ names that need to be replaced by calling register_new_name_mapping
+ for every pair <NEW, OLD>. Note that the function assumes that the
+ new names have already been inserted in the IL.
+
+ For instance, given the following code:
+
+ 1 L0:
+ 2 x_1 = PHI (0, x_5)
+ 3 if (x_1 < 10)
+ 4 if (x_1 > 7)
+ 5 y_2 = 0
+ 6 else
+ 7 y_3 = x_1 + x_7
+ 8 endif
+ 9 x_5 = x_1 + 1
+ 10 goto L0;
+ 11 endif
+
+ Suppose that we insert new names x_10 and x_11 (lines 4 and 8).
+
+ 1 L0:
+ 2 x_1 = PHI (0, x_5)
+ 3 if (x_1 < 10)
+ 4 x_10 = ...
+ 5 if (x_1 > 7)
+ 6 y_2 = 0
+ 7 else
+ 8 x_11 = ...
+ 9 y_3 = x_1 + x_7
+ 10 endif
+ 11 x_5 = x_1 + 1
+ 12 goto L0;
+ 13 endif
+
+ We want to replace all the uses of x_1 with the new definitions of
+ x_10 and x_11. Note that the only uses that should be replaced are
+ those at lines 5, 9 and 11. Also, the use of x_7 at line 9 should
+ *not* be replaced (this is why we cannot just mark symbol 'x' for
+ renaming).
+
+ Additionally, we may need to insert a PHI node at line 11 because
+ that is a merge point for x_10 and x_11. So the use of x_1 at line
+ 11 will be replaced with the new PHI node. The insertion of PHI
+ nodes is optional. They are not strictly necessary to preserve the
+ SSA form, and depending on what the caller inserted, they may not
+ even be useful for the optimizers. UPDATE_FLAGS controls various
+ aspects of how update_ssa operates, see the documentation for
+ TODO_update_ssa*. */
+
+void
+update_ssa (unsigned update_flags)
+{
+ bitmap *dfs, blocks;
+ basic_block bb, start_bb;
+ bitmap_iterator bi;
+ unsigned i;
+ sbitmap tmp;
+ bool insert_phi_p;
+
+ if (!need_ssa_update_p ())
+ return;
+
+ timevar_push (TV_TREE_SSA_INCREMENTAL);
+
+ /* Ensure that the dominance information is up-to-date. */
+ calculate_dominance_info (CDI_DOMINATORS);
+
+ /* Only one update flag should be set. */
+ gcc_assert (update_flags == TODO_update_ssa
+ || update_flags == TODO_update_ssa_no_phi
+ || update_flags == TODO_update_ssa_full_phi
+ || update_flags == TODO_update_ssa_only_virtuals);
+
+ /* If we only need to update virtuals, remove all the mappings for
+ real names before proceeding. */
+ if (update_flags == TODO_update_ssa_only_virtuals)
+ {
+ sbitmap_zero (old_ssa_names);
+ sbitmap_zero (new_ssa_names);
+ htab_empty (repl_tbl);
+ need_to_replace_names_p = false;
+ }
+
+ if (update_flags == TODO_update_ssa
+ || update_flags == TODO_update_ssa_full_phi
+ || update_flags == TODO_update_ssa_only_virtuals)
+ insert_phi_p = true;
+ else
+ insert_phi_p = false;
+
+ if (insert_phi_p)
+ {
+ /* If the caller requested PHI nodes to be added, compute
+ dominance frontiers and initialize live-in information data
+ structures (DEF_BLOCKS). */
+ dfs = (bitmap *) xmalloc (last_basic_block * sizeof (bitmap *));
+ FOR_EACH_BB (bb)
+ dfs[bb->index] = BITMAP_ALLOC (NULL);
+ compute_dominance_frontiers (dfs);
+
+ /* For each SSA name N, the DEF_BLOCKS table describes where the
+ name is defined, which blocks have PHI nodes for N, and which
+ blocks have uses of N (i.e., N is live-on-entry in those
+ blocks). */
+ def_blocks = htab_create (num_ssa_names, def_blocks_hash,
+ def_blocks_eq, def_blocks_free);
+ }
+ else
+ {
+ dfs = NULL;
+ def_blocks = NULL;
+ }
+
+ blocks = BITMAP_ALLOC (NULL);
+
+ /* Determine the CFG region that we are going to update. First add
+ all the blocks that define each of the names in NEW_SSA_NAMES
+ and OLD_SSA_NAMES. */
+ prepare_def_sites (blocks, insert_phi_p);
+
+ /* Next, determine the nearest common dominator START_BB for all the
+ blocks in the region. */
+ if (!bitmap_empty_p (syms_to_rename) || bitmap_empty_p (blocks))
+ {
+ /* If the region to update is seemingly empty, or if we have to
+ rename some symbols from scratch, we need to start the
+ process at the root of the CFG.
+
+ FIXME, it should be possible to determine the nearest block
+ that had a definition for each of the symbols that are marked
+ for updating. For now this seems more work than it's worth. */
+ start_bb = ENTRY_BLOCK_PTR;
+ }
+ else
+ start_bb = nearest_common_dominator_for_set (CDI_DOMINATORS, blocks);
+
+ /* Traverse all the blocks dominated by START_BB. Mark interesting
+ blocks and statements and set local live-in information for the
+ PHI placement heuristics. */
+ prepare_block_for_update (start_bb, insert_phi_p, blocks, true);
+
+ /* If are going to insert PHI nodes, blocks in the dominance
+ frontier of START_BB may be affected. Note that we don't need to
+ visit the dominator children of blocks in the dominance frontier
+ of START_BB. None of the changes inside this region can affect
+ blocks on the outside. */
+ if (insert_phi_p && start_bb->index >= 0)
+ EXECUTE_IF_SET_IN_BITMAP (dfs[start_bb->index], 0, i, bi)
+ prepare_block_for_update (BASIC_BLOCK (i), insert_phi_p,
+ blocks, false);
+
+ /* If requested, insert PHI nodes at the iterated dominance frontier
+ of every block making new definitions for names in OLD_SSA_NAMES
+ and for symbols in SYMS_TO_RENAME. */
+ if (insert_phi_p)
+ {
+ if (sbitmap_first_set_bit (old_ssa_names) >= 0)
+ {
+ /* insert_update_phi_nodes_for will call
+ add_new_name_mapping when inserting new PHI nodes, so the
+ set OLD_SSA_NAMES will grow while we are traversing it
+ (but it will not gain any new members). Copy
+ OLD_SSA_NAMES to a temporary for traversal. */
+ sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits);
+ sbitmap_copy (tmp, old_ssa_names);
+ EXECUTE_IF_SET_IN_SBITMAP (tmp, 0, i,
+ insert_updated_phi_nodes_for (ssa_name (i), dfs, blocks,
+ update_flags));
+ sbitmap_free (tmp);
+ }
+
+ EXECUTE_IF_SET_IN_BITMAP (syms_to_rename, 0, i, bi)
+ insert_updated_phi_nodes_for (referenced_var (i), dfs, blocks,
+ update_flags);
+
+ /* Insertion of PHI nodes may have added blocks to the region.
+ We need to re-compute START_BB to include the newly added
+ blocks. */
+ if (start_bb != ENTRY_BLOCK_PTR)
+ start_bb = nearest_common_dominator_for_set (CDI_DOMINATORS, blocks);
+ }
+
+ /* Reset the current definition for name and symbol before renaming
+ the sub-graph. */
+ if (update_flags == TODO_update_ssa_full_phi)
+ {
+ /* If we are not prunning the IDF for new PHI nodes, set the
+ current name of every GIMPLE register to NULL. This way, PHI
+ arguments coming from edges with uninitialized values will be
+ renamed to use the symbol's default definition. */
+ EXECUTE_IF_SET_IN_SBITMAP (old_ssa_names, 0, i,
+ set_current_def (ssa_name (i), NULL_TREE));
+ }
+ else
+ {
+ /* Otherwise, set each old name to be its current reaching
+ definition. */
+ EXECUTE_IF_SET_IN_SBITMAP (old_ssa_names, 0, i,
+ set_current_def (ssa_name (i), NULL_TREE));
+ }
+
+ EXECUTE_IF_SET_IN_BITMAP (syms_to_rename, 0, i, bi)
+ set_current_def (referenced_var (i), NULL_TREE);
+
+ /* Now start the renaming process at START_BB. */
+ tmp = sbitmap_alloc (last_basic_block);
+ sbitmap_zero (tmp);
+ EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
+ SET_BIT (tmp, i);
+
+ rewrite_blocks (start_bb, REWRITE_UPDATE, tmp);
+
+ sbitmap_free (tmp);
+
+ /* Debugging dumps. */
+ if (dump_file)
+ {
+ int c;
+ unsigned i;
+
+ dump_repl_tbl (dump_file);
+
+ fprintf (dump_file, "Incremental SSA update started at block: %d\n\n",
+ start_bb->index);
+
+ c = 0;
+ EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
+ c++;
+ fprintf (dump_file, "Number of blocks in CFG: %d\n", last_basic_block);
+ fprintf (dump_file, "Number of blocks to update: %d (%3.0f%%)\n\n",
+ c, PERCENT (c, last_basic_block));
+
+ if (dump_flags & TDF_DETAILS)
+ {
+ fprintf (dump_file, "Affected blocks: ");
+ EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
+ fprintf (dump_file, "%u ", i);
+ fprintf (dump_file, "\n");
+ }
+
+ fprintf (dump_file, "\n\n");
+ }
+
+ /* Free allocated memory. */
+ if (insert_phi_p)
+ {
+ FOR_EACH_BB (bb)
+ BITMAP_FREE (dfs[bb->index]);
+ free (dfs);
+ }
+
+ BITMAP_FREE (blocks);
+ delete_update_ssa ();
+
+ timevar_pop (TV_TREE_SSA_INCREMENTAL);
+}
+
/*---------------------------------------------------------------------------
Functions to fix a program in invalid SSA form into valid SSA
if (TEST_BIT (gd->names_to_rename, def_uid))
{
- set_def_block (def, bb, false, true);
+ set_def_block (def, bb, false);
bitmap_set_bit (kills, def_uid);
}
}
if (!TEST_BIT (gd->names_to_rename, def_uid))
continue;
- set_def_block (def, bb, true, true);
+ set_def_block (def, bb, true);
bitmap_set_bit (kills, def_uid);
}
}
mark definition sites. */
walk_data.walk_stmts_backward = false;
walk_data.dom_direction = CDI_DOMINATORS;
+ walk_data.interesting_blocks = NULL;
walk_data.initialize_block_local_data = NULL;
walk_data.before_dom_children_before_stmts
= ssa_mark_def_sites_initialize_block;
/* Setup callbacks for the generic dominator tree walker. */
walk_data.walk_stmts_backward = false;
walk_data.dom_direction = CDI_DOMINATORS;
+ walk_data.interesting_blocks = NULL;
walk_data.initialize_block_local_data = NULL;
walk_data.before_dom_children_before_stmts = ssa_rewrite_initialize_block;
walk_data.before_dom_children_walk_stmts = ssa_rewrite_stmt;
projects / thirdparty / gcc.git / blobdiff