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.7 2002/06/28 01:49:31 millert Exp $");
29 #ifdef HAVE_SYS_MMAN_H
36 #include "monitor_mm.h"
39 mm_compare(struct mm_share *a, struct mm_share *b)
41 long diff = (char *)a->address - (char *)b->address;
51 RB_GENERATE(mmtree, mm_share, next, mm_compare)
53 static struct mm_share *
54 mm_make_entry(struct mm_master *mm, struct mmtree *head,
55 void *address, size_t size)
57 struct mm_share *tmp, *tmp2;
59 if (mm->mmalloc == NULL)
60 tmp = xmalloc(sizeof(struct mm_share));
62 tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
63 tmp->address = address;
66 tmp2 = RB_INSERT(mmtree, head, tmp);
68 fatal("mm_make_entry(%p): double address %p->%p(%lu)",
69 mm, tmp2, address, (u_long)size);
74 /* Creates a shared memory area of a certain size */
77 mm_create(struct mm_master *mmalloc, size_t size)
83 mm = xmalloc(sizeof(struct mm_master));
85 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
88 * If the memory map has a mm_master it can be completely
89 * shared including authentication between the child
92 mm->mmalloc = mmalloc;
94 #ifdef HAVE_MMAP_ANON_SHARED
95 address = mmap(NULL, size, PROT_WRITE|PROT_READ, MAP_ANON|MAP_SHARED,
97 if (address == MAP_FAILED)
98 fatal("mmap(%lu): %s", (u_long)size, strerror(errno));
100 fatal("%s: UsePrivilegeSeparation=yes and Compression=yes not supported",
104 mm->address = address;
107 RB_INIT(&mm->rb_free);
108 RB_INIT(&mm->rb_allocated);
110 mm_make_entry(mm, &mm->rb_free, address, size);
115 /* Frees either the allocated or the free list */
118 mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
120 struct mm_share *mms, *next;
122 for (mms = RB_ROOT(head); mms; mms = next) {
123 next = RB_NEXT(mmtree, head, mms);
124 RB_REMOVE(mmtree, head, mms);
128 mm_free(mmalloc, mms);
132 /* Destroys a memory mapped area */
135 mm_destroy(struct mm_master *mm)
137 mm_freelist(mm->mmalloc, &mm->rb_free);
138 mm_freelist(mm->mmalloc, &mm->rb_allocated);
140 #ifdef HAVE_MMAP_ANON_SHARED
141 if (munmap(mm->address, mm->size) == -1)
142 fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
145 fatal("%s: UsePrivilegeSeparation=yes and Compression=yes not supported",
148 if (mm->mmalloc == NULL)
151 mm_free(mm->mmalloc, mm);
155 mm_xmalloc(struct mm_master *mm, size_t size)
159 address = mm_malloc(mm, size);
161 fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
166 /* Allocates data from a memory mapped area */
169 mm_malloc(struct mm_master *mm, size_t size)
171 struct mm_share *mms, *tmp;
174 fatal("mm_malloc: try to allocate 0 space");
176 size = ((size + MM_MINSIZE - 1) / MM_MINSIZE) * MM_MINSIZE;
178 RB_FOREACH(mms, mmtree, &mm->rb_free) {
179 if (mms->size >= size)
187 memset(mms->address, 0xd0, size);
189 tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
191 /* Does not change order in RB tree */
193 mms->address = (u_char *)mms->address + size;
195 if (mms->size == 0) {
196 RB_REMOVE(mmtree, &mm->rb_free, mms);
197 if (mm->mmalloc == NULL)
200 mm_free(mm->mmalloc, mms);
203 return (tmp->address);
206 /* Frees memory in a memory mapped area */
209 mm_free(struct mm_master *mm, void *address)
211 struct mm_share *mms, *prev, tmp;
213 tmp.address = address;
214 mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
216 fatal("mm_free(%p): can not find %p", mm, address);
219 memset(mms->address, 0xd0, mms->size);
221 /* Remove from allocated list and insert in free list */
222 RB_REMOVE(mmtree, &mm->rb_allocated, mms);
223 if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
224 fatal("mm_free(%p): double address %p", mm, address);
226 /* Find previous entry */
228 if (RB_LEFT(prev, next)) {
229 prev = RB_LEFT(prev, next);
230 while (RB_RIGHT(prev, next))
231 prev = RB_RIGHT(prev, next);
233 if (RB_PARENT(prev, next) &&
234 (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
235 prev = RB_PARENT(prev, next);
237 while (RB_PARENT(prev, next) &&
238 (prev == RB_LEFT(RB_PARENT(prev, next), next)))
239 prev = RB_PARENT(prev, next);
240 prev = RB_PARENT(prev, next);
244 /* Check if range does not overlap */
245 if (prev != NULL && MM_ADDRESS_END(prev) > address)
246 fatal("mm_free: memory corruption: %p(%lu) > %p",
247 prev->address, (u_long)prev->size, address);
249 /* See if we can merge backwards */
250 if (prev != NULL && MM_ADDRESS_END(prev) == address) {
251 prev->size += mms->size;
252 RB_REMOVE(mmtree, &mm->rb_free, mms);
253 if (mm->mmalloc == NULL)
256 mm_free(mm->mmalloc, mms);
263 /* Check if we can merge forwards */
264 mms = RB_NEXT(mmtree, &mm->rb_free, prev);
268 if (MM_ADDRESS_END(prev) > mms->address)
269 fatal("mm_free: memory corruption: %p < %p(%lu)",
270 mms->address, prev->address, (u_long)prev->size);
271 if (MM_ADDRESS_END(prev) != mms->address)
274 prev->size += mms->size;
275 RB_REMOVE(mmtree, &mm->rb_free, mms);
277 if (mm->mmalloc == NULL)
280 mm_free(mm->mmalloc, mms);
284 mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
285 struct mm_master *mm, struct mm_master *mmold)
287 struct mm_master *mmalloc = mm->mmalloc;
288 struct mm_share *mms, *new;
291 RB_FOREACH(mms, mmtree, oldtree) {
292 /* Check the values */
293 mm_memvalid(mmold, mms, sizeof(struct mm_share));
294 mm_memvalid(mm, mms->address, mms->size);
296 new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
297 memcpy(new, mms, sizeof(struct mm_share));
298 RB_INSERT(mmtree, newtree, new);
303 mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
305 struct mm_master *mm;
306 struct mm_master *mmalloc;
307 struct mm_master *mmold;
308 struct mmtree rb_free, rb_allocated;
310 debug3("%s: Share sync", __func__);
314 mm_memvalid(mmold, mm, sizeof(*mm));
316 mmalloc = mm_create(NULL, mm->size);
317 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
318 memcpy(mm, *pmm, sizeof(struct mm_master));
319 mm->mmalloc = mmalloc;
321 rb_free = mm->rb_free;
322 rb_allocated = mm->rb_allocated;
324 RB_INIT(&mm->rb_free);
325 RB_INIT(&mm->rb_allocated);
327 mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
328 mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
335 debug3("%s: Share sync end", __func__);
339 mm_memvalid(struct mm_master *mm, void *address, size_t size)
341 void *end = (u_char *)address + size;
343 if (address < mm->address)
344 fatal("mm_memvalid: address too small: %p", address);
346 fatal("mm_memvalid: end < address: %p < %p", end, address);
347 if (end > (void *)((u_char *)mm->address + mm->size))
348 fatal("mm_memvalid: address too large: %p", address);