free.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272
  1. /*
  2. * libc/stdlib/malloc/free.c -- free function
  3. *
  4. * Copyright (C) 2002,03 NEC Electronics Corporation
  5. * Copyright (C) 2002,03 Miles Bader <miles@gnu.org>
  6. *
  7. * This file is subject to the terms and conditions of the GNU Lesser
  8. * General Public License. See the file COPYING.LIB in the main
  9. * directory of this archive for more details.
  10. *
  11. * Written by Miles Bader <miles@gnu.org>
  12. */
  13. #include <stdlib.h>
  14. #include <unistd.h>
  15. #include <sys/mman.h>
  16. #include "malloc.h"
  17. #include "heap.h"
  18. #ifdef HEAP_USE_LOCKING
  19. #define free_to_heap(mem, heap, lck) __free_to_heap(mem, heap, lck)
  20. #else
  21. #define free_to_heap(mem, heap, lck) __free_to_heap(mem, heap)
  22. #endif
  23. static void
  24. __free_to_heap (void *mem, struct heap_free_area **heap
  25. #ifdef HEAP_USE_LOCKING
  26. , malloc_mutex_t *heap_lock
  27. #endif
  28. )
  29. {
  30. size_t size;
  31. struct heap_free_area *fa;
  32. /* Check for special cases. */
  33. if (unlikely (! mem))
  34. return;
  35. /* Normal free. */
  36. MALLOC_DEBUG (1, "free: 0x%lx (base = 0x%lx, total_size = %d)",
  37. (long)mem, (long)MALLOC_BASE (mem), MALLOC_SIZE (mem));
  38. size = MALLOC_SIZE (mem);
  39. mem = MALLOC_BASE (mem);
  40. __heap_lock (heap_lock);
  41. /* Put MEM back in the heap, and get the free-area it was placed in. */
  42. fa = __heap_free (heap, mem, size);
  43. /* See if the free-area FA has grown big enough that it should be
  44. unmapped. */
  45. if (HEAP_FREE_AREA_SIZE (fa) < MALLOC_UNMAP_THRESHOLD)
  46. /* Nope, nothing left to do, just release the lock. */
  47. __heap_unlock (heap_lock);
  48. else
  49. /* Yup, try to unmap FA. */
  50. {
  51. unsigned long start = (unsigned long)HEAP_FREE_AREA_START (fa);
  52. unsigned long end = (unsigned long)HEAP_FREE_AREA_END (fa);
  53. #ifndef MALLOC_USE_SBRK
  54. # ifdef __UCLIBC_UCLINUX_BROKEN_MUNMAP__
  55. struct malloc_mmb *mmb, *prev_mmb;
  56. unsigned long mmb_start, mmb_end;
  57. # else /* !__UCLIBC_UCLINUX_BROKEN_MUNMAP__ */
  58. unsigned long unmap_start, unmap_end;
  59. # endif /* __UCLIBC_UCLINUX_BROKEN_MUNMAP__ */
  60. #endif /* !MALLOC_USE_SBRK */
  61. #ifdef MALLOC_USE_SBRK
  62. /* Get the sbrk lock so that the two possible calls to sbrk below
  63. are guaranteed to be contiguous. */
  64. __malloc_lock_sbrk ();
  65. /* When using sbrk, we only shrink the heap from the end. It would
  66. be possible to allow _both_ -- shrinking via sbrk when possible,
  67. and otherwise shrinking via munmap, but this results in holes in
  68. memory that prevent the brk from every growing back down; since
  69. we only ever grow the heap via sbrk, this tends to produce a
  70. continuously growing brk (though the actual memory is unmapped),
  71. which could eventually run out of address space. Note that
  72. `sbrk(0)' shouldn't normally do a system call, so this test is
  73. reasonably cheap. */
  74. if ((void *)end != sbrk (0))
  75. {
  76. MALLOC_DEBUG (-1, "not unmapping: 0x%lx - 0x%lx (%ld bytes)",
  77. start, end, end - start);
  78. __malloc_unlock_sbrk ();
  79. __heap_unlock (heap_lock);
  80. return;
  81. }
  82. #endif
  83. MALLOC_DEBUG (0, "unmapping: 0x%lx - 0x%lx (%ld bytes)",
  84. start, end, end - start);
  85. /* Remove FA from the heap. */
  86. __heap_delete (heap, fa);
  87. if (__heap_is_empty (heap))
  88. /* We want to avoid the heap from losing all memory, so reserve
  89. a bit. This test is only a heuristic -- the existance of
  90. another free area, even if it's smaller than
  91. MALLOC_MIN_SIZE, will cause us not to reserve anything. */
  92. {
  93. /* Put the reserved memory back in the heap; we assume that
  94. MALLOC_UNMAP_THRESHOLD is greater than MALLOC_MIN_SIZE, so
  95. we use the latter unconditionally here. */
  96. __heap_free (heap, (void *)start, MALLOC_MIN_SIZE);
  97. start += MALLOC_MIN_SIZE;
  98. }
  99. #ifdef MALLOC_USE_SBRK
  100. /* Release the heap lock; we're still holding the sbrk lock. */
  101. __heap_unlock (heap_lock);
  102. /* Lower the brk. */
  103. sbrk (start - end);
  104. /* Release the sbrk lock too; now we hold no locks. */
  105. __malloc_unlock_sbrk ();
  106. #else /* !MALLOC_USE_SBRK */
  107. # ifdef __UCLIBC_UCLINUX_BROKEN_MUNMAP__
  108. /* Using the uClinux broken munmap, we have to only munmap blocks
  109. exactly as we got them from mmap, so scan through our list of
  110. mmapped blocks, and return them in order. */
  111. MALLOC_MMB_DEBUG (1, "walking mmb list for region 0x%x[%d]...",
  112. start, end - start);
  113. prev_mmb = 0;
  114. mmb = __malloc_mmapped_blocks;
  115. while (mmb
  116. && ((mmb_end = (mmb_start = (unsigned long)mmb->mem) + mmb->size)
  117. <= end))
  118. {
  119. MALLOC_MMB_DEBUG (1, "considering mmb at 0x%x: 0x%x[%d]",
  120. (unsigned)mmb, mmb_start, mmb_end - mmb_start);
  121. if (mmb_start >= start
  122. /* If the space between START and MMB_START is non-zero, but
  123. too small to return to the heap, we can't unmap MMB. */
  124. && (start == mmb_start
  125. || mmb_start - start > HEAP_MIN_FREE_AREA_SIZE))
  126. {
  127. struct malloc_mmb *next_mmb = mmb->next;
  128. if (mmb_end != end && mmb_end + HEAP_MIN_FREE_AREA_SIZE > end)
  129. /* There's too little space left at the end to deallocate
  130. this block, so give up. */
  131. break;
  132. MALLOC_MMB_DEBUG (1, "unmapping mmb at 0x%x: 0x%x[%d]",
  133. (unsigned)mmb, mmb_start, mmb_end - mmb_start);
  134. if (mmb_start != start)
  135. /* We're going to unmap a part of the heap that begins after
  136. start, so put the intervening region back into the heap. */
  137. {
  138. MALLOC_MMB_DEBUG (0, "putting intervening region back into heap: 0x%x[%d]",
  139. start, mmb_start - start);
  140. __heap_free (heap, (void *)start, mmb_start - start);
  141. }
  142. MALLOC_MMB_DEBUG_INDENT (-1);
  143. /* Unlink MMB from the list. */
  144. if (prev_mmb)
  145. prev_mmb->next = next_mmb;
  146. else
  147. __malloc_mmapped_blocks = next_mmb;
  148. /* Start searching again from the end of this block. */
  149. start = mmb_end;
  150. /* Release the descriptor block we used. */
  151. free_to_heap (mmb, &__malloc_mmb_heap, &__malloc_mmb_heap_lock);
  152. /* We have to unlock the heap before we recurse to free the mmb
  153. descriptor, because we might be unmapping from the mmb
  154. heap. */
  155. __heap_unlock (heap_lock);
  156. /* Do the actual munmap. */
  157. munmap ((void *)mmb_start, mmb_end - mmb_start);
  158. __heap_lock (heap_lock);
  159. # ifdef __UCLIBC_HAS_THREADS__
  160. /* In a multi-threaded program, it's possible that PREV_MMB has
  161. been invalidated by another thread when we released the
  162. heap lock to do the munmap system call, so just start over
  163. from the beginning of the list. It sucks, but oh well;
  164. it's probably not worth the bother to do better. */
  165. prev_mmb = 0;
  166. mmb = __malloc_mmapped_blocks;
  167. # else
  168. mmb = next_mmb;
  169. # endif
  170. }
  171. else
  172. {
  173. prev_mmb = mmb;
  174. mmb = mmb->next;
  175. }
  176. MALLOC_MMB_DEBUG_INDENT (-1);
  177. }
  178. if (start != end)
  179. /* Hmm, well there's something we couldn't unmap, so put it back
  180. into the heap. */
  181. {
  182. MALLOC_MMB_DEBUG (0, "putting tail region back into heap: 0x%x[%d]",
  183. start, end - start);
  184. __heap_free (heap, (void *)start, end - start);
  185. }
  186. /* Finally release the lock for good. */
  187. __heap_unlock (heap_lock);
  188. MALLOC_MMB_DEBUG_INDENT (-1);
  189. # else /* !__UCLIBC_UCLINUX_BROKEN_MUNMAP__ */
  190. /* MEM/LEN may not be page-aligned, so we have to page-align them,
  191. and return any left-over bits on the end to the heap. */
  192. unmap_start = MALLOC_ROUND_UP_TO_PAGE_SIZE (start);
  193. unmap_end = MALLOC_ROUND_DOWN_TO_PAGE_SIZE (end);
  194. /* We have to be careful that any left-over bits are large enough to
  195. return. Note that we _don't check_ to make sure there's room to
  196. grow/shrink the start/end by another page, we just assume that
  197. the unmap threshold is high enough so that this is always safe
  198. (i.e., it should probably be at least 3 pages). */
  199. if (unmap_start > start)
  200. {
  201. if (unmap_start - start < HEAP_MIN_FREE_AREA_SIZE)
  202. unmap_start += MALLOC_PAGE_SIZE;
  203. __heap_free (heap, (void *)start, unmap_start - start);
  204. }
  205. if (end > unmap_end)
  206. {
  207. if (end - unmap_end < HEAP_MIN_FREE_AREA_SIZE)
  208. unmap_end -= MALLOC_PAGE_SIZE;
  209. __heap_free (heap, (void *)unmap_end, end - unmap_end);
  210. }
  211. /* Release the heap lock before we do the system call. */
  212. __heap_unlock (heap_lock);
  213. if (unmap_end > unmap_start)
  214. /* Finally, actually unmap the memory. */
  215. munmap ((void *)unmap_start, unmap_end - unmap_start);
  216. # endif /* __UCLIBC_UCLINUX_BROKEN_MUNMAP__ */
  217. #endif /* MALLOC_USE_SBRK */
  218. }
  219. MALLOC_DEBUG_INDENT (-1);
  220. }
  221. void
  222. free (void *mem)
  223. {
  224. free_to_heap (mem, &__malloc_heap, &__malloc_heap_lock);
  225. }