--- gcc/tree-ssanames.c.jj	2016-01-19 09:20:34.684621317 +0100
+++ gcc/tree-ssanames.c	2016-01-23 11:04:58.943667845 +0100
@@ -759,8 +759,8 @@ replace_ssa_name_symbol (tree ssa_name,
   TREE_TYPE (ssa_name) = TREE_TYPE (sym);
 }
 
-/* Release the vector of free SSA_NAMEs and compact the the
-   vector of SSA_NAMEs that are live.  */
+/* Release the vector of free SSA_NAMEs and compact the vector of SSA_NAMEs
+   that are live.  */
 
 static void
 release_free_names_and_compact_live_names (function *fun)
--- gcc/ipa-devirt.c.jj	2016-01-20 10:55:16.000000000 +0100
+++ gcc/ipa-devirt.c	2016-01-23 11:12:58.831782165 +0100
@@ -2246,7 +2246,7 @@ build_type_inheritance_graph (void)
     odr_vtable_hash = new odr_vtable_hash_type (23);
 
   /* We reconstruct the graph starting of types of all methods seen in the
-     the unit.  */
+     unit.  */
   FOR_EACH_SYMBOL (n)
     if (is_a <cgraph_node *> (n)
 	&& DECL_VIRTUAL_P (n->decl)
@@ -3406,7 +3406,7 @@ update_type_inheritance_graph (void)
   free_polymorphic_call_targets_hash ();
   timevar_push (TV_IPA_INHERITANCE);
   /* We reconstruct the graph starting from types of all methods seen in the
-     the unit.  */
+     unit.  */
   FOR_EACH_FUNCTION (n)
     if (DECL_VIRTUAL_P (n->decl)
 	&& !n->definition
--- gcc/tree.c.jj	2016-01-21 00:41:48.000000000 +0100
+++ gcc/tree.c	2016-01-23 11:14:10.887695051 +0100
@@ -8406,7 +8406,7 @@ build_function_type (tree value_type, tr
 
 /* Build a function type.  The RETURN_TYPE is the type returned by the
    function.  If VAARGS is set, no void_type_node is appended to the
-   the list.  ARGP must be always be terminated be a NULL_TREE.  */
+   list.  ARGP must be always be terminated be a NULL_TREE.  */
 
 static tree
 build_function_type_list_1 (bool vaargs, tree return_type, va_list argp)
--- gcc/cfgloopmanip.c.jj	2016-01-04 14:55:53.000000000 +0100
+++ gcc/cfgloopmanip.c	2016-01-23 11:11:23.835145225 +0100
@@ -569,7 +569,7 @@ scale_loop_profile (struct loop *loop, i
 	}
 
       /* Roughly speaking we want to reduce the loop body profile by the
-	 the difference of loop iterations.  We however can do better if
+	 difference of loop iterations.  We however can do better if
 	 we look at the actual profile, if it is available.  */
       scale = RDIV (iteration_bound * scale, iterations);
       if (loop->header->count)
--- gcc/tree-ssa-loop-ivopts.c.jj	2016-01-04 14:34:35.000000000 +0100
+++ gcc/tree-ssa-loop-ivopts.c	2016-01-23 11:15:04.917855839 +0100
@@ -4234,7 +4234,7 @@ get_address_cost (bool symbol_present, b
 }
 
  /* Calculate the SPEED or size cost of shiftadd EXPR in MODE.  MULT is the
-    the EXPR operand holding the shift.  COST0 and COST1 are the costs for
+    EXPR operand holding the shift.  COST0 and COST1 are the costs for
     calculating the operands of EXPR.  Returns true if successful, and returns
     the cost in COST.  */
 
--- gcc/gimple-ssa-split-paths.c.jj	2016-01-04 14:55:52.000000000 +0100
+++ gcc/gimple-ssa-split-paths.c	2016-01-23 11:12:15.332406316 +0100
@@ -74,7 +74,7 @@ find_block_to_duplicate_for_splitting_pa
 	    return NULL;
 
 	  /* And that BB's immediate dominator's successors are the
-	     the predecessors of BB.  */
+	     predecessors of BB.  */
 	  if (!find_edge (bb_idom, EDGE_PRED (bb, 0)->src)
 	      || !find_edge (bb_idom, EDGE_PRED (bb, 1)->src))
 	    return NULL;
--- gcc/tree-sra.c.jj	2016-01-19 09:20:33.000000000 +0100
+++ gcc/tree-sra.c	2016-01-23 11:14:32.110365414 +0100
@@ -2813,7 +2813,7 @@ generate_subtree_copies (struct access *
 }
 
 /* Assign zero to all scalar replacements in an access subtree.  ACCESS is the
-   the root of the subtree to be processed.  GSI is the statement iterator used
+   root of the subtree to be processed.  GSI is the statement iterator used
    for inserting statements which are added after the current statement if
    INSERT_AFTER is true or before it otherwise.  */
 
@@ -2853,7 +2853,7 @@ init_subtree_with_zero (struct access *a
     init_subtree_with_zero (child, gsi, insert_after, loc);
 }
 
-/* Clobber all scalar replacements in an access subtree.  ACCESS is the the
+/* Clobber all scalar replacements in an access subtree.  ACCESS is the
    root of the subtree to be processed.  GSI is the statement iterator used
    for inserting statements which are added after the current statement if
    INSERT_AFTER is true or before it otherwise.  */
--- gcc/expr.c.jj	2016-01-23 00:13:03.000000000 +0100
+++ gcc/expr.c	2016-01-23 11:11:43.380864773 +0100
@@ -485,7 +485,7 @@ convert_move (rtx to, rtx from, int unsi
       /* No special multiword conversion insn; do it by hand.  */
       start_sequence ();
 
-      /* Since we will turn this into a no conflict block, we must ensure the
+      /* Since we will turn this into a no conflict block, we must ensure
          the source does not overlap the target so force it into an isolated
          register when maybe so.  Likewise for any MEM input, since the
          conversion sequence might require several references to it and we
--- gcc/var-tracking.c.jj	2016-01-11 18:53:24.000000000 +0100
+++ gcc/var-tracking.c	2016-01-23 11:16:42.336342706 +0100
@@ -871,7 +871,7 @@ vt_stack_adjustments (void)
 	     pointer is often restored via a load-multiple instruction
 	     and so no stack_adjust offset is recorded for it.  This means
 	     that the stack offset at the end of the epilogue block is the
-	     the same as the offset before the epilogue, whereas other paths
+	     same as the offset before the epilogue, whereas other paths
 	     to the exit block will have the correct stack_adjust.
 
 	     It is safe to ignore these differences because (a) we never
--- gcc/tree-vect-data-refs.c.jj	2016-01-13 13:28:42.000000000 +0100
+++ gcc/tree-vect-data-refs.c	2016-01-23 11:15:45.149230953 +0100
@@ -1495,7 +1495,7 @@ vect_enhance_data_refs_alignment (loop_v
                  size (vector size / 8).  Vectorization factor will 8.  If both
                  access are misaligned by 3, the first one needs one scalar
                  iteration to be aligned, and the second one needs 5.  But the
-                 the first one will be aligned also by peeling 5 scalar
+		 first one will be aligned also by peeling 5 scalar
                  iterations, and in that case both accesses will be aligned.
                  Hence, except for the immediate peeling amount, we also want
                  to try to add full vector size, while we don't exceed
--- gcc/tree-vrp.c.jj	2016-01-19 09:20:24.000000000 +0100
+++ gcc/tree-vrp.c	2016-01-23 11:16:18.930706249 +0100
@@ -9257,8 +9257,8 @@ test_for_singularity (enum tree_code con
   tree min = NULL;
   tree max = NULL;
 
-  /* Extract minimum/maximum values which satisfy the
-     the conditional as it was written.  */
+  /* Extract minimum/maximum values which satisfy the conditional as it was
+     written.  */
   if (cond_code == LE_EXPR || cond_code == LT_EXPR)
     {
       /* This should not be negative infinity; there is no overflow
