Home
last modified time | relevance | path

Searched refs:idx2bit (Results 1 – 25 of 134) sorted by relevance

123456

/dports/devel/libhoard/Hoard/src/Heap-Layers/heaps/combining/
H A Dsegheap.h104 unsigned long bit = idx2bit (idx); in malloc()
205 static inline unsigned long idx2bit (int i) { in idx2bit() function
219 return binmap[i >> SHIFTS_PER_ULONG] & idx2bit(i); in get_binmap()
223 binmap[i >> SHIFTS_PER_ULONG] |= idx2bit(i); in mark_bin()
227 binmap[i >> SHIFTS_PER_ULONG] &= ~(idx2bit(i)); in unmark_bin()
/dports/lang/luajit-devel/LuaJIT-a91d0d9/src/
H A Dlj_alloc.c644 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
647 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
648 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
649 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
651 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
652 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
653 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1163 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1294 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/lang/luajit-openresty/luajit2-2.1-20211210/src/
H A Dlj_alloc.c644 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
647 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
648 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
649 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
651 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
652 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
653 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1163 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1294 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/lang/luajit/LuaJIT-2.0.5/src/
H A Dlj_alloc.c571 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
574 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
575 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
576 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
578 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
579 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
580 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1089 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1213 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/devel/tex-libtexluajit/texlive-20150521-source/libs/luajit/LuaJIT-2.0.3/src/
H A Dlj_alloc.c584 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
587 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
588 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
589 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
591 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
592 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
593 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1102 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1226 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/misc/xplr/xplr-0.17.0/cargo-crates/luajit-src-210.3.2+resty1085a4d/luajit2/src/
H A Dlj_alloc.c644 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
647 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
648 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
649 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
651 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
652 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
653 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1163 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1294 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/multimedia/aegisub/aegisub-3.2.2/vendor/luajit/src/
H A Dlj_alloc.c557 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
560 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
561 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
562 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
564 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
565 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
566 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1075 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1199 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/benchmarks/sysbench/sysbench-1.0.20/third_party/luajit/luajit/src/
H A Dlj_alloc.c656 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
659 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
660 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
661 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
663 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
664 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
665 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1174 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1298 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/luajit-2.1.0-1e66d0f/src/
H A Dlj_alloc.c644 #define idx2bit(i) ((binmap_t)(1) << (i))
647 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
648 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
649 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
651 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
652 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
653 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1163 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;
1294 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/LuaJIT/src/
H A Dlj_alloc.c565 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
568 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
569 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
570 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
572 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
573 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
574 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1083 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1207 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/www/nift/nsm-2.4.11/LuaJIT/src/
H A Dlj_alloc.c656 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
659 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
660 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
661 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
663 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
664 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
665 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1174 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1298 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/print/tex-luatex/texlive-20150521-source/libs/luajit/LuaJIT-2.0.3/src/
H A Dlj_alloc.c584 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
587 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
588 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
589 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
591 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
592 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
593 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
1102 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
1226 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in lj_alloc_malloc()
/dports/devel/judy/judy-1.0.5/test/
H A Dmalloc-pre2.8a.c1912 #define MIN_SMALLBIN_BIT (idx2bit(smallbin_index(MINSIZE)))
2087 #define idx2bit(i) ((bitmap_t)(1) << (i)) macro
2089 #define mark_smallbin(m,i) ((m)->smallbits |= idx2bit(i))
2090 #define mark_treebin(m,i) ((m)->treebits |= idx2bit(i))
2092 #define clear_smallbin(m,i) ((m)->smallbits &= ~idx2bit(i))
2093 #define clear_treebin(m,i) ((m)->treebits &= ~idx2bit(i))
2765 av->treebits |= idx2bit(idx); in insert_treenode()
2854 av->treebits &= ~idx2bit(t->index); in unlink_leaf_node()
2995 bitmap_t sbit = idx2bit(sidx); in mALLOc()
3073 bitmap_t tbit = idx2bit(tidx); in mALLOc()
/dports/lang/gcc6-aux/gcc-6-20180516/libffi/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/devel/jna/jna-5.7.0/native/libffi/src/
H A Ddlmalloc.c2351 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2354 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2355 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2356 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2358 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2359 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2360 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3758 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4180 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4587 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/gcc12-devel/gcc-12-20211205/libffi/src/
H A Ddlmalloc.c2351 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2354 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2355 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2356 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2358 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2359 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2360 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3758 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4180 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4587 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/gcc8/gcc-8.5.0/libffi/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/python27/Python-2.7.18/Modules/_ctypes/libffi/src/
H A Ddlmalloc.c2351 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2354 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2355 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2356 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2358 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2359 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2360 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3758 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4180 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4587 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/ruby26/ruby-2.6.9/ext/fiddle/libffi-3.2.1/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/mono/mono-5.10.1.57/mono/utils/
H A Ddlmalloc.c2276 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2279 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2280 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2281 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2283 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2284 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2285 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3684 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4113 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4527 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/devel/sdl12/SDL-1.2.15/src/stdlib/
H A DSDL_malloc.c2299 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2302 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2303 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2304 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2306 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2307 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2308 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3701 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4123 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4530 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/gcc10/gcc-10.3.0/libffi/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libffi/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/www/firefox-esr/firefox-91.8.0/js/src/ctypes/libffi/src/
H A Ddlmalloc.c2351 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2354 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2355 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2356 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2358 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2359 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2360 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3758 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4180 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4587 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()
/dports/lang/spidermonkey78/firefox-78.9.0/js/src/ctypes/libffi/src/
H A Ddlmalloc.c2346 #define idx2bit(i) ((binmap_t)(1) << (i)) macro
2349 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i))
2350 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i))
2351 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i))
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4175 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in dlmalloc()
4582 binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx)); in mspace_malloc()

123456