master
1/*-
2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
3 *
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * @(#)vm_map.h 8.9 (Berkeley) 5/17/95
35 *
36 *
37 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38 * All rights reserved.
39 *
40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
41 *
42 * Permission to use, copy, modify and distribute this software and
43 * its documentation is hereby granted, provided that both the copyright
44 * notice and this permission notice appear in all copies of the
45 * software, derivative works or modified versions, and any portions
46 * thereof, and that both notices appear in supporting documentation.
47 *
48 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
49 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
50 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
51 *
52 * Carnegie Mellon requests users of this software to return to
53 *
54 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
55 * School of Computer Science
56 * Carnegie Mellon University
57 * Pittsburgh PA 15213-3890
58 *
59 * any improvements or extensions that they make and grant Carnegie the
60 * rights to redistribute these changes.
61 */
62
63/*
64 * Virtual memory map module definitions.
65 */
66#ifndef _VM_MAP_
67#define _VM_MAP_
68
69#include <sys/lock.h>
70#include <sys/sx.h>
71#include <sys/_mutex.h>
72
73/*
74 * Types defined:
75 *
76 * vm_map_t the high-level address map data structure.
77 * vm_map_entry_t an entry in an address map.
78 */
79
80typedef u_char vm_flags_t;
81typedef u_int vm_eflags_t;
82
83/*
84 * Objects which live in maps may be either VM objects, or
85 * another map (called a "sharing map") which denotes read-write
86 * sharing with other maps.
87 */
88union vm_map_object {
89 struct vm_object *vm_object; /* object object */
90 struct vm_map *sub_map; /* belongs to another map */
91};
92
93/*
94 * Address map entries consist of start and end addresses,
95 * a VM object (or sharing map) and offset into that object,
96 * and user-exported inheritance and protection information.
97 * Also included is control information for virtual copy operations.
98 *
99 * For stack gap map entries (MAP_ENTRY_GUARD | MAP_ENTRY_GROWS_DOWN
100 * or UP), the next_read member is reused as the stack_guard_page
101 * storage, and offset is the stack protection.
102 */
103struct vm_map_entry {
104 struct vm_map_entry *left; /* left child or previous entry */
105 struct vm_map_entry *right; /* right child or next entry */
106 vm_offset_t start; /* start address */
107 vm_offset_t end; /* end address */
108 vm_offset_t next_read; /* vaddr of the next sequential read */
109 vm_size_t max_free; /* max free space in subtree */
110 union vm_map_object object; /* object I point to */
111 vm_ooffset_t offset; /* offset into object */
112 vm_eflags_t eflags; /* map entry flags */
113 vm_prot_t protection; /* protection code */
114 vm_prot_t max_protection; /* maximum protection */
115 vm_inherit_t inheritance; /* inheritance */
116 uint8_t read_ahead; /* pages in the read-ahead window */
117 int wired_count; /* can be paged if = 0 */
118 struct ucred *cred; /* tmp storage for creator ref */
119 struct thread *wiring_thread;
120};
121
122#define MAP_ENTRY_NOSYNC 0x00000001
123#define MAP_ENTRY_IS_SUB_MAP 0x00000002
124#define MAP_ENTRY_COW 0x00000004
125#define MAP_ENTRY_NEEDS_COPY 0x00000008
126#define MAP_ENTRY_NOFAULT 0x00000010
127#define MAP_ENTRY_USER_WIRED 0x00000020
128
129#define MAP_ENTRY_BEHAV_NORMAL 0x00000000 /* default behavior */
130#define MAP_ENTRY_BEHAV_SEQUENTIAL 0x00000040 /* expect sequential
131 access */
132#define MAP_ENTRY_BEHAV_RANDOM 0x00000080 /* expect random
133 access */
134#define MAP_ENTRY_BEHAV_RESERVED 0x000000c0 /* future use */
135#define MAP_ENTRY_BEHAV_MASK 0x000000c0
136#define MAP_ENTRY_IN_TRANSITION 0x00000100 /* entry being
137 changed */
138#define MAP_ENTRY_NEEDS_WAKEUP 0x00000200 /* waiters in
139 transition */
140#define MAP_ENTRY_NOCOREDUMP 0x00000400 /* don't include in
141 a core */
142#define MAP_ENTRY_VN_EXEC 0x00000800 /* text vnode mapping */
143#define MAP_ENTRY_GROWS_DOWN 0x00001000 /* top-down stacks */
144#define MAP_ENTRY_GROWS_UP 0x00002000 /* bottom-up stacks */
145
146#define MAP_ENTRY_WIRE_SKIPPED 0x00004000
147#define MAP_ENTRY_WRITECNT 0x00008000 /* tracked writeable
148 mapping */
149#define MAP_ENTRY_GUARD 0x00010000
150#define MAP_ENTRY_STACK_GAP_DN 0x00020000
151#define MAP_ENTRY_STACK_GAP_UP 0x00040000
152#define MAP_ENTRY_HEADER 0x00080000
153
154#define MAP_ENTRY_SPLIT_BOUNDARY_MASK 0x00300000
155#define MAP_ENTRY_SPLIT_BOUNDARY_SHIFT 20
156#define MAP_ENTRY_SPLIT_BOUNDARY_INDEX(entry) \
157 (((entry)->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK) >> \
158 MAP_ENTRY_SPLIT_BOUNDARY_SHIFT)
159
160#ifdef _KERNEL
161static __inline u_char
162vm_map_entry_behavior(vm_map_entry_t entry)
163{
164 return (entry->eflags & MAP_ENTRY_BEHAV_MASK);
165}
166
167static __inline int
168vm_map_entry_user_wired_count(vm_map_entry_t entry)
169{
170 if (entry->eflags & MAP_ENTRY_USER_WIRED)
171 return (1);
172 return (0);
173}
174
175static __inline int
176vm_map_entry_system_wired_count(vm_map_entry_t entry)
177{
178 return (entry->wired_count - vm_map_entry_user_wired_count(entry));
179}
180#endif /* _KERNEL */
181
182/*
183 * A map is a set of map entries. These map entries are
184 * organized as a threaded binary search tree. The tree is
185 * ordered based upon the start and end addresses contained
186 * within each map entry. The largest gap between an entry in a
187 * subtree and one of its neighbors is saved in the max_free
188 * field, and that field is updated when the tree is restructured.
189 *
190 * Sleator and Tarjan's top-down splay algorithm is employed to
191 * control height imbalance in the binary search tree.
192 *
193 * The map's min offset value is stored in map->header.end, and
194 * its max offset value is stored in map->header.start. These
195 * values act as sentinels for any forward or backward address
196 * scan of the list. The right and left fields of the map
197 * header point to the first and list map entries. The map
198 * header has a special value for the eflags field,
199 * MAP_ENTRY_HEADER, that is set initially, is never changed,
200 * and prevents an eflags match of the header with any other map
201 * entry.
202 *
203 * List of locks
204 * (c) const until freed
205 */
206struct vm_map {
207 struct vm_map_entry header; /* List of entries */
208 struct sx lock; /* Lock for map data */
209 struct mtx system_mtx;
210 int nentries; /* Number of entries */
211 vm_size_t size; /* virtual size */
212 u_int timestamp; /* Version number */
213 u_char needs_wakeup;
214 u_char system_map; /* (c) Am I a system map? */
215 vm_flags_t flags; /* flags for this vm_map */
216 vm_map_entry_t root; /* Root of a binary search tree */
217 pmap_t pmap; /* (c) Physical map */
218 vm_offset_t anon_loc;
219 int busy;
220#ifdef DIAGNOSTIC
221 int nupdates;
222#endif
223};
224
225/*
226 * vm_flags_t values
227 */
228#define MAP_WIREFUTURE 0x01 /* wire all future pages */
229#define MAP_BUSY_WAKEUP 0x02 /* thread(s) waiting on busy state */
230#define MAP_IS_SUB_MAP 0x04 /* has parent */
231#define MAP_ASLR 0x08 /* enabled ASLR */
232#define MAP_ASLR_IGNSTART 0x10 /* ASLR ignores data segment */
233#define MAP_REPLENISH 0x20 /* kmapent zone needs to be refilled */
234#define MAP_WXORX 0x40 /* enforce W^X */
235#define MAP_ASLR_STACK 0x80 /* stack location is randomized */
236
237#ifdef _KERNEL
238#if defined(KLD_MODULE) && !defined(KLD_TIED)
239#define vm_map_max(map) vm_map_max_KBI((map))
240#define vm_map_min(map) vm_map_min_KBI((map))
241#define vm_map_pmap(map) vm_map_pmap_KBI((map))
242#define vm_map_range_valid(map, start, end) \
243 vm_map_range_valid_KBI((map), (start), (end))
244#else
245static __inline vm_offset_t
246vm_map_max(const struct vm_map *map)
247{
248
249 return (map->header.start);
250}
251
252static __inline vm_offset_t
253vm_map_min(const struct vm_map *map)
254{
255
256 return (map->header.end);
257}
258
259static __inline pmap_t
260vm_map_pmap(vm_map_t map)
261{
262 return (map->pmap);
263}
264
265static __inline void
266vm_map_modflags(vm_map_t map, vm_flags_t set, vm_flags_t clear)
267{
268 map->flags = (map->flags | set) & ~clear;
269}
270
271static inline bool
272vm_map_range_valid(vm_map_t map, vm_offset_t start, vm_offset_t end)
273{
274 if (end < start)
275 return (false);
276 if (start < vm_map_min(map) || end > vm_map_max(map))
277 return (false);
278 return (true);
279}
280
281#endif /* KLD_MODULE */
282#endif /* _KERNEL */
283
284/*
285 * Shareable process virtual address space.
286 *
287 * List of locks
288 * (c) const until freed
289 */
290struct vmspace {
291 struct vm_map vm_map; /* VM address map */
292 struct shmmap_state *vm_shm; /* SYS5 shared memory private data XXX */
293 segsz_t vm_swrss; /* resident set size before last swap */
294 segsz_t vm_tsize; /* text size (pages) XXX */
295 segsz_t vm_dsize; /* data size (pages) XXX */
296 segsz_t vm_ssize; /* stack size (pages) */
297 caddr_t vm_taddr; /* (c) user virtual address of text */
298 caddr_t vm_daddr; /* (c) user virtual address of data */
299 caddr_t vm_maxsaddr; /* user VA at max stack growth */
300 vm_offset_t vm_stacktop; /* top of the stack, may not be page-aligned */
301 vm_offset_t vm_shp_base; /* shared page address */
302 u_int vm_refcnt; /* number of references */
303 /*
304 * Keep the PMAP last, so that CPU-specific variations of that
305 * structure on a single architecture don't result in offset
306 * variations of the machine-independent fields in the vmspace.
307 */
308 struct pmap vm_pmap; /* private physical map */
309};
310
311#ifdef _KERNEL
312static __inline pmap_t
313vmspace_pmap(struct vmspace *vmspace)
314{
315 return &vmspace->vm_pmap;
316}
317#endif /* _KERNEL */
318
319#ifdef _KERNEL
320/*
321 * Macros: vm_map_lock, etc.
322 * Function:
323 * Perform locking on the data portion of a map. Note that
324 * these macros mimic procedure calls returning void. The
325 * semicolon is supplied by the user of these macros, not
326 * by the macros themselves. The macros can safely be used
327 * as unbraced elements in a higher level statement.
328 */
329
330void _vm_map_lock(vm_map_t map, const char *file, int line);
331void _vm_map_unlock(vm_map_t map, const char *file, int line);
332int _vm_map_unlock_and_wait(vm_map_t map, int timo, const char *file, int line);
333void _vm_map_lock_read(vm_map_t map, const char *file, int line);
334void _vm_map_unlock_read(vm_map_t map, const char *file, int line);
335int _vm_map_trylock(vm_map_t map, const char *file, int line);
336int _vm_map_trylock_read(vm_map_t map, const char *file, int line);
337int _vm_map_lock_upgrade(vm_map_t map, const char *file, int line);
338void _vm_map_lock_downgrade(vm_map_t map, const char *file, int line);
339int vm_map_locked(vm_map_t map);
340void vm_map_wakeup(vm_map_t map);
341void vm_map_busy(vm_map_t map);
342void vm_map_unbusy(vm_map_t map);
343void vm_map_wait_busy(vm_map_t map);
344vm_offset_t vm_map_max_KBI(const struct vm_map *map);
345vm_offset_t vm_map_min_KBI(const struct vm_map *map);
346pmap_t vm_map_pmap_KBI(vm_map_t map);
347bool vm_map_range_valid_KBI(vm_map_t map, vm_offset_t start, vm_offset_t end);
348
349#define vm_map_lock(map) _vm_map_lock(map, LOCK_FILE, LOCK_LINE)
350#define vm_map_unlock(map) _vm_map_unlock(map, LOCK_FILE, LOCK_LINE)
351#define vm_map_unlock_and_wait(map, timo) \
352 _vm_map_unlock_and_wait(map, timo, LOCK_FILE, LOCK_LINE)
353#define vm_map_lock_read(map) _vm_map_lock_read(map, LOCK_FILE, LOCK_LINE)
354#define vm_map_unlock_read(map) _vm_map_unlock_read(map, LOCK_FILE, LOCK_LINE)
355#define vm_map_trylock(map) _vm_map_trylock(map, LOCK_FILE, LOCK_LINE)
356#define vm_map_trylock_read(map) \
357 _vm_map_trylock_read(map, LOCK_FILE, LOCK_LINE)
358#define vm_map_lock_upgrade(map) \
359 _vm_map_lock_upgrade(map, LOCK_FILE, LOCK_LINE)
360#define vm_map_lock_downgrade(map) \
361 _vm_map_lock_downgrade(map, LOCK_FILE, LOCK_LINE)
362
363long vmspace_resident_count(struct vmspace *vmspace);
364#endif /* _KERNEL */
365
366/*
367 * Copy-on-write flags for vm_map operations
368 */
369#define MAP_INHERIT_SHARE 0x00000001
370#define MAP_COPY_ON_WRITE 0x00000002
371#define MAP_NOFAULT 0x00000004
372#define MAP_PREFAULT 0x00000008
373#define MAP_PREFAULT_PARTIAL 0x00000010
374#define MAP_DISABLE_SYNCER 0x00000020
375#define MAP_CHECK_EXCL 0x00000040
376#define MAP_CREATE_GUARD 0x00000080
377#define MAP_DISABLE_COREDUMP 0x00000100
378#define MAP_PREFAULT_MADVISE 0x00000200 /* from (user) madvise request */
379#define MAP_WRITECOUNT 0x00000400
380#define MAP_REMAP 0x00000800
381#define MAP_STACK_GROWS_DOWN 0x00001000
382#define MAP_STACK_GROWS_UP 0x00002000
383#define MAP_ACC_CHARGED 0x00004000
384#define MAP_ACC_NO_CHARGE 0x00008000
385#define MAP_CREATE_STACK_GAP_UP 0x00010000
386#define MAP_CREATE_STACK_GAP_DN 0x00020000
387#define MAP_VN_EXEC 0x00040000
388#define MAP_SPLIT_BOUNDARY_MASK 0x00180000
389#define MAP_NO_HINT 0x00200000
390
391#define MAP_SPLIT_BOUNDARY_SHIFT 19
392
393/*
394 * vm_fault option flags
395 */
396#define VM_FAULT_NORMAL 0x00 /* Nothing special */
397#define VM_FAULT_WIRE 0x01 /* Wire the mapped page */
398#define VM_FAULT_DIRTY 0x02 /* Dirty the page; use w/VM_PROT_COPY */
399#define VM_FAULT_NOFILL 0x04 /* Fail if the pager doesn't have a copy */
400
401/*
402 * Initially, mappings are slightly sequential. The maximum window size must
403 * account for the map entry's "read_ahead" field being defined as an uint8_t.
404 */
405#define VM_FAULT_READ_AHEAD_MIN 7
406#define VM_FAULT_READ_AHEAD_INIT 15
407#define VM_FAULT_READ_AHEAD_MAX min(atop(maxphys) - 1, UINT8_MAX)
408
409/*
410 * The following "find_space" options are supported by vm_map_find().
411 *
412 * For VMFS_ALIGNED_SPACE, the desired alignment is specified to
413 * the macro argument as log base 2 of the desired alignment.
414 */
415#define VMFS_NO_SPACE 0 /* don't find; use the given range */
416#define VMFS_ANY_SPACE 1 /* find a range with any alignment */
417#define VMFS_OPTIMAL_SPACE 2 /* find a range with optimal alignment*/
418#define VMFS_SUPER_SPACE 3 /* find a superpage-aligned range */
419#define VMFS_ALIGNED_SPACE(x) ((x) << 8) /* find a range with fixed alignment */
420
421/*
422 * vm_map_wire and vm_map_unwire option flags
423 */
424#define VM_MAP_WIRE_SYSTEM 0 /* wiring in a kernel map */
425#define VM_MAP_WIRE_USER 1 /* wiring in a user map */
426
427#define VM_MAP_WIRE_NOHOLES 0 /* region must not have holes */
428#define VM_MAP_WIRE_HOLESOK 2 /* region may have holes */
429
430#define VM_MAP_WIRE_WRITE 4 /* Validate writable. */
431
432typedef int vm_map_entry_reader(void *token, vm_map_entry_t addr,
433 vm_map_entry_t dest);
434
435#ifndef _KERNEL
436/*
437 * Find the successor of a map_entry, using a reader to dereference pointers.
438 * '*clone' is a copy of a vm_map entry. 'reader' is used to copy a map entry
439 * at some address into '*clone'. Change *clone to a copy of the next map
440 * entry, and return the address of that entry, or NULL if copying has failed.
441 *
442 * This function is made available to user-space code that needs to traverse
443 * map entries.
444 */
445static inline vm_map_entry_t
446vm_map_entry_read_succ(void *token, struct vm_map_entry *const clone,
447 vm_map_entry_reader reader)
448{
449 vm_map_entry_t after, backup;
450 vm_offset_t start;
451
452 after = clone->right;
453 start = clone->start;
454 if (!reader(token, after, clone))
455 return (NULL);
456 backup = clone->left;
457 if (!reader(token, backup, clone))
458 return (NULL);
459 if (clone->start > start) {
460 do {
461 after = backup;
462 backup = clone->left;
463 if (!reader(token, backup, clone))
464 return (NULL);
465 } while (clone->start != start);
466 }
467 if (!reader(token, after, clone))
468 return (NULL);
469 return (after);
470}
471#endif /* ! _KERNEL */
472
473#ifdef _KERNEL
474boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t);
475int vm_map_delete(vm_map_t, vm_offset_t, vm_offset_t);
476int vm_map_find(vm_map_t, vm_object_t, vm_ooffset_t, vm_offset_t *, vm_size_t,
477 vm_offset_t, int, vm_prot_t, vm_prot_t, int);
478int vm_map_find_locked(vm_map_t, vm_object_t, vm_ooffset_t, vm_offset_t *,
479 vm_size_t, vm_offset_t, int, vm_prot_t, vm_prot_t, int);
480int vm_map_find_min(vm_map_t, vm_object_t, vm_ooffset_t, vm_offset_t *,
481 vm_size_t, vm_offset_t, vm_offset_t, int, vm_prot_t, vm_prot_t, int);
482int vm_map_find_aligned(vm_map_t map, vm_offset_t *addr, vm_size_t length,
483 vm_offset_t max_addr, vm_offset_t alignment);
484int vm_map_fixed(vm_map_t, vm_object_t, vm_ooffset_t, vm_offset_t, vm_size_t,
485 vm_prot_t, vm_prot_t, int);
486vm_offset_t vm_map_findspace(vm_map_t, vm_offset_t, vm_size_t);
487int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t);
488void vm_map_init(vm_map_t, pmap_t, vm_offset_t, vm_offset_t);
489int vm_map_insert (vm_map_t, vm_object_t, vm_ooffset_t, vm_offset_t, vm_offset_t, vm_prot_t, vm_prot_t, int);
490int vm_map_lookup (vm_map_t *, vm_offset_t, vm_prot_t, vm_map_entry_t *, vm_object_t *,
491 vm_pindex_t *, vm_prot_t *, boolean_t *);
492int vm_map_lookup_locked(vm_map_t *, vm_offset_t, vm_prot_t, vm_map_entry_t *, vm_object_t *,
493 vm_pindex_t *, vm_prot_t *, boolean_t *);
494void vm_map_lookup_done (vm_map_t, vm_map_entry_t);
495boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *);
496
497static inline vm_map_entry_t
498vm_map_entry_first(vm_map_t map)
499{
500
501 return (map->header.right);
502}
503
504static inline vm_map_entry_t
505vm_map_entry_succ(vm_map_entry_t entry)
506{
507 vm_map_entry_t after;
508
509 after = entry->right;
510 if (after->left->start > entry->start) {
511 do
512 after = after->left;
513 while (after->left != entry);
514 }
515 return (after);
516}
517
518#define VM_MAP_ENTRY_FOREACH(it, map) \
519 for ((it) = vm_map_entry_first(map); \
520 (it) != &(map)->header; \
521 (it) = vm_map_entry_succ(it))
522
523#define VM_MAP_PROTECT_SET_PROT 0x0001
524#define VM_MAP_PROTECT_SET_MAXPROT 0x0002
525#define VM_MAP_PROTECT_GROWSDOWN 0x0004
526
527int vm_map_protect(vm_map_t map, vm_offset_t start, vm_offset_t end,
528 vm_prot_t new_prot, vm_prot_t new_maxprot, int flags);
529int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t);
530vm_map_entry_t vm_map_try_merge_entries(vm_map_t map, vm_map_entry_t prev,
531 vm_map_entry_t entry);
532void vm_map_startup (void);
533int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t);
534int vm_map_sync(vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t);
535int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int);
536int vm_map_stack (vm_map_t, vm_offset_t, vm_size_t, vm_prot_t, vm_prot_t, int);
537int vm_map_unwire(vm_map_t map, vm_offset_t start, vm_offset_t end,
538 int flags);
539int vm_map_wire(vm_map_t map, vm_offset_t start, vm_offset_t end, int flags);
540int vm_map_wire_locked(vm_map_t map, vm_offset_t start, vm_offset_t end,
541 int flags);
542long vmspace_swap_count(struct vmspace *vmspace);
543void vm_map_entry_set_vnode_text(vm_map_entry_t entry, bool add);
544#endif /* _KERNEL */
545#endif /* _VM_MAP_ */