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

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

From-SVN: r87283

gcc/ChangeLog

+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.

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);

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)
 {

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),