The Tor Browser: security/nss/lib/freebl/mpi/mp

Incorporate requested changes from Mozilla in review:
https://bugzilla.mozilla.org/show_bug.cgi?id=1123480#c6

     1 /* This Source Code Form is subject to the terms of the Mozilla Public

     2  * License, v. 2.0. If a copy of the MPL was not distributed with this

     3  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

     5 #ifndef _MP_GF2M_PRIV_H_

     6 #define _MP_GF2M_PRIV_H_

     8 #include "mpi-priv.h"

    10 extern const mp_digit mp_gf2m_sqr_tb[16];

    12 #if defined(MP_USE_UINT_DIGIT)

    13 #define MP_DIGIT_BITS 32

    14 /* enable fast divide and mod operations on MP_DIGIT_BITS */

    15 #define MP_DIGIT_BITS_LOG_2 5

    16 #define MP_DIGIT_BITS_MASK 0x1f

    17 #else

    18 #define MP_DIGIT_BITS 64

    19 /* enable fast divide and mod operations on MP_DIGIT_BITS */

    20 #define MP_DIGIT_BITS_LOG_2 6

    21 #define MP_DIGIT_BITS_MASK 0x3f

    22 #endif

    24 /* Platform-specific macros for fast binary polynomial squaring. */

    25 #if MP_DIGIT_BITS == 32

    26 #define gf2m_SQR1(w) \

    27     mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 16 | \

    28     mp_gf2m_sqr_tb[(w) >> 20 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF]

    29 #define gf2m_SQR0(w) \

    30     mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >>  8 & 0xF] << 16 | \

    31     mp_gf2m_sqr_tb[(w) >>  4 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w)       & 0xF]

    32 #else

    33 #define gf2m_SQR1(w) \

    34     mp_gf2m_sqr_tb[(w) >> 60 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 56 & 0xF] << 48 | \

    35     mp_gf2m_sqr_tb[(w) >> 52 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 48 & 0xF] << 32 | \

    36     mp_gf2m_sqr_tb[(w) >> 44 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >> 40 & 0xF] << 16 | \

    37     mp_gf2m_sqr_tb[(w) >> 36 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w) >> 32 & 0xF]

    38 #define gf2m_SQR0(w) \

    39     mp_gf2m_sqr_tb[(w) >> 28 & 0xF] << 56 | mp_gf2m_sqr_tb[(w) >> 24 & 0xF] << 48 | \

    40     mp_gf2m_sqr_tb[(w) >> 20 & 0xF] << 40 | mp_gf2m_sqr_tb[(w) >> 16 & 0xF] << 32 | \

    41     mp_gf2m_sqr_tb[(w) >> 12 & 0xF] << 24 | mp_gf2m_sqr_tb[(w) >>  8 & 0xF] << 16 | \

    42     mp_gf2m_sqr_tb[(w) >>  4 & 0xF] <<  8 | mp_gf2m_sqr_tb[(w)       & 0xF]

    43 #endif

    45 /* Multiply two binary polynomials mp_digits a, b.

    46  * Result is a polynomial with degree < 2 * MP_DIGIT_BITS - 1.

    47  * Output in two mp_digits rh, rl.

    48  */

    49 void s_bmul_1x1(mp_digit *rh, mp_digit *rl, const mp_digit a, const mp_digit b);

    51 /* Compute xor-multiply of two binary polynomials  (a1, a0) x (b1, b0)

    52  * result is a binary polynomial in 4 mp_digits r[4].

    53  * The caller MUST ensure that r has the right amount of space allocated.

    54  */

    55 void s_bmul_2x2(mp_digit *r, const mp_digit a1, const mp_digit a0, const mp_digit b1,

    56 	const mp_digit b0);

    58 /* Compute xor-multiply of two binary polynomials  (a2, a1, a0) x (b2, b1, b0)

    59  * result is a binary polynomial in 6 mp_digits r[6].

    60  * The caller MUST ensure that r has the right amount of space allocated.

    61  */

    62 void s_bmul_3x3(mp_digit *r, const mp_digit a2, const mp_digit a1, const mp_digit a0,

    63 	const mp_digit b2, const mp_digit b1, const mp_digit b0);

    65 /* Compute xor-multiply of two binary polynomials  (a3, a2, a1, a0) x (b3, b2, b1, b0)

    66  * result is a binary polynomial in 8 mp_digits r[8].

    67  * The caller MUST ensure that r has the right amount of space allocated.

    68  */

    69 void s_bmul_4x4(mp_digit *r, const mp_digit a3, const mp_digit a2, const mp_digit a1,

    70 	const mp_digit a0, const mp_digit b3, const mp_digit b2, const mp_digit b1,

    71 	const mp_digit b0);

    73 #endif /* _MP_GF2M_PRIV_H_ */

The Tor Browser / file revision