Home
last modified time | relevance | path

Searched refs:NITEMS (Results 1 – 2 of 2) sorted by relevance

/external/jemalloc_new/test/unit/
Dckh.c107 #define NITEMS ZU(1000) in TEST_BEGIN() macro
110 void **p[NITEMS]; in TEST_BEGIN()
119 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
124 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
127 for (j = i; j < NITEMS; j++) { in TEST_BEGIN()
136 assert_zu_eq(ckh_count(&ckh), NITEMS, in TEST_BEGIN()
138 NITEMS, ckh_count(&ckh)); in TEST_BEGIN()
140 for (j = i + 1; j < NITEMS; j++) { in TEST_BEGIN()
154 bool seen[NITEMS]; in TEST_BEGIN()
164 for (k = 0; k < NITEMS; k++) { in TEST_BEGIN()
[all …]
/external/jemalloc/test/unit/
Dckh.c110 #define NITEMS ZU(1000) in TEST_BEGIN() macro
113 void **p[NITEMS]; in TEST_BEGIN()
122 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
127 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
130 for (j = i; j < NITEMS; j++) { in TEST_BEGIN()
139 assert_zu_eq(ckh_count(&ckh), NITEMS, in TEST_BEGIN()
141 NITEMS, ckh_count(&ckh)); in TEST_BEGIN()
143 for (j = i + 1; j < NITEMS; j++) { in TEST_BEGIN()
157 bool seen[NITEMS]; in TEST_BEGIN()
167 for (k = 0; k < NITEMS; k++) { in TEST_BEGIN()
[all …]