HomeSort by: relevance | last modified time | path
    Searched refs:N_PTRS (Results 1 - 4 of 4) sorted by relevancy

  /src/external/bsd/jemalloc.old/dist/test/unit/
prof_stats.c 3 #define N_PTRS 3
6 test_combinations(szind_t ind, size_t sizes_array[N_PTRS],
7 int flags_array[N_PTRS]) {
34 void *ptrs[N_PTRS];
41 for (size_t i = 0; i < N_PTRS; ++i) {
68 for (size_t i = 0; i < N_PTRS; ++i) {
94 size_t sizes_array[N_PTRS];
95 int flags_array[N_PTRS];
96 for (size_t i = 0, sz = sz_index2size(ind) - N_PTRS; i < N_PTRS;
    [all...]
prof_recent.c 557 #define N_PTRS 512
565 void *ptrs[N_PTRS];
588 rand = prng_range_u64(&rand, N_PTRS + N_CTLS * 5);
589 assert(data_p->count <= N_PTRS);
600 } else if (rand < N_PTRS) {
601 assert(data_p->count < N_PTRS);
666 #undef N_PTRS
  /src/external/bsd/jemalloc/dist/test/unit/
prof_stats.c 3 #define N_PTRS 3
7 szind_t ind, size_t sizes_array[N_PTRS], int flags_array[N_PTRS]) {
36 void *ptrs[N_PTRS];
43 for (size_t i = 0; i < N_PTRS; ++i) {
72 for (size_t i = 0; i < N_PTRS; ++i) {
100 size_t sizes_array[N_PTRS];
101 int flags_array[N_PTRS];
102 for (size_t i = 0, sz = sz_index2size(ind) - N_PTRS; i < N_PTRS;
    [all...]
prof_recent.c 578 #define N_PTRS 512
586 void *ptrs[N_PTRS];
609 rand = prng_range_u64(&rand, N_PTRS + N_CTLS * 5);
610 assert(data_p->count <= N_PTRS);
621 } else if (rand < N_PTRS) {
622 assert(data_p->count < N_PTRS);
689 #undef N_PTRS

Completed in 15 milliseconds