Annotation of src/usr.bin/ssh/monitor_mm.c, Revision 1.13
1.13 ! stevesk 1: /* $OpenBSD: monitor_mm.c,v 1.12 2006/07/11 20:07:25 stevesk Exp $ */
1.1 provos 2: /*
3: * Copyright 2002 Niels Provos <provos@citi.umich.edu>
4: * All rights reserved.
5: *
6: * Redistribution and use in source and binary forms, with or without
7: * modification, are permitted provided that the following conditions
8: * are met:
9: * 1. Redistributions of source code must retain the above copyright
10: * notice, this list of conditions and the following disclaimer.
11: * 2. Redistributions in binary form must reproduce the above copyright
12: * notice, this list of conditions and the following disclaimer in the
13: * documentation and/or other materials provided with the distribution.
14: *
15: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17: * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18: * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19: * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20: * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24: * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25: */
26:
27: #include "includes.h"
28:
29: #include <sys/mman.h>
1.12 stevesk 30:
31: #include <errno.h>
1.13 ! stevesk 32: #include <string.h>
1.1 provos 33:
34: #include "ssh.h"
35: #include "xmalloc.h"
36: #include "log.h"
37: #include "monitor_mm.h"
38:
39: static int
40: mm_compare(struct mm_share *a, struct mm_share *b)
41: {
1.7 millert 42: long diff = (char *)a->address - (char *)b->address;
43:
44: if (diff == 0)
45: return (0);
46: else if (diff < 0)
47: return (-1);
48: else
49: return (1);
1.1 provos 50: }
51:
52: RB_GENERATE(mmtree, mm_share, next, mm_compare)
53:
54: static struct mm_share *
55: mm_make_entry(struct mm_master *mm, struct mmtree *head,
56: void *address, size_t size)
57: {
58: struct mm_share *tmp, *tmp2;
59:
60: if (mm->mmalloc == NULL)
61: tmp = xmalloc(sizeof(struct mm_share));
62: else
63: tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
64: tmp->address = address;
65: tmp->size = size;
66:
67: tmp2 = RB_INSERT(mmtree, head, tmp);
68: if (tmp2 != NULL)
1.4 stevesk 69: fatal("mm_make_entry(%p): double address %p->%p(%lu)",
70: mm, tmp2, address, (u_long)size);
1.1 provos 71:
72: return (tmp);
73: }
74:
75: /* Creates a shared memory area of a certain size */
76:
77: struct mm_master *
78: mm_create(struct mm_master *mmalloc, size_t size)
79: {
80: void *address;
81: struct mm_master *mm;
82:
83: if (mmalloc == NULL)
84: mm = xmalloc(sizeof(struct mm_master));
85: else
86: mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
87:
1.3 markus 88: /*
1.1 provos 89: * If the memory map has a mm_master it can be completely
90: * shared including authentication between the child
91: * and the client.
92: */
93: mm->mmalloc = mmalloc;
94:
95: address = mmap(NULL, size, PROT_WRITE|PROT_READ, MAP_ANON|MAP_SHARED,
1.9 deraadt 96: -1, (off_t)0);
1.1 provos 97: if (address == MAP_FAILED)
1.5 stevesk 98: fatal("mmap(%lu): %s", (u_long)size, strerror(errno));
1.1 provos 99:
100: mm->address = address;
101: mm->size = size;
102:
103: RB_INIT(&mm->rb_free);
104: RB_INIT(&mm->rb_allocated);
105:
106: mm_make_entry(mm, &mm->rb_free, address, size);
107:
108: return (mm);
109: }
110:
111: /* Frees either the allocated or the free list */
112:
1.2 markus 113: static void
1.1 provos 114: mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
115: {
116: struct mm_share *mms, *next;
117:
118: for (mms = RB_ROOT(head); mms; mms = next) {
119: next = RB_NEXT(mmtree, head, mms);
120: RB_REMOVE(mmtree, head, mms);
121: if (mmalloc == NULL)
122: xfree(mms);
123: else
124: mm_free(mmalloc, mms);
125: }
126: }
127:
128: /* Destroys a memory mapped area */
129:
130: void
131: mm_destroy(struct mm_master *mm)
132: {
133: mm_freelist(mm->mmalloc, &mm->rb_free);
134: mm_freelist(mm->mmalloc, &mm->rb_allocated);
135:
136: if (munmap(mm->address, mm->size) == -1)
1.5 stevesk 137: fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
138: strerror(errno));
1.1 provos 139: if (mm->mmalloc == NULL)
140: xfree(mm);
141: else
142: mm_free(mm->mmalloc, mm);
143: }
144:
145: void *
146: mm_xmalloc(struct mm_master *mm, size_t size)
147: {
148: void *address;
149:
150: address = mm_malloc(mm, size);
151: if (address == NULL)
1.6 markus 152: fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
1.1 provos 153: return (address);
154: }
155:
156:
157: /* Allocates data from a memory mapped area */
158:
159: void *
160: mm_malloc(struct mm_master *mm, size_t size)
161: {
162: struct mm_share *mms, *tmp;
163:
164: if (size == 0)
165: fatal("mm_malloc: try to allocate 0 space");
1.8 millert 166: if (size > SIZE_T_MAX - MM_MINSIZE + 1)
167: fatal("mm_malloc: size too big");
1.1 provos 168:
1.8 millert 169: size = ((size + (MM_MINSIZE - 1)) / MM_MINSIZE) * MM_MINSIZE;
1.1 provos 170:
171: RB_FOREACH(mms, mmtree, &mm->rb_free) {
172: if (mms->size >= size)
173: break;
174: }
175:
176: if (mms == NULL)
177: return (NULL);
178:
1.3 markus 179: /* Debug */
1.1 provos 180: memset(mms->address, 0xd0, size);
181:
182: tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
183:
184: /* Does not change order in RB tree */
185: mms->size -= size;
186: mms->address = (u_char *)mms->address + size;
187:
188: if (mms->size == 0) {
189: RB_REMOVE(mmtree, &mm->rb_free, mms);
190: if (mm->mmalloc == NULL)
191: xfree(mms);
192: else
193: mm_free(mm->mmalloc, mms);
194: }
195:
196: return (tmp->address);
197: }
198:
199: /* Frees memory in a memory mapped area */
200:
201: void
202: mm_free(struct mm_master *mm, void *address)
203: {
204: struct mm_share *mms, *prev, tmp;
205:
206: tmp.address = address;
207: mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
208: if (mms == NULL)
209: fatal("mm_free(%p): can not find %p", mm, address);
210:
1.3 markus 211: /* Debug */
1.1 provos 212: memset(mms->address, 0xd0, mms->size);
213:
214: /* Remove from allocated list and insert in free list */
215: RB_REMOVE(mmtree, &mm->rb_allocated, mms);
216: if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
217: fatal("mm_free(%p): double address %p", mm, address);
218:
219: /* Find previous entry */
220: prev = mms;
221: if (RB_LEFT(prev, next)) {
222: prev = RB_LEFT(prev, next);
223: while (RB_RIGHT(prev, next))
224: prev = RB_RIGHT(prev, next);
225: } else {
226: if (RB_PARENT(prev, next) &&
227: (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
228: prev = RB_PARENT(prev, next);
229: else {
230: while (RB_PARENT(prev, next) &&
231: (prev == RB_LEFT(RB_PARENT(prev, next), next)))
232: prev = RB_PARENT(prev, next);
233: prev = RB_PARENT(prev, next);
234: }
235: }
236:
237: /* Check if range does not overlap */
238: if (prev != NULL && MM_ADDRESS_END(prev) > address)
1.4 stevesk 239: fatal("mm_free: memory corruption: %p(%lu) > %p",
240: prev->address, (u_long)prev->size, address);
1.1 provos 241:
242: /* See if we can merge backwards */
243: if (prev != NULL && MM_ADDRESS_END(prev) == address) {
244: prev->size += mms->size;
245: RB_REMOVE(mmtree, &mm->rb_free, mms);
246: if (mm->mmalloc == NULL)
247: xfree(mms);
248: else
249: mm_free(mm->mmalloc, mms);
250: } else
251: prev = mms;
252:
253: if (prev == NULL)
254: return;
255:
256: /* Check if we can merge forwards */
257: mms = RB_NEXT(mmtree, &mm->rb_free, prev);
258: if (mms == NULL)
259: return;
260:
261: if (MM_ADDRESS_END(prev) > mms->address)
1.4 stevesk 262: fatal("mm_free: memory corruption: %p < %p(%lu)",
263: mms->address, prev->address, (u_long)prev->size);
1.1 provos 264: if (MM_ADDRESS_END(prev) != mms->address)
265: return;
266:
267: prev->size += mms->size;
268: RB_REMOVE(mmtree, &mm->rb_free, mms);
269:
270: if (mm->mmalloc == NULL)
271: xfree(mms);
272: else
273: mm_free(mm->mmalloc, mms);
274: }
275:
1.2 markus 276: static void
1.1 provos 277: mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
278: struct mm_master *mm, struct mm_master *mmold)
279: {
280: struct mm_master *mmalloc = mm->mmalloc;
281: struct mm_share *mms, *new;
282:
283: /* Sync free list */
284: RB_FOREACH(mms, mmtree, oldtree) {
285: /* Check the values */
286: mm_memvalid(mmold, mms, sizeof(struct mm_share));
287: mm_memvalid(mm, mms->address, mms->size);
288:
289: new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
290: memcpy(new, mms, sizeof(struct mm_share));
291: RB_INSERT(mmtree, newtree, new);
292: }
293: }
294:
295: void
296: mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
297: {
298: struct mm_master *mm;
299: struct mm_master *mmalloc;
300: struct mm_master *mmold;
301: struct mmtree rb_free, rb_allocated;
302:
1.6 markus 303: debug3("%s: Share sync", __func__);
1.1 provos 304:
305: mm = *pmm;
306: mmold = mm->mmalloc;
307: mm_memvalid(mmold, mm, sizeof(*mm));
308:
309: mmalloc = mm_create(NULL, mm->size);
310: mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
311: memcpy(mm, *pmm, sizeof(struct mm_master));
312: mm->mmalloc = mmalloc;
313:
314: rb_free = mm->rb_free;
315: rb_allocated = mm->rb_allocated;
316:
317: RB_INIT(&mm->rb_free);
318: RB_INIT(&mm->rb_allocated);
319:
320: mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
321: mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
322:
323: mm_destroy(mmold);
324:
325: *pmm = mm;
326: *pmmalloc = mmalloc;
327:
1.6 markus 328: debug3("%s: Share sync end", __func__);
1.1 provos 329: }
330:
331: void
332: mm_memvalid(struct mm_master *mm, void *address, size_t size)
333: {
334: void *end = (u_char *)address + size;
335:
336: if (address < mm->address)
337: fatal("mm_memvalid: address too small: %p", address);
338: if (end < address)
339: fatal("mm_memvalid: end < address: %p < %p", end, address);
340: if (end > (void *)((u_char *)mm->address + mm->size))
341: fatal("mm_memvalid: address too large: %p", address);
342: }
![[BACK]](/icons/back.gif){kind=icon}
Return to monitor_mm.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / ssh