[apple/xnu.git] / bsd / kern / kern_resource.c

/*
 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
 *
 * @APPLE_LICENSE_HEADER_START@
 * 
 * The contents of this file constitute Original Code as defined in and
 * are subject to the Apple Public Source License Version 1.1 (the
 * "License").  You may not use this file except in compliance with the
 * License.  Please obtain a copy of the License at
 * http://www.apple.com/publicsource and read it before using this file.
 * 
 * This Original Code and all software distributed under the License are
 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
 * License for the specific language governing rights and limitations
 * under the License.
 * 
 * @APPLE_LICENSE_HEADER_END@
 */
/* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */
/*-
 * Copyright (c) 1982, 1986, 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 * (c) UNIX System Laboratories, Inc.
 * All or some portions of this file are derived from material licensed
 * to the University of California by American Telephone and Telegraph
 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
 * the permission of UNIX System Laboratories, Inc.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)kern_resource.c	8.5 (Berkeley) 1/21/94
 */

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/file.h>
#include <sys/resourcevar.h>
#include <sys/malloc.h>
#include <sys/proc.h>
#include <machine/spl.h>

#include <sys/mount.h>

#include <machine/vmparam.h>

#include <mach/mach_types.h>
#include <mach/time_value.h>
#include <mach/task_info.h>

#include <vm/vm_map.h>

int	donice __P((struct proc *curp, struct proc *chgp, int n));
int	dosetrlimit __P((struct proc *p, u_int which, struct rlimit *limp));

rlim_t maxdmap = MAXDSIZ;	/* XXX */ 
rlim_t maxsmap = MAXSSIZ;	/* XXX */ 

/*
 * Resource controls and accounting.
 */
struct getpriority_args  {
		int which;
		int who;
};
int
getpriority(curp, uap, retval)
	struct proc *curp;
	register struct getpriority_args *uap;
	register_t *retval;
{
	register struct proc *p;
	register int low = PRIO_MAX + 1;

	switch (uap->which) {

	case PRIO_PROCESS:
		if (uap->who == 0)
			p = curp;
		else
			p = pfind(uap->who);
		if (p == 0)
			break;
		low = p->p_nice;
		break;

	case PRIO_PGRP: {
		register struct pgrp *pg;

		if (uap->who == 0)
			pg = curp->p_pgrp;
		else if ((pg = pgfind(uap->who)) == NULL)
			break;
		for (p = pg->pg_members.lh_first; p != 0; p = p->p_pglist.le_next) {
			if (p->p_nice < low)
				low = p->p_nice;
		}
		break;
	}

	case PRIO_USER:
		if (uap->who == 0)
			uap->who = curp->p_ucred->cr_uid;
		for (p = allproc.lh_first; p != 0; p = p->p_list.le_next)
			if (p->p_ucred->cr_uid == uap->who &&
			    p->p_nice < low)
				low = p->p_nice;
		break;

	default:
		return (EINVAL);
	}
	if (low == PRIO_MAX + 1)
		return (ESRCH);
	*retval = low;
	return (0);
}

struct setpriority_args {
		int which;
		int who;
		int prio;
};
/* ARGSUSED */
int
setpriority(curp, uap, retval)
	struct proc *curp;
	register struct setpriority_args *uap;
	register_t *retval;
{
	register struct proc *p;
	int found = 0, error = 0;

	switch (uap->which) {

	case PRIO_PROCESS:
		if (uap->who == 0)
			p = curp;
		else
			p = pfind(uap->who);
		if (p == 0)
			break;
		error = donice(curp, p, uap->prio);
		found++;
		break;

	case PRIO_PGRP: {
		register struct pgrp *pg;
		 
		if (uap->who == 0)
			pg = curp->p_pgrp;
		else if ((pg = pgfind(uap->who)) == NULL)
			break;
		for (p = pg->pg_members.lh_first; p != 0;
		    p = p->p_pglist.le_next) {
			error = donice(curp, p, uap->prio);
			found++;
		}
		break;
	}

	case PRIO_USER:
		if (uap->who == 0)
			uap->who = curp->p_ucred->cr_uid;
		for (p = allproc.lh_first; p != 0; p = p->p_list.le_next)
			if (p->p_ucred->cr_uid == uap->who) {
				error = donice(curp, p, uap->prio);
				found++;
			}
		break;

	default:
		return (EINVAL);
	}
	if (found == 0)
		return (ESRCH);
	return (error);
}

int
donice(curp, chgp, n)
	register struct proc *curp, *chgp;
	register int n;
{
	register struct pcred *pcred = curp->p_cred;

	if (pcred->pc_ucred->cr_uid && pcred->p_ruid &&
	    pcred->pc_ucred->cr_uid != chgp->p_ucred->cr_uid &&
	    pcred->p_ruid != chgp->p_ucred->cr_uid)
		return (EPERM);
	if (n > PRIO_MAX)
		n = PRIO_MAX;
	if (n < PRIO_MIN)
		n = PRIO_MIN;
	if (n < chgp->p_nice && suser(pcred->pc_ucred, &curp->p_acflag))
		return (EACCES);
	chgp->p_nice = n;
	(void)resetpriority(chgp);
	return (0);
}

#if COMPAT_43
struct osetrlimit_args {
		u_int which;
		struct ogetrlimit * rlp;
};
/* ARGSUSED */
int
osetrlimit(p, uap, retval)
	struct proc *p;
	struct osetrlimit_args *uap;
	register_t *retval;
{
	struct orlimit olim;
	struct rlimit lim;
	int error;

	if (error = copyin((caddr_t)uap->rlp, (caddr_t)&olim,
	    sizeof (struct orlimit)))
		return (error);
	lim.rlim_cur = olim.rlim_cur;
	lim.rlim_max = olim.rlim_max;
	return (dosetrlimit(p, uap->which, &lim));
}

struct ogetrlimit_args {
		u_int which;
		struct ogetrlimit * rlp;
};
/* ARGSUSED */
int
ogetrlimit(p, uap, retval)
	struct proc *p;
	struct ogetrlimit_args *uap;
	register_t *retval;
{
	struct orlimit olim;

	if (uap->which >= RLIM_NLIMITS)
		return (EINVAL);
	olim.rlim_cur = p->p_rlimit[uap->which].rlim_cur;
	if (olim.rlim_cur == -1)
		olim.rlim_cur = 0x7fffffff;
	olim.rlim_max = p->p_rlimit[uap->which].rlim_max;
	if (olim.rlim_max == -1)
		olim.rlim_max = 0x7fffffff;
	return (copyout((caddr_t)&olim, (caddr_t)uap->rlp,
	    sizeof(olim)));
}
#endif /* COMPAT_43 */

struct setrlimit_args {
		u_int which;
		struct rlimit * rlp;
};
/* ARGSUSED */
int
setrlimit(p, uap, retval)
	struct proc *p;
	register struct setrlimit_args *uap;
	register_t *retval;
{
	struct rlimit alim;
	int error;

	if (error = copyin((caddr_t)uap->rlp, (caddr_t)&alim,
	    sizeof (struct rlimit)))
		return (error);
	return (dosetrlimit(p, uap->which, &alim));
}

int
dosetrlimit(p, which, limp)
	struct proc *p;
	u_int which;
	struct rlimit *limp;
{
	register struct rlimit *alimp;
	extern rlim_t maxdmap, maxsmap;
	int error;

	if (which >= RLIM_NLIMITS)
		return (EINVAL);
	alimp = &p->p_rlimit[which];
	if (limp->rlim_cur > alimp->rlim_max || 
	    limp->rlim_max > alimp->rlim_max)
		if (error = suser(p->p_ucred, &p->p_acflag))
			return (error);
	if (limp->rlim_cur > limp->rlim_max)
		limp->rlim_cur = limp->rlim_max;
	if (p->p_limit->p_refcnt > 1 &&
	    (p->p_limit->p_lflags & PL_SHAREMOD) == 0) {
		p->p_limit->p_refcnt--;
		p->p_limit = limcopy(p->p_limit);
		alimp = &p->p_rlimit[which];
	}

	switch (which) {

	case RLIMIT_DATA:
		if (limp->rlim_cur > maxdmap)
			limp->rlim_cur = maxdmap;
		if (limp->rlim_max > maxdmap)
			limp->rlim_max = maxdmap;
		break;

	case RLIMIT_STACK:
		if (limp->rlim_cur > maxsmap)
			limp->rlim_cur = maxsmap;
		if (limp->rlim_max > maxsmap)
			limp->rlim_max = maxsmap;
		/*
		 * Stack is allocated to the max at exec time with only
		 * "rlim_cur" bytes accessible.  If stack limit is going
		 * up make more accessible, if going down make inaccessible.
		 */
		if (limp->rlim_cur != alimp->rlim_cur) {
			vm_offset_t addr;
			vm_size_t size;
			vm_prot_t prot;
			
			if (limp->rlim_cur > alimp->rlim_cur) {
				/* grow stack */
				size = round_page(limp->rlim_cur);
				size -= round_page(alimp->rlim_cur);

#if STACK_GROWTH_UP
				/* go to top of current stack */
				addr = trunc_page(p->user_stack + alimp->rlim_cur);
#else STACK_GROWTH_UP
				addr = trunc_page(p->user_stack - alimp->rlim_cur);
				addr -= size;
#endif /* STACK_GROWTH_UP */
				if (vm_allocate(current_map(),
						&addr, size, FALSE) != KERN_SUCCESS)
					return(EINVAL);
			} else {
				/* shrink stack */
			}
		}
		break;

	case RLIMIT_NOFILE:
	/* 
	 * Only root can get the maxfiles limits, as it is systemwide resource
	 */
		if (is_suser()) {
			if (limp->rlim_cur > maxfiles)
				limp->rlim_cur = maxfiles;
			if (limp->rlim_max > maxfiles)
				limp->rlim_max = maxfiles;
		} else {
			if (limp->rlim_cur > OPEN_MAX)
				limp->rlim_cur = OPEN_MAX;
			if (limp->rlim_max > OPEN_MAX)
				limp->rlim_max = OPEN_MAX;
		}
		break;

	case RLIMIT_NPROC:
	/* 
	 * Only root can get the maxproc limits, as it is systemwide resource
	 */
		if (is_suser()) {
			if (limp->rlim_cur > maxproc)
				limp->rlim_cur = maxproc;
			if (limp->rlim_max > maxproc)
				limp->rlim_max = maxproc;
		} else {
			if (limp->rlim_cur > CHILD_MAX)
				limp->rlim_cur = CHILD_MAX;
			if (limp->rlim_max > CHILD_MAX)
				limp->rlim_max = CHILD_MAX;
		}
		break;
	}
	*alimp = *limp;
	return (0);
}

struct getrlimit_args {
		u_int which;
		struct rlimit * rlp;
};
/* ARGSUSED */
int
getrlimit(p, uap, retval)
	struct proc *p;
	register struct getrlimit_args *uap;
	register_t *retval;
{

	if (uap->which >= RLIM_NLIMITS)
		return (EINVAL);
	return (copyout((caddr_t)&p->p_rlimit[uap->which],
	    (caddr_t)uap->rlp, sizeof (struct rlimit)));
}

/*
 * Transform the running time and tick information in proc p into user,
 * system, and interrupt time usage.
 */
void
calcru(p, up, sp, ip)
	register struct proc *p;
	register struct timeval *up;
	register struct timeval *sp;
	register struct timeval *ip;
{
	task_t			task;

	timerclear(up);
	timerclear(sp);
	if (ip != NULL)
		timerclear(ip);

	task = p->task;
	if (task) {
		task_basic_info_data_t tinfo;
		task_thread_times_info_data_t ttimesinfo;
		int task_info_stuff, task_ttimes_stuff;
		struct timeval ut,st;

		task_info_stuff	= TASK_BASIC_INFO_COUNT;
		task_info(task, TASK_BASIC_INFO,
			  &tinfo, &task_info_stuff);
		ut.tv_sec = tinfo.user_time.seconds;
		ut.tv_usec = tinfo.user_time.microseconds;
		st.tv_sec = tinfo.system_time.seconds;
		st.tv_usec = tinfo.system_time.microseconds;
		timeradd(&ut,up,up);
		timeradd(&st,up,up);

		task_ttimes_stuff = TASK_THREAD_TIMES_INFO_COUNT;
		task_info(task, TASK_THREAD_TIMES_INFO,
			  &ttimesinfo, &task_ttimes_stuff);

		ut.tv_sec = ttimesinfo.user_time.seconds;
		ut.tv_usec = ttimesinfo.user_time.microseconds;
		st.tv_sec = ttimesinfo.system_time.seconds;
		st.tv_usec = ttimesinfo.system_time.microseconds;
		timeradd(&ut,up,up);
		timeradd(&st,up,up);
	}
}

struct getrusage_args {
		int who;
		struct rusage * rusage;
};
/* ARGSUSED */
int
getrusage(p, uap, retval)
	register struct proc *p;
	register struct getrusage_args *uap;
	register_t *retval;
{
	struct rusage *rup, rubuf;

	switch (uap->who) {

	case RUSAGE_SELF:
		rup = &p->p_stats->p_ru;
		calcru(p, &rup->ru_utime, &rup->ru_stime, NULL);
		rubuf = *rup;
		break;

	case RUSAGE_CHILDREN:
		rup = &p->p_stats->p_cru;
		rubuf = *rup;
		break;

	default:
		return (EINVAL);
	}
	return (copyout((caddr_t)&rubuf, (caddr_t)uap->rusage,
	    sizeof (struct rusage)));
}

void
ruadd(ru, ru2)
	register struct rusage *ru, *ru2;
{
	register long *ip, *ip2;
	register int i;

	timeradd(&ru->ru_utime, &ru2->ru_utime, &ru->ru_utime);
	timeradd(&ru->ru_stime, &ru2->ru_stime, &ru->ru_stime);
	if (ru->ru_maxrss < ru2->ru_maxrss)
		ru->ru_maxrss = ru2->ru_maxrss;
	ip = &ru->ru_first; ip2 = &ru2->ru_first;
	for (i = &ru->ru_last - &ru->ru_first; i >= 0; i--)
		*ip++ += *ip2++;
}

/*
 * Make a copy of the plimit structure.
 * We share these structures copy-on-write after fork,
 * and copy when a limit is changed.
 */
struct plimit *
limcopy(lim)
	struct plimit *lim;
{
	register struct plimit *copy;

	MALLOC_ZONE(copy, struct plimit *,
			sizeof(struct plimit), M_SUBPROC, M_WAITOK);
	bcopy(lim->pl_rlimit, copy->pl_rlimit,
	    sizeof(struct rlimit) * RLIM_NLIMITS);
	copy->p_lflags = 0;
	copy->p_refcnt = 1;
	return (copy);
}
Commit	Line	Data
1c79356b A	1	/*
	2	* Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
	3	*
	4	* @APPLE_LICENSE_HEADER_START@
	5	*
	6	* The contents of this file constitute Original Code as defined in and
	7	* are subject to the Apple Public Source License Version 1.1 (the
	8	* "License"). You may not use this file except in compliance with the
	9	* License. Please obtain a copy of the License at
	10	* http://www.apple.com/publicsource and read it before using this file.
	11	*
	12	* This Original Code and all software distributed under the License are
	13	* distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
	14	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
	15	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
	16	* FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
	17	* License for the specific language governing rights and limitations
	18	* under the License.
	19	*
	20	* @APPLE_LICENSE_HEADER_END@
	21	*/
	22	/* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */
	23	/*-
	24	* Copyright (c) 1982, 1986, 1991, 1993
	25	* The Regents of the University of California. All rights reserved.
	26	* (c) UNIX System Laboratories, Inc.
	27	* All or some portions of this file are derived from material licensed
	28	* to the University of California by American Telephone and Telegraph
	29	* Co. or Unix System Laboratories, Inc. and are reproduced herein with
	30	* the permission of UNIX System Laboratories, Inc.
	31	*
	32	* Redistribution and use in source and binary forms, with or without
	33	* modification, are permitted provided that the following conditions
	34	* are met:
	35	* 1. Redistributions of source code must retain the above copyright
	36	* notice, this list of conditions and the following disclaimer.
	37	* 2. Redistributions in binary form must reproduce the above copyright
	38	* notice, this list of conditions and the following disclaimer in the
	39	* documentation and/or other materials provided with the distribution.
	40	* 3. All advertising materials mentioning features or use of this software
	41	* must display the following acknowledgement:
	42	* This product includes software developed by the University of
	43	* California, Berkeley and its contributors.
	44	* 4. Neither the name of the University nor the names of its contributors
	45	* may be used to endorse or promote products derived from this software
	46	* without specific prior written permission.
	47	*
	48	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	49	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	50	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	51	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	52	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	53	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	54	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	55	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	56	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	57	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	58	* SUCH DAMAGE.
	59	*
	60	* @(#)kern_resource.c 8.5 (Berkeley) 1/21/94
	61	*/
	62
	63	#include <sys/param.h>
	64	#include <sys/systm.h>
65	#include <sys/kernel.h>
66	#include <sys/file.h>
67	#include <sys/resourcevar.h>
68	#include <sys/malloc.h>
69	#include <sys/proc.h>
70	#include <machine/spl.h>
71
72	#include <sys/mount.h>
73
74	#include <machine/vmparam.h>
75
76	#include <mach/mach_types.h>
77	#include <mach/time_value.h>
78	#include <mach/task_info.h>
79
80	#include <vm/vm_map.h>
81
82	int donice __P((struct proc curp, struct proc chgp, int n));
83	int dosetrlimit __P((struct proc p, u_int which, struct rlimit limp));
84
85	rlim_t maxdmap = MAXDSIZ; /* XXX */
86	rlim_t maxsmap = MAXSSIZ; /* XXX */
87
88	/*
89	* Resource controls and accounting.
90	*/
91	struct getpriority_args {
92	int which;
93	int who;
94	};
95	int
96	getpriority(curp, uap, retval)
97	struct proc *curp;
98	register struct getpriority_args *uap;
99	register_t *retval;
100	{
101	register struct proc *p;
102	register int low = PRIO_MAX + 1;
103
104	switch (uap->which) {
105
106	case PRIO_PROCESS:
107	if (uap->who == 0)
108	p = curp;
109	else
110	p = pfind(uap->who);
111	if (p == 0)
112	break;
113	low = p->p_nice;
114	break;
115
116	case PRIO_PGRP: {
117	register struct pgrp *pg;
118
119	if (uap->who == 0)
120	pg = curp->p_pgrp;
121	else if ((pg = pgfind(uap->who)) == NULL)
122	break;
123	for (p = pg->pg_members.lh_first; p != 0; p = p->p_pglist.le_next) {
124	if (p->p_nice < low)
125	low = p->p_nice;
126	}
127	break;
128	}
129
130	case PRIO_USER:
131	if (uap->who == 0)
132	uap->who = curp->p_ucred->cr_uid;
133	for (p = allproc.lh_first; p != 0; p = p->p_list.le_next)
134	if (p->p_ucred->cr_uid == uap->who &&
135	p->p_nice < low)
136	low = p->p_nice;
137	break;
138
139	default:
140	return (EINVAL);
141	}
142	if (low == PRIO_MAX + 1)
143	return (ESRCH);
144	*retval = low;
145	return (0);
146	}
147
148	struct setpriority_args {
149	int which;
150	int who;
151	int prio;
152	};
153	/* ARGSUSED */
154	int
155	setpriority(curp, uap, retval)
156	struct proc *curp;
157	register struct setpriority_args *uap;
158	register_t *retval;
159	{
160	register struct proc *p;
161	int found = 0, error = 0;
162
163	switch (uap->which) {
164
165	case PRIO_PROCESS:
166	if (uap->who == 0)
167	p = curp;
168	else
169	p = pfind(uap->who);
170	if (p == 0)
171	break;
172	error = donice(curp, p, uap->prio);
173	found++;
174	break;
175
176	case PRIO_PGRP: {
177	register struct pgrp *pg;
178
179	if (uap->who == 0)
180	pg = curp->p_pgrp;
181	else if ((pg = pgfind(uap->who)) == NULL)
182	break;
183	for (p = pg->pg_members.lh_first; p != 0;
184	p = p->p_pglist.le_next) {
185	error = donice(curp, p, uap->prio);
186	found++;
187	}
188	break;
189	}
190
191	case PRIO_USER:
192	if (uap->who == 0)
193	uap->who = curp->p_ucred->cr_uid;
194	for (p = allproc.lh_first; p != 0; p = p->p_list.le_next)
195	if (p->p_ucred->cr_uid == uap->who) {
196	error = donice(curp, p, uap->prio);
197	found++;
198	}
199	break;
200
201	default:
202	return (EINVAL);
203	}
204	if (found == 0)
205	return (ESRCH);
206	return (error);
207	}
208
209	int
210	donice(curp, chgp, n)
211	register struct proc curp, chgp;
212	register int n;
213	{
214	register struct pcred *pcred = curp->p_cred;
215
216	if (pcred->pc_ucred->cr_uid && pcred->p_ruid &&
217	pcred->pc_ucred->cr_uid != chgp->p_ucred->cr_uid &&
218	pcred->p_ruid != chgp->p_ucred->cr_uid)
219	return (EPERM);
220	if (n > PRIO_MAX)
221	n = PRIO_MAX;
222	if (n < PRIO_MIN)
223	n = PRIO_MIN;
224	if (n < chgp->p_nice && suser(pcred->pc_ucred, &curp->p_acflag))
225	return (EACCES);
226	chgp->p_nice = n;
227	(void)resetpriority(chgp);
228	return (0);
229	}
230
231	#if COMPAT_43
232	struct osetrlimit_args {
233	u_int which;
234	struct ogetrlimit * rlp;
235	};
236	/* ARGSUSED */
237	int
238	osetrlimit(p, uap, retval)
239	struct proc *p;
240	struct osetrlimit_args *uap;
241	register_t *retval;
242	{
243	struct orlimit olim;
244	struct rlimit lim;
245	int error;
246
247	if (error = copyin((caddr_t)uap->rlp, (caddr_t)&olim,
248	sizeof (struct orlimit)))
249	return (error);
250	lim.rlim_cur = olim.rlim_cur;
251	lim.rlim_max = olim.rlim_max;
252	return (dosetrlimit(p, uap->which, &lim));
253	}
254
255	struct ogetrlimit_args {
256	u_int which;
257	struct ogetrlimit * rlp;
258	};
259	/* ARGSUSED */
260	int
261	ogetrlimit(p, uap, retval)
262	struct proc *p;
263	struct ogetrlimit_args *uap;
264	register_t *retval;
265	{
266	struct orlimit olim;
267
268	if (uap->which >= RLIM_NLIMITS)
269	return (EINVAL);
270	olim.rlim_cur = p->p_rlimit[uap->which].rlim_cur;
271	if (olim.rlim_cur == -1)
272	olim.rlim_cur = 0x7fffffff;
273	olim.rlim_max = p->p_rlimit[uap->which].rlim_max;
274	if (olim.rlim_max == -1)
275	olim.rlim_max = 0x7fffffff;
276	return (copyout((caddr_t)&olim, (caddr_t)uap->rlp,
277	sizeof(olim)));
278	}
279	#endif /* COMPAT_43 */
280
281	struct setrlimit_args {
282	u_int which;
283	struct rlimit * rlp;
284	};
285	/* ARGSUSED */
286	int
287	setrlimit(p, uap, retval)
288	struct proc *p;
289	register struct setrlimit_args *uap;
290	register_t *retval;
291	{
292	struct rlimit alim;
293	int error;
294
295	if (error = copyin((caddr_t)uap->rlp, (caddr_t)&alim,
296	sizeof (struct rlimit)))
297	return (error);
298	return (dosetrlimit(p, uap->which, &alim));
299	}
300
301	int
302	dosetrlimit(p, which, limp)
303	struct proc *p;
304	u_int which;
305	struct rlimit *limp;
306	{
307	register struct rlimit *alimp;
308	extern rlim_t maxdmap, maxsmap;
309	int error;
310
311	if (which >= RLIM_NLIMITS)
312	return (EINVAL);
313	alimp = &p->p_rlimit[which];
314	if (limp->rlim_cur > alimp->rlim_max \|\|
315	limp->rlim_max > alimp->rlim_max)
316	if (error = suser(p->p_ucred, &p->p_acflag))
317	return (error);
318	if (limp->rlim_cur > limp->rlim_max)
319	limp->rlim_cur = limp->rlim_max;
320	if (p->p_limit->p_refcnt > 1 &&
321	(p->p_limit->p_lflags & PL_SHAREMOD) == 0) {
322	p->p_limit->p_refcnt--;
323	p->p_limit = limcopy(p->p_limit);
324	alimp = &p->p_rlimit[which];
325	}
326
327	switch (which) {
328
329	case RLIMIT_DATA:
330	if (limp->rlim_cur > maxdmap)
331	limp->rlim_cur = maxdmap;
332	if (limp->rlim_max > maxdmap)
333	limp->rlim_max = maxdmap;
334	break;
335
336	case RLIMIT_STACK:
337	if (limp->rlim_cur > maxsmap)
338	limp->rlim_cur = maxsmap;
339	if (limp->rlim_max > maxsmap)
340	limp->rlim_max = maxsmap;
341	/*
342	* Stack is allocated to the max at exec time with only
343	* "rlim_cur" bytes accessible. If stack limit is going
344	* up make more accessible, if going down make inaccessible.
345	*/
346	if (limp->rlim_cur != alimp->rlim_cur) {
347	vm_offset_t addr;
348	vm_size_t size;
349	vm_prot_t prot;
350
351	if (limp->rlim_cur > alimp->rlim_cur) {
352	/* grow stack */
353	size = round_page(limp->rlim_cur);
354	size -= round_page(alimp->rlim_cur);
355
356	#if STACK_GROWTH_UP
357	/* go to top of current stack */
358	addr = trunc_page(p->user_stack + alimp->rlim_cur);
359	#else STACK_GROWTH_UP
360	addr = trunc_page(p->user_stack - alimp->rlim_cur);
361	addr -= size;
362	#endif /* STACK_GROWTH_UP */
363	if (vm_allocate(current_map(),
364	&addr, size, FALSE) != KERN_SUCCESS)
365	return(EINVAL);
366	} else {
367	/* shrink stack */
368	}
369	}
370	break;
371
372	case RLIMIT_NOFILE:
373	/*
374	* Only root can get the maxfiles limits, as it is systemwide resource
375	*/
376	if (is_suser()) {
377	if (limp->rlim_cur > maxfiles)
378	limp->rlim_cur = maxfiles;
379	if (limp->rlim_max > maxfiles)
380	limp->rlim_max = maxfiles;
381	} else {
382	if (limp->rlim_cur > OPEN_MAX)
383	limp->rlim_cur = OPEN_MAX;
384	if (limp->rlim_max > OPEN_MAX)
385	limp->rlim_max = OPEN_MAX;
386	}
387	break;
388
389	case RLIMIT_NPROC:
390	/*
391	* Only root can get the maxproc limits, as it is systemwide resource
392	*/
393	if (is_suser()) {
394	if (limp->rlim_cur > maxproc)
395	limp->rlim_cur = maxproc;
396	if (limp->rlim_max > maxproc)
397	limp->rlim_max = maxproc;
398	} else {
399	if (limp->rlim_cur > CHILD_MAX)
400	limp->rlim_cur = CHILD_MAX;
401	if (limp->rlim_max > CHILD_MAX)
402	limp->rlim_max = CHILD_MAX;
403	}
404	break;
405	}
406	alimp = limp;
407	return (0);
408	}
409
410	struct getrlimit_args {
411	u_int which;
412	struct rlimit * rlp;
413	};
414	/* ARGSUSED */
415	int
416	getrlimit(p, uap, retval)
417	struct proc *p;
418	register struct getrlimit_args *uap;
419	register_t *retval;
420	{
421
422	if (uap->which >= RLIM_NLIMITS)
423	return (EINVAL);
424	return (copyout((caddr_t)&p->p_rlimit[uap->which],
425	(caddr_t)uap->rlp, sizeof (struct rlimit)));
426	}
427
428	/*
429	* Transform the running time and tick information in proc p into user,
430	* system, and interrupt time usage.
431	*/
432	void
433	calcru(p, up, sp, ip)
434	register struct proc *p;
435	register struct timeval *up;
436	register struct timeval *sp;
437	register struct timeval *ip;
438	{
439	task_t task;
440
441	timerclear(up);
442	timerclear(sp);
443	if (ip != NULL)
444	timerclear(ip);
445
446	task = p->task;
447	if (task) {
448	task_basic_info_data_t tinfo;
449	task_thread_times_info_data_t ttimesinfo;
450	int task_info_stuff, task_ttimes_stuff;
451	struct timeval ut,st;
452
453	task_info_stuff = TASK_BASIC_INFO_COUNT;
454	task_info(task, TASK_BASIC_INFO,
455	&tinfo, &task_info_stuff);
456	ut.tv_sec = tinfo.user_time.seconds;
457	ut.tv_usec = tinfo.user_time.microseconds;
458	st.tv_sec = tinfo.system_time.seconds;
459	st.tv_usec = tinfo.system_time.microseconds;
460	timeradd(&ut,up,up);
461	timeradd(&st,up,up);
462
463	task_ttimes_stuff = TASK_THREAD_TIMES_INFO_COUNT;
464	task_info(task, TASK_THREAD_TIMES_INFO,
465	&ttimesinfo, &task_ttimes_stuff);
466
467	ut.tv_sec = ttimesinfo.user_time.seconds;
468	ut.tv_usec = ttimesinfo.user_time.microseconds;
469	st.tv_sec = ttimesinfo.system_time.seconds;
470	st.tv_usec = ttimesinfo.system_time.microseconds;
471	timeradd(&ut,up,up);
472	timeradd(&st,up,up);
473	}
474	}
475
476	struct getrusage_args {
477	int who;
478	struct rusage * rusage;
479	};
480	/* ARGSUSED */
481	int
482	getrusage(p, uap, retval)
483	register struct proc *p;
484	register struct getrusage_args *uap;
485	register_t *retval;
486	{
487	struct rusage *rup, rubuf;
488
489	switch (uap->who) {
490
491	case RUSAGE_SELF:
492	rup = &p->p_stats->p_ru;
493	calcru(p, &rup->ru_utime, &rup->ru_stime, NULL);
494	rubuf = *rup;
495	break;
496
497	case RUSAGE_CHILDREN:
498	rup = &p->p_stats->p_cru;
499	rubuf = *rup;
500	break;
501
502	default:
503	return (EINVAL);
504	}
505	return (copyout((caddr_t)&rubuf, (caddr_t)uap->rusage,
506	sizeof (struct rusage)));
507	}
508
509	void
510	ruadd(ru, ru2)
511	register struct rusage ru, ru2;
512	{
513	register long ip, ip2;
514	register int i;
515
516	timeradd(&ru->ru_utime, &ru2->ru_utime, &ru->ru_utime);
517	timeradd(&ru->ru_stime, &ru2->ru_stime, &ru->ru_stime);
518	if (ru->ru_maxrss < ru2->ru_maxrss)
519	ru->ru_maxrss = ru2->ru_maxrss;
520	ip = &ru->ru_first; ip2 = &ru2->ru_first;
521	for (i = &ru->ru_last - &ru->ru_first; i >= 0; i--)
522	ip++ += ip2++;
523	}
524
525	/*
526	* Make a copy of the plimit structure.
527	* We share these structures copy-on-write after fork,
528	* and copy when a limit is changed.
529	*/
530	struct plimit *
531	limcopy(lim)
532	struct plimit *lim;
533	{
534	register struct plimit *copy;
535
536	MALLOC_ZONE(copy, struct plimit *,
537	sizeof(struct plimit), M_SUBPROC, M_WAITOK);
538	bcopy(lim->pl_rlimit, copy->pl_rlimit,
539	sizeof(struct rlimit) * RLIM_NLIMITS);
540	copy->p_lflags = 0;
541	copy->p_refcnt = 1;
542	return (copy);
543	}