/illumos-gate/usr/src/cmd/msgfmt/ |
H A D | gnu_prime.h | 36 static const unsigned int prime[] = { variable
|
H A D | gnu_hash.c | 65 max_tbl_prime = prime[MAX_PRIME_INDEX] + 2; 69 if (n % prime[t] == 0) { 70 /* n is not a prime number */ 113 if (prime[t] >= n) 114 return (prime[t]); 121 while (prime[t] * prime[t] < n) { 128 if (n % prime[d] == 0) { 129 /* n is not a prime number */ 134 /* n is a prime numbe [all...] |
/illumos-gate/usr/src/cmd/sendmail/db/db/ |
H A D | db_shash.c | 25 * then use a nearby prime number as the hash value. 33 u_int32_t prime; member in struct:__anon1351 89 * prime number close to the "suggested" number of elements that will 105 return (list[i].prime);
|
/illumos-gate/usr/src/lib/pkcs11/pkcs11_softtoken/common/ |
H A D | softDH.c | 92 uchar_t prime[MAX_KEY_ATTR_BUFLEN]; local 93 uint32_t prime_len = sizeof (prime); 135 * parameters, which include prime, base, and private-value length. 137 rv = soft_get_public_value(pubkey, CKA_PRIME, prime, &prime_len); 148 k.prime = prime; 160 /* If value_bits is 0, it will return as same size as prime */ 180 /* Convert the big integer prime to an octet string. */ 181 if ((rv = soft_genDHkey_set_attribute(prikey, CKA_PRIME, prime, 232 k.prime [all...] |
H A D | softObject.h | 80 biginteger_t prime; member in struct:dsa_pub_key 91 biginteger_t prime; member in struct:dh_pub_key 101 biginteger_t prime; member in struct:dh942_pub_key 148 biginteger_t prime; member in struct:dsa_pri_key 159 biginteger_t prime; member in struct:dh_pri_key 169 biginteger_t prime; member in struct:dh942_pri_key 201 biginteger_t prime; member in struct:dsa_dom_key 212 biginteger_t prime; member in struct:dh_dom_key 222 biginteger_t prime; member in struct:dh942_dom_key 414 &((o)->object_class_u.public_key->key_type_u.dsa_pub_key.prime) [all...] |
H A D | softDSA.c | 151 k.prime = p; 201 k.prime = p; 467 uchar_t prime[MAX_KEY_ATTR_BUFLEN]; local 468 uint32_t prime_len = sizeof (prime); 483 /* lookup prime, subprime and base */ 484 rv = soft_get_public_value(pubkey, CKA_PRIME, prime, &prime_len); 504 k.prime = prime; 532 prime, CRYPTO_BITS2BYTES(k.prime_bits), B_FALSE)) != CKR_OK) {
|
H A D | softKeystore.c | 584 * prime_len + prime + subprime_len + subprime + 605 * prime_len + prime + base_len + base + 618 * prime_len + prime + base_len + base + 663 * prime_len + prime + subprime_len + subprime + 678 * value_bits + prime_len + prime + base_len + base + 699 * prime_len + prime + base_len + base + 802 /* prime_len + prime */ 867 /* prime_len + prime */ 907 /* prime_len + prime */ 1072 /* prime_len + prime */ 1334 biginteger_t prime; local [all...] |
H A D | softAttributeUtil.c | 1308 biginteger_t prime; local 1327 (void) memset(&prime, 0x0, sizeof (biginteger_t)); 1456 rv = get_bigint_attr_from_template(&prime, 1683 copy_bigint_attr(&prime, KEY_PUB_DSA_PRIME(pbk)); 1719 copy_bigint_attr(&prime, KEY_PUB_DH_PRIME(pbk)); 1752 copy_bigint_attr(&prime, KEY_PUB_DH942_PRIME(pbk)); 1815 bigint_attr_cleanup(&prime); 1881 biginteger_t prime; local 1902 (void) memset(&prime, 0x0, sizeof (biginteger_t)); 2104 rv = get_bigint_attr_from_template(&prime, 3189 biginteger_t prime; local [all...] |
H A D | softEC.c | 45 SECITEM_FreeItem(¶ms->fieldID.u.prime, B_FALSE);
|
/illumos-gate/usr/src/lib/pkcs11/pkcs11_kernel/common/ |
H A D | kernelObject.h | 91 biginteger_t prime; member in struct:dsa_pub_key 101 biginteger_t prime; member in struct:dh_pub_key 146 biginteger_t prime; member in struct:dsa_pri_key 157 biginteger_t prime; member in struct:dh_pri_key 290 &((o)->object_class_u.public_key->key_type_u.dsa_pub_key.prime) 292 &((k)->key_type_u.dsa_pub_key.prime) 313 &((o)->object_class_u.public_key->key_type_u.dh_pub_key.prime) 315 &((k)->key_type_u.dh_pub_key.prime) 381 &((o)->object_class_u.private_key->key_type_u.dsa_pri_key.prime) 383 &((k)->key_type_u.dsa_pri_key.prime) [all...] |
H A D | kernelAttributeUtil.c | 1024 biginteger_t prime; local 1037 (void) memset(&prime, 0x0, sizeof (biginteger_t)); 1146 rv = get_bigint_attr_from_template(&prime, 1274 copy_bigint_attr(&prime, KEY_PUB_DSA_PRIME(pbk)); 1290 copy_bigint_attr(&prime, KEY_PUB_DH_PRIME(pbk)); 1332 bigint_attr_cleanup(&prime); 1398 biginteger_t prime; local 1417 (void) memset(&prime, 0x0, sizeof (biginteger_t)); 1596 rv = get_bigint_attr_from_template(&prime, 1737 copy_bigint_attr(&prime, KEY_PRI_DSA_PRIM [all...] |
/illumos-gate/usr/src/common/crypto/dh/ |
H A D | dh_impl.h | 71 BIGNUM p; /* p (prime) */ 80 uchar_t *prime; /* p */ member in struct:__anon1953
|
H A D | dh_impl.c | 112 * Generate DH key pair x and y, given prime p and base g. 116 * p - a known prime 135 /* Must have prime and base set, value bits can be 0 or non-0 */ 136 if (bkey->prime_bits == 0 || bkey->prime == NULL || 156 /* Convert prime p to bignum. */ 162 bytestring2bignum(&(dhkey.p), bkey->prime, prime_bytes); 172 /* Base g cannot be greater than prime p. */ 184 /* Maximum bit length for private-value x is bit length of prime p */ 266 /* Must have prime, private value and public value */ 267 if (bkey->prime_bits == 0 || bkey->prime [all...] |
/illumos-gate/usr/src/common/crypto/dsa/ |
H A D | dsa_impl.h | 74 BIGNUM p; /* p (<size-bit> prime) */ 75 BIGNUM q; /* q (160-bit prime) */ 90 uchar_t *prime; /* p */ member in struct:__anon1955
|
H A D | dsa_impl.c | 135 * Generate DSA private x and public y from prime p, subprime q, and base g. 205 /* Convert prime p to bignum. */ 211 bytestring2bignum(&(dsakey.p), bkey->prime, prime_bytes); 213 /* Convert prime q to bignum. */ 291 bytestring2bignum(&(dsakey.p), bkey->prime, prime_bytes); 460 bytestring2bignum(&(dsakey.p), bkey->prime, prime_bytes);
|
/illumos-gate/usr/src/cmd/spell/ |
H A D | hashlook.c | 112 prime(char *file) function
|
H A D | spellprog.c | 59 int prime(char *); 321 if ((argc < 2) || !prime(*argv)) {
|
/illumos-gate/usr/src/cmd/mdb/common/modules/dtrace/ |
H A D | dtrace.c | 2006 static const uint32_t prime = 0x01000193; local 2011 hval *= prime; 2127 size_t hsize, i, actual, prime, evenpow; local 2153 * Now pick the largest prime smaller than the hash size. (If the 2154 * existing size is prime, we'll pick a smaller prime just for the 2157 for (prime = agb.dtagb_hashsize - 1; prime > 7; prime--) { 2158 size_t limit = prime / 2294 size_t hsize, i, actual, prime; local [all...] |
/illumos-gate/usr/src/uts/common/os/ |
H A D | modhash.c | 335 * attempts to find the next largest prime above the number of hash 337 * the hash size, or (key * prime) % nchains. 353 * Generate the next largest prime number greater than nchains; this value 360 uint_t kval, i, prime; local 363 * Pick the first (odd) prime greater than nchains. Make sure kval is 369 prime = 1; 372 prime = 0; 374 if (prime == 1)
|
/illumos-gate/usr/src/common/crypto/ecc/ |
H A D | ec.c | 183 SECITEM_TO_MPINT( params->fieldID.u.prime, &irreducible ); 289 CHECK_SEC_OK(SECITEM_CopyItem(arena, &key->ecParams.fieldID.u.prime, 290 &ecParams->fieldID.u.prime, kmflag)); 1082 CHECK_SEC_OK(SECITEM_CopyItem(arena, &dstParams->fieldID.u.prime, 1083 &srcParams->fieldID.u.prime, 0));
|
H A D | ecc_impl.h | 146 SECItem prime; /* prime p for (GFp) */ member in union:ECFieldIDStr::__anon1959
|
H A D | ecdecode.c | 126 CHECK_OK(hexString2SECItem(NULL, ¶ms->fieldID.u.prime,
|
/illumos-gate/usr/src/lib/libkmf/include/ |
H A D | kmftypes.h | 193 KMF_BIGINT prime; member in struct:__anon3429
|
/illumos-gate/usr/src/lib/libkmf/plugins/kmf_pkcs11/common/ |
H A D | pkcs11_spi.c | 2548 * This function calculates the pubkey value from the prime, 2564 bytestring2bignum(&p, rawdsa->prime.val, rawdsa->prime.len); 2718 attr2bigint(&(dsa_pri_attrs[i++]), &rawdsa->prime); 3398 rawkey->rawdata.dsa.prime.val, 3399 rawkey->rawdata.dsa.prime.len);
|
/illumos-gate/usr/src/uts/common/crypto/io/ |
H A D | ecc.c | 1300 SECITEM_FreeItem(¶ms->fieldID.u.prime, B_FALSE);
|