2850 #define compute_tree_index(S, I)\  argument
2854     I = 0;\
2856     I = NTREEBINS-1;\
2859     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
2864 #define compute_tree_index(S, I)\  argument
2868     I = 0;\
2870     I = NTREEBINS-1;\
2873     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
2878 #define compute_tree_index(S, I)\  argument
2882     I = 0;\
2884     I = NTREEBINS-1;\
2888     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
2893 #define compute_tree_index(S, I)\  argument
2897     I = 0;\
2899     I = NTREEBINS-1;\
2907     I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\
2953 #define compute_bit2idx(X, I)\  argument
2957   I = (bindex_t)J;\
2961 #define compute_bit2idx(X, I)\  argument
2965   I = (bindex_t)J;\
2969 #define compute_bit2idx(X, I)\  argument
2973   I = (bindex_t)J;\
2977 #define compute_bit2idx(X, I) I = ffs(X)-1  argument
2980 #define compute_bit2idx(X, I)\  argument
2989   I = (bindex_t)(N + Y);\
3583   bindex_t I  = small_index(S);\
3584   mchunkptr B = smallbin_at(M, I);\
3587   if (!smallmap_is_marked(M, I))\
3588     mark_smallmap(M, I);\
3604   bindex_t I = small_index(S);\
3607   assert(chunksize(P) == small_index2size(I));\
3608   if (RTCHECK(F == smallbin_at(M,I) || (ok_address(M, F) && F->bk == P))) { \
3610       clear_smallmap(M, I);\
3612     else if (RTCHECK(B == smallbin_at(M,I) ||\
3627 #define unlink_first_small_chunk(M, B, P, I) {\  argument
3631   assert(chunksize(P) == small_index2size(I));\
3633     clear_smallmap(M, I);\
3662   bindex_t I;\
3663   compute_tree_index(S, I);\
3664   H = treebin_at(M, I);\
3665   X->index = I;\
3667   if (!treemap_is_marked(M, I)) {\
3668     mark_treemap(M, I);\
3675     size_t K = S << leftshift_for_tree_index(I);\