1df8bae1dSRodney W. Grimes /* 2df8bae1dSRodney W. Grimes * Copyright (c) 1988 University of Utah. 3df8bae1dSRodney W. Grimes * Copyright (c) 1991, 1993 4df8bae1dSRodney W. Grimes * The Regents of the University of California. All rights reserved. 5df8bae1dSRodney W. Grimes * 6df8bae1dSRodney W. Grimes * This code is derived from software contributed to Berkeley by 7df8bae1dSRodney W. Grimes * the Systems Programming Group of the University of Utah Computer 8df8bae1dSRodney W. Grimes * Science Department. 9df8bae1dSRodney W. Grimes * 10df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 11df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 12df8bae1dSRodney W. Grimes * are met: 13df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 14df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 15df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 16df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 17df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 18df8bae1dSRodney W. Grimes * 3. All advertising materials mentioning features or use of this software 19df8bae1dSRodney W. Grimes * must display the following acknowledgement: 20df8bae1dSRodney W. Grimes * This product includes software developed by the University of 21df8bae1dSRodney W. Grimes * California, Berkeley and its contributors. 22df8bae1dSRodney W. Grimes * 4. Neither the name of the University nor the names of its contributors 23df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 24df8bae1dSRodney W. Grimes * without specific prior written permission. 25df8bae1dSRodney W. Grimes * 26df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36df8bae1dSRodney W. Grimes * SUCH DAMAGE. 37df8bae1dSRodney W. Grimes * 38df8bae1dSRodney W. Grimes * from: Utah $Hdr: vm_unix.c 1.1 89/11/07$ 39df8bae1dSRodney W. Grimes * 40df8bae1dSRodney W. Grimes * @(#)vm_unix.c 8.1 (Berkeley) 6/11/93 41df8bae1dSRodney W. Grimes */ 42df8bae1dSRodney W. Grimes 43df8bae1dSRodney W. Grimes /* 44df8bae1dSRodney W. Grimes * Traditional sbrk/grow interface to VM 45df8bae1dSRodney W. Grimes */ 46df8bae1dSRodney W. Grimes #include <sys/param.h> 47df8bae1dSRodney W. Grimes #include <sys/systm.h> 48df8bae1dSRodney W. Grimes #include <sys/proc.h> 49df8bae1dSRodney W. Grimes #include <sys/resourcevar.h> 50df8bae1dSRodney W. Grimes 51df8bae1dSRodney W. Grimes #include <vm/vm.h> 52df8bae1dSRodney W. Grimes 53df8bae1dSRodney W. Grimes struct obreak_args { 54df8bae1dSRodney W. Grimes char *nsiz; 55df8bae1dSRodney W. Grimes }; 56df8bae1dSRodney W. Grimes /* ARGSUSED */ 57df8bae1dSRodney W. Grimes int 58df8bae1dSRodney W. Grimes obreak(p, uap, retval) 59df8bae1dSRodney W. Grimes struct proc *p; 60df8bae1dSRodney W. Grimes struct obreak_args *uap; 61df8bae1dSRodney W. Grimes int *retval; 62df8bae1dSRodney W. Grimes { 63df8bae1dSRodney W. Grimes register struct vmspace *vm = p->p_vmspace; 64df8bae1dSRodney W. Grimes vm_offset_t new, old; 65df8bae1dSRodney W. Grimes int rv; 66df8bae1dSRodney W. Grimes register int diff; 67df8bae1dSRodney W. Grimes 68df8bae1dSRodney W. Grimes old = (vm_offset_t)vm->vm_daddr; 69df8bae1dSRodney W. Grimes new = round_page(uap->nsiz); 70df8bae1dSRodney W. Grimes if ((int)(new - old) > p->p_rlimit[RLIMIT_DATA].rlim_cur) 71df8bae1dSRodney W. Grimes return(ENOMEM); 72df8bae1dSRodney W. Grimes old = round_page(old + ctob(vm->vm_dsize)); 73df8bae1dSRodney W. Grimes diff = new - old; 74df8bae1dSRodney W. Grimes if (diff > 0) { 75df8bae1dSRodney W. Grimes rv = vm_allocate(&vm->vm_map, &old, diff, FALSE); 76df8bae1dSRodney W. Grimes if (rv != KERN_SUCCESS) { 77df8bae1dSRodney W. Grimes uprintf("sbrk: grow failed, return = %d\n", rv); 78df8bae1dSRodney W. Grimes return(ENOMEM); 79df8bae1dSRodney W. Grimes } 80df8bae1dSRodney W. Grimes vm->vm_dsize += btoc(diff); 81df8bae1dSRodney W. Grimes } else if (diff < 0) { 82df8bae1dSRodney W. Grimes diff = -diff; 83df8bae1dSRodney W. Grimes rv = vm_deallocate(&vm->vm_map, new, diff); 84df8bae1dSRodney W. Grimes if (rv != KERN_SUCCESS) { 85df8bae1dSRodney W. Grimes uprintf("sbrk: shrink failed, return = %d\n", rv); 86df8bae1dSRodney W. Grimes return(ENOMEM); 87df8bae1dSRodney W. Grimes } 88df8bae1dSRodney W. Grimes vm->vm_dsize -= btoc(diff); 89df8bae1dSRodney W. Grimes } 90df8bae1dSRodney W. Grimes return(0); 91df8bae1dSRodney W. Grimes } 92df8bae1dSRodney W. Grimes 93df8bae1dSRodney W. Grimes /* 94df8bae1dSRodney W. Grimes * Enlarge the "stack segment" to include the specified 95df8bae1dSRodney W. Grimes * stack pointer for the process. 96df8bae1dSRodney W. Grimes */ 97df8bae1dSRodney W. Grimes int 98df8bae1dSRodney W. Grimes grow(p, sp) 99df8bae1dSRodney W. Grimes struct proc *p; 100df8bae1dSRodney W. Grimes unsigned sp; 101df8bae1dSRodney W. Grimes { 102df8bae1dSRodney W. Grimes register struct vmspace *vm = p->p_vmspace; 103df8bae1dSRodney W. Grimes register int si; 104df8bae1dSRodney W. Grimes 105df8bae1dSRodney W. Grimes /* 106df8bae1dSRodney W. Grimes * For user defined stacks (from sendsig). 107df8bae1dSRodney W. Grimes */ 108df8bae1dSRodney W. Grimes if (sp < (unsigned)vm->vm_maxsaddr) 109df8bae1dSRodney W. Grimes return (0); 110df8bae1dSRodney W. Grimes /* 111df8bae1dSRodney W. Grimes * For common case of already allocated (from trap). 112df8bae1dSRodney W. Grimes */ 113df8bae1dSRodney W. Grimes if (sp >= USRSTACK - ctob(vm->vm_ssize)) 114df8bae1dSRodney W. Grimes return (1); 115df8bae1dSRodney W. Grimes /* 116df8bae1dSRodney W. Grimes * Really need to check vs limit and increment stack size if ok. 117df8bae1dSRodney W. Grimes */ 118df8bae1dSRodney W. Grimes si = clrnd(btoc(USRSTACK-sp) - vm->vm_ssize); 119df8bae1dSRodney W. Grimes if (vm->vm_ssize + si > btoc(p->p_rlimit[RLIMIT_STACK].rlim_cur)) 120df8bae1dSRodney W. Grimes return (0); 121df8bae1dSRodney W. Grimes vm->vm_ssize += si; 122df8bae1dSRodney W. Grimes return (1); 123df8bae1dSRodney W. Grimes } 124df8bae1dSRodney W. Grimes 125df8bae1dSRodney W. Grimes struct ovadvise_args { 126df8bae1dSRodney W. Grimes int anom; 127df8bae1dSRodney W. Grimes }; 128df8bae1dSRodney W. Grimes /* ARGSUSED */ 129df8bae1dSRodney W. Grimes int 130df8bae1dSRodney W. Grimes ovadvise(p, uap, retval) 131df8bae1dSRodney W. Grimes struct proc *p; 132df8bae1dSRodney W. Grimes struct ovadvise_args *uap; 133df8bae1dSRodney W. Grimes int *retval; 134df8bae1dSRodney W. Grimes { 135df8bae1dSRodney W. Grimes 136df8bae1dSRodney W. Grimes return (EINVAL); 137df8bae1dSRodney W. Grimes } 138