Lines Matching refs:M
2649 #define is_global(M) ((M) == &_gm_) argument
2653 #define is_initialized(M) ((M)->top != 0) argument
2659 #define use_lock(M) ((M)->mflags & USE_LOCK_BIT) argument
2660 #define enable_lock(M) ((M)->mflags |= USE_LOCK_BIT) argument
2662 #define disable_lock(M) ((M)->mflags &= ~USE_LOCK_BIT) argument
2664 #define disable_lock(M) argument
2667 #define use_mmap(M) ((M)->mflags & USE_MMAP_BIT) argument
2668 #define enable_mmap(M) ((M)->mflags |= USE_MMAP_BIT) argument
2670 #define disable_mmap(M) ((M)->mflags &= ~USE_MMAP_BIT) argument
2672 #define disable_mmap(M) argument
2675 #define use_noncontiguous(M) ((M)->mflags & USE_NONCONTIGUOUS_BIT) argument
2676 #define disable_contiguous(M) ((M)->mflags |= USE_NONCONTIGUOUS_BIT) argument
2678 #define set_lock(M,L)\ argument
2679 ((M)->mflags = (L)?\
2680 ((M)->mflags | USE_LOCK_BIT) :\
2681 ((M)->mflags & ~USE_LOCK_BIT))
2735 #define should_trim(M,s) ((s) > (M)->trim_check) argument
2737 #define should_trim(M,s) (0) argument
2758 #define PREACTION(M) ((use_lock(M))? ACQUIRE_LOCK(&(M)->mutex) : 0) argument
2759 #define POSTACTION(M) { if (use_lock(M)) RELEASE_LOCK(&(M)->mutex); } argument
2763 #define PREACTION(M) (0) argument
2767 #define POSTACTION(M) argument
2808 #define check_free_chunk(M,P) argument
2809 #define check_inuse_chunk(M,P) argument
2810 #define check_malloced_chunk(M,P,N) argument
2811 #define check_mmapped_chunk(M,P) argument
2812 #define check_malloc_state(M) argument
2813 #define check_top_chunk(M,P) argument
2816 #define check_free_chunk(M,P) do_check_free_chunk(M,P) argument
2817 #define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) argument
2818 #define check_top_chunk(M,P) do_check_top_chunk(M,P) argument
2819 #define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) argument
2820 #define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) argument
2821 #define check_malloc_state(M) do_check_malloc_state(M) argument
2845 #define smallbin_at(M, i) ((sbinptr)((char*)&((M)->smallbins[(i)<<1]))) argument
2846 #define treebin_at(M,i) (&((M)->treebins[i])) argument
2933 #define mark_smallmap(M,i) ((M)->smallmap |= idx2bit(i)) argument
2934 #define clear_smallmap(M,i) ((M)->smallmap &= ~idx2bit(i)) argument
2935 #define smallmap_is_marked(M,i) ((M)->smallmap & idx2bit(i)) argument
2937 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i)) argument
2938 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i)) argument
2939 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i)) argument
3024 #define ok_address(M, a) ((char*)(a) >= (M)->least_addr) argument
3033 #define ok_address(M, a) (1) argument
3041 #define ok_magic(M) ((M)->magic == mparams.magic) argument
3043 #define ok_magic(M) (1) argument
3061 #define mark_inuse_foot(M,p,s) argument
3066 #define set_inuse(M,p,s)\ argument
3071 #define set_inuse_and_pinuse(M,p,s)\ argument
3076 #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ argument
3082 #define mark_inuse_foot(M,p,s)\ argument
3083 (((mchunkptr)((char*)(p) + (s)))->prev_foot = ((size_t)(M) ^ mparams.magic))
3089 #define set_inuse(M,p,s)\ argument
3092 mark_inuse_foot(M,p,s))
3094 #define set_inuse_and_pinuse(M,p,s)\ argument
3097 mark_inuse_foot(M,p,s))
3099 #define set_size_and_pinuse_of_inuse_chunk(M, p, s)\ argument
3101 mark_inuse_foot(M, p, s))
3582 #define insert_small_chunk(M, P, S) {\ argument
3584 mchunkptr B = smallbin_at(M, I);\
3587 if (!smallmap_is_marked(M, I))\
3588 mark_smallmap(M, I);\
3589 else if (RTCHECK(ok_address(M, B->fd)))\
3592 CORRUPTION_ERROR_ACTION(M);\
3601 #define unlink_small_chunk(M, P, S) {\ argument
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) ||\
3613 (ok_address(M, B) && B->fd == P))) {\
3618 CORRUPTION_ERROR_ACTION(M);\
3622 CORRUPTION_ERROR_ACTION(M);\
3627 #define unlink_first_small_chunk(M, B, P, I) {\ argument
3633 clear_smallmap(M, I);\
3635 else if (RTCHECK(ok_address(M, F) && F->bk == P)) {\
3640 CORRUPTION_ERROR_ACTION(M);\
3646 #define replace_dv(M, P, S) {\ argument
3647 size_t DVS = M->dvsize;\
3650 mchunkptr DV = M->dv;\
3651 insert_small_chunk(M, DV, DVS);\
3653 M->dvsize = S;\
3654 M->dv = P;\
3660 #define insert_large_chunk(M, X, S) {\ argument
3664 H = treebin_at(M, I);\
3667 if (!treemap_is_marked(M, I)) {\
3668 mark_treemap(M, I);\
3682 else if (RTCHECK(ok_address(M, C))) {\
3689 CORRUPTION_ERROR_ACTION(M);\
3695 if (RTCHECK(ok_address(M, T) && ok_address(M, F))) {\
3703 CORRUPTION_ERROR_ACTION(M);\
3728 #define unlink_large_chunk(M, X) {\ argument
3734 if (RTCHECK(ok_address(M, F) && F->bk == X && R->fd == X)) {\
3739 CORRUPTION_ERROR_ACTION(M);\
3751 if (RTCHECK(ok_address(M, RP)))\
3754 CORRUPTION_ERROR_ACTION(M);\
3759 tbinptr* H = treebin_at(M, X->index);\
3762 clear_treemap(M, X->index);\
3764 else if (RTCHECK(ok_address(M, XP))) {\
3771 CORRUPTION_ERROR_ACTION(M);\
3773 if (RTCHECK(ok_address(M, R))) {\
3777 if (RTCHECK(ok_address(M, C0))) {\
3782 CORRUPTION_ERROR_ACTION(M);\
3785 if (RTCHECK(ok_address(M, C1))) {\
3790 CORRUPTION_ERROR_ACTION(M);\
3794 CORRUPTION_ERROR_ACTION(M);\
3801 #define insert_chunk(M, P, S)\ argument
3802 if (is_small(S)) insert_small_chunk(M, P, S)\
3803 else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }
3805 #define unlink_chunk(M, P, S)\ argument
3806 if (is_small(S)) unlink_small_chunk(M, P, S)\
3807 else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }