28 Limb LIMBS_are_zero(const Limb a[], size_t num_limbs) {  in LIMBS_are_zero()  argument
30   for (size_t i = 0; i < num_limbs; ++i) {  in LIMBS_are_zero()
38 Limb LIMBS_equal(const Limb a[], const Limb b[], size_t num_limbs) {  in LIMBS_equal()  argument
40   for (size_t i = 0; i < num_limbs; ++i) {  in LIMBS_equal()
47 Limb LIMBS_equal_limb(const Limb a[], Limb b, size_t num_limbs) {  in LIMBS_equal_limb()  argument
48   if (num_limbs == 0) {  in LIMBS_equal_limb()
51   debug_assert_nonsecret(num_limbs >= 1);  in LIMBS_equal_limb()
53   Limb hi_zero = LIMBS_are_zero(&a[1], num_limbs - 1);  in LIMBS_equal_limb()
59 Limb LIMBS_are_even(const Limb a[], size_t num_limbs) {  in LIMBS_are_even()  argument
61   if (num_limbs == 0) {  in LIMBS_are_even()
70 Limb LIMBS_less_than(const Limb a[], const Limb b[], size_t num_limbs) {  in LIMBS_less_than()  argument
71   debug_assert_nonsecret(num_limbs >= 1);  in LIMBS_less_than()
77   for (size_t i = 1; i < num_limbs; ++i) {  in LIMBS_less_than()
83 Limb LIMBS_less_than_limb(const Limb a[], Limb b, size_t num_limbs) {  in LIMBS_less_than_limb()  argument
84   debug_assert_nonsecret(num_limbs >= 1);  in LIMBS_less_than_limb()
88   Limb hi = LIMBS_are_zero(&a[1], num_limbs - 1);  in LIMBS_less_than_limb()
93 void LIMBS_reduce_once(Limb r[], const Limb m[], size_t num_limbs) {  in LIMBS_reduce_once()  argument
94   debug_assert_nonsecret(num_limbs >= 1);  in LIMBS_reduce_once()
100   Limb lt = LIMBS_less_than(r, m, num_limbs);  in LIMBS_reduce_once()
103   for (size_t i = 1; i < num_limbs; ++i) {  in LIMBS_reduce_once()
114                    size_t num_limbs) {  in LIMBS_add_mod()  argument
116       constant_time_is_nonzero_w(limbs_add(r, a, b, num_limbs));  in LIMBS_add_mod()
117   Limb overflow2 = ~LIMBS_less_than(r, m, num_limbs);  in LIMBS_add_mod()
120   for (size_t i = 1; i < num_limbs; ++i) {  in LIMBS_add_mod()
126                    size_t num_limbs) {  in LIMBS_sub_mod()  argument
128       constant_time_is_nonzero_w(limbs_sub(r, a, b, num_limbs));  in LIMBS_sub_mod()
130   for (size_t i = 1; i < num_limbs; ++i) {  in LIMBS_sub_mod()
135 void LIMBS_shl_mod(Limb r[], const Limb a[], const Limb m[], size_t num_limbs) {  in LIMBS_shl_mod()  argument
137       constant_time_is_nonzero_w(a[num_limbs - 1] & LIMB_HIGH_BIT);  in LIMBS_shl_mod()
139   for (size_t i = 0; i < num_limbs; ++i) {  in LIMBS_shl_mod()
145   Limb overflow2 = ~LIMBS_less_than(r, m, num_limbs);  in LIMBS_shl_mod()
148   for (size_t i = 1; i < num_limbs; ++i) {  in LIMBS_shl_mod()
153 int LIMBS_select_512_32(Limb r[], const Limb table[], size_t num_limbs,  in LIMBS_select_512_32()  argument
155   if (num_limbs % (512 / LIMB_BITS) != 0) {  in LIMBS_select_512_32()
158   limbs_select(r, table, num_limbs, 32, index);  in LIMBS_select_512_32()
182 Limb GFp_limbs_mul_add_limb(Limb r[], const Limb a[], Limb b, size_t num_limbs) {  in GFp_limbs_mul_add_limb()  argument
184   for (size_t i = 0; i < num_limbs; ++i) {  in GFp_limbs_mul_add_limb()