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