/freebsd-10-stable/games/primes/ |
H A D | pr_tbl.c | 42 * prime - prime table 46 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 56 const ubig prime[] = { variable 547 /* pr_limit - largest prime in the prime table */ 548 const ubig *const pr_limit = &prime[(sizeof(prime)/sizeof(prime[0]))-1];
|
H A D | primes.h | 41 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 52 * prime[i] is the (i-1)th prime. 57 extern const ubig prime[]; 58 extern const ubig *const pr_limit; /* largest prime in the prime array */
|
H A D | primes.c | 52 * chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 81 * sieve, table[i] == 1 if and only if 2*i-1 is prime. 207 const ubig *p; /* prime table pointer */ 208 ubig fact_lim; /* highest prime for current block */ 241 for (p = &prime[0], factor = prime[0]; 285 factor = 17; /* 17 is first prime to use */ 286 p = &prime[7]; /* 19 is next prime, pi(19)=7 */
|
/freebsd-10-stable/contrib/bmake/unit-tests/ |
H A D | cond1.exp | 3 2 is prime 13 1 is not prime 14 2 is prime 15 3 is prime 16 4 is not prime 17 5 is prime
|
H A D | cond1.mk | 104 @echo "$n is $X prime" 107 @echo "${NUMBERS:@n@$n is ${("${PRIMES:M$n}" == ""):?not:} prime${.newline}@}"
|
/freebsd-10-stable/contrib/wpa/src/crypto/ |
H A D | dh_groups.h | 16 const u8 *prime; member in struct:dh_group
|
/freebsd-10-stable/crypto/openssl/engines/vendor_defns/ |
H A D | atalla.h | 24 Item prime[2]; member in struct:RSAPrivateKeyStr
|
/freebsd-10-stable/contrib/wpa/src/eap_peer/ |
H A D | eap_pwd.c | 156 BN_free(data->grp->prime); 245 BN_num_bits(data->grp->prime)); 331 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), x); 332 ptr += BN_num_bytes(data->grp->prime); 333 BN_bin2bn(ptr, BN_num_bytes(data->grp->prime), y); 334 ptr += BN_num_bytes(data->grp->prime); 409 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) == 417 * sufficiently smaller than the prime or order might need pre-pending 421 os_memset(element, 0, BN_num_bytes(data->grp->prime) * 2); 426 offset = BN_num_bytes(data->grp->prime) [all...] |
/freebsd-10-stable/contrib/wpa/src/eap_common/ |
H A D | eap_pwd_common.c | 122 grp->prime = NULL; 133 ((grp->prime = BN_new()) == NULL) || 139 if (!EC_GROUP_get_curve_GFp(grp->group, grp->prime, NULL, NULL, NULL)) 141 wpa_printf(MSG_INFO, "EAP-pwd: unable to get prime for GFp " 154 primebitlen = BN_num_bits(grp->prime); 155 primebytelen = BN_num_bytes(grp->prime); 173 * compute counter-mode password value and stretch to prime 208 if (BN_ucmp(x_candidate, grp->prime) >= 0) 270 BN_free(grp->prime); 271 grp->prime [all...] |
H A D | eap_pwd_common.h | 18 * TODO: support one based on a prime field 25 BIGNUM *prime; member in struct:group_definition_
|
/freebsd-10-stable/contrib/wpa/src/eap_server/ |
H A D | eap_server_pwd.c | 150 BN_free(data->grp->prime); 246 ((element = os_malloc(BN_num_bytes(data->grp->prime) * 2)) == 254 * sufficiently smaller than the prime or order might need pre-pending 258 os_memset(element, 0, BN_num_bytes(data->grp->prime) * 2); 263 offset = BN_num_bytes(data->grp->prime) - BN_num_bytes(x); 265 offset = BN_num_bytes(data->grp->prime) - BN_num_bytes(y); 266 BN_bn2bin(y, element + BN_num_bytes(data->grp->prime) + offset); 268 data->outbuf = wpabuf_alloc(2 * BN_num_bytes(data->grp->prime) + 275 2 * BN_num_bytes(data->grp->prime)); 305 /* Each component of the cruft will be at most as big as the prime */ [all...] |
/freebsd-10-stable/contrib/unbound/services/ |
H A D | mesh.h | 355 * @param prime: if it is a (stub) priming query. 362 uint16_t qflags, int prime, int valrec, struct module_qstate** newq); 409 * @param prime: if true, it is a priming query, set is_priming on mesh state. 415 struct query_info* qinfo, uint16_t qflags, int prime, int valrec); 437 * @param prime: if it is a priming query. 442 struct query_info* qinfo, uint16_t qflags, int prime, int valrec); 529 * @param prime: if dependency is a priming query or not. 537 uint16_t flags, int prime, int valrec);
|
H A D | mesh.c | 500 uint16_t qflags, int prime, int valrec) 536 mstate->s.is_priming = prime; 684 uint16_t qflags, int prime, int valrec, struct module_qstate** newq) 688 struct mesh_state* sub = mesh_area_find(mesh, qinfo, qflags, prime, 700 sub = mesh_state_create(qstate->env, qinfo, qflags, prime, 948 struct query_info* qinfo, uint16_t qflags, int prime, int valrec) 954 key.s.is_priming = prime; 1116 num++, (m->s.is_priming)?"p":"", /* prime */ 1117 (m->s.is_valrec)?"v":"", /* prime */ 1187 uint16_t flags, int prime, in 499 mesh_state_create(struct module_env* env, struct query_info* qinfo, uint16_t qflags, int prime, int valrec) argument 683 mesh_attach_sub(struct module_qstate* qstate, struct query_info* qinfo, uint16_t qflags, int prime, int valrec, struct module_qstate** newq) argument 947 mesh_area_find(struct mesh_area* mesh, struct query_info* qinfo, uint16_t qflags, int prime, int valrec) argument 1186 mesh_detect_cycle(struct module_qstate* qstate, struct query_info* qinfo, uint16_t flags, int prime, int valrec) argument [all...] |
/freebsd-10-stable/contrib/unbound/util/ |
H A D | fptr_wlist.h | 236 uint16_t qflags, int prime, int valrec, struct module_qstate** newq)); 254 uint16_t flags, int prime, int valrec));
|
H A D | module.h | 258 * @param prime: if it is a (stub) priming query. 265 struct query_info* qinfo, uint16_t qflags, int prime, 283 * @param prime: if dependency is a priming query or not. 291 struct query_info* qinfo, uint16_t flags, int prime, 329 * expire. The hints are always used to "prime" the cache. Note
|
H A D | fptr_wlist.c | 287 uint16_t qflags, int prime, int valrec, struct module_qstate** newq)) 303 uint16_t flags, int prime, int valrec)) 285 fptr_whitelist_modenv_attach_sub(int (*fptr)( struct module_qstate* qstate, struct query_info* qinfo, uint16_t qflags, int prime, int valrec, struct module_qstate** newq)) argument 301 fptr_whitelist_modenv_detect_cycle(int (*fptr)( struct module_qstate* qstate, struct query_info* qinfo, uint16_t flags, int prime, int valrec)) argument
|
/freebsd-10-stable/crypto/openssh/ |
H A D | kexgex.c | 53 const BIGNUM *prime, 80 (r = sshbuf_put_bignum2(b, prime)) != 0 || 45 kexgex_hash( int hash_alg, const char *client_version_string, const char *server_version_string, const u_char *ckexinit, size_t ckexinitlen, const u_char *skexinit, size_t skexinitlen, const u_char *serverhostkeyblob, size_t sbloblen, int min, int wantbits, int max, const BIGNUM *prime, const BIGNUM *gen, const BIGNUM *client_dh_pub, const BIGNUM *server_dh_pub, const BIGNUM *shared_secret, u_char *hash, size_t *hashlen) argument
|
H A D | dh.c | 50 char *strsize, *gen, *prime; local 70 /* Ensure this is a safe prime */ 79 /* Ensure prime has been tested and is not composite */ 98 error("moduli:%d: invalid prime length", linenum); 106 prime = strsep(&cp, " "); /* prime */ 107 if (cp != NULL || *prime == '\0') { 122 if (BN_hex2bn(&dhg->p, prime) == 0) { 123 error("moduli:%d: could not parse prime value", linenum); 127 error("moduli:%d: prime ha [all...] |
/freebsd-10-stable/gnu/usr.bin/groff/src/libs/libgroff/ |
H A D | Makefile | 9 maxfilename.cpp mksdir.cpp nametoindex.cpp new.cpp paper.cpp prime.cpp\
|
/freebsd-10-stable/secure/usr.bin/openssl/ |
H A D | Makefile | 19 prime.c rand.c req.c rsa.c rsautl.c s_cb.c s_client.c s_server.c \
|
/freebsd-10-stable/contrib/binutils/libiberty/ |
H A D | hashtab.c | 126 hashval_t prime; member in struct:prime_ent 128 hashval_t inv_m2; /* inverse of prime-2 */ 167 nearest prime number which is greater than N, and near a power of two. */ 178 if (n > prime_tab[mid].prime) 185 if (n > prime_tab[low].prime) 187 fprintf (stderr, "Cannot find prime bigger than %lu\n", n); 270 return htab_mod_1 (hash, p->prime, p->inv, p->shift); 279 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift); 295 size = prime_tab[size_prime_index].prime; 330 size = prime_tab[size_prime_index].prime; [all...] |
/freebsd-10-stable/contrib/gcclibs/libiberty/ |
H A D | hashtab.c | 126 hashval_t prime; member in struct:prime_ent 128 hashval_t inv_m2; /* inverse of prime-2 */ 167 nearest prime number which is greater than N, and near a power of two. */ 178 if (n > prime_tab[mid].prime) 185 if (n > prime_tab[low].prime) 187 fprintf (stderr, "Cannot find prime bigger than %lu\n", n); 270 return htab_mod_1 (hash, p->prime, p->inv, p->shift); 279 return 1 + htab_mod_1 (hash, p->prime - 2, p->inv_m2, p->shift); 295 size = prime_tab[size_prime_index].prime; 330 size = prime_tab[size_prime_index].prime; [all...] |
/freebsd-10-stable/tools/tools/usbtest/ |
H A D | usbtest.c | 66 const uint32_t prime = 0xFFFF1D; local 70 noise_rem += prime;
|
/freebsd-10-stable/crypto/openssl/crypto/ec/ |
H A D | ec_asn1.c | 162 ASN1_INTEGER *prime; member in union:x9_62_fieldid_st::__anon9 232 ADB_ENTRY(NID_X9_62_prime_field, ASN1_SIMPLE(X9_62_FIELDID, p.prime, ASN1_INTEGER)), 337 /* the parameters are specified by the prime number p */ 342 /* set the prime number */ 343 field->p.prime = BN_to_ASN1_INTEGER(tmp, NULL); 344 if (field->p.prime == NULL) { 815 /* we have a curve over a prime field */ 816 /* extract the prime number */ 817 if (!params->fieldID->p.prime) { 821 p = ASN1_INTEGER_to_BN(params->fieldID->p.prime, NUL [all...] |
/freebsd-10-stable/sys/dev/drm2/ |
H A D | drm_gem.c | 175 drm_prime_remove_buf_handle(&filp->prime, 179 drm_prime_remove_buf_handle(&filp->prime,
|