Home
last modified time | relevance | path

Searched refs:assert_u_eq (Results 1 – 25 of 32) sorted by relevance

12

/external/jemalloc/test/unit/
Dticker.c13 assert_u_eq(ticker_read(&ticker), NTICKS - j, in TEST_BEGIN()
36 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
38 assert_u_eq(ticker_read(&ticker), 0, "Unexpected ticker value"); in TEST_BEGIN()
40 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
43 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
55 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
57 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
61 assert_u_eq(ticker_read(&tb), NTICKS - 1, "Unexpected ticker value"); in TEST_BEGIN()
63 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
Dsize_classes.c44 assert_u_eq(index, size2index(size_class), in TEST_BEGIN()
55 assert_u_eq(index+1, size2index(size_class+1), in TEST_BEGIN()
69 assert_u_eq(index, size2index(index2size(index)), in TEST_BEGIN()
101 assert_u_eq(pind, psz2ind(size_class), in TEST_BEGIN()
112 assert_u_eq(pind+1, psz2ind(size_class+1), in TEST_BEGIN()
126 assert_u_eq(pind, psz2ind(pind2sz(pind)), in TEST_BEGIN()
146 assert_u_eq(size2index(max_size_class+1), NSIZES, in TEST_BEGIN()
148 assert_u_eq(size2index(ZU(PTRDIFF_MAX)+1), NSIZES, in TEST_BEGIN()
150 assert_u_eq(size2index(SIZE_T_MAX), NSIZES, in TEST_BEGIN()
160 assert_u_eq(psz2ind(max_size_class+1), NPSIZES, in TEST_BEGIN()
[all …]
Drb.c190 assert_u_eq(imbalances, 0, "Tree is unbalanced"); in node_remove()
191 assert_u_eq(tree_iterate(tree), nnodes-1, in node_remove()
193 assert_u_eq(tree_iterate_reverse(tree), nnodes-1, in node_remove()
273 assert_u_eq(imbalances, 0, in TEST_BEGIN()
276 assert_u_eq(tree_iterate(&tree), k+1, in TEST_BEGIN()
278 assert_u_eq(tree_iterate_reverse(&tree), k+1, in TEST_BEGIN()
312 assert_u_eq(nnodes, 0, in TEST_BEGIN()
326 assert_u_eq(nnodes, 0, in TEST_BEGIN()
332 assert_u_eq(nnodes, 0, in TEST_BEGIN()
Dph.c197 assert_u_eq(heap_validate(&heap), 0, in TEST_BEGIN()
212 assert_u_eq(heap_validate(&heap), k + 1, in TEST_BEGIN()
223 assert_u_eq(heap_validate(&heap), j - k, in TEST_BEGIN()
226 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
233 assert_u_eq(heap_validate(&heap), k - 1, in TEST_BEGIN()
241 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
255 assert_u_eq(heap_validate(&heap), j - k, in TEST_BEGIN()
263 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
Djunk.c32 assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK, in arena_dalloc_junk_small_intercept()
47 assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK, in arena_dalloc_junk_large_intercept()
91 assert_u_eq(s[0], 'a', in test_junk()
94 assert_u_eq(s[sz_prev-1], 'a', in test_junk()
101 assert_u_eq(s[i], JEMALLOC_ALLOC_JUNK, in test_junk()
Dzero.c22 assert_u_eq(s[0], MAGIC, in test_zero()
25 assert_u_eq(s[sz_prev-1], MAGIC, in test_zero()
31 assert_u_eq(s[i], 0x0, in test_zero()
Dmq.c18 assert_u_eq(mq_count(&mq), 0, "mq should be empty"); in mq_gen()
23 assert_u_eq(mq_count(&mq), 1, "mq should contain one message"); in mq_gen()
Dwitness.c46 assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank"); in witness_comp()
55 assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank"); in witness_comp_reverse()
Dql.c28 assert_u_eq(i, 0, "Unexpected element for empty list"); in test_empty_list()
34 assert_u_eq(i, 0, "Unexpected element for empty list"); in test_empty_list()
Dqr.c37 assert_u_eq(j, 1, in test_independent_entries()
46 assert_u_eq(j, 1, in test_independent_entries()
Dmtx.c48 assert_u_eq(arg.x, NTHREADS * NINCRS, in TEST_BEGIN()
/external/jemalloc_new/test/unit/
Dticker.c14 assert_u_eq(ticker_read(&ticker), NTICKS - j, in TEST_BEGIN()
36 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
38 assert_u_eq(ticker_read(&ticker), 0, "Unexpected ticker value"); in TEST_BEGIN()
40 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
43 assert_u_eq(ticker_read(&ticker), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
54 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
56 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
60 assert_u_eq(ticker_read(&tb), NTICKS - 1, "Unexpected ticker value"); in TEST_BEGIN()
62 assert_u_eq(ticker_read(&tb), NTICKS, "Unexpected ticker value"); in TEST_BEGIN()
Dsize_classes.c42 assert_u_eq(index, sz_size2index(size_class), in TEST_BEGIN()
54 assert_u_eq(index+1, sz_size2index(size_class+1), in TEST_BEGIN()
68 assert_u_eq(index, sz_size2index(sz_index2size(index)), in TEST_BEGIN()
100 assert_u_eq(pind, sz_psz2ind(size_class), in TEST_BEGIN()
111 assert_u_eq(pind+1, sz_psz2ind(size_class+1), in TEST_BEGIN()
125 assert_u_eq(pind, sz_psz2ind(sz_pind2sz(pind)), in TEST_BEGIN()
145 assert_u_eq(sz_size2index(max_size_class+1), NSIZES, in TEST_BEGIN()
147 assert_u_eq(sz_size2index(ZU(PTRDIFF_MAX)+1), NSIZES, in TEST_BEGIN()
149 assert_u_eq(sz_size2index(SIZE_T_MAX), NSIZES, in TEST_BEGIN()
159 assert_u_eq(sz_psz2ind(max_size_class+1), NPSIZES, in TEST_BEGIN()
[all …]
Dph.c206 assert_u_eq(heap_validate(&heap), 0, in TEST_BEGIN()
223 assert_u_eq(heap_validate(&heap), k + 1, in TEST_BEGIN()
234 assert_u_eq(heap_validate(&heap), j - k, in TEST_BEGIN()
237 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
244 assert_u_eq(heap_validate(&heap), k - 1, in TEST_BEGIN()
252 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
266 assert_u_eq(heap_validate(&heap), j - k, in TEST_BEGIN()
274 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
282 assert_u_eq(heap_validate(&heap), j - k in TEST_BEGIN()
289 assert_u_eq(heap_validate(&heap), j - k, in TEST_BEGIN()
[all …]
Drb.c192 assert_u_eq(imbalances, 0, "Tree is unbalanced"); in node_remove()
193 assert_u_eq(tree_iterate(tree), nnodes-1, in node_remove()
195 assert_u_eq(tree_iterate_reverse(tree), nnodes-1, in node_remove()
274 assert_u_eq(imbalances, 0, in TEST_BEGIN()
277 assert_u_eq(tree_iterate(&tree), k+1, in TEST_BEGIN()
279 assert_u_eq(tree_iterate_reverse(&tree), k+1, in TEST_BEGIN()
315 assert_u_eq(nnodes, 0, in TEST_BEGIN()
329 assert_u_eq(nnodes, 0, in TEST_BEGIN()
335 assert_u_eq(nnodes, 0, in TEST_BEGIN()
Djunk.c23 assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK, in arena_dalloc_junk_small_intercept()
38 assert_u_eq(((uint8_t *)ptr)[i], JEMALLOC_FREE_JUNK, in large_dalloc_junk_intercept()
76 assert_u_eq(s[0], 'a', in test_junk()
79 assert_u_eq(s[sz_prev-1], 'a', in test_junk()
86 assert_u_eq(s[i], JEMALLOC_ALLOC_JUNK, in test_junk()
Dzero.c16 assert_u_eq(s[0], MAGIC, in test_zero()
19 assert_u_eq(s[sz_prev-1], MAGIC, in test_zero()
25 assert_u_eq(s[i], 0x0, in test_zero()
Dmq.c17 assert_u_eq(mq_count(&mq), 0, "mq should be empty"); in mq_gen()
22 assert_u_eq(mq_count(&mq), 1, "mq should contain one message"); in mq_gen()
Dtsd.c101 assert_u_eq(tsd->state, tsd_state_purgatory, in thd_start_reincarnated()
105 assert_u_eq(tsd->state, tsd_state_reincarnated, in thd_start_reincarnated()
Dretained.c79 assert_u_eq(cur_epoch, next_epoch, "Unexpected epoch"); in thd_start()
165 assert_u_eq(do_arena_create(NULL), arena_ind, in TEST_BEGIN()
Dql.c29 assert_u_eq(i, 0, "Unexpected element for empty list"); in test_empty_list()
35 assert_u_eq(i, 0, "Unexpected element for empty list"); in test_empty_list()
Dqr.c37 assert_u_eq(j, 1, in test_independent_entries()
46 assert_u_eq(j, 1, in test_independent_entries()
Dwitness.c37 assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank"); in witness_comp()
48 assert_u_eq(a->rank, b->rank, "Witnesses should have equal rank"); in witness_comp_reverse()
Dmtx.c47 assert_u_eq(arg.x, NTHREADS * NINCRS, in TEST_BEGIN()
/external/jemalloc/test/integration/
Dthread_arena.c35 assert_u_eq(arena_ind, main_arena_ind, in thd_start()

12