diff --git a/include/ftoutln.h b/include/ftoutln.h
index 6c6d3f94b..46b0b2fb5 100644
--- a/include/ftoutln.h
+++ b/include/ftoutln.h
@@ -535,7 +535,7 @@ FT_BEGIN_HEADER
   *
   * @description:
   *   This function analyzes a glyph outline and tries to compute its
-  *   fill orientation (see @FT_Orientation).  This is done by integrating 
+  *   fill orientation (see @FT_Orientation).  This is done by integrating
   *   the total area covered by the outline. The positive integral
   *   corresponds to the clockwise orientation and @FT_ORIENTATION_POSTSCRIPT
   *   is returned. The negative integral corresponds to the counter-clockwise
diff --git a/src/autofit/hbshim.c b/src/autofit/hbshim.c
index cc048159b..a705cef00 100644
--- a/src/autofit/hbshim.c
+++ b/src/autofit/hbshim.c
@@ -329,7 +329,7 @@
      * out whether a glyph gets shifted vertically, but this is something I
      * would like to avoid if not really necessary.
      *
-     * Note that we don't follow this logic for the default coverage. 
+     * Note that we don't follow this logic for the default coverage.
      * Complex scripts like Devanagari have mandatory GPOS features to
      * position many glyph elements, using mark-to-base or mark-to-ligature
      * tables; the number of glyphs missed due to condition (b) would be far
diff --git a/src/base/ftbbox.c b/src/base/ftbbox.c
index fd3f198be..c775d5c8c 100644
--- a/src/base/ftbbox.c
+++ b/src/base/ftbbox.c
@@ -86,7 +86,7 @@
                 TBBox_Rec*  user )
   {
     FT_UPDATE_BBOX( to, user->bbox );
- 
+
     user->last = *to;
 
     return 0;
diff --git a/src/base/ftbitmap.c b/src/base/ftbitmap.c
index 158a42858..d11efddf3 100644
--- a/src/base/ftbitmap.c
+++ b/src/base/ftbitmap.c
@@ -396,7 +396,7 @@
      *
      * We do the computation with integers only, applying a gamma of 2.0.
      * We guarantee 32-bit arithmetic to avoid overflow but the resulting
-     * luminosity fits into 16 bits. 
+     * luminosity fits into 16 bits.
      *
      */
 
diff --git a/src/base/ftcalc.c b/src/base/ftcalc.c
index 00071cb89..f3ef8c537 100644
--- a/src/base/ftcalc.c
+++ b/src/base/ftcalc.c
@@ -307,7 +307,7 @@
     if ( hi >= y )
       return (FT_UInt32)0x7FFFFFFFL;
 
-    /* We shift as many bits as we can into the high register, perform     */ 
+    /* We shift as many bits as we can into the high register, perform     */
     /* 32-bit division with modulo there, then work through the remaining  */
     /* bits with long division. This optimization is especially noticeable */
     /* for smaller dividends that barely use the high register.            */
@@ -611,10 +611,10 @@
       FT_Int64  temp, temp2;
 
 
-      temp.hi  = a >> 16; 
+      temp.hi  = a >> 16;
       temp.lo  = a << 16;
       temp2.hi = 0;
-      temp2.lo = b >> 1; 
+      temp2.lo = b >> 1;
 
       FT_Add64( &temp, &temp2, &temp );
       q = (FT_Long)ft_div64by32( temp.hi, temp.lo, b );
diff --git a/src/bdf/bdfdrivr.c b/src/bdf/bdfdrivr.c
index d7649ab7d..c270d5976 100644
--- a/src/bdf/bdfdrivr.c
+++ b/src/bdf/bdfdrivr.c
@@ -384,7 +384,7 @@ THE SOFTWARE.
       BDF_Face_Done( bdfface );
       return FT_THROW( Invalid_Argument );
     }
- 
+
     {
       bdf_property_t*  prop = NULL;