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