static inline void
finalize_ssa_uses (struct function *fn, gimple *stmt)
{
unsigned new_i;
struct use_optype_d new_list;
use_optype_p old_ops, ptr, last;
/* Pre-pend the VUSE we may have built. */
if (build_vuse != NULL_TREE)
{
tree oldvuse = gimple_vuse (stmt);
if (oldvuse
&& TREE_CODE (oldvuse) == SSA_NAME)
oldvuse = SSA_NAME_VAR (oldvuse);
if (oldvuse != (build_vuse != NULL_TREE
? build_vuse : build_vdef))
gimple_set_vuse (stmt, NULL_TREE);
build_uses.safe_insert (0, gimple_vuse_ptr (stmt));
}
new_list.next = NULL;
last = &new_list;
old_ops = gimple_use_ops (stmt);
/* Clear a no longer necessary VUSE. */
if (build_vuse == NULL_TREE
&& gimple_vuse (stmt) != NULL_TREE)
gimple_set_vuse (stmt, NULL_TREE);
/* If there is anything in the old list, free it. */
if (old_ops)
{
for (ptr = old_ops; ptr->next; ptr = ptr->next)
delink_imm_use (USE_OP_PTR (ptr));
delink_imm_use (USE_OP_PTR (ptr));
ptr->next = gimple_ssa_operands (fn)->free_uses;
gimple_ssa_operands (fn)->free_uses = old_ops;
}
/* If we added a VUSE, make sure to set the operand if it is not already
present and mark it for renaming. */
if (build_vuse != NULL_TREE
&& gimple_vuse (stmt) == NULL_TREE)
{
gimple_set_vuse (stmt, gimple_vop (fn));
fn->gimple_df->rename_vops = 1;
fn->gimple_df->ssa_renaming_needed = 1;
}
/* Now create nodes for all the new nodes. */
for (new_i = 0; new_i < build_uses.length (); new_i++)
{
tree *op = build_uses[new_i];
last = add_use_op (fn, stmt, op, last);
}
/* Now set the stmt's operands. */
gimple_set_use_ops (stmt, new_list.next);
}
void
free_stmt_operands (gimple stmt)
{
def_optype_p defs = gimple_def_ops (stmt), last_def;
use_optype_p uses = gimple_use_ops (stmt), last_use;
if (defs)
{
for (last_def = defs; last_def->next; last_def = last_def->next)
continue;
last_def->next = gimple_ssa_operands (cfun)->free_defs;
gimple_ssa_operands (cfun)->free_defs = defs;
gimple_set_def_ops (stmt, NULL);
}
if (uses)
{
for (last_use = uses; last_use->next; last_use = last_use->next)
delink_imm_use (USE_OP_PTR (last_use));
delink_imm_use (USE_OP_PTR (last_use));
last_use->next = gimple_ssa_operands (cfun)->free_uses;
gimple_ssa_operands (cfun)->free_uses = uses;
gimple_set_use_ops (stmt, NULL);
}
if (gimple_has_mem_ops (stmt))
{
gimple_set_vuse (stmt, NULL_TREE);
gimple_set_vdef (stmt, NULL_TREE);
}
}
static inline void
finalize_ssa_uses (gimple stmt)
{
unsigned new_i;
struct use_optype_d new_list;
use_optype_p old_ops, ptr, last;
/* Pre-pend the VUSE we may have built. */
if (build_vuse != NULL_TREE)
{
tree oldvuse = gimple_vuse (stmt);
if (oldvuse
&& TREE_CODE (oldvuse) == SSA_NAME)
oldvuse = SSA_NAME_VAR (oldvuse);
if (oldvuse != (build_vuse != NULL_TREE
? build_vuse : build_vdef))
gimple_set_vuse (stmt, NULL_TREE);
VEC_safe_insert (tree, heap, build_uses, 0, (tree)gimple_vuse_ptr (stmt));
}
new_list.next = NULL;
last = &new_list;
old_ops = gimple_use_ops (stmt);
/* Clear a no longer necessary VUSE. */
if (build_vuse == NULL_TREE
&& gimple_vuse (stmt) != NULL_TREE)
gimple_set_vuse (stmt, NULL_TREE);
/* If there is anything in the old list, free it. */
if (old_ops)
{
for (ptr = old_ops; ptr; ptr = ptr->next)
delink_imm_use (USE_OP_PTR (ptr));
old_ops->next = gimple_ssa_operands (cfun)->free_uses;
gimple_ssa_operands (cfun)->free_uses = old_ops;
}
/* If we added a VUSE, make sure to set the operand if it is not already
present and mark it for renaming. */
if (build_vuse != NULL_TREE
&& gimple_vuse (stmt) == NULL_TREE)
{
gimple_set_vuse (stmt, gimple_vop (cfun));
mark_sym_for_renaming (gimple_vop (cfun));
}
/* Now create nodes for all the new nodes. */
for (new_i = 0; new_i < VEC_length (tree, build_uses); new_i++)
last = add_use_op (stmt,
(tree *) VEC_index (tree, build_uses, new_i),
last);
/* Now set the stmt's operands. */
gimple_set_use_ops (stmt, new_list.next);
}
void
swap_tree_operands (gimple stmt, tree *exp0, tree *exp1)
{
tree op0, op1;
op0 = *exp0;
op1 = *exp1;
/* If the operand cache is active, attempt to preserve the relative
positions of these two operands in their respective immediate use
lists by adjusting their use pointer to point to the new
operand position. */
if (ssa_operands_active () && op0 != op1)
{
use_optype_p use0, use1, ptr;
use0 = use1 = NULL;
/* Find the 2 operands in the cache, if they are there. */
for (ptr = gimple_use_ops (stmt); ptr; ptr = ptr->next)
if (USE_OP_PTR (ptr)->use == exp0)
{
use0 = ptr;
break;
}
for (ptr = gimple_use_ops (stmt); ptr; ptr = ptr->next)
if (USE_OP_PTR (ptr)->use == exp1)
{
use1 = ptr;
break;
}
/* And adjust their location to point to the new position of the
operand. */
if (use0)
USE_OP_PTR (use0)->use = exp1;
if (use1)
USE_OP_PTR (use1)->use = exp0;
}
/* Now swap the data. */
*exp0 = op1;
*exp1 = op0;
}
