S 1599 compat/nedmalloc/malloc.c.h #define CALL_MORECORE(S) MORECORE(S) S 1601 compat/nedmalloc/malloc.c.h #define CALL_MORECORE(S) MORECORE_DEFAULT(S) S 1604 compat/nedmalloc/malloc.c.h #define CALL_MORECORE(S) MFAIL S 2405 compat/nedmalloc/malloc.c.h #define is_mmapped_segment(S) ((S)->sflags & IS_MMAPPED_BIT) S 2406 compat/nedmalloc/malloc.c.h #define is_extern_segment(S) ((S)->sflags & EXTERN_BIT) S 2586 compat/nedmalloc/malloc.c.h #define page_align(S)\ S 2587 compat/nedmalloc/malloc.c.h (((S) + (mparams.page_size - SIZE_T_ONE)) & ~(mparams.page_size - SIZE_T_ONE)) S 2590 compat/nedmalloc/malloc.c.h #define granularity_align(S)\ S 2591 compat/nedmalloc/malloc.c.h (((S) + (mparams.granularity - SIZE_T_ONE))\ S 2597 compat/nedmalloc/malloc.c.h #define mmap_align(S) granularity_align(S) S 2599 compat/nedmalloc/malloc.c.h #define mmap_align(S) page_align(S) S 2605 compat/nedmalloc/malloc.c.h #define is_page_aligned(S)\ S 2606 compat/nedmalloc/malloc.c.h (((size_t)(S) & (mparams.page_size - SIZE_T_ONE)) == 0) S 2607 compat/nedmalloc/malloc.c.h #define is_granularity_aligned(S)\ S 2608 compat/nedmalloc/malloc.c.h (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0) S 2611 compat/nedmalloc/malloc.c.h #define segment_holds(S, A)\ S 2612 compat/nedmalloc/malloc.c.h ((char*)(A) >= S->base && (char*)(A) < S->base + S->size) S 2752 compat/nedmalloc/malloc.c.h #define compute_tree_index(S, I)\ S 2754 compat/nedmalloc/malloc.c.h unsigned int X = S >> TREEBIN_SHIFT;\ S 2762 compat/nedmalloc/malloc.c.h I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ S 2767 compat/nedmalloc/malloc.c.h #define compute_tree_index(S, I)\ S 2769 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ S 2776 compat/nedmalloc/malloc.c.h I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ S 2781 compat/nedmalloc/malloc.c.h #define compute_tree_index(S, I)\ S 2783 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ S 2791 compat/nedmalloc/malloc.c.h I = (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\ S 2796 compat/nedmalloc/malloc.c.h #define compute_tree_index(S, I)\ S 2798 compat/nedmalloc/malloc.c.h size_t X = S >> TREEBIN_SHIFT;\ S 2810 compat/nedmalloc/malloc.c.h I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\ S 3476 compat/nedmalloc/malloc.c.h #define insert_small_chunk(M, P, S) {\ S 3477 compat/nedmalloc/malloc.c.h bindex_t I = small_index(S);\ S 3480 compat/nedmalloc/malloc.c.h assert(S >= MIN_CHUNK_SIZE);\ S 3495 compat/nedmalloc/malloc.c.h #define unlink_small_chunk(M, P, S) {\ S 3498 compat/nedmalloc/malloc.c.h bindex_t I = small_index(S);\ S 3535 compat/nedmalloc/malloc.c.h #define replace_dv(M, P, S) {\ S 3542 compat/nedmalloc/malloc.c.h M->dvsize = S;\ S 3549 compat/nedmalloc/malloc.c.h #define insert_large_chunk(M, X, S) {\ S 3552 compat/nedmalloc/malloc.c.h compute_tree_index(S, I);\ S 3564 compat/nedmalloc/malloc.c.h size_t K = S << leftshift_for_tree_index(I);\ S 3566 compat/nedmalloc/malloc.c.h if (chunksize(T) != S) {\ S 3690 compat/nedmalloc/malloc.c.h #define insert_chunk(M, P, S)\ S 3691 compat/nedmalloc/malloc.c.h if (is_small(S)) insert_small_chunk(M, P, S)\ S 3692 compat/nedmalloc/malloc.c.h else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } S 3694 compat/nedmalloc/malloc.c.h #define unlink_chunk(M, P, S)\ S 3695 compat/nedmalloc/malloc.c.h if (is_small(S)) unlink_small_chunk(M, P, S)\ S 23 ctype.c S, P, P, P, R, P, P, P, R, R, G, R, P, P, R, P, /* 32.. 47 */