2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * from: @(#)vm_map.c 8.3 (Berkeley) 1/12/94
37 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38 * All rights reserved.
40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
42 * Permission to use, copy, modify and distribute this software and
43 * its documentation is hereby granted, provided that both the copyright
44 * notice and this permission notice appear in all copies of the
45 * software, derivative works or modified versions, and any portions
46 * thereof, and that both notices appear in supporting documentation.
48 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
49 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
50 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
52 * Carnegie Mellon requests users of this software to return to
54 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
55 * School of Computer Science
56 * Carnegie Mellon University
57 * Pittsburgh PA 15213-3890
59 * any improvements or extensions that they make and grant Carnegie the
60 * rights to redistribute these changes.
64 * Virtual memory mapping module.
67 #include <sys/cdefs.h>
68 __FBSDID("$FreeBSD$");
70 #include <sys/param.h>
71 #include <sys/systm.h>
73 #include <sys/kernel.h>
76 #include <sys/mutex.h>
78 #include <sys/vmmeter.h>
80 #include <sys/vnode.h>
81 #include <sys/racct.h>
82 #include <sys/resourcevar.h>
83 #include <sys/rwlock.h>
85 #include <sys/sysctl.h>
86 #include <sys/sysent.h>
90 #include <vm/vm_param.h>
92 #include <vm/vm_map.h>
93 #include <vm/vm_page.h>
94 #include <vm/vm_pageout.h>
95 #include <vm/vm_object.h>
96 #include <vm/vm_pager.h>
97 #include <vm/vm_kern.h>
98 #include <vm/vm_extern.h>
99 #include <vm/vnode_pager.h>
100 #include <vm/swap_pager.h>
104 * Virtual memory maps provide for the mapping, protection,
105 * and sharing of virtual memory objects. In addition,
106 * this module provides for an efficient virtual copy of
107 * memory from one map to another.
109 * Synchronization is required prior to most operations.
111 * Maps consist of an ordered doubly-linked list of simple
112 * entries; a self-adjusting binary search tree of these
113 * entries is used to speed up lookups.
115 * Since portions of maps are specified by start/end addresses,
116 * which may not align with existing map entries, all
117 * routines merely "clip" entries to these start/end values.
118 * [That is, an entry is split into two, bordering at a
119 * start or end value.] Note that these clippings may not
120 * always be necessary (as the two resulting entries are then
121 * not changed); however, the clipping is done for convenience.
123 * As mentioned above, virtual copy operations are performed
124 * by copying VM object references from one map to
125 * another, and then marking both regions as copy-on-write.
128 static struct mtx map_sleep_mtx;
129 static uma_zone_t mapentzone;
130 static uma_zone_t kmapentzone;
131 static uma_zone_t vmspace_zone;
132 static int vmspace_zinit(void *mem, int size, int flags);
133 static void _vm_map_init(vm_map_t map, pmap_t pmap, vm_offset_t min,
135 static void vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map);
136 static void vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry);
137 static void vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry);
138 static int vm_map_growstack(vm_map_t map, vm_offset_t addr,
139 vm_map_entry_t gap_entry);
140 static void vm_map_pmap_enter(vm_map_t map, vm_offset_t addr, vm_prot_t prot,
141 vm_object_t object, vm_pindex_t pindex, vm_size_t size, int flags);
143 static void vmspace_zdtor(void *mem, int size, void *arg);
145 static int vm_map_stack_locked(vm_map_t map, vm_offset_t addrbos,
146 vm_size_t max_ssize, vm_size_t growsize, vm_prot_t prot, vm_prot_t max,
148 static void vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry,
149 vm_offset_t failed_addr);
151 #define ENTRY_CHARGED(e) ((e)->cred != NULL || \
152 ((e)->object.vm_object != NULL && (e)->object.vm_object->cred != NULL && \
153 !((e)->eflags & MAP_ENTRY_NEEDS_COPY)))
156 * PROC_VMSPACE_{UN,}LOCK() can be a noop as long as vmspaces are type
159 #define PROC_VMSPACE_LOCK(p) do { } while (0)
160 #define PROC_VMSPACE_UNLOCK(p) do { } while (0)
163 * VM_MAP_RANGE_CHECK: [ internal use only ]
165 * Asserts that the starting and ending region
166 * addresses fall within the valid range of the map.
168 #define VM_MAP_RANGE_CHECK(map, start, end) \
170 if (start < vm_map_min(map)) \
171 start = vm_map_min(map); \
172 if (end > vm_map_max(map)) \
173 end = vm_map_max(map); \
178 #ifndef UMA_MD_SMALL_ALLOC
181 * Allocate a new slab for kernel map entries. The kernel map may be locked or
182 * unlocked, depending on whether the request is coming from the kernel map or a
183 * submap. This function allocates a virtual address range directly from the
184 * kernel map instead of the kmem_* layer to avoid recursion on the kernel map
185 * lock and also to avoid triggering allocator recursion in the vmem boundary
189 kmapent_alloc(uma_zone_t zone, vm_size_t bytes, int domain, uint8_t *pflag,
195 *pflag = UMA_SLAB_PRIV;
197 if (!(locked = vm_map_locked(kernel_map)))
198 vm_map_lock(kernel_map);
199 addr = vm_map_findspace(kernel_map, vm_map_min(kernel_map), bytes);
200 if (addr + bytes < addr || addr + bytes > vm_map_max(kernel_map))
201 panic("%s: kernel map is exhausted", __func__);
202 error = vm_map_insert(kernel_map, NULL, 0, addr, addr + bytes,
203 VM_PROT_RW, VM_PROT_RW, MAP_NOFAULT);
204 if (error != KERN_SUCCESS)
205 panic("%s: vm_map_insert() failed: %d", __func__, error);
207 vm_map_unlock(kernel_map);
208 error = kmem_back_domain(domain, kernel_object, addr, bytes, M_NOWAIT |
209 M_USE_RESERVE | (wait & M_ZERO));
210 if (error == KERN_SUCCESS) {
211 return ((void *)addr);
214 vm_map_lock(kernel_map);
215 vm_map_delete(kernel_map, addr, bytes);
217 vm_map_unlock(kernel_map);
223 kmapent_free(void *item, vm_size_t size, uint8_t pflag)
228 if ((pflag & UMA_SLAB_PRIV) == 0)
232 addr = (vm_offset_t)item;
233 kmem_unback(kernel_object, addr, size);
234 error = vm_map_remove(kernel_map, addr, addr + size);
235 KASSERT(error == KERN_SUCCESS,
236 ("%s: vm_map_remove failed: %d", __func__, error));
240 * The worst-case upper bound on the number of kernel map entries that may be
241 * created before the zone must be replenished in _vm_map_unlock().
243 #define KMAPENT_RESERVE 1
245 #endif /* !UMD_MD_SMALL_ALLOC */
250 * Initialize the vm_map module. Must be called before any other vm_map
253 * User map and entry structures are allocated from the general purpose
254 * memory pool. Kernel maps are statically defined. Kernel map entries
255 * require special handling to avoid recursion; see the comments above
256 * kmapent_alloc() and in vm_map_entry_create().
261 mtx_init(&map_sleep_mtx, "vm map sleep mutex", NULL, MTX_DEF);
264 * Disable the use of per-CPU buckets: map entry allocation is
265 * serialized by the kernel map lock.
267 kmapentzone = uma_zcreate("KMAP ENTRY", sizeof(struct vm_map_entry),
268 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
269 UMA_ZONE_VM | UMA_ZONE_NOBUCKET);
270 #ifndef UMA_MD_SMALL_ALLOC
271 /* Reserve an extra map entry for use when replenishing the reserve. */
272 uma_zone_reserve(kmapentzone, KMAPENT_RESERVE + 1);
273 uma_prealloc(kmapentzone, KMAPENT_RESERVE + 1);
274 uma_zone_set_allocf(kmapentzone, kmapent_alloc);
275 uma_zone_set_freef(kmapentzone, kmapent_free);
278 mapentzone = uma_zcreate("MAP ENTRY", sizeof(struct vm_map_entry),
279 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
280 vmspace_zone = uma_zcreate("VMSPACE", sizeof(struct vmspace), NULL,
286 vmspace_zinit, NULL, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
290 vmspace_zinit(void *mem, int size, int flags)
295 vm = (struct vmspace *)mem;
298 memset(map, 0, sizeof(*map));
299 mtx_init(&map->system_mtx, "vm map (system)", NULL,
300 MTX_DEF | MTX_DUPOK);
301 sx_init(&map->lock, "vm map (user)");
302 PMAP_LOCK_INIT(vmspace_pmap(vm));
308 vmspace_zdtor(void *mem, int size, void *arg)
312 vm = (struct vmspace *)mem;
313 KASSERT(vm->vm_map.nentries == 0,
314 ("vmspace %p nentries == %d on free", vm, vm->vm_map.nentries));
315 KASSERT(vm->vm_map.size == 0,
316 ("vmspace %p size == %ju on free", vm, (uintmax_t)vm->vm_map.size));
318 #endif /* INVARIANTS */
321 * Allocate a vmspace structure, including a vm_map and pmap,
322 * and initialize those structures. The refcnt is set to 1.
325 vmspace_alloc(vm_offset_t min, vm_offset_t max, pmap_pinit_t pinit)
329 vm = uma_zalloc(vmspace_zone, M_WAITOK);
330 KASSERT(vm->vm_map.pmap == NULL, ("vm_map.pmap must be NULL"));
331 if (!pinit(vmspace_pmap(vm))) {
332 uma_zfree(vmspace_zone, vm);
335 CTR1(KTR_VM, "vmspace_alloc: %p", vm);
336 _vm_map_init(&vm->vm_map, vmspace_pmap(vm), min, max);
337 refcount_init(&vm->vm_refcnt, 1);
351 vmspace_container_reset(struct proc *p)
355 racct_set(p, RACCT_DATA, 0);
356 racct_set(p, RACCT_STACK, 0);
357 racct_set(p, RACCT_RSS, 0);
358 racct_set(p, RACCT_MEMLOCK, 0);
359 racct_set(p, RACCT_VMEM, 0);
365 vmspace_dofree(struct vmspace *vm)
368 CTR1(KTR_VM, "vmspace_free: %p", vm);
371 * Make sure any SysV shm is freed, it might not have been in
377 * Lock the map, to wait out all other references to it.
378 * Delete all of the mappings and pages they hold, then call
379 * the pmap module to reclaim anything left.
381 (void)vm_map_remove(&vm->vm_map, vm_map_min(&vm->vm_map),
382 vm_map_max(&vm->vm_map));
384 pmap_release(vmspace_pmap(vm));
385 vm->vm_map.pmap = NULL;
386 uma_zfree(vmspace_zone, vm);
390 vmspace_free(struct vmspace *vm)
393 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
394 "vmspace_free() called");
396 if (refcount_release(&vm->vm_refcnt))
401 vmspace_exitfree(struct proc *p)
405 PROC_VMSPACE_LOCK(p);
408 PROC_VMSPACE_UNLOCK(p);
409 KASSERT(vm == &vmspace0, ("vmspace_exitfree: wrong vmspace"));
414 vmspace_exit(struct thread *td)
424 * Prepare to release the vmspace reference. The thread that releases
425 * the last reference is responsible for tearing down the vmspace.
426 * However, threads not releasing the final reference must switch to the
427 * kernel's vmspace0 before the decrement so that the subsequent pmap
428 * deactivation does not modify a freed vmspace.
430 refcount_acquire(&vmspace0.vm_refcnt);
431 if (!(released = refcount_release_if_last(&vm->vm_refcnt))) {
432 if (p->p_vmspace != &vmspace0) {
433 PROC_VMSPACE_LOCK(p);
434 p->p_vmspace = &vmspace0;
435 PROC_VMSPACE_UNLOCK(p);
438 released = refcount_release(&vm->vm_refcnt);
442 * pmap_remove_pages() expects the pmap to be active, so switch
443 * back first if necessary.
445 if (p->p_vmspace != vm) {
446 PROC_VMSPACE_LOCK(p);
448 PROC_VMSPACE_UNLOCK(p);
451 pmap_remove_pages(vmspace_pmap(vm));
452 PROC_VMSPACE_LOCK(p);
453 p->p_vmspace = &vmspace0;
454 PROC_VMSPACE_UNLOCK(p);
460 vmspace_container_reset(p);
464 /* Acquire reference to vmspace owned by another process. */
467 vmspace_acquire_ref(struct proc *p)
471 PROC_VMSPACE_LOCK(p);
473 if (vm == NULL || !refcount_acquire_if_not_zero(&vm->vm_refcnt)) {
474 PROC_VMSPACE_UNLOCK(p);
477 if (vm != p->p_vmspace) {
478 PROC_VMSPACE_UNLOCK(p);
482 PROC_VMSPACE_UNLOCK(p);
487 * Switch between vmspaces in an AIO kernel process.
489 * The new vmspace is either the vmspace of a user process obtained
490 * from an active AIO request or the initial vmspace of the AIO kernel
491 * process (when it is idling). Because user processes will block to
492 * drain any active AIO requests before proceeding in exit() or
493 * execve(), the reference count for vmspaces from AIO requests can
494 * never be 0. Similarly, AIO kernel processes hold an extra
495 * reference on their initial vmspace for the life of the process. As
496 * a result, the 'newvm' vmspace always has a non-zero reference
497 * count. This permits an additional reference on 'newvm' to be
498 * acquired via a simple atomic increment rather than the loop in
499 * vmspace_acquire_ref() above.
502 vmspace_switch_aio(struct vmspace *newvm)
504 struct vmspace *oldvm;
506 /* XXX: Need some way to assert that this is an aio daemon. */
508 KASSERT(refcount_load(&newvm->vm_refcnt) > 0,
509 ("vmspace_switch_aio: newvm unreferenced"));
511 oldvm = curproc->p_vmspace;
516 * Point to the new address space and refer to it.
518 curproc->p_vmspace = newvm;
519 refcount_acquire(&newvm->vm_refcnt);
521 /* Activate the new mapping. */
522 pmap_activate(curthread);
528 _vm_map_lock(vm_map_t map, const char *file, int line)
532 mtx_lock_flags_(&map->system_mtx, 0, file, line);
534 sx_xlock_(&map->lock, file, line);
539 vm_map_entry_set_vnode_text(vm_map_entry_t entry, bool add)
545 if ((entry->eflags & MAP_ENTRY_VN_EXEC) == 0)
547 KASSERT((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0,
548 ("Submap with execs"));
549 object = entry->object.vm_object;
550 KASSERT(object != NULL, ("No object for text, entry %p", entry));
551 if ((object->flags & OBJ_ANON) != 0)
552 object = object->handle;
554 KASSERT(object->backing_object == NULL,
555 ("non-anon object %p shadows", object));
556 KASSERT(object != NULL, ("No content object for text, entry %p obj %p",
557 entry, entry->object.vm_object));
560 * Mostly, we do not lock the backing object. It is
561 * referenced by the entry we are processing, so it cannot go
564 vm_pager_getvp(object, &vp, &vp_held);
567 VOP_SET_TEXT_CHECKED(vp);
569 vn_lock(vp, LK_SHARED | LK_RETRY);
570 VOP_UNSET_TEXT_CHECKED(vp);
579 * Use a different name for this vm_map_entry field when it's use
580 * is not consistent with its use as part of an ordered search tree.
582 #define defer_next right
585 vm_map_process_deferred(void)
588 vm_map_entry_t entry, next;
592 entry = td->td_map_def_user;
593 td->td_map_def_user = NULL;
594 while (entry != NULL) {
595 next = entry->defer_next;
596 MPASS((entry->eflags & (MAP_ENTRY_WRITECNT |
597 MAP_ENTRY_VN_EXEC)) != (MAP_ENTRY_WRITECNT |
599 if ((entry->eflags & MAP_ENTRY_WRITECNT) != 0) {
601 * Decrement the object's writemappings and
602 * possibly the vnode's v_writecount.
604 KASSERT((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0,
605 ("Submap with writecount"));
606 object = entry->object.vm_object;
607 KASSERT(object != NULL, ("No object for writecount"));
608 vm_pager_release_writecount(object, entry->start,
611 vm_map_entry_set_vnode_text(entry, false);
612 vm_map_entry_deallocate(entry, FALSE);
619 _vm_map_assert_locked(vm_map_t map, const char *file, int line)
623 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
625 sx_assert_(&map->lock, SA_XLOCKED, file, line);
628 #define VM_MAP_ASSERT_LOCKED(map) \
629 _vm_map_assert_locked(map, LOCK_FILE, LOCK_LINE)
631 enum { VMMAP_CHECK_NONE, VMMAP_CHECK_UNLOCK, VMMAP_CHECK_ALL };
633 static int enable_vmmap_check = VMMAP_CHECK_UNLOCK;
635 static int enable_vmmap_check = VMMAP_CHECK_NONE;
637 SYSCTL_INT(_debug, OID_AUTO, vmmap_check, CTLFLAG_RWTUN,
638 &enable_vmmap_check, 0, "Enable vm map consistency checking");
640 static void _vm_map_assert_consistent(vm_map_t map, int check);
642 #define VM_MAP_ASSERT_CONSISTENT(map) \
643 _vm_map_assert_consistent(map, VMMAP_CHECK_ALL)
645 #define VM_MAP_UNLOCK_CONSISTENT(map) do { \
646 if (map->nupdates > map->nentries) { \
647 _vm_map_assert_consistent(map, VMMAP_CHECK_UNLOCK); \
652 #define VM_MAP_UNLOCK_CONSISTENT(map)
655 #define VM_MAP_ASSERT_LOCKED(map)
656 #define VM_MAP_ASSERT_CONSISTENT(map)
657 #define VM_MAP_UNLOCK_CONSISTENT(map)
658 #endif /* INVARIANTS */
661 _vm_map_unlock(vm_map_t map, const char *file, int line)
664 VM_MAP_UNLOCK_CONSISTENT(map);
665 if (map->system_map) {
666 #ifndef UMA_MD_SMALL_ALLOC
667 if (map == kernel_map && (map->flags & MAP_REPLENISH) != 0) {
668 uma_prealloc(kmapentzone, 1);
669 map->flags &= ~MAP_REPLENISH;
672 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
674 sx_xunlock_(&map->lock, file, line);
675 vm_map_process_deferred();
680 _vm_map_lock_read(vm_map_t map, const char *file, int line)
684 mtx_lock_flags_(&map->system_mtx, 0, file, line);
686 sx_slock_(&map->lock, file, line);
690 _vm_map_unlock_read(vm_map_t map, const char *file, int line)
693 if (map->system_map) {
694 KASSERT((map->flags & MAP_REPLENISH) == 0,
695 ("%s: MAP_REPLENISH leaked", __func__));
696 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
698 sx_sunlock_(&map->lock, file, line);
699 vm_map_process_deferred();
704 _vm_map_trylock(vm_map_t map, const char *file, int line)
708 error = map->system_map ?
709 !mtx_trylock_flags_(&map->system_mtx, 0, file, line) :
710 !sx_try_xlock_(&map->lock, file, line);
717 _vm_map_trylock_read(vm_map_t map, const char *file, int line)
721 error = map->system_map ?
722 !mtx_trylock_flags_(&map->system_mtx, 0, file, line) :
723 !sx_try_slock_(&map->lock, file, line);
728 * _vm_map_lock_upgrade: [ internal use only ]
730 * Tries to upgrade a read (shared) lock on the specified map to a write
731 * (exclusive) lock. Returns the value "0" if the upgrade succeeds and a
732 * non-zero value if the upgrade fails. If the upgrade fails, the map is
733 * returned without a read or write lock held.
735 * Requires that the map be read locked.
738 _vm_map_lock_upgrade(vm_map_t map, const char *file, int line)
740 unsigned int last_timestamp;
742 if (map->system_map) {
743 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
745 if (!sx_try_upgrade_(&map->lock, file, line)) {
746 last_timestamp = map->timestamp;
747 sx_sunlock_(&map->lock, file, line);
748 vm_map_process_deferred();
750 * If the map's timestamp does not change while the
751 * map is unlocked, then the upgrade succeeds.
753 sx_xlock_(&map->lock, file, line);
754 if (last_timestamp != map->timestamp) {
755 sx_xunlock_(&map->lock, file, line);
765 _vm_map_lock_downgrade(vm_map_t map, const char *file, int line)
768 if (map->system_map) {
769 KASSERT((map->flags & MAP_REPLENISH) == 0,
770 ("%s: MAP_REPLENISH leaked", __func__));
771 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
773 VM_MAP_UNLOCK_CONSISTENT(map);
774 sx_downgrade_(&map->lock, file, line);
781 * Returns a non-zero value if the caller holds a write (exclusive) lock
782 * on the specified map and the value "0" otherwise.
785 vm_map_locked(vm_map_t map)
789 return (mtx_owned(&map->system_mtx));
791 return (sx_xlocked(&map->lock));
795 * _vm_map_unlock_and_wait:
797 * Atomically releases the lock on the specified map and puts the calling
798 * thread to sleep. The calling thread will remain asleep until either
799 * vm_map_wakeup() is performed on the map or the specified timeout is
802 * WARNING! This function does not perform deferred deallocations of
803 * objects and map entries. Therefore, the calling thread is expected to
804 * reacquire the map lock after reawakening and later perform an ordinary
805 * unlock operation, such as vm_map_unlock(), before completing its
806 * operation on the map.
809 _vm_map_unlock_and_wait(vm_map_t map, int timo, const char *file, int line)
812 VM_MAP_UNLOCK_CONSISTENT(map);
813 mtx_lock(&map_sleep_mtx);
814 if (map->system_map) {
815 KASSERT((map->flags & MAP_REPLENISH) == 0,
816 ("%s: MAP_REPLENISH leaked", __func__));
817 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
819 sx_xunlock_(&map->lock, file, line);
821 return (msleep(&map->root, &map_sleep_mtx, PDROP | PVM, "vmmaps",
828 * Awaken any threads that have slept on the map using
829 * vm_map_unlock_and_wait().
832 vm_map_wakeup(vm_map_t map)
836 * Acquire and release map_sleep_mtx to prevent a wakeup()
837 * from being performed (and lost) between the map unlock
838 * and the msleep() in _vm_map_unlock_and_wait().
840 mtx_lock(&map_sleep_mtx);
841 mtx_unlock(&map_sleep_mtx);
846 vm_map_busy(vm_map_t map)
849 VM_MAP_ASSERT_LOCKED(map);
854 vm_map_unbusy(vm_map_t map)
857 VM_MAP_ASSERT_LOCKED(map);
858 KASSERT(map->busy, ("vm_map_unbusy: not busy"));
859 if (--map->busy == 0 && (map->flags & MAP_BUSY_WAKEUP)) {
860 vm_map_modflags(map, 0, MAP_BUSY_WAKEUP);
866 vm_map_wait_busy(vm_map_t map)
869 VM_MAP_ASSERT_LOCKED(map);
871 vm_map_modflags(map, MAP_BUSY_WAKEUP, 0);
873 msleep(&map->busy, &map->system_mtx, 0, "mbusy", 0);
875 sx_sleep(&map->busy, &map->lock, 0, "mbusy", 0);
881 vmspace_resident_count(struct vmspace *vmspace)
883 return pmap_resident_count(vmspace_pmap(vmspace));
887 * Initialize an existing vm_map structure
888 * such as that in the vmspace structure.
891 _vm_map_init(vm_map_t map, pmap_t pmap, vm_offset_t min, vm_offset_t max)
894 map->header.eflags = MAP_ENTRY_HEADER;
895 map->needs_wakeup = FALSE;
898 map->header.end = min;
899 map->header.start = max;
901 map->header.left = map->header.right = &map->header;
912 vm_map_init(vm_map_t map, pmap_t pmap, vm_offset_t min, vm_offset_t max)
915 _vm_map_init(map, pmap, min, max);
916 mtx_init(&map->system_mtx, "vm map (system)", NULL,
917 MTX_DEF | MTX_DUPOK);
918 sx_init(&map->lock, "vm map (user)");
922 * vm_map_entry_dispose: [ internal use only ]
924 * Inverse of vm_map_entry_create.
927 vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry)
929 uma_zfree(map->system_map ? kmapentzone : mapentzone, entry);
933 * vm_map_entry_create: [ internal use only ]
935 * Allocates a VM map entry for insertion.
936 * No entry fields are filled in.
938 static vm_map_entry_t
939 vm_map_entry_create(vm_map_t map)
941 vm_map_entry_t new_entry;
943 #ifndef UMA_MD_SMALL_ALLOC
944 if (map == kernel_map) {
945 VM_MAP_ASSERT_LOCKED(map);
948 * A new slab of kernel map entries cannot be allocated at this
949 * point because the kernel map has not yet been updated to
950 * reflect the caller's request. Therefore, we allocate a new
951 * map entry, dipping into the reserve if necessary, and set a
952 * flag indicating that the reserve must be replenished before
953 * the map is unlocked.
955 new_entry = uma_zalloc(kmapentzone, M_NOWAIT | M_NOVM);
956 if (new_entry == NULL) {
957 new_entry = uma_zalloc(kmapentzone,
958 M_NOWAIT | M_NOVM | M_USE_RESERVE);
959 kernel_map->flags |= MAP_REPLENISH;
963 if (map->system_map) {
964 new_entry = uma_zalloc(kmapentzone, M_NOWAIT);
966 new_entry = uma_zalloc(mapentzone, M_WAITOK);
968 KASSERT(new_entry != NULL,
969 ("vm_map_entry_create: kernel resources exhausted"));
974 * vm_map_entry_set_behavior:
976 * Set the expected access behavior, either normal, random, or
980 vm_map_entry_set_behavior(vm_map_entry_t entry, u_char behavior)
982 entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) |
983 (behavior & MAP_ENTRY_BEHAV_MASK);
987 * vm_map_entry_max_free_{left,right}:
989 * Compute the size of the largest free gap between two entries,
990 * one the root of a tree and the other the ancestor of that root
991 * that is the least or greatest ancestor found on the search path.
993 static inline vm_size_t
994 vm_map_entry_max_free_left(vm_map_entry_t root, vm_map_entry_t left_ancestor)
997 return (root->left != left_ancestor ?
998 root->left->max_free : root->start - left_ancestor->end);
1001 static inline vm_size_t
1002 vm_map_entry_max_free_right(vm_map_entry_t root, vm_map_entry_t right_ancestor)
1005 return (root->right != right_ancestor ?
1006 root->right->max_free : right_ancestor->start - root->end);
1010 * vm_map_entry_{pred,succ}:
1012 * Find the {predecessor, successor} of the entry by taking one step
1013 * in the appropriate direction and backtracking as much as necessary.
1014 * vm_map_entry_succ is defined in vm_map.h.
1016 static inline vm_map_entry_t
1017 vm_map_entry_pred(vm_map_entry_t entry)
1019 vm_map_entry_t prior;
1021 prior = entry->left;
1022 if (prior->right->start < entry->start) {
1024 prior = prior->right;
1025 while (prior->right != entry);
1030 static inline vm_size_t
1031 vm_size_max(vm_size_t a, vm_size_t b)
1034 return (a > b ? a : b);
1037 #define SPLAY_LEFT_STEP(root, y, llist, rlist, test) do { \
1039 vm_size_t max_free; \
1042 * Infer root->right->max_free == root->max_free when \
1043 * y->max_free < root->max_free || root->max_free == 0. \
1044 * Otherwise, look right to find it. \
1047 max_free = root->max_free; \
1048 KASSERT(max_free == vm_size_max( \
1049 vm_map_entry_max_free_left(root, llist), \
1050 vm_map_entry_max_free_right(root, rlist)), \
1051 ("%s: max_free invariant fails", __func__)); \
1052 if (max_free - 1 < vm_map_entry_max_free_left(root, llist)) \
1053 max_free = vm_map_entry_max_free_right(root, rlist); \
1054 if (y != llist && (test)) { \
1055 /* Rotate right and make y root. */ \
1060 if (max_free < y->max_free) \
1061 root->max_free = max_free = \
1062 vm_size_max(max_free, z->max_free); \
1063 } else if (max_free < y->max_free) \
1064 root->max_free = max_free = \
1065 vm_size_max(max_free, root->start - y->end);\
1069 /* Copy right->max_free. Put root on rlist. */ \
1070 root->max_free = max_free; \
1071 KASSERT(max_free == vm_map_entry_max_free_right(root, rlist), \
1072 ("%s: max_free not copied from right", __func__)); \
1073 root->left = rlist; \
1075 root = y != llist ? y : NULL; \
1078 #define SPLAY_RIGHT_STEP(root, y, llist, rlist, test) do { \
1080 vm_size_t max_free; \
1083 * Infer root->left->max_free == root->max_free when \
1084 * y->max_free < root->max_free || root->max_free == 0. \
1085 * Otherwise, look left to find it. \
1088 max_free = root->max_free; \
1089 KASSERT(max_free == vm_size_max( \
1090 vm_map_entry_max_free_left(root, llist), \
1091 vm_map_entry_max_free_right(root, rlist)), \
1092 ("%s: max_free invariant fails", __func__)); \
1093 if (max_free - 1 < vm_map_entry_max_free_right(root, rlist)) \
1094 max_free = vm_map_entry_max_free_left(root, llist); \
1095 if (y != rlist && (test)) { \
1096 /* Rotate left and make y root. */ \
1101 if (max_free < y->max_free) \
1102 root->max_free = max_free = \
1103 vm_size_max(max_free, z->max_free); \
1104 } else if (max_free < y->max_free) \
1105 root->max_free = max_free = \
1106 vm_size_max(max_free, y->start - root->end);\
1110 /* Copy left->max_free. Put root on llist. */ \
1111 root->max_free = max_free; \
1112 KASSERT(max_free == vm_map_entry_max_free_left(root, llist), \
1113 ("%s: max_free not copied from left", __func__)); \
1114 root->right = llist; \
1116 root = y != rlist ? y : NULL; \
1120 * Walk down the tree until we find addr or a gap where addr would go, breaking
1121 * off left and right subtrees of nodes less than, or greater than addr. Treat
1122 * subtrees with root->max_free < length as empty trees. llist and rlist are
1123 * the two sides in reverse order (bottom-up), with llist linked by the right
1124 * pointer and rlist linked by the left pointer in the vm_map_entry, and both
1125 * lists terminated by &map->header. This function, and the subsequent call to
1126 * vm_map_splay_merge_{left,right,pred,succ}, rely on the start and end address
1127 * values in &map->header.
1129 static __always_inline vm_map_entry_t
1130 vm_map_splay_split(vm_map_t map, vm_offset_t addr, vm_size_t length,
1131 vm_map_entry_t *llist, vm_map_entry_t *rlist)
1133 vm_map_entry_t left, right, root, y;
1135 left = right = &map->header;
1137 while (root != NULL && root->max_free >= length) {
1138 KASSERT(left->end <= root->start &&
1139 root->end <= right->start,
1140 ("%s: root not within tree bounds", __func__));
1141 if (addr < root->start) {
1142 SPLAY_LEFT_STEP(root, y, left, right,
1143 y->max_free >= length && addr < y->start);
1144 } else if (addr >= root->end) {
1145 SPLAY_RIGHT_STEP(root, y, left, right,
1146 y->max_free >= length && addr >= y->end);
1155 static __always_inline void
1156 vm_map_splay_findnext(vm_map_entry_t root, vm_map_entry_t *rlist)
1158 vm_map_entry_t hi, right, y;
1161 hi = root->right == right ? NULL : root->right;
1165 SPLAY_LEFT_STEP(hi, y, root, right, true);
1170 static __always_inline void
1171 vm_map_splay_findprev(vm_map_entry_t root, vm_map_entry_t *llist)
1173 vm_map_entry_t left, lo, y;
1176 lo = root->left == left ? NULL : root->left;
1180 SPLAY_RIGHT_STEP(lo, y, left, root, true);
1186 vm_map_entry_swap(vm_map_entry_t *a, vm_map_entry_t *b)
1196 * Walk back up the two spines, flip the pointers and set max_free. The
1197 * subtrees of the root go at the bottom of llist and rlist.
1200 vm_map_splay_merge_left_walk(vm_map_entry_t header, vm_map_entry_t root,
1201 vm_map_entry_t tail, vm_size_t max_free, vm_map_entry_t llist)
1205 * The max_free values of the children of llist are in
1206 * llist->max_free and max_free. Update with the
1209 llist->max_free = max_free =
1210 vm_size_max(llist->max_free, max_free);
1211 vm_map_entry_swap(&llist->right, &tail);
1212 vm_map_entry_swap(&tail, &llist);
1213 } while (llist != header);
1219 * When llist is known to be the predecessor of root.
1221 static inline vm_size_t
1222 vm_map_splay_merge_pred(vm_map_entry_t header, vm_map_entry_t root,
1223 vm_map_entry_t llist)
1227 max_free = root->start - llist->end;
1228 if (llist != header) {
1229 max_free = vm_map_splay_merge_left_walk(header, root,
1230 root, max_free, llist);
1232 root->left = header;
1233 header->right = root;
1239 * When llist may or may not be the predecessor of root.
1241 static inline vm_size_t
1242 vm_map_splay_merge_left(vm_map_entry_t header, vm_map_entry_t root,
1243 vm_map_entry_t llist)
1247 max_free = vm_map_entry_max_free_left(root, llist);
1248 if (llist != header) {
1249 max_free = vm_map_splay_merge_left_walk(header, root,
1250 root->left == llist ? root : root->left,
1257 vm_map_splay_merge_right_walk(vm_map_entry_t header, vm_map_entry_t root,
1258 vm_map_entry_t tail, vm_size_t max_free, vm_map_entry_t rlist)
1262 * The max_free values of the children of rlist are in
1263 * rlist->max_free and max_free. Update with the
1266 rlist->max_free = max_free =
1267 vm_size_max(rlist->max_free, max_free);
1268 vm_map_entry_swap(&rlist->left, &tail);
1269 vm_map_entry_swap(&tail, &rlist);
1270 } while (rlist != header);
1276 * When rlist is known to be the succecessor of root.
1278 static inline vm_size_t
1279 vm_map_splay_merge_succ(vm_map_entry_t header, vm_map_entry_t root,
1280 vm_map_entry_t rlist)
1284 max_free = rlist->start - root->end;
1285 if (rlist != header) {
1286 max_free = vm_map_splay_merge_right_walk(header, root,
1287 root, max_free, rlist);
1289 root->right = header;
1290 header->left = root;
1296 * When rlist may or may not be the succecessor of root.
1298 static inline vm_size_t
1299 vm_map_splay_merge_right(vm_map_entry_t header, vm_map_entry_t root,
1300 vm_map_entry_t rlist)
1304 max_free = vm_map_entry_max_free_right(root, rlist);
1305 if (rlist != header) {
1306 max_free = vm_map_splay_merge_right_walk(header, root,
1307 root->right == rlist ? root : root->right,
1316 * The Sleator and Tarjan top-down splay algorithm with the
1317 * following variation. Max_free must be computed bottom-up, so
1318 * on the downward pass, maintain the left and right spines in
1319 * reverse order. Then, make a second pass up each side to fix
1320 * the pointers and compute max_free. The time bound is O(log n)
1323 * The tree is threaded, which means that there are no null pointers.
1324 * When a node has no left child, its left pointer points to its
1325 * predecessor, which the last ancestor on the search path from the root
1326 * where the search branched right. Likewise, when a node has no right
1327 * child, its right pointer points to its successor. The map header node
1328 * is the predecessor of the first map entry, and the successor of the
1331 * The new root is the vm_map_entry containing "addr", or else an
1332 * adjacent entry (lower if possible) if addr is not in the tree.
1334 * The map must be locked, and leaves it so.
1336 * Returns: the new root.
1338 static vm_map_entry_t
1339 vm_map_splay(vm_map_t map, vm_offset_t addr)
1341 vm_map_entry_t header, llist, rlist, root;
1342 vm_size_t max_free_left, max_free_right;
1344 header = &map->header;
1345 root = vm_map_splay_split(map, addr, 0, &llist, &rlist);
1347 max_free_left = vm_map_splay_merge_left(header, root, llist);
1348 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1349 } else if (llist != header) {
1351 * Recover the greatest node in the left
1352 * subtree and make it the root.
1355 llist = root->right;
1356 max_free_left = vm_map_splay_merge_left(header, root, llist);
1357 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1358 } else if (rlist != header) {
1360 * Recover the least node in the right
1361 * subtree and make it the root.
1365 max_free_left = vm_map_splay_merge_pred(header, root, llist);
1366 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1368 /* There is no root. */
1371 root->max_free = vm_size_max(max_free_left, max_free_right);
1373 VM_MAP_ASSERT_CONSISTENT(map);
1378 * vm_map_entry_{un,}link:
1380 * Insert/remove entries from maps. On linking, if new entry clips
1381 * existing entry, trim existing entry to avoid overlap, and manage
1382 * offsets. On unlinking, merge disappearing entry with neighbor, if
1383 * called for, and manage offsets. Callers should not modify fields in
1384 * entries already mapped.
1387 vm_map_entry_link(vm_map_t map, vm_map_entry_t entry)
1389 vm_map_entry_t header, llist, rlist, root;
1390 vm_size_t max_free_left, max_free_right;
1393 "vm_map_entry_link: map %p, nentries %d, entry %p", map,
1394 map->nentries, entry);
1395 VM_MAP_ASSERT_LOCKED(map);
1397 header = &map->header;
1398 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1401 * The new entry does not overlap any existing entry in the
1402 * map, so it becomes the new root of the map tree.
1404 max_free_left = vm_map_splay_merge_pred(header, entry, llist);
1405 max_free_right = vm_map_splay_merge_succ(header, entry, rlist);
1406 } else if (entry->start == root->start) {
1408 * The new entry is a clone of root, with only the end field
1409 * changed. The root entry will be shrunk to abut the new
1410 * entry, and will be the right child of the new root entry in
1413 KASSERT(entry->end < root->end,
1414 ("%s: clip_start not within entry", __func__));
1415 vm_map_splay_findprev(root, &llist);
1416 root->offset += entry->end - root->start;
1417 root->start = entry->end;
1418 max_free_left = vm_map_splay_merge_pred(header, entry, llist);
1419 max_free_right = root->max_free = vm_size_max(
1420 vm_map_splay_merge_pred(entry, root, entry),
1421 vm_map_splay_merge_right(header, root, rlist));
1424 * The new entry is a clone of root, with only the start field
1425 * changed. The root entry will be shrunk to abut the new
1426 * entry, and will be the left child of the new root entry in
1429 KASSERT(entry->end == root->end,
1430 ("%s: clip_start not within entry", __func__));
1431 vm_map_splay_findnext(root, &rlist);
1432 entry->offset += entry->start - root->start;
1433 root->end = entry->start;
1434 max_free_left = root->max_free = vm_size_max(
1435 vm_map_splay_merge_left(header, root, llist),
1436 vm_map_splay_merge_succ(entry, root, entry));
1437 max_free_right = vm_map_splay_merge_succ(header, entry, rlist);
1439 entry->max_free = vm_size_max(max_free_left, max_free_right);
1441 VM_MAP_ASSERT_CONSISTENT(map);
1444 enum unlink_merge_type {
1450 vm_map_entry_unlink(vm_map_t map, vm_map_entry_t entry,
1451 enum unlink_merge_type op)
1453 vm_map_entry_t header, llist, rlist, root;
1454 vm_size_t max_free_left, max_free_right;
1456 VM_MAP_ASSERT_LOCKED(map);
1457 header = &map->header;
1458 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1459 KASSERT(root != NULL,
1460 ("vm_map_entry_unlink: unlink object not mapped"));
1462 vm_map_splay_findprev(root, &llist);
1463 vm_map_splay_findnext(root, &rlist);
1464 if (op == UNLINK_MERGE_NEXT) {
1465 rlist->start = root->start;
1466 rlist->offset = root->offset;
1468 if (llist != header) {
1470 llist = root->right;
1471 max_free_left = vm_map_splay_merge_left(header, root, llist);
1472 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1473 } else if (rlist != header) {
1476 max_free_left = vm_map_splay_merge_pred(header, root, llist);
1477 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1479 header->left = header->right = header;
1483 root->max_free = vm_size_max(max_free_left, max_free_right);
1485 VM_MAP_ASSERT_CONSISTENT(map);
1487 CTR3(KTR_VM, "vm_map_entry_unlink: map %p, nentries %d, entry %p", map,
1488 map->nentries, entry);
1492 * vm_map_entry_resize:
1494 * Resize a vm_map_entry, recompute the amount of free space that
1495 * follows it and propagate that value up the tree.
1497 * The map must be locked, and leaves it so.
1500 vm_map_entry_resize(vm_map_t map, vm_map_entry_t entry, vm_size_t grow_amount)
1502 vm_map_entry_t header, llist, rlist, root;
1504 VM_MAP_ASSERT_LOCKED(map);
1505 header = &map->header;
1506 root = vm_map_splay_split(map, entry->start, 0, &llist, &rlist);
1507 KASSERT(root != NULL, ("%s: resize object not mapped", __func__));
1508 vm_map_splay_findnext(root, &rlist);
1509 entry->end += grow_amount;
1510 root->max_free = vm_size_max(
1511 vm_map_splay_merge_left(header, root, llist),
1512 vm_map_splay_merge_succ(header, root, rlist));
1514 VM_MAP_ASSERT_CONSISTENT(map);
1515 CTR4(KTR_VM, "%s: map %p, nentries %d, entry %p",
1516 __func__, map, map->nentries, entry);
1520 * vm_map_lookup_entry: [ internal use only ]
1522 * Finds the map entry containing (or
1523 * immediately preceding) the specified address
1524 * in the given map; the entry is returned
1525 * in the "entry" parameter. The boolean
1526 * result indicates whether the address is
1527 * actually contained in the map.
1530 vm_map_lookup_entry(
1532 vm_offset_t address,
1533 vm_map_entry_t *entry) /* OUT */
1535 vm_map_entry_t cur, header, lbound, ubound;
1539 * If the map is empty, then the map entry immediately preceding
1540 * "address" is the map's header.
1542 header = &map->header;
1548 if (address >= cur->start && cur->end > address) {
1552 if ((locked = vm_map_locked(map)) ||
1553 sx_try_upgrade(&map->lock)) {
1555 * Splay requires a write lock on the map. However, it only
1556 * restructures the binary search tree; it does not otherwise
1557 * change the map. Thus, the map's timestamp need not change
1558 * on a temporary upgrade.
1560 cur = vm_map_splay(map, address);
1562 VM_MAP_UNLOCK_CONSISTENT(map);
1563 sx_downgrade(&map->lock);
1567 * If "address" is contained within a map entry, the new root
1568 * is that map entry. Otherwise, the new root is a map entry
1569 * immediately before or after "address".
1571 if (address < cur->start) {
1576 return (address < cur->end);
1579 * Since the map is only locked for read access, perform a
1580 * standard binary search tree lookup for "address".
1582 lbound = ubound = header;
1584 if (address < cur->start) {
1589 } else if (cur->end <= address) {
1606 * Inserts the given whole VM object into the target
1607 * map at the specified address range. The object's
1608 * size should match that of the address range.
1610 * Requires that the map be locked, and leaves it so.
1612 * If object is non-NULL, ref count must be bumped by caller
1613 * prior to making call to account for the new entry.
1616 vm_map_insert(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
1617 vm_offset_t start, vm_offset_t end, vm_prot_t prot, vm_prot_t max, int cow)
1619 vm_map_entry_t new_entry, next_entry, prev_entry;
1621 vm_eflags_t protoeflags;
1622 vm_inherit_t inheritance;
1626 VM_MAP_ASSERT_LOCKED(map);
1627 KASSERT(object != kernel_object ||
1628 (cow & MAP_COPY_ON_WRITE) == 0,
1629 ("vm_map_insert: kernel object and COW"));
1630 KASSERT(object == NULL || (cow & MAP_NOFAULT) == 0 ||
1631 (cow & MAP_SPLIT_BOUNDARY_MASK) != 0,
1632 ("vm_map_insert: paradoxical MAP_NOFAULT request, obj %p cow %#x",
1634 KASSERT((prot & ~max) == 0,
1635 ("prot %#x is not subset of max_prot %#x", prot, max));
1638 * Check that the start and end points are not bogus.
1640 if (start == end || !vm_map_range_valid(map, start, end))
1641 return (KERN_INVALID_ADDRESS);
1643 if ((map->flags & MAP_WXORX) != 0 && (prot & (VM_PROT_WRITE |
1644 VM_PROT_EXECUTE)) == (VM_PROT_WRITE | VM_PROT_EXECUTE))
1645 return (KERN_PROTECTION_FAILURE);
1648 * Find the entry prior to the proposed starting address; if it's part
1649 * of an existing entry, this range is bogus.
1651 if (vm_map_lookup_entry(map, start, &prev_entry))
1652 return (KERN_NO_SPACE);
1655 * Assert that the next entry doesn't overlap the end point.
1657 next_entry = vm_map_entry_succ(prev_entry);
1658 if (next_entry->start < end)
1659 return (KERN_NO_SPACE);
1661 if ((cow & MAP_CREATE_GUARD) != 0 && (object != NULL ||
1662 max != VM_PROT_NONE))
1663 return (KERN_INVALID_ARGUMENT);
1666 if (cow & MAP_COPY_ON_WRITE)
1667 protoeflags |= MAP_ENTRY_COW | MAP_ENTRY_NEEDS_COPY;
1668 if (cow & MAP_NOFAULT)
1669 protoeflags |= MAP_ENTRY_NOFAULT;
1670 if (cow & MAP_DISABLE_SYNCER)
1671 protoeflags |= MAP_ENTRY_NOSYNC;
1672 if (cow & MAP_DISABLE_COREDUMP)
1673 protoeflags |= MAP_ENTRY_NOCOREDUMP;
1674 if (cow & MAP_STACK_GROWS_DOWN)
1675 protoeflags |= MAP_ENTRY_GROWS_DOWN;
1676 if (cow & MAP_STACK_GROWS_UP)
1677 protoeflags |= MAP_ENTRY_GROWS_UP;
1678 if (cow & MAP_WRITECOUNT)
1679 protoeflags |= MAP_ENTRY_WRITECNT;
1680 if (cow & MAP_VN_EXEC)
1681 protoeflags |= MAP_ENTRY_VN_EXEC;
1682 if ((cow & MAP_CREATE_GUARD) != 0)
1683 protoeflags |= MAP_ENTRY_GUARD;
1684 if ((cow & MAP_CREATE_STACK_GAP_DN) != 0)
1685 protoeflags |= MAP_ENTRY_STACK_GAP_DN;
1686 if ((cow & MAP_CREATE_STACK_GAP_UP) != 0)
1687 protoeflags |= MAP_ENTRY_STACK_GAP_UP;
1688 if (cow & MAP_INHERIT_SHARE)
1689 inheritance = VM_INHERIT_SHARE;
1691 inheritance = VM_INHERIT_DEFAULT;
1692 if ((cow & MAP_SPLIT_BOUNDARY_MASK) != 0) {
1693 /* This magically ignores index 0, for usual page size. */
1694 bidx = (cow & MAP_SPLIT_BOUNDARY_MASK) >>
1695 MAP_SPLIT_BOUNDARY_SHIFT;
1696 if (bidx >= MAXPAGESIZES)
1697 return (KERN_INVALID_ARGUMENT);
1698 bdry = pagesizes[bidx] - 1;
1699 if ((start & bdry) != 0 || (end & bdry) != 0)
1700 return (KERN_INVALID_ARGUMENT);
1701 protoeflags |= bidx << MAP_ENTRY_SPLIT_BOUNDARY_SHIFT;
1705 if ((cow & (MAP_ACC_NO_CHARGE | MAP_NOFAULT | MAP_CREATE_GUARD)) != 0)
1707 if ((cow & MAP_ACC_CHARGED) || ((prot & VM_PROT_WRITE) &&
1708 ((protoeflags & MAP_ENTRY_NEEDS_COPY) || object == NULL))) {
1709 if (!(cow & MAP_ACC_CHARGED) && !swap_reserve(end - start))
1710 return (KERN_RESOURCE_SHORTAGE);
1711 KASSERT(object == NULL ||
1712 (protoeflags & MAP_ENTRY_NEEDS_COPY) != 0 ||
1713 object->cred == NULL,
1714 ("overcommit: vm_map_insert o %p", object));
1715 cred = curthread->td_ucred;
1719 /* Expand the kernel pmap, if necessary. */
1720 if (map == kernel_map && end > kernel_vm_end)
1721 pmap_growkernel(end);
1722 if (object != NULL) {
1724 * OBJ_ONEMAPPING must be cleared unless this mapping
1725 * is trivially proven to be the only mapping for any
1726 * of the object's pages. (Object granularity
1727 * reference counting is insufficient to recognize
1728 * aliases with precision.)
1730 if ((object->flags & OBJ_ANON) != 0) {
1731 VM_OBJECT_WLOCK(object);
1732 if (object->ref_count > 1 || object->shadow_count != 0)
1733 vm_object_clear_flag(object, OBJ_ONEMAPPING);
1734 VM_OBJECT_WUNLOCK(object);
1736 } else if ((prev_entry->eflags & ~MAP_ENTRY_USER_WIRED) ==
1738 (cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP |
1739 MAP_VN_EXEC)) == 0 &&
1740 prev_entry->end == start && (prev_entry->cred == cred ||
1741 (prev_entry->object.vm_object != NULL &&
1742 prev_entry->object.vm_object->cred == cred)) &&
1743 vm_object_coalesce(prev_entry->object.vm_object,
1745 (vm_size_t)(prev_entry->end - prev_entry->start),
1746 (vm_size_t)(end - prev_entry->end), cred != NULL &&
1747 (protoeflags & MAP_ENTRY_NEEDS_COPY) == 0)) {
1749 * We were able to extend the object. Determine if we
1750 * can extend the previous map entry to include the
1751 * new range as well.
1753 if (prev_entry->inheritance == inheritance &&
1754 prev_entry->protection == prot &&
1755 prev_entry->max_protection == max &&
1756 prev_entry->wired_count == 0) {
1757 KASSERT((prev_entry->eflags & MAP_ENTRY_USER_WIRED) ==
1758 0, ("prev_entry %p has incoherent wiring",
1760 if ((prev_entry->eflags & MAP_ENTRY_GUARD) == 0)
1761 map->size += end - prev_entry->end;
1762 vm_map_entry_resize(map, prev_entry,
1763 end - prev_entry->end);
1764 vm_map_try_merge_entries(map, prev_entry, next_entry);
1765 return (KERN_SUCCESS);
1769 * If we can extend the object but cannot extend the
1770 * map entry, we have to create a new map entry. We
1771 * must bump the ref count on the extended object to
1772 * account for it. object may be NULL.
1774 object = prev_entry->object.vm_object;
1775 offset = prev_entry->offset +
1776 (prev_entry->end - prev_entry->start);
1777 vm_object_reference(object);
1778 if (cred != NULL && object != NULL && object->cred != NULL &&
1779 !(prev_entry->eflags & MAP_ENTRY_NEEDS_COPY)) {
1780 /* Object already accounts for this uid. */
1788 * Create a new entry
1790 new_entry = vm_map_entry_create(map);
1791 new_entry->start = start;
1792 new_entry->end = end;
1793 new_entry->cred = NULL;
1795 new_entry->eflags = protoeflags;
1796 new_entry->object.vm_object = object;
1797 new_entry->offset = offset;
1799 new_entry->inheritance = inheritance;
1800 new_entry->protection = prot;
1801 new_entry->max_protection = max;
1802 new_entry->wired_count = 0;
1803 new_entry->wiring_thread = NULL;
1804 new_entry->read_ahead = VM_FAULT_READ_AHEAD_INIT;
1805 new_entry->next_read = start;
1807 KASSERT(cred == NULL || !ENTRY_CHARGED(new_entry),
1808 ("overcommit: vm_map_insert leaks vm_map %p", new_entry));
1809 new_entry->cred = cred;
1812 * Insert the new entry into the list
1814 vm_map_entry_link(map, new_entry);
1815 if ((new_entry->eflags & MAP_ENTRY_GUARD) == 0)
1816 map->size += new_entry->end - new_entry->start;
1819 * Try to coalesce the new entry with both the previous and next
1820 * entries in the list. Previously, we only attempted to coalesce
1821 * with the previous entry when object is NULL. Here, we handle the
1822 * other cases, which are less common.
1824 vm_map_try_merge_entries(map, prev_entry, new_entry);
1825 vm_map_try_merge_entries(map, new_entry, next_entry);
1827 if ((cow & (MAP_PREFAULT | MAP_PREFAULT_PARTIAL)) != 0) {
1828 vm_map_pmap_enter(map, start, prot, object, OFF_TO_IDX(offset),
1829 end - start, cow & MAP_PREFAULT_PARTIAL);
1832 return (KERN_SUCCESS);
1838 * Find the first fit (lowest VM address) for "length" free bytes
1839 * beginning at address >= start in the given map.
1841 * In a vm_map_entry, "max_free" is the maximum amount of
1842 * contiguous free space between an entry in its subtree and a
1843 * neighbor of that entry. This allows finding a free region in
1844 * one path down the tree, so O(log n) amortized with splay
1847 * The map must be locked, and leaves it so.
1849 * Returns: starting address if sufficient space,
1850 * vm_map_max(map)-length+1 if insufficient space.
1853 vm_map_findspace(vm_map_t map, vm_offset_t start, vm_size_t length)
1855 vm_map_entry_t header, llist, rlist, root, y;
1856 vm_size_t left_length, max_free_left, max_free_right;
1857 vm_offset_t gap_end;
1859 VM_MAP_ASSERT_LOCKED(map);
1862 * Request must fit within min/max VM address and must avoid
1865 start = MAX(start, vm_map_min(map));
1866 if (start >= vm_map_max(map) || length > vm_map_max(map) - start)
1867 return (vm_map_max(map) - length + 1);
1869 /* Empty tree means wide open address space. */
1870 if (map->root == NULL)
1874 * After splay_split, if start is within an entry, push it to the start
1875 * of the following gap. If rlist is at the end of the gap containing
1876 * start, save the end of that gap in gap_end to see if the gap is big
1877 * enough; otherwise set gap_end to start skip gap-checking and move
1878 * directly to a search of the right subtree.
1880 header = &map->header;
1881 root = vm_map_splay_split(map, start, length, &llist, &rlist);
1882 gap_end = rlist->start;
1885 if (root->right != rlist)
1887 max_free_left = vm_map_splay_merge_left(header, root, llist);
1888 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1889 } else if (rlist != header) {
1892 max_free_left = vm_map_splay_merge_pred(header, root, llist);
1893 max_free_right = vm_map_splay_merge_right(header, root, rlist);
1896 llist = root->right;
1897 max_free_left = vm_map_splay_merge_left(header, root, llist);
1898 max_free_right = vm_map_splay_merge_succ(header, root, rlist);
1900 root->max_free = vm_size_max(max_free_left, max_free_right);
1902 VM_MAP_ASSERT_CONSISTENT(map);
1903 if (length <= gap_end - start)
1906 /* With max_free, can immediately tell if no solution. */
1907 if (root->right == header || length > root->right->max_free)
1908 return (vm_map_max(map) - length + 1);
1911 * Splay for the least large-enough gap in the right subtree.
1913 llist = rlist = header;
1914 for (left_length = 0;;
1915 left_length = vm_map_entry_max_free_left(root, llist)) {
1916 if (length <= left_length)
1917 SPLAY_LEFT_STEP(root, y, llist, rlist,
1918 length <= vm_map_entry_max_free_left(y, llist));
1920 SPLAY_RIGHT_STEP(root, y, llist, rlist,
1921 length > vm_map_entry_max_free_left(y, root));
1926 llist = root->right;
1927 max_free_left = vm_map_splay_merge_left(header, root, llist);
1928 if (rlist == header) {
1929 root->max_free = vm_size_max(max_free_left,
1930 vm_map_splay_merge_succ(header, root, rlist));
1934 y->max_free = vm_size_max(
1935 vm_map_splay_merge_pred(root, y, root),
1936 vm_map_splay_merge_right(header, y, rlist));
1937 root->max_free = vm_size_max(max_free_left, y->max_free);
1940 VM_MAP_ASSERT_CONSISTENT(map);
1945 vm_map_fixed(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
1946 vm_offset_t start, vm_size_t length, vm_prot_t prot,
1947 vm_prot_t max, int cow)
1952 end = start + length;
1953 KASSERT((cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) == 0 ||
1955 ("vm_map_fixed: non-NULL backing object for stack"));
1957 VM_MAP_RANGE_CHECK(map, start, end);
1958 if ((cow & MAP_CHECK_EXCL) == 0) {
1959 result = vm_map_delete(map, start, end);
1960 if (result != KERN_SUCCESS)
1963 if ((cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) != 0) {
1964 result = vm_map_stack_locked(map, start, length, sgrowsiz,
1967 result = vm_map_insert(map, object, offset, start, end,
1975 static const int aslr_pages_rnd_64[2] = {0x1000, 0x10};
1976 static const int aslr_pages_rnd_32[2] = {0x100, 0x4};
1978 static int cluster_anon = 1;
1979 SYSCTL_INT(_vm, OID_AUTO, cluster_anon, CTLFLAG_RW,
1981 "Cluster anonymous mappings: 0 = no, 1 = yes if no hint, 2 = always");
1984 clustering_anon_allowed(vm_offset_t addr)
1987 switch (cluster_anon) {
1998 static long aslr_restarts;
1999 SYSCTL_LONG(_vm, OID_AUTO, aslr_restarts, CTLFLAG_RD,
2001 "Number of aslr failures");
2004 * Searches for the specified amount of free space in the given map with the
2005 * specified alignment. Performs an address-ordered, first-fit search from
2006 * the given address "*addr", with an optional upper bound "max_addr". If the
2007 * parameter "alignment" is zero, then the alignment is computed from the
2008 * given (object, offset) pair so as to enable the greatest possible use of
2009 * superpage mappings. Returns KERN_SUCCESS and the address of the free space
2010 * in "*addr" if successful. Otherwise, returns KERN_NO_SPACE.
2012 * The map must be locked. Initially, there must be at least "length" bytes
2013 * of free space at the given address.
2016 vm_map_alignspace(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
2017 vm_offset_t *addr, vm_size_t length, vm_offset_t max_addr,
2018 vm_offset_t alignment)
2020 vm_offset_t aligned_addr, free_addr;
2022 VM_MAP_ASSERT_LOCKED(map);
2024 KASSERT(free_addr == vm_map_findspace(map, free_addr, length),
2025 ("caller failed to provide space %#jx at address %p",
2026 (uintmax_t)length, (void *)free_addr));
2029 * At the start of every iteration, the free space at address
2030 * "*addr" is at least "length" bytes.
2033 pmap_align_superpage(object, offset, addr, length);
2034 else if ((*addr & (alignment - 1)) != 0) {
2035 *addr &= ~(alignment - 1);
2038 aligned_addr = *addr;
2039 if (aligned_addr == free_addr) {
2041 * Alignment did not change "*addr", so "*addr" must
2042 * still provide sufficient free space.
2044 return (KERN_SUCCESS);
2048 * Test for address wrap on "*addr". A wrapped "*addr" could
2049 * be a valid address, in which case vm_map_findspace() cannot
2050 * be relied upon to fail.
2052 if (aligned_addr < free_addr)
2053 return (KERN_NO_SPACE);
2054 *addr = vm_map_findspace(map, aligned_addr, length);
2055 if (*addr + length > vm_map_max(map) ||
2056 (max_addr != 0 && *addr + length > max_addr))
2057 return (KERN_NO_SPACE);
2059 if (free_addr == aligned_addr) {
2061 * If a successful call to vm_map_findspace() did not
2062 * change "*addr", then "*addr" must still be aligned
2063 * and provide sufficient free space.
2065 return (KERN_SUCCESS);
2071 vm_map_find_aligned(vm_map_t map, vm_offset_t *addr, vm_size_t length,
2072 vm_offset_t max_addr, vm_offset_t alignment)
2074 /* XXXKIB ASLR eh ? */
2075 *addr = vm_map_findspace(map, *addr, length);
2076 if (*addr + length > vm_map_max(map) ||
2077 (max_addr != 0 && *addr + length > max_addr))
2078 return (KERN_NO_SPACE);
2079 return (vm_map_alignspace(map, NULL, 0, addr, length, max_addr,
2084 * vm_map_find finds an unallocated region in the target address
2085 * map with the given length. The search is defined to be
2086 * first-fit from the specified address; the region found is
2087 * returned in the same parameter.
2089 * If object is non-NULL, ref count must be bumped by caller
2090 * prior to making call to account for the new entry.
2093 vm_map_find(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
2094 vm_offset_t *addr, /* IN/OUT */
2095 vm_size_t length, vm_offset_t max_addr, int find_space,
2096 vm_prot_t prot, vm_prot_t max, int cow)
2098 vm_offset_t alignment, curr_min_addr, min_addr;
2099 int gap, pidx, rv, try;
2100 bool cluster, en_aslr, update_anon;
2102 KASSERT((cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) == 0 ||
2104 ("vm_map_find: non-NULL backing object for stack"));
2105 MPASS((cow & MAP_REMAP) == 0 || (find_space == VMFS_NO_SPACE &&
2106 (cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) == 0));
2107 if (find_space == VMFS_OPTIMAL_SPACE && (object == NULL ||
2108 (object->flags & OBJ_COLORED) == 0))
2109 find_space = VMFS_ANY_SPACE;
2110 if (find_space >> 8 != 0) {
2111 KASSERT((find_space & 0xff) == 0, ("bad VMFS flags"));
2112 alignment = (vm_offset_t)1 << (find_space >> 8);
2115 en_aslr = (map->flags & MAP_ASLR) != 0;
2116 update_anon = cluster = clustering_anon_allowed(*addr) &&
2117 (map->flags & MAP_IS_SUB_MAP) == 0 && max_addr == 0 &&
2118 find_space != VMFS_NO_SPACE && object == NULL &&
2119 (cow & (MAP_INHERIT_SHARE | MAP_STACK_GROWS_UP |
2120 MAP_STACK_GROWS_DOWN)) == 0 && prot != PROT_NONE;
2121 curr_min_addr = min_addr = *addr;
2122 if (en_aslr && min_addr == 0 && !cluster &&
2123 find_space != VMFS_NO_SPACE &&
2124 (map->flags & MAP_ASLR_IGNSTART) != 0)
2125 curr_min_addr = min_addr = vm_map_min(map);
2129 curr_min_addr = map->anon_loc;
2130 if (curr_min_addr == 0)
2133 if (find_space != VMFS_NO_SPACE) {
2134 KASSERT(find_space == VMFS_ANY_SPACE ||
2135 find_space == VMFS_OPTIMAL_SPACE ||
2136 find_space == VMFS_SUPER_SPACE ||
2137 alignment != 0, ("unexpected VMFS flag"));
2140 * When creating an anonymous mapping, try clustering
2141 * with an existing anonymous mapping first.
2143 * We make up to two attempts to find address space
2144 * for a given find_space value. The first attempt may
2145 * apply randomization or may cluster with an existing
2146 * anonymous mapping. If this first attempt fails,
2147 * perform a first-fit search of the available address
2150 * If all tries failed, and find_space is
2151 * VMFS_OPTIMAL_SPACE, fallback to VMFS_ANY_SPACE.
2152 * Again enable clustering and randomization.
2159 * Second try: we failed either to find a
2160 * suitable region for randomizing the
2161 * allocation, or to cluster with an existing
2162 * mapping. Retry with free run.
2164 curr_min_addr = (map->flags & MAP_ASLR_IGNSTART) != 0 ?
2165 vm_map_min(map) : min_addr;
2166 atomic_add_long(&aslr_restarts, 1);
2169 if (try == 1 && en_aslr && !cluster) {
2171 * Find space for allocation, including
2172 * gap needed for later randomization.
2174 pidx = MAXPAGESIZES > 1 && pagesizes[1] != 0 &&
2175 (find_space == VMFS_SUPER_SPACE || find_space ==
2176 VMFS_OPTIMAL_SPACE) ? 1 : 0;
2177 gap = vm_map_max(map) > MAP_32BIT_MAX_ADDR &&
2178 (max_addr == 0 || max_addr > MAP_32BIT_MAX_ADDR) ?
2179 aslr_pages_rnd_64[pidx] : aslr_pages_rnd_32[pidx];
2180 *addr = vm_map_findspace(map, curr_min_addr,
2181 length + gap * pagesizes[pidx]);
2182 if (*addr + length + gap * pagesizes[pidx] >
2185 /* And randomize the start address. */
2186 *addr += (arc4random() % gap) * pagesizes[pidx];
2187 if (max_addr != 0 && *addr + length > max_addr)
2190 *addr = vm_map_findspace(map, curr_min_addr, length);
2191 if (*addr + length > vm_map_max(map) ||
2192 (max_addr != 0 && *addr + length > max_addr)) {
2203 if (find_space != VMFS_ANY_SPACE &&
2204 (rv = vm_map_alignspace(map, object, offset, addr, length,
2205 max_addr, alignment)) != KERN_SUCCESS) {
2206 if (find_space == VMFS_OPTIMAL_SPACE) {
2207 find_space = VMFS_ANY_SPACE;
2208 curr_min_addr = min_addr;
2209 cluster = update_anon;
2215 } else if ((cow & MAP_REMAP) != 0) {
2216 if (!vm_map_range_valid(map, *addr, *addr + length)) {
2217 rv = KERN_INVALID_ADDRESS;
2220 rv = vm_map_delete(map, *addr, *addr + length);
2221 if (rv != KERN_SUCCESS)
2224 if ((cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) != 0) {
2225 rv = vm_map_stack_locked(map, *addr, length, sgrowsiz, prot,
2228 rv = vm_map_insert(map, object, offset, *addr, *addr + length,
2231 if (rv == KERN_SUCCESS && update_anon)
2232 map->anon_loc = *addr + length;
2239 * vm_map_find_min() is a variant of vm_map_find() that takes an
2240 * additional parameter (min_addr) and treats the given address
2241 * (*addr) differently. Specifically, it treats *addr as a hint
2242 * and not as the minimum address where the mapping is created.
2244 * This function works in two phases. First, it tries to
2245 * allocate above the hint. If that fails and the hint is
2246 * greater than min_addr, it performs a second pass, replacing
2247 * the hint with min_addr as the minimum address for the
2251 vm_map_find_min(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
2252 vm_offset_t *addr, vm_size_t length, vm_offset_t min_addr,
2253 vm_offset_t max_addr, int find_space, vm_prot_t prot, vm_prot_t max,
2261 rv = vm_map_find(map, object, offset, addr, length, max_addr,
2262 find_space, prot, max, cow);
2263 if (rv == KERN_SUCCESS || min_addr >= hint)
2265 *addr = hint = min_addr;
2270 * A map entry with any of the following flags set must not be merged with
2273 #define MAP_ENTRY_NOMERGE_MASK (MAP_ENTRY_GROWS_DOWN | MAP_ENTRY_GROWS_UP | \
2274 MAP_ENTRY_IN_TRANSITION | MAP_ENTRY_IS_SUB_MAP | MAP_ENTRY_VN_EXEC)
2277 vm_map_mergeable_neighbors(vm_map_entry_t prev, vm_map_entry_t entry)
2280 KASSERT((prev->eflags & MAP_ENTRY_NOMERGE_MASK) == 0 ||
2281 (entry->eflags & MAP_ENTRY_NOMERGE_MASK) == 0,
2282 ("vm_map_mergeable_neighbors: neither %p nor %p are mergeable",
2284 return (prev->end == entry->start &&
2285 prev->object.vm_object == entry->object.vm_object &&
2286 (prev->object.vm_object == NULL ||
2287 prev->offset + (prev->end - prev->start) == entry->offset) &&
2288 prev->eflags == entry->eflags &&
2289 prev->protection == entry->protection &&
2290 prev->max_protection == entry->max_protection &&
2291 prev->inheritance == entry->inheritance &&
2292 prev->wired_count == entry->wired_count &&
2293 prev->cred == entry->cred);
2297 vm_map_merged_neighbor_dispose(vm_map_t map, vm_map_entry_t entry)
2301 * If the backing object is a vnode object, vm_object_deallocate()
2302 * calls vrele(). However, vrele() does not lock the vnode because
2303 * the vnode has additional references. Thus, the map lock can be
2304 * kept without causing a lock-order reversal with the vnode lock.
2306 * Since we count the number of virtual page mappings in
2307 * object->un_pager.vnp.writemappings, the writemappings value
2308 * should not be adjusted when the entry is disposed of.
2310 if (entry->object.vm_object != NULL)
2311 vm_object_deallocate(entry->object.vm_object);
2312 if (entry->cred != NULL)
2313 crfree(entry->cred);
2314 vm_map_entry_dispose(map, entry);
2318 * vm_map_try_merge_entries:
2320 * Compare the given map entry to its predecessor, and merge its precessor
2321 * into it if possible. The entry remains valid, and may be extended.
2322 * The predecessor may be deleted.
2324 * The map must be locked.
2327 vm_map_try_merge_entries(vm_map_t map, vm_map_entry_t prev_entry,
2328 vm_map_entry_t entry)
2331 VM_MAP_ASSERT_LOCKED(map);
2332 if ((entry->eflags & MAP_ENTRY_NOMERGE_MASK) == 0 &&
2333 vm_map_mergeable_neighbors(prev_entry, entry)) {
2334 vm_map_entry_unlink(map, prev_entry, UNLINK_MERGE_NEXT);
2335 vm_map_merged_neighbor_dispose(map, prev_entry);
2340 * vm_map_entry_back:
2342 * Allocate an object to back a map entry.
2345 vm_map_entry_back(vm_map_entry_t entry)
2349 KASSERT(entry->object.vm_object == NULL,
2350 ("map entry %p has backing object", entry));
2351 KASSERT((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0,
2352 ("map entry %p is a submap", entry));
2353 object = vm_object_allocate_anon(atop(entry->end - entry->start), NULL,
2354 entry->cred, entry->end - entry->start);
2355 entry->object.vm_object = object;
2361 * vm_map_entry_charge_object
2363 * If there is no object backing this entry, create one. Otherwise, if
2364 * the entry has cred, give it to the backing object.
2367 vm_map_entry_charge_object(vm_map_t map, vm_map_entry_t entry)
2370 VM_MAP_ASSERT_LOCKED(map);
2371 KASSERT((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0,
2372 ("map entry %p is a submap", entry));
2373 if (entry->object.vm_object == NULL && !map->system_map &&
2374 (entry->eflags & MAP_ENTRY_GUARD) == 0)
2375 vm_map_entry_back(entry);
2376 else if (entry->object.vm_object != NULL &&
2377 ((entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0) &&
2378 entry->cred != NULL) {
2379 VM_OBJECT_WLOCK(entry->object.vm_object);
2380 KASSERT(entry->object.vm_object->cred == NULL,
2381 ("OVERCOMMIT: %s: both cred e %p", __func__, entry));
2382 entry->object.vm_object->cred = entry->cred;
2383 entry->object.vm_object->charge = entry->end - entry->start;
2384 VM_OBJECT_WUNLOCK(entry->object.vm_object);
2390 * vm_map_entry_clone
2392 * Create a duplicate map entry for clipping.
2394 static vm_map_entry_t
2395 vm_map_entry_clone(vm_map_t map, vm_map_entry_t entry)
2397 vm_map_entry_t new_entry;
2399 VM_MAP_ASSERT_LOCKED(map);
2402 * Create a backing object now, if none exists, so that more individual
2403 * objects won't be created after the map entry is split.
2405 vm_map_entry_charge_object(map, entry);
2407 /* Clone the entry. */
2408 new_entry = vm_map_entry_create(map);
2409 *new_entry = *entry;
2410 if (new_entry->cred != NULL)
2411 crhold(entry->cred);
2412 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0) {
2413 vm_object_reference(new_entry->object.vm_object);
2414 vm_map_entry_set_vnode_text(new_entry, true);
2416 * The object->un_pager.vnp.writemappings for the object of
2417 * MAP_ENTRY_WRITECNT type entry shall be kept as is here. The
2418 * virtual pages are re-distributed among the clipped entries,
2419 * so the sum is left the same.
2426 * vm_map_clip_start: [ internal use only ]
2428 * Asserts that the given entry begins at or after
2429 * the specified address; if necessary,
2430 * it splits the entry into two.
2433 vm_map_clip_start(vm_map_t map, vm_map_entry_t entry, vm_offset_t startaddr)
2435 vm_map_entry_t new_entry;
2438 if (!map->system_map)
2439 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
2440 "%s: map %p entry %p start 0x%jx", __func__, map, entry,
2441 (uintmax_t)startaddr);
2443 if (startaddr <= entry->start)
2444 return (KERN_SUCCESS);
2446 VM_MAP_ASSERT_LOCKED(map);
2447 KASSERT(entry->end > startaddr && entry->start < startaddr,
2448 ("%s: invalid clip of entry %p", __func__, entry));
2450 bdry_idx = (entry->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK) >>
2451 MAP_ENTRY_SPLIT_BOUNDARY_SHIFT;
2452 if (bdry_idx != 0) {
2453 if ((startaddr & (pagesizes[bdry_idx] - 1)) != 0)
2454 return (KERN_INVALID_ARGUMENT);
2457 new_entry = vm_map_entry_clone(map, entry);
2460 * Split off the front portion. Insert the new entry BEFORE this one,
2461 * so that this entry has the specified starting address.
2463 new_entry->end = startaddr;
2464 vm_map_entry_link(map, new_entry);
2465 return (KERN_SUCCESS);
2469 * vm_map_lookup_clip_start:
2471 * Find the entry at or just after 'start', and clip it if 'start' is in
2472 * the interior of the entry. Return entry after 'start', and in
2473 * prev_entry set the entry before 'start'.
2476 vm_map_lookup_clip_start(vm_map_t map, vm_offset_t start,
2477 vm_map_entry_t *res_entry, vm_map_entry_t *prev_entry)
2479 vm_map_entry_t entry;
2482 if (!map->system_map)
2483 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
2484 "%s: map %p start 0x%jx prev %p", __func__, map,
2485 (uintmax_t)start, prev_entry);
2487 if (vm_map_lookup_entry(map, start, prev_entry)) {
2488 entry = *prev_entry;
2489 rv = vm_map_clip_start(map, entry, start);
2490 if (rv != KERN_SUCCESS)
2492 *prev_entry = vm_map_entry_pred(entry);
2494 entry = vm_map_entry_succ(*prev_entry);
2496 return (KERN_SUCCESS);
2500 * vm_map_clip_end: [ internal use only ]
2502 * Asserts that the given entry ends at or before
2503 * the specified address; if necessary,
2504 * it splits the entry into two.
2507 vm_map_clip_end(vm_map_t map, vm_map_entry_t entry, vm_offset_t endaddr)
2509 vm_map_entry_t new_entry;
2512 if (!map->system_map)
2513 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
2514 "%s: map %p entry %p end 0x%jx", __func__, map, entry,
2515 (uintmax_t)endaddr);
2517 if (endaddr >= entry->end)
2518 return (KERN_SUCCESS);
2520 VM_MAP_ASSERT_LOCKED(map);
2521 KASSERT(entry->start < endaddr && entry->end > endaddr,
2522 ("%s: invalid clip of entry %p", __func__, entry));
2524 bdry_idx = (entry->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK) >>
2525 MAP_ENTRY_SPLIT_BOUNDARY_SHIFT;
2526 if (bdry_idx != 0) {
2527 if ((endaddr & (pagesizes[bdry_idx] - 1)) != 0)
2528 return (KERN_INVALID_ARGUMENT);
2531 new_entry = vm_map_entry_clone(map, entry);
2534 * Split off the back portion. Insert the new entry AFTER this one,
2535 * so that this entry has the specified ending address.
2537 new_entry->start = endaddr;
2538 vm_map_entry_link(map, new_entry);
2540 return (KERN_SUCCESS);
2544 * vm_map_submap: [ kernel use only ]
2546 * Mark the given range as handled by a subordinate map.
2548 * This range must have been created with vm_map_find,
2549 * and no other operations may have been performed on this
2550 * range prior to calling vm_map_submap.
2552 * Only a limited number of operations can be performed
2553 * within this rage after calling vm_map_submap:
2555 * [Don't try vm_map_copy!]
2557 * To remove a submapping, one must first remove the
2558 * range from the superior map, and then destroy the
2559 * submap (if desired). [Better yet, don't try it.]
2568 vm_map_entry_t entry;
2571 result = KERN_INVALID_ARGUMENT;
2573 vm_map_lock(submap);
2574 submap->flags |= MAP_IS_SUB_MAP;
2575 vm_map_unlock(submap);
2578 VM_MAP_RANGE_CHECK(map, start, end);
2579 if (vm_map_lookup_entry(map, start, &entry) && entry->end >= end &&
2580 (entry->eflags & MAP_ENTRY_COW) == 0 &&
2581 entry->object.vm_object == NULL) {
2582 result = vm_map_clip_start(map, entry, start);
2583 if (result != KERN_SUCCESS)
2585 result = vm_map_clip_end(map, entry, end);
2586 if (result != KERN_SUCCESS)
2588 entry->object.sub_map = submap;
2589 entry->eflags |= MAP_ENTRY_IS_SUB_MAP;
2590 result = KERN_SUCCESS;
2595 if (result != KERN_SUCCESS) {
2596 vm_map_lock(submap);
2597 submap->flags &= ~MAP_IS_SUB_MAP;
2598 vm_map_unlock(submap);
2604 * The maximum number of pages to map if MAP_PREFAULT_PARTIAL is specified
2606 #define MAX_INIT_PT 96
2609 * vm_map_pmap_enter:
2611 * Preload the specified map's pmap with mappings to the specified
2612 * object's memory-resident pages. No further physical pages are
2613 * allocated, and no further virtual pages are retrieved from secondary
2614 * storage. If the specified flags include MAP_PREFAULT_PARTIAL, then a
2615 * limited number of page mappings are created at the low-end of the
2616 * specified address range. (For this purpose, a superpage mapping
2617 * counts as one page mapping.) Otherwise, all resident pages within
2618 * the specified address range are mapped.
2621 vm_map_pmap_enter(vm_map_t map, vm_offset_t addr, vm_prot_t prot,
2622 vm_object_t object, vm_pindex_t pindex, vm_size_t size, int flags)
2625 vm_page_t p, p_start;
2626 vm_pindex_t mask, psize, threshold, tmpidx;
2628 if ((prot & (VM_PROT_READ | VM_PROT_EXECUTE)) == 0 || object == NULL)
2630 if (object->type == OBJT_DEVICE || object->type == OBJT_SG) {
2631 VM_OBJECT_WLOCK(object);
2632 if (object->type == OBJT_DEVICE || object->type == OBJT_SG) {
2633 pmap_object_init_pt(map->pmap, addr, object, pindex,
2635 VM_OBJECT_WUNLOCK(object);
2638 VM_OBJECT_LOCK_DOWNGRADE(object);
2640 VM_OBJECT_RLOCK(object);
2643 if (psize + pindex > object->size) {
2644 if (pindex >= object->size) {
2645 VM_OBJECT_RUNLOCK(object);
2648 psize = object->size - pindex;
2653 threshold = MAX_INIT_PT;
2655 p = vm_page_find_least(object, pindex);
2657 * Assert: the variable p is either (1) the page with the
2658 * least pindex greater than or equal to the parameter pindex
2662 p != NULL && (tmpidx = p->pindex - pindex) < psize;
2663 p = TAILQ_NEXT(p, listq)) {
2665 * don't allow an madvise to blow away our really
2666 * free pages allocating pv entries.
2668 if (((flags & MAP_PREFAULT_MADVISE) != 0 &&
2669 vm_page_count_severe()) ||
2670 ((flags & MAP_PREFAULT_PARTIAL) != 0 &&
2671 tmpidx >= threshold)) {
2675 if (vm_page_all_valid(p)) {
2676 if (p_start == NULL) {
2677 start = addr + ptoa(tmpidx);
2680 /* Jump ahead if a superpage mapping is possible. */
2681 if (p->psind > 0 && ((addr + ptoa(tmpidx)) &
2682 (pagesizes[p->psind] - 1)) == 0) {
2683 mask = atop(pagesizes[p->psind]) - 1;
2684 if (tmpidx + mask < psize &&
2685 vm_page_ps_test(p, PS_ALL_VALID, NULL)) {
2690 } else if (p_start != NULL) {
2691 pmap_enter_object(map->pmap, start, addr +
2692 ptoa(tmpidx), p_start, prot);
2696 if (p_start != NULL)
2697 pmap_enter_object(map->pmap, start, addr + ptoa(psize),
2699 VM_OBJECT_RUNLOCK(object);
2705 * Sets the protection and/or the maximum protection of the
2706 * specified address region in the target map.
2709 vm_map_protect(vm_map_t map, vm_offset_t start, vm_offset_t end,
2710 vm_prot_t new_prot, vm_prot_t new_maxprot, int flags)
2712 vm_map_entry_t entry, first_entry, in_tran, prev_entry;
2719 return (KERN_SUCCESS);
2721 if ((flags & (VM_MAP_PROTECT_SET_PROT | VM_MAP_PROTECT_SET_MAXPROT)) ==
2722 (VM_MAP_PROTECT_SET_PROT | VM_MAP_PROTECT_SET_MAXPROT) &&
2723 (new_prot & new_maxprot) != new_prot)
2724 return (KERN_OUT_OF_BOUNDS);
2730 if ((map->flags & MAP_WXORX) != 0 &&
2731 (flags & VM_MAP_PROTECT_SET_PROT) != 0 &&
2732 (new_prot & (VM_PROT_WRITE | VM_PROT_EXECUTE)) == (VM_PROT_WRITE |
2735 return (KERN_PROTECTION_FAILURE);
2739 * Ensure that we are not concurrently wiring pages. vm_map_wire() may
2740 * need to fault pages into the map and will drop the map lock while
2741 * doing so, and the VM object may end up in an inconsistent state if we
2742 * update the protection on the map entry in between faults.
2744 vm_map_wait_busy(map);
2746 VM_MAP_RANGE_CHECK(map, start, end);
2748 if (!vm_map_lookup_entry(map, start, &first_entry))
2749 first_entry = vm_map_entry_succ(first_entry);
2752 * Make a first pass to check for protection violations.
2754 for (entry = first_entry; entry->start < end;
2755 entry = vm_map_entry_succ(entry)) {
2756 if ((entry->eflags & MAP_ENTRY_GUARD) != 0)
2758 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0) {
2760 return (KERN_INVALID_ARGUMENT);
2762 if ((flags & VM_MAP_PROTECT_SET_PROT) == 0)
2763 new_prot = entry->protection;
2764 if ((flags & VM_MAP_PROTECT_SET_MAXPROT) == 0)
2765 new_maxprot = entry->max_protection;
2766 if ((new_prot & entry->max_protection) != new_prot ||
2767 (new_maxprot & entry->max_protection) != new_maxprot) {
2769 return (KERN_PROTECTION_FAILURE);
2771 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0)
2776 * Postpone the operation until all in-transition map entries have
2777 * stabilized. An in-transition entry might already have its pages
2778 * wired and wired_count incremented, but not yet have its
2779 * MAP_ENTRY_USER_WIRED flag set. In which case, we would fail to call
2780 * vm_fault_copy_entry() in the final loop below.
2782 if (in_tran != NULL) {
2783 in_tran->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
2784 vm_map_unlock_and_wait(map, 0);
2789 * Before changing the protections, try to reserve swap space for any
2790 * private (i.e., copy-on-write) mappings that are transitioning from
2791 * read-only to read/write access. If a reservation fails, break out
2792 * of this loop early and let the next loop simplify the entries, since
2793 * some may now be mergeable.
2795 rv = vm_map_clip_start(map, first_entry, start);
2796 if (rv != KERN_SUCCESS) {
2800 for (entry = first_entry; entry->start < end;
2801 entry = vm_map_entry_succ(entry)) {
2802 rv = vm_map_clip_end(map, entry, end);
2803 if (rv != KERN_SUCCESS) {
2808 if ((flags & VM_MAP_PROTECT_SET_PROT) == 0 ||
2809 ((new_prot & ~entry->protection) & VM_PROT_WRITE) == 0 ||
2810 ENTRY_CHARGED(entry) ||
2811 (entry->eflags & MAP_ENTRY_GUARD) != 0)
2814 cred = curthread->td_ucred;
2815 obj = entry->object.vm_object;
2818 (entry->eflags & MAP_ENTRY_NEEDS_COPY) != 0) {
2819 if (!swap_reserve(entry->end - entry->start)) {
2820 rv = KERN_RESOURCE_SHORTAGE;
2829 VM_OBJECT_WLOCK(obj);
2830 if (obj->type != OBJT_DEFAULT &&
2831 (obj->flags & OBJ_SWAP) == 0) {
2832 VM_OBJECT_WUNLOCK(obj);
2837 * Charge for the whole object allocation now, since
2838 * we cannot distinguish between non-charged and
2839 * charged clipped mapping of the same object later.
2841 KASSERT(obj->charge == 0,
2842 ("vm_map_protect: object %p overcharged (entry %p)",
2844 if (!swap_reserve(ptoa(obj->size))) {
2845 VM_OBJECT_WUNLOCK(obj);
2846 rv = KERN_RESOURCE_SHORTAGE;
2853 obj->charge = ptoa(obj->size);
2854 VM_OBJECT_WUNLOCK(obj);
2858 * If enough swap space was available, go back and fix up protections.
2859 * Otherwise, just simplify entries, since some may have been modified.
2860 * [Note that clipping is not necessary the second time.]
2862 for (prev_entry = vm_map_entry_pred(first_entry), entry = first_entry;
2864 vm_map_try_merge_entries(map, prev_entry, entry),
2865 prev_entry = entry, entry = vm_map_entry_succ(entry)) {
2866 if (rv != KERN_SUCCESS ||
2867 (entry->eflags & MAP_ENTRY_GUARD) != 0)
2870 old_prot = entry->protection;
2872 if ((flags & VM_MAP_PROTECT_SET_MAXPROT) != 0) {
2873 entry->max_protection = new_maxprot;
2874 entry->protection = new_maxprot & old_prot;
2876 if ((flags & VM_MAP_PROTECT_SET_PROT) != 0)
2877 entry->protection = new_prot;
2880 * For user wired map entries, the normal lazy evaluation of
2881 * write access upgrades through soft page faults is
2882 * undesirable. Instead, immediately copy any pages that are
2883 * copy-on-write and enable write access in the physical map.
2885 if ((entry->eflags & MAP_ENTRY_USER_WIRED) != 0 &&
2886 (entry->protection & VM_PROT_WRITE) != 0 &&
2887 (old_prot & VM_PROT_WRITE) == 0)
2888 vm_fault_copy_entry(map, map, entry, entry, NULL);
2891 * When restricting access, update the physical map. Worry
2892 * about copy-on-write here.
2894 if ((old_prot & ~entry->protection) != 0) {
2895 #define MASK(entry) (((entry)->eflags & MAP_ENTRY_COW) ? ~VM_PROT_WRITE : \
2897 pmap_protect(map->pmap, entry->start,
2899 entry->protection & MASK(entry));
2903 vm_map_try_merge_entries(map, prev_entry, entry);
2911 * This routine traverses a processes map handling the madvise
2912 * system call. Advisories are classified as either those effecting
2913 * the vm_map_entry structure, or those effecting the underlying
2923 vm_map_entry_t entry, prev_entry;
2928 * Some madvise calls directly modify the vm_map_entry, in which case
2929 * we need to use an exclusive lock on the map and we need to perform
2930 * various clipping operations. Otherwise we only need a read-lock
2935 case MADV_SEQUENTIAL:
2952 vm_map_lock_read(map);
2959 * Locate starting entry and clip if necessary.
2961 VM_MAP_RANGE_CHECK(map, start, end);
2965 * madvise behaviors that are implemented in the vm_map_entry.
2967 * We clip the vm_map_entry so that behavioral changes are
2968 * limited to the specified address range.
2970 rv = vm_map_lookup_clip_start(map, start, &entry, &prev_entry);
2971 if (rv != KERN_SUCCESS) {
2973 return (vm_mmap_to_errno(rv));
2976 for (; entry->start < end; prev_entry = entry,
2977 entry = vm_map_entry_succ(entry)) {
2978 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0)
2981 rv = vm_map_clip_end(map, entry, end);
2982 if (rv != KERN_SUCCESS) {
2984 return (vm_mmap_to_errno(rv));
2989 vm_map_entry_set_behavior(entry,
2990 MAP_ENTRY_BEHAV_NORMAL);
2992 case MADV_SEQUENTIAL:
2993 vm_map_entry_set_behavior(entry,
2994 MAP_ENTRY_BEHAV_SEQUENTIAL);
2997 vm_map_entry_set_behavior(entry,
2998 MAP_ENTRY_BEHAV_RANDOM);
3001 entry->eflags |= MAP_ENTRY_NOSYNC;
3004 entry->eflags &= ~MAP_ENTRY_NOSYNC;
3007 entry->eflags |= MAP_ENTRY_NOCOREDUMP;
3010 entry->eflags &= ~MAP_ENTRY_NOCOREDUMP;
3015 vm_map_try_merge_entries(map, prev_entry, entry);
3017 vm_map_try_merge_entries(map, prev_entry, entry);
3020 vm_pindex_t pstart, pend;
3023 * madvise behaviors that are implemented in the underlying
3026 * Since we don't clip the vm_map_entry, we have to clip
3027 * the vm_object pindex and count.
3029 if (!vm_map_lookup_entry(map, start, &entry))
3030 entry = vm_map_entry_succ(entry);
3031 for (; entry->start < end;
3032 entry = vm_map_entry_succ(entry)) {
3033 vm_offset_t useEnd, useStart;
3035 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0)
3039 * MADV_FREE would otherwise rewind time to
3040 * the creation of the shadow object. Because
3041 * we hold the VM map read-locked, neither the
3042 * entry's object nor the presence of a
3043 * backing object can change.
3045 if (behav == MADV_FREE &&
3046 entry->object.vm_object != NULL &&
3047 entry->object.vm_object->backing_object != NULL)
3050 pstart = OFF_TO_IDX(entry->offset);
3051 pend = pstart + atop(entry->end - entry->start);
3052 useStart = entry->start;
3053 useEnd = entry->end;
3055 if (entry->start < start) {
3056 pstart += atop(start - entry->start);
3059 if (entry->end > end) {
3060 pend -= atop(entry->end - end);
3068 * Perform the pmap_advise() before clearing
3069 * PGA_REFERENCED in vm_page_advise(). Otherwise, a
3070 * concurrent pmap operation, such as pmap_remove(),
3071 * could clear a reference in the pmap and set
3072 * PGA_REFERENCED on the page before the pmap_advise()
3073 * had completed. Consequently, the page would appear
3074 * referenced based upon an old reference that
3075 * occurred before this pmap_advise() ran.
3077 if (behav == MADV_DONTNEED || behav == MADV_FREE)
3078 pmap_advise(map->pmap, useStart, useEnd,
3081 vm_object_madvise(entry->object.vm_object, pstart,
3085 * Pre-populate paging structures in the
3086 * WILLNEED case. For wired entries, the
3087 * paging structures are already populated.
3089 if (behav == MADV_WILLNEED &&
3090 entry->wired_count == 0) {
3091 vm_map_pmap_enter(map,
3094 entry->object.vm_object,
3096 ptoa(pend - pstart),
3097 MAP_PREFAULT_MADVISE
3101 vm_map_unlock_read(map);
3109 * Sets the inheritance of the specified address
3110 * range in the target map. Inheritance
3111 * affects how the map will be shared with
3112 * child maps at the time of vmspace_fork.
3115 vm_map_inherit(vm_map_t map, vm_offset_t start, vm_offset_t end,
3116 vm_inherit_t new_inheritance)
3118 vm_map_entry_t entry, lentry, prev_entry, start_entry;
3121 switch (new_inheritance) {
3122 case VM_INHERIT_NONE:
3123 case VM_INHERIT_COPY:
3124 case VM_INHERIT_SHARE:
3125 case VM_INHERIT_ZERO:
3128 return (KERN_INVALID_ARGUMENT);
3131 return (KERN_SUCCESS);
3133 VM_MAP_RANGE_CHECK(map, start, end);
3134 rv = vm_map_lookup_clip_start(map, start, &start_entry, &prev_entry);
3135 if (rv != KERN_SUCCESS)
3137 if (vm_map_lookup_entry(map, end - 1, &lentry)) {
3138 rv = vm_map_clip_end(map, lentry, end);
3139 if (rv != KERN_SUCCESS)
3142 if (new_inheritance == VM_INHERIT_COPY) {
3143 for (entry = start_entry; entry->start < end;
3144 prev_entry = entry, entry = vm_map_entry_succ(entry)) {
3145 if ((entry->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK)
3147 rv = KERN_INVALID_ARGUMENT;
3152 for (entry = start_entry; entry->start < end; prev_entry = entry,
3153 entry = vm_map_entry_succ(entry)) {
3154 KASSERT(entry->end <= end, ("non-clipped entry %p end %jx %jx",
3155 entry, (uintmax_t)entry->end, (uintmax_t)end));
3156 if ((entry->eflags & MAP_ENTRY_GUARD) == 0 ||
3157 new_inheritance != VM_INHERIT_ZERO)
3158 entry->inheritance = new_inheritance;
3159 vm_map_try_merge_entries(map, prev_entry, entry);
3161 vm_map_try_merge_entries(map, prev_entry, entry);
3168 * vm_map_entry_in_transition:
3170 * Release the map lock, and sleep until the entry is no longer in
3171 * transition. Awake and acquire the map lock. If the map changed while
3172 * another held the lock, lookup a possibly-changed entry at or after the
3173 * 'start' position of the old entry.
3175 static vm_map_entry_t
3176 vm_map_entry_in_transition(vm_map_t map, vm_offset_t in_start,
3177 vm_offset_t *io_end, bool holes_ok, vm_map_entry_t in_entry)
3179 vm_map_entry_t entry;
3181 u_int last_timestamp;
3183 VM_MAP_ASSERT_LOCKED(map);
3184 KASSERT((in_entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0,
3185 ("not in-tranition map entry %p", in_entry));
3187 * We have not yet clipped the entry.
3189 start = MAX(in_start, in_entry->start);
3190 in_entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
3191 last_timestamp = map->timestamp;
3192 if (vm_map_unlock_and_wait(map, 0)) {
3194 * Allow interruption of user wiring/unwiring?
3198 if (last_timestamp + 1 == map->timestamp)
3202 * Look again for the entry because the map was modified while it was
3203 * unlocked. Specifically, the entry may have been clipped, merged, or
3206 if (!vm_map_lookup_entry(map, start, &entry)) {
3211 entry = vm_map_entry_succ(entry);
3219 * Implements both kernel and user unwiring.
3222 vm_map_unwire(vm_map_t map, vm_offset_t start, vm_offset_t end,
3225 vm_map_entry_t entry, first_entry, next_entry, prev_entry;
3227 bool holes_ok, need_wakeup, user_unwire;
3230 return (KERN_SUCCESS);
3231 holes_ok = (flags & VM_MAP_WIRE_HOLESOK) != 0;
3232 user_unwire = (flags & VM_MAP_WIRE_USER) != 0;
3234 VM_MAP_RANGE_CHECK(map, start, end);
3235 if (!vm_map_lookup_entry(map, start, &first_entry)) {
3237 first_entry = vm_map_entry_succ(first_entry);
3240 return (KERN_INVALID_ADDRESS);
3244 for (entry = first_entry; entry->start < end; entry = next_entry) {
3245 if (entry->eflags & MAP_ENTRY_IN_TRANSITION) {
3247 * We have not yet clipped the entry.
3249 next_entry = vm_map_entry_in_transition(map, start,
3250 &end, holes_ok, entry);
3251 if (next_entry == NULL) {
3252 if (entry == first_entry) {
3254 return (KERN_INVALID_ADDRESS);
3256 rv = KERN_INVALID_ADDRESS;
3259 first_entry = (entry == first_entry) ?
3263 rv = vm_map_clip_start(map, entry, start);
3264 if (rv != KERN_SUCCESS)
3266 rv = vm_map_clip_end(map, entry, end);
3267 if (rv != KERN_SUCCESS)
3271 * Mark the entry in case the map lock is released. (See
3274 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 &&
3275 entry->wiring_thread == NULL,
3276 ("owned map entry %p", entry));
3277 entry->eflags |= MAP_ENTRY_IN_TRANSITION;
3278 entry->wiring_thread = curthread;
3279 next_entry = vm_map_entry_succ(entry);
3281 * Check the map for holes in the specified region.
3282 * If holes_ok, skip this check.
3285 entry->end < end && next_entry->start > entry->end) {
3287 rv = KERN_INVALID_ADDRESS;
3291 * If system unwiring, require that the entry is system wired.
3294 vm_map_entry_system_wired_count(entry) == 0) {
3296 rv = KERN_INVALID_ARGUMENT;
3300 need_wakeup = false;
3301 if (first_entry == NULL &&
3302 !vm_map_lookup_entry(map, start, &first_entry)) {
3303 KASSERT(holes_ok, ("vm_map_unwire: lookup failed"));
3304 prev_entry = first_entry;
3305 entry = vm_map_entry_succ(first_entry);
3307 prev_entry = vm_map_entry_pred(first_entry);
3308 entry = first_entry;
3310 for (; entry->start < end;
3311 prev_entry = entry, entry = vm_map_entry_succ(entry)) {
3313 * If holes_ok was specified, an empty
3314 * space in the unwired region could have been mapped
3315 * while the map lock was dropped for draining
3316 * MAP_ENTRY_IN_TRANSITION. Moreover, another thread
3317 * could be simultaneously wiring this new mapping
3318 * entry. Detect these cases and skip any entries
3319 * marked as in transition by us.
3321 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 ||
3322 entry->wiring_thread != curthread) {
3324 ("vm_map_unwire: !HOLESOK and new/changed entry"));
3328 if (rv == KERN_SUCCESS && (!user_unwire ||
3329 (entry->eflags & MAP_ENTRY_USER_WIRED))) {
3330 if (entry->wired_count == 1)
3331 vm_map_entry_unwire(map, entry);
3333 entry->wired_count--;
3335 entry->eflags &= ~MAP_ENTRY_USER_WIRED;
3337 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0,
3338 ("vm_map_unwire: in-transition flag missing %p", entry));
3339 KASSERT(entry->wiring_thread == curthread,
3340 ("vm_map_unwire: alien wire %p", entry));
3341 entry->eflags &= ~MAP_ENTRY_IN_TRANSITION;
3342 entry->wiring_thread = NULL;
3343 if (entry->eflags & MAP_ENTRY_NEEDS_WAKEUP) {
3344 entry->eflags &= ~MAP_ENTRY_NEEDS_WAKEUP;
3347 vm_map_try_merge_entries(map, prev_entry, entry);
3349 vm_map_try_merge_entries(map, prev_entry, entry);
3357 vm_map_wire_user_count_sub(u_long npages)
3360 atomic_subtract_long(&vm_user_wire_count, npages);
3364 vm_map_wire_user_count_add(u_long npages)
3368 wired = vm_user_wire_count;
3370 if (npages + wired > vm_page_max_user_wired)
3372 } while (!atomic_fcmpset_long(&vm_user_wire_count, &wired,
3379 * vm_map_wire_entry_failure:
3381 * Handle a wiring failure on the given entry.
3383 * The map should be locked.
3386 vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry,
3387 vm_offset_t failed_addr)
3390 VM_MAP_ASSERT_LOCKED(map);
3391 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0 &&
3392 entry->wired_count == 1,
3393 ("vm_map_wire_entry_failure: entry %p isn't being wired", entry));
3394 KASSERT(failed_addr < entry->end,
3395 ("vm_map_wire_entry_failure: entry %p was fully wired", entry));
3398 * If any pages at the start of this entry were successfully wired,
3401 if (failed_addr > entry->start) {
3402 pmap_unwire(map->pmap, entry->start, failed_addr);
3403 vm_object_unwire(entry->object.vm_object, entry->offset,
3404 failed_addr - entry->start, PQ_ACTIVE);
3408 * Assign an out-of-range value to represent the failure to wire this
3411 entry->wired_count = -1;
3415 vm_map_wire(vm_map_t map, vm_offset_t start, vm_offset_t end, int flags)
3420 rv = vm_map_wire_locked(map, start, end, flags);
3426 * vm_map_wire_locked:
3428 * Implements both kernel and user wiring. Returns with the map locked,
3429 * the map lock may be dropped.
3432 vm_map_wire_locked(vm_map_t map, vm_offset_t start, vm_offset_t end, int flags)
3434 vm_map_entry_t entry, first_entry, next_entry, prev_entry;
3435 vm_offset_t faddr, saved_end, saved_start;
3436 u_long incr, npages;
3437 u_int bidx, last_timestamp;
3439 bool holes_ok, need_wakeup, user_wire;
3442 VM_MAP_ASSERT_LOCKED(map);
3445 return (KERN_SUCCESS);
3447 if (flags & VM_MAP_WIRE_WRITE)
3448 prot |= VM_PROT_WRITE;
3449 holes_ok = (flags & VM_MAP_WIRE_HOLESOK) != 0;
3450 user_wire = (flags & VM_MAP_WIRE_USER) != 0;
3451 VM_MAP_RANGE_CHECK(map, start, end);
3452 if (!vm_map_lookup_entry(map, start, &first_entry)) {
3454 first_entry = vm_map_entry_succ(first_entry);
3456 return (KERN_INVALID_ADDRESS);
3458 for (entry = first_entry; entry->start < end; entry = next_entry) {
3459 if (entry->eflags & MAP_ENTRY_IN_TRANSITION) {
3461 * We have not yet clipped the entry.
3463 next_entry = vm_map_entry_in_transition(map, start,
3464 &end, holes_ok, entry);
3465 if (next_entry == NULL) {
3466 if (entry == first_entry)
3467 return (KERN_INVALID_ADDRESS);
3468 rv = KERN_INVALID_ADDRESS;
3471 first_entry = (entry == first_entry) ?
3475 rv = vm_map_clip_start(map, entry, start);
3476 if (rv != KERN_SUCCESS)
3478 rv = vm_map_clip_end(map, entry, end);
3479 if (rv != KERN_SUCCESS)
3483 * Mark the entry in case the map lock is released. (See
3486 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 &&
3487 entry->wiring_thread == NULL,
3488 ("owned map entry %p", entry));
3489 entry->eflags |= MAP_ENTRY_IN_TRANSITION;
3490 entry->wiring_thread = curthread;
3491 if ((entry->protection & (VM_PROT_READ | VM_PROT_EXECUTE)) == 0
3492 || (entry->protection & prot) != prot) {
3493 entry->eflags |= MAP_ENTRY_WIRE_SKIPPED;
3496 rv = KERN_INVALID_ADDRESS;
3499 } else if (entry->wired_count == 0) {
3500 entry->wired_count++;
3502 npages = atop(entry->end - entry->start);
3503 if (user_wire && !vm_map_wire_user_count_add(npages)) {
3504 vm_map_wire_entry_failure(map, entry,
3507 rv = KERN_RESOURCE_SHORTAGE;
3512 * Release the map lock, relying on the in-transition
3513 * mark. Mark the map busy for fork.
3515 saved_start = entry->start;
3516 saved_end = entry->end;
3517 last_timestamp = map->timestamp;
3518 bidx = (entry->eflags & MAP_ENTRY_SPLIT_BOUNDARY_MASK)
3519 >> MAP_ENTRY_SPLIT_BOUNDARY_SHIFT;
3520 incr = pagesizes[bidx];
3524 for (faddr = saved_start; faddr < saved_end;
3527 * Simulate a fault to get the page and enter
3528 * it into the physical map.
3530 rv = vm_fault(map, faddr, VM_PROT_NONE,
3531 VM_FAULT_WIRE, NULL);
3532 if (rv != KERN_SUCCESS)
3537 if (last_timestamp + 1 != map->timestamp) {
3539 * Look again for the entry because the map was
3540 * modified while it was unlocked. The entry
3541 * may have been clipped, but NOT merged or
3544 if (!vm_map_lookup_entry(map, saved_start,
3547 ("vm_map_wire: lookup failed"));
3548 first_entry = (entry == first_entry) ?
3550 for (entry = next_entry; entry->end < saved_end;
3551 entry = vm_map_entry_succ(entry)) {
3553 * In case of failure, handle entries
3554 * that were not fully wired here;
3555 * fully wired entries are handled
3558 if (rv != KERN_SUCCESS &&
3560 vm_map_wire_entry_failure(map,
3564 if (rv != KERN_SUCCESS) {
3565 vm_map_wire_entry_failure(map, entry, faddr);
3567 vm_map_wire_user_count_sub(npages);
3571 } else if (!user_wire ||
3572 (entry->eflags & MAP_ENTRY_USER_WIRED) == 0) {
3573 entry->wired_count++;
3576 * Check the map for holes in the specified region.
3577 * If holes_ok was specified, skip this check.
3579 next_entry = vm_map_entry_succ(entry);
3581 entry->end < end && next_entry->start > entry->end) {
3583 rv = KERN_INVALID_ADDRESS;
3589 need_wakeup = false;
3590 if (first_entry == NULL &&
3591 !vm_map_lookup_entry(map, start, &first_entry)) {
3592 KASSERT(holes_ok, ("vm_map_wire: lookup failed"));
3593 prev_entry = first_entry;
3594 entry = vm_map_entry_succ(first_entry);
3596 prev_entry = vm_map_entry_pred(first_entry);
3597 entry = first_entry;
3599 for (; entry->start < end;
3600 prev_entry = entry, entry = vm_map_entry_succ(entry)) {
3602 * If holes_ok was specified, an empty
3603 * space in the unwired region could have been mapped
3604 * while the map lock was dropped for faulting in the
3605 * pages or draining MAP_ENTRY_IN_TRANSITION.
3606 * Moreover, another thread could be simultaneously
3607 * wiring this new mapping entry. Detect these cases
3608 * and skip any entries marked as in transition not by us.
3610 * Another way to get an entry not marked with
3611 * MAP_ENTRY_IN_TRANSITION is after failed clipping,
3612 * which set rv to KERN_INVALID_ARGUMENT.
3614 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 ||
3615 entry->wiring_thread != curthread) {
3616 KASSERT(holes_ok || rv == KERN_INVALID_ARGUMENT,
3617 ("vm_map_wire: !HOLESOK and new/changed entry"));
3621 if ((entry->eflags & MAP_ENTRY_WIRE_SKIPPED) != 0) {
3623 } else if (rv == KERN_SUCCESS) {
3625 entry->eflags |= MAP_ENTRY_USER_WIRED;
3626 } else if (entry->wired_count == -1) {
3628 * Wiring failed on this entry. Thus, unwiring is
3631 entry->wired_count = 0;
3632 } else if (!user_wire ||
3633 (entry->eflags & MAP_ENTRY_USER_WIRED) == 0) {
3635 * Undo the wiring. Wiring succeeded on this entry
3636 * but failed on a later entry.
3638 if (entry->wired_count == 1) {
3639 vm_map_entry_unwire(map, entry);
3641 vm_map_wire_user_count_sub(
3642 atop(entry->end - entry->start));
3644 entry->wired_count--;
3646 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0,
3647 ("vm_map_wire: in-transition flag missing %p", entry));
3648 KASSERT(entry->wiring_thread == curthread,
3649 ("vm_map_wire: alien wire %p", entry));
3650 entry->eflags &= ~(MAP_ENTRY_IN_TRANSITION |
3651 MAP_ENTRY_WIRE_SKIPPED);
3652 entry->wiring_thread = NULL;
3653 if (entry->eflags & MAP_ENTRY_NEEDS_WAKEUP) {
3654 entry->eflags &= ~MAP_ENTRY_NEEDS_WAKEUP;
3657 vm_map_try_merge_entries(map, prev_entry, entry);
3659 vm_map_try_merge_entries(map, prev_entry, entry);
3668 * Push any dirty cached pages in the address range to their pager.
3669 * If syncio is TRUE, dirty pages are written synchronously.
3670 * If invalidate is TRUE, any cached pages are freed as well.
3672 * If the size of the region from start to end is zero, we are
3673 * supposed to flush all modified pages within the region containing
3674 * start. Unfortunately, a region can be split or coalesced with
3675 * neighboring regions, making it difficult to determine what the
3676 * original region was. Therefore, we approximate this requirement by
3677 * flushing the current region containing start.
3679 * Returns an error if any part of the specified range is not mapped.
3687 boolean_t invalidate)
3689 vm_map_entry_t entry, first_entry, next_entry;
3692 vm_ooffset_t offset;
3693 unsigned int last_timestamp;
3697 vm_map_lock_read(map);
3698 VM_MAP_RANGE_CHECK(map, start, end);
3699 if (!vm_map_lookup_entry(map, start, &first_entry)) {
3700 vm_map_unlock_read(map);
3701 return (KERN_INVALID_ADDRESS);
3702 } else if (start == end) {
3703 start = first_entry->start;
3704 end = first_entry->end;
3708 * Make a first pass to check for user-wired memory, holes,
3709 * and partial invalidation of largepage mappings.
3711 for (entry = first_entry; entry->start < end; entry = next_entry) {
3713 if ((entry->eflags & MAP_ENTRY_USER_WIRED) != 0) {
3714 vm_map_unlock_read(map);
3715 return (KERN_INVALID_ARGUMENT);
3717 bdry_idx = (entry->eflags &
3718 MAP_ENTRY_SPLIT_BOUNDARY_MASK) >>
3719 MAP_ENTRY_SPLIT_BOUNDARY_SHIFT;
3720 if (bdry_idx != 0 &&
3721 ((start & (pagesizes[bdry_idx] - 1)) != 0 ||
3722 (end & (pagesizes[bdry_idx] - 1)) != 0)) {
3723 vm_map_unlock_read(map);
3724 return (KERN_INVALID_ARGUMENT);
3727 next_entry = vm_map_entry_succ(entry);
3728 if (end > entry->end &&
3729 entry->end != next_entry->start) {
3730 vm_map_unlock_read(map);
3731 return (KERN_INVALID_ADDRESS);
3736 pmap_remove(map->pmap, start, end);
3740 * Make a second pass, cleaning/uncaching pages from the indicated
3743 for (entry = first_entry; entry->start < end;) {
3744 offset = entry->offset + (start - entry->start);
3745 size = (end <= entry->end ? end : entry->end) - start;
3746 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0) {
3748 vm_map_entry_t tentry;
3751 smap = entry->object.sub_map;
3752 vm_map_lock_read(smap);
3753 (void) vm_map_lookup_entry(smap, offset, &tentry);
3754 tsize = tentry->end - offset;
3757 object = tentry->object.vm_object;
3758 offset = tentry->offset + (offset - tentry->start);
3759 vm_map_unlock_read(smap);
3761 object = entry->object.vm_object;
3763 vm_object_reference(object);
3764 last_timestamp = map->timestamp;
3765 vm_map_unlock_read(map);
3766 if (!vm_object_sync(object, offset, size, syncio, invalidate))
3769 vm_object_deallocate(object);
3770 vm_map_lock_read(map);
3771 if (last_timestamp == map->timestamp ||
3772 !vm_map_lookup_entry(map, start, &entry))
3773 entry = vm_map_entry_succ(entry);
3776 vm_map_unlock_read(map);
3777 return (failed ? KERN_FAILURE : KERN_SUCCESS);
3781 * vm_map_entry_unwire: [ internal use only ]
3783 * Make the region specified by this entry pageable.
3785 * The map in question should be locked.
3786 * [This is the reason for this routine's existence.]
3789 vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry)
3793 VM_MAP_ASSERT_LOCKED(map);
3794 KASSERT(entry->wired_count > 0,
3795 ("vm_map_entry_unwire: entry %p isn't wired", entry));
3797 size = entry->end - entry->start;
3798 if ((entry->eflags & MAP_ENTRY_USER_WIRED) != 0)
3799 vm_map_wire_user_count_sub(atop(size));
3800 pmap_unwire(map->pmap, entry->start, entry->end);
3801 vm_object_unwire(entry->object.vm_object, entry->offset, size,
3803 entry->wired_count = 0;
3807 vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map)
3810 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0)
3811 vm_object_deallocate(entry->object.vm_object);
3812 uma_zfree(system_map ? kmapentzone : mapentzone, entry);
3816 * vm_map_entry_delete: [ internal use only ]
3818 * Deallocate the given entry from the target map.
3821 vm_map_entry_delete(vm_map_t map, vm_map_entry_t entry)
3824 vm_pindex_t offidxstart, offidxend, size1;
3827 vm_map_entry_unlink(map, entry, UNLINK_MERGE_NONE);
3828 object = entry->object.vm_object;
3830 if ((entry->eflags & MAP_ENTRY_GUARD) != 0) {
3831 MPASS(entry->cred == NULL);
3832 MPASS((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0);
3833 MPASS(object == NULL);
3834 vm_map_entry_deallocate(entry, map->system_map);
3838 size = entry->end - entry->start;
3841 if (entry->cred != NULL) {
3842 swap_release_by_cred(size, entry->cred);
3843 crfree(entry->cred);
3846 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0 || object == NULL) {
3847 entry->object.vm_object = NULL;
3848 } else if ((object->flags & OBJ_ANON) != 0 ||
3849 object == kernel_object) {
3850 KASSERT(entry->cred == NULL || object->cred == NULL ||
3851 (entry->eflags & MAP_ENTRY_NEEDS_COPY),
3852 ("OVERCOMMIT vm_map_entry_delete: both cred %p", entry));
3853 offidxstart = OFF_TO_IDX(entry->offset);
3854 offidxend = offidxstart + atop(size);
3855 VM_OBJECT_WLOCK(object);
3856 if (object->ref_count != 1 &&
3857 ((object->flags & OBJ_ONEMAPPING) != 0 ||
3858 object == kernel_object)) {
3859 vm_object_collapse(object);
3862 * The option OBJPR_NOTMAPPED can be passed here
3863 * because vm_map_delete() already performed
3864 * pmap_remove() on the only mapping to this range
3867 vm_object_page_remove(object, offidxstart, offidxend,
3869 if (offidxend >= object->size &&
3870 offidxstart < object->size) {
3871 size1 = object->size;
3872 object->size = offidxstart;
3873 if (object->cred != NULL) {
3874 size1 -= object->size;
3875 KASSERT(object->charge >= ptoa(size1),
3876 ("object %p charge < 0", object));
3877 swap_release_by_cred(ptoa(size1),
3879 object->charge -= ptoa(size1);
3883 VM_OBJECT_WUNLOCK(object);
3885 if (map->system_map)
3886 vm_map_entry_deallocate(entry, TRUE);
3888 entry->defer_next = curthread->td_map_def_user;
3889 curthread->td_map_def_user = entry;
3894 * vm_map_delete: [ internal use only ]
3896 * Deallocates the given address range from the target
3900 vm_map_delete(vm_map_t map, vm_offset_t start, vm_offset_t end)
3902 vm_map_entry_t entry, next_entry, scratch_entry;
3905 VM_MAP_ASSERT_LOCKED(map);
3908 return (KERN_SUCCESS);
3911 * Find the start of the region, and clip it.
3912 * Step through all entries in this region.
3914 rv = vm_map_lookup_clip_start(map, start, &entry, &scratch_entry);
3915 if (rv != KERN_SUCCESS)
3917 for (; entry->start < end; entry = next_entry) {
3919 * Wait for wiring or unwiring of an entry to complete.
3920 * Also wait for any system wirings to disappear on
3923 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0 ||
3924 (vm_map_pmap(map) != kernel_pmap &&
3925 vm_map_entry_system_wired_count(entry) != 0)) {
3926 unsigned int last_timestamp;
3927 vm_offset_t saved_start;
3929 saved_start = entry->start;
3930 entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
3931 last_timestamp = map->timestamp;
3932 (void) vm_map_unlock_and_wait(map, 0);
3934 if (last_timestamp + 1 != map->timestamp) {
3936 * Look again for the entry because the map was
3937 * modified while it was unlocked.
3938 * Specifically, the entry may have been
3939 * clipped, merged, or deleted.
3941 rv = vm_map_lookup_clip_start(map, saved_start,
3942 &next_entry, &scratch_entry);
3943 if (rv != KERN_SUCCESS)
3950 /* XXXKIB or delete to the upper superpage boundary ? */
3951 rv = vm_map_clip_end(map, entry, end);
3952 if (rv != KERN_SUCCESS)
3954 next_entry = vm_map_entry_succ(entry);
3957 * Unwire before removing addresses from the pmap; otherwise,
3958 * unwiring will put the entries back in the pmap.
3960 if (entry->wired_count != 0)
3961 vm_map_entry_unwire(map, entry);
3964 * Remove mappings for the pages, but only if the
3965 * mappings could exist. For instance, it does not
3966 * make sense to call pmap_remove() for guard entries.
3968 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0 ||
3969 entry->object.vm_object != NULL)
3970 pmap_remove(map->pmap, entry->start, entry->end);
3972 if (entry->end == map->anon_loc)
3973 map->anon_loc = entry->start;
3976 * Delete the entry only after removing all pmap
3977 * entries pointing to its pages. (Otherwise, its
3978 * page frames may be reallocated, and any modify bits
3979 * will be set in the wrong object!)
3981 vm_map_entry_delete(map, entry);
3989 * Remove the given address range from the target map.
3990 * This is the exported form of vm_map_delete.
3993 vm_map_remove(vm_map_t map, vm_offset_t start, vm_offset_t end)
3998 VM_MAP_RANGE_CHECK(map, start, end);
3999 result = vm_map_delete(map, start, end);
4005 * vm_map_check_protection:
4007 * Assert that the target map allows the specified privilege on the
4008 * entire address region given. The entire region must be allocated.
4010 * WARNING! This code does not and should not check whether the
4011 * contents of the region is accessible. For example a smaller file
4012 * might be mapped into a larger address space.
4014 * NOTE! This code is also called by munmap().
4016 * The map must be locked. A read lock is sufficient.
4019 vm_map_check_protection(vm_map_t map, vm_offset_t start, vm_offset_t end,
4020 vm_prot_t protection)
4022 vm_map_entry_t entry;
4023 vm_map_entry_t tmp_entry;
4025 if (!vm_map_lookup_entry(map, start, &tmp_entry))
4029 while (start < end) {
4033 if (start < entry->start)
4036 * Check protection associated with entry.
4038 if ((entry->protection & protection) != protection)
4040 /* go to next entry */
4042 entry = vm_map_entry_succ(entry);
4049 * vm_map_copy_swap_object:
4051 * Copies a swap-backed object from an existing map entry to a
4052 * new one. Carries forward the swap charge. May change the
4053 * src object on return.
4056 vm_map_copy_swap_object(vm_map_entry_t src_entry, vm_map_entry_t dst_entry,
4057 vm_offset_t size, vm_ooffset_t *fork_charge)
4059 vm_object_t src_object;
4063 src_object = src_entry->object.vm_object;
4064 charged = ENTRY_CHARGED(src_entry);
4065 if ((src_object->flags & OBJ_ANON) != 0) {
4066 VM_OBJECT_WLOCK(src_object);
4067 vm_object_collapse(src_object);
4068 if ((src_object->flags & OBJ_ONEMAPPING) != 0) {
4069 vm_object_split(src_entry);
4070 src_object = src_entry->object.vm_object;
4072 vm_object_reference_locked(src_object);
4073 vm_object_clear_flag(src_object, OBJ_ONEMAPPING);
4074 VM_OBJECT_WUNLOCK(src_object);
4076 vm_object_reference(src_object);
4077 if (src_entry->cred != NULL &&
4078 !(src_entry->eflags & MAP_ENTRY_NEEDS_COPY)) {
4079 KASSERT(src_object->cred == NULL,
4080 ("OVERCOMMIT: vm_map_copy_anon_entry: cred %p",
4082 src_object->cred = src_entry->cred;
4083 src_object->charge = size;
4085 dst_entry->object.vm_object = src_object;
4087 cred = curthread->td_ucred;
4089 dst_entry->cred = cred;
4090 *fork_charge += size;
4091 if (!(src_entry->eflags & MAP_ENTRY_NEEDS_COPY)) {
4093 src_entry->cred = cred;
4094 *fork_charge += size;
4100 * vm_map_copy_entry:
4102 * Copies the contents of the source entry to the destination
4103 * entry. The entries *must* be aligned properly.
4109 vm_map_entry_t src_entry,
4110 vm_map_entry_t dst_entry,
4111 vm_ooffset_t *fork_charge)
4113 vm_object_t src_object;
4114 vm_map_entry_t fake_entry;
4117 VM_MAP_ASSERT_LOCKED(dst_map);
4119 if ((dst_entry->eflags|src_entry->eflags) & MAP_ENTRY_IS_SUB_MAP)
4122 if (src_entry->wired_count == 0 ||
4123 (src_entry->protection & VM_PROT_WRITE) == 0) {
4125 * If the source entry is marked needs_copy, it is already
4128 if ((src_entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0 &&
4129 (src_entry->protection & VM_PROT_WRITE) != 0) {
4130 pmap_protect(src_map->pmap,
4133 src_entry->protection & ~VM_PROT_WRITE);
4137 * Make a copy of the object.
4139 size = src_entry->end - src_entry->start;
4140 if ((src_object = src_entry->object.vm_object) != NULL) {
4142 * Swap-backed objects need special handling. Note that
4143 * this is an unlocked check, so it is possible to race
4144 * with an OBJT_DEFAULT -> OBJT_SWAP conversion.
4146 if (src_object->type == OBJT_DEFAULT ||
4147 src_object->type == OBJT_SWAP ||
4148 (src_object->flags & OBJ_SWAP) != 0) {
4149 vm_map_copy_swap_object(src_entry, dst_entry,
4151 /* May have split/collapsed, reload obj. */
4152 src_object = src_entry->object.vm_object;
4154 vm_object_reference(src_object);
4155 dst_entry->object.vm_object = src_object;
4157 src_entry->eflags |= MAP_ENTRY_COW |
4158 MAP_ENTRY_NEEDS_COPY;
4159 dst_entry->eflags |= MAP_ENTRY_COW |
4160 MAP_ENTRY_NEEDS_COPY;
4161 dst_entry->offset = src_entry->offset;
4162 if (src_entry->eflags & MAP_ENTRY_WRITECNT) {
4164 * MAP_ENTRY_WRITECNT cannot
4165 * indicate write reference from
4166 * src_entry, since the entry is
4167 * marked as needs copy. Allocate a
4168 * fake entry that is used to
4169 * decrement object->un_pager writecount
4170 * at the appropriate time. Attach
4171 * fake_entry to the deferred list.
4173 fake_entry = vm_map_entry_create(dst_map);
4174 fake_entry->eflags = MAP_ENTRY_WRITECNT;
4175 src_entry->eflags &= ~MAP_ENTRY_WRITECNT;
4176 vm_object_reference(src_object);
4177 fake_entry->object.vm_object = src_object;
4178 fake_entry->start = src_entry->start;
4179 fake_entry->end = src_entry->end;
4180 fake_entry->defer_next =
4181 curthread->td_map_def_user;
4182 curthread->td_map_def_user = fake_entry;
4185 pmap_copy(dst_map->pmap, src_map->pmap,
4186 dst_entry->start, dst_entry->end - dst_entry->start,
4189 dst_entry->object.vm_object = NULL;
4190 dst_entry->offset = 0;
4191 if (src_entry->cred != NULL) {
4192 dst_entry->cred = curthread->td_ucred;
4193 crhold(dst_entry->cred);
4194 *fork_charge += size;
4199 * We don't want to make writeable wired pages copy-on-write.
4200 * Immediately copy these pages into the new map by simulating
4201 * page faults. The new pages are pageable.
4203 vm_fault_copy_entry(dst_map, src_map, dst_entry, src_entry,
4209 * vmspace_map_entry_forked:
4210 * Update the newly-forked vmspace each time a map entry is inherited
4211 * or copied. The values for vm_dsize and vm_tsize are approximate
4212 * (and mostly-obsolete ideas in the face of mmap(2) et al.)
4215 vmspace_map_entry_forked(const struct vmspace *vm1, struct vmspace *vm2,
4216 vm_map_entry_t entry)
4218 vm_size_t entrysize;
4221 if ((entry->eflags & MAP_ENTRY_GUARD) != 0)
4223 entrysize = entry->end - entry->start;
4224 vm2->vm_map.size += entrysize;
4225 if (entry->eflags & (MAP_ENTRY_GROWS_DOWN | MAP_ENTRY_GROWS_UP)) {
4226 vm2->vm_ssize += btoc(entrysize);
4227 } else if (entry->start >= (vm_offset_t)vm1->vm_daddr &&
4228 entry->start < (vm_offset_t)vm1->vm_daddr + ctob(vm1->vm_dsize)) {
4229 newend = MIN(entry->end,
4230 (vm_offset_t)vm1->vm_daddr + ctob(vm1->vm_dsize));
4231 vm2->vm_dsize += btoc(newend - entry->start);
4232 } else if (entry->start >= (vm_offset_t)vm1->vm_taddr &&
4233 entry->start < (vm_offset_t)vm1->vm_taddr + ctob(vm1->vm_tsize)) {
4234 newend = MIN(entry->end,
4235 (vm_offset_t)vm1->vm_taddr + ctob(vm1->vm_tsize));
4236 vm2->vm_tsize += btoc(newend - entry->start);
4242 * Create a new process vmspace structure and vm_map
4243 * based on those of an existing process. The new map
4244 * is based on the old map, according to the inheritance
4245 * values on the regions in that map.
4247 * XXX It might be worth coalescing the entries added to the new vmspace.
4249 * The source map must not be locked.
4252 vmspace_fork(struct vmspace *vm1, vm_ooffset_t *fork_charge)
4254 struct vmspace *vm2;
4255 vm_map_t new_map, old_map;
4256 vm_map_entry_t new_entry, old_entry;
4261 old_map = &vm1->vm_map;
4262 /* Copy immutable fields of vm1 to vm2. */
4263 vm2 = vmspace_alloc(vm_map_min(old_map), vm_map_max(old_map),
4268 vm2->vm_taddr = vm1->vm_taddr;
4269 vm2->vm_daddr = vm1->vm_daddr;
4270 vm2->vm_maxsaddr = vm1->vm_maxsaddr;
4271 vm2->vm_stacktop = vm1->vm_stacktop;
4272 vm_map_lock(old_map);
4274 vm_map_wait_busy(old_map);
4275 new_map = &vm2->vm_map;
4276 locked = vm_map_trylock(new_map); /* trylock to silence WITNESS */
4277 KASSERT(locked, ("vmspace_fork: lock failed"));
4279 error = pmap_vmspace_copy(new_map->pmap, old_map->pmap);
4281 sx_xunlock(&old_map->lock);
4282 sx_xunlock(&new_map->lock);
4283 vm_map_process_deferred();
4288 new_map->anon_loc = old_map->anon_loc;
4289 new_map->flags |= old_map->flags & (MAP_ASLR | MAP_ASLR_IGNSTART |
4290 MAP_ASLR_STACK | MAP_WXORX);
4292 VM_MAP_ENTRY_FOREACH(old_entry, old_map) {
4293 if ((old_entry->eflags & MAP_ENTRY_IS_SUB_MAP) != 0)
4294 panic("vm_map_fork: encountered a submap");
4296 inh = old_entry->inheritance;
4297 if ((old_entry->eflags & MAP_ENTRY_GUARD) != 0 &&
4298 inh != VM_INHERIT_NONE)
4299 inh = VM_INHERIT_COPY;
4302 case VM_INHERIT_NONE:
4305 case VM_INHERIT_SHARE:
4307 * Clone the entry, creating the shared object if
4310 object = old_entry->object.vm_object;
4311 if (object == NULL) {
4312 vm_map_entry_back(old_entry);
4313 object = old_entry->object.vm_object;
4317 * Add the reference before calling vm_object_shadow
4318 * to insure that a shadow object is created.
4320 vm_object_reference(object);
4321 if (old_entry->eflags & MAP_ENTRY_NEEDS_COPY) {
4322 vm_object_shadow(&old_entry->object.vm_object,
4324 old_entry->end - old_entry->start,
4326 /* Transfer the second reference too. */
4328 old_entry->eflags &= ~MAP_ENTRY_NEEDS_COPY;
4329 old_entry->cred = NULL;
4332 * As in vm_map_merged_neighbor_dispose(),
4333 * the vnode lock will not be acquired in
4334 * this call to vm_object_deallocate().
4336 vm_object_deallocate(object);
4337 object = old_entry->object.vm_object;
4339 VM_OBJECT_WLOCK(object);
4340 vm_object_clear_flag(object, OBJ_ONEMAPPING);
4341 if (old_entry->cred != NULL) {
4342 KASSERT(object->cred == NULL,
4343 ("vmspace_fork both cred"));
4344 object->cred = old_entry->cred;
4345 object->charge = old_entry->end -
4347 old_entry->cred = NULL;
4351 * Assert the correct state of the vnode
4352 * v_writecount while the object is locked, to
4353 * not relock it later for the assertion
4356 if (old_entry->eflags & MAP_ENTRY_WRITECNT &&
4357 object->type == OBJT_VNODE) {
4358 KASSERT(((struct vnode *)object->
4359 handle)->v_writecount > 0,
4360 ("vmspace_fork: v_writecount %p",
4362 KASSERT(object->un_pager.vnp.
4364 ("vmspace_fork: vnp.writecount %p",
4367 VM_OBJECT_WUNLOCK(object);
4371 * Clone the entry, referencing the shared object.
4373 new_entry = vm_map_entry_create(new_map);
4374 *new_entry = *old_entry;
4375 new_entry->eflags &= ~(MAP_ENTRY_USER_WIRED |
4376 MAP_ENTRY_IN_TRANSITION);
4377 new_entry->wiring_thread = NULL;
4378 new_entry->wired_count = 0;
4379 if (new_entry->eflags & MAP_ENTRY_WRITECNT) {
4380 vm_pager_update_writecount(object,
4381 new_entry->start, new_entry->end);
4383 vm_map_entry_set_vnode_text(new_entry, true);
4386 * Insert the entry into the new map -- we know we're
4387 * inserting at the end of the new map.
4389 vm_map_entry_link(new_map, new_entry);
4390 vmspace_map_entry_forked(vm1, vm2, new_entry);
4393 * Update the physical map
4395 pmap_copy(new_map->pmap, old_map->pmap,
4397 (old_entry->end - old_entry->start),
4401 case VM_INHERIT_COPY:
4403 * Clone the entry and link into the map.
4405 new_entry = vm_map_entry_create(new_map);
4406 *new_entry = *old_entry;
4408 * Copied entry is COW over the old object.
4410 new_entry->eflags &= ~(MAP_ENTRY_USER_WIRED |
4411 MAP_ENTRY_IN_TRANSITION | MAP_ENTRY_WRITECNT);
4412 new_entry->wiring_thread = NULL;
4413 new_entry->wired_count = 0;
4414 new_entry->object.vm_object = NULL;
4415 new_entry->cred = NULL;
4416 vm_map_entry_link(new_map, new_entry);
4417 vmspace_map_entry_forked(vm1, vm2, new_entry);
4418 vm_map_copy_entry(old_map, new_map, old_entry,
4419 new_entry, fork_charge);
4420 vm_map_entry_set_vnode_text(new_entry, true);
4423 case VM_INHERIT_ZERO:
4425 * Create a new anonymous mapping entry modelled from
4428 new_entry = vm_map_entry_create(new_map);
4429 memset(new_entry, 0, sizeof(*new_entry));
4431 new_entry->start = old_entry->start;
4432 new_entry->end = old_entry->end;
4433 new_entry->eflags = old_entry->eflags &
4434 ~(MAP_ENTRY_USER_WIRED | MAP_ENTRY_IN_TRANSITION |
4435 MAP_ENTRY_WRITECNT | MAP_ENTRY_VN_EXEC |
4436 MAP_ENTRY_SPLIT_BOUNDARY_MASK);
4437 new_entry->protection = old_entry->protection;
4438 new_entry->max_protection = old_entry->max_protection;
4439 new_entry->inheritance = VM_INHERIT_ZERO;
4441 vm_map_entry_link(new_map, new_entry);
4442 vmspace_map_entry_forked(vm1, vm2, new_entry);
4444 new_entry->cred = curthread->td_ucred;
4445 crhold(new_entry->cred);
4446 *fork_charge += (new_entry->end - new_entry->start);
4452 * Use inlined vm_map_unlock() to postpone handling the deferred
4453 * map entries, which cannot be done until both old_map and
4454 * new_map locks are released.
4456 sx_xunlock(&old_map->lock);
4457 sx_xunlock(&new_map->lock);
4458 vm_map_process_deferred();
4464 * Create a process's stack for exec_new_vmspace(). This function is never
4465 * asked to wire the newly created stack.
4468 vm_map_stack(vm_map_t map, vm_offset_t addrbos, vm_size_t max_ssize,
4469 vm_prot_t prot, vm_prot_t max, int cow)
4471 vm_size_t growsize, init_ssize;
4475 MPASS((map->flags & MAP_WIREFUTURE) == 0);
4476 growsize = sgrowsiz;
4477 init_ssize = (max_ssize < growsize) ? max_ssize : growsize;
4479 vmemlim = lim_cur(curthread, RLIMIT_VMEM);
4480 /* If we would blow our VMEM resource limit, no go */
4481 if (map->size + init_ssize > vmemlim) {
4485 rv = vm_map_stack_locked(map, addrbos, max_ssize, growsize, prot,
4492 static int stack_guard_page = 1;
4493 SYSCTL_INT(_security_bsd, OID_AUTO, stack_guard_page, CTLFLAG_RWTUN,
4494 &stack_guard_page, 0,
4495 "Specifies the number of guard pages for a stack that grows");
4498 vm_map_stack_locked(vm_map_t map, vm_offset_t addrbos, vm_size_t max_ssize,
4499 vm_size_t growsize, vm_prot_t prot, vm_prot_t max, int cow)
4501 vm_map_entry_t new_entry, prev_entry;
4502 vm_offset_t bot, gap_bot, gap_top, top;
4503 vm_size_t init_ssize, sgp;
4507 * The stack orientation is piggybacked with the cow argument.
4508 * Extract it into orient and mask the cow argument so that we
4509 * don't pass it around further.
4511 orient = cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP);
4512 KASSERT(orient != 0, ("No stack grow direction"));
4513 KASSERT(orient != (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP),
4516 if (max_ssize == 0 ||
4517 !vm_map_range_valid(map, addrbos, addrbos + max_ssize))
4518 return (KERN_INVALID_ADDRESS);
4519 sgp = ((curproc->p_flag2 & P2_STKGAP_DISABLE) != 0 ||
4520 (curproc->p_fctl0 & NT_FREEBSD_FCTL_STKGAP_DISABLE) != 0) ? 0 :
4521 (vm_size_t)stack_guard_page * PAGE_SIZE;
4522 if (sgp >= max_ssize)
4523 return (KERN_INVALID_ARGUMENT);
4525 init_ssize = growsize;
4526 if (max_ssize < init_ssize + sgp)
4527 init_ssize = max_ssize - sgp;
4529 /* If addr is already mapped, no go */
4530 if (vm_map_lookup_entry(map, addrbos, &prev_entry))
4531 return (KERN_NO_SPACE);
4534 * If we can't accommodate max_ssize in the current mapping, no go.
4536 if (vm_map_entry_succ(prev_entry)->start < addrbos + max_ssize)
4537 return (KERN_NO_SPACE);
4540 * We initially map a stack of only init_ssize. We will grow as
4541 * needed later. Depending on the orientation of the stack (i.e.
4542 * the grow direction) we either map at the top of the range, the
4543 * bottom of the range or in the middle.
4545 * Note: we would normally expect prot and max to be VM_PROT_ALL,
4546 * and cow to be 0. Possibly we should eliminate these as input
4547 * parameters, and just pass these values here in the insert call.
4549 if (orient == MAP_STACK_GROWS_DOWN) {
4550 bot = addrbos + max_ssize - init_ssize;
4551 top = bot + init_ssize;
4554 } else /* if (orient == MAP_STACK_GROWS_UP) */ {
4556 top = bot + init_ssize;
4558 gap_top = addrbos + max_ssize;
4560 rv = vm_map_insert(map, NULL, 0, bot, top, prot, max, cow);
4561 if (rv != KERN_SUCCESS)
4563 new_entry = vm_map_entry_succ(prev_entry);
4564 KASSERT(new_entry->end == top || new_entry->start == bot,
4565 ("Bad entry start/end for new stack entry"));
4566 KASSERT((orient & MAP_STACK_GROWS_DOWN) == 0 ||
4567 (new_entry->eflags & MAP_ENTRY_GROWS_DOWN) != 0,
4568 ("new entry lacks MAP_ENTRY_GROWS_DOWN"));
4569 KASSERT((orient & MAP_STACK_GROWS_UP) == 0 ||
4570 (new_entry->eflags & MAP_ENTRY_GROWS_UP) != 0,
4571 ("new entry lacks MAP_ENTRY_GROWS_UP"));
4572 if (gap_bot == gap_top)
4573 return (KERN_SUCCESS);
4574 rv = vm_map_insert(map, NULL, 0, gap_bot, gap_top, VM_PROT_NONE,
4575 VM_PROT_NONE, MAP_CREATE_GUARD | (orient == MAP_STACK_GROWS_DOWN ?
4576 MAP_CREATE_STACK_GAP_DN : MAP_CREATE_STACK_GAP_UP));
4577 if (rv == KERN_SUCCESS) {
4579 * Gap can never successfully handle a fault, so
4580 * read-ahead logic is never used for it. Re-use
4581 * next_read of the gap entry to store
4582 * stack_guard_page for vm_map_growstack().
4584 if (orient == MAP_STACK_GROWS_DOWN)
4585 vm_map_entry_pred(new_entry)->next_read = sgp;
4587 vm_map_entry_succ(new_entry)->next_read = sgp;
4589 (void)vm_map_delete(map, bot, top);
4595 * Attempts to grow a vm stack entry. Returns KERN_SUCCESS if we
4596 * successfully grow the stack.
4599 vm_map_growstack(vm_map_t map, vm_offset_t addr, vm_map_entry_t gap_entry)
4601 vm_map_entry_t stack_entry;
4605 vm_offset_t gap_end, gap_start, grow_start;
4606 vm_size_t grow_amount, guard, max_grow;
4607 rlim_t lmemlim, stacklim, vmemlim;
4609 bool gap_deleted, grow_down, is_procstack;
4621 * Disallow stack growth when the access is performed by a
4622 * debugger or AIO daemon. The reason is that the wrong
4623 * resource limits are applied.
4625 if (p != initproc && (map != &p->p_vmspace->vm_map ||
4626 p->p_textvp == NULL))
4627 return (KERN_FAILURE);
4629 MPASS(!map->system_map);
4631 lmemlim = lim_cur(curthread, RLIMIT_MEMLOCK);
4632 stacklim = lim_cur(curthread, RLIMIT_STACK);
4633 vmemlim = lim_cur(curthread, RLIMIT_VMEM);
4635 /* If addr is not in a hole for a stack grow area, no need to grow. */
4636 if (gap_entry == NULL && !vm_map_lookup_entry(map, addr, &gap_entry))
4637 return (KERN_FAILURE);
4638 if ((gap_entry->eflags & MAP_ENTRY_GUARD) == 0)
4639 return (KERN_SUCCESS);
4640 if ((gap_entry->eflags & MAP_ENTRY_STACK_GAP_DN) != 0) {
4641 stack_entry = vm_map_entry_succ(gap_entry);
4642 if ((stack_entry->eflags & MAP_ENTRY_GROWS_DOWN) == 0 ||
4643 stack_entry->start != gap_entry->end)
4644 return (KERN_FAILURE);
4645 grow_amount = round_page(stack_entry->start - addr);
4647 } else if ((gap_entry->eflags & MAP_ENTRY_STACK_GAP_UP) != 0) {
4648 stack_entry = vm_map_entry_pred(gap_entry);
4649 if ((stack_entry->eflags & MAP_ENTRY_GROWS_UP) == 0 ||
4650 stack_entry->end != gap_entry->start)
4651 return (KERN_FAILURE);
4652 grow_amount = round_page(addr + 1 - stack_entry->end);
4655 return (KERN_FAILURE);
4657 guard = ((curproc->p_flag2 & P2_STKGAP_DISABLE) != 0 ||
4658 (curproc->p_fctl0 & NT_FREEBSD_FCTL_STKGAP_DISABLE) != 0) ? 0 :
4659 gap_entry->next_read;
4660 max_grow = gap_entry->end - gap_entry->start;
4661 if (guard > max_grow)
4662 return (KERN_NO_SPACE);
4664 if (grow_amount > max_grow)
4665 return (KERN_NO_SPACE);
4668 * If this is the main process stack, see if we're over the stack
4671 is_procstack = addr >= (vm_offset_t)vm->vm_maxsaddr &&
4672 addr < (vm_offset_t)vm->vm_stacktop;
4673 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > stacklim))
4674 return (KERN_NO_SPACE);
4679 if (is_procstack && racct_set(p, RACCT_STACK,
4680 ctob(vm->vm_ssize) + grow_amount)) {
4682 return (KERN_NO_SPACE);
4688 grow_amount = roundup(grow_amount, sgrowsiz);
4689 if (grow_amount > max_grow)
4690 grow_amount = max_grow;
4691 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > stacklim)) {
4692 grow_amount = trunc_page((vm_size_t)stacklim) -
4698 limit = racct_get_available(p, RACCT_STACK);
4700 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > limit))
4701 grow_amount = limit - ctob(vm->vm_ssize);
4704 if (!old_mlock && (map->flags & MAP_WIREFUTURE) != 0) {
4705 if (ptoa(pmap_wired_count(map->pmap)) + grow_amount > lmemlim) {
4712 if (racct_set(p, RACCT_MEMLOCK,
4713 ptoa(pmap_wired_count(map->pmap)) + grow_amount)) {
4723 /* If we would blow our VMEM resource limit, no go */
4724 if (map->size + grow_amount > vmemlim) {
4731 if (racct_set(p, RACCT_VMEM, map->size + grow_amount)) {
4740 if (vm_map_lock_upgrade(map)) {
4742 vm_map_lock_read(map);
4747 grow_start = gap_entry->end - grow_amount;
4748 if (gap_entry->start + grow_amount == gap_entry->end) {
4749 gap_start = gap_entry->start;
4750 gap_end = gap_entry->end;
4751 vm_map_entry_delete(map, gap_entry);
4754 MPASS(gap_entry->start < gap_entry->end - grow_amount);
4755 vm_map_entry_resize(map, gap_entry, -grow_amount);
4756 gap_deleted = false;
4758 rv = vm_map_insert(map, NULL, 0, grow_start,
4759 grow_start + grow_amount,
4760 stack_entry->protection, stack_entry->max_protection,
4761 MAP_STACK_GROWS_DOWN);
4762 if (rv != KERN_SUCCESS) {
4764 rv1 = vm_map_insert(map, NULL, 0, gap_start,
4765 gap_end, VM_PROT_NONE, VM_PROT_NONE,
4766 MAP_CREATE_GUARD | MAP_CREATE_STACK_GAP_DN);
4767 MPASS(rv1 == KERN_SUCCESS);
4769 vm_map_entry_resize(map, gap_entry,
4773 grow_start = stack_entry->end;
4774 cred = stack_entry->cred;
4775 if (cred == NULL && stack_entry->object.vm_object != NULL)
4776 cred = stack_entry->object.vm_object->cred;
4777 if (cred != NULL && !swap_reserve_by_cred(grow_amount, cred))
4779 /* Grow the underlying object if applicable. */
4780 else if (stack_entry->object.vm_object == NULL ||
4781 vm_object_coalesce(stack_entry->object.vm_object,
4782 stack_entry->offset,
4783 (vm_size_t)(stack_entry->end - stack_entry->start),
4784 grow_amount, cred != NULL)) {
4785 if (gap_entry->start + grow_amount == gap_entry->end) {
4786 vm_map_entry_delete(map, gap_entry);
4787 vm_map_entry_resize(map, stack_entry,
4790 gap_entry->start += grow_amount;
4791 stack_entry->end += grow_amount;
4793 map->size += grow_amount;
4798 if (rv == KERN_SUCCESS && is_procstack)
4799 vm->vm_ssize += btoc(grow_amount);
4802 * Heed the MAP_WIREFUTURE flag if it was set for this process.
4804 if (rv == KERN_SUCCESS && (map->flags & MAP_WIREFUTURE) != 0) {
4805 rv = vm_map_wire_locked(map, grow_start,
4806 grow_start + grow_amount,
4807 VM_MAP_WIRE_USER | VM_MAP_WIRE_NOHOLES);
4809 vm_map_lock_downgrade(map);
4813 if (racct_enable && rv != KERN_SUCCESS) {
4815 error = racct_set(p, RACCT_VMEM, map->size);
4816 KASSERT(error == 0, ("decreasing RACCT_VMEM failed"));
4818 error = racct_set(p, RACCT_MEMLOCK,
4819 ptoa(pmap_wired_count(map->pmap)));
4820 KASSERT(error == 0, ("decreasing RACCT_MEMLOCK failed"));
4822 error = racct_set(p, RACCT_STACK, ctob(vm->vm_ssize));
4823 KASSERT(error == 0, ("decreasing RACCT_STACK failed"));
4832 * Unshare the specified VM space for exec. If other processes are
4833 * mapped to it, then create a new one. The new vmspace is null.
4836 vmspace_exec(struct proc *p, vm_offset_t minuser, vm_offset_t maxuser)
4838 struct vmspace *oldvmspace = p->p_vmspace;
4839 struct vmspace *newvmspace;
4841 KASSERT((curthread->td_pflags & TDP_EXECVMSPC) == 0,
4842 ("vmspace_exec recursed"));
4843 newvmspace = vmspace_alloc(minuser, maxuser, pmap_pinit);
4844 if (newvmspace == NULL)
4846 newvmspace->vm_swrss = oldvmspace->vm_swrss;
4848 * This code is written like this for prototype purposes. The
4849 * goal is to avoid running down the vmspace here, but let the
4850 * other process's that are still using the vmspace to finally
4851 * run it down. Even though there is little or no chance of blocking
4852 * here, it is a good idea to keep this form for future mods.
4854 PROC_VMSPACE_LOCK(p);
4855 p->p_vmspace = newvmspace;
4856 PROC_VMSPACE_UNLOCK(p);
4857 if (p == curthread->td_proc)
4858 pmap_activate(curthread);
4859 curthread->td_pflags |= TDP_EXECVMSPC;
4864 * Unshare the specified VM space for forcing COW. This
4865 * is called by rfork, for the (RFMEM|RFPROC) == 0 case.
4868 vmspace_unshare(struct proc *p)
4870 struct vmspace *oldvmspace = p->p_vmspace;
4871 struct vmspace *newvmspace;
4872 vm_ooffset_t fork_charge;
4875 * The caller is responsible for ensuring that the reference count
4876 * cannot concurrently transition 1 -> 2.
4878 if (refcount_load(&oldvmspace->vm_refcnt) == 1)
4881 newvmspace = vmspace_fork(oldvmspace, &fork_charge);
4882 if (newvmspace == NULL)
4884 if (!swap_reserve_by_cred(fork_charge, p->p_ucred)) {
4885 vmspace_free(newvmspace);
4888 PROC_VMSPACE_LOCK(p);
4889 p->p_vmspace = newvmspace;
4890 PROC_VMSPACE_UNLOCK(p);
4891 if (p == curthread->td_proc)
4892 pmap_activate(curthread);
4893 vmspace_free(oldvmspace);
4900 * Finds the VM object, offset, and
4901 * protection for a given virtual address in the
4902 * specified map, assuming a page fault of the
4905 * Leaves the map in question locked for read; return
4906 * values are guaranteed until a vm_map_lookup_done
4907 * call is performed. Note that the map argument
4908 * is in/out; the returned map must be used in
4909 * the call to vm_map_lookup_done.
4911 * A handle (out_entry) is returned for use in
4912 * vm_map_lookup_done, to make that fast.
4914 * If a lookup is requested with "write protection"
4915 * specified, the map may be changed to perform virtual
4916 * copying operations, although the data referenced will
4920 vm_map_lookup(vm_map_t *var_map, /* IN/OUT */
4922 vm_prot_t fault_typea,
4923 vm_map_entry_t *out_entry, /* OUT */
4924 vm_object_t *object, /* OUT */
4925 vm_pindex_t *pindex, /* OUT */
4926 vm_prot_t *out_prot, /* OUT */
4927 boolean_t *wired) /* OUT */
4929 vm_map_entry_t entry;
4930 vm_map_t map = *var_map;
4932 vm_prot_t fault_type;
4933 vm_object_t eobject;
4939 vm_map_lock_read(map);
4943 * Lookup the faulting address.
4945 if (!vm_map_lookup_entry(map, vaddr, out_entry)) {
4946 vm_map_unlock_read(map);
4947 return (KERN_INVALID_ADDRESS);
4955 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
4956 vm_map_t old_map = map;
4958 *var_map = map = entry->object.sub_map;
4959 vm_map_unlock_read(old_map);
4964 * Check whether this task is allowed to have this page.
4966 prot = entry->protection;
4967 if ((fault_typea & VM_PROT_FAULT_LOOKUP) != 0) {
4968 fault_typea &= ~VM_PROT_FAULT_LOOKUP;
4969 if (prot == VM_PROT_NONE && map != kernel_map &&
4970 (entry->eflags & MAP_ENTRY_GUARD) != 0 &&
4971 (entry->eflags & (MAP_ENTRY_STACK_GAP_DN |
4972 MAP_ENTRY_STACK_GAP_UP)) != 0 &&
4973 vm_map_growstack(map, vaddr, entry) == KERN_SUCCESS)
4974 goto RetryLookupLocked;
4976 fault_type = fault_typea & VM_PROT_ALL;
4977 if ((fault_type & prot) != fault_type || prot == VM_PROT_NONE) {
4978 vm_map_unlock_read(map);
4979 return (KERN_PROTECTION_FAILURE);
4981 KASSERT((prot & VM_PROT_WRITE) == 0 || (entry->eflags &
4982 (MAP_ENTRY_USER_WIRED | MAP_ENTRY_NEEDS_COPY)) !=
4983 (MAP_ENTRY_USER_WIRED | MAP_ENTRY_NEEDS_COPY),
4984 ("entry %p flags %x", entry, entry->eflags));
4985 if ((fault_typea & VM_PROT_COPY) != 0 &&
4986 (entry->max_protection & VM_PROT_WRITE) == 0 &&
4987 (entry->eflags & MAP_ENTRY_COW) == 0) {
4988 vm_map_unlock_read(map);
4989 return (KERN_PROTECTION_FAILURE);
4993 * If this page is not pageable, we have to get it for all possible
4996 *wired = (entry->wired_count != 0);
4998 fault_type = entry->protection;
4999 size = entry->end - entry->start;
5002 * If the entry was copy-on-write, we either ...
5004 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) {
5006 * If we want to write the page, we may as well handle that
5007 * now since we've got the map locked.
5009 * If we don't need to write the page, we just demote the
5010 * permissions allowed.
5012 if ((fault_type & VM_PROT_WRITE) != 0 ||
5013 (fault_typea & VM_PROT_COPY) != 0) {
5015 * Make a new object, and place it in the object
5016 * chain. Note that no new references have appeared
5017 * -- one just moved from the map to the new
5020 if (vm_map_lock_upgrade(map))
5023 if (entry->cred == NULL) {
5025 * The debugger owner is charged for
5028 cred = curthread->td_ucred;
5030 if (!swap_reserve_by_cred(size, cred)) {
5033 return (KERN_RESOURCE_SHORTAGE);
5037 eobject = entry->object.vm_object;
5038 vm_object_shadow(&entry->object.vm_object,
5039 &entry->offset, size, entry->cred, false);
5040 if (eobject == entry->object.vm_object) {
5042 * The object was not shadowed.
5044 swap_release_by_cred(size, entry->cred);
5045 crfree(entry->cred);
5048 entry->eflags &= ~MAP_ENTRY_NEEDS_COPY;
5050 vm_map_lock_downgrade(map);
5053 * We're attempting to read a copy-on-write page --
5054 * don't allow writes.
5056 prot &= ~VM_PROT_WRITE;
5061 * Create an object if necessary.
5063 if (entry->object.vm_object == NULL && !map->system_map) {
5064 if (vm_map_lock_upgrade(map))
5066 entry->object.vm_object = vm_object_allocate_anon(atop(size),
5067 NULL, entry->cred, entry->cred != NULL ? size : 0);
5070 vm_map_lock_downgrade(map);
5074 * Return the object/offset from this entry. If the entry was
5075 * copy-on-write or empty, it has been fixed up.
5077 *pindex = OFF_TO_IDX((vaddr - entry->start) + entry->offset);
5078 *object = entry->object.vm_object;
5081 return (KERN_SUCCESS);
5085 * vm_map_lookup_locked:
5087 * Lookup the faulting address. A version of vm_map_lookup that returns
5088 * KERN_FAILURE instead of blocking on map lock or memory allocation.
5091 vm_map_lookup_locked(vm_map_t *var_map, /* IN/OUT */
5093 vm_prot_t fault_typea,
5094 vm_map_entry_t *out_entry, /* OUT */
5095 vm_object_t *object, /* OUT */
5096 vm_pindex_t *pindex, /* OUT */
5097 vm_prot_t *out_prot, /* OUT */
5098 boolean_t *wired) /* OUT */
5100 vm_map_entry_t entry;
5101 vm_map_t map = *var_map;
5103 vm_prot_t fault_type = fault_typea;
5106 * Lookup the faulting address.
5108 if (!vm_map_lookup_entry(map, vaddr, out_entry))
5109 return (KERN_INVALID_ADDRESS);
5114 * Fail if the entry refers to a submap.
5116 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
5117 return (KERN_FAILURE);
5120 * Check whether this task is allowed to have this page.
5122 prot = entry->protection;
5123 fault_type &= VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE;
5124 if ((fault_type & prot) != fault_type)
5125 return (KERN_PROTECTION_FAILURE);
5128 * If this page is not pageable, we have to get it for all possible
5131 *wired = (entry->wired_count != 0);
5133 fault_type = entry->protection;
5135 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) {
5137 * Fail if the entry was copy-on-write for a write fault.
5139 if (fault_type & VM_PROT_WRITE)
5140 return (KERN_FAILURE);
5142 * We're attempting to read a copy-on-write page --
5143 * don't allow writes.
5145 prot &= ~VM_PROT_WRITE;
5149 * Fail if an object should be created.
5151 if (entry->object.vm_object == NULL && !map->system_map)
5152 return (KERN_FAILURE);
5155 * Return the object/offset from this entry. If the entry was
5156 * copy-on-write or empty, it has been fixed up.
5158 *pindex = OFF_TO_IDX((vaddr - entry->start) + entry->offset);
5159 *object = entry->object.vm_object;
5162 return (KERN_SUCCESS);
5166 * vm_map_lookup_done:
5168 * Releases locks acquired by a vm_map_lookup
5169 * (according to the handle returned by that lookup).
5172 vm_map_lookup_done(vm_map_t map, vm_map_entry_t entry)
5175 * Unlock the main-level map
5177 vm_map_unlock_read(map);
5181 vm_map_max_KBI(const struct vm_map *map)
5184 return (vm_map_max(map));
5188 vm_map_min_KBI(const struct vm_map *map)
5191 return (vm_map_min(map));
5195 vm_map_pmap_KBI(vm_map_t map)
5202 vm_map_range_valid_KBI(vm_map_t map, vm_offset_t start, vm_offset_t end)
5205 return (vm_map_range_valid(map, start, end));
5210 _vm_map_assert_consistent(vm_map_t map, int check)
5212 vm_map_entry_t entry, prev;
5213 vm_map_entry_t cur, header, lbound, ubound;
5214 vm_size_t max_left, max_right;
5219 if (enable_vmmap_check != check)
5222 header = prev = &map->header;
5223 VM_MAP_ENTRY_FOREACH(entry, map) {
5224 KASSERT(prev->end <= entry->start,
5225 ("map %p prev->end = %jx, start = %jx", map,
5226 (uintmax_t)prev->end, (uintmax_t)entry->start));
5227 KASSERT(entry->start < entry->end,
5228 ("map %p start = %jx, end = %jx", map,
5229 (uintmax_t)entry->start, (uintmax_t)entry->end));
5230 KASSERT(entry->left == header ||
5231 entry->left->start < entry->start,
5232 ("map %p left->start = %jx, start = %jx", map,
5233 (uintmax_t)entry->left->start, (uintmax_t)entry->start));
5234 KASSERT(entry->right == header ||
5235 entry->start < entry->right->start,
5236 ("map %p start = %jx, right->start = %jx", map,
5237 (uintmax_t)entry->start, (uintmax_t)entry->right->start));
5239 lbound = ubound = header;
5241 if (entry->start < cur->start) {
5244 KASSERT(cur != lbound,
5245 ("map %p cannot find %jx",
5246 map, (uintmax_t)entry->start));
5247 } else if (cur->end <= entry->start) {
5250 KASSERT(cur != ubound,
5251 ("map %p cannot find %jx",
5252 map, (uintmax_t)entry->start));
5254 KASSERT(cur == entry,
5255 ("map %p cannot find %jx",
5256 map, (uintmax_t)entry->start));
5260 max_left = vm_map_entry_max_free_left(entry, lbound);
5261 max_right = vm_map_entry_max_free_right(entry, ubound);
5262 KASSERT(entry->max_free == vm_size_max(max_left, max_right),
5263 ("map %p max = %jx, max_left = %jx, max_right = %jx", map,
5264 (uintmax_t)entry->max_free,
5265 (uintmax_t)max_left, (uintmax_t)max_right));
5268 KASSERT(prev->end <= entry->start,
5269 ("map %p prev->end = %jx, start = %jx", map,
5270 (uintmax_t)prev->end, (uintmax_t)entry->start));
5274 #include "opt_ddb.h"
5276 #include <sys/kernel.h>
5278 #include <ddb/ddb.h>
5281 vm_map_print(vm_map_t map)
5283 vm_map_entry_t entry, prev;
5285 db_iprintf("Task map %p: pmap=%p, nentries=%d, version=%u\n",
5287 (void *)map->pmap, map->nentries, map->timestamp);
5290 prev = &map->header;
5291 VM_MAP_ENTRY_FOREACH(entry, map) {
5292 db_iprintf("map entry %p: start=%p, end=%p, eflags=%#x, \n",
5293 (void *)entry, (void *)entry->start, (void *)entry->end,
5296 static const char * const inheritance_name[4] =
5297 {"share", "copy", "none", "donate_copy"};
5299 db_iprintf(" prot=%x/%x/%s",
5301 entry->max_protection,
5302 inheritance_name[(int)(unsigned char)
5303 entry->inheritance]);
5304 if (entry->wired_count != 0)
5305 db_printf(", wired");
5307 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
5308 db_printf(", share=%p, offset=0x%jx\n",
5309 (void *)entry->object.sub_map,
5310 (uintmax_t)entry->offset);
5311 if (prev == &map->header ||
5312 prev->object.sub_map !=
5313 entry->object.sub_map) {
5315 vm_map_print((vm_map_t)entry->object.sub_map);
5319 if (entry->cred != NULL)
5320 db_printf(", ruid %d", entry->cred->cr_ruid);
5321 db_printf(", object=%p, offset=0x%jx",
5322 (void *)entry->object.vm_object,
5323 (uintmax_t)entry->offset);
5324 if (entry->object.vm_object && entry->object.vm_object->cred)
5325 db_printf(", obj ruid %d charge %jx",
5326 entry->object.vm_object->cred->cr_ruid,
5327 (uintmax_t)entry->object.vm_object->charge);
5328 if (entry->eflags & MAP_ENTRY_COW)
5329 db_printf(", copy (%s)",
5330 (entry->eflags & MAP_ENTRY_NEEDS_COPY) ? "needed" : "done");
5333 if (prev == &map->header ||
5334 prev->object.vm_object !=
5335 entry->object.vm_object) {
5337 vm_object_print((db_expr_t)(intptr_t)
5338 entry->object.vm_object,
5348 DB_SHOW_COMMAND(map, map)
5352 db_printf("usage: show map <addr>\n");
5355 vm_map_print((vm_map_t)addr);
5358 DB_SHOW_COMMAND(procvm, procvm)
5363 p = db_lookup_proc(addr);
5368 db_printf("p = %p, vmspace = %p, map = %p, pmap = %p\n",
5369 (void *)p, (void *)p->p_vmspace, (void *)&p->p_vmspace->vm_map,
5370 (void *)vmspace_pmap(p->p_vmspace));
5372 vm_map_print((vm_map_t)&p->p_vmspace->vm_map);