Applied patch 3 by Ondřej Bílka with some manual corrections,

fixing typos:
  https://sympa.inria.fr/sympa/arc/mpfr/2013-07/msg00016.html

git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@8621 280ebfd0-de03-0410-8827-d642c229c3f4

37 files changed, 50 insertions, 50 deletions

diff --git a/src/asinh.c b/src/asinh.c
index e97fbb451..a5bafb473 100644
--- a/src/asinh.c
+++ b/src/asinh.c
@@ -104,7 +104,7 @@ mpfr_asinh (mpfr_ptr y, mpfr_srcptr x, mpfr_rnd_t rnd_mode)
             break;
         }
 
-      /* actualisation of the precision */
+      /* actualization of the precision */
       MPFR_ZIV_NEXT (loop, Nt);
       mpfr_set_prec (t, Nt);
     }
diff --git a/src/atanh.c b/src/atanh.c
index 62357ac2f..ca86387ee 100644
--- a/src/atanh.c
+++ b/src/atanh.c
@@ -88,7 +88,7 @@ mpfr_atanh (mpfr_ptr y, mpfr_srcptr xt , mpfr_rnd_t rnd_mode)
   /* the optimal number of bits : see algorithms.ps */
   Nt = Nt + MPFR_INT_CEIL_LOG2 (Nt) + 4;
 
-  /* initialise of intermediary variable */
+  /* initialize of intermediary variable */
   mpfr_init2 (t, Nt);
   mpfr_init2 (te, Nt);
 
diff --git a/src/cosh.c b/src/cosh.c
index 010774581..c456a12e4 100644
--- a/src/cosh.c
+++ b/src/cosh.c
@@ -82,7 +82,7 @@ mpfr_cosh (mpfr_ptr y, mpfr_srcptr xt , mpfr_rnd_t rnd_mode)
     /* The optimal number of bits : see algorithms.tex */
     Nt = Ny + 3 + MPFR_INT_CEIL_LOG2 (Ny);
 
-    /* initialise of intermediary variables */
+    /* initialize of intermediary variables */
     MPFR_GROUP_INIT_2 (group, Nt, t, te);
 
     /* First computation of cosh */
diff --git a/src/digamma.c b/src/digamma.c
index 414183556..6809f8006 100644
--- a/src/digamma.c
+++ b/src/digamma.c
@@ -92,7 +92,7 @@ mpfr_digamma_approx (mpfr_ptr s, mpfr_srcptr x)
           f = (1 + f) / 2;
           expu ++;
         }
-      e += f; /* total rouding error coming from 'u' term */
+      e += f; /* total rounding error coming from 'u' term */
     }
 
   n0 = ++n;
diff --git a/src/eint.c b/src/eint.c
index eae2406de..ba79009eb 100644
--- a/src/eint.c
+++ b/src/eint.c
@@ -273,7 +273,7 @@ mpfr_eint (mpfr_ptr y, mpfr_srcptr x, mpfr_rnd_t rnd)
   mpfr_set_prec (tmp, prec);
   mpfr_set_prec (ump, prec);
 
-  MPFR_ZIV_INIT (loop, prec);            /* Initialize the ZivLoop controler */
+  MPFR_ZIV_INIT (loop, prec);            /* Initialize the ZivLoop controller */
   for (;;)                               /* Infinite loop */
     {
       /* We need that the smallest value of k!/x^k is smaller than 2^(-p).
diff --git a/src/erfc.c b/src/erfc.c
index 55f103041..3e43674bb 100644
--- a/src/erfc.c
+++ b/src/erfc.c
@@ -229,7 +229,7 @@ mpfr_erfc (mpfr_ptr y, mpfr_srcptr x, mpfr_rnd_t rnd)
 
   mpfr_init2 (tmp, prec);
 
-  MPFR_ZIV_INIT (loop, prec);            /* Initialize the ZivLoop controler */
+  MPFR_ZIV_INIT (loop, prec);            /* Initialize the ZivLoop controller */
   for (;;)                               /* Infinite loop */
     {
       /* use asymptotic formula only whenever x^2 >= p*log(2),
diff --git a/src/exp2.c b/src/exp2.c
index 845b1dde7..d3f16ae89 100644
--- a/src/exp2.c
+++ b/src/exp2.c
@@ -113,7 +113,7 @@ mpfr_exp2 (mpfr_ptr y, mpfr_srcptr x, mpfr_rnd_t rnd_mode)
       /* the optimal number of bits : see algorithms.tex */
       Nt = Ny + 5 + MPFR_INT_CEIL_LOG2 (Ny);
 
-      /* initialise of intermediary variable */
+      /* initialize of intermediary variable */
       mpfr_init2 (t, Nt);
 
       /* First computation */
diff --git a/src/factorial.c b/src/factorial.c
index 878fcd0bc..416232f2d 100644
--- a/src/factorial.c
+++ b/src/factorial.c
@@ -57,7 +57,7 @@ mpfr_fac_ui (mpfr_ptr y, unsigned long int x, mpfr_rnd_t rnd_mode)
   /* compute the size of intermediary variable */
   Nt = Ny + 2 * MPFR_INT_CEIL_LOG2 (x) + 7;
 
-  mpfr_init2 (t, Nt); /* initialise of intermediary variable */
+  mpfr_init2 (t, Nt); /* initialize of intermediary variable */
 
   rnd = MPFR_RNDZ;
   MPFR_ZIV_INIT (loop, Nt);
diff --git a/src/init2.c b/src/init2.c
index 0ef584037..01d861356 100644
--- a/src/init2.c
+++ b/src/init2.c
@@ -47,7 +47,7 @@ mpfr_init2 (mpfr_ptr x, mpfr_prec_t p)
   MPFR_STAT_STATIC_ASSERT( MPFR_EMIN_MIN >= -(MPFR_EXP_MAX >> 1) );
 
   /* p=1 is not allowed since the rounding to nearest even rule requires at
-     least two bits of mantissa: the neighbours of 3/2 are 1*2^0 and 1*2^1,
+     least two bits of mantissa: the neighbors of 3/2 are 1*2^0 and 1*2^1,
      which both have an odd mantissa */
   MPFR_ASSERTN(p >= MPFR_PREC_MIN && p <= MPFR_PREC_MAX);
 
diff --git a/src/log10.c b/src/log10.c
index 9d2329550..2a34c44a1 100644
--- a/src/log10.c
+++ b/src/log10.c
@@ -104,7 +104,7 @@ mpfr_log10 (mpfr_ptr r, mpfr_srcptr a, mpfr_rnd_t rnd_mode)
     /* the optimal number of bits : see algorithms.tex */
     Nt = Ny + 4 + MPFR_INT_CEIL_LOG2 (Ny);
 
-    /* initialise of intermediary variables */
+    /* initialize of intermediary variables */
     mpfr_init2 (t, Nt);
     mpfr_init2 (tt, Nt);
 
@@ -132,7 +132,7 @@ mpfr_log10 (mpfr_ptr r, mpfr_srcptr a, mpfr_rnd_t rnd_mode)
             && mpfr_cmp (a, tt) == 0)
           break;
 
-        /* actualisation of the precision */
+        /* actualization of the precision */
         MPFR_ZIV_NEXT (loop, Nt);
         mpfr_set_prec (t, Nt);
         mpfr_set_prec (tt, Nt);
diff --git a/src/log1p.c b/src/log1p.c
index 8ff0f189e..edd2e03a7 100644
--- a/src/log1p.c
+++ b/src/log1p.c
@@ -117,7 +117,7 @@ mpfr_log1p (mpfr_ptr y, mpfr_srcptr x, mpfr_rnd_t rnd_mode)
     if (MPFR_EXP(x) < 0)
       Nt += -MPFR_EXP(x);
 
-    /* initialise of intermediary variable */
+    /* initialize of intermediary variable */
     mpfr_init2 (t, Nt);
 
     /* First computation of log1p */
diff --git a/src/log2.c b/src/log2.c
index eecbfc053..cac265085 100644
--- a/src/log2.c
+++ b/src/log2.c
@@ -106,7 +106,7 @@ mpfr_log2 (mpfr_ptr r, mpfr_srcptr a, mpfr_rnd_t rnd_mode)
     /* the optimal number of bits : see algorithms.tex */
     Nt = Ny + 3 + MPFR_INT_CEIL_LOG2 (Ny);
 
-    /* initialise of intermediary       variable */
+    /* initialize of intermediary       variable */
     mpfr_init2 (t, Nt);
     mpfr_init2 (tt, Nt);
 
@@ -124,7 +124,7 @@ mpfr_log2 (mpfr_ptr r, mpfr_srcptr a, mpfr_rnd_t rnd_mode)
         if (MPFR_LIKELY (MPFR_CAN_ROUND (t, err, Ny, rnd_mode)))
           break;
 
-        /* actualisation of the precision */
+        /* actualization of the precision */
         MPFR_ZIV_NEXT (loop, Nt);
         mpfr_set_prec (t, Nt);
         mpfr_set_prec (tt, Nt);
diff --git a/src/mpf2mpfr.h b/src/mpf2mpfr.h
index e4a3557dd..1beafc710 100644
--- a/src/mpf2mpfr.h
+++ b/src/mpf2mpfr.h
@@ -33,7 +33,7 @@ http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
 # define MPFR_DEFAULT_RND mpfr_get_default_rounding_mode ()
 #endif
 
-/* mpf_init initalizes at 0 */
+/* mpf_init initializes at 0 */
 #undef mpf_init
 #define mpf_init(x) mpfr_init_set_ui ((x), 0, MPFR_DEFAULT_RND)
 #undef mpf_init2
diff --git a/src/mpfr-impl.h b/src/mpfr-impl.h
index 8b5e16643..d02f87821 100644
--- a/src/mpfr-impl.h
+++ b/src/mpfr-impl.h
@@ -976,7 +976,7 @@ typedef intmax_t mpfr_eexp_t;
  ********************** Memory ************************
  ******************************************************/
 
-/* Heap Memory gestion */
+/* Heap memory handling */
 typedef union { mp_size_t s; mp_limb_t l; } mpfr_size_limb_t;
 #define MPFR_GET_ALLOC_SIZE(x) \
  ( ((mp_size_t*) MPFR_MANT(x))[-1] + 0)
@@ -989,7 +989,7 @@ typedef union { mp_size_t s; mp_limb_t l; } mpfr_size_limb_t;
 #define MPFR_GET_REAL_PTR(x) \
    ((mp_limb_t*) ((mpfr_size_limb_t*) MPFR_MANT(x) - 1))
 
-/* Temporary memory gestion */
+/* Temporary memory handling */
 #ifndef TMP_SALLOC
 /* GMP 4.1.x or below or internals */
 #define MPFR_TMP_DECL TMP_DECL
diff --git a/src/mpfr-longlong.h b/src/mpfr-longlong.h
index 2ef005385..14977657f 100644
--- a/src/mpfr-longlong.h
+++ b/src/mpfr-longlong.h
@@ -108,7 +108,7 @@ along with this file.  If not, see http://www.gnu.org/licenses/.  */
 
    Apparently it was only the last "%" that was ever actually respected, so
    the code has been updated to leave just that.  Clearly there's a free
-   choice whether high or low should get it, if there's a reason to favour
+   choice whether high or low should get it, if there's a reason to favor
    one over the other.  Also obviously when the constraints on the two
    operands are identical there's no benefit to the reloader in any "%" at
    all.
@@ -694,7 +694,7 @@ extern UWtype __MPN(udiv_qrnnd) _PROTO ((UWtype *, UWtype, UWtype, UWtype));
 
 #if HAVE_HOST_CPU_pentiummmx && ! defined (LONGLONG_STANDALONE)
 /* The following should be a fixed 14 or 15 cycles, but possibly plus an L1
-   cache miss reading from __clz_tab.  For P55 it's favoured over the float
+   cache miss reading from __clz_tab.  For P55 it's favored over the float
    below so as to avoid mixing MMX and x87, since the penalty for switching
    between the two is about 100 cycles.
 
@@ -1764,7 +1764,7 @@ extern UWtype mpn_udiv_qrnnd_r _PROTO ((UWtype, UWtype, UWtype, UWtype *));
 /* If we still don't have umul_ppmm, define it using plain C.
 
    For reference, when this code is used for squaring (ie. u and v identical
-   expressions), gcc recognises __x1 and __x2 are the same and generates 3
+   expressions), gcc recognizes __x1 and __x2 are the same and generates 3
    multiplies, not 4.  The subsequent additions could be optimized a bit,
    but the only place GMP currently uses such a square is mpn_sqr_basecase,
    and chips obliged to use this generic C umul will have plenty of worse
diff --git a/src/pow.c b/src/pow.c
index f5fe74eef..7eb583548 100644
--- a/src/pow.c
+++ b/src/pow.c
@@ -195,7 +195,7 @@ mpfr_pow_general (mpfr_ptr z, mpfr_srcptr x, mpfr_srcptr y,
   /* the optimal number of bits : see algorithms.tex */
   Nt = Nz + 5 + MPFR_INT_CEIL_LOG2 (Nz);
 
-  /* initialise of intermediary variable */
+  /* initialize of intermediary variable */
   mpfr_init2 (t, Nt);
 
   MPFR_ZIV_INIT (ziv_loop, Nt);
diff --git a/src/pow_si.c b/src/pow_si.c
index a92a7c89b..0e93fe931 100644
--- a/src/pow_si.c
+++ b/src/pow_si.c
@@ -158,7 +158,7 @@ mpfr_pow_si (mpfr_ptr y, mpfr_srcptr x, long int n, mpfr_rnd_t rnd)
 
         MPFR_SAVE_EXPO_MARK (expo);
 
-        /* initialise of intermediary   variable */
+        /* initialize of intermediary   variable */
         mpfr_init2 (t, Nt);
 
         /* We will compute rnd(rnd1(1/x) ^ |n|), where rnd1 is the rounding
@@ -233,7 +233,7 @@ mpfr_pow_si (mpfr_ptr y, mpfr_srcptr x, long int n, mpfr_rnd_t rnd)
             if (MPFR_LIKELY (MPFR_CAN_ROUND (t, Nt - size_n - 2, Ny, rnd)))
               break;
 
-            /* actualisation of the precision */
+            /* actualization of the precision */
             MPFR_ZIV_NEXT (loop, Nt);
             mpfr_set_prec (t, Nt);
           }
diff --git a/src/pow_z.c b/src/pow_z.c
index 69cd26f62..b8b06913f 100644
--- a/src/pow_z.c
+++ b/src/pow_z.c
@@ -280,7 +280,7 @@ mpfr_pow_z (mpfr_ptr y, mpfr_srcptr x, mpz_srcptr z, mpfr_rnd_t rnd)
       Nt = Nt + size_z + 3 + MPFR_INT_CEIL_LOG2 (Nt);
       /* ensures Nt >= bits(z)+2 */
 
-      /* initialise of intermediary variable */
+      /* initialize of intermediary variable */
       mpfr_init2 (t, Nt);
 
       /* We will compute rnd(rnd1(1/x) ^ (-z)), where rnd1 is the rounding
@@ -357,7 +357,7 @@ mpfr_pow_z (mpfr_ptr y, mpfr_srcptr x, mpz_srcptr z, mpfr_rnd_t rnd)
           if (MPFR_LIKELY (MPFR_CAN_ROUND (t, Nt - size_z - 2, MPFR_PREC (y),
                                            rnd)))
             break;
-          /* actualisation of the precision */
+          /* actualization of the precision */
           MPFR_ZIV_NEXT (loop, Nt);
           mpfr_set_prec (t, Nt);
         }
diff --git a/src/rec_sqrt.c b/src/rec_sqrt.c
index 96ce39a5b..ca5050b92 100644
--- a/src/rec_sqrt.c
+++ b/src/rec_sqrt.c
@@ -421,7 +421,7 @@ mpfr_mpn_rec_sqrt (mpfr_limb_ptr x, mpfr_prec_t p,
         }
 
       /* cy can be 1 when A=1, i.e., {a, n} = B^n. In that case we should
-         have X = B^n, and setting X to 1-2^{-p} satisties the error bound
+         have X = B^n, and setting X to 1-2^{-p} satisfies the error bound
          of 1 ulp. */
       if (MPFR_UNLIKELY(cy != 0))
         {
diff --git a/src/sinh.c b/src/sinh.c
index 7338d2467..dda7d96a3 100644
--- a/src/sinh.c
+++ b/src/sinh.c
@@ -84,7 +84,7 @@ mpfr_sinh (mpfr_ptr y, mpfr_srcptr xt, mpfr_rnd_t rnd_mode)
     if (MPFR_GET_EXP (x) < 0)
       Nt -= 2*MPFR_GET_EXP (x);
 
-    /* initialise of intermediary variables */
+    /* initialize of intermediary variables */
     MPFR_GROUP_INIT_2 (group, Nt, t, ti);
 
     /* First computation of sinh */
@@ -170,7 +170,7 @@ mpfr_sinh (mpfr_ptr y, mpfr_srcptr xt, mpfr_rnd_t rnd_mode)
               }
           }
 
-        /* actualisation of the precision */
+        /* actualization of the precision */
         Nt += err;
         MPFR_ZIV_NEXT (loop, Nt);
         MPFR_GROUP_REPREC_2 (group, Nt, t, ti);
diff --git a/src/sinh_cosh.c b/src/sinh_cosh.c
index fb3b1f0cc..2b09fff80 100644
--- a/src/sinh_cosh.c
+++ b/src/sinh_cosh.c
@@ -95,7 +95,7 @@ mpfr_sinh_cosh (mpfr_ptr sh, mpfr_ptr ch, mpfr_srcptr xt, mpfr_rnd_t rnd_mode)
     /* the optimal number of bits : see algorithms.ps */
     N = N + MPFR_INT_CEIL_LOG2 (N) + 4;
 
-    /* initialise of intermediary variables */
+    /* initialize of intermediary variables */
     MPFR_GROUP_INIT_3 (group, N, s, c, ti);
 
     /* First computation of sinh_cosh */
@@ -143,7 +143,7 @@ mpfr_sinh_cosh (mpfr_ptr sh, mpfr_ptr ch, mpfr_srcptr xt, mpfr_rnd_t rnd_mode)
                 break;
               }
           }
-        /* actualisation of the precision */
+        /* actualization of the precision */
         N += err;
         MPFR_ZIV_NEXT (loop, N);
         MPFR_GROUP_REPREC_3 (group, N, s, c, ti);
diff --git a/src/sub1.c b/src/sub1.c
index 82b023e54..89c2e35a8 100644
--- a/src/sub1.c
+++ b/src/sub1.c
@@ -62,7 +62,7 @@ mpfr_sub1 (mpfr_ptr a, mpfr_srcptr b, mpfr_srcptr c, mpfr_rnd_t rnd_mode)
    * If subtraction: sign(a) = sign * sign(b)
    * If addition: sign(a) = sign of the larger argument in absolute value.
    *
-   * Both cases can be simplidied in:
+   * Both cases can be simplified in:
    * if (sign>0)
    *    if addition: sign(a) = sign * sign(b) = sign(b)
    *    if subtraction, b is greater, so sign(a) = sign(b)
diff --git a/src/sub1sp.c b/src/sub1sp.c
index 1599c6025..98e1c14a7 100644
--- a/src/sub1sp.c
+++ b/src/sub1sp.c
@@ -662,7 +662,7 @@ mpfr_sub1sp (mpfr_ptr a, mpfr_srcptr b, mpfr_srcptr c, mpfr_rnd_t rnd_mode)
           MPFR_ASSERTN(bbcp1 != (mp_limb_t) -1);
           bcp  = bbcp;
           bcp1 = bbcp1;
-          /* We dont't have anymore a valid Cp+1!
+          /* We don't have anymore a valid Cp+1!
              But since Ap >= 100000xxx001, the final sub can't unnormalize!*/
         }
       MPFR_ASSERTD( !(ap[0] & ~mask) );
@@ -691,7 +691,7 @@ mpfr_sub1sp (mpfr_ptr a, mpfr_srcptr b, mpfr_srcptr c, mpfr_rnd_t rnd_mode)
   mpn_sub_1 (ap, ap, n, MPFR_LIMB_ONE << sh);
   /* Result should be smaller than exact value: inexact=-1 */
   inexact = -1;
-  /* Check normalisation */
+  /* Check normalization */
   if (MPFR_UNLIKELY(MPFR_LIMB_MSB(ap[n-1]) == 0))
     {
       /* ap was a power of 2, and we lose a bit */
@@ -783,7 +783,7 @@ mpfr_sub1sp (mpfr_ptr a, mpfr_srcptr b, mpfr_srcptr c, mpfr_rnd_t rnd_mode)
       If d==0      : Exact case. This is never called.
       if 1 < d < p : bx=MPFR_EXP(b) or MPFR_EXP(b)-1 > MPFR_EXP(c) > emin
       if d == 1    : bx=MPFR_EXP(b). If we could lose any bits, the exact
-                     normalisation is called.
+                     normalization is called.
       if d >=  p   : bx=MPFR_EXP(b) >= MPFR_EXP(c) + p > emin
      After SubOneUlp, we could have one bit less.
       if 1 < d < p : bx >= MPFR_EXP(b)-2 >= MPFR_EXP(c) > emin
diff --git a/src/sum.c b/src/sum.c
index 9858b9a20..86d21243d 100644
--- a/src/sum.c
+++ b/src/sum.c
@@ -28,7 +28,7 @@ http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
 #include "mpfr-impl.h"
 
 /* I would really like to use "mpfr_srcptr const []" but the norm is buggy:
-   it doesn't automaticaly cast a "mpfr_ptr []" to "mpfr_srcptr const []"
+   it doesn't automatically cast a "mpfr_ptr []" to "mpfr_srcptr const []"
    if necessary. So the choice are:
      mpfr_s **                : OK
      mpfr_s *const*           : OK
diff --git a/src/tanh.c b/src/tanh.c
index ecf021f02..8b043430a 100644
--- a/src/tanh.c
+++ b/src/tanh.c
@@ -84,7 +84,7 @@ mpfr_tanh (mpfr_ptr y, mpfr_srcptr xt , mpfr_rnd_t rnd_mode)
        For x > 0, exp(2*x) > 2^(2*x)
        If 2 ^(2*x) > 2^emax or x>emax/2, there is an overflow */
     if (MPFR_UNLIKELY (mpfr_cmp_si (x, __gmpfr_emax/2) >= 0)) {
-      /* initialise of intermediary variables
+      /* initialize of intermediary variables
          since 'set_one' label assumes the variables have been
          initialize */
       MPFR_GROUP_INIT_2 (group, MPFR_PREC_MIN, t, te);
@@ -98,7 +98,7 @@ mpfr_tanh (mpfr_ptr y, mpfr_srcptr xt , mpfr_rnd_t rnd_mode)
     if (MPFR_GET_EXP (x) < 0)
       Nt += -MPFR_GET_EXP (x);
 
-    /* initialise of intermediary variable */
+    /* initialize of intermediary variable */
     MPFR_GROUP_INIT_2 (group, Nt, t, te);
 
     MPFR_ZIV_INIT (loop, Nt);
diff --git a/src/ui_pow_ui.c b/src/ui_pow_ui.c
index f9f25cb24..78402aca9 100644
--- a/src/ui_pow_ui.c
+++ b/src/ui_pow_ui.c
@@ -1,4 +1,4 @@
-/*  mpfr_ui_pow_ui -- compute the power beetween two machine integer
+/*  mpfr_ui_pow_ui -- compute the power between two machine integers
 
 Copyright 1999-2013 Free Software Foundation, Inc.
 Contributed by the AriC and Caramel projects, INRIA.
diff --git a/src/vasprintf.c b/src/vasprintf.c
index acc4a0ce3..9edeeaf90 100644
--- a/src/vasprintf.c
+++ b/src/vasprintf.c
@@ -662,7 +662,7 @@ struct string_list
   struct string_list *next; /* NULL in last node */
 };
 
-/* initialisation */
+/* initialization */
 static void
 init_string_list (struct string_list *sl)
 {
@@ -1743,7 +1743,7 @@ sprnt_fp (struct string_buffer *buf, mpfr_srcptr p,
   if (np.exp_ptr)
     buffer_cat (buf, np.exp_ptr, np.exp_size);
 
-  /* left justication padding with right spaces */
+  /* left justification padding with right spaces */
   if (np.pad_type == RIGHT && np.pad_size != 0)
     buffer_pad (buf, ' ', np.pad_size);
 
diff --git a/src/zeta.c b/src/zeta.c
index 03b8f86cf..7b102a355 100644
--- a/src/zeta.c
+++ b/src/zeta.c
@@ -256,7 +256,7 @@ mpfr_zeta_pos (mpfr_t z, mpfr_srcptr s, mpfr_rnd_t rnd_mode)
 
           /* Computation of the coefficients c_k */
           mpfr_zeta_c (p, tc1);
-          /* Computation of the 3 parts of the fonction Zeta. */
+          /* Computation of the 3 parts of the function Zeta. */
           mpfr_zeta_part_a (z_pre, s, n);
           mpfr_zeta_part_b (b, s, n, p, tc1);
           /* s1 = s-1 is already computed above */
diff --git a/tests/mpf_compat.h b/tests/mpf_compat.h
index 5b3a1bd76..8c456edfc 100644
--- a/tests/mpf_compat.h
+++ b/tests/mpf_compat.h
@@ -132,7 +132,7 @@ main (void)
   l = mpf_get_si (x);
   u = mpf_get_ui (x);
   s = mpf_get_str (NULL, &exp, 10, 10, x);
-  /* MPF doen't have mpf_free_str */
+  /* MPF doesn't have mpf_free_str */
   mpfr_free_str (s);
 
   /* Use d, l and u to avoid a warning with -Wunused-but-set-variable
diff --git a/tests/tabort_prec_max.c b/tests/tabort_prec_max.c
index 6f542b122..343ab763a 100644
--- a/tests/tabort_prec_max.c
+++ b/tests/tabort_prec_max.c
@@ -1,4 +1,4 @@
-/* tabort_prec_max -- Test for abort terminaison due to reaching prec max
+/* tabort_prec_max -- Test for abort termination due to reaching prec max
 
 Copyright 2012-2013 Free Software Foundation, Inc.
 Contributed by the AriC and Caramel projects, INRIA.
diff --git a/tests/tget_sj.c b/tests/tget_sj.c
index 641c0eb13..6a3d15501 100644
--- a/tests/tget_sj.c
+++ b/tests/tget_sj.c
@@ -132,7 +132,7 @@ check_erange (void)
   uintmax_t dl;
   intmax_t d;
 
-  /* Test for ERANGE flag + correct behaviour if overflow */
+  /* Test for ERANGE flag + correct behavior if overflow */
 
   mpfr_init2 (x, 256);
   mpfr_set_uj (x, MPFR_UINTMAX_MAX, MPFR_RNDN);
diff --git a/tests/tprintf.c b/tests/tprintf.c
index 597765d10..683f7545f 100644
--- a/tests/tprintf.c
+++ b/tests/tprintf.c
@@ -471,7 +471,7 @@ main (int argc, char *argv[])
             {
               /* Output the error message to stderr since it is not
                  a message about a wrong result in MPFR. Anyway the
-                 stdandard output may have changed. */
+                 standard output may have changed. */
               fprintf (stderr, "Can't open /dev/null or a temporary file\n");
               exit (1);
             }
diff --git a/tests/tset_si.c b/tests/tset_si.c
index ff8ca0f1e..703f5aeb7 100644
--- a/tests/tset_si.c
+++ b/tests/tset_si.c
@@ -395,7 +395,7 @@ main (int argc, char *argv[])
   MPFR_ASSERTN (mpfr_get_ui (x, MPFR_RNDD) == 0);
   MPFR_ASSERTN (mpfr_get_si (x, MPFR_RNDD) == 0);
 
-  /* Test for ERANGE flag + correct behaviour if overflow */
+  /* Test for ERANGE flag + correct behavior if overflow */
   mpfr_set_prec (x, 256);
   mpfr_set_ui (x, ULONG_MAX, MPFR_RNDN);
   mpfr_clear_erangeflag ();
diff --git a/tests/tsprintf.c b/tests/tsprintf.c
index 908f99051..73cc42718 100644
--- a/tests/tsprintf.c
+++ b/tests/tsprintf.c
@@ -992,7 +992,7 @@ random_double (void)
          the sign of a zero exponent (the C99 rationale says: "The sign
          of a zero exponent in %e format is unspecified.  The committee
          knows of different implementations and choose not to require
-         implementations to document their behaviour in this case
+         implementations to document their behavior in this case
          (by making this be implementation defined behaviour).  Most
          implementations use a "+" sign, e.g., 1.2e+00; but there is at
          least one implementation that uses the sign of the unlimited
diff --git a/tools/mbench/timp.h b/tools/mbench/timp.h
index 608c8f76e..a91073c85 100644
--- a/tools/mbench/timp.h
+++ b/tools/mbench/timp.h
@@ -104,7 +104,7 @@ http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
  * hardware interruption cycles.
  * The filling of the CPU cache is done because we do several loops,
  * and get the minimum.
- * Declaring num_cycle as "volatile" is to avoid optimisation when it is
+ * Declaring num_cycle as "volatile" is to avoid optimization when it is
  * possible (To properly calcul overhead).
  * overhead is calculated outside by a call to:
  *   overhead = MEASURE("overhead", ;)
diff --git a/tune/bidimensional_sample.c b/tune/bidimensional_sample.c
index 47aec1f2f..db9c28997 100644
--- a/tune/bidimensional_sample.c
+++ b/tune/bidimensional_sample.c
@@ -32,7 +32,7 @@ http://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc.,
 
 /* Let f be a function for which we have several implementations f1, f2... */
 /* We wish to have a quick overview of which implementation is the best    */
-/* in function of the point x where f(x) is computed and of the prectision */
+/* in function of the point x where f(x) is computed and of the precision */
 /* prec requested by the user.                                             */
 /* This is performed by drawing a 2D graphic with color indicating which   */
 /* method is the best.                                                     */
diff --git a/tune/tuneup.c b/tune/tuneup.c
index 181ec7336..058d3c4b1 100644
--- a/tune/tuneup.c
+++ b/tune/tuneup.c
@@ -562,7 +562,7 @@ tune_simple_func (mpfr_prec_t *threshold,
    It assumes that for (x,p) close to zero, algo1 is used
    and algo2 is used when (x,p) is far from zero.
    If algo2 is better for low prec, and algo1 better for high prec,
-   the behaviour of this function is undefined.
+   the behavior of this function is undefined.
    This tuning function tries couples (x,p) of the form (ell*dirx, ell*dirp)
    until it finds a point on the boundary. It returns ell.
  */