HomeSort by relevance Sort by last modified time
    Searched defs:next_prime (Results 1 - 9 of 9) sorted by null

  /external/elfutils/libelf/
libelf_next_prime.c 20 #define next_prime attribute_hidden __libelf_next_prime macro
21 #include "../lib/next_prime.c"
nlist.c 43 #define next_prime(s) __libelf_next_prime (s) macro
  /external/elfutils/libdw/
dwarf_abbrev_hash.c 22 #define next_prime __libdwarf_next_prime macro
23 extern size_t next_prime (size_t) attribute_hidden;
27 #undef next_prime macro
28 #define next_prime attribute_hidden __libdwarf_next_prime macro
29 #include "../lib/next_prime.c"
  /external/elfutils/lib/
next_prime.c 45 next_prime (size_t seed) function
  /external/elfutils/libasm/
symbolhash.c 32 #define next_prime __libasm_next_prime macro
33 extern size_t next_prime (size_t) attribute_hidden;
37 #undef next_prime macro
38 #define next_prime attribute_hidden __libasm_next_prime macro
39 #include "../lib/next_prime.c"
  /external/chromium/testing/gtest/samples/
sample8_unittest.cc 70 int next_prime = -1; local
72 next_prime = precalc_impl_->GetNextPrime(p);
74 return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p);
  /external/gtest/samples/
sample8_unittest.cc 70 int next_prime = -1; local
72 next_prime = precalc_impl_->GetNextPrime(p);
74 return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p);
  /external/protobuf/gtest/samples/
sample8_unittest.cc 70 int next_prime = -1; local
72 next_prime = precalc_impl_->GetNextPrime(p);
74 return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p);
  /external/bison/lib/
hash.c 456 next_prime (size_t candidate) function
491 is 11 (due to next_prime's algorithm), so an epsilon of 0.1
576 table->n_buckets = next_prime (candidate);

Completed in 2245 milliseconds