Damien Miller | 5109638 | 2006-03-26 14:30:00 +1100 | [diff] [blame] | 1 | /* $OpenBSD: monitor_mm.h,v 1.3 2006/03/25 22:22:43 djm Exp $ */ |
Ben Lindstrom | 28364ec | 2002-03-26 03:42:20 +0000 | [diff] [blame] | 2 | |
Ben Lindstrom | 7a2073c | 2002-03-22 02:30:41 +0000 | [diff] [blame] | 3 | /* |
| 4 | * Copyright 2002 Niels Provos <provos@citi.umich.edu> |
| 5 | * All rights reserved. |
| 6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, this list of conditions and the following disclaimer. |
| 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| 13 | * notice, this list of conditions and the following disclaimer in the |
| 14 | * documentation and/or other materials provided with the distribution. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| 17 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 18 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| 19 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| 20 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| 21 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 22 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 23 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 24 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| 25 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #ifndef _MM_H_ |
| 29 | #define _MM_H_ |
Damien Miller | 9b48151 | 2002-09-12 10:43:29 +1000 | [diff] [blame] | 30 | #include "openbsd-compat/sys-tree.h" |
Ben Lindstrom | 7a2073c | 2002-03-22 02:30:41 +0000 | [diff] [blame] | 31 | |
| 32 | struct mm_share { |
| 33 | RB_ENTRY(mm_share) next; |
| 34 | void *address; |
| 35 | size_t size; |
| 36 | }; |
| 37 | |
| 38 | struct mm_master { |
| 39 | RB_HEAD(mmtree, mm_share) rb_free; |
| 40 | struct mmtree rb_allocated; |
| 41 | void *address; |
| 42 | size_t size; |
| 43 | |
| 44 | struct mm_master *mmalloc; /* Used to completely share */ |
| 45 | |
| 46 | int write; /* used to writing to other party */ |
| 47 | int read; /* used for reading from other party */ |
| 48 | }; |
| 49 | |
| 50 | RB_PROTOTYPE(mmtree, mm_share, next, mm_compare) |
| 51 | |
| 52 | #define MM_MINSIZE 128 |
| 53 | |
| 54 | #define MM_ADDRESS_END(x) (void *)((u_char *)(x)->address + (x)->size) |
| 55 | |
| 56 | struct mm_master *mm_create(struct mm_master *, size_t); |
| 57 | void mm_destroy(struct mm_master *); |
| 58 | |
| 59 | void mm_share_sync(struct mm_master **, struct mm_master **); |
| 60 | |
| 61 | void *mm_malloc(struct mm_master *, size_t); |
| 62 | void *mm_xmalloc(struct mm_master *, size_t); |
| 63 | void mm_free(struct mm_master *, void *); |
| 64 | |
| 65 | void mm_memvalid(struct mm_master *, void *, size_t); |
| 66 | #endif /* _MM_H_ */ |