cosmopolitan/third_party/dlmalloc/bulk_free.c

57 lines
1.9 KiB
C
Raw Normal View History

2020-06-15 14:18:57 +00:00
#include "libc/mem/mem.h"
#include "third_party/dlmalloc/dlmalloc.h"
/**
* Frees and clears (sets to NULL) each non-null pointer in the given
* array. This is likely to be faster than freeing them one-by-one. If
* footers are used, pointers that have been allocated in different
* mspaces are not freed or cleared, and the count of all such pointers
* is returned. For large arrays of pointers with poor locality, it may
* be worthwhile to sort this array before calling bulk_free.
*/
size_t bulk_free(void *array[], size_t nelem) {
/*
* Try to free all pointers in the given array. Note: this could be
* made faster, by delaying consolidation, at the price of disabling
* some user integrity checks, We still optimize some consolidations
* by combining adjacent chunks before freeing, which will occur often
* if allocated with ialloc or the array is sorted.
*/
size_t unfreed = 0;
if (!PREACTION(gm)) {
void **a;
void **fence = &(array[nelem]);
for (a = array; a != fence; ++a) {
void *mem = *a;
if (mem != 0) {
mchunkptr p = mem2chunk(ADDRESS_DEATH_ACTION(mem));
size_t psize = chunksize(p);
#if FOOTERS
if (get_mstate_for(p) != gm) {
++unfreed;
continue;
}
#endif
check_inuse_chunk(gm, p);
*a = 0;
if (RTCHECK(ok_address(gm, p) && ok_inuse(p))) {
void **b = a + 1; /* try to merge with next chunk */
mchunkptr next = next_chunk(p);
if (b != fence && *b == chunk2mem(next)) {
size_t newsize = chunksize(next) + psize;
set_inuse(gm, p, newsize);
*b = chunk2mem(p);
} else
dlmalloc_dispose_chunk(gm, p, psize);
} else {
CORRUPTION_ERROR_ACTION(gm);
break;
}
}
}
if (should_trim(gm, gm->topsize)) dlmalloc_sys_trim(gm, 0);
POSTACTION(gm);
}
return unfreed;
}