2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * The Mach Operating System project at Carnegie-Mellon University.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * from: @(#)vm_map.c 8.3 (Berkeley) 1/12/94
35 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
36 * All rights reserved.
38 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
40 * Permission to use, copy, modify and distribute this software and
41 * its documentation is hereby granted, provided that both the copyright
42 * notice and this permission notice appear in all copies of the
43 * software, derivative works or modified versions, and any portions
44 * thereof, and that both notices appear in supporting documentation.
46 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
47 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
48 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
50 * Carnegie Mellon requests users of this software to return to
52 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
53 * School of Computer Science
54 * Carnegie Mellon University
55 * Pittsburgh PA 15213-3890
57 * any improvements or extensions that they make and grant Carnegie the
58 * rights to redistribute these changes.
62 * Virtual memory mapping module.
65 #include <sys/cdefs.h>
66 __FBSDID("$FreeBSD$");
68 #include <sys/param.h>
69 #include <sys/systm.h>
70 #include <sys/kernel.h>
73 #include <sys/mutex.h>
75 #include <sys/vmmeter.h>
77 #include <sys/vnode.h>
78 #include <sys/racct.h>
79 #include <sys/resourcevar.h>
81 #include <sys/sysctl.h>
82 #include <sys/sysent.h>
86 #include <vm/vm_param.h>
88 #include <vm/vm_map.h>
89 #include <vm/vm_page.h>
90 #include <vm/vm_object.h>
91 #include <vm/vm_pager.h>
92 #include <vm/vm_kern.h>
93 #include <vm/vm_extern.h>
94 #include <vm/vnode_pager.h>
95 #include <vm/swap_pager.h>
99 * Virtual memory maps provide for the mapping, protection,
100 * and sharing of virtual memory objects. In addition,
101 * this module provides for an efficient virtual copy of
102 * memory from one map to another.
104 * Synchronization is required prior to most operations.
106 * Maps consist of an ordered doubly-linked list of simple
107 * entries; a self-adjusting binary search tree of these
108 * entries is used to speed up lookups.
110 * Since portions of maps are specified by start/end addresses,
111 * which may not align with existing map entries, all
112 * routines merely "clip" entries to these start/end values.
113 * [That is, an entry is split into two, bordering at a
114 * start or end value.] Note that these clippings may not
115 * always be necessary (as the two resulting entries are then
116 * not changed); however, the clipping is done for convenience.
118 * As mentioned above, virtual copy operations are performed
119 * by copying VM object references from one map to
120 * another, and then marking both regions as copy-on-write.
123 static struct mtx map_sleep_mtx;
124 static uma_zone_t mapentzone;
125 static uma_zone_t kmapentzone;
126 static uma_zone_t mapzone;
127 static uma_zone_t vmspace_zone;
128 static struct vm_object kmapentobj;
129 static int vmspace_zinit(void *mem, int size, int flags);
130 static void vmspace_zfini(void *mem, int size);
131 static int vm_map_zinit(void *mem, int ize, int flags);
132 static void vm_map_zfini(void *mem, int size);
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);
138 static void vm_map_zdtor(void *mem, int size, void *arg);
139 static void vmspace_zdtor(void *mem, int size, void *arg);
142 #define ENTRY_CHARGED(e) ((e)->cred != NULL || \
143 ((e)->object.vm_object != NULL && (e)->object.vm_object->cred != NULL && \
144 !((e)->eflags & MAP_ENTRY_NEEDS_COPY)))
147 * PROC_VMSPACE_{UN,}LOCK() can be a noop as long as vmspaces are type
150 #define PROC_VMSPACE_LOCK(p) do { } while (0)
151 #define PROC_VMSPACE_UNLOCK(p) do { } while (0)
154 * VM_MAP_RANGE_CHECK: [ internal use only ]
156 * Asserts that the starting and ending region
157 * addresses fall within the valid range of the map.
159 #define VM_MAP_RANGE_CHECK(map, start, end) \
161 if (start < vm_map_min(map)) \
162 start = vm_map_min(map); \
163 if (end > vm_map_max(map)) \
164 end = vm_map_max(map); \
172 * Initialize the vm_map module. Must be called before
173 * any other vm_map routines.
175 * Map and entry structures are allocated from the general
176 * purpose memory pool with some exceptions:
178 * - The kernel map and kmem submap are allocated statically.
179 * - Kernel map entries are allocated out of a static pool.
181 * These restrictions are necessary since malloc() uses the
182 * maps and requires map entries.
188 mtx_init(&map_sleep_mtx, "vm map sleep mutex", NULL, MTX_DEF);
189 mapzone = uma_zcreate("MAP", sizeof(struct vm_map), NULL,
195 vm_map_zinit, vm_map_zfini, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
196 uma_prealloc(mapzone, MAX_KMAP);
197 kmapentzone = uma_zcreate("KMAP ENTRY", sizeof(struct vm_map_entry),
198 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
199 UMA_ZONE_MTXCLASS | UMA_ZONE_VM);
200 uma_prealloc(kmapentzone, MAX_KMAPENT);
201 mapentzone = uma_zcreate("MAP ENTRY", sizeof(struct vm_map_entry),
202 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
206 vmspace_zfini(void *mem, int size)
210 vm = (struct vmspace *)mem;
211 vm_map_zfini(&vm->vm_map, sizeof(vm->vm_map));
215 vmspace_zinit(void *mem, int size, int flags)
219 vm = (struct vmspace *)mem;
221 vm->vm_map.pmap = NULL;
222 (void)vm_map_zinit(&vm->vm_map, sizeof(vm->vm_map), flags);
227 vm_map_zfini(void *mem, int size)
232 mtx_destroy(&map->system_mtx);
233 sx_destroy(&map->lock);
237 vm_map_zinit(void *mem, int size, int flags)
244 mtx_init(&map->system_mtx, "vm map (system)", NULL, MTX_DEF | MTX_DUPOK);
245 sx_init(&map->lock, "vm map (user)");
251 vmspace_zdtor(void *mem, int size, void *arg)
255 vm = (struct vmspace *)mem;
257 vm_map_zdtor(&vm->vm_map, sizeof(vm->vm_map), arg);
260 vm_map_zdtor(void *mem, int size, void *arg)
265 KASSERT(map->nentries == 0,
266 ("map %p nentries == %d on free.",
267 map, map->nentries));
268 KASSERT(map->size == 0,
269 ("map %p size == %lu on free.",
270 map, (unsigned long)map->size));
272 #endif /* INVARIANTS */
275 * Allocate a vmspace structure, including a vm_map and pmap,
276 * and initialize those structures. The refcnt is set to 1.
279 vmspace_alloc(min, max)
280 vm_offset_t min, max;
284 vm = uma_zalloc(vmspace_zone, M_WAITOK);
285 if (vm->vm_map.pmap == NULL && !pmap_pinit(vmspace_pmap(vm))) {
286 uma_zfree(vmspace_zone, vm);
289 CTR1(KTR_VM, "vmspace_alloc: %p", vm);
290 _vm_map_init(&vm->vm_map, vmspace_pmap(vm), min, max);
306 uma_zone_set_obj(kmapentzone, &kmapentobj, lmin(cnt.v_page_count,
307 (VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) / PAGE_SIZE) / 8 +
308 maxproc * 2 + maxfiles);
309 vmspace_zone = uma_zcreate("VMSPACE", sizeof(struct vmspace), NULL,
315 vmspace_zinit, vmspace_zfini, UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
319 vmspace_container_reset(struct proc *p)
324 racct_set(p, RACCT_DATA, 0);
325 racct_set(p, RACCT_STACK, 0);
326 racct_set(p, RACCT_RSS, 0);
327 racct_set(p, RACCT_MEMLOCK, 0);
328 racct_set(p, RACCT_VMEM, 0);
334 vmspace_dofree(struct vmspace *vm)
337 CTR1(KTR_VM, "vmspace_free: %p", vm);
340 * Make sure any SysV shm is freed, it might not have been in
346 * Lock the map, to wait out all other references to it.
347 * Delete all of the mappings and pages they hold, then call
348 * the pmap module to reclaim anything left.
350 (void)vm_map_remove(&vm->vm_map, vm->vm_map.min_offset,
351 vm->vm_map.max_offset);
353 pmap_release(vmspace_pmap(vm));
354 vm->vm_map.pmap = NULL;
355 uma_zfree(vmspace_zone, vm);
359 vmspace_free(struct vmspace *vm)
362 if (vm->vm_refcnt == 0)
363 panic("vmspace_free: attempt to free already freed vmspace");
365 if (atomic_fetchadd_int(&vm->vm_refcnt, -1) == 1)
370 vmspace_exitfree(struct proc *p)
374 PROC_VMSPACE_LOCK(p);
377 PROC_VMSPACE_UNLOCK(p);
378 KASSERT(vm == &vmspace0, ("vmspace_exitfree: wrong vmspace"));
383 vmspace_exit(struct thread *td)
390 * Release user portion of address space.
391 * This releases references to vnodes,
392 * which could cause I/O if the file has been unlinked.
393 * Need to do this early enough that we can still sleep.
395 * The last exiting process to reach this point releases as
396 * much of the environment as it can. vmspace_dofree() is the
397 * slower fallback in case another process had a temporary
398 * reference to the vmspace.
403 atomic_add_int(&vmspace0.vm_refcnt, 1);
405 refcnt = vm->vm_refcnt;
406 if (refcnt > 1 && p->p_vmspace != &vmspace0) {
407 /* Switch now since other proc might free vmspace */
408 PROC_VMSPACE_LOCK(p);
409 p->p_vmspace = &vmspace0;
410 PROC_VMSPACE_UNLOCK(p);
413 } while (!atomic_cmpset_int(&vm->vm_refcnt, refcnt, refcnt - 1));
415 if (p->p_vmspace != vm) {
416 /* vmspace not yet freed, switch back */
417 PROC_VMSPACE_LOCK(p);
419 PROC_VMSPACE_UNLOCK(p);
422 pmap_remove_pages(vmspace_pmap(vm));
423 /* Switch now since this proc will free vmspace */
424 PROC_VMSPACE_LOCK(p);
425 p->p_vmspace = &vmspace0;
426 PROC_VMSPACE_UNLOCK(p);
430 vmspace_container_reset(p);
433 /* Acquire reference to vmspace owned by another process. */
436 vmspace_acquire_ref(struct proc *p)
441 PROC_VMSPACE_LOCK(p);
444 PROC_VMSPACE_UNLOCK(p);
448 refcnt = vm->vm_refcnt;
449 if (refcnt <= 0) { /* Avoid 0->1 transition */
450 PROC_VMSPACE_UNLOCK(p);
453 } while (!atomic_cmpset_int(&vm->vm_refcnt, refcnt, refcnt + 1));
454 if (vm != p->p_vmspace) {
455 PROC_VMSPACE_UNLOCK(p);
459 PROC_VMSPACE_UNLOCK(p);
464 _vm_map_lock(vm_map_t map, const char *file, int line)
468 mtx_lock_flags_(&map->system_mtx, 0, file, line);
470 sx_xlock_(&map->lock, file, line);
475 vm_map_process_deferred(void)
478 vm_map_entry_t entry, next;
482 entry = td->td_map_def_user;
483 td->td_map_def_user = NULL;
484 while (entry != NULL) {
486 if ((entry->eflags & MAP_ENTRY_VN_WRITECNT) != 0) {
488 * Decrement the object's writemappings and
489 * possibly the vnode's v_writecount.
491 KASSERT((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0,
492 ("Submap with writecount"));
493 object = entry->object.vm_object;
494 KASSERT(object != NULL, ("No object for writecount"));
495 vnode_pager_release_writecount(object, entry->start,
498 vm_map_entry_deallocate(entry, FALSE);
504 _vm_map_unlock(vm_map_t map, const char *file, int line)
508 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
510 sx_xunlock_(&map->lock, file, line);
511 vm_map_process_deferred();
516 _vm_map_lock_read(vm_map_t map, const char *file, int line)
520 mtx_lock_flags_(&map->system_mtx, 0, file, line);
522 sx_slock_(&map->lock, file, line);
526 _vm_map_unlock_read(vm_map_t map, const char *file, int line)
530 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
532 sx_sunlock_(&map->lock, file, line);
533 vm_map_process_deferred();
538 _vm_map_trylock(vm_map_t map, const char *file, int line)
542 error = map->system_map ?
543 !mtx_trylock_flags_(&map->system_mtx, 0, file, line) :
544 !sx_try_xlock_(&map->lock, file, line);
551 _vm_map_trylock_read(vm_map_t map, const char *file, int line)
555 error = map->system_map ?
556 !mtx_trylock_flags_(&map->system_mtx, 0, file, line) :
557 !sx_try_slock_(&map->lock, file, line);
562 * _vm_map_lock_upgrade: [ internal use only ]
564 * Tries to upgrade a read (shared) lock on the specified map to a write
565 * (exclusive) lock. Returns the value "0" if the upgrade succeeds and a
566 * non-zero value if the upgrade fails. If the upgrade fails, the map is
567 * returned without a read or write lock held.
569 * Requires that the map be read locked.
572 _vm_map_lock_upgrade(vm_map_t map, const char *file, int line)
574 unsigned int last_timestamp;
576 if (map->system_map) {
577 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
579 if (!sx_try_upgrade_(&map->lock, file, line)) {
580 last_timestamp = map->timestamp;
581 sx_sunlock_(&map->lock, file, line);
582 vm_map_process_deferred();
584 * If the map's timestamp does not change while the
585 * map is unlocked, then the upgrade succeeds.
587 sx_xlock_(&map->lock, file, line);
588 if (last_timestamp != map->timestamp) {
589 sx_xunlock_(&map->lock, file, line);
599 _vm_map_lock_downgrade(vm_map_t map, const char *file, int line)
602 if (map->system_map) {
603 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
605 sx_downgrade_(&map->lock, file, line);
611 * Returns a non-zero value if the caller holds a write (exclusive) lock
612 * on the specified map and the value "0" otherwise.
615 vm_map_locked(vm_map_t map)
619 return (mtx_owned(&map->system_mtx));
621 return (sx_xlocked(&map->lock));
626 _vm_map_assert_locked(vm_map_t map, const char *file, int line)
630 mtx_assert_(&map->system_mtx, MA_OWNED, file, line);
632 sx_assert_(&map->lock, SA_XLOCKED, file, line);
635 #define VM_MAP_ASSERT_LOCKED(map) \
636 _vm_map_assert_locked(map, LOCK_FILE, LOCK_LINE)
638 #define VM_MAP_ASSERT_LOCKED(map)
642 * _vm_map_unlock_and_wait:
644 * Atomically releases the lock on the specified map and puts the calling
645 * thread to sleep. The calling thread will remain asleep until either
646 * vm_map_wakeup() is performed on the map or the specified timeout is
649 * WARNING! This function does not perform deferred deallocations of
650 * objects and map entries. Therefore, the calling thread is expected to
651 * reacquire the map lock after reawakening and later perform an ordinary
652 * unlock operation, such as vm_map_unlock(), before completing its
653 * operation on the map.
656 _vm_map_unlock_and_wait(vm_map_t map, int timo, const char *file, int line)
659 mtx_lock(&map_sleep_mtx);
661 mtx_unlock_flags_(&map->system_mtx, 0, file, line);
663 sx_xunlock_(&map->lock, file, line);
664 return (msleep(&map->root, &map_sleep_mtx, PDROP | PVM, "vmmaps",
671 * Awaken any threads that have slept on the map using
672 * vm_map_unlock_and_wait().
675 vm_map_wakeup(vm_map_t map)
679 * Acquire and release map_sleep_mtx to prevent a wakeup()
680 * from being performed (and lost) between the map unlock
681 * and the msleep() in _vm_map_unlock_and_wait().
683 mtx_lock(&map_sleep_mtx);
684 mtx_unlock(&map_sleep_mtx);
689 vm_map_busy(vm_map_t map)
692 VM_MAP_ASSERT_LOCKED(map);
697 vm_map_unbusy(vm_map_t map)
700 VM_MAP_ASSERT_LOCKED(map);
701 KASSERT(map->busy, ("vm_map_unbusy: not busy"));
702 if (--map->busy == 0 && (map->flags & MAP_BUSY_WAKEUP)) {
703 vm_map_modflags(map, 0, MAP_BUSY_WAKEUP);
709 vm_map_wait_busy(vm_map_t map)
712 VM_MAP_ASSERT_LOCKED(map);
714 vm_map_modflags(map, MAP_BUSY_WAKEUP, 0);
716 msleep(&map->busy, &map->system_mtx, 0, "mbusy", 0);
718 sx_sleep(&map->busy, &map->lock, 0, "mbusy", 0);
724 vmspace_resident_count(struct vmspace *vmspace)
726 return pmap_resident_count(vmspace_pmap(vmspace));
732 * Creates and returns a new empty VM map with
733 * the given physical map structure, and having
734 * the given lower and upper address bounds.
737 vm_map_create(pmap_t pmap, vm_offset_t min, vm_offset_t max)
741 result = uma_zalloc(mapzone, M_WAITOK);
742 CTR1(KTR_VM, "vm_map_create: %p", result);
743 _vm_map_init(result, pmap, min, max);
748 * Initialize an existing vm_map structure
749 * such as that in the vmspace structure.
752 _vm_map_init(vm_map_t map, pmap_t pmap, vm_offset_t min, vm_offset_t max)
755 map->header.next = map->header.prev = &map->header;
756 map->needs_wakeup = FALSE;
759 map->min_offset = min;
760 map->max_offset = max;
768 vm_map_init(vm_map_t map, pmap_t pmap, vm_offset_t min, vm_offset_t max)
771 _vm_map_init(map, pmap, min, max);
772 mtx_init(&map->system_mtx, "system map", NULL, MTX_DEF | MTX_DUPOK);
773 sx_init(&map->lock, "user map");
777 * vm_map_entry_dispose: [ internal use only ]
779 * Inverse of vm_map_entry_create.
782 vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry)
784 uma_zfree(map->system_map ? kmapentzone : mapentzone, entry);
788 * vm_map_entry_create: [ internal use only ]
790 * Allocates a VM map entry for insertion.
791 * No entry fields are filled in.
793 static vm_map_entry_t
794 vm_map_entry_create(vm_map_t map)
796 vm_map_entry_t new_entry;
799 new_entry = uma_zalloc(kmapentzone, M_NOWAIT);
801 new_entry = uma_zalloc(mapentzone, M_WAITOK);
802 if (new_entry == NULL)
803 panic("vm_map_entry_create: kernel resources exhausted");
808 * vm_map_entry_set_behavior:
810 * Set the expected access behavior, either normal, random, or
814 vm_map_entry_set_behavior(vm_map_entry_t entry, u_char behavior)
816 entry->eflags = (entry->eflags & ~MAP_ENTRY_BEHAV_MASK) |
817 (behavior & MAP_ENTRY_BEHAV_MASK);
821 * vm_map_entry_set_max_free:
823 * Set the max_free field in a vm_map_entry.
826 vm_map_entry_set_max_free(vm_map_entry_t entry)
829 entry->max_free = entry->adj_free;
830 if (entry->left != NULL && entry->left->max_free > entry->max_free)
831 entry->max_free = entry->left->max_free;
832 if (entry->right != NULL && entry->right->max_free > entry->max_free)
833 entry->max_free = entry->right->max_free;
837 * vm_map_entry_splay:
839 * The Sleator and Tarjan top-down splay algorithm with the
840 * following variation. Max_free must be computed bottom-up, so
841 * on the downward pass, maintain the left and right spines in
842 * reverse order. Then, make a second pass up each side to fix
843 * the pointers and compute max_free. The time bound is O(log n)
846 * The new root is the vm_map_entry containing "addr", or else an
847 * adjacent entry (lower or higher) if addr is not in the tree.
849 * The map must be locked, and leaves it so.
851 * Returns: the new root.
853 static vm_map_entry_t
854 vm_map_entry_splay(vm_offset_t addr, vm_map_entry_t root)
856 vm_map_entry_t llist, rlist;
857 vm_map_entry_t ltree, rtree;
860 /* Special case of empty tree. */
865 * Pass One: Splay down the tree until we find addr or a NULL
866 * pointer where addr would go. llist and rlist are the two
867 * sides in reverse order (bottom-up), with llist linked by
868 * the right pointer and rlist linked by the left pointer in
869 * the vm_map_entry. Wait until Pass Two to set max_free on
875 /* root is never NULL in here. */
876 if (addr < root->start) {
880 if (addr < y->start && y->left != NULL) {
881 /* Rotate right and put y on rlist. */
882 root->left = y->right;
884 vm_map_entry_set_max_free(root);
889 /* Put root on rlist. */
894 } else if (addr >= root->end) {
898 if (addr >= y->end && y->right != NULL) {
899 /* Rotate left and put y on llist. */
900 root->right = y->left;
902 vm_map_entry_set_max_free(root);
907 /* Put root on llist. */
917 * Pass Two: Walk back up the two spines, flip the pointers
918 * and set max_free. The subtrees of the root go at the
919 * bottom of llist and rlist.
922 while (llist != NULL) {
924 llist->right = ltree;
925 vm_map_entry_set_max_free(llist);
930 while (rlist != NULL) {
933 vm_map_entry_set_max_free(rlist);
939 * Final assembly: add ltree and rtree as subtrees of root.
943 vm_map_entry_set_max_free(root);
949 * vm_map_entry_{un,}link:
951 * Insert/remove entries from maps.
954 vm_map_entry_link(vm_map_t map,
955 vm_map_entry_t after_where,
956 vm_map_entry_t entry)
960 "vm_map_entry_link: map %p, nentries %d, entry %p, after %p", map,
961 map->nentries, entry, after_where);
962 VM_MAP_ASSERT_LOCKED(map);
964 entry->prev = after_where;
965 entry->next = after_where->next;
966 entry->next->prev = entry;
967 after_where->next = entry;
969 if (after_where != &map->header) {
970 if (after_where != map->root)
971 vm_map_entry_splay(after_where->start, map->root);
972 entry->right = after_where->right;
973 entry->left = after_where;
974 after_where->right = NULL;
975 after_where->adj_free = entry->start - after_where->end;
976 vm_map_entry_set_max_free(after_where);
978 entry->right = map->root;
981 entry->adj_free = (entry->next == &map->header ? map->max_offset :
982 entry->next->start) - entry->end;
983 vm_map_entry_set_max_free(entry);
988 vm_map_entry_unlink(vm_map_t map,
989 vm_map_entry_t entry)
991 vm_map_entry_t next, prev, root;
993 VM_MAP_ASSERT_LOCKED(map);
994 if (entry != map->root)
995 vm_map_entry_splay(entry->start, map->root);
996 if (entry->left == NULL)
999 root = vm_map_entry_splay(entry->start, entry->left);
1000 root->right = entry->right;
1001 root->adj_free = (entry->next == &map->header ? map->max_offset :
1002 entry->next->start) - root->end;
1003 vm_map_entry_set_max_free(root);
1012 CTR3(KTR_VM, "vm_map_entry_unlink: map %p, nentries %d, entry %p", map,
1013 map->nentries, entry);
1017 * vm_map_entry_resize_free:
1019 * Recompute the amount of free space following a vm_map_entry
1020 * and propagate that value up the tree. Call this function after
1021 * resizing a map entry in-place, that is, without a call to
1022 * vm_map_entry_link() or _unlink().
1024 * The map must be locked, and leaves it so.
1027 vm_map_entry_resize_free(vm_map_t map, vm_map_entry_t entry)
1031 * Using splay trees without parent pointers, propagating
1032 * max_free up the tree is done by moving the entry to the
1033 * root and making the change there.
1035 if (entry != map->root)
1036 map->root = vm_map_entry_splay(entry->start, map->root);
1038 entry->adj_free = (entry->next == &map->header ? map->max_offset :
1039 entry->next->start) - entry->end;
1040 vm_map_entry_set_max_free(entry);
1044 * vm_map_lookup_entry: [ internal use only ]
1046 * Finds the map entry containing (or
1047 * immediately preceding) the specified address
1048 * in the given map; the entry is returned
1049 * in the "entry" parameter. The boolean
1050 * result indicates whether the address is
1051 * actually contained in the map.
1054 vm_map_lookup_entry(
1056 vm_offset_t address,
1057 vm_map_entry_t *entry) /* OUT */
1063 * If the map is empty, then the map entry immediately preceding
1064 * "address" is the map's header.
1068 *entry = &map->header;
1069 else if (address >= cur->start && cur->end > address) {
1072 } else if ((locked = vm_map_locked(map)) ||
1073 sx_try_upgrade(&map->lock)) {
1075 * Splay requires a write lock on the map. However, it only
1076 * restructures the binary search tree; it does not otherwise
1077 * change the map. Thus, the map's timestamp need not change
1078 * on a temporary upgrade.
1080 map->root = cur = vm_map_entry_splay(address, cur);
1082 sx_downgrade(&map->lock);
1085 * If "address" is contained within a map entry, the new root
1086 * is that map entry. Otherwise, the new root is a map entry
1087 * immediately before or after "address".
1089 if (address >= cur->start) {
1091 if (cur->end > address)
1097 * Since the map is only locked for read access, perform a
1098 * standard binary search tree lookup for "address".
1101 if (address < cur->start) {
1102 if (cur->left == NULL) {
1107 } else if (cur->end > address) {
1111 if (cur->right == NULL) {
1124 * Inserts the given whole VM object into the target
1125 * map at the specified address range. The object's
1126 * size should match that of the address range.
1128 * Requires that the map be locked, and leaves it so.
1130 * If object is non-NULL, ref count must be bumped by caller
1131 * prior to making call to account for the new entry.
1134 vm_map_insert(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
1135 vm_offset_t start, vm_offset_t end, vm_prot_t prot, vm_prot_t max,
1138 vm_map_entry_t new_entry;
1139 vm_map_entry_t prev_entry;
1140 vm_map_entry_t temp_entry;
1141 vm_eflags_t protoeflags;
1143 vm_inherit_t inheritance;
1144 boolean_t charge_prev_obj;
1146 VM_MAP_ASSERT_LOCKED(map);
1149 * Check that the start and end points are not bogus.
1151 if ((start < map->min_offset) || (end > map->max_offset) ||
1153 return (KERN_INVALID_ADDRESS);
1156 * Find the entry prior to the proposed starting address; if it's part
1157 * of an existing entry, this range is bogus.
1159 if (vm_map_lookup_entry(map, start, &temp_entry))
1160 return (KERN_NO_SPACE);
1162 prev_entry = temp_entry;
1165 * Assert that the next entry doesn't overlap the end point.
1167 if ((prev_entry->next != &map->header) &&
1168 (prev_entry->next->start < end))
1169 return (KERN_NO_SPACE);
1172 charge_prev_obj = FALSE;
1174 if (cow & MAP_COPY_ON_WRITE)
1175 protoeflags |= MAP_ENTRY_COW|MAP_ENTRY_NEEDS_COPY;
1177 if (cow & MAP_NOFAULT) {
1178 protoeflags |= MAP_ENTRY_NOFAULT;
1180 KASSERT(object == NULL,
1181 ("vm_map_insert: paradoxical MAP_NOFAULT request"));
1183 if (cow & MAP_DISABLE_SYNCER)
1184 protoeflags |= MAP_ENTRY_NOSYNC;
1185 if (cow & MAP_DISABLE_COREDUMP)
1186 protoeflags |= MAP_ENTRY_NOCOREDUMP;
1187 if (cow & MAP_VN_WRITECOUNT)
1188 protoeflags |= MAP_ENTRY_VN_WRITECNT;
1189 if (cow & MAP_INHERIT_SHARE)
1190 inheritance = VM_INHERIT_SHARE;
1192 inheritance = VM_INHERIT_DEFAULT;
1195 KASSERT((object != kmem_object && object != kernel_object) ||
1196 ((object == kmem_object || object == kernel_object) &&
1197 !(protoeflags & MAP_ENTRY_NEEDS_COPY)),
1198 ("kmem or kernel object and cow"));
1199 if (cow & (MAP_ACC_NO_CHARGE | MAP_NOFAULT))
1201 if ((cow & MAP_ACC_CHARGED) || ((prot & VM_PROT_WRITE) &&
1202 ((protoeflags & MAP_ENTRY_NEEDS_COPY) || object == NULL))) {
1203 if (!(cow & MAP_ACC_CHARGED) && !swap_reserve(end - start))
1204 return (KERN_RESOURCE_SHORTAGE);
1205 KASSERT(object == NULL || (protoeflags & MAP_ENTRY_NEEDS_COPY) ||
1206 object->cred == NULL,
1207 ("OVERCOMMIT: vm_map_insert o %p", object));
1208 cred = curthread->td_ucred;
1210 if (object == NULL && !(protoeflags & MAP_ENTRY_NEEDS_COPY))
1211 charge_prev_obj = TRUE;
1215 /* Expand the kernel pmap, if necessary. */
1216 if (map == kernel_map && end > kernel_vm_end)
1217 pmap_growkernel(end);
1218 if (object != NULL) {
1220 * OBJ_ONEMAPPING must be cleared unless this mapping
1221 * is trivially proven to be the only mapping for any
1222 * of the object's pages. (Object granularity
1223 * reference counting is insufficient to recognize
1224 * aliases with precision.)
1226 VM_OBJECT_LOCK(object);
1227 if (object->ref_count > 1 || object->shadow_count != 0)
1228 vm_object_clear_flag(object, OBJ_ONEMAPPING);
1229 VM_OBJECT_UNLOCK(object);
1231 else if ((prev_entry != &map->header) &&
1232 (prev_entry->eflags == protoeflags) &&
1233 (prev_entry->end == start) &&
1234 (prev_entry->wired_count == 0) &&
1235 (prev_entry->cred == cred ||
1236 (prev_entry->object.vm_object != NULL &&
1237 (prev_entry->object.vm_object->cred == cred))) &&
1238 vm_object_coalesce(prev_entry->object.vm_object,
1240 (vm_size_t)(prev_entry->end - prev_entry->start),
1241 (vm_size_t)(end - prev_entry->end), charge_prev_obj)) {
1243 * We were able to extend the object. Determine if we
1244 * can extend the previous map entry to include the
1245 * new range as well.
1247 if ((prev_entry->inheritance == inheritance) &&
1248 (prev_entry->protection == prot) &&
1249 (prev_entry->max_protection == max)) {
1250 map->size += (end - prev_entry->end);
1251 prev_entry->end = end;
1252 vm_map_entry_resize_free(map, prev_entry);
1253 vm_map_simplify_entry(map, prev_entry);
1256 return (KERN_SUCCESS);
1260 * If we can extend the object but cannot extend the
1261 * map entry, we have to create a new map entry. We
1262 * must bump the ref count on the extended object to
1263 * account for it. object may be NULL.
1265 object = prev_entry->object.vm_object;
1266 offset = prev_entry->offset +
1267 (prev_entry->end - prev_entry->start);
1268 vm_object_reference(object);
1269 if (cred != NULL && object != NULL && object->cred != NULL &&
1270 !(prev_entry->eflags & MAP_ENTRY_NEEDS_COPY)) {
1271 /* Object already accounts for this uid. */
1278 * NOTE: if conditionals fail, object can be NULL here. This occurs
1279 * in things like the buffer map where we manage kva but do not manage
1284 * Create a new entry
1286 new_entry = vm_map_entry_create(map);
1287 new_entry->start = start;
1288 new_entry->end = end;
1289 new_entry->cred = NULL;
1291 new_entry->eflags = protoeflags;
1292 new_entry->object.vm_object = object;
1293 new_entry->offset = offset;
1294 new_entry->avail_ssize = 0;
1296 new_entry->inheritance = inheritance;
1297 new_entry->protection = prot;
1298 new_entry->max_protection = max;
1299 new_entry->wired_count = 0;
1300 new_entry->read_ahead = VM_FAULT_READ_AHEAD_INIT;
1301 new_entry->next_read = OFF_TO_IDX(offset);
1303 KASSERT(cred == NULL || !ENTRY_CHARGED(new_entry),
1304 ("OVERCOMMIT: vm_map_insert leaks vm_map %p", new_entry));
1305 new_entry->cred = cred;
1308 * Insert the new entry into the list
1310 vm_map_entry_link(map, prev_entry, new_entry);
1311 map->size += new_entry->end - new_entry->start;
1314 * It may be possible to merge the new entry with the next and/or
1315 * previous entries. However, due to MAP_STACK_* being a hack, a
1316 * panic can result from merging such entries.
1318 if ((cow & (MAP_STACK_GROWS_DOWN | MAP_STACK_GROWS_UP)) == 0)
1319 vm_map_simplify_entry(map, new_entry);
1321 if (cow & (MAP_PREFAULT|MAP_PREFAULT_PARTIAL)) {
1322 vm_map_pmap_enter(map, start, prot,
1323 object, OFF_TO_IDX(offset), end - start,
1324 cow & MAP_PREFAULT_PARTIAL);
1327 return (KERN_SUCCESS);
1333 * Find the first fit (lowest VM address) for "length" free bytes
1334 * beginning at address >= start in the given map.
1336 * In a vm_map_entry, "adj_free" is the amount of free space
1337 * adjacent (higher address) to this entry, and "max_free" is the
1338 * maximum amount of contiguous free space in its subtree. This
1339 * allows finding a free region in one path down the tree, so
1340 * O(log n) amortized with splay trees.
1342 * The map must be locked, and leaves it so.
1344 * Returns: 0 on success, and starting address in *addr,
1345 * 1 if insufficient space.
1348 vm_map_findspace(vm_map_t map, vm_offset_t start, vm_size_t length,
1349 vm_offset_t *addr) /* OUT */
1351 vm_map_entry_t entry;
1355 * Request must fit within min/max VM address and must avoid
1358 if (start < map->min_offset)
1359 start = map->min_offset;
1360 if (start + length > map->max_offset || start + length < start)
1363 /* Empty tree means wide open address space. */
1364 if (map->root == NULL) {
1370 * After splay, if start comes before root node, then there
1371 * must be a gap from start to the root.
1373 map->root = vm_map_entry_splay(start, map->root);
1374 if (start + length <= map->root->start) {
1380 * Root is the last node that might begin its gap before
1381 * start, and this is the last comparison where address
1382 * wrap might be a problem.
1384 st = (start > map->root->end) ? start : map->root->end;
1385 if (length <= map->root->end + map->root->adj_free - st) {
1390 /* With max_free, can immediately tell if no solution. */
1391 entry = map->root->right;
1392 if (entry == NULL || length > entry->max_free)
1396 * Search the right subtree in the order: left subtree, root,
1397 * right subtree (first fit). The previous splay implies that
1398 * all regions in the right subtree have addresses > start.
1400 while (entry != NULL) {
1401 if (entry->left != NULL && entry->left->max_free >= length)
1402 entry = entry->left;
1403 else if (entry->adj_free >= length) {
1407 entry = entry->right;
1410 /* Can't get here, so panic if we do. */
1411 panic("vm_map_findspace: max_free corrupt");
1415 vm_map_fixed(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
1416 vm_offset_t start, vm_size_t length, vm_prot_t prot,
1417 vm_prot_t max, int cow)
1422 end = start + length;
1424 VM_MAP_RANGE_CHECK(map, start, end);
1425 (void) vm_map_delete(map, start, end);
1426 result = vm_map_insert(map, object, offset, start, end, prot,
1433 * vm_map_find finds an unallocated region in the target address
1434 * map with the given length. The search is defined to be
1435 * first-fit from the specified address; the region found is
1436 * returned in the same parameter.
1438 * If object is non-NULL, ref count must be bumped by caller
1439 * prior to making call to account for the new entry.
1442 vm_map_find(vm_map_t map, vm_object_t object, vm_ooffset_t offset,
1443 vm_offset_t *addr, /* IN/OUT */
1444 vm_size_t length, int find_space, vm_prot_t prot,
1445 vm_prot_t max, int cow)
1447 vm_offset_t alignment, initial_addr, start;
1450 if (find_space == VMFS_OPTIMAL_SPACE && (object == NULL ||
1451 (object->flags & OBJ_COLORED) == 0))
1452 find_space = VMFS_ANY_SPACE;
1453 if (find_space >> 8 != 0) {
1454 KASSERT((find_space & 0xff) == 0, ("bad VMFS flags"));
1455 alignment = (vm_offset_t)1 << (find_space >> 8);
1458 initial_addr = *addr;
1460 start = initial_addr;
1463 if (find_space != VMFS_NO_SPACE) {
1464 if (vm_map_findspace(map, start, length, addr)) {
1466 if (find_space == VMFS_OPTIMAL_SPACE) {
1467 find_space = VMFS_ANY_SPACE;
1470 return (KERN_NO_SPACE);
1472 switch (find_space) {
1473 case VMFS_SUPER_SPACE:
1474 case VMFS_OPTIMAL_SPACE:
1475 pmap_align_superpage(object, offset, addr,
1478 #ifdef VMFS_TLB_ALIGNED_SPACE
1479 case VMFS_TLB_ALIGNED_SPACE:
1480 pmap_align_tlb(addr);
1483 case VMFS_ANY_SPACE:
1486 if ((*addr & (alignment - 1)) != 0) {
1487 *addr &= ~(alignment - 1);
1495 result = vm_map_insert(map, object, offset, start, start +
1496 length, prot, max, cow);
1497 } while (result == KERN_NO_SPACE && find_space != VMFS_NO_SPACE &&
1498 find_space != VMFS_ANY_SPACE);
1504 * vm_map_simplify_entry:
1506 * Simplify the given map entry by merging with either neighbor. This
1507 * routine also has the ability to merge with both neighbors.
1509 * The map must be locked.
1511 * This routine guarentees that the passed entry remains valid (though
1512 * possibly extended). When merging, this routine may delete one or
1516 vm_map_simplify_entry(vm_map_t map, vm_map_entry_t entry)
1518 vm_map_entry_t next, prev;
1519 vm_size_t prevsize, esize;
1521 if (entry->eflags & (MAP_ENTRY_IN_TRANSITION | MAP_ENTRY_IS_SUB_MAP))
1525 if (prev != &map->header) {
1526 prevsize = prev->end - prev->start;
1527 if ( (prev->end == entry->start) &&
1528 (prev->object.vm_object == entry->object.vm_object) &&
1529 (!prev->object.vm_object ||
1530 (prev->offset + prevsize == entry->offset)) &&
1531 (prev->eflags == entry->eflags) &&
1532 (prev->protection == entry->protection) &&
1533 (prev->max_protection == entry->max_protection) &&
1534 (prev->inheritance == entry->inheritance) &&
1535 (prev->wired_count == entry->wired_count) &&
1536 (prev->cred == entry->cred)) {
1537 vm_map_entry_unlink(map, prev);
1538 entry->start = prev->start;
1539 entry->offset = prev->offset;
1540 if (entry->prev != &map->header)
1541 vm_map_entry_resize_free(map, entry->prev);
1544 * If the backing object is a vnode object,
1545 * vm_object_deallocate() calls vrele().
1546 * However, vrele() does not lock the vnode
1547 * because the vnode has additional
1548 * references. Thus, the map lock can be kept
1549 * without causing a lock-order reversal with
1552 * Since we count the number of virtual page
1553 * mappings in object->un_pager.vnp.writemappings,
1554 * the writemappings value should not be adjusted
1555 * when the entry is disposed of.
1557 if (prev->object.vm_object)
1558 vm_object_deallocate(prev->object.vm_object);
1559 if (prev->cred != NULL)
1561 vm_map_entry_dispose(map, prev);
1566 if (next != &map->header) {
1567 esize = entry->end - entry->start;
1568 if ((entry->end == next->start) &&
1569 (next->object.vm_object == entry->object.vm_object) &&
1570 (!entry->object.vm_object ||
1571 (entry->offset + esize == next->offset)) &&
1572 (next->eflags == entry->eflags) &&
1573 (next->protection == entry->protection) &&
1574 (next->max_protection == entry->max_protection) &&
1575 (next->inheritance == entry->inheritance) &&
1576 (next->wired_count == entry->wired_count) &&
1577 (next->cred == entry->cred)) {
1578 vm_map_entry_unlink(map, next);
1579 entry->end = next->end;
1580 vm_map_entry_resize_free(map, entry);
1583 * See comment above.
1585 if (next->object.vm_object)
1586 vm_object_deallocate(next->object.vm_object);
1587 if (next->cred != NULL)
1589 vm_map_entry_dispose(map, next);
1594 * vm_map_clip_start: [ internal use only ]
1596 * Asserts that the given entry begins at or after
1597 * the specified address; if necessary,
1598 * it splits the entry into two.
1600 #define vm_map_clip_start(map, entry, startaddr) \
1602 if (startaddr > entry->start) \
1603 _vm_map_clip_start(map, entry, startaddr); \
1607 * This routine is called only when it is known that
1608 * the entry must be split.
1611 _vm_map_clip_start(vm_map_t map, vm_map_entry_t entry, vm_offset_t start)
1613 vm_map_entry_t new_entry;
1615 VM_MAP_ASSERT_LOCKED(map);
1618 * Split off the front portion -- note that we must insert the new
1619 * entry BEFORE this one, so that this entry has the specified
1622 vm_map_simplify_entry(map, entry);
1625 * If there is no object backing this entry, we might as well create
1626 * one now. If we defer it, an object can get created after the map
1627 * is clipped, and individual objects will be created for the split-up
1628 * map. This is a bit of a hack, but is also about the best place to
1629 * put this improvement.
1631 if (entry->object.vm_object == NULL && !map->system_map) {
1633 object = vm_object_allocate(OBJT_DEFAULT,
1634 atop(entry->end - entry->start));
1635 entry->object.vm_object = object;
1637 if (entry->cred != NULL) {
1638 object->cred = entry->cred;
1639 object->charge = entry->end - entry->start;
1642 } else if (entry->object.vm_object != NULL &&
1643 ((entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0) &&
1644 entry->cred != NULL) {
1645 VM_OBJECT_LOCK(entry->object.vm_object);
1646 KASSERT(entry->object.vm_object->cred == NULL,
1647 ("OVERCOMMIT: vm_entry_clip_start: both cred e %p", entry));
1648 entry->object.vm_object->cred = entry->cred;
1649 entry->object.vm_object->charge = entry->end - entry->start;
1650 VM_OBJECT_UNLOCK(entry->object.vm_object);
1654 new_entry = vm_map_entry_create(map);
1655 *new_entry = *entry;
1657 new_entry->end = start;
1658 entry->offset += (start - entry->start);
1659 entry->start = start;
1660 if (new_entry->cred != NULL)
1661 crhold(entry->cred);
1663 vm_map_entry_link(map, entry->prev, new_entry);
1665 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0) {
1666 vm_object_reference(new_entry->object.vm_object);
1668 * The object->un_pager.vnp.writemappings for the
1669 * object of MAP_ENTRY_VN_WRITECNT type entry shall be
1670 * kept as is here. The virtual pages are
1671 * re-distributed among the clipped entries, so the sum is
1678 * vm_map_clip_end: [ internal use only ]
1680 * Asserts that the given entry ends at or before
1681 * the specified address; if necessary,
1682 * it splits the entry into two.
1684 #define vm_map_clip_end(map, entry, endaddr) \
1686 if ((endaddr) < (entry->end)) \
1687 _vm_map_clip_end((map), (entry), (endaddr)); \
1691 * This routine is called only when it is known that
1692 * the entry must be split.
1695 _vm_map_clip_end(vm_map_t map, vm_map_entry_t entry, vm_offset_t end)
1697 vm_map_entry_t new_entry;
1699 VM_MAP_ASSERT_LOCKED(map);
1702 * If there is no object backing this entry, we might as well create
1703 * one now. If we defer it, an object can get created after the map
1704 * is clipped, and individual objects will be created for the split-up
1705 * map. This is a bit of a hack, but is also about the best place to
1706 * put this improvement.
1708 if (entry->object.vm_object == NULL && !map->system_map) {
1710 object = vm_object_allocate(OBJT_DEFAULT,
1711 atop(entry->end - entry->start));
1712 entry->object.vm_object = object;
1714 if (entry->cred != NULL) {
1715 object->cred = entry->cred;
1716 object->charge = entry->end - entry->start;
1719 } else if (entry->object.vm_object != NULL &&
1720 ((entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0) &&
1721 entry->cred != NULL) {
1722 VM_OBJECT_LOCK(entry->object.vm_object);
1723 KASSERT(entry->object.vm_object->cred == NULL,
1724 ("OVERCOMMIT: vm_entry_clip_end: both cred e %p", entry));
1725 entry->object.vm_object->cred = entry->cred;
1726 entry->object.vm_object->charge = entry->end - entry->start;
1727 VM_OBJECT_UNLOCK(entry->object.vm_object);
1732 * Create a new entry and insert it AFTER the specified entry
1734 new_entry = vm_map_entry_create(map);
1735 *new_entry = *entry;
1737 new_entry->start = entry->end = end;
1738 new_entry->offset += (end - entry->start);
1739 if (new_entry->cred != NULL)
1740 crhold(entry->cred);
1742 vm_map_entry_link(map, entry, new_entry);
1744 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0) {
1745 vm_object_reference(new_entry->object.vm_object);
1750 * vm_map_submap: [ kernel use only ]
1752 * Mark the given range as handled by a subordinate map.
1754 * This range must have been created with vm_map_find,
1755 * and no other operations may have been performed on this
1756 * range prior to calling vm_map_submap.
1758 * Only a limited number of operations can be performed
1759 * within this rage after calling vm_map_submap:
1761 * [Don't try vm_map_copy!]
1763 * To remove a submapping, one must first remove the
1764 * range from the superior map, and then destroy the
1765 * submap (if desired). [Better yet, don't try it.]
1774 vm_map_entry_t entry;
1775 int result = KERN_INVALID_ARGUMENT;
1779 VM_MAP_RANGE_CHECK(map, start, end);
1781 if (vm_map_lookup_entry(map, start, &entry)) {
1782 vm_map_clip_start(map, entry, start);
1784 entry = entry->next;
1786 vm_map_clip_end(map, entry, end);
1788 if ((entry->start == start) && (entry->end == end) &&
1789 ((entry->eflags & MAP_ENTRY_COW) == 0) &&
1790 (entry->object.vm_object == NULL)) {
1791 entry->object.sub_map = submap;
1792 entry->eflags |= MAP_ENTRY_IS_SUB_MAP;
1793 result = KERN_SUCCESS;
1801 * The maximum number of pages to map
1803 #define MAX_INIT_PT 96
1806 * vm_map_pmap_enter:
1808 * Preload read-only mappings for the given object's resident pages into
1809 * the given map. This eliminates the soft faults on process startup and
1810 * immediately after an mmap(2). Because these are speculative mappings,
1811 * cached pages are not reactivated and mapped.
1814 vm_map_pmap_enter(vm_map_t map, vm_offset_t addr, vm_prot_t prot,
1815 vm_object_t object, vm_pindex_t pindex, vm_size_t size, int flags)
1818 vm_page_t p, p_start;
1819 vm_pindex_t psize, tmpidx;
1821 if ((prot & (VM_PROT_READ | VM_PROT_EXECUTE)) == 0 || object == NULL)
1823 VM_OBJECT_LOCK(object);
1824 if (object->type == OBJT_DEVICE || object->type == OBJT_SG) {
1825 pmap_object_init_pt(map->pmap, addr, object, pindex, size);
1831 if ((flags & MAP_PREFAULT_PARTIAL) && psize > MAX_INIT_PT &&
1832 object->resident_page_count > MAX_INIT_PT)
1835 if (psize + pindex > object->size) {
1836 if (object->size < pindex)
1838 psize = object->size - pindex;
1844 p = vm_page_find_least(object, pindex);
1846 * Assert: the variable p is either (1) the page with the
1847 * least pindex greater than or equal to the parameter pindex
1851 p != NULL && (tmpidx = p->pindex - pindex) < psize;
1852 p = TAILQ_NEXT(p, listq)) {
1854 * don't allow an madvise to blow away our really
1855 * free pages allocating pv entries.
1857 if ((flags & MAP_PREFAULT_MADVISE) &&
1858 cnt.v_free_count < cnt.v_free_reserved) {
1862 if (p->valid == VM_PAGE_BITS_ALL) {
1863 if (p_start == NULL) {
1864 start = addr + ptoa(tmpidx);
1867 } else if (p_start != NULL) {
1868 pmap_enter_object(map->pmap, start, addr +
1869 ptoa(tmpidx), p_start, prot);
1873 if (p_start != NULL)
1874 pmap_enter_object(map->pmap, start, addr + ptoa(psize),
1877 VM_OBJECT_UNLOCK(object);
1883 * Sets the protection of the specified address
1884 * region in the target map. If "set_max" is
1885 * specified, the maximum protection is to be set;
1886 * otherwise, only the current protection is affected.
1889 vm_map_protect(vm_map_t map, vm_offset_t start, vm_offset_t end,
1890 vm_prot_t new_prot, boolean_t set_max)
1892 vm_map_entry_t current, entry;
1899 VM_MAP_RANGE_CHECK(map, start, end);
1901 if (vm_map_lookup_entry(map, start, &entry)) {
1902 vm_map_clip_start(map, entry, start);
1904 entry = entry->next;
1908 * Make a first pass to check for protection violations.
1911 while ((current != &map->header) && (current->start < end)) {
1912 if (current->eflags & MAP_ENTRY_IS_SUB_MAP) {
1914 return (KERN_INVALID_ARGUMENT);
1916 if ((new_prot & current->max_protection) != new_prot) {
1918 return (KERN_PROTECTION_FAILURE);
1920 current = current->next;
1925 * Do an accounting pass for private read-only mappings that
1926 * now will do cow due to allowed write (e.g. debugger sets
1927 * breakpoint on text segment)
1929 for (current = entry; (current != &map->header) &&
1930 (current->start < end); current = current->next) {
1932 vm_map_clip_end(map, current, end);
1935 ((new_prot & ~(current->protection)) & VM_PROT_WRITE) == 0 ||
1936 ENTRY_CHARGED(current)) {
1940 cred = curthread->td_ucred;
1941 obj = current->object.vm_object;
1943 if (obj == NULL || (current->eflags & MAP_ENTRY_NEEDS_COPY)) {
1944 if (!swap_reserve(current->end - current->start)) {
1946 return (KERN_RESOURCE_SHORTAGE);
1949 current->cred = cred;
1953 VM_OBJECT_LOCK(obj);
1954 if (obj->type != OBJT_DEFAULT && obj->type != OBJT_SWAP) {
1955 VM_OBJECT_UNLOCK(obj);
1960 * Charge for the whole object allocation now, since
1961 * we cannot distinguish between non-charged and
1962 * charged clipped mapping of the same object later.
1964 KASSERT(obj->charge == 0,
1965 ("vm_map_protect: object %p overcharged\n", obj));
1966 if (!swap_reserve(ptoa(obj->size))) {
1967 VM_OBJECT_UNLOCK(obj);
1969 return (KERN_RESOURCE_SHORTAGE);
1974 obj->charge = ptoa(obj->size);
1975 VM_OBJECT_UNLOCK(obj);
1979 * Go back and fix up protections. [Note that clipping is not
1980 * necessary the second time.]
1983 while ((current != &map->header) && (current->start < end)) {
1984 old_prot = current->protection;
1987 current->protection =
1988 (current->max_protection = new_prot) &
1991 current->protection = new_prot;
1993 if ((current->eflags & (MAP_ENTRY_COW | MAP_ENTRY_USER_WIRED))
1994 == (MAP_ENTRY_COW | MAP_ENTRY_USER_WIRED) &&
1995 (current->protection & VM_PROT_WRITE) != 0 &&
1996 (old_prot & VM_PROT_WRITE) == 0) {
1997 vm_fault_copy_entry(map, map, current, current, NULL);
2001 * When restricting access, update the physical map. Worry
2002 * about copy-on-write here.
2004 if ((old_prot & ~current->protection) != 0) {
2005 #define MASK(entry) (((entry)->eflags & MAP_ENTRY_COW) ? ~VM_PROT_WRITE : \
2007 pmap_protect(map->pmap, current->start,
2009 current->protection & MASK(current));
2012 vm_map_simplify_entry(map, current);
2013 current = current->next;
2016 return (KERN_SUCCESS);
2022 * This routine traverses a processes map handling the madvise
2023 * system call. Advisories are classified as either those effecting
2024 * the vm_map_entry structure, or those effecting the underlying
2034 vm_map_entry_t current, entry;
2038 * Some madvise calls directly modify the vm_map_entry, in which case
2039 * we need to use an exclusive lock on the map and we need to perform
2040 * various clipping operations. Otherwise we only need a read-lock
2045 case MADV_SEQUENTIAL:
2057 vm_map_lock_read(map);
2060 return (KERN_INVALID_ARGUMENT);
2064 * Locate starting entry and clip if necessary.
2066 VM_MAP_RANGE_CHECK(map, start, end);
2068 if (vm_map_lookup_entry(map, start, &entry)) {
2070 vm_map_clip_start(map, entry, start);
2072 entry = entry->next;
2077 * madvise behaviors that are implemented in the vm_map_entry.
2079 * We clip the vm_map_entry so that behavioral changes are
2080 * limited to the specified address range.
2082 for (current = entry;
2083 (current != &map->header) && (current->start < end);
2084 current = current->next
2086 if (current->eflags & MAP_ENTRY_IS_SUB_MAP)
2089 vm_map_clip_end(map, current, end);
2093 vm_map_entry_set_behavior(current, MAP_ENTRY_BEHAV_NORMAL);
2095 case MADV_SEQUENTIAL:
2096 vm_map_entry_set_behavior(current, MAP_ENTRY_BEHAV_SEQUENTIAL);
2099 vm_map_entry_set_behavior(current, MAP_ENTRY_BEHAV_RANDOM);
2102 current->eflags |= MAP_ENTRY_NOSYNC;
2105 current->eflags &= ~MAP_ENTRY_NOSYNC;
2108 current->eflags |= MAP_ENTRY_NOCOREDUMP;
2111 current->eflags &= ~MAP_ENTRY_NOCOREDUMP;
2116 vm_map_simplify_entry(map, current);
2120 vm_pindex_t pstart, pend;
2123 * madvise behaviors that are implemented in the underlying
2126 * Since we don't clip the vm_map_entry, we have to clip
2127 * the vm_object pindex and count.
2129 for (current = entry;
2130 (current != &map->header) && (current->start < end);
2131 current = current->next
2133 vm_offset_t useStart;
2135 if (current->eflags & MAP_ENTRY_IS_SUB_MAP)
2138 pstart = OFF_TO_IDX(current->offset);
2139 pend = pstart + atop(current->end - current->start);
2140 useStart = current->start;
2142 if (current->start < start) {
2143 pstart += atop(start - current->start);
2146 if (current->end > end)
2147 pend -= atop(current->end - end);
2152 vm_object_madvise(current->object.vm_object, pstart,
2154 if (behav == MADV_WILLNEED) {
2155 vm_map_pmap_enter(map,
2157 current->protection,
2158 current->object.vm_object,
2160 ptoa(pend - pstart),
2161 MAP_PREFAULT_MADVISE
2165 vm_map_unlock_read(map);
2174 * Sets the inheritance of the specified address
2175 * range in the target map. Inheritance
2176 * affects how the map will be shared with
2177 * child maps at the time of vmspace_fork.
2180 vm_map_inherit(vm_map_t map, vm_offset_t start, vm_offset_t end,
2181 vm_inherit_t new_inheritance)
2183 vm_map_entry_t entry;
2184 vm_map_entry_t temp_entry;
2186 switch (new_inheritance) {
2187 case VM_INHERIT_NONE:
2188 case VM_INHERIT_COPY:
2189 case VM_INHERIT_SHARE:
2192 return (KERN_INVALID_ARGUMENT);
2195 VM_MAP_RANGE_CHECK(map, start, end);
2196 if (vm_map_lookup_entry(map, start, &temp_entry)) {
2198 vm_map_clip_start(map, entry, start);
2200 entry = temp_entry->next;
2201 while ((entry != &map->header) && (entry->start < end)) {
2202 vm_map_clip_end(map, entry, end);
2203 entry->inheritance = new_inheritance;
2204 vm_map_simplify_entry(map, entry);
2205 entry = entry->next;
2208 return (KERN_SUCCESS);
2214 * Implements both kernel and user unwiring.
2217 vm_map_unwire(vm_map_t map, vm_offset_t start, vm_offset_t end,
2220 vm_map_entry_t entry, first_entry, tmp_entry;
2221 vm_offset_t saved_start;
2222 unsigned int last_timestamp;
2224 boolean_t need_wakeup, result, user_unwire;
2226 user_unwire = (flags & VM_MAP_WIRE_USER) ? TRUE : FALSE;
2228 VM_MAP_RANGE_CHECK(map, start, end);
2229 if (!vm_map_lookup_entry(map, start, &first_entry)) {
2230 if (flags & VM_MAP_WIRE_HOLESOK)
2231 first_entry = first_entry->next;
2234 return (KERN_INVALID_ADDRESS);
2237 last_timestamp = map->timestamp;
2238 entry = first_entry;
2239 while (entry != &map->header && entry->start < end) {
2240 if (entry->eflags & MAP_ENTRY_IN_TRANSITION) {
2242 * We have not yet clipped the entry.
2244 saved_start = (start >= entry->start) ? start :
2246 entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
2247 if (vm_map_unlock_and_wait(map, 0)) {
2249 * Allow interruption of user unwiring?
2253 if (last_timestamp+1 != map->timestamp) {
2255 * Look again for the entry because the map was
2256 * modified while it was unlocked.
2257 * Specifically, the entry may have been
2258 * clipped, merged, or deleted.
2260 if (!vm_map_lookup_entry(map, saved_start,
2262 if (flags & VM_MAP_WIRE_HOLESOK)
2263 tmp_entry = tmp_entry->next;
2265 if (saved_start == start) {
2267 * First_entry has been deleted.
2270 return (KERN_INVALID_ADDRESS);
2273 rv = KERN_INVALID_ADDRESS;
2277 if (entry == first_entry)
2278 first_entry = tmp_entry;
2283 last_timestamp = map->timestamp;
2286 vm_map_clip_start(map, entry, start);
2287 vm_map_clip_end(map, entry, end);
2289 * Mark the entry in case the map lock is released. (See
2292 entry->eflags |= MAP_ENTRY_IN_TRANSITION;
2293 entry->wiring_thread = curthread;
2295 * Check the map for holes in the specified region.
2296 * If VM_MAP_WIRE_HOLESOK was specified, skip this check.
2298 if (((flags & VM_MAP_WIRE_HOLESOK) == 0) &&
2299 (entry->end < end && (entry->next == &map->header ||
2300 entry->next->start > entry->end))) {
2302 rv = KERN_INVALID_ADDRESS;
2306 * If system unwiring, require that the entry is system wired.
2309 vm_map_entry_system_wired_count(entry) == 0) {
2311 rv = KERN_INVALID_ARGUMENT;
2314 entry = entry->next;
2318 need_wakeup = FALSE;
2319 if (first_entry == NULL) {
2320 result = vm_map_lookup_entry(map, start, &first_entry);
2321 if (!result && (flags & VM_MAP_WIRE_HOLESOK))
2322 first_entry = first_entry->next;
2324 KASSERT(result, ("vm_map_unwire: lookup failed"));
2326 for (entry = first_entry; entry != &map->header && entry->start < end;
2327 entry = entry->next) {
2329 * If VM_MAP_WIRE_HOLESOK was specified, an empty
2330 * space in the unwired region could have been mapped
2331 * while the map lock was dropped for draining
2332 * MAP_ENTRY_IN_TRANSITION. Moreover, another thread
2333 * could be simultaneously wiring this new mapping
2334 * entry. Detect these cases and skip any entries
2335 * marked as in transition by us.
2337 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 ||
2338 entry->wiring_thread != curthread) {
2339 KASSERT((flags & VM_MAP_WIRE_HOLESOK) != 0,
2340 ("vm_map_unwire: !HOLESOK and new/changed entry"));
2344 if (rv == KERN_SUCCESS && (!user_unwire ||
2345 (entry->eflags & MAP_ENTRY_USER_WIRED))) {
2347 entry->eflags &= ~MAP_ENTRY_USER_WIRED;
2348 entry->wired_count--;
2349 if (entry->wired_count == 0) {
2351 * Retain the map lock.
2353 vm_fault_unwire(map, entry->start, entry->end,
2354 entry->object.vm_object != NULL &&
2355 (entry->object.vm_object->type == OBJT_DEVICE ||
2356 entry->object.vm_object->type == OBJT_SG));
2359 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0,
2360 ("vm_map_unwire: in-transition flag missing"));
2361 entry->eflags &= ~MAP_ENTRY_IN_TRANSITION;
2362 entry->wiring_thread = NULL;
2363 if (entry->eflags & MAP_ENTRY_NEEDS_WAKEUP) {
2364 entry->eflags &= ~MAP_ENTRY_NEEDS_WAKEUP;
2367 vm_map_simplify_entry(map, entry);
2378 * Implements both kernel and user wiring.
2381 vm_map_wire(vm_map_t map, vm_offset_t start, vm_offset_t end,
2384 vm_map_entry_t entry, first_entry, tmp_entry;
2385 vm_offset_t saved_end, saved_start;
2386 unsigned int last_timestamp;
2388 boolean_t fictitious, need_wakeup, result, user_wire;
2392 if (flags & VM_MAP_WIRE_WRITE)
2393 prot |= VM_PROT_WRITE;
2394 user_wire = (flags & VM_MAP_WIRE_USER) ? TRUE : FALSE;
2396 VM_MAP_RANGE_CHECK(map, start, end);
2397 if (!vm_map_lookup_entry(map, start, &first_entry)) {
2398 if (flags & VM_MAP_WIRE_HOLESOK)
2399 first_entry = first_entry->next;
2402 return (KERN_INVALID_ADDRESS);
2405 last_timestamp = map->timestamp;
2406 entry = first_entry;
2407 while (entry != &map->header && entry->start < end) {
2408 if (entry->eflags & MAP_ENTRY_IN_TRANSITION) {
2410 * We have not yet clipped the entry.
2412 saved_start = (start >= entry->start) ? start :
2414 entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
2415 if (vm_map_unlock_and_wait(map, 0)) {
2417 * Allow interruption of user wiring?
2421 if (last_timestamp + 1 != map->timestamp) {
2423 * Look again for the entry because the map was
2424 * modified while it was unlocked.
2425 * Specifically, the entry may have been
2426 * clipped, merged, or deleted.
2428 if (!vm_map_lookup_entry(map, saved_start,
2430 if (flags & VM_MAP_WIRE_HOLESOK)
2431 tmp_entry = tmp_entry->next;
2433 if (saved_start == start) {
2435 * first_entry has been deleted.
2438 return (KERN_INVALID_ADDRESS);
2441 rv = KERN_INVALID_ADDRESS;
2445 if (entry == first_entry)
2446 first_entry = tmp_entry;
2451 last_timestamp = map->timestamp;
2454 vm_map_clip_start(map, entry, start);
2455 vm_map_clip_end(map, entry, end);
2457 * Mark the entry in case the map lock is released. (See
2460 entry->eflags |= MAP_ENTRY_IN_TRANSITION;
2461 entry->wiring_thread = curthread;
2462 if ((entry->protection & (VM_PROT_READ | VM_PROT_EXECUTE)) == 0
2463 || (entry->protection & prot) != prot) {
2464 entry->eflags |= MAP_ENTRY_WIRE_SKIPPED;
2465 if ((flags & VM_MAP_WIRE_HOLESOK) == 0) {
2467 rv = KERN_INVALID_ADDRESS;
2472 if (entry->wired_count == 0) {
2473 entry->wired_count++;
2474 saved_start = entry->start;
2475 saved_end = entry->end;
2476 fictitious = entry->object.vm_object != NULL &&
2477 (entry->object.vm_object->type == OBJT_DEVICE ||
2478 entry->object.vm_object->type == OBJT_SG);
2480 * Release the map lock, relying on the in-transition
2481 * mark. Mark the map busy for fork.
2485 rv = vm_fault_wire(map, saved_start, saved_end,
2489 if (last_timestamp + 1 != map->timestamp) {
2491 * Look again for the entry because the map was
2492 * modified while it was unlocked. The entry
2493 * may have been clipped, but NOT merged or
2496 result = vm_map_lookup_entry(map, saved_start,
2498 KASSERT(result, ("vm_map_wire: lookup failed"));
2499 if (entry == first_entry)
2500 first_entry = tmp_entry;
2504 while (entry->end < saved_end) {
2505 if (rv != KERN_SUCCESS) {
2506 KASSERT(entry->wired_count == 1,
2507 ("vm_map_wire: bad count"));
2508 entry->wired_count = -1;
2510 entry = entry->next;
2513 last_timestamp = map->timestamp;
2514 if (rv != KERN_SUCCESS) {
2515 KASSERT(entry->wired_count == 1,
2516 ("vm_map_wire: bad count"));
2518 * Assign an out-of-range value to represent
2519 * the failure to wire this entry.
2521 entry->wired_count = -1;
2525 } else if (!user_wire ||
2526 (entry->eflags & MAP_ENTRY_USER_WIRED) == 0) {
2527 entry->wired_count++;
2530 * Check the map for holes in the specified region.
2531 * If VM_MAP_WIRE_HOLESOK was specified, skip this check.
2534 if (((flags & VM_MAP_WIRE_HOLESOK) == 0) &&
2535 (entry->end < end && (entry->next == &map->header ||
2536 entry->next->start > entry->end))) {
2538 rv = KERN_INVALID_ADDRESS;
2541 entry = entry->next;
2545 need_wakeup = FALSE;
2546 if (first_entry == NULL) {
2547 result = vm_map_lookup_entry(map, start, &first_entry);
2548 if (!result && (flags & VM_MAP_WIRE_HOLESOK))
2549 first_entry = first_entry->next;
2551 KASSERT(result, ("vm_map_wire: lookup failed"));
2553 for (entry = first_entry; entry != &map->header && entry->start < end;
2554 entry = entry->next) {
2555 if ((entry->eflags & MAP_ENTRY_WIRE_SKIPPED) != 0)
2556 goto next_entry_done;
2559 * If VM_MAP_WIRE_HOLESOK was specified, an empty
2560 * space in the unwired region could have been mapped
2561 * while the map lock was dropped for faulting in the
2562 * pages or draining MAP_ENTRY_IN_TRANSITION.
2563 * Moreover, another thread could be simultaneously
2564 * wiring this new mapping entry. Detect these cases
2565 * and skip any entries marked as in transition by us.
2567 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) == 0 ||
2568 entry->wiring_thread != curthread) {
2569 KASSERT((flags & VM_MAP_WIRE_HOLESOK) != 0,
2570 ("vm_map_wire: !HOLESOK and new/changed entry"));
2574 if (rv == KERN_SUCCESS) {
2576 entry->eflags |= MAP_ENTRY_USER_WIRED;
2577 } else if (entry->wired_count == -1) {
2579 * Wiring failed on this entry. Thus, unwiring is
2582 entry->wired_count = 0;
2585 (entry->eflags & MAP_ENTRY_USER_WIRED) == 0)
2586 entry->wired_count--;
2587 if (entry->wired_count == 0) {
2589 * Retain the map lock.
2591 vm_fault_unwire(map, entry->start, entry->end,
2592 entry->object.vm_object != NULL &&
2593 (entry->object.vm_object->type == OBJT_DEVICE ||
2594 entry->object.vm_object->type == OBJT_SG));
2598 KASSERT((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0,
2599 ("vm_map_wire: in-transition flag missing %p", entry));
2600 KASSERT(entry->wiring_thread == curthread,
2601 ("vm_map_wire: alien wire %p", entry));
2602 entry->eflags &= ~(MAP_ENTRY_IN_TRANSITION |
2603 MAP_ENTRY_WIRE_SKIPPED);
2604 entry->wiring_thread = NULL;
2605 if (entry->eflags & MAP_ENTRY_NEEDS_WAKEUP) {
2606 entry->eflags &= ~MAP_ENTRY_NEEDS_WAKEUP;
2609 vm_map_simplify_entry(map, entry);
2620 * Push any dirty cached pages in the address range to their pager.
2621 * If syncio is TRUE, dirty pages are written synchronously.
2622 * If invalidate is TRUE, any cached pages are freed as well.
2624 * If the size of the region from start to end is zero, we are
2625 * supposed to flush all modified pages within the region containing
2626 * start. Unfortunately, a region can be split or coalesced with
2627 * neighboring regions, making it difficult to determine what the
2628 * original region was. Therefore, we approximate this requirement by
2629 * flushing the current region containing start.
2631 * Returns an error if any part of the specified range is not mapped.
2639 boolean_t invalidate)
2641 vm_map_entry_t current;
2642 vm_map_entry_t entry;
2645 vm_ooffset_t offset;
2646 unsigned int last_timestamp;
2649 vm_map_lock_read(map);
2650 VM_MAP_RANGE_CHECK(map, start, end);
2651 if (!vm_map_lookup_entry(map, start, &entry)) {
2652 vm_map_unlock_read(map);
2653 return (KERN_INVALID_ADDRESS);
2654 } else if (start == end) {
2655 start = entry->start;
2659 * Make a first pass to check for user-wired memory and holes.
2661 for (current = entry; current != &map->header && current->start < end;
2662 current = current->next) {
2663 if (invalidate && (current->eflags & MAP_ENTRY_USER_WIRED)) {
2664 vm_map_unlock_read(map);
2665 return (KERN_INVALID_ARGUMENT);
2667 if (end > current->end &&
2668 (current->next == &map->header ||
2669 current->end != current->next->start)) {
2670 vm_map_unlock_read(map);
2671 return (KERN_INVALID_ADDRESS);
2676 pmap_remove(map->pmap, start, end);
2680 * Make a second pass, cleaning/uncaching pages from the indicated
2683 for (current = entry; current != &map->header && current->start < end;) {
2684 offset = current->offset + (start - current->start);
2685 size = (end <= current->end ? end : current->end) - start;
2686 if (current->eflags & MAP_ENTRY_IS_SUB_MAP) {
2688 vm_map_entry_t tentry;
2691 smap = current->object.sub_map;
2692 vm_map_lock_read(smap);
2693 (void) vm_map_lookup_entry(smap, offset, &tentry);
2694 tsize = tentry->end - offset;
2697 object = tentry->object.vm_object;
2698 offset = tentry->offset + (offset - tentry->start);
2699 vm_map_unlock_read(smap);
2701 object = current->object.vm_object;
2703 vm_object_reference(object);
2704 last_timestamp = map->timestamp;
2705 vm_map_unlock_read(map);
2706 if (!vm_object_sync(object, offset, size, syncio, invalidate))
2709 vm_object_deallocate(object);
2710 vm_map_lock_read(map);
2711 if (last_timestamp == map->timestamp ||
2712 !vm_map_lookup_entry(map, start, ¤t))
2713 current = current->next;
2716 vm_map_unlock_read(map);
2717 return (failed ? KERN_FAILURE : KERN_SUCCESS);
2721 * vm_map_entry_unwire: [ internal use only ]
2723 * Make the region specified by this entry pageable.
2725 * The map in question should be locked.
2726 * [This is the reason for this routine's existence.]
2729 vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry)
2731 vm_fault_unwire(map, entry->start, entry->end,
2732 entry->object.vm_object != NULL &&
2733 (entry->object.vm_object->type == OBJT_DEVICE ||
2734 entry->object.vm_object->type == OBJT_SG));
2735 entry->wired_count = 0;
2739 vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map)
2742 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0)
2743 vm_object_deallocate(entry->object.vm_object);
2744 uma_zfree(system_map ? kmapentzone : mapentzone, entry);
2748 * vm_map_entry_delete: [ internal use only ]
2750 * Deallocate the given entry from the target map.
2753 vm_map_entry_delete(vm_map_t map, vm_map_entry_t entry)
2756 vm_pindex_t offidxstart, offidxend, count, size1;
2759 vm_map_entry_unlink(map, entry);
2760 object = entry->object.vm_object;
2761 size = entry->end - entry->start;
2764 if (entry->cred != NULL) {
2765 swap_release_by_cred(size, entry->cred);
2766 crfree(entry->cred);
2769 if ((entry->eflags & MAP_ENTRY_IS_SUB_MAP) == 0 &&
2771 KASSERT(entry->cred == NULL || object->cred == NULL ||
2772 (entry->eflags & MAP_ENTRY_NEEDS_COPY),
2773 ("OVERCOMMIT vm_map_entry_delete: both cred %p", entry));
2774 count = OFF_TO_IDX(size);
2775 offidxstart = OFF_TO_IDX(entry->offset);
2776 offidxend = offidxstart + count;
2777 VM_OBJECT_LOCK(object);
2778 if (object->ref_count != 1 &&
2779 ((object->flags & (OBJ_NOSPLIT|OBJ_ONEMAPPING)) == OBJ_ONEMAPPING ||
2780 object == kernel_object || object == kmem_object)) {
2781 vm_object_collapse(object);
2784 * The option OBJPR_NOTMAPPED can be passed here
2785 * because vm_map_delete() already performed
2786 * pmap_remove() on the only mapping to this range
2789 vm_object_page_remove(object, offidxstart, offidxend,
2791 if (object->type == OBJT_SWAP)
2792 swap_pager_freespace(object, offidxstart, count);
2793 if (offidxend >= object->size &&
2794 offidxstart < object->size) {
2795 size1 = object->size;
2796 object->size = offidxstart;
2797 if (object->cred != NULL) {
2798 size1 -= object->size;
2799 KASSERT(object->charge >= ptoa(size1),
2800 ("vm_map_entry_delete: object->charge < 0"));
2801 swap_release_by_cred(ptoa(size1), object->cred);
2802 object->charge -= ptoa(size1);
2806 VM_OBJECT_UNLOCK(object);
2808 entry->object.vm_object = NULL;
2809 if (map->system_map)
2810 vm_map_entry_deallocate(entry, TRUE);
2812 entry->next = curthread->td_map_def_user;
2813 curthread->td_map_def_user = entry;
2818 * vm_map_delete: [ internal use only ]
2820 * Deallocates the given address range from the target
2824 vm_map_delete(vm_map_t map, vm_offset_t start, vm_offset_t end)
2826 vm_map_entry_t entry;
2827 vm_map_entry_t first_entry;
2829 VM_MAP_ASSERT_LOCKED(map);
2832 * Find the start of the region, and clip it
2834 if (!vm_map_lookup_entry(map, start, &first_entry))
2835 entry = first_entry->next;
2837 entry = first_entry;
2838 vm_map_clip_start(map, entry, start);
2842 * Step through all entries in this region
2844 while ((entry != &map->header) && (entry->start < end)) {
2845 vm_map_entry_t next;
2848 * Wait for wiring or unwiring of an entry to complete.
2849 * Also wait for any system wirings to disappear on
2852 if ((entry->eflags & MAP_ENTRY_IN_TRANSITION) != 0 ||
2853 (vm_map_pmap(map) != kernel_pmap &&
2854 vm_map_entry_system_wired_count(entry) != 0)) {
2855 unsigned int last_timestamp;
2856 vm_offset_t saved_start;
2857 vm_map_entry_t tmp_entry;
2859 saved_start = entry->start;
2860 entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
2861 last_timestamp = map->timestamp;
2862 (void) vm_map_unlock_and_wait(map, 0);
2864 if (last_timestamp + 1 != map->timestamp) {
2866 * Look again for the entry because the map was
2867 * modified while it was unlocked.
2868 * Specifically, the entry may have been
2869 * clipped, merged, or deleted.
2871 if (!vm_map_lookup_entry(map, saved_start,
2873 entry = tmp_entry->next;
2876 vm_map_clip_start(map, entry,
2882 vm_map_clip_end(map, entry, end);
2887 * Unwire before removing addresses from the pmap; otherwise,
2888 * unwiring will put the entries back in the pmap.
2890 if (entry->wired_count != 0) {
2891 vm_map_entry_unwire(map, entry);
2894 pmap_remove(map->pmap, entry->start, entry->end);
2897 * Delete the entry only after removing all pmap
2898 * entries pointing to its pages. (Otherwise, its
2899 * page frames may be reallocated, and any modify bits
2900 * will be set in the wrong object!)
2902 vm_map_entry_delete(map, entry);
2905 return (KERN_SUCCESS);
2911 * Remove the given address range from the target map.
2912 * This is the exported form of vm_map_delete.
2915 vm_map_remove(vm_map_t map, vm_offset_t start, vm_offset_t end)
2920 VM_MAP_RANGE_CHECK(map, start, end);
2921 result = vm_map_delete(map, start, end);
2927 * vm_map_check_protection:
2929 * Assert that the target map allows the specified privilege on the
2930 * entire address region given. The entire region must be allocated.
2932 * WARNING! This code does not and should not check whether the
2933 * contents of the region is accessible. For example a smaller file
2934 * might be mapped into a larger address space.
2936 * NOTE! This code is also called by munmap().
2938 * The map must be locked. A read lock is sufficient.
2941 vm_map_check_protection(vm_map_t map, vm_offset_t start, vm_offset_t end,
2942 vm_prot_t protection)
2944 vm_map_entry_t entry;
2945 vm_map_entry_t tmp_entry;
2947 if (!vm_map_lookup_entry(map, start, &tmp_entry))
2951 while (start < end) {
2952 if (entry == &map->header)
2957 if (start < entry->start)
2960 * Check protection associated with entry.
2962 if ((entry->protection & protection) != protection)
2964 /* go to next entry */
2966 entry = entry->next;
2972 * vm_map_copy_entry:
2974 * Copies the contents of the source entry to the destination
2975 * entry. The entries *must* be aligned properly.
2981 vm_map_entry_t src_entry,
2982 vm_map_entry_t dst_entry,
2983 vm_ooffset_t *fork_charge)
2985 vm_object_t src_object;
2986 vm_map_entry_t fake_entry;
2991 VM_MAP_ASSERT_LOCKED(dst_map);
2993 if ((dst_entry->eflags|src_entry->eflags) & MAP_ENTRY_IS_SUB_MAP)
2996 if (src_entry->wired_count == 0) {
2999 * If the source entry is marked needs_copy, it is already
3002 if ((src_entry->eflags & MAP_ENTRY_NEEDS_COPY) == 0) {
3003 pmap_protect(src_map->pmap,
3006 src_entry->protection & ~VM_PROT_WRITE);
3010 * Make a copy of the object.
3012 size = src_entry->end - src_entry->start;
3013 if ((src_object = src_entry->object.vm_object) != NULL) {
3014 VM_OBJECT_LOCK(src_object);
3015 charged = ENTRY_CHARGED(src_entry);
3016 if ((src_object->handle == NULL) &&
3017 (src_object->type == OBJT_DEFAULT ||
3018 src_object->type == OBJT_SWAP)) {
3019 vm_object_collapse(src_object);
3020 if ((src_object->flags & (OBJ_NOSPLIT|OBJ_ONEMAPPING)) == OBJ_ONEMAPPING) {
3021 vm_object_split(src_entry);
3022 src_object = src_entry->object.vm_object;
3025 vm_object_reference_locked(src_object);
3026 vm_object_clear_flag(src_object, OBJ_ONEMAPPING);
3027 if (src_entry->cred != NULL &&
3028 !(src_entry->eflags & MAP_ENTRY_NEEDS_COPY)) {
3029 KASSERT(src_object->cred == NULL,
3030 ("OVERCOMMIT: vm_map_copy_entry: cred %p",
3032 src_object->cred = src_entry->cred;
3033 src_object->charge = size;
3035 VM_OBJECT_UNLOCK(src_object);
3036 dst_entry->object.vm_object = src_object;
3038 cred = curthread->td_ucred;
3040 dst_entry->cred = cred;
3041 *fork_charge += size;
3042 if (!(src_entry->eflags &
3043 MAP_ENTRY_NEEDS_COPY)) {
3045 src_entry->cred = cred;
3046 *fork_charge += size;
3049 src_entry->eflags |= (MAP_ENTRY_COW|MAP_ENTRY_NEEDS_COPY);
3050 dst_entry->eflags |= (MAP_ENTRY_COW|MAP_ENTRY_NEEDS_COPY);
3051 dst_entry->offset = src_entry->offset;
3052 if (src_entry->eflags & MAP_ENTRY_VN_WRITECNT) {
3054 * MAP_ENTRY_VN_WRITECNT cannot
3055 * indicate write reference from
3056 * src_entry, since the entry is
3057 * marked as needs copy. Allocate a
3058 * fake entry that is used to
3059 * decrement object->un_pager.vnp.writecount
3060 * at the appropriate time. Attach
3061 * fake_entry to the deferred list.
3063 fake_entry = vm_map_entry_create(dst_map);
3064 fake_entry->eflags = MAP_ENTRY_VN_WRITECNT;
3065 src_entry->eflags &= ~MAP_ENTRY_VN_WRITECNT;
3066 vm_object_reference(src_object);
3067 fake_entry->object.vm_object = src_object;
3068 fake_entry->start = src_entry->start;
3069 fake_entry->end = src_entry->end;
3070 fake_entry->next = curthread->td_map_def_user;
3071 curthread->td_map_def_user = fake_entry;
3074 dst_entry->object.vm_object = NULL;
3075 dst_entry->offset = 0;
3076 if (src_entry->cred != NULL) {
3077 dst_entry->cred = curthread->td_ucred;
3078 crhold(dst_entry->cred);
3079 *fork_charge += size;
3083 pmap_copy(dst_map->pmap, src_map->pmap, dst_entry->start,
3084 dst_entry->end - dst_entry->start, src_entry->start);
3087 * Of course, wired down pages can't be set copy-on-write.
3088 * Cause wired pages to be copied into the new map by
3089 * simulating faults (the new pages are pageable)
3091 vm_fault_copy_entry(dst_map, src_map, dst_entry, src_entry,
3097 * vmspace_map_entry_forked:
3098 * Update the newly-forked vmspace each time a map entry is inherited
3099 * or copied. The values for vm_dsize and vm_tsize are approximate
3100 * (and mostly-obsolete ideas in the face of mmap(2) et al.)
3103 vmspace_map_entry_forked(const struct vmspace *vm1, struct vmspace *vm2,
3104 vm_map_entry_t entry)
3106 vm_size_t entrysize;
3109 entrysize = entry->end - entry->start;
3110 vm2->vm_map.size += entrysize;
3111 if (entry->eflags & (MAP_ENTRY_GROWS_DOWN | MAP_ENTRY_GROWS_UP)) {
3112 vm2->vm_ssize += btoc(entrysize);
3113 } else if (entry->start >= (vm_offset_t)vm1->vm_daddr &&
3114 entry->start < (vm_offset_t)vm1->vm_daddr + ctob(vm1->vm_dsize)) {
3115 newend = MIN(entry->end,
3116 (vm_offset_t)vm1->vm_daddr + ctob(vm1->vm_dsize));
3117 vm2->vm_dsize += btoc(newend - entry->start);
3118 } else if (entry->start >= (vm_offset_t)vm1->vm_taddr &&
3119 entry->start < (vm_offset_t)vm1->vm_taddr + ctob(vm1->vm_tsize)) {
3120 newend = MIN(entry->end,
3121 (vm_offset_t)vm1->vm_taddr + ctob(vm1->vm_tsize));
3122 vm2->vm_tsize += btoc(newend - entry->start);
3128 * Create a new process vmspace structure and vm_map
3129 * based on those of an existing process. The new map
3130 * is based on the old map, according to the inheritance
3131 * values on the regions in that map.
3133 * XXX It might be worth coalescing the entries added to the new vmspace.
3135 * The source map must not be locked.
3138 vmspace_fork(struct vmspace *vm1, vm_ooffset_t *fork_charge)
3140 struct vmspace *vm2;
3141 vm_map_t new_map, old_map;
3142 vm_map_entry_t new_entry, old_entry;
3146 old_map = &vm1->vm_map;
3147 /* Copy immutable fields of vm1 to vm2. */
3148 vm2 = vmspace_alloc(old_map->min_offset, old_map->max_offset);
3151 vm2->vm_taddr = vm1->vm_taddr;
3152 vm2->vm_daddr = vm1->vm_daddr;
3153 vm2->vm_maxsaddr = vm1->vm_maxsaddr;
3154 vm_map_lock(old_map);
3156 vm_map_wait_busy(old_map);
3157 new_map = &vm2->vm_map;
3158 locked = vm_map_trylock(new_map); /* trylock to silence WITNESS */
3159 KASSERT(locked, ("vmspace_fork: lock failed"));
3161 old_entry = old_map->header.next;
3163 while (old_entry != &old_map->header) {
3164 if (old_entry->eflags & MAP_ENTRY_IS_SUB_MAP)
3165 panic("vm_map_fork: encountered a submap");
3167 switch (old_entry->inheritance) {
3168 case VM_INHERIT_NONE:
3171 case VM_INHERIT_SHARE:
3173 * Clone the entry, creating the shared object if necessary.
3175 object = old_entry->object.vm_object;
3176 if (object == NULL) {
3177 object = vm_object_allocate(OBJT_DEFAULT,
3178 atop(old_entry->end - old_entry->start));
3179 old_entry->object.vm_object = object;
3180 old_entry->offset = 0;
3181 if (old_entry->cred != NULL) {
3182 object->cred = old_entry->cred;
3183 object->charge = old_entry->end -
3185 old_entry->cred = NULL;
3190 * Add the reference before calling vm_object_shadow
3191 * to insure that a shadow object is created.
3193 vm_object_reference(object);
3194 if (old_entry->eflags & MAP_ENTRY_NEEDS_COPY) {
3195 vm_object_shadow(&old_entry->object.vm_object,
3197 old_entry->end - old_entry->start);
3198 old_entry->eflags &= ~MAP_ENTRY_NEEDS_COPY;
3199 /* Transfer the second reference too. */
3200 vm_object_reference(
3201 old_entry->object.vm_object);
3204 * As in vm_map_simplify_entry(), the
3205 * vnode lock will not be acquired in
3206 * this call to vm_object_deallocate().
3208 vm_object_deallocate(object);
3209 object = old_entry->object.vm_object;
3211 VM_OBJECT_LOCK(object);
3212 vm_object_clear_flag(object, OBJ_ONEMAPPING);
3213 if (old_entry->cred != NULL) {
3214 KASSERT(object->cred == NULL, ("vmspace_fork both cred"));
3215 object->cred = old_entry->cred;
3216 object->charge = old_entry->end - old_entry->start;
3217 old_entry->cred = NULL;
3221 * Assert the correct state of the vnode
3222 * v_writecount while the object is locked, to
3223 * not relock it later for the assertion
3226 if (old_entry->eflags & MAP_ENTRY_VN_WRITECNT &&
3227 object->type == OBJT_VNODE) {
3228 KASSERT(((struct vnode *)object->handle)->
3230 ("vmspace_fork: v_writecount %p", object));
3231 KASSERT(object->un_pager.vnp.writemappings > 0,
3232 ("vmspace_fork: vnp.writecount %p",
3235 VM_OBJECT_UNLOCK(object);
3238 * Clone the entry, referencing the shared object.
3240 new_entry = vm_map_entry_create(new_map);
3241 *new_entry = *old_entry;
3242 new_entry->eflags &= ~(MAP_ENTRY_USER_WIRED |
3243 MAP_ENTRY_IN_TRANSITION);
3244 new_entry->wiring_thread = NULL;
3245 new_entry->wired_count = 0;
3246 if (new_entry->eflags & MAP_ENTRY_VN_WRITECNT) {
3247 vnode_pager_update_writecount(object,
3248 new_entry->start, new_entry->end);
3252 * Insert the entry into the new map -- we know we're
3253 * inserting at the end of the new map.
3255 vm_map_entry_link(new_map, new_map->header.prev,
3257 vmspace_map_entry_forked(vm1, vm2, new_entry);
3260 * Update the physical map
3262 pmap_copy(new_map->pmap, old_map->pmap,
3264 (old_entry->end - old_entry->start),
3268 case VM_INHERIT_COPY:
3270 * Clone the entry and link into the map.
3272 new_entry = vm_map_entry_create(new_map);
3273 *new_entry = *old_entry;
3275 * Copied entry is COW over the old object.
3277 new_entry->eflags &= ~(MAP_ENTRY_USER_WIRED |
3278 MAP_ENTRY_IN_TRANSITION | MAP_ENTRY_VN_WRITECNT);
3279 new_entry->wiring_thread = NULL;
3280 new_entry->wired_count = 0;
3281 new_entry->object.vm_object = NULL;
3282 new_entry->cred = NULL;
3283 vm_map_entry_link(new_map, new_map->header.prev,
3285 vmspace_map_entry_forked(vm1, vm2, new_entry);
3286 vm_map_copy_entry(old_map, new_map, old_entry,
3287 new_entry, fork_charge);
3290 old_entry = old_entry->next;
3293 * Use inlined vm_map_unlock() to postpone handling the deferred
3294 * map entries, which cannot be done until both old_map and
3295 * new_map locks are released.
3297 sx_xunlock(&old_map->lock);
3298 sx_xunlock(&new_map->lock);
3299 vm_map_process_deferred();
3305 vm_map_stack(vm_map_t map, vm_offset_t addrbos, vm_size_t max_ssize,
3306 vm_prot_t prot, vm_prot_t max, int cow)
3308 vm_map_entry_t new_entry, prev_entry;
3309 vm_offset_t bot, top;
3310 vm_size_t growsize, init_ssize;
3312 rlim_t lmemlim, vmemlim;
3315 * The stack orientation is piggybacked with the cow argument.
3316 * Extract it into orient and mask the cow argument so that we
3317 * don't pass it around further.
3318 * NOTE: We explicitly allow bi-directional stacks.
3320 orient = cow & (MAP_STACK_GROWS_DOWN|MAP_STACK_GROWS_UP);
3322 KASSERT(orient != 0, ("No stack grow direction"));
3324 if (addrbos < vm_map_min(map) ||
3325 addrbos > vm_map_max(map) ||
3326 addrbos + max_ssize < addrbos)
3327 return (KERN_NO_SPACE);
3329 growsize = sgrowsiz;
3330 init_ssize = (max_ssize < growsize) ? max_ssize : growsize;
3333 lmemlim = lim_cur(curproc, RLIMIT_MEMLOCK);
3334 vmemlim = lim_cur(curproc, RLIMIT_VMEM);
3335 PROC_UNLOCK(curproc);
3339 /* If addr is already mapped, no go */
3340 if (vm_map_lookup_entry(map, addrbos, &prev_entry)) {
3342 return (KERN_NO_SPACE);
3345 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
3346 if (ptoa(pmap_wired_count(map->pmap)) + init_ssize > lmemlim) {
3348 return (KERN_NO_SPACE);
3352 /* If we would blow our VMEM resource limit, no go */
3353 if (map->size + init_ssize > vmemlim) {
3355 return (KERN_NO_SPACE);
3359 * If we can't accomodate max_ssize in the current mapping, no go.
3360 * However, we need to be aware that subsequent user mappings might
3361 * map into the space we have reserved for stack, and currently this
3362 * space is not protected.
3364 * Hopefully we will at least detect this condition when we try to
3367 if ((prev_entry->next != &map->header) &&
3368 (prev_entry->next->start < addrbos + max_ssize)) {
3370 return (KERN_NO_SPACE);
3374 * We initially map a stack of only init_ssize. We will grow as
3375 * needed later. Depending on the orientation of the stack (i.e.
3376 * the grow direction) we either map at the top of the range, the
3377 * bottom of the range or in the middle.
3379 * Note: we would normally expect prot and max to be VM_PROT_ALL,
3380 * and cow to be 0. Possibly we should eliminate these as input
3381 * parameters, and just pass these values here in the insert call.
3383 if (orient == MAP_STACK_GROWS_DOWN)
3384 bot = addrbos + max_ssize - init_ssize;
3385 else if (orient == MAP_STACK_GROWS_UP)
3388 bot = round_page(addrbos + max_ssize/2 - init_ssize/2);
3389 top = bot + init_ssize;
3390 rv = vm_map_insert(map, NULL, 0, bot, top, prot, max, cow);
3392 /* Now set the avail_ssize amount. */
3393 if (rv == KERN_SUCCESS) {
3394 if (prev_entry != &map->header)
3395 vm_map_clip_end(map, prev_entry, bot);
3396 new_entry = prev_entry->next;
3397 if (new_entry->end != top || new_entry->start != bot)
3398 panic("Bad entry start/end for new stack entry");
3400 new_entry->avail_ssize = max_ssize - init_ssize;
3401 if (orient & MAP_STACK_GROWS_DOWN)
3402 new_entry->eflags |= MAP_ENTRY_GROWS_DOWN;
3403 if (orient & MAP_STACK_GROWS_UP)
3404 new_entry->eflags |= MAP_ENTRY_GROWS_UP;
3411 static int stack_guard_page = 0;
3412 TUNABLE_INT("security.bsd.stack_guard_page", &stack_guard_page);
3413 SYSCTL_INT(_security_bsd, OID_AUTO, stack_guard_page, CTLFLAG_RW,
3414 &stack_guard_page, 0,
3415 "Insert stack guard page ahead of the growable segments.");
3417 /* Attempts to grow a vm stack entry. Returns KERN_SUCCESS if the
3418 * desired address is already mapped, or if we successfully grow
3419 * the stack. Also returns KERN_SUCCESS if addr is outside the
3420 * stack range (this is strange, but preserves compatibility with
3421 * the grow function in vm_machdep.c).
3424 vm_map_growstack(struct proc *p, vm_offset_t addr)
3426 vm_map_entry_t next_entry, prev_entry;
3427 vm_map_entry_t new_entry, stack_entry;
3428 struct vmspace *vm = p->p_vmspace;
3429 vm_map_t map = &vm->vm_map;
3432 size_t grow_amount, max_grow;
3433 rlim_t lmemlim, stacklim, vmemlim;
3434 int is_procstack, rv;
3445 lmemlim = lim_cur(p, RLIMIT_MEMLOCK);
3446 stacklim = lim_cur(p, RLIMIT_STACK);
3447 vmemlim = lim_cur(p, RLIMIT_VMEM);
3450 vm_map_lock_read(map);
3452 /* If addr is already in the entry range, no need to grow.*/
3453 if (vm_map_lookup_entry(map, addr, &prev_entry)) {
3454 vm_map_unlock_read(map);
3455 return (KERN_SUCCESS);
3458 next_entry = prev_entry->next;
3459 if (!(prev_entry->eflags & MAP_ENTRY_GROWS_UP)) {
3461 * This entry does not grow upwards. Since the address lies
3462 * beyond this entry, the next entry (if one exists) has to
3463 * be a downward growable entry. The entry list header is
3464 * never a growable entry, so it suffices to check the flags.
3466 if (!(next_entry->eflags & MAP_ENTRY_GROWS_DOWN)) {
3467 vm_map_unlock_read(map);
3468 return (KERN_SUCCESS);
3470 stack_entry = next_entry;
3473 * This entry grows upward. If the next entry does not at
3474 * least grow downwards, this is the entry we need to grow.
3475 * otherwise we have two possible choices and we have to
3478 if (next_entry->eflags & MAP_ENTRY_GROWS_DOWN) {
3480 * We have two choices; grow the entry closest to
3481 * the address to minimize the amount of growth.
3483 if (addr - prev_entry->end <= next_entry->start - addr)
3484 stack_entry = prev_entry;
3486 stack_entry = next_entry;
3488 stack_entry = prev_entry;
3491 if (stack_entry == next_entry) {
3492 KASSERT(stack_entry->eflags & MAP_ENTRY_GROWS_DOWN, ("foo"));
3493 KASSERT(addr < stack_entry->start, ("foo"));
3494 end = (prev_entry != &map->header) ? prev_entry->end :
3495 stack_entry->start - stack_entry->avail_ssize;
3496 grow_amount = roundup(stack_entry->start - addr, PAGE_SIZE);
3497 max_grow = stack_entry->start - end;
3499 KASSERT(stack_entry->eflags & MAP_ENTRY_GROWS_UP, ("foo"));
3500 KASSERT(addr >= stack_entry->end, ("foo"));
3501 end = (next_entry != &map->header) ? next_entry->start :
3502 stack_entry->end + stack_entry->avail_ssize;
3503 grow_amount = roundup(addr + 1 - stack_entry->end, PAGE_SIZE);
3504 max_grow = end - stack_entry->end;
3507 if (grow_amount > stack_entry->avail_ssize) {
3508 vm_map_unlock_read(map);
3509 return (KERN_NO_SPACE);
3513 * If there is no longer enough space between the entries nogo, and
3514 * adjust the available space. Note: this should only happen if the
3515 * user has mapped into the stack area after the stack was created,
3516 * and is probably an error.
3518 * This also effectively destroys any guard page the user might have
3519 * intended by limiting the stack size.
3521 if (grow_amount + (stack_guard_page ? PAGE_SIZE : 0) > max_grow) {
3522 if (vm_map_lock_upgrade(map))
3525 stack_entry->avail_ssize = max_grow;
3528 return (KERN_NO_SPACE);
3531 is_procstack = (addr >= (vm_offset_t)vm->vm_maxsaddr) ? 1 : 0;
3534 * If this is the main process stack, see if we're over the stack
3537 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > stacklim)) {
3538 vm_map_unlock_read(map);
3539 return (KERN_NO_SPACE);
3544 racct_set(p, RACCT_STACK, ctob(vm->vm_ssize) + grow_amount)) {
3546 vm_map_unlock_read(map);
3547 return (KERN_NO_SPACE);
3552 /* Round up the grow amount modulo sgrowsiz */
3553 growsize = sgrowsiz;
3554 grow_amount = roundup(grow_amount, growsize);
3555 if (grow_amount > stack_entry->avail_ssize)
3556 grow_amount = stack_entry->avail_ssize;
3557 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > stacklim)) {
3558 grow_amount = trunc_page((vm_size_t)stacklim) -
3563 limit = racct_get_available(p, RACCT_STACK);
3565 if (is_procstack && (ctob(vm->vm_ssize) + grow_amount > limit))
3566 grow_amount = limit - ctob(vm->vm_ssize);
3568 if (!old_mlock && map->flags & MAP_WIREFUTURE) {
3569 if (ptoa(pmap_wired_count(map->pmap)) + grow_amount > lmemlim) {
3570 vm_map_unlock_read(map);
3576 if (racct_set(p, RACCT_MEMLOCK,
3577 ptoa(pmap_wired_count(map->pmap)) + grow_amount)) {
3579 vm_map_unlock_read(map);
3586 /* If we would blow our VMEM resource limit, no go */
3587 if (map->size + grow_amount > vmemlim) {
3588 vm_map_unlock_read(map);
3594 if (racct_set(p, RACCT_VMEM, map->size + grow_amount)) {
3596 vm_map_unlock_read(map);
3603 if (vm_map_lock_upgrade(map))
3606 if (stack_entry == next_entry) {
3610 /* Get the preliminary new entry start value */
3611 addr = stack_entry->start - grow_amount;
3614 * If this puts us into the previous entry, cut back our
3615 * growth to the available space. Also, see the note above.
3618 stack_entry->avail_ssize = max_grow;
3620 if (stack_guard_page)
3624 rv = vm_map_insert(map, NULL, 0, addr, stack_entry->start,
3625 next_entry->protection, next_entry->max_protection, 0);
3627 /* Adjust the available stack space by the amount we grew. */
3628 if (rv == KERN_SUCCESS) {
3629 if (prev_entry != &map->header)
3630 vm_map_clip_end(map, prev_entry, addr);
3631 new_entry = prev_entry->next;
3632 KASSERT(new_entry == stack_entry->prev, ("foo"));
3633 KASSERT(new_entry->end == stack_entry->start, ("foo"));
3634 KASSERT(new_entry->start == addr, ("foo"));
3635 grow_amount = new_entry->end - new_entry->start;
3636 new_entry->avail_ssize = stack_entry->avail_ssize -
3638 stack_entry->eflags &= ~MAP_ENTRY_GROWS_DOWN;
3639 new_entry->eflags |= MAP_ENTRY_GROWS_DOWN;
3645 addr = stack_entry->end + grow_amount;
3648 * If this puts us into the next entry, cut back our growth
3649 * to the available space. Also, see the note above.
3652 stack_entry->avail_ssize = end - stack_entry->end;
3654 if (stack_guard_page)
3658 grow_amount = addr - stack_entry->end;
3659 cred = stack_entry->cred;
3660 if (cred == NULL && stack_entry->object.vm_object != NULL)
3661 cred = stack_entry->object.vm_object->cred;
3662 if (cred != NULL && !swap_reserve_by_cred(grow_amount, cred))
3664 /* Grow the underlying object if applicable. */
3665 else if (stack_entry->object.vm_object == NULL ||
3666 vm_object_coalesce(stack_entry->object.vm_object,
3667 stack_entry->offset,
3668 (vm_size_t)(stack_entry->end - stack_entry->start),
3669 (vm_size_t)grow_amount, cred != NULL)) {
3670 map->size += (addr - stack_entry->end);
3671 /* Update the current entry. */
3672 stack_entry->end = addr;
3673 stack_entry->avail_ssize -= grow_amount;
3674 vm_map_entry_resize_free(map, stack_entry);
3677 if (next_entry != &map->header)
3678 vm_map_clip_start(map, next_entry, addr);
3683 if (rv == KERN_SUCCESS && is_procstack)
3684 vm->vm_ssize += btoc(grow_amount);
3689 * Heed the MAP_WIREFUTURE flag if it was set for this process.
3691 if (rv == KERN_SUCCESS && (map->flags & MAP_WIREFUTURE)) {
3693 (stack_entry == next_entry) ? addr : addr - grow_amount,
3694 (stack_entry == next_entry) ? stack_entry->start : addr,
3695 (p->p_flag & P_SYSTEM)
3696 ? VM_MAP_WIRE_SYSTEM|VM_MAP_WIRE_NOHOLES
3697 : VM_MAP_WIRE_USER|VM_MAP_WIRE_NOHOLES);
3702 if (rv != KERN_SUCCESS) {
3704 error = racct_set(p, RACCT_VMEM, map->size);
3705 KASSERT(error == 0, ("decreasing RACCT_VMEM failed"));
3707 error = racct_set(p, RACCT_MEMLOCK,
3708 ptoa(pmap_wired_count(map->pmap)));
3709 KASSERT(error == 0, ("decreasing RACCT_MEMLOCK failed"));
3711 error = racct_set(p, RACCT_STACK, ctob(vm->vm_ssize));
3712 KASSERT(error == 0, ("decreasing RACCT_STACK failed"));
3721 * Unshare the specified VM space for exec. If other processes are
3722 * mapped to it, then create a new one. The new vmspace is null.
3725 vmspace_exec(struct proc *p, vm_offset_t minuser, vm_offset_t maxuser)
3727 struct vmspace *oldvmspace = p->p_vmspace;
3728 struct vmspace *newvmspace;
3730 newvmspace = vmspace_alloc(minuser, maxuser);
3731 if (newvmspace == NULL)
3733 newvmspace->vm_swrss = oldvmspace->vm_swrss;
3735 * This code is written like this for prototype purposes. The
3736 * goal is to avoid running down the vmspace here, but let the
3737 * other process's that are still using the vmspace to finally
3738 * run it down. Even though there is little or no chance of blocking
3739 * here, it is a good idea to keep this form for future mods.
3741 PROC_VMSPACE_LOCK(p);
3742 p->p_vmspace = newvmspace;
3743 PROC_VMSPACE_UNLOCK(p);
3744 if (p == curthread->td_proc)
3745 pmap_activate(curthread);
3746 vmspace_free(oldvmspace);
3751 * Unshare the specified VM space for forcing COW. This
3752 * is called by rfork, for the (RFMEM|RFPROC) == 0 case.
3755 vmspace_unshare(struct proc *p)
3757 struct vmspace *oldvmspace = p->p_vmspace;
3758 struct vmspace *newvmspace;
3759 vm_ooffset_t fork_charge;
3761 if (oldvmspace->vm_refcnt == 1)
3764 newvmspace = vmspace_fork(oldvmspace, &fork_charge);
3765 if (newvmspace == NULL)
3767 if (!swap_reserve_by_cred(fork_charge, p->p_ucred)) {
3768 vmspace_free(newvmspace);
3771 PROC_VMSPACE_LOCK(p);
3772 p->p_vmspace = newvmspace;
3773 PROC_VMSPACE_UNLOCK(p);
3774 if (p == curthread->td_proc)
3775 pmap_activate(curthread);
3776 vmspace_free(oldvmspace);
3783 * Finds the VM object, offset, and
3784 * protection for a given virtual address in the
3785 * specified map, assuming a page fault of the
3788 * Leaves the map in question locked for read; return
3789 * values are guaranteed until a vm_map_lookup_done
3790 * call is performed. Note that the map argument
3791 * is in/out; the returned map must be used in
3792 * the call to vm_map_lookup_done.
3794 * A handle (out_entry) is returned for use in
3795 * vm_map_lookup_done, to make that fast.
3797 * If a lookup is requested with "write protection"
3798 * specified, the map may be changed to perform virtual
3799 * copying operations, although the data referenced will
3803 vm_map_lookup(vm_map_t *var_map, /* IN/OUT */
3805 vm_prot_t fault_typea,
3806 vm_map_entry_t *out_entry, /* OUT */
3807 vm_object_t *object, /* OUT */
3808 vm_pindex_t *pindex, /* OUT */
3809 vm_prot_t *out_prot, /* OUT */
3810 boolean_t *wired) /* OUT */
3812 vm_map_entry_t entry;
3813 vm_map_t map = *var_map;
3815 vm_prot_t fault_type = fault_typea;
3816 vm_object_t eobject;
3822 vm_map_lock_read(map);
3825 * Lookup the faulting address.
3827 if (!vm_map_lookup_entry(map, vaddr, out_entry)) {
3828 vm_map_unlock_read(map);
3829 return (KERN_INVALID_ADDRESS);
3837 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
3838 vm_map_t old_map = map;
3840 *var_map = map = entry->object.sub_map;
3841 vm_map_unlock_read(old_map);
3846 * Check whether this task is allowed to have this page.
3848 prot = entry->protection;
3849 fault_type &= (VM_PROT_READ|VM_PROT_WRITE|VM_PROT_EXECUTE);
3850 if ((fault_type & prot) != fault_type || prot == VM_PROT_NONE) {
3851 vm_map_unlock_read(map);
3852 return (KERN_PROTECTION_FAILURE);
3854 if ((entry->eflags & MAP_ENTRY_USER_WIRED) &&
3855 (entry->eflags & MAP_ENTRY_COW) &&
3856 (fault_type & VM_PROT_WRITE)) {
3857 vm_map_unlock_read(map);
3858 return (KERN_PROTECTION_FAILURE);
3860 if ((fault_typea & VM_PROT_COPY) != 0 &&
3861 (entry->max_protection & VM_PROT_WRITE) == 0 &&
3862 (entry->eflags & MAP_ENTRY_COW) == 0) {
3863 vm_map_unlock_read(map);
3864 return (KERN_PROTECTION_FAILURE);
3868 * If this page is not pageable, we have to get it for all possible
3871 *wired = (entry->wired_count != 0);
3873 fault_type = entry->protection;
3874 size = entry->end - entry->start;
3876 * If the entry was copy-on-write, we either ...
3878 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) {
3880 * If we want to write the page, we may as well handle that
3881 * now since we've got the map locked.
3883 * If we don't need to write the page, we just demote the
3884 * permissions allowed.
3886 if ((fault_type & VM_PROT_WRITE) != 0 ||
3887 (fault_typea & VM_PROT_COPY) != 0) {
3889 * Make a new object, and place it in the object
3890 * chain. Note that no new references have appeared
3891 * -- one just moved from the map to the new
3894 if (vm_map_lock_upgrade(map))
3897 if (entry->cred == NULL) {
3899 * The debugger owner is charged for
3902 cred = curthread->td_ucred;
3904 if (!swap_reserve_by_cred(size, cred)) {
3907 return (KERN_RESOURCE_SHORTAGE);
3911 vm_object_shadow(&entry->object.vm_object,
3912 &entry->offset, size);
3913 entry->eflags &= ~MAP_ENTRY_NEEDS_COPY;
3914 eobject = entry->object.vm_object;
3915 if (eobject->cred != NULL) {
3917 * The object was not shadowed.
3919 swap_release_by_cred(size, entry->cred);
3920 crfree(entry->cred);
3922 } else if (entry->cred != NULL) {
3923 VM_OBJECT_LOCK(eobject);
3924 eobject->cred = entry->cred;
3925 eobject->charge = size;
3926 VM_OBJECT_UNLOCK(eobject);
3930 vm_map_lock_downgrade(map);
3933 * We're attempting to read a copy-on-write page --
3934 * don't allow writes.
3936 prot &= ~VM_PROT_WRITE;
3941 * Create an object if necessary.
3943 if (entry->object.vm_object == NULL &&
3945 if (vm_map_lock_upgrade(map))
3947 entry->object.vm_object = vm_object_allocate(OBJT_DEFAULT,
3950 if (entry->cred != NULL) {
3951 VM_OBJECT_LOCK(entry->object.vm_object);
3952 entry->object.vm_object->cred = entry->cred;
3953 entry->object.vm_object->charge = size;
3954 VM_OBJECT_UNLOCK(entry->object.vm_object);
3957 vm_map_lock_downgrade(map);
3961 * Return the object/offset from this entry. If the entry was
3962 * copy-on-write or empty, it has been fixed up.
3964 *pindex = OFF_TO_IDX((vaddr - entry->start) + entry->offset);
3965 *object = entry->object.vm_object;
3968 return (KERN_SUCCESS);
3972 * vm_map_lookup_locked:
3974 * Lookup the faulting address. A version of vm_map_lookup that returns
3975 * KERN_FAILURE instead of blocking on map lock or memory allocation.
3978 vm_map_lookup_locked(vm_map_t *var_map, /* IN/OUT */
3980 vm_prot_t fault_typea,
3981 vm_map_entry_t *out_entry, /* OUT */
3982 vm_object_t *object, /* OUT */
3983 vm_pindex_t *pindex, /* OUT */
3984 vm_prot_t *out_prot, /* OUT */
3985 boolean_t *wired) /* OUT */
3987 vm_map_entry_t entry;
3988 vm_map_t map = *var_map;
3990 vm_prot_t fault_type = fault_typea;
3993 * Lookup the faulting address.
3995 if (!vm_map_lookup_entry(map, vaddr, out_entry))
3996 return (KERN_INVALID_ADDRESS);
4001 * Fail if the entry refers to a submap.
4003 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
4004 return (KERN_FAILURE);
4007 * Check whether this task is allowed to have this page.
4009 prot = entry->protection;
4010 fault_type &= VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE;
4011 if ((fault_type & prot) != fault_type)
4012 return (KERN_PROTECTION_FAILURE);
4013 if ((entry->eflags & MAP_ENTRY_USER_WIRED) &&
4014 (entry->eflags & MAP_ENTRY_COW) &&
4015 (fault_type & VM_PROT_WRITE))
4016 return (KERN_PROTECTION_FAILURE);
4019 * If this page is not pageable, we have to get it for all possible
4022 *wired = (entry->wired_count != 0);
4024 fault_type = entry->protection;
4026 if (entry->eflags & MAP_ENTRY_NEEDS_COPY) {
4028 * Fail if the entry was copy-on-write for a write fault.
4030 if (fault_type & VM_PROT_WRITE)
4031 return (KERN_FAILURE);
4033 * We're attempting to read a copy-on-write page --
4034 * don't allow writes.
4036 prot &= ~VM_PROT_WRITE;
4040 * Fail if an object should be created.
4042 if (entry->object.vm_object == NULL && !map->system_map)
4043 return (KERN_FAILURE);
4046 * Return the object/offset from this entry. If the entry was
4047 * copy-on-write or empty, it has been fixed up.
4049 *pindex = OFF_TO_IDX((vaddr - entry->start) + entry->offset);
4050 *object = entry->object.vm_object;
4053 return (KERN_SUCCESS);
4057 * vm_map_lookup_done:
4059 * Releases locks acquired by a vm_map_lookup
4060 * (according to the handle returned by that lookup).
4063 vm_map_lookup_done(vm_map_t map, vm_map_entry_t entry)
4066 * Unlock the main-level map
4068 vm_map_unlock_read(map);
4071 #include "opt_ddb.h"
4073 #include <sys/kernel.h>
4075 #include <ddb/ddb.h>
4078 * vm_map_print: [ debug ]
4080 DB_SHOW_COMMAND(map, vm_map_print)
4083 /* XXX convert args. */
4084 vm_map_t map = (vm_map_t)addr;
4085 boolean_t full = have_addr;
4087 vm_map_entry_t entry;
4089 db_iprintf("Task map %p: pmap=%p, nentries=%d, version=%u\n",
4091 (void *)map->pmap, map->nentries, map->timestamp);
4094 if (!full && db_indent)
4098 for (entry = map->header.next; entry != &map->header;
4099 entry = entry->next) {
4100 db_iprintf("map entry %p: start=%p, end=%p\n",
4101 (void *)entry, (void *)entry->start, (void *)entry->end);
4104 static char *inheritance_name[4] =
4105 {"share", "copy", "none", "donate_copy"};
4107 db_iprintf(" prot=%x/%x/%s",
4109 entry->max_protection,
4110 inheritance_name[(int)(unsigned char)entry->inheritance]);
4111 if (entry->wired_count != 0)
4112 db_printf(", wired");
4114 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP) {
4115 db_printf(", share=%p, offset=0x%jx\n",
4116 (void *)entry->object.sub_map,
4117 (uintmax_t)entry->offset);
4119 if ((entry->prev == &map->header) ||
4120 (entry->prev->object.sub_map !=
4121 entry->object.sub_map)) {
4123 vm_map_print((db_expr_t)(intptr_t)
4124 entry->object.sub_map,
4125 full, 0, (char *)0);
4129 if (entry->cred != NULL)
4130 db_printf(", ruid %d", entry->cred->cr_ruid);
4131 db_printf(", object=%p, offset=0x%jx",
4132 (void *)entry->object.vm_object,
4133 (uintmax_t)entry->offset);
4134 if (entry->object.vm_object && entry->object.vm_object->cred)
4135 db_printf(", obj ruid %d charge %jx",
4136 entry->object.vm_object->cred->cr_ruid,
4137 (uintmax_t)entry->object.vm_object->charge);
4138 if (entry->eflags & MAP_ENTRY_COW)
4139 db_printf(", copy (%s)",
4140 (entry->eflags & MAP_ENTRY_NEEDS_COPY) ? "needed" : "done");
4144 if ((entry->prev == &map->header) ||
4145 (entry->prev->object.vm_object !=
4146 entry->object.vm_object)) {
4148 vm_object_print((db_expr_t)(intptr_t)
4149 entry->object.vm_object,
4150 full, 0, (char *)0);
4162 DB_SHOW_COMMAND(procvm, procvm)
4167 p = (struct proc *) addr;
4172 db_printf("p = %p, vmspace = %p, map = %p, pmap = %p\n",
4173 (void *)p, (void *)p->p_vmspace, (void *)&p->p_vmspace->vm_map,
4174 (void *)vmspace_pmap(p->p_vmspace));
4176 vm_map_print((db_expr_t)(intptr_t)&p->p_vmspace->vm_map, 1, 0, NULL);