diff options
| author | Torbjorn Granlund <tege@gmplib.org> | 2011-11-21 21:15:18 +0100 |
|---|---|---|
| committer | Torbjorn Granlund <tege@gmplib.org> | 2011-11-21 21:15:18 +0100 |
| commit | f24a8deaf598267ea9c57ba93e9e6a94038bc8f3 (patch) | |
| tree | ab76a1173414ebafa1aa42527df660603053d18a /mpn/x86_64/mod_1_1.asm | |
| parent | 15a7619b6229dea0d8d895aaa5506e40304dcb3f (diff) | |
| download | gmp-f24a8deaf598267ea9c57ba93e9e6a94038bc8f3.tar.gz | |
Spacing cleanup.
Diffstat (limited to 'mpn/x86_64/mod_1_1.asm')
| -rw-r--r-- | mpn/x86_64/mod_1_1.asm | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/mpn/x86_64/mod_1_1.asm b/mpn/x86_64/mod_1_1.asm index 6b233e074..56f708a75 100644 --- a/mpn/x86_64/mod_1_1.asm +++ b/mpn/x86_64/mod_1_1.asm @@ -51,7 +51,7 @@ C Note: This implementation needs B1modb only when cnt > 0 C The iteration is almost as follows, C C r_2 B^3 + r_1 B^2 + r_0 B + u = r_1 B2modb + (r_0 + r_2 B2mod) B + u -C +C C where r2 is a single bit represented as a mask. But to make sure that the C result fits in two limbs and a bit, carry from the addition C @@ -206,7 +206,7 @@ ifdef(`SHLD_SLOW',` ') imul %rdx, %r8 shr R8(%rcx), %r8 - mov %r8, 16(%rbx) C store B1modb + mov %r8, 16(%rbx) C store B1modb L(z): pop %r12 pop %rbx |