cgraphunit.c, [...]: Fix comment typos.

	* cgraphunit.c, predict.c, tree-ssa-loop-ivopts.c: Fix comment
	typos.

From-SVN: r87283

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e9f8cdfdd6655d846466f886d80468f3f8e35895..5053005a10abc827cc5b3e21680290bcebadb10d 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,8 @@
+2004-09-10  Kazu Hirata  <kazu@cs.umass.edu>
+
+       * cgraphunit.c, predict.c, tree-ssa-loop-ivopts.c: Fix comment
+       typos.
+
 2004-09-10  Paolo Bonzini  <bonzini@gnu.org>
 
        * cgraph.h (cgraph_dump_file): Do not declare.

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index bc14983b56e1399d5eaccee30a957833fa525aa0..e297c217839b4d7e1f4a43710c0310d674de7bc1 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -823,7 +823,7 @@ cgraph_expand_function (struct cgraph_node *node)
       DECL_SAVED_TREE (node->decl) = NULL;
       DECL_STRUCT_FUNCTION (node->decl) = NULL;
       DECL_INITIAL (node->decl) = error_mark_node;
-      /* Elliminate all call edges.  This is important so the call_expr no longer
+      /* Eliminate all call edges.  This is important so the call_expr no longer
         points to the dead function body.  */
       while (node->callees)
        cgraph_remove_edge (node->callees);

diff --git a/gcc/predict.c b/gcc/predict.c
index 99dac1c138651073ded5fcf1462b8ddb752db14d..fbbc1579b39349fe6ee06f33fa9c61423eb3b068 100644 (file)
--- a/gcc/predict.c
+++ b/gcc/predict.c
@@ -313,7 +313,7 @@ dump_prediction (FILE *file, enum br_predictor predictor, int probability,
   fprintf (file, "\n");
 }
 
-/* We can not predict the probabilities of ougtoing edges of bb.  Set them
+/* We can not predict the probabilities of outgoing edges of bb.  Set them
    evenly and hope for the best.  */
 static void
 set_even_probabilities (basic_block bb)
@@ -846,7 +846,7 @@ estimate_probability (struct loops *loops_info)
     profile_status = PROFILE_GUESSED;
 }
 
-/* Set edge->probability for each succestor edge of BB.  */
+/* Set edge->probability for each successor edge of BB.  */
 void
 guess_outgoing_edge_probabilities (basic_block bb)
 {

diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index 4ff3e0df617b7c2b40f587f4e22b3bbd2b2126b1..c8e3762a5e9601ba18dd8566436dd37e45d3672f 100644 (file)
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -1559,7 +1559,7 @@ add_standard_iv_candidates (struct ivopts_data *data)
                 build_int_cst (unsigned_intSI_type_node, 1),
                 true, NULL);
 
-  /* The same for a long type if it is still fast enought.  */
+  /* The same for a long type if it is still fast enough.  */
   if (BITS_PER_WORD > 32)
     add_candidate (data,
                   build_int_cst (unsigned_intDI_type_node, 0),