Fix typos.

From-SVN: r201108

gcc/tree-eh.c

@@ -4383,7 +4383,7 @@ cleanup_all_empty_eh (void)
     2) MUST_NOT_THROW regions that became dead because of 1) are optimized out
     3) Info about regions that are containing instructions, and regions
        reachable via local EH edges is collected
-    4) Eh tree is pruned for regions no longer neccesary.
+    4) Eh tree is pruned for regions no longer necessary.
 
    TODO: Push MUST_NOT_THROW regions to the root of the EH tree.
 	 Unify those that have the same failure decl and locus.

gcc/tree-ssa-dce.c

@@ -1110,7 +1110,7 @@ forward_edge_to_pdom (edge e, basic_block post_dom_bb)
   e2 = redirect_edge_and_branch (e, post_dom_bb);
   cfg_altered = true;
 
-  /* If edge was already around, no updating is neccesary.  */
+  /* If edge was already around, no updating is necessary.  */
   if (e2 != e)
     return e2;
 

gcc/tree-ssa-loop-ivcanon.c

@@ -376,7 +376,7 @@ tree_estimate_loop_size (struct loop *loop, edge exit, edge edge_to_cancel, stru
    is dead and that some instructions will be eliminated after
    peeling.
 
-   Loop body is likely going to simplify futher, this is difficult
+   Loop body is likely going to simplify further, this is difficult
    to guess, we just decrease the result by 1/3.  */
 
 static unsigned HOST_WIDE_INT
@@ -782,7 +782,7 @@ try_unroll_loop_completely (struct loop *loop,
 	 storing or cumulating the return value.  */
       else if (size.num_pure_calls_on_hot_path
 	       /* One IV increment, one test, one ivtmp store
-		  and one usefull stmt.  That is about minimal loop
+		  and one useful stmt.  That is about minimal loop
 		  doing pure call.  */
 	       && (size.non_call_stmts_on_hot_path
 		   <= 3 + size.num_pure_calls_on_hot_path))

gcc/tree-ssa-reassoc.c

@@ -1386,7 +1386,7 @@ undistribute_ops_list (enum tree_code opcode,
 	}
     }
 
-  /* Process the (operand, code) pairs in order of most occurence.  */
+  /* Process the (operand, code) pairs in order of most occurrence.  */
   candidates2 = sbitmap_alloc (length);
   while (!cvec.is_empty ())
     {

gcc/tree-ssa-structalias.c

@@ -4457,7 +4457,7 @@ find_func_aliases_for_builtin_call (gimple t)
 	}
       /* printf-style functions may have hooks to set pointers to
 	 point to somewhere into the generated string.  Leave them
-	 for a later excercise...  */
+	 for a later exercise...  */
       default:
 	/* Fallthru to general call handling.  */;
       }
@@ -5015,7 +5015,7 @@ find_func_clobbers (gimple origt)
 	    return;
 	  /* printf-style functions may have hooks to set pointers to
 	     point to somewhere into the generated string.  Leave them
-	     for a later excercise...  */
+	     for a later exercise...  */
 	  default:
 	    /* Fallthru to general call handling.  */;
 	  }

gcc/tree-ssa-tail-merge.c

@@ -1615,7 +1615,7 @@ tail_merge_optimize (unsigned int todo)
       || max_iterations == 0
       /* We try to be conservative with respect to loop structure, since:
 	 - the cases where tail-merging could both affect loop structure and be
-	   benificial are rare,
+	   beneficial are rare,
 	 - it prevents us from having to fixup the loops using
 	   loops_state_set (LOOPS_NEED_FIXUP), and
 	 - keeping loop structure may allow us to simplify the pass.

gcc/tree-ssa-threadedge.c

@@ -585,7 +585,7 @@ cond_arg_set_in_bb (edge e, basic_block bb)
   gimple last = last_stmt (e->dest);
 
   /* E->dest does not have to end with a control transferring
-     instruction.  This can occurr when we try to extend a jump
+     instruction.  This can occur when we try to extend a jump
      threading opportunity deeper into the CFG.  In that case
      it is safe for this check to return false.  */
   if (!last)