I                2552 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_tree_index(S, I)\
I                2556 oshmem/mca/memheap/ptmalloc/malloc.c     I = 0;\
I                2558 oshmem/mca/memheap/ptmalloc/malloc.c     I = NTREEBINS-1;\
I                2562 oshmem/mca/memheap/ptmalloc/malloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
I                2567 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_tree_index(S, I)\
I                2571 oshmem/mca/memheap/ptmalloc/malloc.c     I = 0;\
I                2573 oshmem/mca/memheap/ptmalloc/malloc.c     I = NTREEBINS-1;\
I                2577 oshmem/mca/memheap/ptmalloc/malloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
I                2581 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_tree_index(S, I)\
I                2585 oshmem/mca/memheap/ptmalloc/malloc.c     I = 0;\
I                2587 oshmem/mca/memheap/ptmalloc/malloc.c     I = NTREEBINS-1;\
I                2595 oshmem/mca/memheap/ptmalloc/malloc.c     I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\
I                2632 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\
I                2636 oshmem/mca/memheap/ptmalloc/malloc.c   I = (bindex_t)J;\
I                2639 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\
I                2643 oshmem/mca/memheap/ptmalloc/malloc.c   I = (bindex_t)J;\
I                2648 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I) I = ffs(X)-1
I                2651 oshmem/mca/memheap/ptmalloc/malloc.c #define compute_bit2idx(X, I)\
I                2660 oshmem/mca/memheap/ptmalloc/malloc.c   I = (bindex_t)(N + Y);\