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