]>
Commit | Line | Data |
---|---|---|
1c79356b A |
1 | /* |
2 | * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
6 | * The contents of this file constitute Original Code as defined in and | |
7 | * are subject to the Apple Public Source License Version 1.1 (the | |
8 | * "License"). You may not use this file except in compliance with the | |
9 | * License. Please obtain a copy of the License at | |
10 | * http://www.apple.com/publicsource and read it before using this file. | |
11 | * | |
12 | * This Original Code and all software distributed under the License are | |
13 | * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
14 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
15 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
16 | * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the | |
17 | * License for the specific language governing rights and limitations | |
18 | * under the License. | |
19 | * | |
20 | * @APPLE_LICENSE_HEADER_END@ | |
21 | */ | |
22 | /* | |
23 | * @OSF_COPYRIGHT@ | |
24 | */ | |
25 | /* | |
26 | * Mach Operating System | |
27 | * Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University | |
28 | * All Rights Reserved. | |
29 | * | |
30 | * Permission to use, copy, modify and distribute this software and its | |
31 | * documentation is hereby granted, provided that both the copyright | |
32 | * notice and this permission notice appear in all copies of the | |
33 | * software, derivative works or modified versions, and any portions | |
34 | * thereof, and that both notices appear in supporting documentation. | |
35 | * | |
36 | * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" | |
37 | * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR | |
38 | * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. | |
39 | * | |
40 | * Carnegie Mellon requests users of this software to return to | |
41 | * | |
42 | * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU | |
43 | * School of Computer Science | |
44 | * Carnegie Mellon University | |
45 | * Pittsburgh PA 15213-3890 | |
46 | * | |
47 | * any improvements or extensions that they make and grant Carnegie Mellon | |
48 | * the rights to redistribute these changes. | |
49 | */ | |
50 | /* | |
51 | */ | |
52 | /* | |
53 | * File: zalloc.h | |
54 | * Author: Avadis Tevanian, Jr. | |
55 | * Date: 1985 | |
56 | * | |
57 | */ | |
58 | ||
59 | #ifndef _KERN_ZALLOC_H_ | |
60 | #define _KERN_ZALLOC_H_ | |
61 | ||
62 | #include <mach/machine/vm_types.h> | |
63 | #include <kern/kern_types.h> | |
64 | ||
65 | #ifdef MACH_KERNEL_PRIVATE | |
66 | #include <zone_debug.h> | |
67 | #include <mach_kdb.h> | |
68 | #include <kern/lock.h> | |
69 | #include <kern/queue.h> | |
0b4e3aa0 | 70 | #include <kern/call_entry.h> |
1c79356b A |
71 | |
72 | /* | |
73 | * A zone is a collection of fixed size blocks for which there | |
74 | * is fast allocation/deallocation access. Kernel routines can | |
75 | * use zones to manage data structures dynamically, creating a zone | |
76 | * for each type of data structure to be managed. | |
77 | * | |
78 | */ | |
79 | ||
80 | struct zone { | |
81 | int count; /* Number of elements used now */ | |
82 | vm_offset_t free_elements; | |
83 | vm_size_t cur_size; /* current memory utilization */ | |
84 | vm_size_t max_size; /* how large can this zone grow */ | |
85 | vm_size_t elem_size; /* size of an element */ | |
86 | vm_size_t alloc_size; /* size used for more memory */ | |
87 | char *zone_name; /* a name for the zone */ | |
88 | unsigned int | |
89 | /* boolean_t */ exhaustible :1, /* (F) merely return if empty? */ | |
90 | /* boolean_t */ collectable :1, /* (F) garbage collect empty pages */ | |
91 | /* boolean_t */ expandable :1, /* (T) expand zone (with message)? */ | |
92 | /* boolean_t */ allows_foreign :1,/* (F) allow non-zalloc space */ | |
93 | /* boolean_t */ doing_alloc :1, /* is zone expanding now? */ | |
0b4e3aa0 A |
94 | /* boolean_t */ waiting :1, /* is thread waiting for expansion? */ |
95 | /* boolean_t */ async_pending :1; /* asynchronous allocation pending? */ | |
1c79356b | 96 | struct zone * next_zone; /* Link for all-zones list */ |
0b4e3aa0 | 97 | call_entry_data_t call_async_alloc; /* callout for asynchronous alloc */ |
1c79356b A |
98 | #if ZONE_DEBUG |
99 | queue_head_t active_zones; /* active elements */ | |
100 | #endif /* ZONE_DEBUG */ | |
101 | decl_simple_lock_data(,lock) /* generic lock */ | |
102 | }; | |
103 | ||
104 | ||
105 | extern void zone_gc(void); | |
106 | extern void consider_zone_gc(void); | |
107 | ||
108 | /* Steal memory for zone module */ | |
109 | extern void zone_steal_memory(void); | |
110 | ||
111 | /* Bootstrap zone module (create zone zone) */ | |
112 | extern void zone_bootstrap(void); | |
113 | ||
114 | /* Init zone module */ | |
115 | extern void zone_init(vm_size_t); | |
116 | ||
117 | #endif /* ! MACH_KERNEL_PRIVATE */ | |
118 | ||
119 | ||
120 | /* Allocate from zone */ | |
121 | extern vm_offset_t zalloc( | |
122 | zone_t zone); | |
123 | ||
124 | /* Non-blocking version of zalloc */ | |
125 | extern vm_offset_t zalloc_noblock( | |
126 | zone_t zone); | |
127 | ||
128 | /* Get from zone free list */ | |
129 | extern vm_offset_t zget( | |
130 | zone_t zone); | |
131 | ||
132 | /* Create zone */ | |
133 | extern zone_t zinit( | |
134 | vm_size_t size, /* the size of an element */ | |
135 | vm_size_t max, /* maximum memory to use */ | |
136 | vm_size_t alloc, /* allocation size */ | |
137 | char *name); /* a name for the zone */ | |
138 | ||
139 | /* Free zone element */ | |
140 | extern void zfree( | |
141 | zone_t zone, | |
142 | vm_offset_t elem); | |
143 | ||
144 | /* Fill zone with memory */ | |
145 | extern void zcram( | |
146 | zone_t zone, | |
147 | vm_offset_t newmem, | |
148 | vm_size_t size); | |
149 | ||
150 | /* Initially fill zone with specified number of elements */ | |
151 | extern int zfill( | |
152 | zone_t zone, | |
153 | int nelem); | |
154 | /* Change zone parameters */ | |
155 | extern void zone_change( | |
156 | zone_t zone, | |
157 | unsigned int item, | |
158 | boolean_t value); | |
159 | ||
160 | /* Preallocate space for zone from zone map */ | |
161 | extern void zprealloc( | |
162 | zone_t zone, | |
163 | vm_size_t size); | |
164 | ||
165 | /* | |
166 | * zone_free_count returns a hint as to the current number of free elements | |
167 | * in the zone. By the time it returns, it may no longer be true (a new | |
168 | * element might have been added, or an element removed). | |
169 | * This routine may be used in conjunction with zcram and a lock to regulate | |
170 | * adding memory to a non-expandable zone. | |
171 | */ | |
172 | extern integer_t zone_free_count(zone_t zone); | |
173 | ||
174 | /* | |
175 | * Item definitions for zone_change: | |
176 | */ | |
177 | #define Z_EXHAUST 1 /* Make zone exhaustible */ | |
178 | #define Z_COLLECT 2 /* Make zone collectable */ | |
179 | #define Z_EXPAND 3 /* Make zone expandable */ | |
180 | #define Z_FOREIGN 4 /* Allow collectable zone to contain foreign */ | |
181 | /* (not allocated via zalloc) elements. */ | |
182 | #ifdef MACH_KERNEL_PRIVATE | |
183 | #if ZONE_DEBUG | |
184 | #if MACH_KDB | |
185 | extern vm_offset_t next_element( | |
186 | zone_t z, | |
187 | vm_offset_t elt); | |
188 | ||
189 | extern vm_offset_t first_element( | |
190 | zone_t z); | |
191 | #endif /* MACH_KDB */ | |
192 | extern void zone_debug_enable( | |
193 | zone_t z); | |
194 | ||
195 | extern void zone_debug_disable( | |
196 | zone_t z); | |
197 | #endif /* ZONE_DEBUG */ | |
198 | #endif MACH_KERNEL_PRIVATE | |
199 | ||
200 | #endif /* _KERN_ZALLOC_H_ */ |