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