Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/vm/vm_contig.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /*- 2 * Copyright (c) 1991 Regents of the University of California. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * The Mach Operating System project at Carnegie-Mellon University. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 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. 19 * 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 30 * SUCH DAMAGE. 31 * 32 * from: @(#)vm_page.c 7.4 (Berkeley) 5/7/91 33 */ 34 35 /*- 36 * Copyright (c) 1987, 1990 Carnegie-Mellon University. 37 * All rights reserved. 38 * 39 * Authors: Avadis Tevanian, Jr., Michael Wayne Young 40 * 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. 46 * 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. 50 * 51 * Carnegie Mellon requests users of this software to return to 52 * 53 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU 54 * School of Computer Science 55 * Carnegie Mellon University 56 * Pittsburgh PA 15213-3890 57 * 58 * any improvements or extensions that they make and grant Carnegie the 59 * rights to redistribute these changes. 60 */ 61 62 #include <sys/cdefs.h> 63 __FBSDID("$FreeBSD: releng/8.3/sys/vm/vm_contig.c 228251 2011-12-04 02:06:12Z alc $"); 64 65 #include <sys/param.h> 66 #include <sys/systm.h> 67 #include <sys/lock.h> 68 #include <sys/malloc.h> 69 #include <sys/mount.h> 70 #include <sys/mutex.h> 71 #include <sys/proc.h> 72 #include <sys/kernel.h> 73 #include <sys/sysctl.h> 74 #include <sys/vmmeter.h> 75 #include <sys/vnode.h> 76 77 #include <vm/vm.h> 78 #include <vm/vm_param.h> 79 #include <vm/vm_kern.h> 80 #include <vm/pmap.h> 81 #include <vm/vm_map.h> 82 #include <vm/vm_object.h> 83 #include <vm/vm_page.h> 84 #include <vm/vm_pageout.h> 85 #include <vm/vm_pager.h> 86 #include <vm/vm_phys.h> 87 #include <vm/vm_extern.h> 88 89 static int 90 vm_contig_launder_page(vm_page_t m, vm_page_t *next) 91 { 92 vm_object_t object; 93 vm_page_t m_tmp; 94 struct vnode *vp; 95 struct mount *mp; 96 int vfslocked; 97 98 mtx_assert(&vm_page_queue_mtx, MA_OWNED); 99 object = m->object; 100 if (!VM_OBJECT_TRYLOCK(object) && 101 !vm_pageout_fallback_object_lock(m, next)) { 102 VM_OBJECT_UNLOCK(object); 103 return (EAGAIN); 104 } 105 if (vm_page_sleep_if_busy(m, TRUE, "vpctw0")) { 106 VM_OBJECT_UNLOCK(object); 107 vm_page_lock_queues(); 108 return (EBUSY); 109 } 110 vm_page_test_dirty(m); 111 if (m->dirty == 0 && m->hold_count == 0) 112 pmap_remove_all(m); 113 if (m->dirty) { 114 if ((object->flags & OBJ_DEAD) != 0) { 115 VM_OBJECT_UNLOCK(object); 116 return (EAGAIN); 117 } 118 if (object->type == OBJT_VNODE) { 119 vm_page_unlock_queues(); 120 vp = object->handle; 121 vm_object_reference_locked(object); 122 VM_OBJECT_UNLOCK(object); 123 (void) vn_start_write(vp, &mp, V_WAIT); 124 vfslocked = VFS_LOCK_GIANT(vp->v_mount); 125 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY); 126 VM_OBJECT_LOCK(object); 127 vm_object_page_clean(object, 0, 0, OBJPC_SYNC); 128 VM_OBJECT_UNLOCK(object); 129 VOP_UNLOCK(vp, 0); 130 VFS_UNLOCK_GIANT(vfslocked); 131 vm_object_deallocate(object); 132 vn_finished_write(mp); 133 vm_page_lock_queues(); 134 return (0); 135 } else if (object->type == OBJT_SWAP || 136 object->type == OBJT_DEFAULT) { 137 m_tmp = m; 138 vm_pageout_flush(&m_tmp, 1, VM_PAGER_PUT_SYNC, 0, NULL); 139 VM_OBJECT_UNLOCK(object); 140 return (0); 141 } 142 } else if (m->hold_count == 0) 143 vm_page_cache(m); 144 VM_OBJECT_UNLOCK(object); 145 return (0); 146 } 147 148 static int 149 vm_contig_launder(int queue, vm_paddr_t low, vm_paddr_t high) 150 { 151 vm_page_t m, next; 152 vm_paddr_t pa; 153 int error; 154 155 TAILQ_FOREACH_SAFE(m, &vm_page_queues[queue].pl, pageq, next) { 156 157 /* Skip marker pages */ 158 if ((m->flags & PG_MARKER) != 0) 159 continue; 160 161 pa = VM_PAGE_TO_PHYS(m); 162 if (pa < low || pa + PAGE_SIZE > high) 163 continue; 164 165 KASSERT(VM_PAGE_INQUEUE2(m, queue), 166 ("vm_contig_launder: page %p's queue is not %d", m, queue)); 167 error = vm_contig_launder_page(m, &next); 168 if (error == 0) 169 return (TRUE); 170 if (error == EBUSY) 171 return (FALSE); 172 } 173 return (FALSE); 174 } 175 176 /* 177 * Frees the given physically contiguous pages. 178 * 179 * N.B.: Any pages with PG_ZERO set must, in fact, be zero filled. 180 */ 181 static void 182 vm_page_release_contig(vm_page_t m, vm_pindex_t count) 183 { 184 185 while (count--) { 186 /* Leave PG_ZERO unchanged. */ 187 vm_page_free_toq(m); 188 m++; 189 } 190 } 191 192 /* 193 * Increase the number of cached pages. 194 */ 195 void 196 vm_contig_grow_cache(int tries, vm_paddr_t low, vm_paddr_t high) 197 { 198 int actl, actmax, inactl, inactmax; 199 200 vm_page_lock_queues(); 201 inactl = 0; 202 inactmax = tries < 1 ? 0 : cnt.v_inactive_count; 203 actl = 0; 204 actmax = tries < 2 ? 0 : cnt.v_active_count; 205 again: 206 if (inactl < inactmax && vm_contig_launder(PQ_INACTIVE, low, high)) { 207 inactl++; 208 goto again; 209 } 210 if (actl < actmax && vm_contig_launder(PQ_ACTIVE, low, high)) { 211 actl++; 212 goto again; 213 } 214 vm_page_unlock_queues(); 215 } 216 217 /* 218 * Allocates a region from the kernel address map and pages within the 219 * specified physical address range to the kernel object, creates a wired 220 * mapping from the region to these pages, and returns the region's starting 221 * virtual address. The allocated pages are not necessarily physically 222 * contiguous. If M_ZERO is specified through the given flags, then the pages 223 * are zeroed before they are mapped. 224 */ 225 vm_offset_t 226 kmem_alloc_attr(vm_map_t map, vm_size_t size, int flags, vm_paddr_t low, 227 vm_paddr_t high, vm_memattr_t memattr) 228 { 229 vm_object_t object = kernel_object; 230 vm_offset_t addr, i, offset; 231 vm_page_t m; 232 int tries; 233 234 size = round_page(size); 235 vm_map_lock(map); 236 if (vm_map_findspace(map, vm_map_min(map), size, &addr)) { 237 vm_map_unlock(map); 238 return (0); 239 } 240 offset = addr - VM_MIN_KERNEL_ADDRESS; 241 vm_object_reference(object); 242 vm_map_insert(map, object, offset, addr, addr + size, VM_PROT_ALL, 243 VM_PROT_ALL, 0); 244 VM_OBJECT_LOCK(object); 245 for (i = 0; i < size; i += PAGE_SIZE) { 246 tries = 0; 247 retry: 248 m = vm_phys_alloc_contig(1, low, high, PAGE_SIZE, 0); 249 if (m == NULL) { 250 if (tries < ((flags & M_NOWAIT) != 0 ? 1 : 3)) { 251 VM_OBJECT_UNLOCK(object); 252 vm_map_unlock(map); 253 vm_contig_grow_cache(tries, low, high); 254 vm_map_lock(map); 255 VM_OBJECT_LOCK(object); 256 tries++; 257 goto retry; 258 } 259 while (i != 0) { 260 i -= PAGE_SIZE; 261 m = vm_page_lookup(object, OFF_TO_IDX(offset + 262 i)); 263 vm_page_lock_queues(); 264 vm_page_free(m); 265 vm_page_unlock_queues(); 266 } 267 VM_OBJECT_UNLOCK(object); 268 vm_map_delete(map, addr, addr + size); 269 vm_map_unlock(map); 270 return (0); 271 } 272 if (memattr != VM_MEMATTR_DEFAULT) 273 pmap_page_set_memattr(m, memattr); 274 vm_page_insert(m, object, OFF_TO_IDX(offset + i)); 275 if ((flags & M_ZERO) && (m->flags & PG_ZERO) == 0) 276 pmap_zero_page(m); 277 m->valid = VM_PAGE_BITS_ALL; 278 } 279 VM_OBJECT_UNLOCK(object); 280 vm_map_unlock(map); 281 vm_map_wire(map, addr, addr + size, VM_MAP_WIRE_SYSTEM | 282 VM_MAP_WIRE_NOHOLES); 283 return (addr); 284 } 285 286 /* 287 * Allocates a region from the kernel address map, inserts the 288 * given physically contiguous pages into the kernel object, 289 * creates a wired mapping from the region to the pages, and 290 * returns the region's starting virtual address. If M_ZERO is 291 * specified through the given flags, then the pages are zeroed 292 * before they are mapped. 293 */ 294 static vm_offset_t 295 contigmapping(vm_map_t map, vm_size_t size, vm_page_t m, vm_memattr_t memattr, 296 int flags) 297 { 298 vm_object_t object = kernel_object; 299 vm_offset_t addr, tmp_addr; 300 301 vm_map_lock(map); 302 if (vm_map_findspace(map, vm_map_min(map), size, &addr)) { 303 vm_map_unlock(map); 304 return (0); 305 } 306 vm_object_reference(object); 307 vm_map_insert(map, object, addr - VM_MIN_KERNEL_ADDRESS, 308 addr, addr + size, VM_PROT_ALL, VM_PROT_ALL, 0); 309 vm_map_unlock(map); 310 VM_OBJECT_LOCK(object); 311 for (tmp_addr = addr; tmp_addr < addr + size; tmp_addr += PAGE_SIZE) { 312 if (memattr != VM_MEMATTR_DEFAULT) 313 pmap_page_set_memattr(m, memattr); 314 vm_page_insert(m, object, 315 OFF_TO_IDX(tmp_addr - VM_MIN_KERNEL_ADDRESS)); 316 if ((flags & M_ZERO) && (m->flags & PG_ZERO) == 0) 317 pmap_zero_page(m); 318 m->valid = VM_PAGE_BITS_ALL; 319 m++; 320 } 321 VM_OBJECT_UNLOCK(object); 322 vm_map_wire(map, addr, addr + size, 323 VM_MAP_WIRE_SYSTEM | VM_MAP_WIRE_NOHOLES); 324 return (addr); 325 } 326 327 void * 328 contigmalloc( 329 unsigned long size, /* should be size_t here and for malloc() */ 330 struct malloc_type *type, 331 int flags, 332 vm_paddr_t low, 333 vm_paddr_t high, 334 unsigned long alignment, 335 unsigned long boundary) 336 { 337 void *ret; 338 339 ret = (void *)kmem_alloc_contig(kernel_map, size, flags, low, high, 340 alignment, boundary, VM_MEMATTR_DEFAULT); 341 if (ret != NULL) 342 malloc_type_allocated(type, round_page(size)); 343 return (ret); 344 } 345 346 vm_offset_t 347 kmem_alloc_contig(vm_map_t map, vm_size_t size, int flags, vm_paddr_t low, 348 vm_paddr_t high, unsigned long alignment, unsigned long boundary, 349 vm_memattr_t memattr) 350 { 351 vm_offset_t ret; 352 vm_page_t pages; 353 unsigned long npgs; 354 int tries; 355 356 size = round_page(size); 357 npgs = size >> PAGE_SHIFT; 358 tries = 0; 359 retry: 360 pages = vm_phys_alloc_contig(npgs, low, high, alignment, boundary); 361 if (pages == NULL) { 362 if (tries < ((flags & M_NOWAIT) != 0 ? 1 : 3)) { 363 vm_contig_grow_cache(tries, low, high); 364 tries++; 365 goto retry; 366 } 367 ret = 0; 368 } else { 369 ret = contigmapping(map, size, pages, memattr, flags); 370 if (ret == 0) 371 vm_page_release_contig(pages, npgs); 372 } 373 return (ret); 374 } 375 376 void 377 contigfree(void *addr, unsigned long size, struct malloc_type *type) 378 { 379 380 kmem_free(kernel_map, (vm_offset_t)addr, size); 381 malloc_type_freed(type, round_page(size)); 382 }
Cache object: 054211da551380c250f332125729f952
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]