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.24 2006/03/27 01:54:18 dillon Exp $
46 * Mapped file (mmap) interface to VM
49 #include <sys/param.h>
50 #include <sys/kernel.h>
51 #include <sys/systm.h>
52 #include <sys/sysproto.h>
53 #include <sys/filedesc.h>
54 #include <sys/kern_syscall.h>
56 #include <sys/resource.h>
57 #include <sys/resourcevar.h>
58 #include <sys/vnode.h>
59 #include <sys/fcntl.h>
64 #include <sys/vmmeter.h>
65 #include <sys/sysctl.h>
68 #include <vm/vm_param.h>
71 #include <vm/vm_map.h>
72 #include <vm/vm_object.h>
73 #include <vm/vm_page.h>
74 #include <vm/vm_pager.h>
75 #include <vm/vm_pageout.h>
76 #include <vm/vm_extern.h>
77 #include <vm/vm_page.h>
78 #include <vm/vm_kern.h>
80 #include <sys/file2.h>
81 #include <sys/thread2.h>
83 static int max_proc_mmap;
84 SYSCTL_INT(_vm, OID_AUTO, max_proc_mmap, CTLFLAG_RW, &max_proc_mmap, 0, "");
87 * Set the maximum number of vm_map_entry structures per process. Roughly
88 * speaking vm_map_entry structures are tiny, so allowing them to eat 1/100
89 * of our KVM malloc space still results in generous limits. We want a
90 * default that is good enough to prevent the kernel running out of resources
91 * if attacked from compromised user account but generous enough such that
92 * multi-threaded processes are not unduly inconvenienced.
95 static void vmmapentry_rsrc_init (void *);
96 SYSINIT(vmmersrc, SI_SUB_KVM_RSRC, SI_ORDER_FIRST, vmmapentry_rsrc_init, NULL)
99 vmmapentry_rsrc_init(void *dummy)
101 max_proc_mmap = (VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) /
102 sizeof(struct vm_map_entry);
103 max_proc_mmap /= 100;
108 sbrk(struct sbrk_args *uap)
110 /* Not yet implemented */
115 * sstk_args(int incr)
119 sstk(struct sstk_args *uap)
121 /* Not yet implemented */
126 * mmap_args(void *addr, size_t len, int prot, int flags, int fd,
127 * long pad, off_t pos)
129 * Memory Map (mmap) system call. Note that the file offset
130 * and address are allowed to be NOT page aligned, though if
131 * the MAP_FIXED flag it set, both must have the same remainder
132 * modulo the PAGE_SIZE (POSIX 1003.1b). If the address is not
133 * page-aligned, the actual mapping starts at trunc_page(addr)
134 * and the return value is adjusted up by the page offset.
136 * Generally speaking, only character devices which are themselves
137 * memory-based, such as a video framebuffer, can be mmap'd. Otherwise
138 * there would be no cache coherency between a descriptor and a VM mapping
139 * both to the same character device.
141 * Block devices can be mmap'd no matter what they represent. Cache coherency
142 * is maintained as long as you do not write directly to the underlying
147 kern_mmap(caddr_t uaddr, size_t ulen, int uprot, int uflags, int fd,
148 off_t upos, void **res)
150 struct thread *td = curthread;
151 struct proc *p = td->td_proc;
152 struct filedesc *fdp = p->p_fd;
153 struct file *fp = NULL;
156 vm_size_t size, pageoff;
157 vm_prot_t prot, maxprot;
160 int disablexworkaround;
162 struct vmspace *vms = p->p_vmspace;
167 addr = (vm_offset_t) uaddr;
169 prot = uprot & VM_PROT_ALL;
173 /* make sure mapping fits into numeric range etc */
174 if ((ssize_t) ulen < 0 ||
175 ((flags & MAP_ANON) && fd != -1))
178 if (flags & MAP_STACK) {
180 ((prot & (PROT_READ | PROT_WRITE)) != (PROT_READ | PROT_WRITE)))
187 * Align the file position to a page boundary,
188 * and save its page offset component.
190 pageoff = (pos & PAGE_MASK);
193 /* Adjust size for rounding (on both ends). */
194 size += pageoff; /* low end... */
195 size = (vm_size_t) round_page(size); /* hi end */
198 * Check for illegal addresses. Watch out for address wrap... Note
199 * that VM_*_ADDRESS are not constants due to casts (argh).
201 if (flags & MAP_FIXED) {
203 * The specified address must have the same remainder
204 * as the file offset taken modulo PAGE_SIZE, so it
205 * should be aligned after adjustment by pageoff.
208 if (addr & PAGE_MASK)
210 /* Address range must be all in user VM space. */
211 if (VM_MAXUSER_ADDRESS > 0 && addr + size > VM_MAXUSER_ADDRESS)
214 if (VM_MIN_ADDRESS > 0 && addr < VM_MIN_ADDRESS)
217 if (addr + size < addr)
221 * XXX for non-fixed mappings where no hint is provided or
222 * the hint would fall in the potential heap space,
223 * place it after the end of the largest possible heap.
225 * There should really be a pmap call to determine a reasonable
228 else if (addr == 0 ||
229 (addr >= round_page((vm_offset_t)vms->vm_taddr) &&
230 addr < round_page((vm_offset_t)vms->vm_daddr + maxdsiz)))
231 addr = round_page((vm_offset_t)vms->vm_daddr + maxdsiz);
233 if (flags & MAP_ANON) {
235 * Mapping blank space is trivial.
238 maxprot = VM_PROT_ALL;
242 * Mapping file, get fp for validation. Obtain vnode and make
243 * sure it is of appropriate type.
245 if (((unsigned) fd) >= fdp->fd_nfiles ||
246 (fp = fdp->fd_files[fd].fp) == NULL)
248 if (fp->f_type != DTYPE_VNODE)
251 * POSIX shared-memory objects are defined to have
252 * kernel persistence, and are not defined to support
253 * read(2)/write(2) -- or even open(2). Thus, we can
254 * use MAP_ASYNC to trade on-disk coherence for speed.
255 * The shm_open(3) library routine turns on the FPOSIXSHM
256 * flag to request this behavior.
258 if (fp->f_flag & FPOSIXSHM)
260 vp = (struct vnode *) fp->f_data;
261 if (vp->v_type != VREG && vp->v_type != VCHR)
263 if (vp->v_type == VREG) {
265 * Get the proper underlying object
267 if (VOP_GETVOBJECT(vp, &obj) != 0)
269 vp = (struct vnode*)obj->handle;
273 * don't let the descriptor disappear on us if we block
278 * XXX hack to handle use of /dev/zero to map anon memory (ala
281 if (vp->v_type == VCHR && iszerodev(vp->v_rdev)) {
283 maxprot = VM_PROT_ALL;
288 * cdevs does not provide private mappings of any kind.
291 * However, for XIG X server to continue to work,
292 * we should allow the superuser to do it anyway.
293 * We only allow it at securelevel < 1.
294 * (Because the XIG X server writes directly to video
295 * memory via /dev/mem, it should never work at any
297 * XXX this will have to go
299 if (securelevel >= 1)
300 disablexworkaround = 1;
302 disablexworkaround = suser(td);
303 if (vp->v_type == VCHR && disablexworkaround &&
304 (flags & (MAP_PRIVATE|MAP_COPY))) {
309 * Ensure that file and memory protections are
310 * compatible. Note that we only worry about
311 * writability if mapping is shared; in this case,
312 * current and max prot are dictated by the open file.
313 * XXX use the vnode instead? Problem is: what
314 * credentials do we use for determination? What if
315 * proc does a setuid?
317 maxprot = VM_PROT_EXECUTE; /* ??? */
318 if (fp->f_flag & FREAD) {
319 maxprot |= VM_PROT_READ;
320 } else if (prot & PROT_READ) {
325 * If we are sharing potential changes (either via
326 * MAP_SHARED or via the implicit sharing of character
327 * device mappings), and we are trying to get write
328 * permission although we opened it without asking
329 * for it, bail out. Check for superuser, only if
330 * we're at securelevel < 1, to allow the XIG X server
331 * to continue to work.
334 if ((flags & MAP_SHARED) != 0 ||
335 (vp->v_type == VCHR && disablexworkaround)) {
336 if ((fp->f_flag & FWRITE) != 0) {
338 if ((error = VOP_GETATTR(vp, &va, td))) {
342 (IMMUTABLE|APPEND)) == 0) {
343 maxprot |= VM_PROT_WRITE;
344 } else if (prot & PROT_WRITE) {
348 } else if ((prot & PROT_WRITE) != 0) {
353 maxprot |= VM_PROT_WRITE;
360 * Do not allow more then a certain number of vm_map_entry structures
361 * per process. Scale with the number of rforks sharing the map
362 * to make the limit reasonable for threads.
365 vms->vm_map.nentries >= max_proc_mmap * vms->vm_refcnt) {
370 error = vm_mmap(&vms->vm_map, &addr, size, prot, maxprot,
373 *res = (void *)(addr + pageoff);
381 mmap(struct mmap_args *uap)
385 error = kern_mmap(uap->addr, uap->len, uap->prot, uap->flags,
386 uap->fd, uap->pos, &uap->sysmsg_resultp);
392 * msync_args(void *addr, int len, int flags)
395 msync(struct msync_args *uap)
397 struct proc *p = curproc;
399 vm_size_t size, pageoff;
404 addr = (vm_offset_t) uap->addr;
408 pageoff = (addr & PAGE_MASK);
411 size = (vm_size_t) round_page(size);
412 if (addr + size < addr)
415 if ((flags & (MS_ASYNC|MS_INVALIDATE)) == (MS_ASYNC|MS_INVALIDATE))
418 map = &p->p_vmspace->vm_map;
421 * XXX Gak! If size is zero we are supposed to sync "all modified
422 * pages with the region containing addr". Unfortunately, we don't
423 * really keep track of individual mmaps so we approximate by flushing
424 * the range of the map entry containing addr. This can be incorrect
425 * if the region splits or is coalesced with a neighbor.
428 vm_map_entry_t entry;
430 vm_map_lock_read(map);
431 rv = vm_map_lookup_entry(map, addr, &entry);
432 vm_map_unlock_read(map);
436 size = entry->end - entry->start;
440 * Clean the pages and interpret the return value.
442 rv = vm_map_clean(map, addr, addr + size, (flags & MS_ASYNC) == 0,
443 (flags & MS_INVALIDATE) != 0);
448 case KERN_INVALID_ADDRESS:
449 return (EINVAL); /* Sun returns ENOMEM? */
460 * munmap_args(void *addr, size_t len)
463 munmap(struct munmap_args *uap)
465 struct proc *p = curproc;
467 vm_size_t size, pageoff;
470 addr = (vm_offset_t) uap->addr;
473 pageoff = (addr & PAGE_MASK);
476 size = (vm_size_t) round_page(size);
477 if (addr + size < addr)
484 * Check for illegal addresses. Watch out for address wrap... Note
485 * that VM_*_ADDRESS are not constants due to casts (argh).
487 if (VM_MAXUSER_ADDRESS > 0 && addr + size > VM_MAXUSER_ADDRESS)
490 if (VM_MIN_ADDRESS > 0 && addr < VM_MIN_ADDRESS)
493 map = &p->p_vmspace->vm_map;
495 * Make sure entire range is allocated.
497 if (!vm_map_check_protection(map, addr, addr + size, VM_PROT_NONE))
499 /* returns nothing but KERN_SUCCESS anyway */
500 vm_map_remove(map, addr, addr + size);
506 munmapfd(struct proc *p, int fd)
509 * XXX should unmap any regions mapped to this file
511 p->p_fd->fd_files[fd].fileflags &= ~UF_MAPPED;
516 * mprotect_args(const void *addr, size_t len, int prot)
519 mprotect(struct mprotect_args *uap)
521 struct proc *p = curproc;
523 vm_size_t size, pageoff;
526 addr = (vm_offset_t) uap->addr;
528 prot = uap->prot & VM_PROT_ALL;
529 #if defined(VM_PROT_READ_IS_EXEC)
530 if (prot & VM_PROT_READ)
531 prot |= VM_PROT_EXECUTE;
534 pageoff = (addr & PAGE_MASK);
537 size = (vm_size_t) round_page(size);
538 if (addr + size < addr)
541 switch (vm_map_protect(&p->p_vmspace->vm_map, addr, addr + size, prot,
545 case KERN_PROTECTION_FAILURE:
552 * minherit_args(void *addr, size_t len, int inherit)
555 minherit(struct minherit_args *uap)
557 struct proc *p = curproc;
559 vm_size_t size, pageoff;
560 vm_inherit_t inherit;
562 addr = (vm_offset_t)uap->addr;
564 inherit = uap->inherit;
566 pageoff = (addr & PAGE_MASK);
569 size = (vm_size_t) round_page(size);
570 if (addr + size < addr)
573 switch (vm_map_inherit(&p->p_vmspace->vm_map, addr, addr+size,
577 case KERN_PROTECTION_FAILURE:
584 * madvise_args(void *addr, size_t len, int behav)
588 madvise(struct madvise_args *uap)
590 struct proc *p = curproc;
591 vm_offset_t start, end;
594 * Check for illegal behavior
596 if (uap->behav < 0 || uap->behav > MADV_CORE)
599 * Check for illegal addresses. Watch out for address wrap... Note
600 * that VM_*_ADDRESS are not constants due to casts (argh).
602 if (VM_MAXUSER_ADDRESS > 0 &&
603 ((vm_offset_t) uap->addr + uap->len) > VM_MAXUSER_ADDRESS)
606 if (VM_MIN_ADDRESS > 0 && uap->addr < VM_MIN_ADDRESS)
609 if (((vm_offset_t) uap->addr + uap->len) < (vm_offset_t) uap->addr)
613 * Since this routine is only advisory, we default to conservative
616 start = trunc_page((vm_offset_t) uap->addr);
617 end = round_page((vm_offset_t) uap->addr + uap->len);
619 if (vm_map_madvise(&p->p_vmspace->vm_map, start, end, uap->behav))
625 * mincore_args(const void *addr, size_t len, char *vec)
629 mincore(struct mincore_args *uap)
631 struct proc *p = curproc;
632 vm_offset_t addr, first_addr;
633 vm_offset_t end, cend;
638 int vecindex, lastvecindex;
639 vm_map_entry_t current;
640 vm_map_entry_t entry;
642 unsigned int timestamp;
645 * Make sure that the addresses presented are valid for user
648 first_addr = addr = trunc_page((vm_offset_t) uap->addr);
649 end = addr + (vm_size_t)round_page(uap->len);
650 if (VM_MAXUSER_ADDRESS > 0 && end > VM_MAXUSER_ADDRESS)
656 * Address of byte vector
660 map = &p->p_vmspace->vm_map;
661 pmap = vmspace_pmap(p->p_vmspace);
663 vm_map_lock_read(map);
665 timestamp = map->timestamp;
667 if (!vm_map_lookup_entry(map, addr, &entry))
671 * Do this on a map entry basis so that if the pages are not
672 * in the current processes address space, we can easily look
673 * up the pages elsewhere.
677 (current != &map->header) && (current->start < end);
678 current = current->next) {
681 * ignore submaps (for now) or null objects
683 if ((current->eflags & MAP_ENTRY_IS_SUB_MAP) ||
684 current->object.vm_object == NULL)
688 * limit this scan to the current map entry and the
689 * limits for the mincore call
691 if (addr < current->start)
692 addr = current->start;
698 * scan this entry one page at a time
700 while (addr < cend) {
702 * Check pmap first, it is likely faster, also
703 * it can provide info as to whether we are the
704 * one referencing or modifying the page.
706 mincoreinfo = pmap_mincore(pmap, addr);
713 * calculate the page index into the object
715 offset = current->offset + (addr - current->start);
716 pindex = OFF_TO_IDX(offset);
719 * if the page is resident, then gather
720 * information about it. spl protection is
721 * required to maintain the object
722 * association. And XXX what if the page is
723 * busy? What's the deal with that?
726 m = vm_page_lookup(current->object.vm_object,
729 mincoreinfo = MINCORE_INCORE;
732 mincoreinfo |= MINCORE_MODIFIED_OTHER;
733 if ((m->flags & PG_REFERENCED) ||
734 pmap_ts_referenced(m)) {
735 vm_page_flag_set(m, PG_REFERENCED);
736 mincoreinfo |= MINCORE_REFERENCED_OTHER;
743 * subyte may page fault. In case it needs to modify
744 * the map, we release the lock.
746 vm_map_unlock_read(map);
749 * calculate index into user supplied byte vector
751 vecindex = OFF_TO_IDX(addr - first_addr);
754 * If we have skipped map entries, we need to make sure that
755 * the byte vector is zeroed for those skipped entries.
757 while((lastvecindex + 1) < vecindex) {
758 error = subyte( vec + lastvecindex, 0);
766 * Pass the page information to the user
768 error = subyte( vec + vecindex, mincoreinfo);
774 * If the map has changed, due to the subyte, the previous
775 * output may be invalid.
777 vm_map_lock_read(map);
778 if (timestamp != map->timestamp)
781 lastvecindex = vecindex;
787 * subyte may page fault. In case it needs to modify
788 * the map, we release the lock.
790 vm_map_unlock_read(map);
793 * Zero the last entries in the byte vector.
795 vecindex = OFF_TO_IDX(end - first_addr);
796 while((lastvecindex + 1) < vecindex) {
797 error = subyte( vec + lastvecindex, 0);
805 * If the map has changed, due to the subyte, the previous
806 * output may be invalid.
808 vm_map_lock_read(map);
809 if (timestamp != map->timestamp)
811 vm_map_unlock_read(map);
817 * mlock_args(const void *addr, size_t len)
820 mlock(struct mlock_args *uap)
823 vm_size_t size, pageoff;
825 struct proc *p = curproc;
827 addr = (vm_offset_t) uap->addr;
830 pageoff = (addr & PAGE_MASK);
833 size = (vm_size_t) round_page(size);
835 /* disable wrap around */
836 if (addr + size < addr)
839 if (atop(size) + vmstats.v_wire_count > vm_page_max_wired)
842 #ifdef pmap_wired_count
843 if (size + ptoa(pmap_wired_count(vm_map_pmap(&p->p_vmspace->vm_map))) >
844 p->p_rlimit[RLIMIT_MEMLOCK].rlim_cur)
847 error = suser_cred(p->p_ucred, 0);
852 error = vm_map_unwire(&p->p_vmspace->vm_map, addr, addr + size, FALSE);
853 return (error == KERN_SUCCESS ? 0 : ENOMEM);
857 * mlockall_args(int how)
860 mlockall(struct mlockall_args *uap)
866 * munlockall_args(void)
869 munlockall(struct munlockall_args *uap)
875 * munlock_args(const void *addr, size_t len)
878 munlock(struct munlock_args *uap)
880 struct thread *td = curthread;
881 struct proc *p = td->td_proc;
883 vm_size_t size, pageoff;
886 addr = (vm_offset_t) uap->addr;
889 pageoff = (addr & PAGE_MASK);
892 size = (vm_size_t) round_page(size);
894 /* disable wrap around */
895 if (addr + size < addr)
898 #ifndef pmap_wired_count
904 error = vm_map_unwire(&p->p_vmspace->vm_map, addr, addr + size, TRUE);
905 return (error == KERN_SUCCESS ? 0 : ENOMEM);
909 * Internal version of mmap.
910 * Currently used by mmap, exec, and sys5 shared memory.
911 * Handle is either a vnode pointer or NULL for MAP_ANON.
914 vm_mmap(vm_map_t map, vm_offset_t *addr, vm_size_t size, vm_prot_t prot,
915 vm_prot_t maxprot, int flags,
921 struct vnode *vp = NULL;
923 int rv = KERN_SUCCESS;
926 struct thread *td = curthread; /* XXX */
927 struct proc *p = td->td_proc;
934 objsize = size = round_page(size);
936 if (p->p_vmspace->vm_map.size + size >
937 p->p_rlimit[RLIMIT_VMEM].rlim_cur) {
942 * We currently can only deal with page aligned file offsets.
943 * The check is here rather than in the syscall because the
944 * kernel calls this function internally for other mmaping
945 * operations (such as in exec) and non-aligned offsets will
946 * cause pmap inconsistencies...so we want to be sure to
947 * disallow this in all cases.
949 if (foff & PAGE_MASK)
952 if ((flags & MAP_FIXED) == 0) {
954 *addr = round_page(*addr);
956 if (*addr != trunc_page(*addr))
959 vm_map_remove(map, *addr, *addr + size);
963 * Lookup/allocate object.
965 if (flags & MAP_ANON) {
968 * Unnamed anonymous regions always start at 0.
973 vp = (struct vnode *) handle;
974 if (vp->v_type == VCHR) {
976 handle = (void *)(intptr_t)vp->v_rdev;
981 error = VOP_GETATTR(vp, &vat, td);
984 objsize = vat.va_size;
987 * if it is a regular file without any references
988 * we do not need to sync it.
990 if (vp->v_type == VREG && vat.va_nlink == 0) {
996 if (handle == NULL) {
1000 object = vm_pager_allocate(type, handle, objsize, prot, foff);
1002 return (type == OBJT_DEVICE ? EINVAL : ENOMEM);
1003 docow = MAP_PREFAULT_PARTIAL;
1007 * Force device mappings to be shared.
1009 if (type == OBJT_DEVICE || type == OBJT_PHYS) {
1010 flags &= ~(MAP_PRIVATE|MAP_COPY);
1011 flags |= MAP_SHARED;
1014 if ((flags & (MAP_ANON|MAP_SHARED)) == 0)
1015 docow |= MAP_COPY_ON_WRITE;
1016 if (flags & MAP_NOSYNC)
1017 docow |= MAP_DISABLE_SYNCER;
1018 if (flags & MAP_NOCORE)
1019 docow |= MAP_DISABLE_COREDUMP;
1021 #if defined(VM_PROT_READ_IS_EXEC)
1022 if (prot & VM_PROT_READ)
1023 prot |= VM_PROT_EXECUTE;
1025 if (maxprot & VM_PROT_READ)
1026 maxprot |= VM_PROT_EXECUTE;
1030 *addr = pmap_addr_hint(object, *addr, size);
1033 if (flags & MAP_STACK)
1034 rv = vm_map_stack (map, *addr, size, prot,
1037 rv = vm_map_find(map, object, foff, addr, size, fitit,
1038 prot, maxprot, docow);
1040 if (rv != KERN_SUCCESS) {
1042 * Lose the object reference. Will destroy the
1043 * object if it's an unnamed anonymous mapping
1044 * or named anonymous without other references.
1046 vm_object_deallocate(object);
1051 * Shared memory is also shared with children.
1053 if (flags & (MAP_SHARED|MAP_INHERIT)) {
1054 rv = vm_map_inherit(map, *addr, *addr + size, VM_INHERIT_SHARE);
1055 if (rv != KERN_SUCCESS) {
1056 vm_map_remove(map, *addr, *addr + size);
1064 case KERN_INVALID_ADDRESS:
1067 case KERN_PROTECTION_FAILURE: