zalloc_mem.h (39665) | zalloc_mem.h (39863) |
---|---|
1/* 2 * This module derived from code donated to the FreeBSD Project by 3 * Matthew Dillon <dillon@backplane.com> 4 * 5 * Copyright (c) 1998 The FreeBSD Project 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 12 unchanged lines hidden (view full) --- 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * | 1/* 2 * This module derived from code donated to the FreeBSD Project by 3 * Matthew Dillon <dillon@backplane.com> 4 * 5 * Copyright (c) 1998 The FreeBSD Project 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 12 unchanged lines hidden (view full) --- 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * |
29 * $Id$ | 29 * $Id: zalloc_mem.h,v 1.1 1998/09/26 01:42:39 msmith Exp $ |
30 */ 31 32/* 33 * H/MEM.H 34 * 35 * Basic memory pool / memory node structures. 36 */ 37 38typedef struct MemNode { 39 struct MemNode *mr_Next; 40 iaddr_t mr_Bytes; 41} MemNode; 42 43typedef struct MemPool { | 30 */ 31 32/* 33 * H/MEM.H 34 * 35 * Basic memory pool / memory node structures. 36 */ 37 38typedef struct MemNode { 39 struct MemNode *mr_Next; 40 iaddr_t mr_Bytes; 41} MemNode; 42 43typedef struct MemPool { |
44 const char *mp_Ident; | |
45 void *mp_Base; 46 void *mp_End; 47 MemNode *mp_First; | 44 void *mp_Base; 45 void *mp_End; 46 MemNode *mp_First; |
48 void (*mp_Panic)(const char *ctl, ...); 49 int (*mp_Reclaim)(struct MemPool *memPool, iaddr_t bytes); | |
50 iaddr_t mp_Size; 51 iaddr_t mp_Used; 52} MemPool; 53 54#define MEMNODE_SIZE_MASK ((sizeof(MemNode) <= 8) ? 7 : 15) 55 | 47 iaddr_t mp_Size; 48 iaddr_t mp_Used; 49} MemPool; 50 51#define MEMNODE_SIZE_MASK ((sizeof(MemNode) <= 8) ? 7 : 15) 52 |
56#define INITPOOL(name,panic,reclaim) { name, NULL, NULL, NULL, panic, reclaim } 57 | |
58#define ZNOTE_FREE 0 59#define ZNOTE_REUSE 1 60 | 53#define ZNOTE_FREE 0 54#define ZNOTE_REUSE 1 55 |