/* A version of malloc/free/realloc written by Doug Lea and released to the public domain. preliminary VERSION 2.5.3b working version; unreleased. * History: Based loosely on libg++-1.2X malloc. (It retains some of the overall structure of old version, but most details differ.) Trial version Fri Aug 28 13:14:29 1992 Doug Lea (dl at g.oswego.edu) V2.5 Sat Aug 7 07:41:59 1993 Doug Lea (dl at g.oswego.edu) * removed potential for odd address access in prev_chunk * removed dependency on getpagesize.h * misc cosmetics and a bit more internal documentation * anticosmetics: mangled names in macros to evade debugger strangeness * tested on sparc, hp-700, dec-mips, rs6000 with gcc & native cc (hp, dec only) allowing Detlefs & Zorn comparison study (to appear, SIGPLAN Notices.) V2.5.1 Sat Aug 14 15:40:43 1993 Doug Lea (dl at g) * faster bin computation & slightly different binning * merged all consolidations to one part of malloc proper (eliminating old malloc_find_space & malloc_clean_bin) * Scan 2 returns chunks (not just 1) Sat Apr 2 06:51:25 1994 Doug Lea (dl at g) * Propagate failure in realloc if malloc returns 0 * Add stuff to allow compilation on non-ANSI compilers from kpv@research.att.com V2.5.2 Tue Apr 5 16:20:40 1994 Doug Lea (dl at g) * realloc: try to expand in both directions * malloc: swap order of clean-bin strategy; * realloc: only conditionally expand backwards * Try not to scavenge used bins * Use bin counts as a guide to preallocation * Occasionally bin return list chunks in first scan * Add a few optimizations from colin@nyx10.cs.du.edu V2.5.3 Tue Apr 26 10:16:01 1994 Doug Lea (dl at g) * Overview This malloc, like any other, is a compromised design. Chunks of memory are maintained using a `boundary tag' method as described in e.g., Knuth or Standish. The size of the chunk is stored both in the front of the chunk and at the end. This makes consolidating fragmented chunks into bigger chunks very fast. The size field also hold a bit representing whether a chunk is free or in use. Malloced chunks have space overhead of 8 bytes: The preceding and trailing size fields. When a chunk is freed, 8 additional bytes are needed for free list pointers. Thus, the minimum allocatable size is 16 bytes. 8 byte alignment is currently hardwired into the design. This seems to suffice for all current machines and C compilers. Calling memalign will return a chunk that is both 8-byte aligned and meets the requested (power of two) alignment. It is assumed that 32 bits suffice to represent chunk sizes. The maximum size chunk is 2^31 - 8 bytes. malloc(0) returns a pointer to something of the minimum allocatable size. Requests for negative sizes (when size_t is signed) or with the highest bit set (when unsigned) will also return a minimum-sized chunk. Available chunks are kept in doubly linked lists. The lists are maintained in an array of bins using approximately proportionally spaced bins. There are a lot of bins (128). This may look excessive, but works very well in practice. The use of very fine bin sizes closely approximates the use of one bin per actually used size, without necessitating the overhead of locating such bins. It is especially desirable in common applications where large numbers of identically-sized blocks are malloced/freed in some dynamic manner, and then later are all freed. The finer bin sizes make finding blocks fast, with little wasted overallocation. The consolidation methods ensure that once the collection of blocks is no longer useful, fragments are gathered into bigger chunks awaiting new roles. The bins av[i] serve as heads of the lists. Bins contain a dummy header for the chunk lists. Each bin has two lists. The `dirty' list holds chunks that have been returned (freed) and not yet either re-malloc'ed or consolidated. (A third free-standing list `returns' contains returned chunks that have not yet been processed at all; they must be kept with their `inuse' bits set.) The `clean' list holds split-off fragments and consolidated space. All procedures maintain the invariant that no clean chunk physically borders another clean chunk. Thus, clean chunks never need to be scanned during consolidation. Also, dirty chunks of bad sizes (even if too big) are never used without being first consolidated: The otherwise unused size field of the bin heads are used to record preallocation use. When a chunk is preallocated, an approximation of the number of preallocated chunks is recorded. Other scans try to avoid `stealing' such chunks, but also decrement these counts so that they age down across time. * Algorithms Malloc: This is a very heavily disguised first-fit algorithm. Most of the heuristics are designed to maximize the likelihood that a usable chunk will most often be found very quickly, while still minimizing fragmentation and overhead. The allocation strategy has several phases. 0. Convert the request size into a usable form. This currently means to add 8 bytes overhead plus possibly more to obtain 8-byte alignment. Call this size `nb'. 1. Check if either of the last 2 returned (free()'d) or preallocated chunk are of the exact size nb. If so, use one. `Exact' means no more than MINSIZE (currently 16) bytes larger than nb. This cannot be reduced, since a chunk with size < MINSIZE cannot be created to hold the remainder. This check need not fire very often to be effective. It reduces overhead for sequences of requests for the same preallocated size to a dead minimum. Exactly 2 peeks of the return list is empirically the best tradeoff between wasting time scanning unusaable chunks and the high temporal correlation of chunk sizes in user programs. 2. Look for a chunk in the bin associated with nb. If a chunk was found here but not in return list, and the same thing happened previously, then place the first chunk on the return list in its bin. (This tends to prevent future useless rescans in cases where step 3 is not hit often enough because chunks are found in in bins.) 3. Pull other requests off the returned chunk list, using one if it is of exact size, else distributing into the appropriate (dirty) bins. 4. Look in the last scavenged bigger bin found in a previous step 5, and proceed to possibly split it in step 10. 5. Scan through the clean lists of all larger bins, selecting any chunk at all. (It will surely be big enough since it is in a bigger bin.). The scan goes upward from small bins to large to avoid fragmenting big bins we might need later. 6. Try to use a chunk remaindered during a previous malloc. These chunks are kept separately in `last_remainder' to avoid useless re-binning during repeated splits. Its use also tends to make the scan in step 5 shorter. It must be binned prior to any other consolidation. If the chunk is usable, proceed to split, else bin it. 7. (No longer a step 7!) 8. Consolidate chunks in other dirty bins until a large enough chunk is created. Break out and split when one is found. Bins are selected for consolidation in a circular fashion spanning across malloc calls. This very crudely approximates LRU scanning -- it is an effective enough approximation for these purposes. After consolidating a bin, its use count decremented. Step 9 is taken if all else fails: 9. Get space from the system using sbrk. Memory is gathered from the system (via sbrk) in a way that allows chunks obtained across different sbrk calls to be consolidated, but does not require contiguous memory. Thus, it should be safe to intersperse mallocs with other sbrk calls. Step 10 can be hit from any of steps 2,4-9: 10. If the selected chunk is too big, then: * If this is the second split request for a size in a row or for a size not recently found in return lists, then use this chunk to preallocate up to min {bin_use(bin)+1, MAX_PREALLOCS} additional chunks of size nb and place them on the returned chunk list. (Placing them here rather than in bins speeds up the most common case where the user program requests an uninterrupted series of identically sized chunks. If this is not true, the chunks will be binned in step 4 soon.) The actual number to prealloc depends on the available space in a selected victim, so typical numbers will be less than the bin_use. * Split off the remainder and place in last_remainder (first binning the old one, if applicable.) 10. Return the chunk. Free: Deallocation (free) consists only of placing the chunk on a list of returned chunks. free(0) has no effect. Because freed chunks may be overwritten with link fields, this malloc will often die when freed memory is overwritten by user programs. This can be very effective (albeit in an annoying way) in helping users track down dangling pointers. Realloc: Reallocation proceeds in the usual way. If a chunk can be extended, it is, else a malloc-copy-free sequence is taken. The old unix realloc convention of allowing the last-free'd chunk to be used as an argument to realloc is half-heartedly supported. It may in fact be used, but may have some old contents overwritten. Memalign, valloc: memalign arequests more than enough space from malloc, finds a spot within that chunk that meets the alignment request, and then possibly frees the leading and trailing space. Overreliance on memalign is a sure way to fragment space. * Other implementation notes This malloc is NOT designed to work in multiprocessing applications. No semaphores or other concurrency control are provided to ensure that multiple malloc or free calls don't run at the same time, which could be disasterous. A single semaphore could be used across malloc, realloc, and free. It would be hard to obtain finer granularity. The implementation is in straight, hand-tuned ANSI C. Among other consequences, it uses a lot of macros. These would be nicer as inlinable procedures, but using macros allows use with non-inlining compilers, and also makes it a bit easier to control when they should be expanded out by selectively embedding them in other macros and procedures. (According to profile information, it is almost, but not quite always best to expand.) Also, because there are so many different twisty paths through malloc steps, the code is not exactly elegant. */ /* TUNABLE PARAMETERS */ /* SBRK_UNIT is a good power of two to call sbrk with. It should normally be system page size or a multiple thereof. If sbrk is very slow on a system, it pays to increase this. Otherwise, it should not matter too much. Also, if a program needs a certain minimum amount of memory, this amount can be malloc'ed then immediately free'd before starting to avoid calling sbrk so often. */ #define SBRK_UNIT 8192 /* MAX_PREALLOCS is the maximum number of chunks to preallocate. Overrides bin use stats to avoid ridiculous preallocations. */ #define MAX_PREALLOCS 64 /* preliminaries */ #ifndef __STD_C #ifdef __STDC__ #define __STD_C 1 #else #if __cplusplus #define __STD_C 1 #else #define __STD_C 0 #endif /*__cplusplus*/ #endif /*__STDC__*/ #endif /*__STD_C*/ #ifndef _BEGIN_EXTERNS_ #if __cplusplus #define _BEGIN_EXTERNS_ extern "C" { #define _END_EXTERNS_ } #else #define _BEGIN_EXTERNS_ #define _END_EXTERNS_ #endif #endif /*_BEGIN_EXTERNS_*/ #ifndef _ARG_ #if __STD_C #define _ARG_(x) x #else #define _ARG_(x) () #endif #endif /*_ARG_*/ #ifndef Void_t #if __STD_C #define Void_t void #else #define Void_t char #endif #endif /*Void_t*/ #ifndef NIL #define NIL(type) ((type)0) #endif /*NIL*/ #if __STD_C #include /* for size_t */ #else #include #endif #include /* needed for malloc_stats */ #ifdef __cplusplus extern "C" { #endif #if __STD_C extern Void_t* sbrk(size_t); #else extern Void_t* sbrk(); #endif /* mechanics for getpagesize; adapted from bsd/gnu getpagesize.h */ #if defined(BSD) || defined(DGUX) || defined(sun) || defined(HAVE_GETPAGESIZE) extern size_t getpagesize(); # define malloc_getpagesize getpagesize() #else # include # ifdef EXEC_PAGESIZE # define malloc_getpagesize EXEC_PAGESIZE # else # ifdef NBPG # ifndef CLSIZE # define malloc_getpagesize NBPG # else # define malloc_getpagesize (NBPG * CLSIZE) # endif # else # ifdef NBPC # define malloc_getpagesize NBPC # else # define malloc_getpagesize SBRK_UNIT /* just guess */ # endif # endif # endif #endif #ifdef __cplusplus }; /* end of extern "C" */ #endif /* CHUNKS */ struct malloc_chunk { size_t size; /* Size in bytes, including overhead. */ /* Or'ed with INUSE if in use. */ struct malloc_chunk* fd; /* double links -- used only if free. */ struct malloc_chunk* bk; }; typedef struct malloc_chunk* mchunkptr; /* sizes, alignments */ #define SIZE_SZ (sizeof(size_t)) #define MALLOC_MIN_OVERHEAD (SIZE_SZ + SIZE_SZ) #define MALLOC_ALIGN_MASK (MALLOC_MIN_OVERHEAD - 1) #define MINSIZE (sizeof(struct malloc_chunk) + SIZE_SZ) /* pad request bytes into a usable size */ #define request2size(req) \ (((long)(req) <= 0) ? MINSIZE : \ (((req) + MALLOC_MIN_OVERHEAD + MALLOC_ALIGN_MASK) \ & ~(MALLOC_ALIGN_MASK))) #define fastrequest2size(req) \ ((req) + MALLOC_MIN_OVERHEAD + MALLOC_ALIGN_MASK) \ & ~(MALLOC_ALIGN_MASK) /* Check if m has acceptable alignment */ #define aligned_OK(m) (((size_t)((m)) & (MALLOC_ALIGN_MASK)) == 0) /* Check if a chunk is immediately usable */ #define exact_fit(ptr, req) ((unsigned long)((ptr)->size - (req)) < MINSIZE) /* maintaining INUSE via size field */ #define INUSE 0x1 /* size field is or'd with INUSE when in use */ /* INUSE must be exactly 1, so can coexist with size */ #define inuse(p) ((p)->size & INUSE) #define set_inuse(p) ((p)->size |= INUSE) #define clear_inuse(p) ((p)->size &= ~INUSE) /* Physical chunk operations */ /* Ptr to next physical malloc_chunk. */ #define next_chunk(p)\ ((mchunkptr)( ((char*)(p)) + ((p)->size & ~INUSE) )) /* Ptr to previous physical malloc_chunk */ #define prev_chunk(p)\ ((mchunkptr)( ((char*)(p)) - ( *((size_t*)((char*)(p) - SIZE_SZ)) & ~INUSE))) /* place size at front and back of chunk */ #define set_size(P, Sz) \ { \ size_t Sss = (Sz); \ (P)->size = *((size_t*)((char*)(P) + Sss - SIZE_SZ)) = Sss; \ } \ /* set size & inuse at same time */ #define set_inuse_size(P, Sz) \ { \ size_t Sss = (Sz); \ *((size_t*)((char*)(P) + Sss - SIZE_SZ)) = Sss; \ (P)->size = Sss | INUSE; \ } \ /* conversion from malloc headers to user pointers, and back */ #define chunk2mem(p) ((Void_t*)((char*)(p) + SIZE_SZ)) #define mem2chunk(mem) ((mchunkptr)((char*)(mem) - SIZE_SZ)) /* BINS */ struct malloc_bin { struct malloc_chunk dhd; /* dirty list header */ struct malloc_chunk chd; /* clean list header */ }; typedef struct malloc_bin* mbinptr; /* field-extraction macros */ #define clean_head(b) (&((b)->chd)) #define first_clean(b) ((b)->chd.fd) #define last_clean(b) ((b)->chd.bk) #define dirty_head(b) (&((b)->dhd)) #define first_dirty(b) ((b)->dhd.fd) #define last_dirty(b) ((b)->dhd.bk) /* size field of dirty head tracks whether bin is used */ #define bin_use(b) ((b)->dhd.size) #define add_bin_use(b, nu) ((b)->dhd.size += (nu)) #define inc_bin_use(b) ((b)->dhd.size++) #define halve_bin_use(b) ((b)->dhd.size=(unsigned long)((b)->dhd.size) >> 1) #define clr_bin_use(b) ((b)->dhd.size = 0) #define set_bin_use(b) ((b)->dhd.size = 1) #define prealloc_size(b) ((b)->chd.size) #define set_prealloc_size(b, sz) ((b)->chd.size = (sz)) /* The bins, initialized to have null double linked lists */ #define NBINS 128 /* first 2 and last 1 bin unused but simplify indexing */ #define FIRSTBIN (&(av[2])) #define LASTBIN (&(av[NBINS-2])) #define PRE_FIRSTBIN (&(av[1])) #define POST_LASTBIN (&(av[NBINS-1])) /* sizes < MAX_SMALLBIN_SIZE are special-cased since bins are 8 bytes apart */ #define MAX_SMALLBIN_SIZE 512 #define SMALLBIN_SIZE 8 /* Helper macro to initialize bins */ #define IAV(i)\ {{ 0, &(av[i].dhd), &(av[i].dhd) }, { 0, &(av[i].chd), &(av[i].chd) }} static struct malloc_bin av[NBINS] = { IAV(0), IAV(1), IAV(2), IAV(3), IAV(4), IAV(5), IAV(6), IAV(7), IAV(8), IAV(9), IAV(10), IAV(11), IAV(12), IAV(13), IAV(14), IAV(15), IAV(16), IAV(17), IAV(18), IAV(19), IAV(20), IAV(21), IAV(22), IAV(23), IAV(24), IAV(25), IAV(26), IAV(27), IAV(28), IAV(29), IAV(30), IAV(31), IAV(32), IAV(33), IAV(34), IAV(35), IAV(36), IAV(37), IAV(38), IAV(39), IAV(40), IAV(41), IAV(42), IAV(43), IAV(44), IAV(45), IAV(46), IAV(47), IAV(48), IAV(49), IAV(50), IAV(51), IAV(52), IAV(53), IAV(54), IAV(55), IAV(56), IAV(57), IAV(58), IAV(59), IAV(60), IAV(61), IAV(62), IAV(63), IAV(64), IAV(65), IAV(66), IAV(67), IAV(68), IAV(69), IAV(70), IAV(71), IAV(72), IAV(73), IAV(74), IAV(75), IAV(76), IAV(77), IAV(78), IAV(79), IAV(80), IAV(81), IAV(82), IAV(83), IAV(84), IAV(85), IAV(86), IAV(87), IAV(88), IAV(89), IAV(90), IAV(91), IAV(92), IAV(93), IAV(94), IAV(95), IAV(96), IAV(97), IAV(98), IAV(99), IAV(100), IAV(101), IAV(102), IAV(103), IAV(104), IAV(105), IAV(106), IAV(107), IAV(108), IAV(109), IAV(110), IAV(111), IAV(112), IAV(113), IAV(114), IAV(115), IAV(116), IAV(117), IAV(118), IAV(119), IAV(120), IAV(121), IAV(122), IAV(123), IAV(124), IAV(125), IAV(126), IAV(127) }; /* Auxiliary globals Returns hold list of (unbinned) returned chunks Even though it uses bk/fd ptrs, returns is NOT doubly linked! It is singly-linked and null-terminated it is only they are accessed sequentially. */ static mchunkptr returns = 0; /* last_remainder holds for the remainder of the most recently split chunk */ static mchunkptr last_remainder = 0; /* minClean and maxClean keep track of the minimum/maximum actually used clean bin, to make loops faster */ static mbinptr maxClean = PRE_FIRSTBIN; static mbinptr minClean = POST_LASTBIN; /* Indexing into bins Bins are log-spaced: 64 bins of size 8 32 bins of size 64 16 bins of size 512 8 bins of size 4096 4 bins of size 32768 2 bins of size 262144 1 bin of size what's left There is actually a little bit of slop in the numbers in findbin() for the sake of speed. This makes no difference elsewhere. */ #define findbin(Sizefb, Bfb) \ { \ unsigned long Ofb = (Sizefb) >> 3; \ unsigned long Nfb = Ofb >> 6; \ if (Nfb != 0) { \ if (Nfb < 5) Ofb = (Ofb >> 3) + 56; \ else if (Nfb < 21) Ofb = (Ofb >> 6) + 91; \ else if (Nfb < 85) Ofb = (Ofb >> 9) + 110; \ else if (Nfb < 341) Ofb = (Ofb >> 12) + 119; \ else if (Nfb < 1365) Ofb = (Ofb >> 15) + 124; \ else Ofb = 126; \ } \ (Bfb) = av + Ofb; \ } \ /* Special case for known small bins */ #define smallfindbin(Sizefb, Bfb) (Bfb) = av + ((unsigned long)(Sizefb) >> 3) /* Macros for linking and unlinking chunks */ /* take a chunk off a list */ #define unlink(Qul) \ { \ mchunkptr Bul = (Qul)->bk; \ mchunkptr Ful = (Qul)->fd; \ Ful->bk = Bul; Bul->fd = Ful; \ } \ /* place a chunk on the dirty list of its bin */ #define dirtylink(Qdl) \ { \ mchunkptr Pdl = (Qdl); \ mbinptr Bndl; \ mchunkptr Hdl, Fdl; \ clear_inuse(Pdl); \ findbin(Pdl->size, Bndl); \ Hdl = dirty_head(Bndl); \ Fdl = Hdl->fd; \ Pdl->bk = Hdl; Pdl->fd = Fdl; Fdl->bk = Hdl->fd = Pdl; \ } \ /* Place a consolidated chunk on a clean list */ #define cleanlink(Qcl) \ { \ mchunkptr Pcl = (Qcl); \ mbinptr Bcl; \ mchunkptr Hcl, Fcl; \ \ findbin(Qcl->size, Bcl); \ Hcl = clean_head(Bcl); \ Fcl = Hcl->fd; \ if (Hcl == Fcl) { \ if (Bcl < minClean) minClean = Bcl; \ if (Bcl > maxClean) maxClean = Bcl; \ } \ Pcl->bk = Hcl; Pcl->fd = Fcl; Fcl->bk = Hcl->fd = Pcl; \ } \ #if __STD_C static void callcleanlink(mchunkptr p) #else static void callcleanlink(p) mchunkptr p; #endif { cleanlink(p); } /* consolidate one chunk */ #define consolidate(Qc) \ { \ for (;;) \ { \ mchunkptr Pc = prev_chunk(Qc); \ if (!inuse(Pc)) \ { \ unlink(Pc); \ set_size(Pc, Pc->size + (Qc)->size); \ (Qc) = Pc; \ } \ else break; \ } \ for (;;) \ { \ mchunkptr Nc = next_chunk(Qc); \ if (!inuse(Nc)) \ { \ unlink(Nc); \ set_size((Qc), (Qc)->size + Nc->size); \ } \ else break; \ } \ } \ /* Place a freed chunk on the returns */ #define returnlink(Prc) \ { \ (Prc)->fd = returns; \ returns = (Prc); \ } \ /* Misc utilities */ /* A helper for realloc */ static void clear_aux_lists() { if (last_remainder != 0) { cleanlink(last_remainder); last_remainder = 0; } while (returns != 0) { mchunkptr p = returns; returns = p->fd; dirtylink(p); } } /* Dealing with sbrk */ /* This is one step of malloc; broken out for simplicity */ static size_t sbrked_mem = 0; /* Keep track of total mem for malloc_stats */ #if __STD_C static mchunkptr malloc_from_sys(size_t nb) #else static mchunkptr malloc_from_sys(nb) size_t nb; #endif { /* The end of memory returned from previous sbrk call */ static size_t* last_sbrk_end = 0; mchunkptr p; /* Will hold a usable chunk */ size_t* ip; /* to traverse sbrk ptr in size_t units */ char* cp; /* result of sbrk call */ /* Find a good size to ask sbrk for. */ /* Minimally, we need to pad with enough space */ /* to place dummy size/use fields to ends if needed */ size_t sbrk_size = ((nb + SBRK_UNIT - 1 + SIZE_SZ + SIZE_SZ) / SBRK_UNIT) * SBRK_UNIT; cp = (char*)(sbrk(sbrk_size)); if (cp == (char*)(-1)) /* sbrk returns -1 on failure */ return 0; ip = (size_t*)cp; sbrked_mem += sbrk_size; if (last_sbrk_end != &ip[-1]) /* Is this chunk continguous with last? */ { /* It's either first time through or someone else called sbrk. */ /* Arrange end-markers at front & back */ /* Shouldn't be necessary, but better to be safe */ while (!aligned_OK(ip)) { ++ip; sbrk_size -= SIZE_SZ; } /* Mark the front as in use to prevent merging. (End done below.) */ /* Note we can get away with only 1 word, not MINSIZE overhead here */ *ip++ = SIZE_SZ | INUSE; p = (mchunkptr)ip; set_size(p,sbrk_size - (SIZE_SZ + SIZE_SZ)); } else { mchunkptr l; /* We can safely make the header start at end of prev sbrked chunk. */ /* We will still have space left at the end from a previous call */ /* to place the end marker, below */ p = (mchunkptr)(last_sbrk_end); set_size(p, sbrk_size); /* Even better, maybe we can merge with last fragment: */ l = prev_chunk(p); if (!inuse(l)) { unlink(l); set_size(l, p->size + l->size); p = l; } } /* mark the end of sbrked space as in use to prevent merging */ last_sbrk_end = (size_t*)((char*)p + p->size); *last_sbrk_end = SIZE_SZ | INUSE; return p; } /* The less-frequent steps of malloc broken out as a procedure. */ /* (Allows compilers to better optimize main steps.) */ #if __STD_C static mchunkptr malloc_consolidate(size_t nb) #else static mchunkptr malloc_consolidate(nb) size_t nb; #endif { static mbinptr rover = LASTBIN; /* Circular ptr for consolidation */ mbinptr origin, b; /* Consolidate last remainder first. */ /* It must be binned before any other consolidations, so might as well */ /* consolidate it too. This also helps make up for false-alarm */ /* preallocations */ mchunkptr victim = last_remainder; last_remainder = 0; if (victim != 0) { consolidate(victim); if (victim->size >= nb) return victim; else cleanlink(victim); } /* -------------- Sweep through and consolidate other dirty bins */ origin = rover; /* Start where left off last time. */ b = rover; do { halve_bin_use(b); /* decr use counts while traversing */ while ( (victim = last_dirty(b)) != dirty_head(b)) { unlink(victim); consolidate(victim); if (victim->size >= nb) { rover = b; return victim; } else cleanlink(victim); } b = (b <= FIRSTBIN)? LASTBIN : b - 1; /* circularly sweep */ } while (b != origin); /* ------------- Nothing available; get some from sys */ return malloc_from_sys(nb); } #if __STD_C Void_t* malloc(size_t bytes) #else Void_t* malloc(bytes) size_t bytes; #endif { static mchunkptr bad_rl_chunk = 0; /* last scanned return-list chunk */ static mbinptr prevClean = FIRSTBIN; /* likely clean bin to use */ mchunkptr victim; /* will hold selected chunk */ mbinptr bin; /* corresponding bin */ /* ----------- Peek (twice) at returns; hope for luck */ mchunkptr rl = returns; /* local for speed/simplicity */ size_t nb = request2size(bytes) ; /* padded request size; */ if (rl != 0) { mchunkptr snd = rl->fd; if (exact_fit(rl, nb)) /* size check works even though INUSE set */ { returns = snd; return chunk2mem(rl); } else if (snd != 0 && exact_fit(snd, nb)) { returns->fd = snd->fd; return chunk2mem(snd); } else if (rl == bad_rl_chunk) /* If we keep failing, bin one */ { dirtylink(rl); returns = rl = snd; } bad_rl_chunk = rl; } /* ---------- Scan own dirty bin */ if (nb < (MAX_SMALLBIN_SIZE - SMALLBIN_SIZE)) { /* Small bins special-cased since no size check or traversal needed. */ /* Also because of MINSIZE slop, next dirty bin is exact fit too */ smallfindbin(nb, bin); if ( ((victim = last_dirty(bin)) != dirty_head(bin)) || ((victim = last_clean(bin)) != clean_head(bin)) || ((victim = last_dirty(bin+1)) != dirty_head(bin+1))) { unlink(victim); set_inuse(victim); return chunk2mem(victim); } } else { findbin(nb, bin); for (victim=last_dirty(bin); victim != dirty_head(bin); victim=victim->bk) { if (exact_fit(victim, nb)) /* Can use exact matches only here */ { unlink(victim); set_inuse(victim); return chunk2mem(victim); } } for (victim=last_clean(bin); victim != clean_head(bin); victim=victim->bk) { if (victim->size >= nb) { unlink(victim); goto split; } } } /* ------------ Search return list, placing unusable chunks in their bins */ if (rl != 0) { victim = rl; rl = rl->fd; for (;;) { dirtylink(victim); if (rl == 0) { returns = rl; break; } victim = rl; rl = rl->fd; if (exact_fit(victim, nb)) { bad_rl_chunk = returns = rl; return chunk2mem(victim); } } } if (bin < maxClean) { mbinptr b; /* -------------- First try last successful clean bin */ if (bin < prevClean) { if ( (victim = last_clean(prevClean)) != clean_head(prevClean) ) { unlink(victim); goto split; } } /* -------------- Scan others */ for (b = (bin < minClean)? minClean : (bin + 1); b <= maxClean; ++b) { if ( (victim = last_clean(b)) != clean_head(b) ) { /* If more, record */ if (bin_use(b) == 0 && victim->bk != clean_head(b)) prevClean = b; else { halve_bin_use(b); prevClean = FIRSTBIN; } unlink(victim); if (bin < minClean) minClean = b; /* b must be <= true min */ goto split; } } /* -------------- If fall through, recompute bounds for next time */ while (maxClean >= FIRSTBIN && clean_head(maxClean)==last_clean(maxClean)) --maxClean; if (maxClean < FIRSTBIN) /* reset at endpoints if no clean bins */ minClean = POST_LASTBIN; else { while (minClean < maxClean && clean_head(minClean)==last_clean(minClean)) ++minClean; } prevClean = FIRSTBIN; } /* -------------- Try remainder from previous split */ if ( (victim = last_remainder) != 0) { if (victim->size >= nb) { last_remainder = 0; goto split; } } /* -------------- Other steps called via malloc_consolidate */ victim = malloc_consolidate(nb); if (victim == 0) return 0; /* propagate failure */ /* -------------- Possibly split victim chunk */ split: { size_t room = victim->size - nb; if (room < MINSIZE) { set_inuse(victim); return chunk2mem(victim); } else /* must create remainder */ { mchunkptr remainder; int desired; set_inuse_size(victim, nb); remainder = (mchunkptr)((char*)(victim) + nb); desired = inc_bin_use(bin); /* ---------- Preallocate more of this size */ if (nb < MAX_SMALLBIN_SIZE && room >= nb + MINSIZE && desired != 0) { int actual = 1; /* place in ascending order on ret list */ mchunkptr first = remainder; mchunkptr last = remainder; set_inuse_size(remainder, nb); remainder = (mchunkptr)((char*)(remainder) + nb); if (desired > MAX_PREALLOCS) desired = MAX_PREALLOCS; while ( (room -= nb) >= nb + MINSIZE && actual < desired) { ++actual; set_inuse_size(remainder, nb); last->fd = remainder; last = remainder; remainder = (mchunkptr)((char*)(remainder) + nb); } last->fd = returns; returns = first; add_bin_use(bin, actual); } /* ---------- Put away remainder chunk */ set_size(remainder, room); /* get rid of old one */ if (last_remainder != 0) callcleanlink(last_remainder); last_remainder = remainder; return chunk2mem(victim); } } } #if __STD_C void free(Void_t* mem) #else void free(mem) Void_t* mem; #endif { if (mem != 0) { mchunkptr p = mem2chunk(mem); returnlink(p); } } /* Special-purpose copy for realloc */ /* Copy bytes in size_t units, adjusting for chunk header */ #define SCopy(SCs,SCd,SCc) \ { \ size_t * SCsrc = (size_t*) SCs; \ size_t * SCdst = (size_t*) SCd; \ size_t SCcount = (SCc - SIZE_SZ) / sizeof(size_t); \ do { *SCdst++ = *SCsrc++; } while (--SCcount > 0); \ } #if __STD_C Void_t* realloc(Void_t* mem, size_t bytes) #else Void_t* realloc(mem, bytes) Void_t* mem; size_t bytes; #endif { if (mem == 0) return malloc(bytes); else { size_t nb = request2size(bytes); mchunkptr p = mem2chunk(mem); size_t oldsize; Void_t* newmem; size_t room; int back_expanded = 0; if (p == returns) /* sorta support realloc-last-freed-chunk idiocy */ returns = returns->fd; clear_inuse(p); oldsize = p->size; /* try to expand. */ clear_aux_lists(); /* make freed chunks available to consolidate */ if (p->size < nb) /* forward as far as possible */ { for (;;) { mchunkptr nxt = next_chunk(p); if (!inuse(nxt)) { unlink(nxt); set_size(p, p->size + nxt->size); } else break; } } while (p->size < nb) /* backward only if and as far as necessary */ { mchunkptr prv = prev_chunk(p); if (!inuse(prv)) { back_expanded = 1; unlink(prv); set_size(prv, prv->size + p->size); p = prv; } else break; } if (p->size < nb) /* Could not expand. Get another chunk. */ { mchunkptr newp; set_inuse(p); /* don't let malloc consolidate p yet! */ newmem = malloc(nb); newp = mem2chunk(newmem); /* Avoid copy if newp is next chunk after oldp. */ /* This can only happen when new chunk is sbrk'ed, */ /* which is common enough in reallocs to deal with here. */ if (newp == next_chunk(p)) { if (back_expanded) /* Must copy first anyway; still worth it */ SCopy(mem, chunk2mem(p), oldsize); clear_inuse(p); clear_inuse(newp); set_size(p, p->size + newp->size); room = p->size - nb; if (room >= MINSIZE) /* give some back */ { mchunkptr remainder = (mchunkptr)((char*)(p) + nb); set_size(remainder, room); set_size(p, nb); /* clean up remainder; it must be start of new sbrked space */ clear_aux_lists(); /* Clear, in case malloc preallocated */ for (;;) { mchunkptr nxt = next_chunk(remainder); if (!inuse(nxt)) { unlink(nxt); set_size(remainder, remainder->size + nxt->size); } else break; } last_remainder = remainder; } set_inuse(p); return chunk2mem(p); } else { if (newmem != 0) SCopy(mem, newmem, oldsize); returnlink(p); return newmem; } } else { room = p->size - nb; newmem = chunk2mem(p); if (back_expanded) SCopy(mem, newmem, oldsize); if (room >= MINSIZE) /* give some back if possible */ { mchunkptr remainder = (mchunkptr)((char*)(p) + nb); set_size(remainder, room); dirtylink(remainder); /* not sure; be safe */ set_size(p, nb); } set_inuse(p); return chunk2mem(p); } } } /* Return a pointer to space with at least the alignment requested */ /* Alignment argument should be a power of two */ #if __STD_C Void_t* memalign(size_t alignment, size_t bytes) #else Void_t* memalign(alignment, bytes) size_t alignment; size_t bytes; #endif { mchunkptr p; size_t nb = request2size(bytes); size_t room; /* find an alignment that both we and the user can live with: */ size_t align = (alignment > MALLOC_MIN_OVERHEAD) ? alignment : MALLOC_MIN_OVERHEAD; /* call malloc with worst case padding to hit alignment; */ /* we will give back extra */ size_t req = nb + align + MINSIZE; Void_t* m = malloc(req); if (m == 0) return 0; /* propagate failure */ p = mem2chunk(m); clear_inuse(p); if (((size_t)(m) % align) != 0) /* misaligned */ { /* find an aligned spot inside chunk */ mchunkptr ap = (mchunkptr)((((size_t)(m) + align-1) & -align) - SIZE_SZ); size_t gap = (size_t)(ap) - (size_t)(p); /* we need to give back leading space in a chunk of at least MINSIZE */ if (gap < MINSIZE) { /* This works since align >= MINSIZE */ /* and we've malloc'd enough total room */ ap = (mchunkptr)( (size_t)(ap) + align ); gap += align; } room = p->size - gap; /* give back leader */ set_size(p, gap); dirtylink(p); /* use the rest */ p = ap; set_size(p, room); } /* also give back spare room at the end */ room = p->size - nb; if (room >= MINSIZE) { mchunkptr remainder = (mchunkptr)((char*)(p) + nb); set_size(remainder, room); dirtylink(remainder); set_size(p, nb); } set_inuse(p); return chunk2mem(p); } /* Derivatives */ #if __STD_C Void_t* valloc(size_t bytes) #else Void_t* valloc(bytes) size_t bytes; #endif { /* Cache result of getpagesize */ static size_t malloc_pagesize = 0; if (malloc_pagesize == 0) malloc_pagesize = malloc_getpagesize; return memalign (malloc_pagesize, bytes); } #if __STD_C Void_t* calloc(size_t n, size_t elem_size) #else Void_t* calloc(n, elem_size) size_t n; size_t elem_size; #endif { size_t sz = n * elem_size; Void_t* p = malloc(sz); char* q = (char*) p; while (sz-- > 0) *q++ = 0; return p; } #if __STD_C void cfree(Void_t *mem) #else void cfree(mem) Void_t *mem; #endif { free(mem); } #if __STD_C size_t malloc_usable_size(Void_t* mem) #else size_t malloc_usable_size(mem) Void_t* mem; #endif { if (mem == 0) return 0; else { mchunkptr p = mem2chunk(mem); size_t sz = p->size & ~(INUSE); /* report zero if not in use or detectably corrupt */ if (p->size == sz || sz != *((size_t*)((char*)(p) + sz - SIZE_SZ))) return 0; else return sz - MALLOC_MIN_OVERHEAD; } } void malloc_stats() { /* Traverse through and count all sizes of all chunks */ size_t avail = 0; size_t malloced_mem; mbinptr b; clear_aux_lists(); for (b = FIRSTBIN; b <= LASTBIN; ++b) { mchunkptr p; for (p = first_dirty(b); p != dirty_head(b); p = p->fd) avail += p->size; for (p = first_clean(b); p != clean_head(b); p = p->fd) avail += p->size; } malloced_mem = sbrked_mem - avail; fprintf(stderr, "total mem = %10u\n", (unsigned int)sbrked_mem); fprintf(stderr, "in use = %10u\n", (unsigned int)malloced_mem); }