Lines Matching defs:free
65 * bucket the allocation should be satisfied from. The management of free
66 * buckets is done via a bitmask. A free bucket is represented by a 1. The
67 * first free bit represents the first free bucket. The position of the bit,
72 * This cache control address is used during free() to mark the buffer free
171 #define FREEPATTERN 0xdeadbeef /* debug fill pattern for free buf */
261 free(ptr);
317 free(ptr);
325 free(ptr);
357 free(void * ptr)
434 * the free. Things go left to right that's why the mask is 0x80
493 * we will use alloc_size to return the excess fragments to the free
608 /* free up the head fragment */
655 * We try to free up tail-end when we can
752 * Reinitialize free blocks in case malloc() is called prior
910 if (nblocks == 0) { /* less than 8 free blocks in this pool */
934 /* Set everything to free */
952 /* Reinitialize free oversize blocks. */
959 /* Reinitialize free blocks. */
1028 * Find a cache of the appropriate size with free buffers.
1033 * free happens during our search, it will increment mt_nfree,
1061 if (thiscache == NULL) { /* there are no free caches */
1132 * Now you have the offset in n, you've changed the free mask
1140 /* Store the cache addr for this buf. Makes free go fast. */
1156 abort(); /* reference after free */
1226 abort(); /* reference after free */