| /external/jemalloc/test/unit/ |
| D | util.c | 11 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()
|
| D | ckh.c | 38 "ckh_count() should return %zu, but it returned %zu", ZU(0), in TEST_BEGIN()
110 #define NITEMS ZU(1000) in TEST_BEGIN()
199 "ckh_count() should return %zu, but it returned %zu", ZU(0), in TEST_BEGIN()
|
| D | zero.c | 23 ZU(0), sz_prev); in test_zero()
|
| D | quarantine.c | 24 #define SZ ZU(256) in TEST_BEGIN()
|
| D | junk.c | 93 ZU(0), sz_prev); in test_junk()
|
| /external/jemalloc/src/ |
| D | quarantine.c | 30 + ((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()
|
| D | ckh.c | 58 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 …]
|
| D | rtree.c | 69 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()
|
| D | bitmap.c | 13 assert(nbits <= (ZU(1) << LG_BITMAP_MAXBITS)); in bitmap_info_init()
|
| D | chunk.c | 508 chunksize = (ZU(1) << opt_lg_chunk); in chunk_boot()
515 if (rtree_new(&chunks_rtree, (ZU(1) << (LG_SIZEOF_PTR+3)) - in chunk_boot()
|
| D | arena.c | 2918 size_t align_min = ZU(1) << (jemalloc_ffs(bin_info->reg_size) - in bin_info_run_size_calc()
3002 BIN_INFO_INIT_bin_##bin(index, (ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)) in bin_info_init()
3026 TAB_INIT_bin_##bin(index, (ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)) in small_run_size_init()
|
| D | jemalloc.c | 38 size_t opt_quarantine = ZU(0);
76 ((ZU(1)<<lg_grp) + (ZU(ndelta)<<lg_delta)),
|
| D | stats.c | 562 (ZU(1) << sv), sv); in stats_print()
|
| /external/jemalloc/test/integration/ |
| D | rallocx.c | 11 #define MAXSZ ZU(12 * 1024 * 1024) in TEST_BEGIN()
116 #define MAX_ALIGN (ZU(1) << 25) in TEST_BEGIN()
118 align = ZU(1); in TEST_BEGIN()
142 #define MAX_VALIDATE (ZU(1) << 22) in TEST_BEGIN()
144 lg_align = ZU(0); in TEST_BEGIN()
153 (void *)((uintptr_t)q & ((ZU(1) << lg_align)-1)), in TEST_BEGIN()
|
| /external/jemalloc/include/jemalloc/internal/ |
| D | jemalloc_internal.h | 200 (ZU(1) << (flags & MALLOCX_LG_ALIGN_MASK))
524 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) { in size2index_compute()
532 (ZU(1)<<(LG_SIZEOF_PTR+3)) : ((ZU(1)<<(LG_SIZEOF_PTR+3))-1)) in size2index_compute()
543 ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1); in size2index_compute()
580 return (ZU(1) << (LG_TINY_MAXCLASS - NTBINS + 1 + index)); in index2size_compute()
586 size_t mod = reduced_index & ((ZU(1) << LG_SIZE_CLASS_GROUP) - in index2size_compute()
590 size_t grp_size = ((ZU(1) << (LG_QUANTUM + in index2size_compute()
623 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) { in s2u_compute()
626 return (lg_ceil < lg_tmin ? (ZU(1) << lg_tmin) : in s2u_compute()
627 (ZU(1) << lg_ceil)); in s2u_compute()
[all …]
|
| D | jemalloc_internal_macros.h | 41 #define ZU(z) ((size_t)z) macro
46 #define KZU(z) ZU(z##ULL)
|
| D | rtree.h | 18 #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()
|
| D | jemalloc_internal.h.in | 200 (ZU(1) << (flags & MALLOCX_LG_ALIGN_MASK))
524 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
532 (ZU(1)<<(LG_SIZEOF_PTR+3)) : ((ZU(1)<<(LG_SIZEOF_PTR+3))-1))
543 ((ZU(1) << LG_SIZE_CLASS_GROUP) - 1);
580 return (ZU(1) << (LG_TINY_MAXCLASS - NTBINS + 1 + index));
586 size_t mod = reduced_index & ((ZU(1) << LG_SIZE_CLASS_GROUP) -
590 size_t grp_size = ((ZU(1) << (LG_QUANTUM +
623 if (size <= (ZU(1) << LG_TINY_MAXCLASS)) {
626 return (lg_ceil < lg_tmin ? (ZU(1) << lg_tmin) :
627 (ZU(1) << lg_ceil));
[all …]
|
| D | quarantine.h | 8 #define JEMALLOC_VALGRIND_QUARANTINE_DEFAULT (ZU(1) << 24)
|
| D | bitmap.h | 6 #define BITMAP_MAXBITS (ZU(1) << LG_BITMAP_MAXBITS)
15 #define BITMAP_GROUP_NBITS (ZU(1) << LG_BITMAP_GROUP_NBITS)
|
| /external/icu/icu4c/source/data/translit/ |
| D | Katakana_Latin_BGN.txt | 136 ズ → zu ; # KATAKANA LETTER ZU
279 ず → zu ; # HIRAGANA LETTER ZU
|
| D | Fullwidth_Halfwidth.txt | 17 ズ↔ｽﾞ; # to KATAKANA LETTER ZU
|
| D | Amharic_Latin_BGN.txt | 203 ዙ → zu ; # ETHIOPIC SYLLABLE ZU
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/it-IT/ |
| D | it-IT_kdt_posp.pkb | 183 …�#}��A �� �w�l!{�p�_��@a����8�Q�[P�x��U�Q1� �M^]� !�/ְ���@���_�ZU�����k��.Z ��%o�أ…
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/es-ES/ |
| D | es-ES_zl0_kpdf_lfz.pkb | 120 � ��C� 6�My��W���Q����:ZU�a�&L���k� AnMN�����陎Q����u��n�j�
|