/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | bn_mp_dr_is_modulus.c | 21 int ix; local 31 for (ix = 1; ix < a->used; ix++) { 32 if (a->dp[ix] != MP_MASK) {
|
H A D | bn_reverse.c | 22 int ix, iy; local 25 ix = 0; 27 while (ix < iy) { 28 t = s[ix]; 29 s[ix] = s[iy]; 31 ++ix;
|
H A D | bn_mp_prime_is_divisible.c | 25 int err, ix; local 31 for (ix = 0; ix < PRIME_SIZE; ix++) { 32 /* what is a mod LBL_prime_tab[ix] */ 33 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
|
H A D | bn_fast_mp_montgomery_reduce.c | 28 int ix, res, olduse; local 55 for (ix = 0; ix < x->used; ix++) { 60 for (; ix < n->used * 2 + 1; ix++) { 68 for (ix = 0; ix < n->used; ix++) { 73 * that W[ix [all...] |
H A D | bn_mp_reduce_is_2k_l.c | 21 int ix, iy; local 29 for (iy = ix = 0; ix < a->used; ix++) { 30 if (a->dp[ix] == MP_MASK) {
|
H A D | bn_mp_and.c | 22 int res, ix, px; local 39 for (ix = 0; ix < px; ix++) { 40 t.dp[ix] &= x->dp[ix]; 44 for (; ix < t.used; ix++) { 45 t.dp[ix] = 0;
|
H A D | bn_mp_prime_is_prime.c | 28 int ix, err, res; local 39 for (ix = 0; ix < PRIME_SIZE; ix++) { 40 if (mp_cmp_d(a, ltm_prime_tab[ix]) == MP_EQ) { 61 for (ix = 0; ix < t; ix++) { 63 mp_set (&b, ltm_prime_tab[ix]);
|
H A D | bn_fast_s_mp_mul_digs.c | 36 int olduse, res, pa, ix, iz; local 52 for (ix = 0; ix < pa; ix++) { 58 ty = MIN(b->used-1, ix); 59 tx = ix - ty; 77 W[ix] = ((mp_digit)_W) & MP_MASK; 90 for (ix = 0; ix < pa+1; ix [all...] |
H A D | bn_fast_s_mp_mul_high_digs.c | 29 int olduse, res, pa, ix, iz; local 44 for (ix = digs; ix < pa; ix++) { 49 ty = MIN(b->used-1, ix); 50 tx = ix - ty; 67 W[ix] = ((mp_digit)_W) & MP_MASK; 81 for (ix = digs; ix < pa; ix [all...] |
H A D | bn_fast_s_mp_sqr.c | 30 int olduse, res, pa, ix, iz; local 44 for (ix = 0; ix < pa; ix++) { 53 ty = MIN(a->used-1, ix); 54 tx = ix - ty; 80 if ((ix&1) == 0) { 81 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]); 85 W[ix] [all...] |
H A D | bn_mp_reduce_is_2k.c | 21 int ix, iy, iw; local 34 for (ix = DIGIT_BIT; ix < iy; ix++) {
|
H A D | bn_s_mp_sqr.c | 22 int res, ix, iy, pa; local 34 for (ix = 0; ix < pa; ix++) { 35 /* first calculate the digit at 2*ix */ 37 r = ((mp_word) t.dp[2*ix]) + 38 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]); 41 t.dp[ix+ix] [all...] |
H A D | bn_mp_mul_d.c | 24 int ix, res, olduse; local 49 for (ix = 0; ix < a->used; ix++) { 60 /* store final carry [if any] and increment ix offset */ 62 ++ix; 65 while (ix++ < olduse) {
|
/macosx-10.10.1/bc-21/bc/Examples/ |
H A D | pi.b | 12 auto ix, pi, save_scale, work; 22 for (ix = 0; ix < 10; ix++) digits[ix] = 0; 28 for (ix = save_scale; ix > 0; ix--) { 31 scale = ix; 48 for (ix [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cdsa_client/ |
H A D | DLDBList.cpp | 33 for (DLDbList::const_iterator ix=begin();ix!=end();ix++) 34 if (*ix==dldbIdentifier) // already in list 42 for (DLDbList::iterator ix=begin();ix!=end();ix++) 43 if (*ix==dldbIdentifier) // found in list 45 erase(ix);
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cdsa_client/lib/ |
H A D | DLDBList.cpp | 33 for (DLDbList::const_iterator ix=begin();ix!=end();ix++) 34 if (*ix==dldbIdentifier) // already in list 42 for (DLDbList::iterator ix=begin();ix!=end();ix++) 43 if (*ix==dldbIdentifier) // found in list 45 erase(ix);
|
/macosx-10.10.1/tcl-105/tcl/tcl/libtommath/ |
H A D | bn_reverse.c | 22 int ix, iy; local 25 ix = 0; 27 while (ix < iy) { 28 t = s[ix]; 29 s[ix] = s[iy]; 31 ++ix;
|
H A D | bn_mp_and.c | 22 int res, ix, px; local 39 for (ix = 0; ix < px; ix++) { 40 t.dp[ix] &= x->dp[ix]; 44 for (; ix < t.used; ix++) { 45 t.dp[ix] = 0;
|
H A D | bn_fast_s_mp_mul_digs.c | 36 int olduse, res, pa, ix, iz; local 52 for (ix = 0; ix < pa; ix++) { 58 ty = MIN(b->used-1, ix); 59 tx = ix - ty; 77 W[ix] = ((mp_digit)_W) & MP_MASK; 90 for (ix = 0; ix < pa+1; ix [all...] |
H A D | bn_fast_s_mp_sqr.c | 30 int olduse, res, pa, ix, iz; local 44 for (ix = 0; ix < pa; ix++) { 53 ty = MIN(a->used-1, ix); 54 tx = ix - ty; 80 if ((ix&1) == 0) { 81 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]); 85 W[ix] [all...] |
H A D | bn_s_mp_sqr.c | 22 int res, ix, iy, pa; local 34 for (ix = 0; ix < pa; ix++) { 35 /* first calculate the digit at 2*ix */ 37 r = ((mp_word) t.dp[2*ix]) + 38 ((mp_word)a->dp[ix])*((mp_word)a->dp[ix]); 41 t.dp[ix+ix] [all...] |
/macosx-10.10.1/Security-57031.1.35/SecurityTool/ |
H A D | display_error_code.c | 42 int ix = 0; local 44 for (ix = 0; ix < argc; ix++) 46 if (strcmp("error", argv[ix])==0) 49 error = strtoul(argv[ix], NULL, 0);
|
/macosx-10.10.1/Security-57031.1.35/SecurityTests/regressions/test/ |
H A D | testleaks.c | 77 int ix; 81 for (ix = 1; ix < argc; ++ix) 82 argvec[ix] = argv[ix]; 83 argvec[ix] = pidstr; 84 argvec[ix + 1] = NULL; 109 int ix = 0; 110 for (ix [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/sec/Security/Tool/ |
H A D | add_internet_password.c | 49 CFIndex ix = 0; local 51 keys[ix] = kSecClass; 52 values[ix++] = kSecClassInternetPassword; 55 keys[ix] = kSecAttrServer; 56 values[ix++] = CFStringCreateWithCStringNoCopy(NULL, serverName, 60 keys[ix] = kSecAttrSecurityDomain; 61 values[ix++] = CFStringCreateWithCStringNoCopy(NULL, securityDomain, 65 keys[ix] = kSecAttrAccount; 66 values[ix++] = CFStringCreateWithCStringNoCopy(NULL, accountName, 70 keys[ix] [all...] |
/macosx-10.10.1/cxxfilt-11/cxxfilt/opcodes/ |
H A D | s390-mkopc.c | 75 int ix, k; local 85 for (ix = 0; ix < 16; ix++) 99 sort_value <<= 4*(16 - ix); 101 no_nibbles = ix; 102 for (ix = 0; ix < no_ops; ix++) 103 if (sort_value > op_array[ix] 136 int ix; local [all...] |