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.6 2002/06/04 23:05:49 markus Exp $");
29 #ifdef HAVE_SYS_MMAN_H
36 #include "monitor_mm.h"
39 mm_compare(struct mm_share *a, struct mm_share *b)
41 return ((char *)a->address - (char *)b->address);
44 RB_GENERATE(mmtree, mm_share, next, mm_compare)
46 static struct mm_share *
47 mm_make_entry(struct mm_master *mm, struct mmtree *head,
48 void *address, size_t size)
50 struct mm_share *tmp, *tmp2;
52 if (mm->mmalloc == NULL)
53 tmp = xmalloc(sizeof(struct mm_share));
55 tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
56 tmp->address = address;
59 tmp2 = RB_INSERT(mmtree, head, tmp);
61 fatal("mm_make_entry(%p): double address %p->%p(%lu)",
62 mm, tmp2, address, (u_long)size);
67 /* Creates a shared memory area of a certain size */
70 mm_create(struct mm_master *mmalloc, size_t size)
76 mm = xmalloc(sizeof(struct mm_master));
78 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
81 * If the memory map has a mm_master it can be completely
82 * shared including authentication between the child
85 mm->mmalloc = mmalloc;
87 #ifdef HAVE_MMAP_ANON_SHARED
88 address = mmap(NULL, size, PROT_WRITE|PROT_READ, MAP_ANON|MAP_SHARED,
91 fatal("%s: UsePrivilegeSeparation=yes and Compression=yes not supported",
95 mm->address = address;
98 RB_INIT(&mm->rb_free);
99 RB_INIT(&mm->rb_allocated);
101 mm_make_entry(mm, &mm->rb_free, address, size);
106 /* Frees either the allocated or the free list */
109 mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
111 struct mm_share *mms, *next;
113 for (mms = RB_ROOT(head); mms; mms = next) {
114 next = RB_NEXT(mmtree, head, mms);
115 RB_REMOVE(mmtree, head, mms);
119 mm_free(mmalloc, mms);
123 /* Destroys a memory mapped area */
126 mm_destroy(struct mm_master *mm)
128 mm_freelist(mm->mmalloc, &mm->rb_free);
129 mm_freelist(mm->mmalloc, &mm->rb_allocated);
132 if (munmap(mm->address, mm->size) == -1)
133 fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
136 fatal("%s: UsePrivilegeSeparation=yes not supported",
139 if (mm->mmalloc == NULL)
142 mm_free(mm->mmalloc, mm);
146 mm_xmalloc(struct mm_master *mm, size_t size)
150 address = mm_malloc(mm, size);
152 fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
157 /* Allocates data from a memory mapped area */
160 mm_malloc(struct mm_master *mm, size_t size)
162 struct mm_share *mms, *tmp;
165 fatal("mm_malloc: try to allocate 0 space");
167 size = ((size + MM_MINSIZE - 1) / MM_MINSIZE) * MM_MINSIZE;
169 RB_FOREACH(mms, mmtree, &mm->rb_free) {
170 if (mms->size >= size)
178 memset(mms->address, 0xd0, size);
180 tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
182 /* Does not change order in RB tree */
184 mms->address = (u_char *)mms->address + size;
186 if (mms->size == 0) {
187 RB_REMOVE(mmtree, &mm->rb_free, mms);
188 if (mm->mmalloc == NULL)
191 mm_free(mm->mmalloc, mms);
194 return (tmp->address);
197 /* Frees memory in a memory mapped area */
200 mm_free(struct mm_master *mm, void *address)
202 struct mm_share *mms, *prev, tmp;
204 tmp.address = address;
205 mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
207 fatal("mm_free(%p): can not find %p", mm, address);
210 memset(mms->address, 0xd0, mms->size);
212 /* Remove from allocated list and insert in free list */
213 RB_REMOVE(mmtree, &mm->rb_allocated, mms);
214 if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
215 fatal("mm_free(%p): double address %p", mm, address);
217 /* Find previous entry */
219 if (RB_LEFT(prev, next)) {
220 prev = RB_LEFT(prev, next);
221 while (RB_RIGHT(prev, next))
222 prev = RB_RIGHT(prev, next);
224 if (RB_PARENT(prev, next) &&
225 (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
226 prev = RB_PARENT(prev, next);
228 while (RB_PARENT(prev, next) &&
229 (prev == RB_LEFT(RB_PARENT(prev, next), next)))
230 prev = RB_PARENT(prev, next);
231 prev = RB_PARENT(prev, next);
235 /* Check if range does not overlap */
236 if (prev != NULL && MM_ADDRESS_END(prev) > address)
237 fatal("mm_free: memory corruption: %p(%lu) > %p",
238 prev->address, (u_long)prev->size, address);
240 /* See if we can merge backwards */
241 if (prev != NULL && MM_ADDRESS_END(prev) == address) {
242 prev->size += mms->size;
243 RB_REMOVE(mmtree, &mm->rb_free, mms);
244 if (mm->mmalloc == NULL)
247 mm_free(mm->mmalloc, mms);
254 /* Check if we can merge forwards */
255 mms = RB_NEXT(mmtree, &mm->rb_free, prev);
259 if (MM_ADDRESS_END(prev) > mms->address)
260 fatal("mm_free: memory corruption: %p < %p(%lu)",
261 mms->address, prev->address, (u_long)prev->size);
262 if (MM_ADDRESS_END(prev) != mms->address)
265 prev->size += mms->size;
266 RB_REMOVE(mmtree, &mm->rb_free, mms);
268 if (mm->mmalloc == NULL)
271 mm_free(mm->mmalloc, mms);
275 mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
276 struct mm_master *mm, struct mm_master *mmold)
278 struct mm_master *mmalloc = mm->mmalloc;
279 struct mm_share *mms, *new;
282 RB_FOREACH(mms, mmtree, oldtree) {
283 /* Check the values */
284 mm_memvalid(mmold, mms, sizeof(struct mm_share));
285 mm_memvalid(mm, mms->address, mms->size);
287 new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
288 memcpy(new, mms, sizeof(struct mm_share));
289 RB_INSERT(mmtree, newtree, new);
294 mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
296 struct mm_master *mm;
297 struct mm_master *mmalloc;
298 struct mm_master *mmold;
299 struct mmtree rb_free, rb_allocated;
301 debug3("%s: Share sync", __func__);
305 mm_memvalid(mmold, mm, sizeof(*mm));
307 mmalloc = mm_create(NULL, mm->size);
308 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
309 memcpy(mm, *pmm, sizeof(struct mm_master));
310 mm->mmalloc = mmalloc;
312 rb_free = mm->rb_free;
313 rb_allocated = mm->rb_allocated;
315 RB_INIT(&mm->rb_free);
316 RB_INIT(&mm->rb_allocated);
318 mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
319 mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
326 debug3("%s: Share sync end", __func__);
330 mm_memvalid(struct mm_master *mm, void *address, size_t size)
332 void *end = (u_char *)address + size;
334 if (address < mm->address)
335 fatal("mm_memvalid: address too small: %p", address);
337 fatal("mm_memvalid: end < address: %p < %p", end, address);
338 if (end > (void *)((u_char *)mm->address + mm->size))
339 fatal("mm_memvalid: address too large: %p", address);