Fix misspellings in sysdeps/ -- BZ 25337

21 files changed, 35 insertions, 35 deletions

diff --git a/sysdeps/ia64/fpu/e_acos.S b/sysdeps/ia64/fpu/e_acos.S
index 641c3fd..b10fd21 100644
--- a/sysdeps/ia64/fpu/e_acos.S
+++ b/sysdeps/ia64/fpu/e_acos.S
@@ -50,7 +50,7 @@
 //=========================================
 // The acos function computes the principal value of the arc cosine of x.
 // acos(0) returns Pi/2, acos(1) returns 0, acos(-1) returns Pi.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
 //
 // The acos function returns the arc cosine in the range [0, Pi] radians.
 //
@@ -100,7 +100,7 @@
 //    Return acos(1.0) = 0.0, acos(-1.0) = Pi
 //
 // 5. 1.0 < |x| <= +INF
-//    A doman error occurs for arguments not in the range [-1,+1]
+//    A domain error occurs for arguments not in the range [-1,+1]
 //
 // 6. x = [S,Q]NaN
 //    Return acos(x) = QNaN
diff --git a/sysdeps/ia64/fpu/e_acosf.S b/sysdeps/ia64/fpu/e_acosf.S
index 1507b46..7b32ffa 100644
--- a/sysdeps/ia64/fpu/e_acosf.S
+++ b/sysdeps/ia64/fpu/e_acosf.S
@@ -56,7 +56,7 @@
 // Description
 //=========================================
 // The acosf function computes the principle value of the arc sine of x.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
 
 // The acosf function returns the arc cosine in the range [0, +pi] radians.
 // acos(1) returns +0
diff --git a/sysdeps/ia64/fpu/e_asin.S b/sysdeps/ia64/fpu/e_asin.S
index a9ff25a..29db6ab 100644
--- a/sysdeps/ia64/fpu/e_asin.S
+++ b/sysdeps/ia64/fpu/e_asin.S
@@ -50,7 +50,7 @@
 //=========================================
 // The asin function computes the principal value of the arc sine of x.
 // asin(0) returns 0, asin(1) returns pi/2, asin(-1) returns -pi/2.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
 //
 // The asin function returns the arc sine in the range [-pi/2, +pi/2] radians.
 //
@@ -98,7 +98,7 @@
 //    Return asin(x) = sign(x)*Pi/2
 //
 // 5. 1.0 < |x| <= +INF
-//    A doman error occurs for arguments not in the range [-1,+1]
+//    A domain error occurs for arguments not in the range [-1,+1]
 //
 // 6. x = [S,Q]NaN
 //    Return asin(x) = QNaN
diff --git a/sysdeps/ia64/fpu/e_asinf.S b/sysdeps/ia64/fpu/e_asinf.S
index 841f815..546de3b 100644
--- a/sysdeps/ia64/fpu/e_asinf.S
+++ b/sysdeps/ia64/fpu/e_asinf.S
@@ -56,12 +56,12 @@
 // Description
 //=========================================
 // The asinf function computes the arc sine of x in the range [-pi,+pi].
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
 // asinf(+-0) returns +-0
 // asinf(x) returns a Nan and raises the invalid exception for |x| >1
 
 // The acosf function returns the arc cosine in the range [0, +pi] radians.
-// A doman error occurs for arguments not in the range [-1,+1].
+// A domain error occurs for arguments not in the range [-1,+1].
 // acosf(1) returns +0
 // acosf(x) returns a Nan and raises the invalid exception for |x| >1
 
diff --git a/sysdeps/ia64/fpu/e_log.S b/sysdeps/ia64/fpu/e_log.S
index 61c8e2c..0275c7b 100644
--- a/sysdeps/ia64/fpu/e_log.S
+++ b/sysdeps/ia64/fpu/e_log.S
@@ -121,7 +121,7 @@
 //   L2 = 1.0/log(10)
 //
 // So common code with two different entry points those set pointers
-// to the base address of coresponding data sets containing values
+// to the base address of corresponding data sets containing values
 // of L2,T and prepare integer representation of L1 needed for following
 // setf instruction.
 //
diff --git a/sysdeps/ia64/fpu/e_logf.S b/sysdeps/ia64/fpu/e_logf.S
index 7330b30..f317c56 100644
--- a/sysdeps/ia64/fpu/e_logf.S
+++ b/sysdeps/ia64/fpu/e_logf.S
@@ -118,7 +118,7 @@
 //   L2 = 1.0/log(10)
 //
 // So common code with two different entry points those set pointers
-// to the base address of coresponding data sets containing values
+// to the base address of corresponding data sets containing values
 // of L2,T and prepare integer representation of L1 needed for following
 // setf instruction can be used.
 //
@@ -171,7 +171,7 @@
 //         0xFFFEFF00000000000000 and 0xFFFF8080000000000000 correspondingly.
 //         As far as biased exponent of x here can be equal only to 0xFFFE or
 //         0xFFFF we need to test only last bit of it. Also signifigand always
-//         has implicit bit set to 1 that can be exluded from comparison.
+//         has implicit bit set to 1 that can be excluded from comparison.
 //         Thus it's quite enough to generate 64-bit integer bits of that are
 //         ix[63] = biased_exponent_of_x[0] and ix[62-0] = significand_of_x[62-0]
 //         and compare it with 0x7F00000000000000 and 0x80800000000000000 (those
diff --git a/sysdeps/ia64/fpu/e_pow.S b/sysdeps/ia64/fpu/e_pow.S
index 7157b28..3d87d61 100644
--- a/sysdeps/ia64/fpu/e_pow.S
+++ b/sysdeps/ia64/fpu/e_pow.S
@@ -108,7 +108,7 @@
 //
 //      Log(1/Cm) = log(1/frcpa(1+m/256)) where m goes from 0 to 255.
 //
-// We tabluate as two doubles, T and t, where T +t is the value itself.
+// We tabulate as two doubles, T and t, where T +t is the value itself.
 //
 //      Log(x)   = (K Log(2)_hi + T) + (Log(2)_hi + t) + Log( 1 + (Bx-1))
 //      Log(x)   =  G + delta           + Log( 1 + (Bx-1))
@@ -357,7 +357,7 @@
 //  +0     -inf               +inf   error 27   33  divide-by-zero
 //  -0     -inf               +inf   error 27   33  divide-by-zero
 
-// X zero  Y positve
+// X zero  Y positive
 //  +0     +odd integer       +0
 //  -0     +odd integer       -0
 //  +0     !+odd integer      +0
@@ -991,7 +991,7 @@ POW_COMMON:
 }
 ;;
 
-// Note POW_Xm1 and POW_r1 are used interchangably
+// Note POW_Xm1 and POW_r1 are used interchangeably
 { .mfi
           alloc         r32=ar.pfs,2,19,4,0
           fms.s1        POW_r           = POW_B, POW_NORM_X,f1
diff --git a/sysdeps/ia64/fpu/e_powf.S b/sysdeps/ia64/fpu/e_powf.S
index 0e8aad1..e353b08 100644
--- a/sysdeps/ia64/fpu/e_powf.S
+++ b/sysdeps/ia64/fpu/e_powf.S
@@ -108,7 +108,7 @@
 //
 //      Log(1/Cm) = log(1/frcpa(1+m/256)) where m goes from 0 to 255.
 //
-// We tabluate as one double, T for single precision power
+// We tabulate as one double, T for single precision power
 //
 //      Log(x)   = (K Log(2)_hi + T) + (K Log(2)_lo) + Log( 1 + (Bx-1))
 //      Log(x)   =  G                +     delta     + Log( 1 + (Bx-1))
@@ -353,7 +353,7 @@
 //  +0     -inf               +inf   error 27   33  divide-by-zero
 //  -0     -inf               +inf   error 27   33  divide-by-zero
 
-// X zero  Y positve
+// X zero  Y positive
 //  +0     +odd integer       +0
 //  -0     +odd integer       -0
 //  +0     !+odd integer      +0
@@ -927,7 +927,7 @@ WEAK_LIBM_ENTRY(powf)
           fclass.m  p14,p0              = f8, 0x07
           nop.i 999
 }
-// Note POW_Xm1 and POW_r1 are used interchangably
+// Note POW_Xm1 and POW_r1 are used interchangeably
 { .mfb
           nop.m 999
 (p8)      fnma.s1        POW_Xm1        = POW_Xp1,f1,f0
diff --git a/sysdeps/ia64/fpu/libm_lgammaf.S b/sysdeps/ia64/fpu/libm_lgammaf.S
index 7697cc6..1a1a68a 100644
--- a/sysdeps/ia64/fpu/libm_lgammaf.S
+++ b/sysdeps/ia64/fpu/libm_lgammaf.S
@@ -161,7 +161,7 @@
 //   precision number.
 //
 //
-// Claculation of logarithm
+// Calculation of logarithm
 // ------------------------
 //   Consider  x = 2^N * xf so
 //   ln(x) = ln(frcpa(x)*x/frcpa(x))
diff --git a/sysdeps/ia64/fpu/libm_lgammal.S b/sysdeps/ia64/fpu/libm_lgammal.S
index d82e4fc..aab4569 100644
--- a/sysdeps/ia64/fpu/libm_lgammal.S
+++ b/sysdeps/ia64/fpu/libm_lgammal.S
@@ -219,7 +219,7 @@
 //    EDP_Root is the exact value of the corresponding root rounded to double
 //    extended precision. So, we have 35 different polynomials which make our
 //    table rather big. We may hope that x falls in root "neighbourhood"
-//    quite rarely -> ther might be no need in frequent use of different
+//    quite rarely -> there might be no need in frequent use of different
 //    polynomials.
 //    A0, A1, A2, A3 are represented as pairs of double precision numbers,
 //    A4, A5 are long doubles, and to decrease the size of the table we
@@ -2423,7 +2423,7 @@ _deno_back_to_main_path:
       adds               rPolDataPtr = 3440, rTbl3Addr
 }
 { .mfi
-      // (i*16)*4 + (i*16)*8 - offsett of polynomial on range [-6.0, -0.75]
+      // (i*16)*4 + (i*16)*8 - offset of polynomial on range [-6.0, -0.75]
       shladd             rTmpPtr = rIndexPol, 2, rIndexPol
       fma.s1             fXSqr = FR_FracX, FR_FracX, f0 // y^2
       // point to left "near root" bound
@@ -2433,7 +2433,7 @@ _deno_back_to_main_path:
 { .mfi
       ldfpd              fLnSin34, fLnSin36 = [rTmpPtr3], 16
       fma.s1             fRcpX = fInvX, fRcpX, fRcpX // end of 2nd NR iteration
-      // add special offsett if -4 < x <= -3.0
+      // add special offset if -4 < x <= -3.0
 (p6)  adds               rPolDataPtr = 640, rPolDataPtr
 }
 { .mfi
@@ -2448,7 +2448,7 @@ _deno_back_to_main_path:
       // left bound of "near root" range
 (p12) ld8                rLeftBound = [rRootsBndAddr]
       fmerge.se          fNormDx = f1, fDx // significand of DeltaX
-      // base address + offsett for polynomial coeff. on range [-6.0, -0.75]
+      // base address + offset for polynomial coeff. on range [-6.0, -0.75]
       add                rPolDataPtr = rPolDataPtr, rTmpPtr
 }
 { .mfi
@@ -4565,7 +4565,7 @@ _negRoots:
       nop.i              0
 }
 { .mfi
-      add                rPolDataPtr = rPolDataPtr, rTmpPtr // begin + offsett
+      add                rPolDataPtr = rPolDataPtr, rTmpPtr // begin + offset
       nop.f              0
       nop.i              0
 }
diff --git a/sysdeps/ia64/fpu/libm_reduce.S b/sysdeps/ia64/fpu/libm_reduce.S
index fd7d06d..01f16e4 100644
--- a/sysdeps/ia64/fpu/libm_reduce.S
+++ b/sysdeps/ia64/fpu/libm_reduce.S
@@ -133,7 +133,7 @@
 // ==============
 //
 // This describes the algorithm in the most natural way using
-// unsigned interger multiplication. The implementation section
+// unsigned integer multiplication. The implementation section
 // describes how the integer arithmetic is simulated.
 //
 // STEP 0. Initialization
@@ -158,7 +158,7 @@
 //
 //      P_1    =      b   b    b     ...    b
 //
-// each b can be 0 or 1. Also, let P_0 be the two bits correspoding to
+// each b can be 0 or 1. Also, let P_0 be the two bits corresponding to
 // bit positions L+2 and L+1. So, when each of the P_j is interpreted
 // with appropriate scaling, we have
 //
diff --git a/sysdeps/ia64/fpu/libm_sincos_large.S b/sysdeps/ia64/fpu/libm_sincos_large.S
index 031bf08..5835ea2 100644
--- a/sysdeps/ia64/fpu/libm_sincos_large.S
+++ b/sysdeps/ia64/fpu/libm_sincos_large.S
@@ -1174,7 +1174,7 @@ SINCOS_CONTINUE:
 { .mfi
       nop.m 999
 //
-//     For big s: r = s - w: No futher reduction is necessary
+//     For big s: r = s - w: No further reduction is necessary
 //     For small s: w = N * P_3 (change sign) More reduction
 //
 (p6)   fcmp.lt.unc.s1 p8, p9 = FR_r, FR_Two_to_M3
diff --git a/sysdeps/ia64/fpu/libm_sincosl.S b/sysdeps/ia64/fpu/libm_sincosl.S
index 1eec445..a5f0ad5 100644
--- a/sysdeps/ia64/fpu/libm_sincosl.S
+++ b/sysdeps/ia64/fpu/libm_sincosl.S
@@ -1112,7 +1112,7 @@ SINCOSL_COMMON2:
 };;
 
 //
-//     For big s: r = s - w: No futher reduction is necessary
+//     For big s: r = s - w: No further reduction is necessary
 //     For small s: w = N * P_3 (change sign) More reduction
 //
 { .mfi
diff --git a/sysdeps/ia64/fpu/s_cosl.S b/sysdeps/ia64/fpu/s_cosl.S
index f5052dd..559cdb6 100644
--- a/sysdeps/ia64/fpu/s_cosl.S
+++ b/sysdeps/ia64/fpu/s_cosl.S
@@ -1083,7 +1083,7 @@ SINCOSL_COMMON:
 ;;
 
 //
-//     For big s: r = s - w: No futher reduction is necessary
+//     For big s: r = s - w: No further reduction is necessary
 //     For small s: w = N * P_3 (change sign) More reduction
 //
 { .mfi
diff --git a/sysdeps/ia64/fpu/s_erfcl.S b/sysdeps/ia64/fpu/s_erfcl.S
index 09d7c2a..2d3cdc1 100644
--- a/sysdeps/ia64/fpu/s_erfcl.S
+++ b/sysdeps/ia64/fpu/s_erfcl.S
@@ -1547,7 +1547,7 @@ GLOBAL_LIBM_ENTRY(erfcl)
 { .mfi
       ldfe           FR_A12 = [GR_P_POINT_1], -64
       nop.f          0
-      extr           GR_K = GR_N_fix, 12, 32         // Extract limite range K
+      extr           GR_K = GR_N_fix, 12, 32         // Extract limit range K
 }
 { .mfi
       ldfe           FR_A13 = [GR_P_POINT_2], -64
diff --git a/sysdeps/ia64/fpu/s_modf.S b/sysdeps/ia64/fpu/s_modf.S
index 79935fb..1d9b3b8 100644
--- a/sysdeps/ia64/fpu/s_modf.S
+++ b/sysdeps/ia64/fpu/s_modf.S
@@ -156,7 +156,7 @@ GLOBAL_LIBM_ENTRY(modf)
       nop.i 999 ;;
 }
 
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
 // p9  <== HUGE,  no fraction part, integer is everything
 // p12 <== NORMAL, fraction part and integer part
 { .mii
diff --git a/sysdeps/ia64/fpu/s_modff.S b/sysdeps/ia64/fpu/s_modff.S
index 3bdcf26..9eb3f74 100644
--- a/sysdeps/ia64/fpu/s_modff.S
+++ b/sysdeps/ia64/fpu/s_modff.S
@@ -156,7 +156,7 @@ GLOBAL_LIBM_ENTRY(modff)
       nop.i 999 ;;
 }
 
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
 // p9  <== HUGE,  no fraction part, integer is everything
 // p12 <== NORMAL, fraction part and integer part
 { .mii
diff --git a/sysdeps/ia64/fpu/s_modfl.S b/sysdeps/ia64/fpu/s_modfl.S
index 5fdfdb6..23057c8 100644
--- a/sysdeps/ia64/fpu/s_modfl.S
+++ b/sysdeps/ia64/fpu/s_modfl.S
@@ -151,7 +151,7 @@ GLOBAL_LIBM_ENTRY(modfl)
       nop.i 999 ;;
 }
 
-// p11 <== SMALL, no integer part, fraction is everyting
+// p11 <== SMALL, no integer part, fraction is everything
 // p9  <== HUGE,  no fraction part, integer is everything
 // p12 <== NORMAL, fraction part and integer part
 { .mii
diff --git a/sysdeps/ia64/fpu/s_tanhl.S b/sysdeps/ia64/fpu/s_tanhl.S
index 5a05c91..9c657c8 100644
--- a/sysdeps/ia64/fpu/s_tanhl.S
+++ b/sysdeps/ia64/fpu/s_tanhl.S
@@ -98,7 +98,7 @@
 //
 //    This branch is cut off by one fclass operation.
 //    Then zeros+nans, infinities and denormals processed separately.
-//    For denormals we use simple fma operaton x+x*x (- for +denorms)
+//    For denormals we use simple fma operation x+x*x (- for +denorms)
 //
 // 2. [0;1/8] path: 0.0 < |x| < 1/8
 //
diff --git a/sysdeps/ia64/fpu/w_tgamma_compat.S b/sysdeps/ia64/fpu/w_tgamma_compat.S
index 8440a0c..0afda2b 100644
--- a/sysdeps/ia64/fpu/w_tgamma_compat.S
+++ b/sysdeps/ia64/fpu/w_tgamma_compat.S
@@ -169,7 +169,7 @@
 //   Step 3: Division
 //   ----------------
 //    To calculate 1/(x*GAMMA(x)*S21(r)) we use frcpa instruction
-//    with following Newton-Raphson interations.
+//    with following Newton-Raphson iterations.
 //
 //
 //*********************************************************************
@@ -331,7 +331,7 @@ RODATA
 
 LOCAL_OBJECT_START(tgamma_data)
 data8 0x406573FAE561F648 // overflow boundary (171.624376956302739927196)
-data8 0x3FDD8B618D5AF8FE // point of local minium (0.461632144968362356785)
+data8 0x3FDD8B618D5AF8FE // point of local minimum (0.461632144968362356785)
 //
 //[2; 3]
 data8 0xEF0E85C9AE40ABE2,0x00004000 // C01
diff --git a/sysdeps/ia64/fpu/w_tgammaf_compat.S b/sysdeps/ia64/fpu/w_tgammaf_compat.S
index 67eed27..c1f7ad5 100644
--- a/sysdeps/ia64/fpu/w_tgammaf_compat.S
+++ b/sysdeps/ia64/fpu/w_tgammaf_compat.S
@@ -170,7 +170,7 @@
 //   Step 3: Division
 //   ----------------
 //    To calculate 1/x and 1/(GAMMA(x)*S12(rs)) we use frcpa
-//    instruction with following Newton-Raphson interations.
+//    instruction with following Newton-Raphson iterations.
 //
 //
 //*********************************************************************