1 /* 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)vm_map.h 8.9 (Berkeley) 5/17/95 37 * 38 * 39 * Copyright (c) 1987, 1990 Carnegie-Mellon University. 40 * All rights reserved. 41 * 42 * Authors: Avadis Tevanian, Jr., Michael Wayne Young 43 * 44 * Permission to use, copy, modify and distribute this software and 45 * its documentation is hereby granted, provided that both the copyright 46 * notice and this permission notice appear in all copies of the 47 * software, derivative works or modified versions, and any portions 48 * thereof, and that both notices appear in supporting documentation. 49 * 50 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" 51 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND 52 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. 53 * 54 * Carnegie Mellon requests users of this software to return to 55 * 56 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 57 * School of Computer Science 58 * Carnegie Mellon University 59 * Pittsburgh PA 15213-3890 60 * 61 * any improvements or extensions that they make and grant Carnegie the 62 * rights to redistribute these changes. 63 * 64 * $FreeBSD: src/sys/vm/vm_map.h,v 1.54.2.5 2003/01/13 22:51:17 dillon Exp $ 65 * $DragonFly: src/sys/vm/vm_map.h,v 1.30 2007/04/29 18:25:41 dillon Exp $ 66 */ 67 68 /* 69 * Virtual memory map module definitions. 70 */ 71 72 #ifndef _VM_VM_MAP_H_ 73 #define _VM_VM_MAP_H_ 74 75 #ifndef _SYS_TYPES_H_ 76 #include <sys/types.h> 77 #endif 78 #ifdef _KERNEL 79 #ifndef _SYS_KERNEL_H_ 80 #include <sys/kernel.h> /* ticks */ 81 #endif 82 #endif 83 #ifndef _SYS_TREE_H_ 84 #include <sys/tree.h> 85 #endif 86 #ifndef _SYS_SYSREF_H_ 87 #include <sys/sysref.h> 88 #endif 89 #ifndef _SYS_LOCK_H_ 90 #include <sys/lock.h> 91 #endif 92 #ifndef _SYS_VKERNEL_H_ 93 #include <sys/vkernel.h> 94 #endif 95 #ifndef _VM_VM_H_ 96 #include <vm/vm.h> 97 #endif 98 #ifndef _MACHINE_PMAP_H_ 99 #include <machine/pmap.h> 100 #endif 101 #ifndef _VM_VM_OBJECT_H_ 102 #include <vm/vm_object.h> 103 #endif 104 #ifndef _SYS_NULL_H_ 105 #include <sys/_null.h> 106 #endif 107 108 struct vm_map_rb_tree; 109 RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare); 110 111 /* 112 * Types defined: 113 * 114 * vm_map_t the high-level address map data structure. 115 * vm_map_entry_t an entry in an address map. 116 */ 117 118 typedef u_int vm_flags_t; 119 typedef u_int vm_eflags_t; 120 121 /* 122 * Objects which live in maps may be either VM objects, or 123 * another map (called a "sharing map") which denotes read-write 124 * sharing with other maps. 125 */ 126 union vm_map_object { 127 struct vm_object *vm_object; /* object object */ 128 struct vm_map *sub_map; /* belongs to another map */ 129 }; 130 131 union vm_map_aux { 132 vm_offset_t avail_ssize; /* amt can grow if this is a stack */ 133 vpte_t master_pde; /* virtual page table root */ 134 }; 135 136 /* 137 * Address map entries consist of start and end addresses, 138 * a VM object (or sharing map) and offset into that object, 139 * and user-exported inheritance and protection information. 140 * Also included is control information for virtual copy operations. 141 * 142 * When used with MAP_STACK, avail_ssize is used to determine the 143 * limits of stack growth. 144 * 145 * When used with VM_MAPTYPE_VPAGETABLE, avail_ssize stores the 146 * page directory index. 147 */ 148 struct vm_map_entry { 149 struct vm_map_entry *prev; /* previous entry */ 150 struct vm_map_entry *next; /* next entry */ 151 RB_ENTRY(vm_map_entry) rb_entry; 152 vm_offset_t start; /* start address */ 153 vm_offset_t end; /* end address */ 154 union vm_map_aux aux; /* auxillary data */ 155 union vm_map_object object; /* object I point to */ 156 vm_ooffset_t offset; /* offset into object */ 157 vm_eflags_t eflags; /* map entry flags */ 158 vm_maptype_t maptype; /* type of VM mapping */ 159 vm_prot_t protection; /* protection code */ 160 vm_prot_t max_protection; /* maximum protection */ 161 vm_inherit_t inheritance; /* inheritance */ 162 int wired_count; /* can be paged if = 0 */ 163 }; 164 165 #define MAP_ENTRY_NOSYNC 0x0001 166 #define MAP_ENTRY_STACK 0x0002 167 #define MAP_ENTRY_COW 0x0004 168 #define MAP_ENTRY_NEEDS_COPY 0x0008 169 #define MAP_ENTRY_NOFAULT 0x0010 170 #define MAP_ENTRY_USER_WIRED 0x0020 171 172 #define MAP_ENTRY_BEHAV_NORMAL 0x0000 /* default behavior */ 173 #define MAP_ENTRY_BEHAV_SEQUENTIAL 0x0040 /* expect sequential access */ 174 #define MAP_ENTRY_BEHAV_RANDOM 0x0080 /* expect random access */ 175 #define MAP_ENTRY_BEHAV_RESERVED 0x00C0 /* future use */ 176 177 #define MAP_ENTRY_BEHAV_MASK 0x00C0 178 179 #define MAP_ENTRY_IN_TRANSITION 0x0100 /* entry being changed */ 180 #define MAP_ENTRY_NEEDS_WAKEUP 0x0200 /* waiter's in transition */ 181 #define MAP_ENTRY_NOCOREDUMP 0x0400 /* don't include in a core */ 182 #define MAP_ENTRY_KSTACK 0x0800 /* guarded kernel stack */ 183 184 /* 185 * flags for vm_map_[un]clip_range() 186 */ 187 #define MAP_CLIP_NO_HOLES 0x0001 188 189 /* 190 * This reserve count for vm_map_entry_reserve() should cover all nominal 191 * single-insertion operations, including any necessary clipping. 192 */ 193 #define MAP_RESERVE_COUNT 4 194 #define MAP_RESERVE_SLOP 32 195 196 static __inline u_char 197 vm_map_entry_behavior(struct vm_map_entry *entry) 198 { 199 return entry->eflags & MAP_ENTRY_BEHAV_MASK; 200 } 201 202 static __inline void 203 vm_map_entry_set_behavior(struct vm_map_entry *entry, u_char behavior) 204 { 205 entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) | 206 (behavior & MAP_ENTRY_BEHAV_MASK); 207 } 208 209 /* 210 * Maps are doubly-linked lists of map entries, kept sorted 211 * by address. A single hint is provided to start 212 * searches again from the last successful search, 213 * insertion, or removal. 214 * 215 * Note: the lock structure cannot be the first element of vm_map 216 * because this can result in a running lockup between two or more 217 * system processes trying to kmem_alloc_wait() due to kmem_alloc_wait() 218 * and free tsleep/waking up 'map' and the underlying lockmgr also 219 * sleeping and waking up on 'map'. The lockup occurs when the map fills 220 * up. The 'exec' map, for example. 221 */ 222 struct vm_map { 223 struct vm_map_entry header; /* List of entries */ 224 RB_HEAD(vm_map_rb_tree, vm_map_entry) rb_root; 225 struct lock lock; /* Lock for map data */ 226 int nentries; /* Number of entries */ 227 vm_size_t size; /* virtual size */ 228 u_char system_map; /* Am I a system map? */ 229 vm_map_entry_t hint; /* hint for quick lookups */ 230 unsigned int timestamp; /* Version number */ 231 vm_map_entry_t first_free; /* First free space hint */ 232 vm_flags_t flags; /* flags for this vm_map */ 233 struct pmap *pmap; /* Physical map */ 234 u_int president_cache; /* Remember president count */ 235 u_int president_ticks; /* Save ticks for cache */ 236 #define min_offset header.start 237 #define max_offset header.end 238 }; 239 240 /* 241 * vm_flags_t values 242 */ 243 #define MAP_WIREFUTURE 0x01 /* wire all future pages */ 244 245 /* 246 * Registered upcall 247 */ 248 struct upcall; 249 250 struct vmupcall { 251 struct vmupcall *vu_next; 252 void *vu_func; /* user upcall function */ 253 void *vu_data; /* user data */ 254 void *vu_ctx; /* user context function */ 255 struct lwp *vu_lwp; /* process that registered upcall */ 256 int vu_id; /* upcall identifier */ 257 int vu_pending; /* upcall request pending */ 258 }; 259 260 /* 261 * Shareable process virtual address space. 262 * 263 * Refd pointers from vmresident, proc 264 */ 265 struct vmspace { 266 struct vm_map vm_map; /* VM address map */ 267 struct pmap vm_pmap; /* private physical map */ 268 int vm_unused01; 269 caddr_t vm_shm; /* SYS5 shared memory private data XXX */ 270 /* we copy from vm_startcopy to the end of the structure on fork */ 271 #define vm_startcopy vm_rssize 272 segsz_t vm_rssize; /* current resident set size in pages */ 273 segsz_t vm_swrss; /* resident set size before last swap */ 274 segsz_t vm_tsize; /* text size (pages) XXX */ 275 segsz_t vm_dsize; /* data size (pages) XXX */ 276 segsz_t vm_ssize; /* stack size (pages) */ 277 caddr_t vm_taddr; /* user virtual address of text XXX */ 278 caddr_t vm_daddr; /* user virtual address of data XXX */ 279 caddr_t vm_maxsaddr; /* user VA at max stack growth */ 280 caddr_t vm_minsaddr; /* user VA at max stack growth */ 281 #define vm_endcopy vm_exitingcnt 282 int vm_exitingcnt; /* several procsses zombied in exit1 */ 283 int vm_upccount; /* number of registered upcalls */ 284 int vm_pagesupply; 285 struct vmupcall *vm_upcalls; /* registered upcalls */ 286 struct sysref vm_sysref; /* sysref, refcnt, etc */ 287 }; 288 289 /* 290 * Resident executable holding structure. A user program can take a snapshot 291 * of just its VM address space (typically done just after dynamic link 292 * libraries have completed loading) and register it as a resident 293 * executable associated with the program binary's vnode, which is also 294 * locked into memory. Future execs of the vnode will start with a copy 295 * of the resident vmspace instead of running the binary from scratch, 296 * avoiding both the kernel ELF loader *AND* all shared library mapping and 297 * relocation code, and will call a different entry point (the stack pointer 298 * is reset to the top of the stack) supplied when the vmspace was registered. 299 */ 300 struct vmresident { 301 struct vnode *vr_vnode; /* associated vnode */ 302 TAILQ_ENTRY(vmresident) vr_link; /* linked list of res sts */ 303 struct vmspace *vr_vmspace; /* vmspace to fork */ 304 intptr_t vr_entry_addr; /* registered entry point */ 305 struct sysentvec *vr_sysent; /* system call vects */ 306 int vr_id; /* registration id */ 307 int vr_refs; /* temporary refs */ 308 }; 309 310 #ifdef _KERNEL 311 /* 312 * Macros: vm_map_lock, etc. 313 * Function: 314 * Perform locking on the data portion of a map. Note that 315 * these macros mimic procedure calls returning void. The 316 * semicolon is supplied by the user of these macros, not 317 * by the macros themselves. The macros can safely be used 318 * as unbraced elements in a higher level statement. 319 */ 320 321 #define ASSERT_VM_MAP_LOCKED(map) KKASSERT(lockowned(&(map)->lock)) 322 323 #ifdef DIAGNOSTIC 324 /* #define MAP_LOCK_DIAGNOSTIC 1 */ 325 #ifdef MAP_LOCK_DIAGNOSTIC 326 #define vm_map_lock(map) \ 327 do { \ 328 kprintf ("locking map LK_EXCLUSIVE: 0x%x\n", map); \ 329 if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \ 330 panic("vm_map_lock: failed to get lock"); \ 331 } \ 332 (map)->timestamp++; \ 333 } while(0) 334 #else 335 #define vm_map_lock(map) \ 336 do { \ 337 if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \ 338 panic("vm_map_lock: failed to get lock"); \ 339 } \ 340 (map)->timestamp++; \ 341 } while(0) 342 #endif 343 #else 344 #define vm_map_lock(map) \ 345 do { \ 346 lockmgr(&(map)->lock, LK_EXCLUSIVE); \ 347 (map)->timestamp++; \ 348 } while(0) 349 #endif /* DIAGNOSTIC */ 350 351 #if defined(MAP_LOCK_DIAGNOSTIC) 352 #define vm_map_unlock(map) \ 353 do { \ 354 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \ 355 lockmgr(&(map)->lock, LK_RELEASE); \ 356 } while (0) 357 #define vm_map_lock_read(map) \ 358 do { \ 359 kprintf ("locking map LK_SHARED: 0x%x\n", map); \ 360 lockmgr(&(map)->lock, LK_SHARED); \ 361 } while (0) 362 #define vm_map_unlock_read(map) \ 363 do { \ 364 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \ 365 lockmgr(&(map)->lock, LK_RELEASE); \ 366 } while (0) 367 #else 368 #define vm_map_unlock(map) \ 369 lockmgr(&(map)->lock, LK_RELEASE) 370 #define vm_map_lock_read(map) \ 371 lockmgr(&(map)->lock, LK_SHARED) 372 #define vm_map_unlock_read(map) \ 373 lockmgr(&(map)->lock, LK_RELEASE) 374 #endif 375 376 #define vm_map_lock_read_try(map) \ 377 lockmgr(&(map)->lock, LK_SHARED | LK_NOWAIT) 378 379 static __inline__ int 380 vm_map_lock_upgrade(vm_map_t map) { 381 int error; 382 #if defined(MAP_LOCK_DIAGNOSTIC) 383 kprintf("locking map LK_EXCLUPGRADE: 0x%x\n", map); 384 #endif 385 error = lockmgr(&map->lock, LK_EXCLUPGRADE); 386 if (error == 0) 387 map->timestamp++; 388 return error; 389 } 390 391 #if defined(MAP_LOCK_DIAGNOSTIC) 392 #define vm_map_lock_downgrade(map) \ 393 do { \ 394 kprintf ("locking map LK_DOWNGRADE: 0x%x\n", map); \ 395 lockmgr(&(map)->lock, LK_DOWNGRADE); \ 396 } while (0) 397 #else 398 #define vm_map_lock_downgrade(map) \ 399 lockmgr(&(map)->lock, LK_DOWNGRADE) 400 #endif 401 402 #endif /* _KERNEL */ 403 404 /* 405 * Functions implemented as macros 406 */ 407 #define vm_map_min(map) ((map)->min_offset) 408 #define vm_map_max(map) ((map)->max_offset) 409 #define vm_map_pmap(map) ((map)->pmap) 410 411 /* 412 * Must not block 413 */ 414 static __inline struct pmap * 415 vmspace_pmap(struct vmspace *vmspace) 416 { 417 return &vmspace->vm_pmap; 418 } 419 420 static __inline long 421 vmspace_resident_count(struct vmspace *vmspace) 422 { 423 return pmap_resident_count(vmspace_pmap(vmspace)); 424 } 425 426 /* 427 * Calculates the proportional RSS and returning the 428 * accrued result. This is a loose value for statistics/display 429 * purposes only and will only be updated if we can acquire 430 * a non-blocking map lock. 431 * 432 * (used by userland or the kernel) 433 */ 434 static __inline u_int 435 vmspace_president_count(struct vmspace *vmspace) 436 { 437 vm_map_t map = &vmspace->vm_map; 438 vm_map_entry_t cur; 439 vm_object_t object; 440 u_int count = 0; 441 442 #ifdef _KERNEL 443 if (map->president_ticks == ticks / hz || vm_map_lock_read_try(map)) 444 return(map->president_cache); 445 #endif 446 447 for (cur = map->header.next; cur != &map->header; cur = cur->next) { 448 switch(cur->maptype) { 449 case VM_MAPTYPE_NORMAL: 450 case VM_MAPTYPE_VPAGETABLE: 451 if ((object = cur->object.vm_object) == NULL) 452 break; 453 if (object->type != OBJT_DEFAULT && 454 object->type != OBJT_SWAP) { 455 break; 456 } 457 if (object->agg_pv_list_count != 0) { 458 count += object->resident_page_count / 459 object->agg_pv_list_count; 460 } 461 break; 462 default: 463 break; 464 } 465 } 466 #ifdef _KERNEL 467 map->president_cache = count; 468 map->president_ticks = ticks / hz; 469 vm_map_unlock_read(map); 470 #endif 471 472 return(count); 473 } 474 475 /* 476 * Number of kernel maps and entries to statically allocate, required 477 * during boot to bootstrap the VM system. 478 */ 479 #define MAX_KMAP 10 480 #define MAX_MAPENT 2048 /* required to support up to 64 cpus */ 481 482 /* 483 * Copy-on-write flags for vm_map operations 484 */ 485 #define MAP_UNUSED_01 0x0001 486 #define MAP_COPY_ON_WRITE 0x0002 487 #define MAP_NOFAULT 0x0004 488 #define MAP_PREFAULT 0x0008 489 #define MAP_PREFAULT_PARTIAL 0x0010 490 #define MAP_DISABLE_SYNCER 0x0020 491 #define MAP_IS_STACK 0x0040 492 #define MAP_IS_KSTACK 0x0080 493 #define MAP_DISABLE_COREDUMP 0x0100 494 #define MAP_PREFAULT_MADVISE 0x0200 /* from (user) madvise request */ 495 496 /* 497 * vm_fault option flags 498 */ 499 #define VM_FAULT_NORMAL 0x00 /* Nothing special */ 500 #define VM_FAULT_CHANGE_WIRING 0x01 /* Change the wiring as appropriate */ 501 #define VM_FAULT_USER_WIRE 0x02 /* Likewise, but for user purposes */ 502 #define VM_FAULT_BURST 0x04 /* Burst fault can be done */ 503 #define VM_FAULT_DIRTY 0x08 /* Dirty the page */ 504 #define VM_FAULT_UNSWAP 0x10 /* Remove backing store from the page */ 505 #define VM_FAULT_WIRE_MASK (VM_FAULT_CHANGE_WIRING|VM_FAULT_USER_WIRE) 506 507 #ifdef _KERNEL 508 509 extern struct sysref_class vmspace_sysref_class; 510 511 boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t, 512 vm_prot_t, boolean_t); 513 struct pmap; 514 struct globaldata; 515 void vm_map_entry_allocate_object(vm_map_entry_t); 516 void vm_map_entry_reserve_cpu_init(struct globaldata *gd); 517 int vm_map_entry_reserve(int); 518 int vm_map_entry_kreserve(int); 519 void vm_map_entry_release(int); 520 void vm_map_entry_krelease(int); 521 vm_map_t vm_map_create (vm_map_t, struct pmap *, vm_offset_t, vm_offset_t); 522 int vm_map_delete (vm_map_t, vm_offset_t, vm_offset_t, int *); 523 int vm_map_find (vm_map_t, vm_object_t, vm_ooffset_t, 524 vm_offset_t *, vm_size_t, vm_size_t, 525 boolean_t, vm_maptype_t, 526 vm_prot_t, vm_prot_t, 527 int); 528 int vm_map_findspace (vm_map_t, vm_offset_t, vm_size_t, vm_size_t, 529 int, vm_offset_t *); 530 vm_offset_t vm_map_hint(struct proc *, vm_offset_t, vm_prot_t); 531 int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t); 532 void vm_map_init (struct vm_map *, vm_offset_t, vm_offset_t, pmap_t); 533 int vm_map_insert (vm_map_t, int *, vm_object_t, vm_ooffset_t, 534 vm_offset_t, vm_offset_t, 535 vm_maptype_t, 536 vm_prot_t, vm_prot_t, 537 int); 538 int vm_map_lookup (vm_map_t *, vm_offset_t, vm_prot_t, vm_map_entry_t *, vm_object_t *, 539 vm_pindex_t *, vm_prot_t *, boolean_t *); 540 void vm_map_lookup_done (vm_map_t, vm_map_entry_t, int); 541 boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *); 542 int vm_map_wire (vm_map_t, vm_offset_t, vm_offset_t, int); 543 int vm_map_unwire (vm_map_t, vm_offset_t, vm_offset_t, boolean_t); 544 int vm_map_clean (vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t); 545 int vm_map_protect (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t); 546 int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t); 547 void vm_map_startup (void); 548 int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t); 549 int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int, off_t); 550 void vm_map_simplify_entry (vm_map_t, vm_map_entry_t, int *); 551 void vm_init2 (void); 552 int vm_uiomove (vm_map_t, vm_object_t, off_t, int, vm_offset_t, int *); 553 int vm_map_stack (vm_map_t, vm_offset_t, vm_size_t, int, 554 vm_prot_t, vm_prot_t, int); 555 int vm_map_growstack (struct proc *p, vm_offset_t addr); 556 int vmspace_swap_count (struct vmspace *vmspace); 557 int vmspace_anonymous_count (struct vmspace *vmspace); 558 void vm_map_set_wired_quick(vm_map_t map, vm_offset_t addr, vm_size_t size, int *); 559 void vm_map_transition_wait(vm_map_t map); 560 561 #if defined(__amd64__) && defined(_KERNEL_VIRTUAL) 562 int vkernel_module_memory_alloc(vm_offset_t *, size_t); 563 void vkernel_module_memory_free(vm_offset_t, size_t); 564 #endif 565 566 #endif 567 #endif /* _VM_VM_MAP_H_ */ 568