Annotation of src/usr.bin/ssh/monitor_mm.c, Revision 1.14
1.14 ! stevesk 1: /* $OpenBSD: monitor_mm.c,v 1.13 2006/07/22 20:48:23 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.14 ! stevesk 30: #include <sys/param.h>
1.12 stevesk 31:
32: #include <errno.h>
1.13 stevesk 33: #include <string.h>
1.1 provos 34:
35: #include "ssh.h"
36: #include "xmalloc.h"
37: #include "log.h"
38: #include "monitor_mm.h"
39:
40: static int
41: mm_compare(struct mm_share *a, struct mm_share *b)
42: {
1.7 millert 43: long diff = (char *)a->address - (char *)b->address;
44:
45: if (diff == 0)
46: return (0);
47: else if (diff < 0)
48: return (-1);
49: else
50: return (1);
1.1 provos 51: }
52:
53: RB_GENERATE(mmtree, mm_share, next, mm_compare)
54:
55: static struct mm_share *
56: mm_make_entry(struct mm_master *mm, struct mmtree *head,
57: void *address, size_t size)
58: {
59: struct mm_share *tmp, *tmp2;
60:
61: if (mm->mmalloc == NULL)
62: tmp = xmalloc(sizeof(struct mm_share));
63: else
64: tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
65: tmp->address = address;
66: tmp->size = size;
67:
68: tmp2 = RB_INSERT(mmtree, head, tmp);
69: if (tmp2 != NULL)
1.4 stevesk 70: fatal("mm_make_entry(%p): double address %p->%p(%lu)",
71: mm, tmp2, address, (u_long)size);
1.1 provos 72:
73: return (tmp);
74: }
75:
76: /* Creates a shared memory area of a certain size */
77:
78: struct mm_master *
79: mm_create(struct mm_master *mmalloc, size_t size)
80: {
81: void *address;
82: struct mm_master *mm;
83:
84: if (mmalloc == NULL)
85: mm = xmalloc(sizeof(struct mm_master));
86: else
87: mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
88:
1.3 markus 89: /*
1.1 provos 90: * If the memory map has a mm_master it can be completely
91: * shared including authentication between the child
92: * and the client.
93: */
94: mm->mmalloc = mmalloc;
95:
96: address = mmap(NULL, size, PROT_WRITE|PROT_READ, MAP_ANON|MAP_SHARED,
1.9 deraadt 97: -1, (off_t)0);
1.1 provos 98: if (address == MAP_FAILED)
1.5 stevesk 99: fatal("mmap(%lu): %s", (u_long)size, strerror(errno));
1.1 provos 100:
101: mm->address = address;
102: mm->size = size;
103:
104: RB_INIT(&mm->rb_free);
105: RB_INIT(&mm->rb_allocated);
106:
107: mm_make_entry(mm, &mm->rb_free, address, size);
108:
109: return (mm);
110: }
111:
112: /* Frees either the allocated or the free list */
113:
1.2 markus 114: static void
1.1 provos 115: mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
116: {
117: struct mm_share *mms, *next;
118:
119: for (mms = RB_ROOT(head); mms; mms = next) {
120: next = RB_NEXT(mmtree, head, mms);
121: RB_REMOVE(mmtree, head, mms);
122: if (mmalloc == NULL)
123: xfree(mms);
124: else
125: mm_free(mmalloc, mms);
126: }
127: }
128:
129: /* Destroys a memory mapped area */
130:
131: void
132: mm_destroy(struct mm_master *mm)
133: {
134: mm_freelist(mm->mmalloc, &mm->rb_free);
135: mm_freelist(mm->mmalloc, &mm->rb_allocated);
136:
137: if (munmap(mm->address, mm->size) == -1)
1.5 stevesk 138: fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
139: strerror(errno));
1.1 provos 140: if (mm->mmalloc == NULL)
141: xfree(mm);
142: else
143: mm_free(mm->mmalloc, mm);
144: }
145:
146: void *
147: mm_xmalloc(struct mm_master *mm, size_t size)
148: {
149: void *address;
150:
151: address = mm_malloc(mm, size);
152: if (address == NULL)
1.6 markus 153: fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
1.1 provos 154: return (address);
155: }
156:
157:
158: /* Allocates data from a memory mapped area */
159:
160: void *
161: mm_malloc(struct mm_master *mm, size_t size)
162: {
163: struct mm_share *mms, *tmp;
164:
165: if (size == 0)
166: fatal("mm_malloc: try to allocate 0 space");
1.8 millert 167: if (size > SIZE_T_MAX - MM_MINSIZE + 1)
168: fatal("mm_malloc: size too big");
1.1 provos 169:
1.8 millert 170: size = ((size + (MM_MINSIZE - 1)) / MM_MINSIZE) * MM_MINSIZE;
1.1 provos 171:
172: RB_FOREACH(mms, mmtree, &mm->rb_free) {
173: if (mms->size >= size)
174: break;
175: }
176:
177: if (mms == NULL)
178: return (NULL);
179:
1.3 markus 180: /* Debug */
1.1 provos 181: memset(mms->address, 0xd0, size);
182:
183: tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
184:
185: /* Does not change order in RB tree */
186: mms->size -= size;
187: mms->address = (u_char *)mms->address + size;
188:
189: if (mms->size == 0) {
190: RB_REMOVE(mmtree, &mm->rb_free, mms);
191: if (mm->mmalloc == NULL)
192: xfree(mms);
193: else
194: mm_free(mm->mmalloc, mms);
195: }
196:
197: return (tmp->address);
198: }
199:
200: /* Frees memory in a memory mapped area */
201:
202: void
203: mm_free(struct mm_master *mm, void *address)
204: {
205: struct mm_share *mms, *prev, tmp;
206:
207: tmp.address = address;
208: mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
209: if (mms == NULL)
210: fatal("mm_free(%p): can not find %p", mm, address);
211:
1.3 markus 212: /* Debug */
1.1 provos 213: memset(mms->address, 0xd0, mms->size);
214:
215: /* Remove from allocated list and insert in free list */
216: RB_REMOVE(mmtree, &mm->rb_allocated, mms);
217: if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
218: fatal("mm_free(%p): double address %p", mm, address);
219:
220: /* Find previous entry */
221: prev = mms;
222: if (RB_LEFT(prev, next)) {
223: prev = RB_LEFT(prev, next);
224: while (RB_RIGHT(prev, next))
225: prev = RB_RIGHT(prev, next);
226: } else {
227: if (RB_PARENT(prev, next) &&
228: (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
229: prev = RB_PARENT(prev, next);
230: else {
231: while (RB_PARENT(prev, next) &&
232: (prev == RB_LEFT(RB_PARENT(prev, next), next)))
233: prev = RB_PARENT(prev, next);
234: prev = RB_PARENT(prev, next);
235: }
236: }
237:
238: /* Check if range does not overlap */
239: if (prev != NULL && MM_ADDRESS_END(prev) > address)
1.4 stevesk 240: fatal("mm_free: memory corruption: %p(%lu) > %p",
241: prev->address, (u_long)prev->size, address);
1.1 provos 242:
243: /* See if we can merge backwards */
244: if (prev != NULL && MM_ADDRESS_END(prev) == address) {
245: prev->size += mms->size;
246: RB_REMOVE(mmtree, &mm->rb_free, mms);
247: if (mm->mmalloc == NULL)
248: xfree(mms);
249: else
250: mm_free(mm->mmalloc, mms);
251: } else
252: prev = mms;
253:
254: if (prev == NULL)
255: return;
256:
257: /* Check if we can merge forwards */
258: mms = RB_NEXT(mmtree, &mm->rb_free, prev);
259: if (mms == NULL)
260: return;
261:
262: if (MM_ADDRESS_END(prev) > mms->address)
1.4 stevesk 263: fatal("mm_free: memory corruption: %p < %p(%lu)",
264: mms->address, prev->address, (u_long)prev->size);
1.1 provos 265: if (MM_ADDRESS_END(prev) != mms->address)
266: return;
267:
268: prev->size += mms->size;
269: RB_REMOVE(mmtree, &mm->rb_free, mms);
270:
271: if (mm->mmalloc == NULL)
272: xfree(mms);
273: else
274: mm_free(mm->mmalloc, mms);
275: }
276:
1.2 markus 277: static void
1.1 provos 278: mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
279: struct mm_master *mm, struct mm_master *mmold)
280: {
281: struct mm_master *mmalloc = mm->mmalloc;
282: struct mm_share *mms, *new;
283:
284: /* Sync free list */
285: RB_FOREACH(mms, mmtree, oldtree) {
286: /* Check the values */
287: mm_memvalid(mmold, mms, sizeof(struct mm_share));
288: mm_memvalid(mm, mms->address, mms->size);
289:
290: new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
291: memcpy(new, mms, sizeof(struct mm_share));
292: RB_INSERT(mmtree, newtree, new);
293: }
294: }
295:
296: void
297: mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
298: {
299: struct mm_master *mm;
300: struct mm_master *mmalloc;
301: struct mm_master *mmold;
302: struct mmtree rb_free, rb_allocated;
303:
1.6 markus 304: debug3("%s: Share sync", __func__);
1.1 provos 305:
306: mm = *pmm;
307: mmold = mm->mmalloc;
308: mm_memvalid(mmold, mm, sizeof(*mm));
309:
310: mmalloc = mm_create(NULL, mm->size);
311: mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
312: memcpy(mm, *pmm, sizeof(struct mm_master));
313: mm->mmalloc = mmalloc;
314:
315: rb_free = mm->rb_free;
316: rb_allocated = mm->rb_allocated;
317:
318: RB_INIT(&mm->rb_free);
319: RB_INIT(&mm->rb_allocated);
320:
321: mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
322: mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
323:
324: mm_destroy(mmold);
325:
326: *pmm = mm;
327: *pmmalloc = mmalloc;
328:
1.6 markus 329: debug3("%s: Share sync end", __func__);
1.1 provos 330: }
331:
332: void
333: mm_memvalid(struct mm_master *mm, void *address, size_t size)
334: {
335: void *end = (u_char *)address + size;
336:
337: if (address < mm->address)
338: fatal("mm_memvalid: address too small: %p", address);
339: if (end < address)
340: fatal("mm_memvalid: end < address: %p < %p", end, address);
341: if (end > (void *)((u_char *)mm->address + mm->size))
342: fatal("mm_memvalid: address too large: %p", address);
343: }
![[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