This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] tree-flow-inline.h: Remove get_stmt_operands.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Cc: dnovillo at redhat dot com, amacleod at redhat dot com
- Date: Sat, 16 Apr 2005 09:58:04 -0400 (EDT)
- Subject: [patch] tree-flow-inline.h: Remove get_stmt_operands.
Hi,
Attached is a patch to remove get_stmt_operands as it has become a
no-op except some checks under ENABLE_CHECKING.
Tested on i686-pc-linux-gnu. OK to apply?
Kazu Hirata
2005-04-16 Kazu Hirata <kazu@cs.umass.edu>
* tree-flow-inline.h (get_stmt_operands): Remove.
* lambda-code.c, tree-ssa-loop-unswitch.c,
tree-ssa-operands.c, tree-ssa-pre.c, tree-ssa-propagate.c,
tree-ssa-sink.c, tree-ssa.c, tree-tailcall.c,
tree-vect-transform.c, tree-vectorizer.c, tree-vrp.c): Remove
calls to get_stmt_operands.
* doc/tree-ssa.texi: Don't mention get_stmt_operands.
Index: lambda-code.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/lambda-code.c,v
retrieving revision 2.33
diff -c -d -p -r2.33 lambda-code.c
*** lambda-code.c 11 Apr 2005 18:55:47 -0000 2.33
--- lambda-code.c 15 Apr 2005 20:57:48 -0000
*************** gcc_loop_to_lambda_loop (struct loop *lo
*** 1294,1300 ****
phi = SSA_NAME_DEF_STMT (inductionvar);
if (TREE_CODE (phi) != PHI_NODE)
{
- get_stmt_operands (phi);
uses = STMT_USE_OPS (phi);
if (!uses)
--- 1294,1299 ----
Index: tree-cfg.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-cfg.c,v
retrieving revision 2.172
diff -c -d -p -r2.172 tree-cfg.c
*** tree-cfg.c 13 Apr 2005 04:29:37 -0000 2.172
--- tree-cfg.c 15 Apr 2005 20:57:55 -0000
*************** tree_duplicate_bb (basic_block bb)
*** 4730,4738 ****
if (TREE_CODE (stmt) == LABEL_EXPR)
continue;
- /* Record the definitions. */
- get_stmt_operands (stmt);
-
FOR_EACH_SSA_TREE_OPERAND (val, stmt, op_iter, SSA_OP_ALL_DEFS)
mark_for_rewrite (val);
--- 4730,4735 ----
*************** rewrite_to_new_ssa_names_bb (basic_block
*** 4946,4952 ****
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
{
stmt = bsi_stmt (bsi);
- get_stmt_operands (stmt);
ann = stmt_ann (stmt);
uses = USE_OPS (ann);
--- 4943,4948 ----
Index: tree-flow-inline.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-flow-inline.h,v
retrieving revision 2.37
diff -c -d -p -r2.37 tree-flow-inline.h
*** tree-flow-inline.h 9 Apr 2005 01:37:23 -0000 2.37
--- tree-flow-inline.h 15 Apr 2005 20:57:55 -0000
*************** update_stmt_if_modified (tree t)
*** 172,198 ****
update_stmt_operands (t);
}
- static inline void
- get_stmt_operands (tree stmt ATTRIBUTE_UNUSED)
- {
- #ifdef ENABLE_CHECKING
- stmt_ann_t ann;
-
- /* The optimizers cannot handle statements that are nothing but a
- _DECL. This indicates a bug in the gimplifier. */
- gcc_assert (!SSA_VAR_P (stmt));
-
- /* Ignore error statements. */
- if (TREE_CODE (stmt) == ERROR_MARK)
- return;
-
- ann = get_stmt_ann (stmt);
- gcc_assert (!ann->modified);
-
- return;
- #endif
- }
-
/* Return true if T is marked as modified, false otherwise. */
static inline bool
stmt_modified_p (tree t)
--- 172,177 ----
Index: tree-outof-ssa.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-outof-ssa.c,v
retrieving revision 2.53
diff -c -d -p -r2.53 tree-outof-ssa.c
*** tree-outof-ssa.c 13 Apr 2005 04:29:39 -0000 2.53
--- tree-outof-ssa.c 15 Apr 2005 20:57:57 -0000
*************** rewrite_trees (var_map map, tree *values
*** 1885,1891 ****
stmt_ann_t ann;
ssa_op_iter iter;
- get_stmt_operands (stmt);
ann = stmt_ann (stmt);
changed = false;
--- 1885,1890 ----
Index: tree-ssa-alias.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-alias.c,v
retrieving revision 2.86
diff -c -d -p -r2.86 tree-ssa-alias.c
*** tree-ssa-alias.c 15 Apr 2005 16:53:12 -0000 2.86
--- tree-ssa-alias.c 15 Apr 2005 20:58:01 -0000
*************** compute_points_to_and_addr_escape (struc
*** 656,662 ****
statement. Note that this will miss all the addresses taken
in PHI nodes (those are discovered while following the use-def
chains). */
- get_stmt_operands (stmt);
addr_taken = addresses_taken (stmt);
if (addr_taken)
EXECUTE_IF_SET_IN_BITMAP (addr_taken, 0, i, bi)
--- 656,661 ----
Index: tree-ssa-ccp.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-ccp.c,v
retrieving revision 2.65
diff -c -d -p -r2.65 tree-ssa-ccp.c
*** tree-ssa-ccp.c 15 Apr 2005 14:06:07 -0000 2.65
--- tree-ssa-ccp.c 15 Apr 2005 20:58:03 -0000
*************** likely_value (tree stmt)
*** 475,482 ****
&& TREE_CODE (stmt) != SWITCH_EXPR)
return VARYING;
- get_stmt_operands (stmt);
-
found_constant = false;
FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE|SSA_OP_VUSE)
{
--- 475,480 ----
*************** ccp_initialize (void)
*** 525,532 ****
bool is_varying = false;
tree stmt = bsi_stmt (i);
- get_stmt_operands (stmt);
-
if (likely_value (stmt) == VARYING)
{
--- 523,528 ----
Index: tree-ssa-dce.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-dce.c,v
retrieving revision 2.39
diff -c -d -p -r2.39 tree-ssa-dce.c
*** tree-ssa-dce.c 9 Apr 2005 01:37:24 -0000 2.39
--- tree-ssa-dce.c 15 Apr 2005 20:58:04 -0000
*************** mark_stmt_if_obviously_necessary (tree s
*** 355,362 ****
return;
}
- get_stmt_operands (stmt);
-
FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
{
if (is_global_var (SSA_NAME_VAR (def)))
--- 355,360 ----
*************** propagate_necessity (struct edge_list *e
*** 539,546 ****
ssa_op_iter iter;
tree use;
- get_stmt_operands (i);
-
/* The operands of V_MAY_DEF expressions are also needed as they
represent potential definitions that may reach this
statement (V_MAY_DEF operands allow us to follow def-def
--- 537,542 ----
Index: tree-ssa-dse.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-dse.c,v
retrieving revision 2.20
diff -c -d -p -r2.20 tree-ssa-dse.c
*** tree-ssa-dse.c 9 Apr 2005 01:37:24 -0000 2.20
--- tree-ssa-dse.c 15 Apr 2005 20:58:05 -0000
*************** dse_optimize_stmt (struct dom_walk_data
*** 178,184 ****
stmt_ann_t ann = stmt_ann (stmt);
v_may_def_optype v_may_defs;
- get_stmt_operands (stmt);
v_may_defs = V_MAY_DEF_OPS (ann);
/* If this statement has no virtual defs, then there is nothing
--- 178,183 ----
Index: tree-ssa-live.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-live.c,v
retrieving revision 2.30
diff -c -d -p -r2.30 tree-ssa-live.c
*** tree-ssa-live.c 13 Mar 2005 15:57:31 -0000 2.30
--- tree-ssa-live.c 15 Apr 2005 20:58:06 -0000
*************** create_ssa_var_map (int flags)
*** 367,373 ****
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
{
stmt = bsi_stmt (bsi);
- get_stmt_operands (stmt);
/* Register USE and DEF operands in each statement. */
FOR_EACH_SSA_TREE_OPERAND (use , stmt, iter, SSA_OP_USE)
--- 367,372 ----
*************** calculate_live_on_entry (var_map map)
*** 612,618 ****
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
{
stmt = bsi_stmt (bsi);
- get_stmt_operands (stmt);
FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE)
{
--- 611,616 ----
*************** build_tree_conflict_graph (tree_live_inf
*** 1324,1331 ****
bool is_a_copy = false;
tree stmt = bsi_stmt (bsi);
- get_stmt_operands (stmt);
-
/* A copy between 2 partitions does not introduce an interference
by itself. If they did, you would never be able to coalesce
two things which are copied. If the two variables really do
--- 1322,1327 ----
Index: tree-ssa-loop-im.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-im.c,v
retrieving revision 2.36
diff -c -d -p -r2.36 tree-ssa-loop-im.c
*** tree-ssa-loop-im.c 11 Apr 2005 20:17:38 -0000 2.36
--- tree-ssa-loop-im.c 15 Apr 2005 20:58:08 -0000
*************** movement_possibility (tree stmt)
*** 220,227 ****
{
/* If we perform unswitching, force the operands of the invariant
condition to be moved out of the loop. */
- get_stmt_operands (stmt);
-
return MOVE_POSSIBLE;
}
--- 220,225 ----
*************** movement_possibility (tree stmt)
*** 231,238 ****
if (stmt_ends_bb_p (stmt))
return MOVE_IMPOSSIBLE;
- get_stmt_operands (stmt);
-
if (stmt_ann (stmt)->has_volatile_ops)
return MOVE_IMPOSSIBLE;
--- 229,234 ----
*************** determine_invariantness_stmt (struct dom
*** 622,628 ****
The multiply stmt is not invariant, so update iterator
and avoid rescanning. */
bsi_replace (&bsi, stmt1, true);
- get_stmt_operands (stmt1); /* Should not be necessary. */
bsi_insert_after (&bsi, stmt2, BSI_NEW_STMT);
SSA_NAME_DEF_STMT (lhs) = stmt2;
--- 618,623 ----
Index: tree-ssa-loop-ivopts.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-ivopts.c,v
retrieving revision 2.59
diff -c -d -p -r2.59 tree-ssa-loop-ivopts.c
*** tree-ssa-loop-ivopts.c 9 Apr 2005 01:37:24 -0000 2.59
--- tree-ssa-loop-ivopts.c 15 Apr 2005 20:58:13 -0000
*************** find_invariants_stmt (struct ivopts_data
*** 1553,1559 ****
n = PHI_NUM_ARGS (stmt);
else
{
- get_stmt_operands (stmt);
uses = STMT_USE_OPS (stmt);
n = NUM_USES (uses);
}
--- 1553,1558 ----
*************** protect_loop_closed_ssa_form (edge exit,
*** 4994,5001 ****
v_may_def_optype v_may_defs;
unsigned i;
- get_stmt_operands (stmt);
-
uses = STMT_USE_OPS (stmt);
for (i = 0; i < NUM_USES (uses); i++)
protect_loop_closed_ssa_form_use (exit, USE_OP_PTR (uses, i));
--- 4993,4998 ----
Index: tree-ssa-loop-manip.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-manip.c,v
retrieving revision 2.29
diff -c -d -p -r2.29 tree-ssa-loop-manip.c
*** tree-ssa-loop-manip.c 9 Apr 2005 01:37:24 -0000 2.29
--- tree-ssa-loop-manip.c 15 Apr 2005 20:58:13 -0000
*************** find_uses_to_rename_stmt (tree stmt, bit
*** 256,263 ****
tree var;
basic_block bb = bb_for_stmt (stmt);
- get_stmt_operands (stmt);
-
FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_ALL_USES | SSA_OP_ALL_KILLS)
find_uses_to_rename_use (bb, var, use_blocks);
}
--- 256,261 ----
*************** check_loop_closed_ssa_stmt (basic_block
*** 402,409 ****
ssa_op_iter iter;
tree var;
- get_stmt_operands (stmt);
-
FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_ALL_USES)
check_loop_closed_ssa_use (bb, var);
}
--- 400,405 ----
Index: tree-ssa-loop-niter.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-niter.c,v
retrieving revision 2.22
diff -c -d -p -r2.22 tree-ssa-loop-niter.c
*** tree-ssa-loop-niter.c 5 Apr 2005 23:52:41 -0000 2.22
--- tree-ssa-loop-niter.c 15 Apr 2005 20:58:15 -0000
*************** chain_of_csts_start (struct loop *loop,
*** 1028,1034 ****
if (TREE_CODE (stmt) != MODIFY_EXPR)
return NULL_TREE;
- get_stmt_operands (stmt);
if (NUM_VUSES (STMT_VUSE_OPS (stmt)) > 0)
return NULL_TREE;
if (NUM_V_MAY_DEFS (STMT_V_MAY_DEF_OPS (stmt)) > 0)
--- 1028,1033 ----
Index: tree-ssa-loop-unswitch.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-loop-unswitch.c,v
retrieving revision 2.8
diff -c -d -p -r2.8 tree-ssa-loop-unswitch.c
*** tree-ssa-loop-unswitch.c 5 Apr 2005 19:05:10 -0000 2.8
--- tree-ssa-loop-unswitch.c 15 Apr 2005 20:58:15 -0000
*************** tree_may_unswitch_on (basic_block bb, st
*** 128,134 ****
return NULL_TREE;
/* Condition must be invariant. */
- get_stmt_operands (stmt);
uses = STMT_USE_OPS (stmt);
for (i = 0; i < NUM_USES (uses); i++)
{
--- 128,133 ----
Index: tree-ssa-operands.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-operands.c,v
retrieving revision 2.76
diff -c -d -p -r2.76 tree-ssa-operands.c
*** tree-ssa-operands.c 9 Apr 2005 16:43:28 -0000 2.76
--- tree-ssa-operands.c 15 Apr 2005 20:58:18 -0000
*************** Boston, MA 02111-1307, USA. */
*** 50,57 ****
The routines in this file are concerned with creating this operand cache
from a stmt tree.
- get_stmt_operands() in the primary entry point.
-
The operand tree is the parsed by the various get_* routines which look
through the stmt tree for the occurrence of operands which may be of
interest, and calls are made to the append_* routines whenever one is
--- 50,55 ----
*************** Boston, MA 02111-1307, USA. */
*** 81,87 ****
*/
! /* Flags to describe operand properties in get_stmt_operands and helpers. */
/* By default, operands are loaded. */
#define opf_none 0
--- 79,85 ----
*/
! /* Flags to describe operand properties in helpers. */
/* By default, operands are loaded. */
#define opf_none 0
*************** finalize_ssa_uses (use_optype *old_ops_p
*** 520,528 ****
{
unsigned x;
/* If the pointer to the operand is the statement itself, something is
! wrong. It means that we are pointing to a local variable (the
! initial call to get_stmt_operands does not pass a pointer to a
! statement). */
for (x = 0; x < num; x++)
gcc_assert (*(VARRAY_TREE_PTR (build_uses, x)) != stmt);
}
--- 518,524 ----
{
unsigned x;
/* If the pointer to the operand is the statement itself, something is
! wrong. It means that we are pointing to a local variable. */
for (x = 0; x < num; x++)
gcc_assert (*(VARRAY_TREE_PTR (build_uses, x)) != stmt);
}
*************** swap_tree_operands (tree *exp0, tree *ex
*** 1219,1227 ****
*exp1 = op0;
}
! /* Get the operands of statement STMT. Note that repeated calls to
! get_stmt_operands for the same statement will do nothing until the
! statement is marked modified by a call to mark_stmt_modified(). */
void
update_stmt_operands (tree stmt)
--- 1215,1221 ----
*exp1 = op0;
}
! /* Get the operands of statement STMT. */
void
update_stmt_operands (tree stmt)
*************** update_stmt_operands (tree stmt)
*** 1229,1236 ****
stmt_ann_t ann;
stmt_operands_t old_operands;
! /* If get_stmt_operands is called before SSA is initialized, dont
! do anything. */
if (build_defs == NULL)
return;
/* The optimizers cannot handle statements that are nothing but a
--- 1223,1229 ----
stmt_ann_t ann;
stmt_operands_t old_operands;
! /* Don't do anything if we are called before SSA is initialized. */
if (build_defs == NULL)
return;
/* The optimizers cannot handle statements that are nothing but a
*************** update_stmt_operands (tree stmt)
*** 1249,1257 ****
build_ssa_operands (stmt, ann, &old_operands, &(ann->operands));
free_ssa_operands (&old_operands);
! /* Clear the modified bit for STMT. Subsequent calls to
! get_stmt_operands for this statement will do nothing until the
! statement is marked modified by a call to mark_stmt_modified(). */
ann->modified = 0;
timevar_pop (TV_TREE_OPS);
--- 1242,1248 ----
build_ssa_operands (stmt, ann, &old_operands, &(ann->operands));
free_ssa_operands (&old_operands);
! /* Clear the modified bit for STMT. */
ann->modified = 0;
timevar_pop (TV_TREE_OPS);
Index: tree-ssa-pre.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-pre.c,v
retrieving revision 2.77
diff -c -d -p -r2.77 tree-ssa-pre.c
*** tree-ssa-pre.c 15 Apr 2005 15:39:19 -0000 2.77
--- tree-ssa-pre.c 15 Apr 2005 20:58:20 -0000
*************** compute_avail (void)
*** 1958,1964 ****
stmt = bsi_stmt (bsi);
ann = stmt_ann (stmt);
- get_stmt_operands (stmt);
/* We are only interested in assignments of the form
X_i = EXPR, where EXPR represents an "interesting"
--- 1958,1963 ----
*************** remove_dead_inserted_code (void)
*** 2176,2183 ****
ssa_op_iter iter;
tree use;
- get_stmt_operands (t);
-
/* The operands of V_MAY_DEF expressions are also needed as they
represent potential definitions that may reach this
statement (V_MAY_DEF operands allow us to follow def-def
--- 2175,2180 ----
Index: tree-ssa-propagate.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-propagate.c,v
retrieving revision 2.12
diff -c -d -p -r2.12 tree-ssa-propagate.c
*** tree-ssa-propagate.c 9 Apr 2005 01:37:24 -0000 2.12
--- tree-ssa-propagate.c 15 Apr 2005 20:58:22 -0000
*************** substitute_and_fold (prop_value_t *prop_
*** 1032,1039 ****
bool replaced_address, did_replace;
tree stmt = bsi_stmt (i);
- get_stmt_operands (stmt);
-
/* Replace the statement with its folded version and mark it
folded. */
if (dump_file && (dump_flags & TDF_DETAILS))
--- 1032,1037 ----
Index: tree-ssa-sink.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-sink.c,v
retrieving revision 1.7
diff -c -d -p -r1.7 tree-ssa-sink.c
*** tree-ssa-sink.c 9 Apr 2005 01:37:24 -0000 1.7
--- tree-ssa-sink.c 15 Apr 2005 20:58:22 -0000
*************** sink_code_in_bb (basic_block bb)
*** 462,468 ****
tree stmt = bsi_stmt (bsi);
block_stmt_iterator tobsi;
tree sinkstmt;
- get_stmt_operands (stmt);
sinkstmt = statement_sink_location (stmt, bb);
if (!sinkstmt)
--- 462,467 ----
Index: tree-ssa.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa.c,v
retrieving revision 2.88
diff -c -d -p -r2.88 tree-ssa.c
*** tree-ssa.c 11 Apr 2005 22:06:43 -0000 2.88
--- tree-ssa.c 15 Apr 2005 20:58:23 -0000
*************** tree_ssa_useless_type_conversion (tree e
*** 930,939 ****
bool
stmt_references_memory_p (tree stmt)
{
! stmt_ann_t ann;
!
! get_stmt_operands (stmt);
! ann = stmt_ann (stmt);
if (ann->has_volatile_ops)
return true;
--- 930,936 ----
bool
stmt_references_memory_p (tree stmt)
{
! stmt_ann_t ann = stmt_ann (stmt);
if (ann->has_volatile_ops)
return true;
Index: tree-tailcall.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-tailcall.c,v
retrieving revision 2.39
diff -c -d -p -r2.39 tree-tailcall.c
*** tree-tailcall.c 5 Apr 2005 19:05:16 -0000 2.39
--- tree-tailcall.c 15 Apr 2005 20:58:24 -0000
*************** find_tail_calls (basic_block bb, struct
*** 394,401 ****
if (TREE_CODE (stmt) == LABEL_EXPR)
continue;
- get_stmt_operands (stmt);
-
/* Check for a call. */
if (TREE_CODE (stmt) == MODIFY_EXPR)
{
--- 394,399 ----
*************** eliminate_tail_call (struct tailcall *t)
*** 687,693 ****
block_stmt_iterator bsi;
stmt = bsi_stmt (t->call_bsi);
- get_stmt_operands (stmt);
ann = stmt_ann (stmt);
bb = t->call_block;
--- 685,690 ----
Index: tree-vect-transform.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-vect-transform.c,v
retrieving revision 2.14
diff -c -d -p -r2.14 tree-vect-transform.c
*** tree-vect-transform.c 15 Apr 2005 16:18:25 -0000 2.14
--- tree-vect-transform.c 15 Apr 2005 20:58:27 -0000
*************** vect_create_index_for_vector_ref (loop_v
*** 146,152 ****
create_iv (init, step, NULL_TREE, loop, &incr_bsi, insert_after,
&indx_before_incr, &indx_after_incr);
incr = bsi_stmt (incr_bsi);
- get_stmt_operands (incr);
set_stmt_info (stmt_ann (incr), new_stmt_vec_info (incr, loop_vinfo));
return indx_before_incr;
--- 146,151 ----
Index: tree-vectorizer.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-vectorizer.c,v
retrieving revision 2.86
diff -c -d -p -r2.86 tree-vectorizer.c
*** tree-vectorizer.c 12 Apr 2005 01:35:49 -0000 2.86
--- tree-vectorizer.c 15 Apr 2005 20:58:29 -0000
*************** rename_variables_in_bb (basic_block bb)
*** 282,288 ****
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
{
stmt = bsi_stmt (bsi);
- get_stmt_operands (stmt);
ann = stmt_ann (stmt);
uses = USE_OPS (ann);
--- 282,287 ----
*************** new_loop_vec_info (struct loop *loop)
*** 1485,1491 ****
tree stmt = bsi_stmt (si);
stmt_ann_t ann;
- get_stmt_operands (stmt);
ann = stmt_ann (stmt);
set_stmt_info (ann, new_stmt_vec_info (stmt, res));
}
--- 1484,1489 ----
Index: tree-vrp.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-vrp.c,v
retrieving revision 2.8
diff -c -d -p -r2.8 tree-vrp.c
*** tree-vrp.c 15 Apr 2005 01:29:29 -0000 2.8
--- tree-vrp.c 15 Apr 2005 20:58:32 -0000
*************** maybe_add_assert_expr (basic_block bb)
*** 1443,1449 ****
ssa_op_iter i;
stmt = bsi_stmt (si);
- get_stmt_operands (stmt);
/* Mark all the SSA names used by STMT in bitmap FOUND. If STMT
is inside the sub-graph of a conditional block, when we
--- 1443,1448 ----
Index: doc/tree-ssa.texi
===================================================================
RCS file: /cvs/gcc/gcc/gcc/doc/tree-ssa.texi,v
retrieving revision 1.23
diff -c -d -p -r1.23 tree-ssa.texi
*** doc/tree-ssa.texi 15 Apr 2005 16:29:34 -0000 1.23
--- doc/tree-ssa.texi 15 Apr 2005 20:58:33 -0000
*************** print_ops (tree stmt)
*** 886,900 ****
@}
@end smallexample
! Operands were once updated lazily via calls to @code{get_stmt_operands}.
! This function is now deprecated and operands are updated as soon as the
! statement is finished via a call to @code{update_stmt}. If statement elements
! are changed via @code{SET_USE} or @code{SET_DEF}, then no further action is
! required (ie, those macros take care of updating the statement). If
! changes are made by manipulating the statement's tree directly, then a call
must be made to @code{update_stmt} when complete. Calling one of the
! @code{bsi_insert} routines or @code{bsi_replace} performs an implicit call
! to @code{update_stmt}.
@subsection Operand Iterators
@cindex Operand Iterators
--- 886,899 ----
@}
@end smallexample
! Operands are updated as soon as the statement is finished via a call
! to @code{update_stmt}. If statement elements are changed via
! @code{SET_USE} or @code{SET_DEF}, then no further action is required
! (ie, those macros take care of updating the statement). If changes
! are made by manipulating the statement's tree directly, then a call
must be made to @code{update_stmt} when complete. Calling one of the
! @code{bsi_insert} routines or @code{bsi_replace} performs an implicit
! call to @code{update_stmt}.
@subsection Operand Iterators
@cindex Operand Iterators