ChangeLog.0, [...]: Fix spelling errors.

	* ChangeLog.0, ChangeLog.1, ChangeLog.2, ChangeLog.3, ChangeLog.4,
	ChangeLog.5, ChangeLog, FSFChangeLog.10, FSFChangeLog.11,
	c-common.c, c-common.h, c-parse.in, c-typeck.c, cfg.c, config.gcc,
	configure, configure.in, except.c, except.h, flow.c, function.c,
	gcc.c, gcse.c, genrecog.c, libgcc2.c, loop.c, loop.h, params.def,
	predict.def, predict.h, reg-stack.c, regmove.c, sched-deps.c,
	sched-int.h, sibcall.c, ssa.c, stringpool.c, toplev.c, tree.c,
	unroll.c: Fix spelling errors.

From-SVN: r46595

1 files changed, 7 insertions, 7 deletions

diff --git a/gcc/gcse.c b/gcc/gcse.c
index 4630eaa..a6cd29e 100644
--- a/gcc/gcse.c
+++ b/gcc/gcse.c
@@ -4741,14 +4741,14 @@ pre_edge_insert (edge_list, index_map)
 		struct expr *expr = index_map[j];
 		struct occr *occr;
 
-		/* Now look at each deleted occurence of this expression.  */
+		/* Now look at each deleted occurrence of this expression.  */
 		for (occr = expr->antic_occr; occr != NULL; occr = occr->next)
 		  {
 		    if (! occr->deleted_p)
 		      continue;
 
 		    /* Insert this expression on this edge if if it would
-		       reach the deleted occurence in BB.  */
+		       reach the deleted occurrence in BB.  */
 		    if (!TEST_BIT (inserted[e], j))
 		      {
 			rtx insn;
@@ -5693,7 +5693,7 @@ hoist_code ()
 		    hoistable++;
 		}
 
-	      /* If we found more than one hoistable occurence of this
+	      /* If we found more than one hoistable occurrence of this
 		 expression, then note it in the bitmap of expressions to
 		 hoist.  It makes no sense to hoist things which are computed
 		 in only one BB, and doing so tends to pessimize register
@@ -5744,7 +5744,7 @@ hoist_code ()
 		  /* The expression is computed in the dominated block and
 		     it would be safe to compute it at the start of the
 		     dominated block.  Now we have to determine if the
-		     expresion would reach the dominated block if it was
+		     expression would reach the dominated block if it was
 		     placed at the end of BB.  */
 		  if (hoist_expr_reaches_here_p (BASIC_BLOCK (bb), i, 
 						 BASIC_BLOCK (dominated), NULL))
@@ -5754,7 +5754,7 @@ hoist_code ()
 		      rtx insn;
 		      rtx set;
 
-		      /* Find the right occurence of this expression.  */
+		      /* Find the right occurrence of this expression.  */
 		      while (BLOCK_NUM (occr->insn) != dominated && occr)
 			occr = occr->next;
 
@@ -5856,7 +5856,7 @@ one_code_hoisting_pass ()
     load towards the exit, and we end up with no loads or stores of 'i'
     in the loop.  */
 
-/* This will search the ldst list for a matching expresion. If it
+/* This will search the ldst list for a matching expression. If it
    doesn't find one, we create one and initialize it.  */
 
 static struct ls_expr *
@@ -6767,7 +6767,7 @@ insert_store (expr, e)
   
   /* If we are inserting this expression on ALL predecessor edges of a BB,
      insert it at the start of the BB, and reset the insert bits on the other
-     edges so we don;t try to insert it on the other edges.  */
+     edges so we don't try to insert it on the other edges.  */
   bb = e->dest;
   for (tmp = e->dest->pred; tmp ; tmp = tmp->pred_next)
     {