[Gmp-commit] /var/hg/gmp: Fix language typos.
mercurial at gmplib.org
mercurial at gmplib.org
Tue Jan 8 18:13:32 CET 2013
details: /var/hg/gmp/rev/dae7c695e563
changeset: 15244:dae7c695e563
user: Torbjorn Granlund <tege at gmplib.org>
date: Tue Jan 08 18:13:28 2013 +0100
description:
Fix language typos.
diffstat:
doc/gmp.texi | 2 +-
mpn/generic/mul.c | 2 +-
mpn/powerpc64/README | 2 +-
mpn/x86/k7/addlsh1_n.asm | 4 ++--
mpz/fits_sint.c | 2 +-
mpz/jacobi.c | 26 ++++++++++++--------------
mpz/tdiv_r_2exp.c | 2 +-
tests/mpn/t-fat.c | 2 +-
8 files changed, 20 insertions(+), 22 deletions(-)
diffs (130 lines):
diff -r 2fb46ca8df63 -r dae7c695e563 doc/gmp.texi
--- a/doc/gmp.texi Mon Jan 07 19:52:20 2013 +0100
+++ b/doc/gmp.texi Tue Jan 08 18:13:28 2013 +0100
@@ -9266,7 +9266,7 @@
@cindex Linear congruential algorithm
Linear congruential generators are described in many text books, for instance
Knuth volume 2 (@pxref{References}). With a modulus @math{M} and parameters
- at math{A} and @math{C}, a integer state @math{S} is iterated by the formula
+ at math{A} and @math{C}, an integer state @math{S} is iterated by the formula
@math{S @leftarrow{} A at GMPmultiply{}S+C @bmod{} M}. At each step the new
state is a linear function of the previous, mod @math{M}, hence the name of
the generator.
diff -r 2fb46ca8df63 -r dae7c695e563 mpn/generic/mul.c
--- a/mpn/generic/mul.c Mon Jan 07 19:52:20 2013 +0100
+++ b/mpn/generic/mul.c Tue Jan 08 18:13:28 2013 +0100
@@ -203,7 +203,7 @@
/* FIXME: This condition (repeated in the loop below) leaves from a vn*vn
square to a (3vn-1)*vn rectangle. Leaving such a rectangle is hardly
wise; we would get better balance by slightly moving the bound. We
- will sometimes end up with un < vn, like the the X3 arm below. */
+ will sometimes end up with un < vn, like in the X3 arm below. */
if (un >= 3 * vn)
{
mp_limb_t cy;
diff -r 2fb46ca8df63 -r dae7c695e563 mpn/powerpc64/README
--- a/mpn/powerpc64/README Mon Jan 07 19:52:20 2013 +0100
+++ b/mpn/powerpc64/README Tue Jan 08 18:13:28 2013 +0100
@@ -113,7 +113,7 @@
one store per cycle.
L1 load latency: to gregs 3-4 cycles, to fregs 5-6 cycles.
Operations that modify the address register might be split
- to use also a an integer issue slot.
+ to use also an integer issue slot.
Simple integer: 2 operations every cycle, latency 2.
Integer multiply: 2 operations every 6th cycle, latency 7 cycles.
Integer divide: ?
diff -r 2fb46ca8df63 -r dae7c695e563 mpn/x86/k7/addlsh1_n.asm
--- a/mpn/x86/k7/addlsh1_n.asm Mon Jan 07 19:52:20 2013 +0100
+++ b/mpn/x86/k7/addlsh1_n.asm Tue Jan 08 18:13:28 2013 +0100
@@ -21,8 +21,8 @@
include(`../config.m4')
-C This is an attempt at a addlsh1_n for x86-32, not relying on sse2 insns. The
-C innerloop is 2*3-way unrolled, which is best we can do with the available
+C This is an attempt at an addlsh1_n for x86-32, not relying on sse2 insns.
+C The innerloop is 2*3-way unrolled, which is best we can do with the available
C registers. It seems tricky to use the same structure for rsblsh1_n, since we
C cannot feed carry between operations there.
diff -r 2fb46ca8df63 -r dae7c695e563 mpz/fits_sint.c
--- a/mpz/fits_sint.c Mon Jan 07 19:52:20 2013 +0100
+++ b/mpz/fits_sint.c Tue Jan 08 18:13:28 2013 +0100
@@ -1,4 +1,4 @@
-/* int mpz_fits_sint_p (mpz_t z) -- test whether z fits a int.
+/* int mpz_fits_sint_p (mpz_t z) -- test whether z fits an int.
Copyright 1997, 2000, 2001 Free Software Foundation, Inc.
diff -r 2fb46ca8df63 -r dae7c695e563 mpz/jacobi.c
--- a/mpz/jacobi.c Mon Jan 07 19:52:20 2013 +0100
+++ b/mpz/jacobi.c Tue Jan 08 18:13:28 2013 +0100
@@ -121,10 +121,9 @@
MPN_SRCPTR_SWAP (asrcp, asize, bsrcp, bsize);
MP_LIMB_T_SWAP (alow, blow);
- /* NOTE: The value of alow (old blow) is a bit subtle. For this
- code path, we get alow as the low, always odd, limb of
- shifted A. Which is what we need for the reciprocity update
- below.
+ /* NOTE: The value of alow (old blow) is a bit subtle. For this code
+ path, we get alow as the low, always odd, limb of shifted A. Which is
+ what we need for the reciprocity update below.
However, all other uses of alow assumes that it is *not*
shifted. Luckily, alow matters only when either
@@ -161,10 +160,10 @@
return mpn_jacobi_base (alow, blow, result_bit1);
}
- /* Allocation strategy: For A, we allocate a working copy only for A
- % B, but when A is much larger than B, we have to allocate space
- for the large quotient. We use the same area, pointed to by bp,
- for both the quotient A/B and the working copy of B. */
+ /* Allocation strategy: For A, we allocate a working copy only for A % B, but
+ when A is much larger than B, we have to allocate space for the large
+ quotient. We use the same area, pointed to by bp, for both the quotient
+ A/B and the working copy of B. */
TMP_MARK;
@@ -173,12 +172,11 @@
else
TMP_ALLOC_LIMBS_2 (ap, bsize, bp, bsize);
- /* In the case of even B, we conceptually shift out the powers of
- two first, and then divide A mod B. Hence, when taking those
- powers of two into account, we must use alow *before* the the
- division. Doing the actual division first is ok, because the
- point is to remove multiples of B from A, and multiples of 2^k B
- are good enough. */
+ /* In the case of even B, we conceptually shift out the powers of two first,
+ and then divide A mod B. Hence, when taking those powers of two into
+ account, we must use alow *before* the division. Doing the actual division
+ first is ok, because the point is to remove multiples of B from A, and
+ multiples of 2^k B are good enough. */
if (asize > bsize)
mpn_tdiv_qr (bp, ap, 0, asrcp, asize, bsrcp, bsize);
else
diff -r 2fb46ca8df63 -r dae7c695e563 mpz/tdiv_r_2exp.c
--- a/mpz/tdiv_r_2exp.c Mon Jan 07 19:52:20 2013 +0100
+++ b/mpz/tdiv_r_2exp.c Tue Jan 08 18:13:28 2013 +0100
@@ -1,4 +1,4 @@
-/* mpz_tdiv_r_2exp -- Divide a integer by 2**CNT and produce a remainder.
+/* mpz_tdiv_r_2exp -- Divide an integer by 2**CNT and produce a remainder.
Copyright 1991, 1993, 1994, 1995, 2001, 2002, 2012 Free Software Foundation,
Inc.
diff -r 2fb46ca8df63 -r dae7c695e563 tests/mpn/t-fat.c
--- a/tests/mpn/t-fat.c Mon Jan 07 19:52:20 2013 +0100
+++ b/tests/mpn/t-fat.c Tue Jan 08 18:13:28 2013 +0100
@@ -278,7 +278,7 @@
}
}
-/* Expect the first use of a each fat threshold to invoke the necessary
+/* Expect the first use of each fat threshold to invoke the necessary
initialization. */
void
check_thresholds (void)
More information about the gmp-commit
mailing list