2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1991, 1993
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
7 * the Systems Programming Group of the University of Utah Computer
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * from: Utah $Hdr: vm_mmap.c 1.6 91/10/21$
40 * @(#)vm_mmap.c 8.4 (Berkeley) 1/12/94
41 * $FreeBSD: src/sys/vm/vm_mmap.c,v 1.108.2.6 2002/07/02 20:06:19 dillon Exp $
42 * $DragonFly: src/sys/vm/vm_mmap.c,v 1.3 2003/06/23 17:55:51 dillon Exp $
46 * Mapped file (mmap) interface to VM
49 #include "opt_compat.h"
51 #include <sys/param.h>
52 #include <sys/kernel.h>
53 #include <sys/systm.h>
54 #include <sys/sysproto.h>
55 #include <sys/filedesc.h>
57 #include <sys/resource.h>
58 #include <sys/resourcevar.h>
59 #include <sys/vnode.h>
60 #include <sys/fcntl.h>
65 #include <sys/vmmeter.h>
66 #include <sys/sysctl.h>
69 #include <vm/vm_param.h>
72 #include <vm/vm_map.h>
73 #include <vm/vm_object.h>
74 #include <vm/vm_page.h>
75 #include <vm/vm_pager.h>
76 #include <vm/vm_pageout.h>
77 #include <vm/vm_extern.h>
78 #include <vm/vm_page.h>
79 #include <vm/vm_kern.h>
81 #ifndef _SYS_SYSPROTO_H_
87 static int max_proc_mmap;
88 SYSCTL_INT(_vm, OID_AUTO, max_proc_mmap, CTLFLAG_RW, &max_proc_mmap, 0, "");
91 * Set the maximum number of vm_map_entry structures per process. Roughly
92 * speaking vm_map_entry structures are tiny, so allowing them to eat 1/100
93 * of our KVM malloc space still results in generous limits. We want a
94 * default that is good enough to prevent the kernel running out of resources
95 * if attacked from compromised user account but generous enough such that
96 * multi-threaded processes are not unduly inconvenienced.
99 static void vmmapentry_rsrc_init __P((void *));
100 SYSINIT(vmmersrc, SI_SUB_KVM_RSRC, SI_ORDER_FIRST, vmmapentry_rsrc_init, NULL)
103 vmmapentry_rsrc_init(dummy)
106 max_proc_mmap = vm_kmem_size / sizeof(struct vm_map_entry);
107 max_proc_mmap /= 100;
112 sbrk(struct sbrk_args *uap)
114 /* Not yet implemented */
119 * sstk_args(int incr)
123 sstk(struct sstk_args *uap)
125 /* Not yet implemented */
129 #if defined(COMPAT_43) || defined(COMPAT_SUNOS)
132 * getpagesize_args(int dummy)
136 ogetpagesize(struct getpagesize_args *uap)
138 struct proc *p = curproc;
139 p->p_retval[0] = PAGE_SIZE;
142 #endif /* COMPAT_43 || COMPAT_SUNOS */
146 * mmap_args(void *addr, size_t len, int prot, int flags, int fd,
147 * long pad, off_t pos)
149 * Memory Map (mmap) system call. Note that the file offset
150 * and address are allowed to be NOT page aligned, though if
151 * the MAP_FIXED flag it set, both must have the same remainder
152 * modulo the PAGE_SIZE (POSIX 1003.1b). If the address is not
153 * page-aligned, the actual mapping starts at trunc_page(addr)
154 * and the return value is adjusted up by the page offset.
156 * Generally speaking, only character devices which are themselves
157 * memory-based, such as a video framebuffer, can be mmap'd. Otherwise
158 * there would be no cache coherency between a descriptor and a VM mapping
159 * both to the same character device.
161 * Block devices can be mmap'd no matter what they represent. Cache coherency
162 * is maintained as long as you do not write directly to the underlying
167 mmap(struct mmap_args *uap)
169 struct proc *p = curproc;
170 struct filedesc *fdp = p->p_fd;
171 struct file *fp = NULL;
174 vm_size_t size, pageoff;
175 vm_prot_t prot, maxprot;
178 int disablexworkaround;
180 struct vmspace *vms = p->p_vmspace;
183 addr = (vm_offset_t) uap->addr;
185 prot = uap->prot & VM_PROT_ALL;
189 /* make sure mapping fits into numeric range etc */
190 if ((ssize_t) uap->len < 0 ||
191 ((flags & MAP_ANON) && uap->fd != -1))
194 if (flags & MAP_STACK) {
195 if ((uap->fd != -1) ||
196 ((prot & (PROT_READ | PROT_WRITE)) != (PROT_READ | PROT_WRITE)))
203 * Align the file position to a page boundary,
204 * and save its page offset component.
206 pageoff = (pos & PAGE_MASK);
209 /* Adjust size for rounding (on both ends). */
210 size += pageoff; /* low end... */
211 size = (vm_size_t) round_page(size); /* hi end */
214 * Check for illegal addresses. Watch out for address wrap... Note
215 * that VM_*_ADDRESS are not constants due to casts (argh).
217 if (flags & MAP_FIXED) {
219 * The specified address must have the same remainder
220 * as the file offset taken modulo PAGE_SIZE, so it
221 * should be aligned after adjustment by pageoff.
224 if (addr & PAGE_MASK)
226 /* Address range must be all in user VM space. */
227 if (VM_MAXUSER_ADDRESS > 0 && addr + size > VM_MAXUSER_ADDRESS)
230 if (VM_MIN_ADDRESS > 0 && addr < VM_MIN_ADDRESS)
233 if (addr + size < addr)
237 * XXX for non-fixed mappings where no hint is provided or
238 * the hint would fall in the potential heap space,
239 * place it after the end of the largest possible heap.
241 * There should really be a pmap call to determine a reasonable
244 else if (addr == 0 ||
245 (addr >= round_page((vm_offset_t)vms->vm_taddr) &&
246 addr < round_page((vm_offset_t)vms->vm_daddr + maxdsiz)))
247 addr = round_page((vm_offset_t)vms->vm_daddr + maxdsiz);
249 if (flags & MAP_ANON) {
251 * Mapping blank space is trivial.
254 maxprot = VM_PROT_ALL;
258 * Mapping file, get fp for validation. Obtain vnode and make
259 * sure it is of appropriate type.
261 if (((unsigned) uap->fd) >= fdp->fd_nfiles ||
262 (fp = fdp->fd_ofiles[uap->fd]) == NULL)
264 if (fp->f_type != DTYPE_VNODE)
267 * POSIX shared-memory objects are defined to have
268 * kernel persistence, and are not defined to support
269 * read(2)/write(2) -- or even open(2). Thus, we can
270 * use MAP_ASYNC to trade on-disk coherence for speed.
271 * The shm_open(3) library routine turns on the FPOSIXSHM
272 * flag to request this behavior.
274 if (fp->f_flag & FPOSIXSHM)
276 vp = (struct vnode *) fp->f_data;
277 if (vp->v_type != VREG && vp->v_type != VCHR)
279 if (vp->v_type == VREG) {
281 * Get the proper underlying object
283 if (VOP_GETVOBJECT(vp, &obj) != 0)
285 vp = (struct vnode*)obj->handle;
289 * don't let the descriptor disappear on us if we block
294 * XXX hack to handle use of /dev/zero to map anon memory (ala
297 if (vp->v_type == VCHR && iszerodev(vp->v_rdev)) {
299 maxprot = VM_PROT_ALL;
304 * cdevs does not provide private mappings of any kind.
307 * However, for XIG X server to continue to work,
308 * we should allow the superuser to do it anyway.
309 * We only allow it at securelevel < 1.
310 * (Because the XIG X server writes directly to video
311 * memory via /dev/mem, it should never work at any
313 * XXX this will have to go
315 if (securelevel >= 1)
316 disablexworkaround = 1;
318 disablexworkaround = suser_xxx(p->p_ucred, 0);
319 if (vp->v_type == VCHR && disablexworkaround &&
320 (flags & (MAP_PRIVATE|MAP_COPY))) {
325 * Ensure that file and memory protections are
326 * compatible. Note that we only worry about
327 * writability if mapping is shared; in this case,
328 * current and max prot are dictated by the open file.
329 * XXX use the vnode instead? Problem is: what
330 * credentials do we use for determination? What if
331 * proc does a setuid?
333 maxprot = VM_PROT_EXECUTE; /* ??? */
334 if (fp->f_flag & FREAD) {
335 maxprot |= VM_PROT_READ;
336 } else if (prot & PROT_READ) {
341 * If we are sharing potential changes (either via
342 * MAP_SHARED or via the implicit sharing of character
343 * device mappings), and we are trying to get write
344 * permission although we opened it without asking
345 * for it, bail out. Check for superuser, only if
346 * we're at securelevel < 1, to allow the XIG X server
347 * to continue to work.
350 if ((flags & MAP_SHARED) != 0 ||
351 (vp->v_type == VCHR && disablexworkaround)) {
352 if ((fp->f_flag & FWRITE) != 0) {
360 (IMMUTABLE|APPEND)) == 0) {
361 maxprot |= VM_PROT_WRITE;
362 } else if (prot & PROT_WRITE) {
366 } else if ((prot & PROT_WRITE) != 0) {
371 maxprot |= VM_PROT_WRITE;
378 * Do not allow more then a certain number of vm_map_entry structures
379 * per process. Scale with the number of rforks sharing the map
380 * to make the limit reasonable for threads.
383 vms->vm_map.nentries >= max_proc_mmap * vms->vm_refcnt) {
388 error = vm_mmap(&vms->vm_map, &addr, size, prot, maxprot,
391 p->p_retval[0] = (register_t) (addr + pageoff);
400 * ommap_args(caddr_t addr, int len, int prot, int flags, int fd, long pos)
403 ommap(struct ommap_args *uap)
405 struct mmap_args nargs;
406 static const char cvtbsdprot[8] = {
410 PROT_EXEC | PROT_WRITE,
412 PROT_EXEC | PROT_READ,
413 PROT_WRITE | PROT_READ,
414 PROT_EXEC | PROT_WRITE | PROT_READ,
417 #define OMAP_ANON 0x0002
418 #define OMAP_COPY 0x0020
419 #define OMAP_SHARED 0x0010
420 #define OMAP_FIXED 0x0100
421 #define OMAP_INHERIT 0x0800
423 nargs.addr = uap->addr;
424 nargs.len = uap->len;
425 nargs.prot = cvtbsdprot[uap->prot & 0x7];
427 if (uap->flags & OMAP_ANON)
428 nargs.flags |= MAP_ANON;
429 if (uap->flags & OMAP_COPY)
430 nargs.flags |= MAP_COPY;
431 if (uap->flags & OMAP_SHARED)
432 nargs.flags |= MAP_SHARED;
434 nargs.flags |= MAP_PRIVATE;
435 if (uap->flags & OMAP_FIXED)
436 nargs.flags |= MAP_FIXED;
437 if (uap->flags & OMAP_INHERIT)
438 nargs.flags |= MAP_INHERIT;
440 nargs.pos = uap->pos;
441 return (mmap(&nargs));
443 #endif /* COMPAT_43 */
447 * msync_args(void *addr, int len, int flags)
450 msync(struct msync_args *uap)
452 struct proc *p = curproc;
454 vm_size_t size, pageoff;
459 addr = (vm_offset_t) uap->addr;
463 pageoff = (addr & PAGE_MASK);
466 size = (vm_size_t) round_page(size);
467 if (addr + size < addr)
470 if ((flags & (MS_ASYNC|MS_INVALIDATE)) == (MS_ASYNC|MS_INVALIDATE))
473 map = &p->p_vmspace->vm_map;
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.
483 vm_map_entry_t entry;
485 vm_map_lock_read(map);
486 rv = vm_map_lookup_entry(map, addr, &entry);
487 vm_map_unlock_read(map);
491 size = entry->end - entry->start;
495 * Clean the pages and interpret the return value.
497 rv = vm_map_clean(map, addr, addr + size, (flags & MS_ASYNC) == 0,
498 (flags & MS_INVALIDATE) != 0);
503 case KERN_INVALID_ADDRESS:
504 return (EINVAL); /* Sun returns ENOMEM? */
515 * munmap_args(void *addr, size_t len)
518 munmap(struct munmap_args *uap)
520 struct proc *p = curproc;
522 vm_size_t size, pageoff;
525 addr = (vm_offset_t) uap->addr;
528 pageoff = (addr & PAGE_MASK);
531 size = (vm_size_t) round_page(size);
532 if (addr + size < addr)
539 * Check for illegal addresses. Watch out for address wrap... Note
540 * that VM_*_ADDRESS are not constants due to casts (argh).
542 if (VM_MAXUSER_ADDRESS > 0 && addr + size > VM_MAXUSER_ADDRESS)
545 if (VM_MIN_ADDRESS > 0 && addr < VM_MIN_ADDRESS)
548 map = &p->p_vmspace->vm_map;
550 * Make sure entire range is allocated.
552 if (!vm_map_check_protection(map, addr, addr + size, VM_PROT_NONE))
554 /* returns nothing but KERN_SUCCESS anyway */
555 (void) vm_map_remove(map, addr, addr + size);
566 * XXX should unmap any regions mapped to this file
568 p->p_fd->fd_ofileflags[fd] &= ~UF_MAPPED;
573 * mprotect_args(const void *addr, size_t len, int prot)
576 mprotect(struct mprotect_args *uap)
578 struct proc *p = curproc;
580 vm_size_t size, pageoff;
581 register vm_prot_t prot;
583 addr = (vm_offset_t) uap->addr;
585 prot = uap->prot & VM_PROT_ALL;
586 #if defined(VM_PROT_READ_IS_EXEC)
587 if (prot & VM_PROT_READ)
588 prot |= VM_PROT_EXECUTE;
591 pageoff = (addr & PAGE_MASK);
594 size = (vm_size_t) round_page(size);
595 if (addr + size < addr)
598 switch (vm_map_protect(&p->p_vmspace->vm_map, addr, addr + size, prot,
602 case KERN_PROTECTION_FAILURE:
609 * minherit_args(void *addr, size_t len, int inherit)
612 minherit(struct minherit_args *uap)
614 struct proc *p = curproc;
616 vm_size_t size, pageoff;
617 register vm_inherit_t inherit;
619 addr = (vm_offset_t)uap->addr;
621 inherit = uap->inherit;
623 pageoff = (addr & PAGE_MASK);
626 size = (vm_size_t) round_page(size);
627 if (addr + size < addr)
630 switch (vm_map_inherit(&p->p_vmspace->vm_map, addr, addr+size,
634 case KERN_PROTECTION_FAILURE:
641 * madvise_args(void *addr, size_t len, int behav)
645 madvise(struct madvise_args *uap)
647 struct proc *p = curproc;
648 vm_offset_t start, end;
651 * Check for illegal behavior
653 if (uap->behav < 0 || uap->behav > MADV_CORE)
656 * Check for illegal addresses. Watch out for address wrap... Note
657 * that VM_*_ADDRESS are not constants due to casts (argh).
659 if (VM_MAXUSER_ADDRESS > 0 &&
660 ((vm_offset_t) uap->addr + uap->len) > VM_MAXUSER_ADDRESS)
663 if (VM_MIN_ADDRESS > 0 && uap->addr < VM_MIN_ADDRESS)
666 if (((vm_offset_t) uap->addr + uap->len) < (vm_offset_t) uap->addr)
670 * Since this routine is only advisory, we default to conservative
673 start = trunc_page((vm_offset_t) uap->addr);
674 end = round_page((vm_offset_t) uap->addr + uap->len);
676 if (vm_map_madvise(&p->p_vmspace->vm_map, start, end, uap->behav))
682 * mincore_args(const void *addr, size_t len, char *vec)
686 mincore(struct mincore_args *uap)
688 struct proc *p = curproc;
689 vm_offset_t addr, first_addr;
690 vm_offset_t end, cend;
695 int vecindex, lastvecindex;
696 register vm_map_entry_t current;
697 vm_map_entry_t entry;
699 unsigned int timestamp;
702 * Make sure that the addresses presented are valid for user
705 first_addr = addr = trunc_page((vm_offset_t) uap->addr);
706 end = addr + (vm_size_t)round_page(uap->len);
707 if (VM_MAXUSER_ADDRESS > 0 && end > VM_MAXUSER_ADDRESS)
713 * Address of byte vector
717 map = &p->p_vmspace->vm_map;
718 pmap = vmspace_pmap(p->p_vmspace);
720 vm_map_lock_read(map);
722 timestamp = map->timestamp;
724 if (!vm_map_lookup_entry(map, addr, &entry))
728 * Do this on a map entry basis so that if the pages are not
729 * in the current processes address space, we can easily look
730 * up the pages elsewhere.
734 (current != &map->header) && (current->start < end);
735 current = current->next) {
738 * ignore submaps (for now) or null objects
740 if ((current->eflags & MAP_ENTRY_IS_SUB_MAP) ||
741 current->object.vm_object == NULL)
745 * limit this scan to the current map entry and the
746 * limits for the mincore call
748 if (addr < current->start)
749 addr = current->start;
755 * scan this entry one page at a time
759 * Check pmap first, it is likely faster, also
760 * it can provide info as to whether we are the
761 * one referencing or modifying the page.
763 mincoreinfo = pmap_mincore(pmap, addr);
769 * calculate the page index into the object
771 offset = current->offset + (addr - current->start);
772 pindex = OFF_TO_IDX(offset);
773 m = vm_page_lookup(current->object.vm_object,
776 * if the page is resident, then gather information about
780 mincoreinfo = MINCORE_INCORE;
783 mincoreinfo |= MINCORE_MODIFIED_OTHER;
784 if ((m->flags & PG_REFERENCED) ||
785 pmap_ts_referenced(m)) {
786 vm_page_flag_set(m, PG_REFERENCED);
787 mincoreinfo |= MINCORE_REFERENCED_OTHER;
793 * subyte may page fault. In case it needs to modify
794 * the map, we release the lock.
796 vm_map_unlock_read(map);
799 * calculate index into user supplied byte vector
801 vecindex = OFF_TO_IDX(addr - first_addr);
804 * If we have skipped map entries, we need to make sure that
805 * the byte vector is zeroed for those skipped entries.
807 while((lastvecindex + 1) < vecindex) {
808 error = subyte( vec + lastvecindex, 0);
816 * Pass the page information to the user
818 error = subyte( vec + vecindex, mincoreinfo);
824 * If the map has changed, due to the subyte, the previous
825 * output may be invalid.
827 vm_map_lock_read(map);
828 if (timestamp != map->timestamp)
831 lastvecindex = vecindex;
837 * subyte may page fault. In case it needs to modify
838 * the map, we release the lock.
840 vm_map_unlock_read(map);
843 * Zero the last entries in the byte vector.
845 vecindex = OFF_TO_IDX(end - first_addr);
846 while((lastvecindex + 1) < vecindex) {
847 error = subyte( vec + lastvecindex, 0);
855 * If the map has changed, due to the subyte, the previous
856 * output may be invalid.
858 vm_map_lock_read(map);
859 if (timestamp != map->timestamp)
861 vm_map_unlock_read(map);
867 * mlock_args(const void *addr, size_t len)
870 mlock(struct mlock_args *uap)
873 vm_size_t size, pageoff;
875 struct proc *p = curproc;
877 addr = (vm_offset_t) uap->addr;
880 pageoff = (addr & PAGE_MASK);
883 size = (vm_size_t) round_page(size);
885 /* disable wrap around */
886 if (addr + size < addr)
889 if (atop(size) + cnt.v_wire_count > vm_page_max_wired)
892 #ifdef pmap_wired_count
893 if (size + ptoa(pmap_wired_count(vm_map_pmap(&p->p_vmspace->vm_map))) >
894 p->p_rlimit[RLIMIT_MEMLOCK].rlim_cur)
897 error = suser_xxx(p->p_ucred, 0);
902 error = vm_map_user_pageable(&p->p_vmspace->vm_map, addr, addr + size, FALSE);
903 return (error == KERN_SUCCESS ? 0 : ENOMEM);
907 * mlockall_args(int how)
910 mlockall(struct mlockall_args *uap)
916 * mlockall_args(int how)
919 munlockall(struct munlockall_args *uap)
925 * munlock_args(const void *addr, size_t len)
928 munlock(struct munlock_args *uap)
931 vm_size_t size, pageoff;
933 struct proc *p = curproc;
935 addr = (vm_offset_t) uap->addr;
938 pageoff = (addr & PAGE_MASK);
941 size = (vm_size_t) round_page(size);
943 /* disable wrap around */
944 if (addr + size < addr)
947 #ifndef pmap_wired_count
953 error = vm_map_user_pageable(&p->p_vmspace->vm_map, addr, addr + size, TRUE);
954 return (error == KERN_SUCCESS ? 0 : ENOMEM);
958 * Internal version of mmap.
959 * Currently used by mmap, exec, and sys5 shared memory.
960 * Handle is either a vnode pointer or NULL for MAP_ANON.
963 vm_mmap(vm_map_t map, vm_offset_t *addr, vm_size_t size, vm_prot_t prot,
964 vm_prot_t maxprot, int flags,
970 struct vnode *vp = NULL;
972 int rv = KERN_SUCCESS;
973 vm_ooffset_t objsize;
975 struct proc *p = curproc;
980 objsize = size = round_page(size);
982 if (p->p_vmspace->vm_map.size + size >
983 p->p_rlimit[RLIMIT_VMEM].rlim_cur) {
988 * We currently can only deal with page aligned file offsets.
989 * The check is here rather than in the syscall because the
990 * kernel calls this function internally for other mmaping
991 * operations (such as in exec) and non-aligned offsets will
992 * cause pmap inconsistencies...so we want to be sure to
993 * disallow this in all cases.
995 if (foff & PAGE_MASK)
998 if ((flags & MAP_FIXED) == 0) {
1000 *addr = round_page(*addr);
1002 if (*addr != trunc_page(*addr))
1005 (void) vm_map_remove(map, *addr, *addr + size);
1009 * Lookup/allocate object.
1011 if (flags & MAP_ANON) {
1012 type = OBJT_DEFAULT;
1014 * Unnamed anonymous regions always start at 0.
1019 vp = (struct vnode *) handle;
1020 if (vp->v_type == VCHR) {
1022 handle = (void *)(intptr_t)vp->v_rdev;
1027 error = VOP_GETATTR(vp, &vat, p->p_ucred, p);
1030 objsize = round_page(vat.va_size);
1033 * if it is a regular file without any references
1034 * we do not need to sync it.
1036 if (vp->v_type == VREG && vat.va_nlink == 0) {
1037 flags |= MAP_NOSYNC;
1042 if (handle == NULL) {
1046 object = vm_pager_allocate(type,
1047 handle, objsize, prot, foff);
1049 return (type == OBJT_DEVICE ? EINVAL : ENOMEM);
1050 docow = MAP_PREFAULT_PARTIAL;
1054 * Force device mappings to be shared.
1056 if (type == OBJT_DEVICE || type == OBJT_PHYS) {
1057 flags &= ~(MAP_PRIVATE|MAP_COPY);
1058 flags |= MAP_SHARED;
1061 if ((flags & (MAP_ANON|MAP_SHARED)) == 0)
1062 docow |= MAP_COPY_ON_WRITE;
1063 if (flags & MAP_NOSYNC)
1064 docow |= MAP_DISABLE_SYNCER;
1065 if (flags & MAP_NOCORE)
1066 docow |= MAP_DISABLE_COREDUMP;
1068 #if defined(VM_PROT_READ_IS_EXEC)
1069 if (prot & VM_PROT_READ)
1070 prot |= VM_PROT_EXECUTE;
1072 if (maxprot & VM_PROT_READ)
1073 maxprot |= VM_PROT_EXECUTE;
1077 *addr = pmap_addr_hint(object, *addr, size);
1080 if (flags & MAP_STACK)
1081 rv = vm_map_stack (map, *addr, size, prot,
1084 rv = vm_map_find(map, object, foff, addr, size, fitit,
1085 prot, maxprot, docow);
1087 if (rv != KERN_SUCCESS) {
1089 * Lose the object reference. Will destroy the
1090 * object if it's an unnamed anonymous mapping
1091 * or named anonymous without other references.
1093 vm_object_deallocate(object);
1098 * Shared memory is also shared with children.
1100 if (flags & (MAP_SHARED|MAP_INHERIT)) {
1101 rv = vm_map_inherit(map, *addr, *addr + size, VM_INHERIT_SHARE);
1102 if (rv != KERN_SUCCESS) {
1103 (void) vm_map_remove(map, *addr, *addr + size);
1111 case KERN_INVALID_ADDRESS:
1114 case KERN_PROTECTION_FAILURE: