--- a/gcc/tree-affine.h	Sun Feb 07 18:28:00 2010 +0900
+++ b/gcc/tree-affine.h	Fri Feb 12 23:39:51 2010 +0900
@@ -1,18 +1,18 @@
 /* Operations with affine combinations of trees.
    Copyright (C) 2005, 2007, 2008 Free Software Foundation, Inc.
-   
+
 This file is part of GCC.
-   
+
 GCC is free software; you can redistribute it and/or modify it
 under the terms of the GNU General Public License as published by the
 Free Software Foundation; either version 3, or (at your option) any
 later version.
-   
+
 GCC is distributed in the hope that it will be useful, but WITHOUT
 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 for more details.
-   
+
 You should have received a copy of the GNU General Public License
 along with GCC; see the file COPYING3.  If not see
 <http://www.gnu.org/licenses/>.  */
@@ -28,7 +28,7 @@
 {
   /* The value of the element.  */
   tree val;
-  
+
   /* Its coefficient in the combination.  */
   double_int coef;
 };
@@ -47,13 +47,13 @@
   /* Elements and their coefficients.  Type of elements may be different from
      TYPE, but their sizes must be the same (STRIP_NOPS is applied to the
      elements).
-     
+
      The coefficients are always sign extended from the precision of TYPE
      (regardless of signedness of TYPE).  */
   struct aff_comb_elt elts[MAX_AFF_ELTS];
 
   /* Remainder of the expression.  Usually NULL, used only if there are more
-     than MAX_AFF_ELTS elements.  Type of REST will be either sizetype for 
+     than MAX_AFF_ELTS elements.  Type of REST will be either sizetype for
      TYPE of POINTER_TYPEs or TYPE.  */
   tree rest;
 } aff_tree;