2 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 RCSID("$OpenBSD: monitor_mm.c,v 1.8 2002/08/02 14:43:15 millert Exp $");
29 #ifdef HAVE_SYS_MMAN_H
33 #include "openbsd-compat/xmmap.h"
37 #include "monitor_mm.h"
40 mm_compare(struct mm_share *a, struct mm_share *b)
42 long diff = (char *)a->address - (char *)b->address;
52 RB_GENERATE(mmtree, mm_share, next, mm_compare)
54 static struct mm_share *
55 mm_make_entry(struct mm_master *mm, struct mmtree *head,
56 void *address, size_t size)
58 struct mm_share *tmp, *tmp2;
60 if (mm->mmalloc == NULL)
61 tmp = xmalloc(sizeof(struct mm_share));
63 tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
64 tmp->address = address;
67 tmp2 = RB_INSERT(mmtree, head, tmp);
69 fatal("mm_make_entry(%p): double address %p->%p(%lu)",
70 mm, tmp2, address, (u_long)size);
75 /* Creates a shared memory area of a certain size */
78 mm_create(struct mm_master *mmalloc, size_t size)
84 mm = xmalloc(sizeof(struct mm_master));
86 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
89 * If the memory map has a mm_master it can be completely
90 * shared including authentication between the child
93 mm->mmalloc = mmalloc;
95 address = xmmap(size);
96 if (address == MAP_FAILED)
97 fatal("mmap(%lu): %s", (u_long)size, strerror(errno));
99 mm->address = address;
102 RB_INIT(&mm->rb_free);
103 RB_INIT(&mm->rb_allocated);
105 mm_make_entry(mm, &mm->rb_free, address, size);
110 /* Frees either the allocated or the free list */
113 mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
115 struct mm_share *mms, *next;
117 for (mms = RB_ROOT(head); mms; mms = next) {
118 next = RB_NEXT(mmtree, head, mms);
119 RB_REMOVE(mmtree, head, mms);
123 mm_free(mmalloc, mms);
127 /* Destroys a memory mapped area */
130 mm_destroy(struct mm_master *mm)
132 mm_freelist(mm->mmalloc, &mm->rb_free);
133 mm_freelist(mm->mmalloc, &mm->rb_allocated);
136 if (munmap(mm->address, mm->size) == -1)
137 fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
140 fatal("%s: UsePrivilegeSeparation=yes and Compression=yes not supported",
143 if (mm->mmalloc == NULL)
146 mm_free(mm->mmalloc, mm);
150 mm_xmalloc(struct mm_master *mm, size_t size)
154 address = mm_malloc(mm, size);
156 fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
161 /* Allocates data from a memory mapped area */
164 mm_malloc(struct mm_master *mm, size_t size)
166 struct mm_share *mms, *tmp;
169 fatal("mm_malloc: try to allocate 0 space");
170 if (size > SIZE_T_MAX - MM_MINSIZE + 1)
171 fatal("mm_malloc: size too big");
173 size = ((size + (MM_MINSIZE - 1)) / MM_MINSIZE) * MM_MINSIZE;
175 RB_FOREACH(mms, mmtree, &mm->rb_free) {
176 if (mms->size >= size)
184 memset(mms->address, 0xd0, size);
186 tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
188 /* Does not change order in RB tree */
190 mms->address = (u_char *)mms->address + size;
192 if (mms->size == 0) {
193 RB_REMOVE(mmtree, &mm->rb_free, mms);
194 if (mm->mmalloc == NULL)
197 mm_free(mm->mmalloc, mms);
200 return (tmp->address);
203 /* Frees memory in a memory mapped area */
206 mm_free(struct mm_master *mm, void *address)
208 struct mm_share *mms, *prev, tmp;
210 tmp.address = address;
211 mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
213 fatal("mm_free(%p): can not find %p", mm, address);
216 memset(mms->address, 0xd0, mms->size);
218 /* Remove from allocated list and insert in free list */
219 RB_REMOVE(mmtree, &mm->rb_allocated, mms);
220 if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
221 fatal("mm_free(%p): double address %p", mm, address);
223 /* Find previous entry */
225 if (RB_LEFT(prev, next)) {
226 prev = RB_LEFT(prev, next);
227 while (RB_RIGHT(prev, next))
228 prev = RB_RIGHT(prev, next);
230 if (RB_PARENT(prev, next) &&
231 (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
232 prev = RB_PARENT(prev, next);
234 while (RB_PARENT(prev, next) &&
235 (prev == RB_LEFT(RB_PARENT(prev, next), next)))
236 prev = RB_PARENT(prev, next);
237 prev = RB_PARENT(prev, next);
241 /* Check if range does not overlap */
242 if (prev != NULL && MM_ADDRESS_END(prev) > address)
243 fatal("mm_free: memory corruption: %p(%lu) > %p",
244 prev->address, (u_long)prev->size, address);
246 /* See if we can merge backwards */
247 if (prev != NULL && MM_ADDRESS_END(prev) == address) {
248 prev->size += mms->size;
249 RB_REMOVE(mmtree, &mm->rb_free, mms);
250 if (mm->mmalloc == NULL)
253 mm_free(mm->mmalloc, mms);
260 /* Check if we can merge forwards */
261 mms = RB_NEXT(mmtree, &mm->rb_free, prev);
265 if (MM_ADDRESS_END(prev) > mms->address)
266 fatal("mm_free: memory corruption: %p < %p(%lu)",
267 mms->address, prev->address, (u_long)prev->size);
268 if (MM_ADDRESS_END(prev) != mms->address)
271 prev->size += mms->size;
272 RB_REMOVE(mmtree, &mm->rb_free, mms);
274 if (mm->mmalloc == NULL)
277 mm_free(mm->mmalloc, mms);
281 mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
282 struct mm_master *mm, struct mm_master *mmold)
284 struct mm_master *mmalloc = mm->mmalloc;
285 struct mm_share *mms, *new;
288 RB_FOREACH(mms, mmtree, oldtree) {
289 /* Check the values */
290 mm_memvalid(mmold, mms, sizeof(struct mm_share));
291 mm_memvalid(mm, mms->address, mms->size);
293 new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
294 memcpy(new, mms, sizeof(struct mm_share));
295 RB_INSERT(mmtree, newtree, new);
300 mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
302 struct mm_master *mm;
303 struct mm_master *mmalloc;
304 struct mm_master *mmold;
305 struct mmtree rb_free, rb_allocated;
307 debug3("%s: Share sync", __func__);
311 mm_memvalid(mmold, mm, sizeof(*mm));
313 mmalloc = mm_create(NULL, mm->size);
314 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
315 memcpy(mm, *pmm, sizeof(struct mm_master));
316 mm->mmalloc = mmalloc;
318 rb_free = mm->rb_free;
319 rb_allocated = mm->rb_allocated;
321 RB_INIT(&mm->rb_free);
322 RB_INIT(&mm->rb_allocated);
324 mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
325 mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
332 debug3("%s: Share sync end", __func__);
336 mm_memvalid(struct mm_master *mm, void *address, size_t size)
338 void *end = (u_char *)address + size;
340 if (address < mm->address)
341 fatal("mm_memvalid: address too small: %p", address);
343 fatal("mm_memvalid: end < address: %p < %p", end, address);
344 if (end > (void *)((u_char *)mm->address + mm->size))
345 fatal("mm_memvalid: address too large: %p", address);