Home
last modified time | relevance | path

Searched refs:ZU (Results 1 – 21 of 21) sorted by relevance

/redis-3.2.3/deps/jemalloc/test/unit/
H A Dutil.c11 assert_zu_eq(pow2_ceil(ZU(1) << i), ZU(1) << i, in TEST_BEGIN()
16 assert_zu_eq(pow2_ceil((ZU(1) << i) - 1), ZU(1) << i, in TEST_BEGIN()
21 assert_zu_eq(pow2_ceil((ZU(1) << i) + 1), ZU(1) << (i+1), in TEST_BEGIN()
26 for (x = (ZU(1) << (pow2-1)) + 1; x <= ZU(1) << pow2; x++) { in TEST_BEGIN()
27 assert_zu_eq(pow2_ceil(x), ZU(1) << pow2, in TEST_BEGIN()
H A Dckh.c38 "ckh_count() should return %zu, but it returned %zu", ZU(0), in TEST_BEGIN()
110 #define NITEMS ZU(1000) in TEST_BEGIN()
200 ZU(0), ckh_count(&ckh)); in TEST_BEGIN()
H A Dzero.c23 ZU(0), sz_prev); in test_zero()
H A Dquarantine.c24 #define SZ ZU(256) in TEST_BEGIN()
H A Djunk.c93 ZU(0), sz_prev); in test_junk()
/redis-3.2.3/deps/jemalloc/src/
H A Dquarantine.c30 + ((ZU(1) << lg_maxobjs) * sizeof(quarantine_obj_t)), false, in quarantine_init()
74 if (quarantine->first + quarantine->curobjs <= (ZU(1) << in quarantine_grow()
81 size_t ncopy_a = (ZU(1) << quarantine->lg_maxobjs) - in quarantine_grow()
104 quarantine->first = (quarantine->first + 1) & ((ZU(1) << in quarantine_drain_one()
139 if (quarantine->curobjs == (ZU(1) << quarantine->lg_maxobjs)) in quarantine()
142 assert(quarantine->curobjs < (ZU(1) << quarantine->lg_maxobjs)); in quarantine()
146 ((ZU(1) << quarantine->lg_maxobjs) - 1); in quarantine()
H A Dckh.c58 for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) { in ckh_bucket_search()
80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch()
86 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch()
103 for (i = 0; i < (ZU(1) << LG_CKH_BUCKET_CELLS); i++) { in ckh_try_bucket_insert()
105 ((i + offset) & ((ZU(1) << LG_CKH_BUCKET_CELLS) - 1))]; in ckh_try_bucket_insert()
159 tbucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_evict_reloc_insert()
161 tbucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) in ckh_evict_reloc_insert()
203 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_try_insert()
208 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_try_insert()
381 (ZU(1) << lg_mincells) < mincells; in ckh_new()
[all …]
H A Drtree.c69 nchildren = ZU(1) << rtree->levels[level].bits; in rtree_delete_subtree()
106 node = rtree->alloc(ZU(1) << rtree->levels[level].bits); in rtree_node_init()
H A Dbitmap.c13 assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS)); in bitmap_info_init()
H A Djemalloc.c38 size_t opt_quarantine = ZU(0);
76 ((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)),
1529 assert(((uintptr_t)result & (alignment - 1)) == ZU(0)); in imemalign()
2023 assert(alignment == 0 || ((uintptr_t)p & (alignment - 1)) == ZU(0)); in imallocx_prof()
2046 assert(alignment == 0 || ((uintptr_t)p & (alignment - 1)) == ZU(0)); in imallocx_no_prof()
2208 assert(alignment == 0 || ((uintptr_t)p & (alignment - 1)) == ZU(0)); in je_rallocx()
H A Dchunk.c728 chunksize = (ZU(1) << opt_lg_chunk); in chunk_boot()
735 if (rtree_new(&chunks_rtree, (ZU(1) << (LG_SIZEOF_PTR+3)) - in chunk_boot()
H A Dstats.c563 "Chunk size: %zu (2^%zu)\n", (ZU(1) << sv), sv); in stats_print()
H A Darena.c3114 size_t align_min = ZU(1) << (jemalloc_ffs(bin_info->reg_size) - in bin_info_run_size_calc()
3198 BIN_INFO_INIT_bin_##bin(index, (ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)) in bin_info_init()
3222 TAB_INIT_bin_##bin(index, (ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)) in small_run_size_init()
/redis-3.2.3/deps/jemalloc/test/integration/
H A Drallocx.c11 #define MAXSZ ZU(12 * 1024 * 1024) in TEST_BEGIN()
117 #define MAX_ALIGN (ZU(1) << 25) in TEST_BEGIN()
119 align = ZU(1); in TEST_BEGIN()
143 #define MAX_VALIDATE (ZU(1) << 22) in TEST_BEGIN()
145 lg_align = ZU(0); in TEST_BEGIN()
154 (void *)((uintptr_t)q & ((ZU(1) << lg_align)-1)), in TEST_BEGIN()
H A Dmallocx.c71 size = ZU(0x8000000000000000); in TEST_BEGIN()
72 alignment = ZU(0x8000000000000000); in TEST_BEGIN()
74 size = ZU(0x80000000); in TEST_BEGIN()
75 alignment = ZU(0x80000000); in TEST_BEGIN()
/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Djemalloc_internal_macros.h41 #define ZU(z) ((size_t)z) macro
46 #define KZU(z) ZU(z##ULL)
H A Drtree.h18 #define RTREE_BITS_PER_LEVEL (ZU(1) << LG_RTREE_BITS_PER_LEVEL)
20 ((ZU(1) << (LG_SIZEOF_PTR+3)) / RTREE_BITS_PER_LEVEL)
147 return ((key >> ((ZU(1) << (LG_SIZEOF_PTR+3)) - in rtree_subkey()
148 rtree->levels[level].cumbits)) & ((ZU(1) << in rtree_subkey()
H A Djemalloc_internal.h.in207 (ZU(1) << (flags & MALLOCX_LG_ALIGN_MASK))
535 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
543 (ZU(1)<<(LG_SIZEOF_PTR+3)) : ((ZU(1)<<(LG_SIZEOF_PTR+3))-1))
554 ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
590 return (ZU(1) << (LG_TINY_MAXCLASS - NTBINS + 1 + index));
599 size_t grp_size = ((ZU(1) << (LG_QUANTUM +
632 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
635 return (lg_ceil < lg_tmin ? (ZU(1) << lg_tmin) :
636 (ZU(1) << lg_ceil));
641 (ZU(1)<<(LG_SIZEOF_PTR+3)) : ((ZU(1)<<(LG_SIZEOF_PTR+3))-1))
[all …]
H A Dquarantine.h8 #define JEMALLOC_VALGRIND_QUARANTINE_DEFAULT (ZU(1) << 24)
H A Dbitmap.h6 #define BITMAP_MAXBITS (ZU(1) << LG_BITMAP_MAXBITS)
15 #define BITMAP_GROUP_NBITS (ZU(1) << LG_BITMAP_GROUP_NBITS)
H A Darena.h4 #define LARGE_MINCLASS (ZU(1) << LG_LARGE_MINCLASS)