1 /* Memory allocation aligned to system page boundaries.
3 Copyright (C) 2005 Free Software Foundation, Inc.
5 This program is free software; you can redistribute it and/or modify it
6 under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 2, or (at your option)
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public
16 License along with this program; if not, write to the Free Software
17 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
20 /* Written by Derek R. Price <derek@ximbiot.com>. */
26 #include "pagealign_alloc.h"
40 # include <sys/mman.h>
45 #include "getpagesize.h"
49 #define _(str) gettext (str)
52 /* Define MAP_FILE when it isn't otherwise. */
56 /* Define MAP_FAILED for old systems which neglect to. */
58 # define MAP_FAILED ((void *)-1)
63 #if HAVE_MMAP || ! HAVE_POSIX_MEMALIGN
66 /* For each memory region, we store its size. */
67 typedef size_t info_t;
69 /* For each memory region, we store the original pointer returned by
71 typedef void * info_t;
74 /* A simple linked list of allocated memory regions. It is probably not the
75 most efficient way to store these, but anyway... */
76 typedef struct memnode_s memnode_t;
84 /* The list of currently allocated memory regions. */
85 static memnode_t *memnode_table = NULL;
89 new_memnode (void *aligned_ptr, info_t info)
91 memnode_t *new_node = (memnode_t *) xmalloc (sizeof (memnode_t));
92 new_node->aligned_ptr = aligned_ptr;
93 new_node->info = info;
94 new_node->next = memnode_table;
95 memnode_table = new_node;
99 /* Dispose of the memnode containing a map for the ALIGNED_PTR in question
100 and return the content of the node's INFO field. */
102 get_memnode (void *aligned_ptr)
106 memnode_t **p_next = &memnode_table;
108 for (c = *p_next; c != NULL; p_next = &c->next, c = c->next)
109 if (c->aligned_ptr == aligned_ptr)
113 /* An attempt to free untracked memory. A wrong pointer was passed
114 to pagealign_free(). */
117 /* Remove this entry from the list, save the return value, and free it. */
125 #endif /* HAVE_MMAP || !HAVE_POSIX_MEMALIGN */
129 pagealign_alloc (size_t size)
133 # ifdef HAVE_MAP_ANONYMOUS
135 const int flags = MAP_ANONYMOUS | MAP_PRIVATE;
136 # else /* !HAVE_MAP_ANONYMOUS */
137 static int fd = -1; /* Only open /dev/zero once in order to avoid limiting
138 the amount of memory we may allocate based on the
139 number of open file descriptors. */
140 const int flags = MAP_FILE | MAP_PRIVATE;
143 fd = open ("/dev/zero", O_RDONLY, 0666);
145 error (EXIT_FAILURE, errno, _("Failed to open /dev/zero for read"));
147 # endif /* HAVE_MAP_ANONYMOUS */
148 ret = mmap (NULL, size, PROT_READ | PROT_WRITE, flags, fd, 0);
149 if (ret == MAP_FAILED)
151 new_memnode (ret, size);
152 #elif HAVE_POSIX_MEMALIGN
153 int status = posix_memalign (&ret, getpagesize (), size);
159 #else /* !HAVE_MMAP && !HAVE_POSIX_MEMALIGN */
160 size_t pagesize = getpagesize ();
161 void *unaligned_ptr = malloc (size + pagesize - 1);
162 if (unaligned_ptr == NULL)
164 /* Set errno. We don't know whether malloc already set errno: some
165 implementations of malloc do, some don't. */
169 ret = (char *) unaligned_ptr
170 + ((- (unsigned long) unaligned_ptr) & (pagesize - 1));
171 new_memnode (ret, unaligned_ptr);
172 #endif /* HAVE_MMAP && HAVE_POSIX_MEMALIGN */
178 pagealign_xalloc (size_t size)
182 ret = pagealign_alloc (size);
190 pagealign_free (void *aligned_ptr)
193 if (munmap (aligned_ptr, get_memnode (aligned_ptr)) < 0)
194 error (EXIT_FAILURE, errno, "Failed to unmap memory");
195 #elif HAVE_POSIX_MEMALIGN
198 free (get_memnode (aligned_ptr));