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

  /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/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/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/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/elfutils/lib/
Makefile.am 28 libeu_a_SOURCES = xstrdup.c xstrndup.c xmalloc.c next_prime.c crc32.c
next_prime.c 45 next_prime (size_t seed) function
dynamicsizehash.h 38 extern size_t next_prime (size_t seed);
fixedsizehash.h 45 extern size_t next_prime (size_t seed);
96 nelems = next_prime (MAX ((nelems * 3) / 2, 10));
dynamicsizehash.c 111 htab->size = next_prime (htab->size * 2);
168 init_size = next_prime (init_size);
Makefile 61 xmalloc.$(OBJEXT) next_prime.$(OBJEXT) crc32.$(OBJEXT)
184 libeu_a_SOURCES = xstrdup.c xstrndup.c xmalloc.c next_prime.c crc32.c
239 include ./$(DEPDIR)/next_prime.Po
Makefile.in 61 xmalloc.$(OBJEXT) next_prime.$(OBJEXT) crc32.$(OBJEXT)
184 libeu_a_SOURCES = xstrdup.c xstrndup.c xmalloc.c next_prime.c crc32.c
239 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/next_prime.Po@am__quote@
libeu.a 50 next_prime.o/ 1151100195 10057810545 100644 2476 `
52 L?.text`? `.data@?.bss??.stab?<x.stabstr??U??MVS????t&? ?9?s"??1?????tC???4?9?rC9?r?&1?????u????[??^]Ð??????????9?d0d=<L?v???????4??????0?Z??????????0?P?u?????????? ???E?4$.F?-D.D0D.D0DDD$D *D+D!-D"0D$4D%@DFD3JD6OR@-^@j@?t@?*?5?F$UdUnext_prime.c/cygdrive/c/p4/elfutils-0.97/lib/next_prime.cgcc2_compiled.int:t(0,1)=r(0,1);-2147483648;2147483647;char:t(0,2)=r(0,2);0;127;long int:t(0,3)=r(0,3);-2147483648;2147483647;unsigned int:t(0,4)=r(0,4);0000000000000;0037777777777;long unsigned int:t(0,5)=r(0,5);0000000000000;0037777777777;long long int:t(0,6)=@s64;r(0,6);01000000000000000000000;0777777777777777777777;long long unsigned int:t(0,7)=@s64;r(0,7);0000000000000;01777777777777777777777;short int:t(0,8)=@s16;r(0,8);-32768;32767;short unsigned int:t(0,9)=@s16;r(0,9);0;65535;signed char:t(0,10)=@s8;r(0,10);-128;127;unsigned char:t(0,11)=@s8;r(0,11);0;255;float:t(0,12)=r(0,1);4;0;double:t(0,13)=r(0,1);8;0;long double:t(0,14)=r(0,1);12;0;complex int:t(0,15)=s8real:(0,1),0,32;imag:(0,1),32,32;;complex float:t(0,16)=R3;8;0;complex double:t(0,17)=R3;16;0;complex long double:t(0,18)=R3;24;0;void:t(0,19)=(0,19)__builtin_va_list:t(0,20)=*(0,2)_Bool:t(0,21)=@s8;-16;/usr/lib/gcc/i686-pc-cygwin/3.4.4/include/stddef.hptrdiff_t:t(1,1)=(0,1)size_t:t(1,2)=(0,4)wchar_t:t(1,3)=(0,9)next_prime:F(1,2)seed:p(1,2)seed:r(1,2)divn:r(1,2)sq:r(1,2)old_sq:r(1,2) p?.file??gnext_prime.c .textU.data.bss.stab?.stabstr?_next_primecrc32.o/ 1151100195 10057810545 100644 4751 `
    [all...]
  /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);
  /external/dropbear/libtommath/
changes.txt 186 -- Fixed a bug in next_prime() where an input of zero would be treated as odd and
191 -- changed the next_prime() prototype to accept a new parameter "bbs_style" which
  /external/dropbear/libtomcrypt/
changes     [all...]

Completed in 989 milliseconds