blob: e8de71fea099103c5a47f0b5256a8305fc997446 [file] [log] [blame]
Ben Lindstrom7a2073c2002-03-22 02:30:41 +00001/*
2 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
13 *
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.
24 */
25
26#include "includes.h"
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000027
Kevin Steves86b9fe62002-04-07 17:08:53 +000028#ifdef HAVE_SYS_MMAN_H
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000029#include <sys/mman.h>
Kevin Steves86b9fe62002-04-07 17:08:53 +000030#endif
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000031
32#include "ssh.h"
33#include "xmalloc.h"
34#include "log.h"
35#include "monitor_mm.h"
36
37static int
38mm_compare(struct mm_share *a, struct mm_share *b)
39{
Ben Lindstroma7961622002-07-04 00:08:23 +000040 long diff = (char *)a->address - (char *)b->address;
41
42 if (diff == 0)
43 return (0);
44 else if (diff < 0)
45 return (-1);
46 else
47 return (1);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000048}
49
50RB_GENERATE(mmtree, mm_share, next, mm_compare)
51
52static struct mm_share *
53mm_make_entry(struct mm_master *mm, struct mmtree *head,
54 void *address, size_t size)
55{
56 struct mm_share *tmp, *tmp2;
57
58 if (mm->mmalloc == NULL)
59 tmp = xmalloc(sizeof(struct mm_share));
60 else
61 tmp = mm_xmalloc(mm->mmalloc, sizeof(struct mm_share));
62 tmp->address = address;
63 tmp->size = size;
64
65 tmp2 = RB_INSERT(mmtree, head, tmp);
66 if (tmp2 != NULL)
Ben Lindstromc8615472002-03-26 03:20:45 +000067 fatal("mm_make_entry(%p): double address %p->%p(%lu)",
68 mm, tmp2, address, (u_long)size);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000069
70 return (tmp);
71}
72
73/* Creates a shared memory area of a certain size */
74
75struct mm_master *
76mm_create(struct mm_master *mmalloc, size_t size)
77{
78 void *address;
79 struct mm_master *mm;
80
81 if (mmalloc == NULL)
82 mm = xmalloc(sizeof(struct mm_master));
83 else
84 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
85
86 /*
87 * If the memory map has a mm_master it can be completely
88 * shared including authentication between the child
89 * and the client.
90 */
91 mm->mmalloc = mmalloc;
92
Tim Rice40017b02002-07-14 13:36:49 -070093 address = xmmap(size);
Darren Tuckerdbc22962004-10-06 23:15:44 +100094 if (address == (void *)MAP_FAILED)
Ben Lindstroma95fd3f2002-06-26 00:22:57 +000095 fatal("mmap(%lu): %s", (u_long)size, strerror(errno));
Ben Lindstrom7a2073c2002-03-22 02:30:41 +000096
97 mm->address = address;
98 mm->size = size;
99
100 RB_INIT(&mm->rb_free);
101 RB_INIT(&mm->rb_allocated);
102
103 mm_make_entry(mm, &mm->rb_free, address, size);
104
105 return (mm);
106}
107
108/* Frees either the allocated or the free list */
109
110static void
111mm_freelist(struct mm_master *mmalloc, struct mmtree *head)
112{
113 struct mm_share *mms, *next;
114
115 for (mms = RB_ROOT(head); mms; mms = next) {
116 next = RB_NEXT(mmtree, head, mms);
117 RB_REMOVE(mmtree, head, mms);
118 if (mmalloc == NULL)
119 xfree(mms);
120 else
121 mm_free(mmalloc, mms);
122 }
123}
124
125/* Destroys a memory mapped area */
126
127void
128mm_destroy(struct mm_master *mm)
129{
130 mm_freelist(mm->mmalloc, &mm->rb_free);
131 mm_freelist(mm->mmalloc, &mm->rb_allocated);
132
Tim Rice40017b02002-07-14 13:36:49 -0700133#ifdef HAVE_MMAP
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000134 if (munmap(mm->address, mm->size) == -1)
Ben Lindstrom4eeccc72002-06-07 01:57:25 +0000135 fatal("munmap(%p, %lu): %s", mm->address, (u_long)mm->size,
Ben Lindstrom105ccbe2002-06-06 20:33:06 +0000136 strerror(errno));
Kevin Steves265c9d02002-04-07 22:36:49 +0000137#else
Ben Lindstrom4e3c6312002-06-26 00:29:02 +0000138 fatal("%s: UsePrivilegeSeparation=yes and Compression=yes not supported",
Ben Lindstrom7d9c38f2002-06-06 21:40:51 +0000139 __func__);
Kevin Steves265c9d02002-04-07 22:36:49 +0000140#endif
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000141 if (mm->mmalloc == NULL)
142 xfree(mm);
143 else
144 mm_free(mm->mmalloc, mm);
145}
146
147void *
148mm_xmalloc(struct mm_master *mm, size_t size)
149{
150 void *address;
151
152 address = mm_malloc(mm, size);
153 if (address == NULL)
Ben Lindstrom7d9c38f2002-06-06 21:40:51 +0000154 fatal("%s: mm_malloc(%lu)", __func__, (u_long)size);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000155 return (address);
156}
157
158
159/* Allocates data from a memory mapped area */
160
161void *
162mm_malloc(struct mm_master *mm, size_t size)
163{
164 struct mm_share *mms, *tmp;
165
166 if (size == 0)
167 fatal("mm_malloc: try to allocate 0 space");
Ben Lindstrom0a4f7542002-08-20 18:36:25 +0000168 if (size > SIZE_T_MAX - MM_MINSIZE + 1)
169 fatal("mm_malloc: size too big");
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000170
Ben Lindstrom0a4f7542002-08-20 18:36:25 +0000171 size = ((size + (MM_MINSIZE - 1)) / MM_MINSIZE) * MM_MINSIZE;
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000172
173 RB_FOREACH(mms, mmtree, &mm->rb_free) {
174 if (mms->size >= size)
175 break;
176 }
177
178 if (mms == NULL)
179 return (NULL);
180
181 /* Debug */
182 memset(mms->address, 0xd0, size);
183
184 tmp = mm_make_entry(mm, &mm->rb_allocated, mms->address, size);
185
186 /* Does not change order in RB tree */
187 mms->size -= size;
188 mms->address = (u_char *)mms->address + size;
189
190 if (mms->size == 0) {
191 RB_REMOVE(mmtree, &mm->rb_free, mms);
192 if (mm->mmalloc == NULL)
193 xfree(mms);
194 else
195 mm_free(mm->mmalloc, mms);
196 }
197
198 return (tmp->address);
199}
200
201/* Frees memory in a memory mapped area */
202
203void
204mm_free(struct mm_master *mm, void *address)
205{
206 struct mm_share *mms, *prev, tmp;
207
208 tmp.address = address;
209 mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);
210 if (mms == NULL)
211 fatal("mm_free(%p): can not find %p", mm, address);
212
213 /* Debug */
214 memset(mms->address, 0xd0, mms->size);
215
216 /* Remove from allocated list and insert in free list */
217 RB_REMOVE(mmtree, &mm->rb_allocated, mms);
218 if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)
219 fatal("mm_free(%p): double address %p", mm, address);
220
221 /* Find previous entry */
222 prev = mms;
223 if (RB_LEFT(prev, next)) {
224 prev = RB_LEFT(prev, next);
225 while (RB_RIGHT(prev, next))
226 prev = RB_RIGHT(prev, next);
227 } else {
228 if (RB_PARENT(prev, next) &&
229 (prev == RB_RIGHT(RB_PARENT(prev, next), next)))
230 prev = RB_PARENT(prev, next);
231 else {
232 while (RB_PARENT(prev, next) &&
233 (prev == RB_LEFT(RB_PARENT(prev, next), next)))
234 prev = RB_PARENT(prev, next);
235 prev = RB_PARENT(prev, next);
236 }
237 }
238
239 /* Check if range does not overlap */
240 if (prev != NULL && MM_ADDRESS_END(prev) > address)
Ben Lindstromc8615472002-03-26 03:20:45 +0000241 fatal("mm_free: memory corruption: %p(%lu) > %p",
242 prev->address, (u_long)prev->size, address);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000243
244 /* See if we can merge backwards */
245 if (prev != NULL && MM_ADDRESS_END(prev) == address) {
246 prev->size += mms->size;
247 RB_REMOVE(mmtree, &mm->rb_free, mms);
248 if (mm->mmalloc == NULL)
249 xfree(mms);
250 else
251 mm_free(mm->mmalloc, mms);
252 } else
253 prev = mms;
254
255 if (prev == NULL)
256 return;
257
258 /* Check if we can merge forwards */
259 mms = RB_NEXT(mmtree, &mm->rb_free, prev);
260 if (mms == NULL)
261 return;
262
263 if (MM_ADDRESS_END(prev) > mms->address)
Ben Lindstromc8615472002-03-26 03:20:45 +0000264 fatal("mm_free: memory corruption: %p < %p(%lu)",
265 mms->address, prev->address, (u_long)prev->size);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000266 if (MM_ADDRESS_END(prev) != mms->address)
267 return;
268
269 prev->size += mms->size;
270 RB_REMOVE(mmtree, &mm->rb_free, mms);
271
272 if (mm->mmalloc == NULL)
273 xfree(mms);
274 else
275 mm_free(mm->mmalloc, mms);
276}
277
278static void
279mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,
280 struct mm_master *mm, struct mm_master *mmold)
281{
282 struct mm_master *mmalloc = mm->mmalloc;
283 struct mm_share *mms, *new;
284
285 /* Sync free list */
286 RB_FOREACH(mms, mmtree, oldtree) {
287 /* Check the values */
288 mm_memvalid(mmold, mms, sizeof(struct mm_share));
289 mm_memvalid(mm, mms->address, mms->size);
290
291 new = mm_xmalloc(mmalloc, sizeof(struct mm_share));
292 memcpy(new, mms, sizeof(struct mm_share));
293 RB_INSERT(mmtree, newtree, new);
294 }
295}
296
297void
298mm_share_sync(struct mm_master **pmm, struct mm_master **pmmalloc)
299{
300 struct mm_master *mm;
301 struct mm_master *mmalloc;
302 struct mm_master *mmold;
303 struct mmtree rb_free, rb_allocated;
304
Ben Lindstrom7d9c38f2002-06-06 21:40:51 +0000305 debug3("%s: Share sync", __func__);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000306
307 mm = *pmm;
308 mmold = mm->mmalloc;
309 mm_memvalid(mmold, mm, sizeof(*mm));
310
311 mmalloc = mm_create(NULL, mm->size);
312 mm = mm_xmalloc(mmalloc, sizeof(struct mm_master));
313 memcpy(mm, *pmm, sizeof(struct mm_master));
314 mm->mmalloc = mmalloc;
315
316 rb_free = mm->rb_free;
317 rb_allocated = mm->rb_allocated;
318
319 RB_INIT(&mm->rb_free);
320 RB_INIT(&mm->rb_allocated);
321
322 mm_sync_list(&rb_free, &mm->rb_free, mm, mmold);
323 mm_sync_list(&rb_allocated, &mm->rb_allocated, mm, mmold);
324
325 mm_destroy(mmold);
326
327 *pmm = mm;
328 *pmmalloc = mmalloc;
329
Ben Lindstrom7d9c38f2002-06-06 21:40:51 +0000330 debug3("%s: Share sync end", __func__);
Ben Lindstrom7a2073c2002-03-22 02:30:41 +0000331}
332
333void
334mm_memvalid(struct mm_master *mm, void *address, size_t size)
335{
336 void *end = (u_char *)address + size;
337
338 if (address < mm->address)
339 fatal("mm_memvalid: address too small: %p", address);
340 if (end < address)
341 fatal("mm_memvalid: end < address: %p < %p", end, address);
342 if (end > (void *)((u_char *)mm->address + mm->size))
343 fatal("mm_memvalid: address too large: %p", address);
344}