Lines Matching defs:free
3 /*--- An implementation of malloc/free which doesn't use sbrk. ---*/
14 This program is free software; you can redistribute it and/or
16 published by the Free Software Foundation; either version 2 of the
25 along with this program; if not, write to the Free Software
54 /* Number and total size of blocks in free queue. Used by mallinfo(). */
84 Layout of a block on the free list:
120 (The bottom 3 or so bits are always free for this because of alignment.)
164 // The free space at the end of an unsplittable superblock is not used to
165 // make a free block. Note that this means that an unsplittable superblock can
228 Addr perm_malloc_current; // first byte free in perm_malloc sb.
297 // Get a block's size as stored, ie with the in-use/free attribute.
311 // Get a block's plain size, ie. remove the in-use/free attribute.
318 // Set the size fields of a block. bszB may have the in-use/free attribute.
1295 VG_(printf)( "%s, ", is_inuse_block(b) ? "inuse" : "free");
1421 "%-8s: %2u sbs, %5u bs, %2u/%-2u free bs, "
1594 aai->free = !is_inuse_block(b);
1602 aai->free = False;
1610 // relevant free list.
1765 // list, and each time not find any free blocks until the last element.
1854 set_cc(b, "admin.free-new-sb-1");
1872 // Yes, split block in two, put the fragment on the appropriate free
1914 // of a free block is not big enough to make a free block by itself).
1971 // with a sequence: free (causing a deferred reclaim of sb)
1973 // free of the just alloc-ed block (causing a re-defer).
2009 /* b must be a free block, of size b_bszB.
2010 If b is followed by another free block, merge them.
2011 If b is preceded by another free block, merge them.
2012 If the merge results in the superblock being fully free,
2047 set_cc(b, "admin.free-2");
2072 set_cc(b, "admin.free-3");
2129 set_cc(b, "admin.free-1");
2139 // for free list management. E.g. if block ptr has been put in a free
2153 // used for free blocks.
2181 then split it into two parts: frag, which is returned to the free
2270 inside VG_(arena_malloc). We need to indicate it is free, then
2294 /* Create the fragment block, and put it back on the relevant free list. */
2352 // int fsmblks; /* space in free small blocks */
2354 // int fordblks; /* space in free ordinary blocks */
2373 // Traverse free list and calculate free blocks statistics.
2411 /*--- Services layered on top of malloc/free. ---*/
2568 /* Possibly merge &b[req_bszB] with its free neighbours. */
2643 void VG_(free) ( void* ptr )
