kernel - refactor vm_page busy
[dragonfly.git] / sys / vm / vm_mmap.c
blob7de4cccba107e39c08a2d9dad82f0aba809d394d
1 /*
2 * (MPSAFE)
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1991, 1993
6 * The Regents of the University of California. All rights reserved.
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
36 * from: Utah $Hdr: vm_mmap.c 1.6 91/10/21$
38 * @(#)vm_mmap.c 8.4 (Berkeley) 1/12/94
39 * $FreeBSD: src/sys/vm/vm_mmap.c,v 1.108.2.6 2002/07/02 20:06:19 dillon Exp $
43 * Mapped file (mmap) interface to VM
46 #include <sys/param.h>
47 #include <sys/kernel.h>
48 #include <sys/systm.h>
49 #include <sys/sysproto.h>
50 #include <sys/filedesc.h>
51 #include <sys/kern_syscall.h>
52 #include <sys/proc.h>
53 #include <sys/priv.h>
54 #include <sys/resource.h>
55 #include <sys/resourcevar.h>
56 #include <sys/vnode.h>
57 #include <sys/fcntl.h>
58 #include <sys/file.h>
59 #include <sys/mman.h>
60 #include <sys/conf.h>
61 #include <sys/stat.h>
62 #include <sys/vmmeter.h>
63 #include <sys/sysctl.h>
65 #include <vm/vm.h>
66 #include <vm/vm_param.h>
67 #include <sys/lock.h>
68 #include <vm/pmap.h>
69 #include <vm/vm_map.h>
70 #include <vm/vm_object.h>
71 #include <vm/vm_page.h>
72 #include <vm/vm_pager.h>
73 #include <vm/vm_pageout.h>
74 #include <vm/vm_extern.h>
75 #include <vm/vm_kern.h>
77 #include <sys/file2.h>
78 #include <sys/thread.h>
79 #include <sys/thread2.h>
80 #include <vm/vm_page2.h>
82 static int max_proc_mmap;
83 SYSCTL_INT(_vm, OID_AUTO, max_proc_mmap, CTLFLAG_RW, &max_proc_mmap, 0, "");
84 int vkernel_enable;
85 SYSCTL_INT(_vm, OID_AUTO, vkernel_enable, CTLFLAG_RW, &vkernel_enable, 0, "");
88 * Set the maximum number of vm_map_entry structures per process. Roughly
89 * speaking vm_map_entry structures are tiny, so allowing them to eat 1/100
90 * of our KVM malloc space still results in generous limits. We want a
91 * default that is good enough to prevent the kernel running out of resources
92 * if attacked from compromised user account but generous enough such that
93 * multi-threaded processes are not unduly inconvenienced.
96 static void vmmapentry_rsrc_init (void *);
97 SYSINIT(vmmersrc, SI_BOOT1_POST, SI_ORDER_ANY, vmmapentry_rsrc_init, NULL);
99 static void
100 vmmapentry_rsrc_init(void *dummy)
102 max_proc_mmap = KvaSize / sizeof(struct vm_map_entry);
103 max_proc_mmap /= 100;
107 * MPSAFE
110 sys_sbrk(struct sbrk_args *uap)
112 /* Not yet implemented */
113 return (EOPNOTSUPP);
117 * sstk_args(int incr)
119 * MPSAFE
122 sys_sstk(struct sstk_args *uap)
124 /* Not yet implemented */
125 return (EOPNOTSUPP);
129 * mmap_args(void *addr, size_t len, int prot, int flags, int fd,
130 * long pad, off_t pos)
132 * Memory Map (mmap) system call. Note that the file offset
133 * and address are allowed to be NOT page aligned, though if
134 * the MAP_FIXED flag it set, both must have the same remainder
135 * modulo the PAGE_SIZE (POSIX 1003.1b). If the address is not
136 * page-aligned, the actual mapping starts at trunc_page(addr)
137 * and the return value is adjusted up by the page offset.
139 * Generally speaking, only character devices which are themselves
140 * memory-based, such as a video framebuffer, can be mmap'd. Otherwise
141 * there would be no cache coherency between a descriptor and a VM mapping
142 * both to the same character device.
144 * Block devices can be mmap'd no matter what they represent. Cache coherency
145 * is maintained as long as you do not write directly to the underlying
146 * character device.
148 * No requirements
151 kern_mmap(struct vmspace *vms, caddr_t uaddr, size_t ulen,
152 int uprot, int uflags, int fd, off_t upos, void **res)
154 struct thread *td = curthread;
155 struct proc *p = td->td_proc;
156 struct file *fp = NULL;
157 struct vnode *vp;
158 vm_offset_t addr;
159 vm_offset_t tmpaddr;
160 vm_size_t size, pageoff;
161 vm_prot_t prot, maxprot;
162 void *handle;
163 int flags, error;
164 off_t pos;
165 vm_object_t obj;
167 KKASSERT(p);
169 addr = (vm_offset_t) uaddr;
170 size = ulen;
171 prot = uprot & VM_PROT_ALL;
172 flags = uflags;
173 pos = upos;
176 * Make sure mapping fits into numeric range etc.
178 * NOTE: We support the full unsigned range for size now.
180 if (((flags & MAP_ANON) && (fd != -1 || pos != 0)))
181 return (EINVAL);
183 if (size == 0)
184 return (EINVAL);
186 if (flags & MAP_STACK) {
187 if (fd != -1)
188 return (EINVAL);
189 if ((prot & (PROT_READ|PROT_WRITE)) != (PROT_READ|PROT_WRITE))
190 return (EINVAL);
191 flags |= MAP_ANON;
192 pos = 0;
196 * Virtual page tables cannot be used with MAP_STACK. Apart from
197 * it not making any sense, the aux union is used by both
198 * types.
200 * Because the virtual page table is stored in the backing object
201 * and might be updated by the kernel, the mapping must be R+W.
203 if (flags & MAP_VPAGETABLE) {
204 if (vkernel_enable == 0)
205 return (EOPNOTSUPP);
206 if (flags & MAP_STACK)
207 return (EINVAL);
208 if ((prot & (PROT_READ|PROT_WRITE)) != (PROT_READ|PROT_WRITE))
209 return (EINVAL);
213 * Align the file position to a page boundary,
214 * and save its page offset component.
216 pageoff = (pos & PAGE_MASK);
217 pos -= pageoff;
219 /* Adjust size for rounding (on both ends). */
220 size += pageoff; /* low end... */
221 size = (vm_size_t) round_page(size); /* hi end */
222 if (size < ulen) /* wrap */
223 return(EINVAL);
226 * Check for illegal addresses. Watch out for address wrap... Note
227 * that VM_*_ADDRESS are not constants due to casts (argh).
229 if (flags & (MAP_FIXED | MAP_TRYFIXED)) {
231 * The specified address must have the same remainder
232 * as the file offset taken modulo PAGE_SIZE, so it
233 * should be aligned after adjustment by pageoff.
235 addr -= pageoff;
236 if (addr & PAGE_MASK)
237 return (EINVAL);
240 * Address range must be all in user VM space and not wrap.
242 tmpaddr = addr + size;
243 if (tmpaddr < addr)
244 return (EINVAL);
245 if (VM_MAX_USER_ADDRESS > 0 && tmpaddr > VM_MAX_USER_ADDRESS)
246 return (EINVAL);
247 if (VM_MIN_USER_ADDRESS > 0 && addr < VM_MIN_USER_ADDRESS)
248 return (EINVAL);
249 } else {
251 * Get a hint of where to map. It also provides mmap offset
252 * randomization if enabled.
254 addr = vm_map_hint(p, addr, prot);
257 if (flags & MAP_ANON) {
259 * Mapping blank space is trivial.
261 handle = NULL;
262 maxprot = VM_PROT_ALL;
263 } else {
265 * Mapping file, get fp for validation. Obtain vnode and make
266 * sure it is of appropriate type.
268 fp = holdfp(p->p_fd, fd, -1);
269 if (fp == NULL)
270 return (EBADF);
271 if (fp->f_type != DTYPE_VNODE) {
272 error = EINVAL;
273 goto done;
276 * POSIX shared-memory objects are defined to have
277 * kernel persistence, and are not defined to support
278 * read(2)/write(2) -- or even open(2). Thus, we can
279 * use MAP_ASYNC to trade on-disk coherence for speed.
280 * The shm_open(3) library routine turns on the FPOSIXSHM
281 * flag to request this behavior.
283 if (fp->f_flag & FPOSIXSHM)
284 flags |= MAP_NOSYNC;
285 vp = (struct vnode *) fp->f_data;
288 * Validate the vnode for the operation.
290 switch(vp->v_type) {
291 case VREG:
293 * Get the proper underlying object
295 if ((obj = vp->v_object) == NULL) {
296 error = EINVAL;
297 goto done;
299 KKASSERT((struct vnode *)obj->handle == vp);
300 break;
301 case VCHR:
303 * Make sure a device has not been revoked.
304 * Mappability is handled by the device layer.
306 if (vp->v_rdev == NULL) {
307 error = EBADF;
308 goto done;
310 break;
311 default:
313 * Nothing else is mappable.
315 error = EINVAL;
316 goto done;
320 * XXX hack to handle use of /dev/zero to map anon memory (ala
321 * SunOS).
323 if (vp->v_type == VCHR && iszerodev(vp->v_rdev)) {
324 handle = NULL;
325 maxprot = VM_PROT_ALL;
326 flags |= MAP_ANON;
327 pos = 0;
328 } else {
330 * cdevs does not provide private mappings of any kind.
332 if (vp->v_type == VCHR &&
333 (flags & (MAP_PRIVATE|MAP_COPY))) {
334 error = EINVAL;
335 goto done;
338 * Ensure that file and memory protections are
339 * compatible. Note that we only worry about
340 * writability if mapping is shared; in this case,
341 * current and max prot are dictated by the open file.
342 * XXX use the vnode instead? Problem is: what
343 * credentials do we use for determination? What if
344 * proc does a setuid?
346 maxprot = VM_PROT_EXECUTE;
347 if (fp->f_flag & FREAD) {
348 maxprot |= VM_PROT_READ;
349 } else if (prot & PROT_READ) {
350 error = EACCES;
351 goto done;
354 * If we are sharing potential changes (either via
355 * MAP_SHARED or via the implicit sharing of character
356 * device mappings), and we are trying to get write
357 * permission although we opened it without asking
358 * for it, bail out. Check for superuser, only if
359 * we're at securelevel < 1, to allow the XIG X server
360 * to continue to work.
362 if ((flags & MAP_SHARED) != 0 || vp->v_type == VCHR) {
363 if ((fp->f_flag & FWRITE) != 0) {
364 struct vattr va;
365 if ((error = VOP_GETATTR(vp, &va))) {
366 goto done;
368 if ((va.va_flags &
369 (IMMUTABLE|APPEND)) == 0) {
370 maxprot |= VM_PROT_WRITE;
371 } else if (prot & PROT_WRITE) {
372 error = EPERM;
373 goto done;
375 } else if ((prot & PROT_WRITE) != 0) {
376 error = EACCES;
377 goto done;
379 } else {
380 maxprot |= VM_PROT_WRITE;
382 handle = (void *)vp;
386 lwkt_gettoken(&vms->vm_map.token);
389 * Do not allow more then a certain number of vm_map_entry structures
390 * per process. Scale with the number of rforks sharing the map
391 * to make the limit reasonable for threads.
393 if (max_proc_mmap &&
394 vms->vm_map.nentries >= max_proc_mmap * vmspace_getrefs(vms)) {
395 error = ENOMEM;
396 lwkt_reltoken(&vms->vm_map.token);
397 goto done;
400 error = vm_mmap(&vms->vm_map, &addr, size, prot, maxprot,
401 flags, handle, pos);
402 if (error == 0)
403 *res = (void *)(addr + pageoff);
405 lwkt_reltoken(&vms->vm_map.token);
406 done:
407 if (fp)
408 fdrop(fp);
410 return (error);
414 * mmap system call handler
416 * No requirements.
419 sys_mmap(struct mmap_args *uap)
421 int error;
423 error = kern_mmap(curproc->p_vmspace, uap->addr, uap->len,
424 uap->prot, uap->flags,
425 uap->fd, uap->pos, &uap->sysmsg_resultp);
427 return (error);
431 * msync system call handler
433 * msync_args(void *addr, size_t len, int flags)
435 * No requirements
438 sys_msync(struct msync_args *uap)
440 struct proc *p = curproc;
441 vm_offset_t addr;
442 vm_offset_t tmpaddr;
443 vm_size_t size, pageoff;
444 int flags;
445 vm_map_t map;
446 int rv;
448 addr = (vm_offset_t) uap->addr;
449 size = uap->len;
450 flags = uap->flags;
452 pageoff = (addr & PAGE_MASK);
453 addr -= pageoff;
454 size += pageoff;
455 size = (vm_size_t) round_page(size);
456 if (size < uap->len) /* wrap */
457 return(EINVAL);
458 tmpaddr = addr + size; /* workaround gcc4 opt */
459 if (tmpaddr < addr) /* wrap */
460 return(EINVAL);
462 if ((flags & (MS_ASYNC|MS_INVALIDATE)) == (MS_ASYNC|MS_INVALIDATE))
463 return (EINVAL);
465 map = &p->p_vmspace->vm_map;
468 * map->token serializes extracting the address range for size == 0
469 * msyncs with the vm_map_clean call; if the token were not held
470 * across the two calls, an intervening munmap/mmap pair, for example,
471 * could cause msync to occur on a wrong region.
473 lwkt_gettoken(&map->token);
476 * XXX Gak! If size is zero we are supposed to sync "all modified
477 * pages with the region containing addr". Unfortunately, we don't
478 * really keep track of individual mmaps so we approximate by flushing
479 * the range of the map entry containing addr. This can be incorrect
480 * if the region splits or is coalesced with a neighbor.
482 if (size == 0) {
483 vm_map_entry_t entry;
485 vm_map_lock_read(map);
486 rv = vm_map_lookup_entry(map, addr, &entry);
487 if (rv == FALSE) {
488 vm_map_unlock_read(map);
489 rv = KERN_INVALID_ADDRESS;
490 goto done;
492 addr = entry->start;
493 size = entry->end - entry->start;
494 vm_map_unlock_read(map);
498 * Clean the pages and interpret the return value.
500 rv = vm_map_clean(map, addr, addr + size, (flags & MS_ASYNC) == 0,
501 (flags & MS_INVALIDATE) != 0);
502 done:
503 lwkt_reltoken(&map->token);
505 switch (rv) {
506 case KERN_SUCCESS:
507 break;
508 case KERN_INVALID_ADDRESS:
509 return (EINVAL); /* Sun returns ENOMEM? */
510 case KERN_FAILURE:
511 return (EIO);
512 default:
513 return (EINVAL);
516 return (0);
520 * munmap system call handler
522 * munmap_args(void *addr, size_t len)
524 * No requirements
527 sys_munmap(struct munmap_args *uap)
529 struct proc *p = curproc;
530 vm_offset_t addr;
531 vm_offset_t tmpaddr;
532 vm_size_t size, pageoff;
533 vm_map_t map;
535 addr = (vm_offset_t) uap->addr;
536 size = uap->len;
538 pageoff = (addr & PAGE_MASK);
539 addr -= pageoff;
540 size += pageoff;
541 size = (vm_size_t) round_page(size);
542 if (size < uap->len) /* wrap */
543 return(EINVAL);
544 tmpaddr = addr + size; /* workaround gcc4 opt */
545 if (tmpaddr < addr) /* wrap */
546 return(EINVAL);
548 if (size == 0)
549 return (0);
552 * Check for illegal addresses. Watch out for address wrap... Note
553 * that VM_*_ADDRESS are not constants due to casts (argh).
555 if (VM_MAX_USER_ADDRESS > 0 && tmpaddr > VM_MAX_USER_ADDRESS)
556 return (EINVAL);
557 if (VM_MIN_USER_ADDRESS > 0 && addr < VM_MIN_USER_ADDRESS)
558 return (EINVAL);
560 map = &p->p_vmspace->vm_map;
562 /* map->token serializes between the map check and the actual unmap */
563 lwkt_gettoken(&map->token);
566 * Make sure entire range is allocated.
568 if (!vm_map_check_protection(map, addr, addr + size,
569 VM_PROT_NONE, FALSE)) {
570 lwkt_reltoken(&map->token);
571 return (EINVAL);
573 /* returns nothing but KERN_SUCCESS anyway */
574 vm_map_remove(map, addr, addr + size);
575 lwkt_reltoken(&map->token);
576 return (0);
580 * mprotect_args(const void *addr, size_t len, int prot)
582 * No requirements.
585 sys_mprotect(struct mprotect_args *uap)
587 struct proc *p = curproc;
588 vm_offset_t addr;
589 vm_offset_t tmpaddr;
590 vm_size_t size, pageoff;
591 vm_prot_t prot;
592 int error;
594 addr = (vm_offset_t) uap->addr;
595 size = uap->len;
596 prot = uap->prot & VM_PROT_ALL;
598 pageoff = (addr & PAGE_MASK);
599 addr -= pageoff;
600 size += pageoff;
601 size = (vm_size_t) round_page(size);
602 if (size < uap->len) /* wrap */
603 return(EINVAL);
604 tmpaddr = addr + size; /* workaround gcc4 opt */
605 if (tmpaddr < addr) /* wrap */
606 return(EINVAL);
608 switch (vm_map_protect(&p->p_vmspace->vm_map, addr, addr + size,
609 prot, FALSE)) {
610 case KERN_SUCCESS:
611 error = 0;
612 break;
613 case KERN_PROTECTION_FAILURE:
614 error = EACCES;
615 break;
616 default:
617 error = EINVAL;
618 break;
620 return (error);
624 * minherit system call handler
626 * minherit_args(void *addr, size_t len, int inherit)
628 * No requirements.
631 sys_minherit(struct minherit_args *uap)
633 struct proc *p = curproc;
634 vm_offset_t addr;
635 vm_offset_t tmpaddr;
636 vm_size_t size, pageoff;
637 vm_inherit_t inherit;
638 int error;
640 addr = (vm_offset_t)uap->addr;
641 size = uap->len;
642 inherit = uap->inherit;
644 pageoff = (addr & PAGE_MASK);
645 addr -= pageoff;
646 size += pageoff;
647 size = (vm_size_t) round_page(size);
648 if (size < uap->len) /* wrap */
649 return(EINVAL);
650 tmpaddr = addr + size; /* workaround gcc4 opt */
651 if (tmpaddr < addr) /* wrap */
652 return(EINVAL);
654 switch (vm_map_inherit(&p->p_vmspace->vm_map, addr,
655 addr + size, inherit)) {
656 case KERN_SUCCESS:
657 error = 0;
658 break;
659 case KERN_PROTECTION_FAILURE:
660 error = EACCES;
661 break;
662 default:
663 error = EINVAL;
664 break;
666 return (error);
670 * madvise system call handler
672 * madvise_args(void *addr, size_t len, int behav)
674 * No requirements.
677 sys_madvise(struct madvise_args *uap)
679 struct proc *p = curproc;
680 vm_offset_t start, end;
681 vm_offset_t tmpaddr = (vm_offset_t)uap->addr + uap->len;
682 int error;
685 * Check for illegal behavior
687 if (uap->behav < 0 || uap->behav >= MADV_CONTROL_END)
688 return (EINVAL);
690 * Check for illegal addresses. Watch out for address wrap... Note
691 * that VM_*_ADDRESS are not constants due to casts (argh).
693 if (tmpaddr < (vm_offset_t)uap->addr)
694 return (EINVAL);
695 if (VM_MAX_USER_ADDRESS > 0 && tmpaddr > VM_MAX_USER_ADDRESS)
696 return (EINVAL);
697 if (VM_MIN_USER_ADDRESS > 0 && uap->addr < VM_MIN_USER_ADDRESS)
698 return (EINVAL);
701 * Since this routine is only advisory, we default to conservative
702 * behavior.
704 start = trunc_page((vm_offset_t)uap->addr);
705 end = round_page(tmpaddr);
707 error = vm_map_madvise(&p->p_vmspace->vm_map, start, end,
708 uap->behav, 0);
709 return (error);
713 * mcontrol system call handler
715 * mcontrol_args(void *addr, size_t len, int behav, off_t value)
717 * No requirements
720 sys_mcontrol(struct mcontrol_args *uap)
722 struct proc *p = curproc;
723 vm_offset_t start, end;
724 vm_offset_t tmpaddr = (vm_offset_t)uap->addr + uap->len;
725 int error;
728 * Check for illegal behavior
730 if (uap->behav < 0 || uap->behav > MADV_CONTROL_END)
731 return (EINVAL);
733 * Check for illegal addresses. Watch out for address wrap... Note
734 * that VM_*_ADDRESS are not constants due to casts (argh).
736 if (tmpaddr < (vm_offset_t) uap->addr)
737 return (EINVAL);
738 if (VM_MAX_USER_ADDRESS > 0 && tmpaddr > VM_MAX_USER_ADDRESS)
739 return (EINVAL);
740 if (VM_MIN_USER_ADDRESS > 0 && uap->addr < VM_MIN_USER_ADDRESS)
741 return (EINVAL);
744 * Since this routine is only advisory, we default to conservative
745 * behavior.
747 start = trunc_page((vm_offset_t)uap->addr);
748 end = round_page(tmpaddr);
750 error = vm_map_madvise(&p->p_vmspace->vm_map, start, end,
751 uap->behav, uap->value);
752 return (error);
757 * mincore system call handler
759 * mincore_args(const void *addr, size_t len, char *vec)
761 * No requirements
764 sys_mincore(struct mincore_args *uap)
766 struct proc *p = curproc;
767 vm_offset_t addr, first_addr;
768 vm_offset_t end, cend;
769 pmap_t pmap;
770 vm_map_t map;
771 char *vec;
772 int error;
773 int vecindex, lastvecindex;
774 vm_map_entry_t current;
775 vm_map_entry_t entry;
776 int mincoreinfo;
777 unsigned int timestamp;
780 * Make sure that the addresses presented are valid for user
781 * mode.
783 first_addr = addr = trunc_page((vm_offset_t) uap->addr);
784 end = addr + (vm_size_t)round_page(uap->len);
785 if (end < addr)
786 return (EINVAL);
787 if (VM_MAX_USER_ADDRESS > 0 && end > VM_MAX_USER_ADDRESS)
788 return (EINVAL);
791 * Address of byte vector
793 vec = uap->vec;
795 map = &p->p_vmspace->vm_map;
796 pmap = vmspace_pmap(p->p_vmspace);
798 lwkt_gettoken(&map->token);
799 vm_map_lock_read(map);
800 RestartScan:
801 timestamp = map->timestamp;
803 if (!vm_map_lookup_entry(map, addr, &entry))
804 entry = entry->next;
807 * Do this on a map entry basis so that if the pages are not
808 * in the current processes address space, we can easily look
809 * up the pages elsewhere.
811 lastvecindex = -1;
812 for(current = entry;
813 (current != &map->header) && (current->start < end);
814 current = current->next) {
817 * ignore submaps (for now) or null objects
819 if (current->maptype != VM_MAPTYPE_NORMAL &&
820 current->maptype != VM_MAPTYPE_VPAGETABLE) {
821 continue;
823 if (current->object.vm_object == NULL)
824 continue;
827 * limit this scan to the current map entry and the
828 * limits for the mincore call
830 if (addr < current->start)
831 addr = current->start;
832 cend = current->end;
833 if (cend > end)
834 cend = end;
837 * scan this entry one page at a time
839 while (addr < cend) {
841 * Check pmap first, it is likely faster, also
842 * it can provide info as to whether we are the
843 * one referencing or modifying the page.
845 * If we have to check the VM object, only mess
846 * around with normal maps. Do not mess around
847 * with virtual page tables (XXX).
849 mincoreinfo = pmap_mincore(pmap, addr);
850 if (mincoreinfo == 0 &&
851 current->maptype == VM_MAPTYPE_NORMAL) {
852 vm_pindex_t pindex;
853 vm_ooffset_t offset;
854 vm_page_t m;
857 * calculate the page index into the object
859 offset = current->offset + (addr - current->start);
860 pindex = OFF_TO_IDX(offset);
863 * if the page is resident, then gather
864 * information about it. spl protection is
865 * required to maintain the object
866 * association. And XXX what if the page is
867 * busy? What's the deal with that?
869 * XXX vm_token - legacy for pmap_ts_referenced
870 * in i386 and vkernel pmap code.
872 lwkt_gettoken(&vm_token);
873 vm_object_hold(current->object.vm_object);
874 m = vm_page_lookup(current->object.vm_object,
875 pindex);
876 if (m && m->valid) {
877 mincoreinfo = MINCORE_INCORE;
878 if (m->dirty || pmap_is_modified(m))
879 mincoreinfo |= MINCORE_MODIFIED_OTHER;
880 if ((m->flags & PG_REFERENCED) ||
881 pmap_ts_referenced(m)) {
882 vm_page_flag_set(m, PG_REFERENCED);
883 mincoreinfo |= MINCORE_REFERENCED_OTHER;
886 vm_object_drop(current->object.vm_object);
887 lwkt_reltoken(&vm_token);
891 * subyte may page fault. In case it needs to modify
892 * the map, we release the lock.
894 vm_map_unlock_read(map);
897 * calculate index into user supplied byte vector
899 vecindex = OFF_TO_IDX(addr - first_addr);
902 * If we have skipped map entries, we need to make sure that
903 * the byte vector is zeroed for those skipped entries.
905 while((lastvecindex + 1) < vecindex) {
906 error = subyte( vec + lastvecindex, 0);
907 if (error) {
908 error = EFAULT;
909 goto done;
911 ++lastvecindex;
915 * Pass the page information to the user
917 error = subyte( vec + vecindex, mincoreinfo);
918 if (error) {
919 error = EFAULT;
920 goto done;
924 * If the map has changed, due to the subyte, the previous
925 * output may be invalid.
927 vm_map_lock_read(map);
928 if (timestamp != map->timestamp)
929 goto RestartScan;
931 lastvecindex = vecindex;
932 addr += PAGE_SIZE;
937 * subyte may page fault. In case it needs to modify
938 * the map, we release the lock.
940 vm_map_unlock_read(map);
943 * Zero the last entries in the byte vector.
945 vecindex = OFF_TO_IDX(end - first_addr);
946 while((lastvecindex + 1) < vecindex) {
947 error = subyte( vec + lastvecindex, 0);
948 if (error) {
949 error = EFAULT;
950 goto done;
952 ++lastvecindex;
956 * If the map has changed, due to the subyte, the previous
957 * output may be invalid.
959 vm_map_lock_read(map);
960 if (timestamp != map->timestamp)
961 goto RestartScan;
962 vm_map_unlock_read(map);
964 error = 0;
965 done:
966 lwkt_reltoken(&map->token);
967 return (error);
971 * mlock system call handler
973 * mlock_args(const void *addr, size_t len)
975 * No requirements
978 sys_mlock(struct mlock_args *uap)
980 vm_offset_t addr;
981 vm_offset_t tmpaddr;
982 vm_size_t size, pageoff;
983 struct thread *td = curthread;
984 struct proc *p = td->td_proc;
985 int error;
987 addr = (vm_offset_t) uap->addr;
988 size = uap->len;
990 pageoff = (addr & PAGE_MASK);
991 addr -= pageoff;
992 size += pageoff;
993 size = (vm_size_t) round_page(size);
994 if (size < uap->len) /* wrap */
995 return(EINVAL);
996 tmpaddr = addr + size; /* workaround gcc4 opt */
997 if (tmpaddr < addr) /* wrap */
998 return (EINVAL);
1000 if (atop(size) + vmstats.v_wire_count > vm_page_max_wired)
1001 return (EAGAIN);
1004 * We do not need to synchronize against other threads updating ucred;
1005 * they update p->ucred, which is synchronized into td_ucred ourselves.
1007 #ifdef pmap_wired_count
1008 if (size + ptoa(pmap_wired_count(vm_map_pmap(&p->p_vmspace->vm_map))) >
1009 p->p_rlimit[RLIMIT_MEMLOCK].rlim_cur) {
1010 return (ENOMEM);
1012 #else
1013 error = priv_check_cred(td->td_ucred, PRIV_ROOT, 0);
1014 if (error) {
1015 return (error);
1017 #endif
1018 error = vm_map_unwire(&p->p_vmspace->vm_map, addr, addr + size, FALSE);
1019 return (error == KERN_SUCCESS ? 0 : ENOMEM);
1023 * mlockall(int how)
1025 * No requirements
1028 sys_mlockall(struct mlockall_args *uap)
1030 struct thread *td = curthread;
1031 struct proc *p = td->td_proc;
1032 vm_map_t map = &p->p_vmspace->vm_map;
1033 vm_map_entry_t entry;
1034 int how = uap->how;
1035 int rc = KERN_SUCCESS;
1037 if (((how & MCL_CURRENT) == 0) && ((how & MCL_FUTURE) == 0))
1038 return (EINVAL);
1040 rc = priv_check_cred(td->td_ucred, PRIV_ROOT, 0);
1041 if (rc)
1042 return (rc);
1044 vm_map_lock(map);
1045 do {
1046 if (how & MCL_CURRENT) {
1047 for(entry = map->header.next;
1048 entry != &map->header;
1049 entry = entry->next);
1051 rc = ENOSYS;
1052 break;
1055 if (how & MCL_FUTURE)
1056 map->flags |= MAP_WIREFUTURE;
1057 } while(0);
1058 vm_map_unlock(map);
1060 return (rc);
1064 * munlockall(void)
1066 * Unwire all user-wired map entries, cancel MCL_FUTURE.
1068 * No requirements
1071 sys_munlockall(struct munlockall_args *uap)
1073 struct thread *td = curthread;
1074 struct proc *p = td->td_proc;
1075 vm_map_t map = &p->p_vmspace->vm_map;
1076 vm_map_entry_t entry;
1077 int rc = KERN_SUCCESS;
1079 vm_map_lock(map);
1081 /* Clear MAP_WIREFUTURE to cancel mlockall(MCL_FUTURE) */
1082 map->flags &= ~MAP_WIREFUTURE;
1084 retry:
1085 for (entry = map->header.next;
1086 entry != &map->header;
1087 entry = entry->next) {
1088 if ((entry->eflags & MAP_ENTRY_USER_WIRED) == 0)
1089 continue;
1092 * If we encounter an in-transition entry, we release the
1093 * map lock and retry the scan; we do not decrement any
1094 * wired_count more than once because we do not touch
1095 * any entries with MAP_ENTRY_USER_WIRED not set.
1097 * There is a potential interleaving with concurrent
1098 * mlockall()s here -- if we abort a scan, an mlockall()
1099 * could start, wire a number of entries before our
1100 * current position in, and then stall itself on this
1101 * or any other in-transition entry. If that occurs, when
1102 * we resume, we will unwire those entries.
1104 if (entry->eflags & MAP_ENTRY_IN_TRANSITION) {
1105 entry->eflags |= MAP_ENTRY_NEEDS_WAKEUP;
1106 ++mycpu->gd_cnt.v_intrans_coll;
1107 ++mycpu->gd_cnt.v_intrans_wait;
1108 vm_map_transition_wait(map);
1109 goto retry;
1112 KASSERT(entry->wired_count > 0,
1113 ("wired_count was 0 with USER_WIRED set! %p", entry));
1115 /* Drop wired count, if it hits zero, unwire the entry */
1116 entry->eflags &= ~MAP_ENTRY_USER_WIRED;
1117 entry->wired_count--;
1118 if (entry->wired_count == 0)
1119 vm_fault_unwire(map, entry);
1122 map->timestamp++;
1123 vm_map_unlock(map);
1125 return (rc);
1129 * munlock system call handler
1131 * munlock_args(const void *addr, size_t len)
1133 * No requirements
1136 sys_munlock(struct munlock_args *uap)
1138 struct thread *td = curthread;
1139 struct proc *p = td->td_proc;
1140 vm_offset_t addr;
1141 vm_offset_t tmpaddr;
1142 vm_size_t size, pageoff;
1143 int error;
1145 addr = (vm_offset_t) uap->addr;
1146 size = uap->len;
1148 pageoff = (addr & PAGE_MASK);
1149 addr -= pageoff;
1150 size += pageoff;
1151 size = (vm_size_t) round_page(size);
1153 tmpaddr = addr + size;
1154 if (tmpaddr < addr) /* wrap */
1155 return (EINVAL);
1157 #ifndef pmap_wired_count
1158 error = priv_check(td, PRIV_ROOT);
1159 if (error)
1160 return (error);
1161 #endif
1163 error = vm_map_unwire(&p->p_vmspace->vm_map, addr, addr + size, TRUE);
1164 return (error == KERN_SUCCESS ? 0 : ENOMEM);
1168 * Internal version of mmap.
1169 * Currently used by mmap, exec, and sys5 shared memory.
1170 * Handle is either a vnode pointer or NULL for MAP_ANON.
1172 * No requirements
1175 vm_mmap(vm_map_t map, vm_offset_t *addr, vm_size_t size, vm_prot_t prot,
1176 vm_prot_t maxprot, int flags, void *handle, vm_ooffset_t foff)
1178 boolean_t fitit;
1179 vm_object_t object;
1180 vm_offset_t eaddr;
1181 vm_size_t esize;
1182 vm_size_t align;
1183 int (*uksmap)(cdev_t dev, vm_page_t fake);
1184 struct vnode *vp;
1185 struct thread *td = curthread;
1186 struct proc *p;
1187 int rv = KERN_SUCCESS;
1188 off_t objsize;
1189 int docow;
1190 int error;
1192 if (size == 0)
1193 return (0);
1195 objsize = round_page(size);
1196 if (objsize < size)
1197 return (EINVAL);
1198 size = objsize;
1200 lwkt_gettoken(&map->token);
1203 * XXX messy code, fixme
1205 * NOTE: Overflow checks require discrete statements or GCC4
1206 * will optimize it out.
1208 if ((p = curproc) != NULL && map == &p->p_vmspace->vm_map) {
1209 esize = map->size + size; /* workaround gcc4 opt */
1210 if (esize < map->size ||
1211 esize > p->p_rlimit[RLIMIT_VMEM].rlim_cur) {
1212 lwkt_reltoken(&map->token);
1213 return(ENOMEM);
1218 * We currently can only deal with page aligned file offsets.
1219 * The check is here rather than in the syscall because the
1220 * kernel calls this function internally for other mmaping
1221 * operations (such as in exec) and non-aligned offsets will
1222 * cause pmap inconsistencies...so we want to be sure to
1223 * disallow this in all cases.
1225 * NOTE: Overflow checks require discrete statements or GCC4
1226 * will optimize it out.
1228 if (foff & PAGE_MASK) {
1229 lwkt_reltoken(&map->token);
1230 return (EINVAL);
1234 * Handle alignment. For large memory maps it is possible
1235 * that the MMU can optimize the page table so align anything
1236 * that is a multiple of SEG_SIZE to SEG_SIZE.
1238 * Also align any large mapping (bigger than 16x SG_SIZE) to a
1239 * SEG_SIZE address boundary.
1241 if (flags & MAP_SIZEALIGN) {
1242 align = size;
1243 if ((align ^ (align - 1)) != (align << 1) - 1) {
1244 lwkt_reltoken(&map->token);
1245 return (EINVAL);
1247 } else if ((flags & MAP_FIXED) == 0 &&
1248 ((size & SEG_MASK) == 0 || size > SEG_SIZE * 16)) {
1249 align = SEG_SIZE;
1250 } else {
1251 align = PAGE_SIZE;
1254 if ((flags & (MAP_FIXED | MAP_TRYFIXED)) == 0) {
1255 fitit = TRUE;
1256 *addr = round_page(*addr);
1257 } else {
1258 if (*addr != trunc_page(*addr)) {
1259 lwkt_reltoken(&map->token);
1260 return (EINVAL);
1262 eaddr = *addr + size;
1263 if (eaddr < *addr) {
1264 lwkt_reltoken(&map->token);
1265 return (EINVAL);
1267 fitit = FALSE;
1268 if ((flags & MAP_TRYFIXED) == 0)
1269 vm_map_remove(map, *addr, *addr + size);
1272 uksmap = NULL;
1275 * Lookup/allocate object.
1277 if (flags & MAP_ANON) {
1279 * Unnamed anonymous regions always start at 0.
1281 if (handle) {
1283 * Default memory object
1285 object = default_pager_alloc(handle, objsize,
1286 prot, foff);
1287 if (object == NULL) {
1288 lwkt_reltoken(&map->token);
1289 return(ENOMEM);
1291 docow = MAP_PREFAULT_PARTIAL;
1292 } else {
1294 * Implicit single instance of a default memory
1295 * object, so we don't need a VM object yet.
1297 foff = 0;
1298 object = NULL;
1299 docow = 0;
1301 vp = NULL;
1302 } else {
1303 vp = (struct vnode *)handle;
1306 * Non-anonymous mappings of VCHR (aka not /dev/zero)
1307 * cannot specify MAP_STACK or MAP_VPAGETABLE.
1309 if (vp->v_type == VCHR) {
1310 if (flags & (MAP_STACK | MAP_VPAGETABLE)) {
1311 lwkt_reltoken(&map->token);
1312 return(EINVAL);
1316 if (vp->v_type == VCHR && vp->v_rdev->si_ops->d_uksmap) {
1318 * Device mappings without a VM object, typically
1319 * sharing permanently allocated kernel memory or
1320 * process-context-specific (per-process) data.
1322 * Force them to be shared.
1324 uksmap = vp->v_rdev->si_ops->d_uksmap;
1325 object = NULL;
1326 docow = MAP_PREFAULT_PARTIAL;
1327 flags &= ~(MAP_PRIVATE|MAP_COPY);
1328 flags |= MAP_SHARED;
1329 } else if (vp->v_type == VCHR) {
1331 * Device mappings (device size unknown?).
1332 * Force them to be shared.
1334 error = dev_dmmap_single(vp->v_rdev, &foff, objsize,
1335 &object, prot, NULL);
1337 if (error == ENODEV) {
1338 handle = (void *)(intptr_t)vp->v_rdev;
1339 object = dev_pager_alloc(handle, objsize, prot, foff);
1340 if (object == NULL) {
1341 lwkt_reltoken(&map->token);
1342 return(EINVAL);
1344 } else if (error) {
1345 lwkt_reltoken(&map->token);
1346 return(error);
1349 docow = MAP_PREFAULT_PARTIAL;
1350 flags &= ~(MAP_PRIVATE|MAP_COPY);
1351 flags |= MAP_SHARED;
1352 } else {
1354 * Regular file mapping (typically). The attribute
1355 * check is for the link count test only. mmapable
1356 * vnodes must already have a VM object assigned.
1358 struct vattr vat;
1359 int error;
1361 error = VOP_GETATTR(vp, &vat);
1362 if (error) {
1363 lwkt_reltoken(&map->token);
1364 return (error);
1366 docow = MAP_PREFAULT_PARTIAL;
1367 object = vnode_pager_reference(vp);
1368 if (object == NULL && vp->v_type == VREG) {
1369 lwkt_reltoken(&map->token);
1370 kprintf("Warning: cannot mmap vnode %p, no "
1371 "object\n", vp);
1372 return(EINVAL);
1376 * If it is a regular file without any references
1377 * we do not need to sync it.
1379 if (vp->v_type == VREG && vat.va_nlink == 0) {
1380 flags |= MAP_NOSYNC;
1386 * Deal with the adjusted flags
1388 if ((flags & (MAP_ANON|MAP_SHARED)) == 0)
1389 docow |= MAP_COPY_ON_WRITE;
1390 if (flags & MAP_NOSYNC)
1391 docow |= MAP_DISABLE_SYNCER;
1392 if (flags & MAP_NOCORE)
1393 docow |= MAP_DISABLE_COREDUMP;
1396 * This may place the area in its own page directory if (size) is
1397 * large enough, otherwise it typically returns its argument.
1399 * (object can be NULL)
1401 if (fitit) {
1402 *addr = pmap_addr_hint(object, *addr, size);
1406 * Stack mappings need special attention.
1408 * Mappings that use virtual page tables will default to storing
1409 * the page table at offset 0.
1411 if (uksmap) {
1412 rv = vm_map_find(map, uksmap, vp->v_rdev,
1413 foff, addr, size,
1414 align, fitit,
1415 VM_MAPTYPE_UKSMAP, VM_SUBSYS_MMAP,
1416 prot, maxprot, docow);
1417 } else if (flags & MAP_STACK) {
1418 rv = vm_map_stack(map, *addr, size, flags,
1419 prot, maxprot, docow);
1420 } else if (flags & MAP_VPAGETABLE) {
1421 rv = vm_map_find(map, object, NULL,
1422 foff, addr, size,
1423 align, fitit,
1424 VM_MAPTYPE_VPAGETABLE, VM_SUBSYS_MMAP,
1425 prot, maxprot, docow);
1426 } else {
1427 rv = vm_map_find(map, object, NULL,
1428 foff, addr, size,
1429 align, fitit,
1430 VM_MAPTYPE_NORMAL, VM_SUBSYS_MMAP,
1431 prot, maxprot, docow);
1434 if (rv != KERN_SUCCESS) {
1436 * Lose the object reference. Will destroy the
1437 * object if it's an unnamed anonymous mapping
1438 * or named anonymous without other references.
1440 * (NOTE: object can be NULL)
1442 vm_object_deallocate(object);
1443 goto out;
1447 * Shared memory is also shared with children.
1449 if (flags & (MAP_SHARED|MAP_INHERIT)) {
1450 rv = vm_map_inherit(map, *addr, *addr + size, VM_INHERIT_SHARE);
1451 if (rv != KERN_SUCCESS) {
1452 vm_map_remove(map, *addr, *addr + size);
1453 goto out;
1457 /* If a process has marked all future mappings for wiring, do so */
1458 if ((rv == KERN_SUCCESS) && (map->flags & MAP_WIREFUTURE))
1459 vm_map_unwire(map, *addr, *addr + size, FALSE);
1462 * Set the access time on the vnode
1464 if (vp != NULL)
1465 vn_mark_atime(vp, td);
1466 out:
1467 lwkt_reltoken(&map->token);
1469 switch (rv) {
1470 case KERN_SUCCESS:
1471 return (0);
1472 case KERN_INVALID_ADDRESS:
1473 case KERN_NO_SPACE:
1474 return (ENOMEM);
1475 case KERN_PROTECTION_FAILURE:
1476 return (EACCES);
1477 default:
1478 return (EINVAL);
1483 * Translate a Mach VM return code to zero on success or the appropriate errno
1484 * on failure.
1487 vm_mmap_to_errno(int rv)
1490 switch (rv) {
1491 case KERN_SUCCESS:
1492 return (0);
1493 case KERN_INVALID_ADDRESS:
1494 case KERN_NO_SPACE:
1495 return (ENOMEM);
1496 case KERN_PROTECTION_FAILURE:
1497 return (EACCES);
1498 default:
1499 return (EINVAL);