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 */ 66 67 /* 68 * Virtual memory map module definitions. 69 */ 70 71 #ifndef _VM_VM_MAP_H_ 72 #define _VM_VM_MAP_H_ 73 74 #ifndef _SYS_TYPES_H_ 75 #include <sys/types.h> 76 #endif 77 #ifdef _KERNEL 78 #ifndef _SYS_KERNEL_H_ 79 #include <sys/kernel.h> /* ticks */ 80 #endif 81 #endif 82 #ifndef _SYS_TREE_H_ 83 #include <sys/tree.h> 84 #endif 85 #ifndef _SYS_SYSREF_H_ 86 #include <sys/sysref.h> 87 #endif 88 #ifndef _SYS_LOCK_H_ 89 #include <sys/lock.h> 90 #endif 91 #ifndef _SYS_VKERNEL_H_ 92 #include <sys/vkernel.h> 93 #endif 94 #ifndef _VM_VM_H_ 95 #include <vm/vm.h> 96 #endif 97 #ifndef _MACHINE_PMAP_H_ 98 #include <machine/pmap.h> 99 #endif 100 #ifndef _VM_VM_OBJECT_H_ 101 #include <vm/vm_object.h> 102 #endif 103 #ifndef _SYS_NULL_H_ 104 #include <sys/_null.h> 105 #endif 106 107 struct vm_map_rb_tree; 108 RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare); 109 110 /* 111 * Types defined: 112 * 113 * vm_map_t the high-level address map data structure. 114 * vm_map_entry_t an entry in an address map. 115 */ 116 117 typedef u_int vm_flags_t; 118 typedef u_int vm_eflags_t; 119 120 /* 121 * Objects which live in maps may be either VM objects, or 122 * another map (called a "sharing map") which denotes read-write 123 * sharing with other maps. 124 */ 125 union vm_map_object { 126 struct vm_object *vm_object; /* object object */ 127 struct vm_map *sub_map; /* belongs to another map */ 128 }; 129 130 union vm_map_aux { 131 vm_offset_t avail_ssize; /* amt can grow if this is a stack */ 132 vpte_t master_pde; /* virtual page table root */ 133 }; 134 135 /* 136 * Address map entries consist of start and end addresses, 137 * a VM object (or sharing map) and offset into that object, 138 * and user-exported inheritance and protection information. 139 * Also included is control information for virtual copy operations. 140 * 141 * When used with MAP_STACK, avail_ssize is used to determine the 142 * limits of stack growth. 143 * 144 * When used with VM_MAPTYPE_VPAGETABLE, avail_ssize stores the 145 * page directory index. 146 */ 147 struct vm_map_entry { 148 struct vm_map_entry *prev; /* previous entry */ 149 struct vm_map_entry *next; /* next entry */ 150 RB_ENTRY(vm_map_entry) rb_entry; 151 vm_offset_t start; /* start address */ 152 vm_offset_t end; /* end address */ 153 union vm_map_aux aux; /* auxillary data */ 154 union vm_map_object object; /* object I point to */ 155 vm_ooffset_t offset; /* offset into object */ 156 vm_eflags_t eflags; /* map entry flags */ 157 vm_maptype_t maptype; /* type of VM mapping */ 158 vm_prot_t protection; /* protection code */ 159 vm_prot_t max_protection; /* maximum protection */ 160 vm_inherit_t inheritance; /* inheritance */ 161 int wired_count; /* can be paged if = 0 */ 162 }; 163 164 #define MAP_ENTRY_NOSYNC 0x0001 165 #define MAP_ENTRY_STACK 0x0002 166 #define MAP_ENTRY_COW 0x0004 167 #define MAP_ENTRY_NEEDS_COPY 0x0008 168 #define MAP_ENTRY_NOFAULT 0x0010 169 #define MAP_ENTRY_USER_WIRED 0x0020 170 171 #define MAP_ENTRY_BEHAV_NORMAL 0x0000 /* default behavior */ 172 #define MAP_ENTRY_BEHAV_SEQUENTIAL 0x0040 /* expect sequential access */ 173 #define MAP_ENTRY_BEHAV_RANDOM 0x0080 /* expect random access */ 174 #define MAP_ENTRY_BEHAV_RESERVED 0x00C0 /* future use */ 175 176 #define MAP_ENTRY_BEHAV_MASK 0x00C0 177 178 #define MAP_ENTRY_IN_TRANSITION 0x0100 /* entry being changed */ 179 #define MAP_ENTRY_NEEDS_WAKEUP 0x0200 /* waiter's in transition */ 180 #define MAP_ENTRY_NOCOREDUMP 0x0400 /* don't include in a core */ 181 #define MAP_ENTRY_KSTACK 0x0800 /* guarded kernel stack */ 182 183 /* 184 * flags for vm_map_[un]clip_range() 185 */ 186 #define MAP_CLIP_NO_HOLES 0x0001 187 188 /* 189 * This reserve count for vm_map_entry_reserve() should cover all nominal 190 * single-insertion operations, including any necessary clipping. 191 */ 192 #define MAP_RESERVE_COUNT 4 193 #define MAP_RESERVE_SLOP 32 194 195 static __inline u_char 196 vm_map_entry_behavior(struct vm_map_entry *entry) 197 { 198 return entry->eflags & MAP_ENTRY_BEHAV_MASK; 199 } 200 201 static __inline void 202 vm_map_entry_set_behavior(struct vm_map_entry *entry, u_char behavior) 203 { 204 entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) | 205 (behavior & MAP_ENTRY_BEHAV_MASK); 206 } 207 208 /* 209 * Maps are doubly-linked lists of map entries, kept sorted by address. 210 * A single hint is provided to start searches again from the last 211 * successful search, insertion, or removal. 212 * 213 * NOTE: The lock structure cannot be the first element of vm_map 214 * because this can result in a running lockup between two or more 215 * system processes trying to kmem_alloc_wait() due to kmem_alloc_wait() 216 * and free tsleep/waking up 'map' and the underlying lockmgr also 217 * sleeping and waking up on 'map'. The lockup occurs when the map fills 218 * up. The 'exec' map, for example. 219 * 220 * NOTE: The vm_map structure can be hard-locked with the lockmgr lock 221 * or soft-serialized with the token, or both. 222 */ 223 struct vm_map { 224 struct vm_map_entry header; /* List of entries */ 225 RB_HEAD(vm_map_rb_tree, vm_map_entry) rb_root; 226 struct lock lock; /* Lock for map data */ 227 int nentries; /* Number of entries */ 228 vm_size_t size; /* virtual size */ 229 u_char system_map; /* Am I a system map? */ 230 vm_map_entry_t hint; /* hint for quick lookups */ 231 unsigned int timestamp; /* Version number */ 232 vm_map_entry_t first_free; /* First free space hint */ 233 vm_flags_t flags; /* flags for this vm_map */ 234 struct pmap *pmap; /* Physical map */ 235 u_int president_cache; /* Remember president count */ 236 u_int president_ticks; /* Save ticks for cache */ 237 struct lwkt_token token; /* Soft serializer */ 238 #define min_offset header.start 239 #define max_offset header.end 240 }; 241 242 /* 243 * vm_flags_t values 244 */ 245 #define MAP_WIREFUTURE 0x0001 /* wire all future pages */ 246 247 /* 248 * Shareable process virtual address space. 249 * 250 * Refd pointers from vmresident, proc 251 */ 252 struct vmspace { 253 struct vm_map vm_map; /* VM address map */ 254 struct pmap vm_pmap; /* private physical map */ 255 int vm_flags; 256 caddr_t vm_shm; /* SYS5 shared memory private data XXX */ 257 /* we copy from vm_startcopy to the end of the structure on fork */ 258 #define vm_startcopy vm_rssize 259 segsz_t vm_rssize; /* current resident set size in pages */ 260 segsz_t vm_swrss; /* resident set size before last swap */ 261 segsz_t vm_tsize; /* text size (pages) XXX */ 262 segsz_t vm_dsize; /* data size (pages) XXX */ 263 segsz_t vm_ssize; /* stack size (pages) */ 264 caddr_t vm_taddr; /* user virtual address of text XXX */ 265 caddr_t vm_daddr; /* user virtual address of data XXX */ 266 caddr_t vm_maxsaddr; /* user VA at max stack growth */ 267 caddr_t vm_minsaddr; /* user VA at max stack growth */ 268 #define vm_endcopy vm_unused01 269 int vm_unused01; 270 int vm_unused02; 271 int vm_pagesupply; 272 u_int vm_holdcnt; /* temporary hold count and exit sequencing */ 273 u_int vm_refcnt; /* normal ref count */ 274 }; 275 276 #define VMSPACE_EXIT1 0x0001 /* partial exit */ 277 #define VMSPACE_EXIT2 0x0002 /* full exit */ 278 279 #define VMSPACE_HOLDEXIT 0x80000000 280 281 /* 282 * Resident executable holding structure. A user program can take a snapshot 283 * of just its VM address space (typically done just after dynamic link 284 * libraries have completed loading) and register it as a resident 285 * executable associated with the program binary's vnode, which is also 286 * locked into memory. Future execs of the vnode will start with a copy 287 * of the resident vmspace instead of running the binary from scratch, 288 * avoiding both the kernel ELF loader *AND* all shared library mapping and 289 * relocation code, and will call a different entry point (the stack pointer 290 * is reset to the top of the stack) supplied when the vmspace was registered. 291 */ 292 struct vmresident { 293 struct vnode *vr_vnode; /* associated vnode */ 294 TAILQ_ENTRY(vmresident) vr_link; /* linked list of res sts */ 295 struct vmspace *vr_vmspace; /* vmspace to fork */ 296 intptr_t vr_entry_addr; /* registered entry point */ 297 struct sysentvec *vr_sysent; /* system call vects */ 298 int vr_id; /* registration id */ 299 int vr_refs; /* temporary refs */ 300 }; 301 302 #ifdef _KERNEL 303 /* 304 * Macros: vm_map_lock, etc. 305 * Function: 306 * Perform locking on the data portion of a map. Note that 307 * these macros mimic procedure calls returning void. The 308 * semicolon is supplied by the user of these macros, not 309 * by the macros themselves. The macros can safely be used 310 * as unbraced elements in a higher level statement. 311 */ 312 313 #define ASSERT_VM_MAP_LOCKED(map) KKASSERT(lockowned(&(map)->lock)) 314 315 #ifdef DIAGNOSTIC 316 /* #define MAP_LOCK_DIAGNOSTIC 1 */ 317 #ifdef MAP_LOCK_DIAGNOSTIC 318 #define vm_map_lock(map) \ 319 do { \ 320 kprintf ("locking map LK_EXCLUSIVE: 0x%x\n", map); \ 321 if (lockmgr(&(map)->lock, LK_EXCLUSIVE) != 0) { \ 322 panic("vm_map_lock: failed to get lock"); \ 323 } \ 324 (map)->timestamp++; \ 325 } while(0) 326 #else 327 #define vm_map_lock(map) \ 328 do { \ 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 #endif 335 #else 336 #define vm_map_lock(map) \ 337 do { \ 338 lockmgr(&(map)->lock, LK_EXCLUSIVE); \ 339 (map)->timestamp++; \ 340 } while(0) 341 #endif /* DIAGNOSTIC */ 342 343 #if defined(MAP_LOCK_DIAGNOSTIC) 344 #define vm_map_unlock(map) \ 345 do { \ 346 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \ 347 lockmgr(&(map)->lock, LK_RELEASE); \ 348 } while (0) 349 #define vm_map_lock_read(map) \ 350 do { \ 351 kprintf ("locking map LK_SHARED: 0x%x\n", map); \ 352 lockmgr(&(map)->lock, LK_SHARED); \ 353 } while (0) 354 #define vm_map_unlock_read(map) \ 355 do { \ 356 kprintf ("locking map LK_RELEASE: 0x%x\n", map); \ 357 lockmgr(&(map)->lock, LK_RELEASE); \ 358 } while (0) 359 #else 360 #define vm_map_unlock(map) \ 361 lockmgr(&(map)->lock, LK_RELEASE) 362 #define vm_map_lock_read(map) \ 363 lockmgr(&(map)->lock, LK_SHARED) 364 #define vm_map_unlock_read(map) \ 365 lockmgr(&(map)->lock, LK_RELEASE) 366 #endif 367 368 #define vm_map_lock_read_try(map) \ 369 lockmgr(&(map)->lock, LK_SHARED | LK_NOWAIT) 370 371 static __inline__ int 372 vm_map_lock_read_to(vm_map_t map) 373 { 374 int error; 375 376 #if defined(MAP_LOCK_DIAGNOSTIC) 377 kprintf ("locking map LK_SHARED: 0x%x\n", map); 378 #endif 379 error = lockmgr(&(map)->lock, LK_SHARED | LK_TIMELOCK); 380 return error; 381 } 382 383 static __inline__ int 384 vm_map_lock_upgrade(vm_map_t map) { 385 int error; 386 #if defined(MAP_LOCK_DIAGNOSTIC) 387 kprintf("locking map LK_EXCLUPGRADE: 0x%x\n", map); 388 #endif 389 error = lockmgr(&map->lock, LK_EXCLUPGRADE); 390 if (error == 0) 391 map->timestamp++; 392 return error; 393 } 394 395 #if defined(MAP_LOCK_DIAGNOSTIC) 396 #define vm_map_lock_downgrade(map) \ 397 do { \ 398 kprintf ("locking map LK_DOWNGRADE: 0x%x\n", map); \ 399 lockmgr(&(map)->lock, LK_DOWNGRADE); \ 400 } while (0) 401 #else 402 #define vm_map_lock_downgrade(map) \ 403 lockmgr(&(map)->lock, LK_DOWNGRADE) 404 #endif 405 406 #endif /* _KERNEL */ 407 408 /* 409 * Functions implemented as macros 410 */ 411 #define vm_map_min(map) ((map)->min_offset) 412 #define vm_map_max(map) ((map)->max_offset) 413 #define vm_map_pmap(map) ((map)->pmap) 414 415 /* 416 * Must not block 417 */ 418 static __inline struct pmap * 419 vmspace_pmap(struct vmspace *vmspace) 420 { 421 return &vmspace->vm_pmap; 422 } 423 424 /* 425 * Caller must hold the vmspace->vm_map.token 426 */ 427 static __inline long 428 vmspace_resident_count(struct vmspace *vmspace) 429 { 430 return pmap_resident_count(vmspace_pmap(vmspace)); 431 } 432 433 /* 434 * Calculates the proportional RSS and returning the 435 * accrued result. This is a loose value for statistics/display 436 * purposes only and will only be updated if we can acquire 437 * a non-blocking map lock. 438 * 439 * (used by userland or the kernel) 440 */ 441 static __inline u_int 442 vmspace_president_count(struct vmspace *vmspace) 443 { 444 vm_map_t map = &vmspace->vm_map; 445 vm_map_entry_t cur; 446 vm_object_t object; 447 u_int count = 0; 448 u_int n; 449 450 #ifdef _KERNEL 451 if (map->president_ticks == ticks / hz || vm_map_lock_read_try(map)) 452 return(map->president_cache); 453 #endif 454 455 for (cur = map->header.next; cur != &map->header; cur = cur->next) { 456 switch(cur->maptype) { 457 case VM_MAPTYPE_NORMAL: 458 case VM_MAPTYPE_VPAGETABLE: 459 if ((object = cur->object.vm_object) == NULL) 460 break; 461 if (object->type != OBJT_DEFAULT && 462 object->type != OBJT_SWAP) { 463 break; 464 } 465 /* 466 * synchronize non-zero case, contents of field 467 * can change at any time due to pmap ops. 468 */ 469 if ((n = object->agg_pv_list_count) != 0) { 470 #ifdef _KERNEL 471 cpu_ccfence(); 472 #endif 473 count += object->resident_page_count / n; 474 } 475 break; 476 default: 477 break; 478 } 479 } 480 #ifdef _KERNEL 481 map->president_cache = count; 482 map->president_ticks = ticks / hz; 483 vm_map_unlock_read(map); 484 #endif 485 486 return(count); 487 } 488 489 /* 490 * Number of kernel maps and entries to statically allocate, required 491 * during boot to bootstrap the VM system. 492 */ 493 #define MAX_KMAP 10 494 #define MAX_MAPENT (SMP_MAXCPU * 32 + 1024) 495 496 /* 497 * Copy-on-write flags for vm_map operations 498 */ 499 #define MAP_UNUSED_01 0x0001 500 #define MAP_COPY_ON_WRITE 0x0002 501 #define MAP_NOFAULT 0x0004 502 #define MAP_PREFAULT 0x0008 503 #define MAP_PREFAULT_PARTIAL 0x0010 504 #define MAP_DISABLE_SYNCER 0x0020 505 #define MAP_IS_STACK 0x0040 506 #define MAP_IS_KSTACK 0x0080 507 #define MAP_DISABLE_COREDUMP 0x0100 508 #define MAP_PREFAULT_MADVISE 0x0200 /* from (user) madvise request */ 509 #define MAP_PREFAULT_RELOCK 0x0200 510 511 /* 512 * vm_fault option flags 513 */ 514 #define VM_FAULT_NORMAL 0x00 /* Nothing special */ 515 #define VM_FAULT_CHANGE_WIRING 0x01 /* Change the wiring as appropriate */ 516 #define VM_FAULT_USER_WIRE 0x02 /* Likewise, but for user purposes */ 517 #define VM_FAULT_BURST 0x04 /* Burst fault can be done */ 518 #define VM_FAULT_DIRTY 0x08 /* Dirty the page */ 519 #define VM_FAULT_UNSWAP 0x10 /* Remove backing store from the page */ 520 #define VM_FAULT_BURST_QUICK 0x20 /* Special case shared vm_object */ 521 #define VM_FAULT_WIRE_MASK (VM_FAULT_CHANGE_WIRING|VM_FAULT_USER_WIRE) 522 523 #ifdef _KERNEL 524 525 boolean_t vm_map_check_protection (vm_map_t, vm_offset_t, vm_offset_t, 526 vm_prot_t, boolean_t); 527 struct pmap; 528 struct globaldata; 529 void vm_map_entry_allocate_object(vm_map_entry_t); 530 void vm_map_entry_reserve_cpu_init(struct globaldata *gd); 531 int vm_map_entry_reserve(int); 532 int vm_map_entry_kreserve(int); 533 void vm_map_entry_release(int); 534 void vm_map_entry_krelease(int); 535 vm_map_t vm_map_create (vm_map_t, struct pmap *, vm_offset_t, vm_offset_t); 536 int vm_map_delete (vm_map_t, vm_offset_t, vm_offset_t, int *); 537 int vm_map_find (vm_map_t, vm_object_t, vm_ooffset_t, 538 vm_offset_t *, vm_size_t, vm_size_t, 539 boolean_t, vm_maptype_t, 540 vm_prot_t, vm_prot_t, 541 int); 542 int vm_map_findspace (vm_map_t, vm_offset_t, vm_size_t, vm_size_t, 543 int, vm_offset_t *); 544 vm_offset_t vm_map_hint(struct proc *, vm_offset_t, vm_prot_t); 545 int vm_map_inherit (vm_map_t, vm_offset_t, vm_offset_t, vm_inherit_t); 546 void vm_map_init (struct vm_map *, vm_offset_t, vm_offset_t, pmap_t); 547 int vm_map_insert (vm_map_t, int *, vm_object_t, vm_ooffset_t, 548 vm_offset_t, vm_offset_t, 549 vm_maptype_t, 550 vm_prot_t, vm_prot_t, 551 int); 552 int vm_map_lookup (vm_map_t *, vm_offset_t, vm_prot_t, vm_map_entry_t *, vm_object_t *, 553 vm_pindex_t *, vm_prot_t *, boolean_t *); 554 void vm_map_lookup_done (vm_map_t, vm_map_entry_t, int); 555 boolean_t vm_map_lookup_entry (vm_map_t, vm_offset_t, vm_map_entry_t *); 556 int vm_map_wire (vm_map_t, vm_offset_t, vm_offset_t, int); 557 int vm_map_unwire (vm_map_t, vm_offset_t, vm_offset_t, boolean_t); 558 int vm_map_clean (vm_map_t, vm_offset_t, vm_offset_t, boolean_t, boolean_t); 559 int vm_map_protect (vm_map_t, vm_offset_t, vm_offset_t, vm_prot_t, boolean_t); 560 int vm_map_remove (vm_map_t, vm_offset_t, vm_offset_t); 561 void vm_map_startup (void); 562 int vm_map_submap (vm_map_t, vm_offset_t, vm_offset_t, vm_map_t); 563 int vm_map_madvise (vm_map_t, vm_offset_t, vm_offset_t, int, off_t); 564 void vm_map_simplify_entry (vm_map_t, vm_map_entry_t, int *); 565 void vm_init2 (void); 566 int vm_uiomove (vm_map_t, vm_object_t, off_t, int, vm_offset_t, int *); 567 int vm_map_stack (vm_map_t, vm_offset_t, vm_size_t, int, 568 vm_prot_t, vm_prot_t, int); 569 int vm_map_growstack (struct proc *p, vm_offset_t addr); 570 int vmspace_swap_count (struct vmspace *vmspace); 571 int vmspace_anonymous_count (struct vmspace *vmspace); 572 void vm_map_set_wired_quick(vm_map_t map, vm_offset_t addr, vm_size_t size, int *); 573 void vm_map_transition_wait(vm_map_t map); 574 575 #if defined(__x86_64__) && defined(_KERNEL_VIRTUAL) 576 int vkernel_module_memory_alloc(vm_offset_t *, size_t); 577 void vkernel_module_memory_free(vm_offset_t, size_t); 578 #endif 579 580 #endif 581 #endif /* _VM_VM_MAP_H_ */ 582