1 /* Memory allocation aligned to system page boundaries.
3 Copyright (C) 2005, 2006, 2007 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>. */
24 #include "pagealign_alloc.h"
33 # include <sys/mman.h>
37 #include "getpagesize.h"
41 #define _(str) gettext (str)
44 /* Define MAP_FILE when it isn't otherwise. */
48 /* Define MAP_FAILED for old systems which neglect to. */
50 # define MAP_FAILED ((void *)-1)
54 /* The results of open() in this file are not used with fchdir,
55 therefore save some unnecessary work in fchdir.c. */
60 #if HAVE_MMAP || ! HAVE_POSIX_MEMALIGN
63 /* For each memory region, we store its size. */
64 typedef size_t info_t;
66 /* For each memory region, we store the original pointer returned by
68 typedef void * info_t;
71 /* A simple linked list of allocated memory regions. It is probably not the
72 most efficient way to store these, but anyway... */
73 typedef struct memnode_s memnode_t;
81 /* The list of currently allocated memory regions. */
82 static memnode_t *memnode_table = NULL;
86 new_memnode (void *aligned_ptr, info_t info)
88 memnode_t *new_node = XMALLOC (memnode_t);
89 new_node->aligned_ptr = aligned_ptr;
90 new_node->info = info;
91 new_node->next = memnode_table;
92 memnode_table = new_node;
96 /* Dispose of the memnode containing a map for the ALIGNED_PTR in question
97 and return the content of the node's INFO field. */
99 get_memnode (void *aligned_ptr)
103 memnode_t **p_next = &memnode_table;
105 for (c = *p_next; c != NULL; p_next = &c->next, c = c->next)
106 if (c->aligned_ptr == aligned_ptr)
110 /* An attempt to free untracked memory. A wrong pointer was passed
111 to pagealign_free(). */
114 /* Remove this entry from the list, save the return value, and free it. */
122 #endif /* HAVE_MMAP || !HAVE_POSIX_MEMALIGN */
126 pagealign_alloc (size_t size)
130 # ifdef HAVE_MAP_ANONYMOUS
132 const int flags = MAP_ANONYMOUS | MAP_PRIVATE;
133 # else /* !HAVE_MAP_ANONYMOUS */
134 static int fd = -1; /* Only open /dev/zero once in order to avoid limiting
135 the amount of memory we may allocate based on the
136 number of open file descriptors. */
137 const int flags = MAP_FILE | MAP_PRIVATE;
140 fd = open ("/dev/zero", O_RDONLY, 0666);
142 error (EXIT_FAILURE, errno, _("Failed to open /dev/zero for read"));
144 # endif /* HAVE_MAP_ANONYMOUS */
145 ret = mmap (NULL, size, PROT_READ | PROT_WRITE, flags, fd, 0);
146 if (ret == MAP_FAILED)
148 new_memnode (ret, size);
149 #elif HAVE_POSIX_MEMALIGN
150 int status = posix_memalign (&ret, getpagesize (), size);
156 #else /* !HAVE_MMAP && !HAVE_POSIX_MEMALIGN */
157 size_t pagesize = getpagesize ();
158 void *unaligned_ptr = malloc (size + pagesize - 1);
159 if (unaligned_ptr == NULL)
161 /* Set errno. We don't know whether malloc already set errno: some
162 implementations of malloc do, some don't. */
166 ret = (char *) unaligned_ptr
167 + ((- (unsigned long) unaligned_ptr) & (pagesize - 1));
168 new_memnode (ret, unaligned_ptr);
169 #endif /* HAVE_MMAP && HAVE_POSIX_MEMALIGN */
175 pagealign_xalloc (size_t size)
179 ret = pagealign_alloc (size);
187 pagealign_free (void *aligned_ptr)
190 if (munmap (aligned_ptr, get_memnode (aligned_ptr)) < 0)
191 error (EXIT_FAILURE, errno, "Failed to unmap memory");
192 #elif HAVE_POSIX_MEMALIGN
195 free (get_memnode (aligned_ptr));