2 * Copyright (c) 1991 Regents of the University of California.
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_page.c 7.4 (Berkeley) 5/7/91
36 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
37 * All rights reserved.
39 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
41 * Permission to use, copy, modify and distribute this software and
42 * its documentation is hereby granted, provided that both the copyright
43 * notice and this permission notice appear in all copies of the
44 * software, derivative works or modified versions, and any portions
45 * thereof, and that both notices appear in supporting documentation.
47 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
48 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
49 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
51 * Carnegie Mellon requests users of this software to return to
53 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
54 * School of Computer Science
55 * Carnegie Mellon University
56 * Pittsburgh PA 15213-3890
58 * any improvements or extensions that they make and grant Carnegie the
59 * rights to redistribute these changes.
62 #include <sys/cdefs.h>
63 __FBSDID("$FreeBSD$");
65 #include <sys/param.h>
66 #include <sys/systm.h>
68 #include <sys/malloc.h>
69 #include <sys/mount.h>
70 #include <sys/mutex.h>
72 #include <sys/kernel.h>
73 #include <sys/linker_set.h>
74 #include <sys/sysctl.h>
75 #include <sys/vmmeter.h>
76 #include <sys/vnode.h>
79 #include <vm/vm_param.h>
80 #include <vm/vm_kern.h>
82 #include <vm/vm_map.h>
83 #include <vm/vm_object.h>
84 #include <vm/vm_page.h>
85 #include <vm/vm_pageout.h>
86 #include <vm/vm_pager.h>
87 #include <vm/vm_phys.h>
88 #include <vm/vm_extern.h>
91 vm_contig_launder_page(vm_page_t m, vm_page_t *next)
99 mtx_assert(&vm_page_queue_mtx, MA_OWNED);
101 if (!VM_OBJECT_TRYLOCK(object) &&
102 !vm_pageout_fallback_object_lock(m, next)) {
103 VM_OBJECT_UNLOCK(object);
106 if (vm_page_sleep_if_busy(m, TRUE, "vpctw0")) {
107 VM_OBJECT_UNLOCK(object);
108 vm_page_lock_queues();
111 vm_page_test_dirty(m);
112 if (m->dirty == 0 && m->hold_count == 0)
115 if ((object->flags & OBJ_DEAD) != 0) {
116 VM_OBJECT_UNLOCK(object);
119 if (object->type == OBJT_VNODE) {
120 vm_page_unlock_queues();
122 vm_object_reference_locked(object);
123 VM_OBJECT_UNLOCK(object);
124 (void) vn_start_write(vp, &mp, V_WAIT);
125 vfslocked = VFS_LOCK_GIANT(vp->v_mount);
126 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, curthread);
127 VM_OBJECT_LOCK(object);
128 vm_object_page_clean(object, 0, 0, OBJPC_SYNC);
129 VM_OBJECT_UNLOCK(object);
130 VOP_UNLOCK(vp, 0, curthread);
131 VFS_UNLOCK_GIANT(vfslocked);
132 vm_object_deallocate(object);
133 vn_finished_write(mp);
134 vm_page_lock_queues();
136 } else if (object->type == OBJT_SWAP ||
137 object->type == OBJT_DEFAULT) {
139 vm_pageout_flush(&m_tmp, 1, VM_PAGER_PUT_SYNC);
140 VM_OBJECT_UNLOCK(object);
143 } else if (m->hold_count == 0)
145 VM_OBJECT_UNLOCK(object);
150 vm_contig_launder(int queue)
155 TAILQ_FOREACH_SAFE(m, &vm_page_queues[queue].pl, pageq, next) {
157 /* Skip marker pages */
158 if ((m->flags & PG_MARKER) != 0)
161 KASSERT(VM_PAGE_INQUEUE2(m, queue),
162 ("vm_contig_launder: page %p's queue is not %d", m, queue));
163 error = vm_contig_launder_page(m, &next);
173 * Frees the given physically contiguous pages.
175 * N.B.: Any pages with PG_ZERO set must, in fact, be zero filled.
178 vm_page_release_contig(vm_page_t m, vm_pindex_t count)
182 /* Leave PG_ZERO unchanged. */
189 * Allocates a region from the kernel address map, inserts the
190 * given physically contiguous pages into the kernel object,
191 * creates a wired mapping from the region to the pages, and
192 * returns the region's starting virtual address. If M_ZERO is
193 * specified through the given flags, then the pages are zeroed
194 * before they are mapped.
197 contigmapping(vm_page_t m, vm_pindex_t npages, int flags)
199 vm_object_t object = kernel_object;
200 vm_map_t map = kernel_map;
201 vm_offset_t addr, tmp_addr;
205 if (vm_map_findspace(map, vm_map_min(map), npages << PAGE_SHIFT, &addr)
210 vm_object_reference(object);
211 vm_map_insert(map, object, addr - VM_MIN_KERNEL_ADDRESS,
212 addr, addr + (npages << PAGE_SHIFT), VM_PROT_ALL, VM_PROT_ALL, 0);
215 VM_OBJECT_LOCK(object);
216 for (i = 0; i < npages; i++) {
217 vm_page_insert(&m[i], object,
218 OFF_TO_IDX(tmp_addr - VM_MIN_KERNEL_ADDRESS));
219 if ((flags & M_ZERO) && !(m[i].flags & PG_ZERO))
220 pmap_zero_page(&m[i]);
221 tmp_addr += PAGE_SIZE;
223 VM_OBJECT_UNLOCK(object);
224 vm_map_wire(map, addr, addr + (npages << PAGE_SHIFT),
225 VM_MAP_WIRE_SYSTEM | VM_MAP_WIRE_NOHOLES);
226 return ((void *)addr);
231 unsigned long size, /* should be size_t here and for malloc() */
232 struct malloc_type *type,
236 unsigned long alignment,
237 unsigned long boundary)
242 int actl, actmax, inactl, inactmax, tries;
244 npgs = round_page(size) >> PAGE_SHIFT;
247 pages = vm_phys_alloc_contig(npgs, low, high, alignment, boundary);
249 if (tries < ((flags & M_NOWAIT) != 0 ? 1 : 3)) {
250 vm_page_lock_queues();
252 inactmax = tries < 1 ? 0 : cnt.v_inactive_count;
254 actmax = tries < 2 ? 0 : cnt.v_active_count;
256 if (inactl < inactmax &&
257 vm_contig_launder(PQ_INACTIVE)) {
262 vm_contig_launder(PQ_ACTIVE)) {
266 vm_page_unlock_queues();
272 ret = contigmapping(pages, npgs, flags);
274 vm_page_release_contig(pages, npgs);
276 malloc_type_allocated(type, npgs << PAGE_SHIFT);
282 contigfree(void *addr, unsigned long size, struct malloc_type *type)
286 npgs = round_page(size) >> PAGE_SHIFT;
287 kmem_free(kernel_map, (vm_offset_t)addr, size);
288 malloc_type_freed(type, npgs << PAGE_SHIFT);