Home
last modified time | relevance | path

Searched refs:is_prime (Results 1 – 7 of 7) sorted by relevance

/external/elfutils/lib/
Dnext_prime.c55 is_prime (size_t candidate) in is_prime() function
82 while (!is_prime (seed)) in next_prime()
/external/valgrind/main/drd/tests/
Domp_prime.c16 static int is_prime(int* const pflag, int v) in is_prime() function
94 if (is_prime(pflag, i)) in main()
/external/chromium_org/third_party/openssl/openssl/apps/
Decparam.c481 int is_prime, len = 0; in MAIN() local
493 is_prime = (EC_METHOD_get_field_type(meth) == in MAIN()
496 if (is_prime) in MAIN()
571 if (is_prime) in MAIN()
/external/openssl/apps/
Decparam.c481 int is_prime, len = 0; in MAIN() local
493 is_prime = (EC_METHOD_get_field_type(meth) == in MAIN()
496 if (is_prime) in MAIN()
571 if (is_prime) in MAIN()
/external/bison/lib/
Dhash.c444 is_prime (size_t candidate) in is_prime() function
472 while (SIZE_MAX != candidate && !is_prime (candidate)) in next_prime()
/external/dropbear/libtomcrypt/
Dchanges710 -- Added _ARGCHK() calls to is_prime() for the two input pointers.
793 -- Optimized prime.c to not include a 2nd prime table, removed code from is_prime calls prime
1052 -- Added an additional check for memory errors in is_prime() and cleaned up prime.c a bit
1344 … -- Updated the is_prime() function to use a new prototype [it can return errors now] and it also
Dcrypt.tex4906 int is_prime(mp_int *N, int *result);