| 1 | /* |
|---|
| 2 | Copyright (C) 1999-2007 The Botan Project. All rights reserved. |
|---|
| 3 | |
|---|
| 4 | Redistribution and use in source and binary forms, for any use, with or without |
|---|
| 5 | modification, is permitted provided that the following conditions are met: |
|---|
| 6 | |
|---|
| 7 | 1. Redistributions of source code must retain the above copyright notice, this |
|---|
| 8 | list of conditions, and the following disclaimer. |
|---|
| 9 | |
|---|
| 10 | 2. Redistributions in binary form must reproduce the above copyright notice, |
|---|
| 11 | this list of conditions, and the following disclaimer in the documentation |
|---|
| 12 | and/or other materials provided with the distribution. |
|---|
| 13 | |
|---|
| 14 | THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) "AS IS" AND ANY EXPRESS OR IMPLIED |
|---|
| 15 | WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
|---|
| 16 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED. |
|---|
| 17 | |
|---|
| 18 | IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE FOR ANY DIRECT, |
|---|
| 19 | INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
|---|
| 20 | BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|---|
| 21 | DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
|---|
| 22 | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
|---|
| 23 | OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
|---|
| 24 | ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|---|
| 25 | */ |
|---|
| 26 | // LICENSEHEADER_END |
|---|
| 27 | namespace QCA { // WRAPNS_LINE |
|---|
| 28 | /************************************************* |
|---|
| 29 | * Multiply/Add Algorithm Source File * |
|---|
| 30 | * (C) 1999-2007 The Botan Project * |
|---|
| 31 | *************************************************/ |
|---|
| 32 | |
|---|
| 33 | } // WRAPNS_LINE |
|---|
| 34 | #include <botan/mp_asm.h> |
|---|
| 35 | namespace QCA { // WRAPNS_LINE |
|---|
| 36 | } // WRAPNS_LINE |
|---|
| 37 | #include <botan/mp_asmi.h> |
|---|
| 38 | namespace QCA { // WRAPNS_LINE |
|---|
| 39 | } // WRAPNS_LINE |
|---|
| 40 | #include <botan/mp_core.h> |
|---|
| 41 | namespace QCA { // WRAPNS_LINE |
|---|
| 42 | |
|---|
| 43 | namespace Botan { |
|---|
| 44 | |
|---|
| 45 | extern "C" { |
|---|
| 46 | |
|---|
| 47 | /************************************************* |
|---|
| 48 | * Multiply/Add Words * |
|---|
| 49 | *************************************************/ |
|---|
| 50 | word bigint_mul_add_words(word z[], const word x[], u32bit x_size, word y) |
|---|
| 51 | { |
|---|
| 52 | const u32bit blocks = x_size - (x_size % 8); |
|---|
| 53 | |
|---|
| 54 | word carry = 0; |
|---|
| 55 | |
|---|
| 56 | for (u32bit j = 0; j != blocks; j += 8) |
|---|
| 57 | carry = word8_madd3(z: z + j, x: x + j, y, carry); |
|---|
| 58 | |
|---|
| 59 | for (u32bit j = blocks; j != x_size; ++j) |
|---|
| 60 | z[j] = word_madd3(a: x[j], b: y, c: z[j], d: carry, carry: &carry); |
|---|
| 61 | |
|---|
| 62 | return carry; |
|---|
| 63 | } |
|---|
| 64 | } |
|---|
| 65 | |
|---|
| 66 | } |
|---|
| 67 | } // WRAPNS_LINE |
|---|
| 68 | |
|---|
