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