memalign.c 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. /*
  2. * libc/stdlib/malloc/memalign.c -- memalign (`aligned malloc') function
  3. *
  4. * Copyright (C) 2002 NEC Corporation
  5. * Copyright (C) 2002 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. /*
  19. ______________________ TOTAL _________________________
  20. / \
  21. +---------------+-------------------------+--------------+
  22. | | | |
  23. +---------------+-------------------------+--------------+
  24. \____ INIT ____/ \______ RETURNED _______/ \____ END ___/
  25. */
  26. void *memalign (size_t alignment, size_t size);
  27. void *
  28. memalign (size_t alignment, size_t size)
  29. {
  30. void *mem, *base;
  31. unsigned long tot_addr, tot_end_addr, addr, end_addr;
  32. struct heap_free_area **heap = &__malloc_heap;
  33. /* Make SIZE something we like. */
  34. size = HEAP_ADJUST_SIZE (size);
  35. /* Use malloc to do the initial allocation, since it deals with getting
  36. system memory. We over-allocate enough to be sure that we'll get
  37. enough memory to hold a properly aligned block of size SIZE,
  38. _somewhere_ in the result. */
  39. mem = malloc (size + 2 * alignment);
  40. if (! mem)
  41. /* Allocation failed, we can't do anything. */
  42. return 0;
  43. if (alignment < MALLOC_ALIGNMENT)
  44. return mem;
  45. /* Remember the base-address, of the allocation, although we normally
  46. use the user-address for calculations, since that's where the
  47. alignment matters. */
  48. base = MALLOC_BASE (mem);
  49. /* The bounds of the initial allocation. */
  50. tot_addr = (unsigned long)mem;
  51. tot_end_addr = (unsigned long)base + MALLOC_SIZE (mem);
  52. /* Find a likely place inside MEM with the right alignment. */
  53. addr = MALLOC_ROUND_UP (tot_addr, alignment);
  54. /* Unless TOT_ADDR was already aligned correctly, we need to return the
  55. initial part of MEM to the heap. */
  56. if (addr != tot_addr)
  57. {
  58. size_t init_size = addr - tot_addr;
  59. /* Ensure that memory returned to the heap is large enough. */
  60. if (init_size < HEAP_MIN_SIZE)
  61. {
  62. addr = MALLOC_ROUND_UP (tot_addr + HEAP_MIN_SIZE, alignment);
  63. init_size = addr - tot_addr;
  64. }
  65. __heap_free (heap, base, init_size);
  66. /* Remember that we've freed the initial part of MEM. */
  67. base += init_size;
  68. }
  69. /* Return the end part of MEM to the heap, unless it's too small. */
  70. end_addr = addr + size;
  71. if (end_addr + MALLOC_REALLOC_MIN_FREE_SIZE < tot_end_addr)
  72. __heap_free (heap, (void *)end_addr, tot_end_addr - end_addr);
  73. else
  74. /* We didn't free the end, so include it in the size. */
  75. end_addr = tot_end_addr;
  76. return MALLOC_SETUP (base, end_addr - (unsigned long)base);
  77. }