/external/boringssl/src/crypto/fipsmodule/bn/ |
montgomery.c | 263 size_t num_n = mont->N.top; local 264 if (num_r != num_n || num_a != 2 * num_n) { 274 for (size_t i = 0; i < num_n; i++) { 275 BN_ULONG v = bn_mul_add_words(a + i, n, num_n, a[i] * n0); 276 v += carry + a[i + num_n]; 277 carry |= (v != a[i + num_n]); 278 carry &= (v <= a[i + num_n]); 279 a[i + num_n] = v; 282 // Shift |num_n| words to divide by R. We have |a| < 2 * |n|. Note that |a 455 size_t num_n = mont->N.top; local 472 size_t num_n = mont->N.top; local 494 size_t num_n = mont->N.top; local [all...] |
exponentiation.c | 734 size_t num_n = mont->N.top; local 735 if (num_n != num_a || num_n != num_r || num_n > BN_SMALL_MAX_WORDS) { 765 OPENSSL_memcpy(val[0], a, num_n * sizeof(BN_ULONG)); 768 if (!bn_mod_mul_montgomery_small(d, num_n, val[0], num_n, val[0], num_n, 773 if (!bn_mod_mul_montgomery_small(val[i], num_n, val[i - 1], num_n, d [all...] |
div.c | 203 int num_n, div_n; local 264 num_n = snum->top; 265 loop = num_n - div_n; 281 wnump = &(snum->d[num_n - 1]);
|
/external/opencv/cv/src/ |
cvcontourtree.cpp | 84 int *num_p, *num_n, *num1, *num2; /* numbers of input contour points */ local 111 num_p = num_n = NULL; 119 num_n = (int *) cvAlloc( lpt * sizeof( int )); 163 num2 = num_n; 174 num2 = num_n; 183 num1 = num_n; 581 cvFree( &num_n );
|