1 /*-
2 * SPDX-License-Identifier: (BSD-3-Clause AND MIT-CMU)
3 *
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * The Mach Operating System project at Carnegie-Mellon University.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * from: @(#)vm_kern.c 8.3 (Berkeley) 1/12/94
35 *
36 *
37 * Copyright (c) 1987, 1990 Carnegie-Mellon University.
38 * All rights reserved.
39 *
40 * Authors: Avadis Tevanian, Jr., Michael Wayne Young
41 *
42 * Permission to use, copy, modify and distribute this software and
43 * its documentation is hereby granted, provided that both the copyright
44 * notice and this permission notice appear in all copies of the
45 * software, derivative works or modified versions, and any portions
46 * thereof, and that both notices appear in supporting documentation.
47 *
48 * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
49 * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
50 * FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
51 *
52 * Carnegie Mellon requests users of this software to return to
53 *
54 * Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
55 * School of Computer Science
56 * Carnegie Mellon University
57 * Pittsburgh PA 15213-3890
58 *
59 * any improvements or extensions that they make and grant Carnegie the
60 * rights to redistribute these changes.
61 */
62
63 /*
64 * Kernel memory management.
65 */
66
67 #include <sys/cdefs.h>
68 #include "opt_vm.h"
69
70 #include <sys/param.h>
71 #include <sys/systm.h>
72 #include <sys/asan.h>
73 #include <sys/domainset.h>
74 #include <sys/eventhandler.h>
75 #include <sys/kernel.h>
76 #include <sys/lock.h>
77 #include <sys/malloc.h>
78 #include <sys/proc.h>
79 #include <sys/rwlock.h>
80 #include <sys/smp.h>
81 #include <sys/sysctl.h>
82 #include <sys/vmem.h>
83 #include <sys/vmmeter.h>
84
85 #include <vm/vm.h>
86 #include <vm/vm_param.h>
87 #include <vm/vm_domainset.h>
88 #include <vm/vm_kern.h>
89 #include <vm/pmap.h>
90 #include <vm/vm_map.h>
91 #include <vm/vm_object.h>
92 #include <vm/vm_page.h>
93 #include <vm/vm_pageout.h>
94 #include <vm/vm_pagequeue.h>
95 #include <vm/vm_phys.h>
96 #include <vm/vm_radix.h>
97 #include <vm/vm_extern.h>
98 #include <vm/uma.h>
99
100 struct vm_map kernel_map_store;
101 struct vm_map exec_map_store;
102 struct vm_map pipe_map_store;
103
104 const void *zero_region;
105 CTASSERT((ZERO_REGION_SIZE & PAGE_MASK) == 0);
106
107 /* NB: Used by kernel debuggers. */
108 const u_long vm_maxuser_address = VM_MAXUSER_ADDRESS;
109
110 u_int exec_map_entry_size;
111 u_int exec_map_entries;
112
113 SYSCTL_ULONG(_vm, OID_AUTO, min_kernel_address, CTLFLAG_RD,
114 SYSCTL_NULL_ULONG_PTR, VM_MIN_KERNEL_ADDRESS, "Min kernel address");
115
116 SYSCTL_ULONG(_vm, OID_AUTO, max_kernel_address, CTLFLAG_RD,
117 #if defined(__arm__)
118 &vm_max_kernel_address, 0,
119 #else
120 SYSCTL_NULL_ULONG_PTR, VM_MAX_KERNEL_ADDRESS,
121 #endif
122 "Max kernel address");
123
124 #if VM_NRESERVLEVEL > 0
125 #define KVA_QUANTUM_SHIFT (VM_LEVEL_0_ORDER + PAGE_SHIFT)
126 #else
127 /* On non-superpage architectures we want large import sizes. */
128 #define KVA_QUANTUM_SHIFT (8 + PAGE_SHIFT)
129 #endif
130 #define KVA_QUANTUM (1ul << KVA_QUANTUM_SHIFT)
131 #define KVA_NUMA_IMPORT_QUANTUM (KVA_QUANTUM * 128)
132
133 extern void uma_startup2(void);
134
135 /*
136 * kva_alloc:
137 *
138 * Allocate a virtual address range with no underlying object and
139 * no initial mapping to physical memory. Any mapping from this
140 * range to physical memory must be explicitly created prior to
141 * its use, typically with pmap_qenter(). Any attempt to create
142 * a mapping on demand through vm_fault() will result in a panic.
143 */
144 vm_offset_t
kva_alloc(vm_size_t size)145 kva_alloc(vm_size_t size)
146 {
147 vm_offset_t addr;
148
149 size = round_page(size);
150 if (vmem_xalloc(kernel_arena, size, 0, 0, 0, VMEM_ADDR_MIN,
151 VMEM_ADDR_MAX, M_BESTFIT | M_NOWAIT, &addr))
152 return (0);
153
154 return (addr);
155 }
156
157 /*
158 * kva_alloc_aligned:
159 *
160 * Allocate a virtual address range as in kva_alloc where the base
161 * address is aligned to align.
162 */
163 vm_offset_t
kva_alloc_aligned(vm_size_t size,vm_size_t align)164 kva_alloc_aligned(vm_size_t size, vm_size_t align)
165 {
166 vm_offset_t addr;
167
168 TSENTER();
169 size = round_page(size);
170 if (vmem_xalloc(kernel_arena, size, align, 0, 0, VMEM_ADDR_MIN,
171 VMEM_ADDR_MAX, M_BESTFIT | M_NOWAIT, &addr))
172 return (0);
173 TSEXIT();
174
175 return (addr);
176 }
177
178 /*
179 * kva_free:
180 *
181 * Release a region of kernel virtual memory allocated
182 * with kva_alloc, and return the physical pages
183 * associated with that region.
184 *
185 * This routine may not block on kernel maps.
186 */
187 void
kva_free(vm_offset_t addr,vm_size_t size)188 kva_free(vm_offset_t addr, vm_size_t size)
189 {
190
191 size = round_page(size);
192 vmem_xfree(kernel_arena, addr, size);
193 }
194
195 static vm_page_t
kmem_alloc_contig_pages(vm_object_t object,vm_pindex_t pindex,int domain,int pflags,u_long npages,vm_paddr_t low,vm_paddr_t high,u_long alignment,vm_paddr_t boundary,vm_memattr_t memattr)196 kmem_alloc_contig_pages(vm_object_t object, vm_pindex_t pindex, int domain,
197 int pflags, u_long npages, vm_paddr_t low, vm_paddr_t high,
198 u_long alignment, vm_paddr_t boundary, vm_memattr_t memattr)
199 {
200 vm_page_t m;
201 int tries;
202 bool wait, reclaim;
203
204 VM_OBJECT_ASSERT_WLOCKED(object);
205
206 /* Disallow an invalid combination of flags. */
207 MPASS((pflags & (VM_ALLOC_WAITOK | VM_ALLOC_NORECLAIM)) !=
208 (VM_ALLOC_WAITOK | VM_ALLOC_NORECLAIM));
209
210 wait = (pflags & VM_ALLOC_WAITOK) != 0;
211 reclaim = (pflags & VM_ALLOC_NORECLAIM) == 0;
212 pflags &= ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL);
213 pflags |= VM_ALLOC_NOWAIT;
214 for (tries = wait ? 3 : 1;; tries--) {
215 m = vm_page_alloc_contig_domain(object, pindex, domain, pflags,
216 npages, low, high, alignment, boundary, memattr);
217 if (m != NULL || tries == 0 || !reclaim)
218 break;
219
220 VM_OBJECT_WUNLOCK(object);
221 if (!vm_page_reclaim_contig_domain(domain, pflags, npages,
222 low, high, alignment, boundary) && wait)
223 vm_wait_domain(domain);
224 VM_OBJECT_WLOCK(object);
225 }
226 return (m);
227 }
228
229 /*
230 * Allocates a region from the kernel address map and physical pages
231 * within the specified address range to the kernel object. Creates a
232 * wired mapping from this region to these pages, and returns the
233 * region's starting virtual address. The allocated pages are not
234 * necessarily physically contiguous. If M_ZERO is specified through the
235 * given flags, then the pages are zeroed before they are mapped.
236 */
237 static vm_offset_t
kmem_alloc_attr_domain(int domain,vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,vm_memattr_t memattr)238 kmem_alloc_attr_domain(int domain, vm_size_t size, int flags, vm_paddr_t low,
239 vm_paddr_t high, vm_memattr_t memattr)
240 {
241 vmem_t *vmem;
242 vm_object_t object;
243 vm_offset_t addr, i, offset;
244 vm_page_t m;
245 vm_size_t asize;
246 int pflags;
247 vm_prot_t prot;
248
249 object = kernel_object;
250 asize = round_page(size);
251 vmem = vm_dom[domain].vmd_kernel_arena;
252 if (vmem_alloc(vmem, asize, M_BESTFIT | flags, &addr))
253 return (0);
254 offset = addr - VM_MIN_KERNEL_ADDRESS;
255 pflags = malloc2vm_flags(flags) | VM_ALLOC_WIRED;
256 prot = (flags & M_EXEC) != 0 ? VM_PROT_ALL : VM_PROT_RW;
257 VM_OBJECT_WLOCK(object);
258 for (i = 0; i < asize; i += PAGE_SIZE) {
259 m = kmem_alloc_contig_pages(object, atop(offset + i),
260 domain, pflags, 1, low, high, PAGE_SIZE, 0, memattr);
261 if (m == NULL) {
262 VM_OBJECT_WUNLOCK(object);
263 kmem_unback(object, addr, i);
264 vmem_free(vmem, addr, asize);
265 return (0);
266 }
267 KASSERT(vm_page_domain(m) == domain,
268 ("kmem_alloc_attr_domain: Domain mismatch %d != %d",
269 vm_page_domain(m), domain));
270 if ((flags & M_ZERO) && (m->flags & PG_ZERO) == 0)
271 pmap_zero_page(m);
272 vm_page_valid(m);
273 pmap_enter(kernel_pmap, addr + i, m, prot,
274 prot | PMAP_ENTER_WIRED, 0);
275 }
276 VM_OBJECT_WUNLOCK(object);
277 kasan_mark((void *)addr, size, asize, KASAN_KMEM_REDZONE);
278 return (addr);
279 }
280
281 vm_offset_t
kmem_alloc_attr(vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,vm_memattr_t memattr)282 kmem_alloc_attr(vm_size_t size, int flags, vm_paddr_t low, vm_paddr_t high,
283 vm_memattr_t memattr)
284 {
285
286 return (kmem_alloc_attr_domainset(DOMAINSET_RR(), size, flags, low,
287 high, memattr));
288 }
289
290 vm_offset_t
kmem_alloc_attr_domainset(struct domainset * ds,vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,vm_memattr_t memattr)291 kmem_alloc_attr_domainset(struct domainset *ds, vm_size_t size, int flags,
292 vm_paddr_t low, vm_paddr_t high, vm_memattr_t memattr)
293 {
294 struct vm_domainset_iter di;
295 vm_offset_t addr;
296 int domain;
297
298 vm_domainset_iter_policy_init(&di, ds, &domain, &flags);
299 do {
300 addr = kmem_alloc_attr_domain(domain, size, flags, low, high,
301 memattr);
302 if (addr != 0)
303 break;
304 } while (vm_domainset_iter_policy(&di, &domain) == 0);
305
306 return (addr);
307 }
308
309 /*
310 * Allocates a region from the kernel address map and physically
311 * contiguous pages within the specified address range to the kernel
312 * object. Creates a wired mapping from this region to these pages, and
313 * returns the region's starting virtual address. If M_ZERO is specified
314 * through the given flags, then the pages are zeroed before they are
315 * mapped.
316 */
317 static vm_offset_t
kmem_alloc_contig_domain(int domain,vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,u_long alignment,vm_paddr_t boundary,vm_memattr_t memattr)318 kmem_alloc_contig_domain(int domain, vm_size_t size, int flags, vm_paddr_t low,
319 vm_paddr_t high, u_long alignment, vm_paddr_t boundary,
320 vm_memattr_t memattr)
321 {
322 vmem_t *vmem;
323 vm_object_t object;
324 vm_offset_t addr, offset, tmp;
325 vm_page_t end_m, m;
326 vm_size_t asize;
327 u_long npages;
328 int pflags;
329
330 object = kernel_object;
331 asize = round_page(size);
332 vmem = vm_dom[domain].vmd_kernel_arena;
333 if (vmem_alloc(vmem, asize, flags | M_BESTFIT, &addr))
334 return (0);
335 offset = addr - VM_MIN_KERNEL_ADDRESS;
336 pflags = malloc2vm_flags(flags) | VM_ALLOC_WIRED;
337 npages = atop(asize);
338 VM_OBJECT_WLOCK(object);
339 m = kmem_alloc_contig_pages(object, atop(offset), domain,
340 pflags, npages, low, high, alignment, boundary, memattr);
341 if (m == NULL) {
342 VM_OBJECT_WUNLOCK(object);
343 vmem_free(vmem, addr, asize);
344 return (0);
345 }
346 KASSERT(vm_page_domain(m) == domain,
347 ("kmem_alloc_contig_domain: Domain mismatch %d != %d",
348 vm_page_domain(m), domain));
349 end_m = m + npages;
350 tmp = addr;
351 for (; m < end_m; m++) {
352 if ((flags & M_ZERO) && (m->flags & PG_ZERO) == 0)
353 pmap_zero_page(m);
354 vm_page_valid(m);
355 pmap_enter(kernel_pmap, tmp, m, VM_PROT_RW,
356 VM_PROT_RW | PMAP_ENTER_WIRED, 0);
357 tmp += PAGE_SIZE;
358 }
359 VM_OBJECT_WUNLOCK(object);
360 kasan_mark((void *)addr, size, asize, KASAN_KMEM_REDZONE);
361 return (addr);
362 }
363
364 vm_offset_t
kmem_alloc_contig(vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,u_long alignment,vm_paddr_t boundary,vm_memattr_t memattr)365 kmem_alloc_contig(vm_size_t size, int flags, vm_paddr_t low, vm_paddr_t high,
366 u_long alignment, vm_paddr_t boundary, vm_memattr_t memattr)
367 {
368
369 return (kmem_alloc_contig_domainset(DOMAINSET_RR(), size, flags, low,
370 high, alignment, boundary, memattr));
371 }
372
373 vm_offset_t
kmem_alloc_contig_domainset(struct domainset * ds,vm_size_t size,int flags,vm_paddr_t low,vm_paddr_t high,u_long alignment,vm_paddr_t boundary,vm_memattr_t memattr)374 kmem_alloc_contig_domainset(struct domainset *ds, vm_size_t size, int flags,
375 vm_paddr_t low, vm_paddr_t high, u_long alignment, vm_paddr_t boundary,
376 vm_memattr_t memattr)
377 {
378 struct vm_domainset_iter di;
379 vm_offset_t addr;
380 int domain;
381
382 vm_domainset_iter_policy_init(&di, ds, &domain, &flags);
383 do {
384 addr = kmem_alloc_contig_domain(domain, size, flags, low, high,
385 alignment, boundary, memattr);
386 if (addr != 0)
387 break;
388 } while (vm_domainset_iter_policy(&di, &domain) == 0);
389
390 return (addr);
391 }
392
393 /*
394 * kmem_subinit:
395 *
396 * Initializes a map to manage a subrange
397 * of the kernel virtual address space.
398 *
399 * Arguments are as follows:
400 *
401 * parent Map to take range from
402 * min, max Returned endpoints of map
403 * size Size of range to find
404 * superpage_align Request that min is superpage aligned
405 */
406 void
kmem_subinit(vm_map_t map,vm_map_t parent,vm_offset_t * min,vm_offset_t * max,vm_size_t size,bool superpage_align)407 kmem_subinit(vm_map_t map, vm_map_t parent, vm_offset_t *min, vm_offset_t *max,
408 vm_size_t size, bool superpage_align)
409 {
410 int ret;
411
412 size = round_page(size);
413
414 *min = vm_map_min(parent);
415 ret = vm_map_find(parent, NULL, 0, min, size, 0, superpage_align ?
416 VMFS_SUPER_SPACE : VMFS_ANY_SPACE, VM_PROT_ALL, VM_PROT_ALL,
417 MAP_ACC_NO_CHARGE);
418 if (ret != KERN_SUCCESS)
419 panic("kmem_subinit: bad status return of %d", ret);
420 *max = *min + size;
421 vm_map_init(map, vm_map_pmap(parent), *min, *max);
422 if (vm_map_submap(parent, *min, *max, map) != KERN_SUCCESS)
423 panic("kmem_subinit: unable to change range to submap");
424 }
425
426 /*
427 * kmem_malloc_domain:
428 *
429 * Allocate wired-down pages in the kernel's address space.
430 */
431 static vm_offset_t
kmem_malloc_domain(int domain,vm_size_t size,int flags)432 kmem_malloc_domain(int domain, vm_size_t size, int flags)
433 {
434 vmem_t *arena;
435 vm_offset_t addr;
436 vm_size_t asize;
437 int rv;
438
439 if (__predict_true((flags & M_EXEC) == 0))
440 arena = vm_dom[domain].vmd_kernel_arena;
441 else
442 arena = vm_dom[domain].vmd_kernel_rwx_arena;
443 asize = round_page(size);
444 if (vmem_alloc(arena, asize, flags | M_BESTFIT, &addr))
445 return (0);
446
447 rv = kmem_back_domain(domain, kernel_object, addr, asize, flags);
448 if (rv != KERN_SUCCESS) {
449 vmem_free(arena, addr, asize);
450 return (0);
451 }
452 kasan_mark((void *)addr, size, asize, KASAN_KMEM_REDZONE);
453 return (addr);
454 }
455
456 vm_offset_t
kmem_malloc(vm_size_t size,int flags)457 kmem_malloc(vm_size_t size, int flags)
458 {
459
460 return (kmem_malloc_domainset(DOMAINSET_RR(), size, flags));
461 }
462
463 vm_offset_t
kmem_malloc_domainset(struct domainset * ds,vm_size_t size,int flags)464 kmem_malloc_domainset(struct domainset *ds, vm_size_t size, int flags)
465 {
466 struct vm_domainset_iter di;
467 vm_offset_t addr;
468 int domain;
469
470 vm_domainset_iter_policy_init(&di, ds, &domain, &flags);
471 do {
472 addr = kmem_malloc_domain(domain, size, flags);
473 if (addr != 0)
474 break;
475 } while (vm_domainset_iter_policy(&di, &domain) == 0);
476
477 return (addr);
478 }
479
480 /*
481 * kmem_back_domain:
482 *
483 * Allocate physical pages from the specified domain for the specified
484 * virtual address range.
485 */
486 int
kmem_back_domain(int domain,vm_object_t object,vm_offset_t addr,vm_size_t size,int flags)487 kmem_back_domain(int domain, vm_object_t object, vm_offset_t addr,
488 vm_size_t size, int flags)
489 {
490 vm_offset_t offset, i;
491 vm_page_t m, mpred;
492 vm_prot_t prot;
493 int pflags;
494
495 KASSERT(object == kernel_object,
496 ("kmem_back_domain: only supports kernel object."));
497
498 offset = addr - VM_MIN_KERNEL_ADDRESS;
499 pflags = malloc2vm_flags(flags) | VM_ALLOC_WIRED;
500 pflags &= ~(VM_ALLOC_NOWAIT | VM_ALLOC_WAITOK | VM_ALLOC_WAITFAIL);
501 if (flags & M_WAITOK)
502 pflags |= VM_ALLOC_WAITFAIL;
503 prot = (flags & M_EXEC) != 0 ? VM_PROT_ALL : VM_PROT_RW;
504
505 i = 0;
506 VM_OBJECT_WLOCK(object);
507 retry:
508 mpred = vm_radix_lookup_le(&object->rtree, atop(offset + i));
509 for (; i < size; i += PAGE_SIZE, mpred = m) {
510 m = vm_page_alloc_domain_after(object, atop(offset + i),
511 domain, pflags, mpred);
512
513 /*
514 * Ran out of space, free everything up and return. Don't need
515 * to lock page queues here as we know that the pages we got
516 * aren't on any queues.
517 */
518 if (m == NULL) {
519 if ((flags & M_NOWAIT) == 0)
520 goto retry;
521 VM_OBJECT_WUNLOCK(object);
522 kmem_unback(object, addr, i);
523 return (KERN_NO_SPACE);
524 }
525 KASSERT(vm_page_domain(m) == domain,
526 ("kmem_back_domain: Domain mismatch %d != %d",
527 vm_page_domain(m), domain));
528 if (flags & M_ZERO && (m->flags & PG_ZERO) == 0)
529 pmap_zero_page(m);
530 KASSERT((m->oflags & VPO_UNMANAGED) != 0,
531 ("kmem_malloc: page %p is managed", m));
532 vm_page_valid(m);
533 pmap_enter(kernel_pmap, addr + i, m, prot,
534 prot | PMAP_ENTER_WIRED, 0);
535 if (__predict_false((prot & VM_PROT_EXECUTE) != 0))
536 m->oflags |= VPO_KMEM_EXEC;
537 }
538 VM_OBJECT_WUNLOCK(object);
539
540 return (KERN_SUCCESS);
541 }
542
543 /*
544 * kmem_back:
545 *
546 * Allocate physical pages for the specified virtual address range.
547 */
548 int
kmem_back(vm_object_t object,vm_offset_t addr,vm_size_t size,int flags)549 kmem_back(vm_object_t object, vm_offset_t addr, vm_size_t size, int flags)
550 {
551 vm_offset_t end, next, start;
552 int domain, rv;
553
554 KASSERT(object == kernel_object,
555 ("kmem_back: only supports kernel object."));
556
557 for (start = addr, end = addr + size; addr < end; addr = next) {
558 /*
559 * We must ensure that pages backing a given large virtual page
560 * all come from the same physical domain.
561 */
562 if (vm_ndomains > 1) {
563 domain = (addr >> KVA_QUANTUM_SHIFT) % vm_ndomains;
564 while (VM_DOMAIN_EMPTY(domain))
565 domain++;
566 next = roundup2(addr + 1, KVA_QUANTUM);
567 if (next > end || next < start)
568 next = end;
569 } else {
570 domain = 0;
571 next = end;
572 }
573 rv = kmem_back_domain(domain, object, addr, next - addr, flags);
574 if (rv != KERN_SUCCESS) {
575 kmem_unback(object, start, addr - start);
576 break;
577 }
578 }
579 return (rv);
580 }
581
582 /*
583 * kmem_unback:
584 *
585 * Unmap and free the physical pages underlying the specified virtual
586 * address range.
587 *
588 * A physical page must exist within the specified object at each index
589 * that is being unmapped.
590 */
591 static struct vmem *
_kmem_unback(vm_object_t object,vm_offset_t addr,vm_size_t size)592 _kmem_unback(vm_object_t object, vm_offset_t addr, vm_size_t size)
593 {
594 struct vmem *arena;
595 vm_page_t m, next;
596 vm_offset_t end, offset;
597 int domain;
598
599 KASSERT(object == kernel_object,
600 ("kmem_unback: only supports kernel object."));
601
602 if (size == 0)
603 return (NULL);
604 pmap_remove(kernel_pmap, addr, addr + size);
605 offset = addr - VM_MIN_KERNEL_ADDRESS;
606 end = offset + size;
607 VM_OBJECT_WLOCK(object);
608 m = vm_page_lookup(object, atop(offset));
609 domain = vm_page_domain(m);
610 if (__predict_true((m->oflags & VPO_KMEM_EXEC) == 0))
611 arena = vm_dom[domain].vmd_kernel_arena;
612 else
613 arena = vm_dom[domain].vmd_kernel_rwx_arena;
614 for (; offset < end; offset += PAGE_SIZE, m = next) {
615 next = vm_page_next(m);
616 vm_page_xbusy_claim(m);
617 vm_page_unwire_noq(m);
618 vm_page_free(m);
619 }
620 VM_OBJECT_WUNLOCK(object);
621
622 return (arena);
623 }
624
625 void
kmem_unback(vm_object_t object,vm_offset_t addr,vm_size_t size)626 kmem_unback(vm_object_t object, vm_offset_t addr, vm_size_t size)
627 {
628
629 (void)_kmem_unback(object, addr, size);
630 }
631
632 /*
633 * kmem_free:
634 *
635 * Free memory allocated with kmem_malloc. The size must match the
636 * original allocation.
637 */
638 void
kmem_free(vm_offset_t addr,vm_size_t size)639 kmem_free(vm_offset_t addr, vm_size_t size)
640 {
641 struct vmem *arena;
642
643 size = round_page(size);
644 kasan_mark((void *)addr, size, size, 0);
645 arena = _kmem_unback(kernel_object, addr, size);
646 if (arena != NULL)
647 vmem_free(arena, addr, size);
648 }
649
650 /*
651 * kmap_alloc_wait:
652 *
653 * Allocates pageable memory from a sub-map of the kernel. If the submap
654 * has no room, the caller sleeps waiting for more memory in the submap.
655 *
656 * This routine may block.
657 */
658 vm_offset_t
kmap_alloc_wait(vm_map_t map,vm_size_t size)659 kmap_alloc_wait(vm_map_t map, vm_size_t size)
660 {
661 vm_offset_t addr;
662
663 size = round_page(size);
664 if (!swap_reserve(size))
665 return (0);
666
667 for (;;) {
668 /*
669 * To make this work for more than one map, use the map's lock
670 * to lock out sleepers/wakers.
671 */
672 vm_map_lock(map);
673 addr = vm_map_findspace(map, vm_map_min(map), size);
674 if (addr + size <= vm_map_max(map))
675 break;
676 /* no space now; see if we can ever get space */
677 if (vm_map_max(map) - vm_map_min(map) < size) {
678 vm_map_unlock(map);
679 swap_release(size);
680 return (0);
681 }
682 map->needs_wakeup = TRUE;
683 vm_map_unlock_and_wait(map, 0);
684 }
685 vm_map_insert(map, NULL, 0, addr, addr + size, VM_PROT_RW, VM_PROT_RW,
686 MAP_ACC_CHARGED);
687 vm_map_unlock(map);
688 return (addr);
689 }
690
691 /*
692 * kmap_free_wakeup:
693 *
694 * Returns memory to a submap of the kernel, and wakes up any processes
695 * waiting for memory in that map.
696 */
697 void
kmap_free_wakeup(vm_map_t map,vm_offset_t addr,vm_size_t size)698 kmap_free_wakeup(vm_map_t map, vm_offset_t addr, vm_size_t size)
699 {
700
701 vm_map_lock(map);
702 (void) vm_map_delete(map, trunc_page(addr), round_page(addr + size));
703 if (map->needs_wakeup) {
704 map->needs_wakeup = FALSE;
705 vm_map_wakeup(map);
706 }
707 vm_map_unlock(map);
708 }
709
710 void
kmem_init_zero_region(void)711 kmem_init_zero_region(void)
712 {
713 vm_offset_t addr, i;
714 vm_page_t m;
715
716 /*
717 * Map a single physical page of zeros to a larger virtual range.
718 * This requires less looping in places that want large amounts of
719 * zeros, while not using much more physical resources.
720 */
721 addr = kva_alloc(ZERO_REGION_SIZE);
722 m = vm_page_alloc_noobj(VM_ALLOC_WIRED | VM_ALLOC_ZERO);
723 for (i = 0; i < ZERO_REGION_SIZE; i += PAGE_SIZE)
724 pmap_qenter(addr + i, &m, 1);
725 pmap_protect(kernel_pmap, addr, addr + ZERO_REGION_SIZE, VM_PROT_READ);
726
727 zero_region = (const void *)addr;
728 }
729
730 /*
731 * Import KVA from the kernel map into the kernel arena.
732 */
733 static int
kva_import(void * unused,vmem_size_t size,int flags,vmem_addr_t * addrp)734 kva_import(void *unused, vmem_size_t size, int flags, vmem_addr_t *addrp)
735 {
736 vm_offset_t addr;
737 int result;
738
739 KASSERT((size % KVA_QUANTUM) == 0,
740 ("kva_import: Size %jd is not a multiple of %d",
741 (intmax_t)size, (int)KVA_QUANTUM));
742 addr = vm_map_min(kernel_map);
743 result = vm_map_find(kernel_map, NULL, 0, &addr, size, 0,
744 VMFS_SUPER_SPACE, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
745 if (result != KERN_SUCCESS)
746 return (ENOMEM);
747
748 *addrp = addr;
749
750 return (0);
751 }
752
753 /*
754 * Import KVA from a parent arena into a per-domain arena. Imports must be
755 * KVA_QUANTUM-aligned and a multiple of KVA_QUANTUM in size.
756 */
757 static int
kva_import_domain(void * arena,vmem_size_t size,int flags,vmem_addr_t * addrp)758 kva_import_domain(void *arena, vmem_size_t size, int flags, vmem_addr_t *addrp)
759 {
760
761 KASSERT((size % KVA_QUANTUM) == 0,
762 ("kva_import_domain: Size %jd is not a multiple of %d",
763 (intmax_t)size, (int)KVA_QUANTUM));
764 return (vmem_xalloc(arena, size, KVA_QUANTUM, 0, 0, VMEM_ADDR_MIN,
765 VMEM_ADDR_MAX, flags, addrp));
766 }
767
768 /*
769 * kmem_init:
770 *
771 * Create the kernel map; insert a mapping covering kernel text,
772 * data, bss, and all space allocated thus far (`boostrap' data). The
773 * new map will thus map the range between VM_MIN_KERNEL_ADDRESS and
774 * `start' as allocated, and the range between `start' and `end' as free.
775 * Create the kernel vmem arena and its per-domain children.
776 */
777 void
kmem_init(vm_offset_t start,vm_offset_t end)778 kmem_init(vm_offset_t start, vm_offset_t end)
779 {
780 vm_size_t quantum;
781 int domain;
782
783 vm_map_init(kernel_map, kernel_pmap, VM_MIN_KERNEL_ADDRESS, end);
784 kernel_map->system_map = 1;
785 vm_map_lock(kernel_map);
786 /* N.B.: cannot use kgdb to debug, starting with this assignment ... */
787 (void)vm_map_insert(kernel_map, NULL, 0,
788 #ifdef __amd64__
789 KERNBASE,
790 #else
791 VM_MIN_KERNEL_ADDRESS,
792 #endif
793 start, VM_PROT_ALL, VM_PROT_ALL, MAP_NOFAULT);
794 /* ... and ending with the completion of the above `insert' */
795
796 #ifdef __amd64__
797 /*
798 * Mark KVA used for the page array as allocated. Other platforms
799 * that handle vm_page_array allocation can simply adjust virtual_avail
800 * instead.
801 */
802 (void)vm_map_insert(kernel_map, NULL, 0, (vm_offset_t)vm_page_array,
803 (vm_offset_t)vm_page_array + round_2mpage(vm_page_array_size *
804 sizeof(struct vm_page)),
805 VM_PROT_RW, VM_PROT_RW, MAP_NOFAULT);
806 #endif
807 vm_map_unlock(kernel_map);
808
809 /*
810 * Use a large import quantum on NUMA systems. This helps minimize
811 * interleaving of superpages, reducing internal fragmentation within
812 * the per-domain arenas.
813 */
814 if (vm_ndomains > 1 && PMAP_HAS_DMAP)
815 quantum = KVA_NUMA_IMPORT_QUANTUM;
816 else
817 quantum = KVA_QUANTUM;
818
819 /*
820 * Initialize the kernel_arena. This can grow on demand.
821 */
822 vmem_init(kernel_arena, "kernel arena", 0, 0, PAGE_SIZE, 0, 0);
823 vmem_set_import(kernel_arena, kva_import, NULL, NULL, quantum);
824
825 for (domain = 0; domain < vm_ndomains; domain++) {
826 /*
827 * Initialize the per-domain arenas. These are used to color
828 * the KVA space in a way that ensures that virtual large pages
829 * are backed by memory from the same physical domain,
830 * maximizing the potential for superpage promotion.
831 */
832 vm_dom[domain].vmd_kernel_arena = vmem_create(
833 "kernel arena domain", 0, 0, PAGE_SIZE, 0, M_WAITOK);
834 vmem_set_import(vm_dom[domain].vmd_kernel_arena,
835 kva_import_domain, NULL, kernel_arena, quantum);
836
837 /*
838 * In architectures with superpages, maintain separate arenas
839 * for allocations with permissions that differ from the
840 * "standard" read/write permissions used for kernel memory,
841 * so as not to inhibit superpage promotion.
842 *
843 * Use the base import quantum since this arena is rarely used.
844 */
845 #if VM_NRESERVLEVEL > 0
846 vm_dom[domain].vmd_kernel_rwx_arena = vmem_create(
847 "kernel rwx arena domain", 0, 0, PAGE_SIZE, 0, M_WAITOK);
848 vmem_set_import(vm_dom[domain].vmd_kernel_rwx_arena,
849 kva_import_domain, (vmem_release_t *)vmem_xfree,
850 kernel_arena, KVA_QUANTUM);
851 #else
852 vm_dom[domain].vmd_kernel_rwx_arena =
853 vm_dom[domain].vmd_kernel_arena;
854 #endif
855 }
856
857 /*
858 * This must be the very first call so that the virtual address
859 * space used for early allocations is properly marked used in
860 * the map.
861 */
862 uma_startup2();
863 }
864
865 /*
866 * kmem_bootstrap_free:
867 *
868 * Free pages backing preloaded data (e.g., kernel modules) to the
869 * system. Currently only supported on platforms that create a
870 * vm_phys segment for preloaded data.
871 */
872 void
kmem_bootstrap_free(vm_offset_t start,vm_size_t size)873 kmem_bootstrap_free(vm_offset_t start, vm_size_t size)
874 {
875 #if defined(__i386__) || defined(__amd64__)
876 struct vm_domain *vmd;
877 vm_offset_t end, va;
878 vm_paddr_t pa;
879 vm_page_t m;
880
881 end = trunc_page(start + size);
882 start = round_page(start);
883
884 #ifdef __amd64__
885 /*
886 * Preloaded files do not have execute permissions by default on amd64.
887 * Restore the default permissions to ensure that the direct map alias
888 * is updated.
889 */
890 pmap_change_prot(start, end - start, VM_PROT_RW);
891 #endif
892 for (va = start; va < end; va += PAGE_SIZE) {
893 pa = pmap_kextract(va);
894 m = PHYS_TO_VM_PAGE(pa);
895
896 vmd = vm_pagequeue_domain(m);
897 vm_domain_free_lock(vmd);
898 vm_phys_free_pages(m, 0);
899 vm_domain_free_unlock(vmd);
900
901 vm_domain_freecnt_inc(vmd, 1);
902 vm_cnt.v_page_count++;
903 }
904 pmap_remove(kernel_pmap, start, end);
905 (void)vmem_add(kernel_arena, start, end - start, M_WAITOK);
906 #endif
907 }
908
909 #ifdef PMAP_WANT_ACTIVE_CPUS_NAIVE
910 void
pmap_active_cpus(pmap_t pmap,cpuset_t * res)911 pmap_active_cpus(pmap_t pmap, cpuset_t *res)
912 {
913 struct thread *td;
914 struct proc *p;
915 struct vmspace *vm;
916 int c;
917
918 CPU_ZERO(res);
919 CPU_FOREACH(c) {
920 td = cpuid_to_pcpu[c]->pc_curthread;
921 p = td->td_proc;
922 if (p == NULL)
923 continue;
924 vm = vmspace_acquire_ref(p);
925 if (vm == NULL)
926 continue;
927 if (pmap == vmspace_pmap(vm))
928 CPU_SET(c, res);
929 vmspace_free(vm);
930 }
931 }
932 #endif
933
934 /*
935 * Allow userspace to directly trigger the VM drain routine for testing
936 * purposes.
937 */
938 static int
debug_vm_lowmem(SYSCTL_HANDLER_ARGS)939 debug_vm_lowmem(SYSCTL_HANDLER_ARGS)
940 {
941 int error, i;
942
943 i = 0;
944 error = sysctl_handle_int(oidp, &i, 0, req);
945 if (error != 0)
946 return (error);
947 if ((i & ~(VM_LOW_KMEM | VM_LOW_PAGES)) != 0)
948 return (EINVAL);
949 if (i != 0)
950 EVENTHANDLER_INVOKE(vm_lowmem, i);
951 return (0);
952 }
953 SYSCTL_PROC(_debug, OID_AUTO, vm_lowmem,
954 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, 0, 0, debug_vm_lowmem, "I",
955 "set to trigger vm_lowmem event with given flags");
956
957 static int
debug_uma_reclaim(SYSCTL_HANDLER_ARGS)958 debug_uma_reclaim(SYSCTL_HANDLER_ARGS)
959 {
960 int error, i;
961
962 i = 0;
963 error = sysctl_handle_int(oidp, &i, 0, req);
964 if (error != 0 || req->newptr == NULL)
965 return (error);
966 if (i != UMA_RECLAIM_TRIM && i != UMA_RECLAIM_DRAIN &&
967 i != UMA_RECLAIM_DRAIN_CPU)
968 return (EINVAL);
969 uma_reclaim(i);
970 return (0);
971 }
972 SYSCTL_PROC(_debug, OID_AUTO, uma_reclaim,
973 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, 0, 0, debug_uma_reclaim, "I",
974 "set to generate request to reclaim uma caches");
975
976 static int
debug_uma_reclaim_domain(SYSCTL_HANDLER_ARGS)977 debug_uma_reclaim_domain(SYSCTL_HANDLER_ARGS)
978 {
979 int domain, error, request;
980
981 request = 0;
982 error = sysctl_handle_int(oidp, &request, 0, req);
983 if (error != 0 || req->newptr == NULL)
984 return (error);
985
986 domain = request >> 4;
987 request &= 0xf;
988 if (request != UMA_RECLAIM_TRIM && request != UMA_RECLAIM_DRAIN &&
989 request != UMA_RECLAIM_DRAIN_CPU)
990 return (EINVAL);
991 if (domain < 0 || domain >= vm_ndomains)
992 return (EINVAL);
993 uma_reclaim_domain(request, domain);
994 return (0);
995 }
996 SYSCTL_PROC(_debug, OID_AUTO, uma_reclaim_domain,
997 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, 0, 0,
998 debug_uma_reclaim_domain, "I",
999 "");
1000