This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Fix tree-ssa-propagate.c documentation
- From: Diego Novillo <dnovillo at redhat dot com>
- To: "gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>
- Date: Sun, 29 Aug 2004 11:48:30 -0400
- Subject: Fix tree-ssa-propagate.c documentation
- Organization: Red Hat Canada
Thanks to Steven for spotting these.
Diego.
* tree-ssa-ccp.c (ccp_visit_stmt): Remove #if 0 guards.
* tree-ssa-propagate.c: Fix documentation.
Index: tree-ssa-ccp.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-ccp.c,v
retrieving revision 2.34
diff -d -c -p -r2.34 tree-ssa-ccp.c
*** tree-ssa-ccp.c 29 Aug 2004 06:16:02 -0000 2.34
--- tree-ssa-ccp.c 29 Aug 2004 15:40:41 -0000
*************** ccp_visit_stmt (tree stmt, edge *taken_e
*** 1168,1177 ****
/* Any other kind of statement is not interesting for constant
propagation and, therefore, not worth simulating. */
- #if 0
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "No interesting values produced. Marked VARYING.\n");
- #endif
/* Definitions made by statements other than assignments to
SSA_NAMEs represent unknown modifications to their outputs.
--- 1168,1175 ----
Index: tree-ssa-propagate.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-propagate.c,v
retrieving revision 2.1
diff -d -c -p -r2.1 tree-ssa-propagate.c
*** tree-ssa-propagate.c 29 Aug 2004 06:16:02 -0000 2.1
--- tree-ssa-propagate.c 29 Aug 2004 15:40:41 -0000
***************
*** 50,56 ****
proceeds as follows:
1- Initially, all edges of the CFG are marked not executable and
! the CFG worklist seeded with all the statements in the entry
basic block (block 0).
2- Every statement S is simulated with a call to the call-back
--- 50,56 ----
proceeds as follows:
1- Initially, all edges of the CFG are marked not executable and
! the CFG worklist is seeded with all the statements in the entry
basic block (block 0).
2- Every statement S is simulated with a call to the call-back
***************
*** 75,81 ****
3- PHI nodes are simulated with a call to SSA_PROP_VISIT_PHI. The
return value from SSA_PROP_VISIT_PHI has the same semantics as
! described in #3.
4- Three work lists are kept. Statements are only added to these
lists if they produce one of SSA_PROP_INTERESTING or
--- 75,81 ----
3- PHI nodes are simulated with a call to SSA_PROP_VISIT_PHI. The
return value from SSA_PROP_VISIT_PHI has the same semantics as
! described in #2.
4- Three work lists are kept. Statements are only added to these
lists if they produce one of SSA_PROP_INTERESTING or