tree-ssa-ccp.c (ccp_visit_stmt): Remove #if 0 guards.

	* tree-ssa-ccp.c (ccp_visit_stmt): Remove #if 0 guards.
	* tree-ssa-propagate.c: Fix documentation.

From-SVN: r86726

gcc/ChangeLog

+2004-08-29  Diego Novillo  <dnovillo@redhat.com>
+
+	* tree-ssa-ccp.c (ccp_visit_stmt): Remove #if 0 guards.
+	* tree-ssa-propagate.c: Fix documentation.
+
 2004-08-29  Richard Sandiford  <rsandifo@redhat.com>
 
 	* config/mips/mips.md (*mov[sd]f_on_*): Redefine using :SCALARF.

gcc/tree-ssa-ccp.c

@@ -1168,10 +1168,8 @@ ccp_visit_stmt (tree stmt, edge *taken_edge_p, tree *output_p)
 
   /* 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.

gcc/tree-ssa-propagate.c

@@ -50,7 +50,7 @@
    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
+      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,7 +75,7 @@
 
    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.
+      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