2 * Copyright (c) 1982, 1986, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
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 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)kern_resource.c 8.5 (Berkeley) 1/21/94
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
40 #include "opt_compat.h"
42 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/sysproto.h>
46 #include <sys/kernel.h>
48 #include <sys/malloc.h>
49 #include <sys/mutex.h>
51 #include <sys/refcount.h>
52 #include <sys/resourcevar.h>
53 #include <sys/sched.h>
55 #include <sys/syscallsubr.h>
56 #include <sys/sysent.h>
60 #include <vm/vm_param.h>
62 #include <vm/vm_map.h>
65 static MALLOC_DEFINE(M_PLIMIT, "plimit", "plimit structures");
66 static MALLOC_DEFINE(M_UIDINFO, "uidinfo", "uidinfo structures");
67 #define UIHASH(uid) (&uihashtbl[(uid) & uihash])
68 static struct mtx uihashtbl_mtx;
69 static LIST_HEAD(uihashhead, uidinfo) *uihashtbl;
70 static u_long uihash; /* size of hash table - 1 */
72 static void calcru1(struct proc *p, struct rusage_ext *ruxp,
73 struct timeval *up, struct timeval *sp);
74 static int donice(struct thread *td, struct proc *chgp, int n);
75 static struct uidinfo *uilookup(uid_t uid);
78 * Resource controls and accounting.
81 #ifndef _SYS_SYSPROTO_H_
82 struct getpriority_args {
93 register struct getpriority_args *uap;
101 switch (uap->which) {
105 low = td->td_proc->p_nice;
110 if (p_cansee(td, p) == 0)
117 sx_slock(&proctree_lock);
119 pg = td->td_proc->p_pgrp;
122 pg = pgfind(uap->who);
124 sx_sunlock(&proctree_lock);
128 sx_sunlock(&proctree_lock);
129 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
131 if (!p_cansee(td, p)) {
142 uap->who = td->td_ucred->cr_uid;
143 sx_slock(&allproc_lock);
144 LIST_FOREACH(p, &allproc, p_list) {
146 if (!p_cansee(td, p) &&
147 p->p_ucred->cr_uid == uap->who) {
153 sx_sunlock(&allproc_lock);
160 if (low == PRIO_MAX + 1 && error == 0)
162 td->td_retval[0] = low;
166 #ifndef _SYS_SYSPROTO_H_
167 struct setpriority_args {
179 struct setpriority_args *uap;
181 struct proc *curp, *p;
183 int found = 0, error = 0;
186 switch (uap->which) {
190 error = donice(td, curp, uap->prio);
196 if (p_cansee(td, p) == 0)
197 error = donice(td, p, uap->prio);
204 sx_slock(&proctree_lock);
209 pg = pgfind(uap->who);
211 sx_sunlock(&proctree_lock);
215 sx_sunlock(&proctree_lock);
216 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
218 if (!p_cansee(td, p)) {
219 error = donice(td, p, uap->prio);
229 uap->who = td->td_ucred->cr_uid;
230 sx_slock(&allproc_lock);
231 FOREACH_PROC_IN_SYSTEM(p) {
233 if (p->p_ucred->cr_uid == uap->who &&
235 error = donice(td, p, uap->prio);
240 sx_sunlock(&allproc_lock);
247 if (found == 0 && error == 0)
253 * Set "nice" for a (whole) process.
256 donice(struct thread *td, struct proc *p, int n)
260 PROC_LOCK_ASSERT(p, MA_OWNED);
261 if ((error = p_cansched(td, p)))
267 if (n < p->p_nice && suser(td) != 0)
269 mtx_lock_spin(&sched_lock);
271 mtx_unlock_spin(&sched_lock);
276 * Set realtime priority.
280 #ifndef _SYS_SYSPROTO_H_
290 struct thread *td; /* curthread */
291 register struct rtprio_args *uap;
299 /* Perform copyin before acquiring locks if needed. */
300 if (uap->function == RTP_SET)
301 cierror = copyin(uap->rtp, &rtp, sizeof(struct rtprio));
315 switch (uap->function) {
317 if ((error = p_cansee(td, p)))
319 mtx_lock_spin(&sched_lock);
321 * Return OUR priority if no pid specified,
322 * or if one is, report the highest priority
323 * in the process. There isn't much more you can do as
324 * there is only room to return a single priority.
325 * XXXKSE: maybe need a new interface to report
326 * priorities of multiple system scope threads.
327 * Note: specifying our own pid is not the same
328 * as leaving it zero.
331 pri_to_rtp(td->td_ksegrp, &rtp);
335 rtp.type = RTP_PRIO_IDLE;
336 rtp.prio = RTP_PRIO_MAX;
337 FOREACH_KSEGRP_IN_PROC(p, kg) {
338 pri_to_rtp(kg, &rtp2);
339 if (rtp2.type < rtp.type ||
340 (rtp2.type == rtp.type &&
341 rtp2.prio < rtp.prio)) {
342 rtp.type = rtp2.type;
343 rtp.prio = rtp2.prio;
347 mtx_unlock_spin(&sched_lock);
349 return (copyout(&rtp, uap->rtp, sizeof(struct rtprio)));
351 if ((error = p_cansched(td, p)) || (error = cierror))
354 /* Disallow setting rtprio in most cases if not superuser. */
355 if (suser(td) != 0) {
356 /* can't set someone else's */
361 /* can't set realtime priority */
363 * Realtime priority has to be restricted for reasons which should be
364 * obvious. However, for idle priority, there is a potential for
365 * system deadlock if an idleprio process gains a lock on a resource
366 * that other processes need (and the idleprio process can't run
367 * due to a CPU-bound normal process). Fix me! XXX
370 if (RTP_PRIO_IS_REALTIME(rtp.type)) {
372 if (rtp.type != RTP_PRIO_NORMAL) {
380 * If we are setting our own priority, set just our
381 * KSEGRP but if we are doing another process,
382 * do all the groups on that process. If we
383 * specify our own pid we do the latter.
385 mtx_lock_spin(&sched_lock);
387 error = rtp_to_pri(&rtp, td->td_ksegrp);
389 FOREACH_KSEGRP_IN_PROC(p, kg) {
390 if ((error = rtp_to_pri(&rtp, kg)) != 0) {
395 mtx_unlock_spin(&sched_lock);
406 rtp_to_pri(struct rtprio *rtp, struct ksegrp *kg)
409 mtx_assert(&sched_lock, MA_OWNED);
410 if (rtp->prio > RTP_PRIO_MAX)
412 switch (RTP_PRIO_BASE(rtp->type)) {
413 case RTP_PRIO_REALTIME:
414 kg->kg_user_pri = PRI_MIN_REALTIME + rtp->prio;
416 case RTP_PRIO_NORMAL:
417 kg->kg_user_pri = PRI_MIN_TIMESHARE + rtp->prio;
420 kg->kg_user_pri = PRI_MIN_IDLE + rtp->prio;
425 sched_class(kg, rtp->type);
426 if (curthread->td_ksegrp == kg) {
427 sched_prio(curthread, kg->kg_user_pri); /* XXX dubious */
433 pri_to_rtp(struct ksegrp *kg, struct rtprio *rtp)
436 mtx_assert(&sched_lock, MA_OWNED);
437 switch (PRI_BASE(kg->kg_pri_class)) {
439 rtp->prio = kg->kg_user_pri - PRI_MIN_REALTIME;
442 rtp->prio = kg->kg_user_pri - PRI_MIN_TIMESHARE;
445 rtp->prio = kg->kg_user_pri - PRI_MIN_IDLE;
450 rtp->type = kg->kg_pri_class;
453 #if defined(COMPAT_43)
454 #ifndef _SYS_SYSPROTO_H_
455 struct osetrlimit_args {
466 register struct osetrlimit_args *uap;
472 if ((error = copyin(uap->rlp, &olim, sizeof(struct orlimit))))
474 lim.rlim_cur = olim.rlim_cur;
475 lim.rlim_max = olim.rlim_max;
476 error = kern_setrlimit(td, uap->which, &lim);
480 #ifndef _SYS_SYSPROTO_H_
481 struct ogetrlimit_args {
492 register struct ogetrlimit_args *uap;
499 if (uap->which >= RLIM_NLIMITS)
503 lim_rlimit(p, uap->which, &rl);
507 * XXX would be more correct to convert only RLIM_INFINITY to the
508 * old RLIM_INFINITY and fail with EOVERFLOW for other larger
509 * values. Most 64->32 and 32->16 conversions, including not
510 * unimportant ones of uids are even more broken than what we
511 * do here (they blindly truncate). We don't do this correctly
512 * here since we have little experience with EOVERFLOW yet.
513 * Elsewhere, getuid() can't fail...
515 olim.rlim_cur = rl.rlim_cur > 0x7fffffff ? 0x7fffffff : rl.rlim_cur;
516 olim.rlim_max = rl.rlim_max > 0x7fffffff ? 0x7fffffff : rl.rlim_max;
517 error = copyout(&olim, uap->rlp, sizeof(olim));
520 #endif /* COMPAT_43 */
522 #ifndef _SYS_SYSPROTO_H_
523 struct __setrlimit_args {
534 register struct __setrlimit_args *uap;
539 if ((error = copyin(uap->rlp, &alim, sizeof(struct rlimit))))
541 error = kern_setrlimit(td, uap->which, &alim);
546 kern_setrlimit(td, which, limp)
551 struct plimit *newlim, *oldlim;
553 register struct rlimit *alimp;
557 if (which >= RLIM_NLIMITS)
561 * Preserve historical bugs by treating negative limits as unsigned.
563 if (limp->rlim_cur < 0)
564 limp->rlim_cur = RLIM_INFINITY;
565 if (limp->rlim_max < 0)
566 limp->rlim_max = RLIM_INFINITY;
570 newlim = lim_alloc();
573 alimp = &oldlim->pl_rlimit[which];
574 if (limp->rlim_cur > alimp->rlim_max ||
575 limp->rlim_max > alimp->rlim_max)
576 if ((error = suser_cred(td->td_ucred, SUSER_ALLOWJAIL))) {
581 if (limp->rlim_cur > limp->rlim_max)
582 limp->rlim_cur = limp->rlim_max;
583 lim_copy(newlim, oldlim);
584 alimp = &newlim->pl_rlimit[which];
589 mtx_lock_spin(&sched_lock);
590 p->p_cpulimit = limp->rlim_cur;
591 mtx_unlock_spin(&sched_lock);
594 if (limp->rlim_cur > maxdsiz)
595 limp->rlim_cur = maxdsiz;
596 if (limp->rlim_max > maxdsiz)
597 limp->rlim_max = maxdsiz;
601 if (limp->rlim_cur > maxssiz)
602 limp->rlim_cur = maxssiz;
603 if (limp->rlim_max > maxssiz)
604 limp->rlim_max = maxssiz;
605 oldssiz = alimp->rlim_cur;
609 if (limp->rlim_cur > maxfilesperproc)
610 limp->rlim_cur = maxfilesperproc;
611 if (limp->rlim_max > maxfilesperproc)
612 limp->rlim_max = maxfilesperproc;
616 if (limp->rlim_cur > maxprocperuid)
617 limp->rlim_cur = maxprocperuid;
618 if (limp->rlim_max > maxprocperuid)
619 limp->rlim_max = maxprocperuid;
620 if (limp->rlim_cur < 1)
622 if (limp->rlim_max < 1)
631 if (which == RLIMIT_STACK) {
633 * Stack is allocated to the max at exec time with only
634 * "rlim_cur" bytes accessible. If stack limit is going
635 * up make more accessible, if going down make inaccessible.
637 if (limp->rlim_cur != oldssiz) {
642 if (limp->rlim_cur > oldssiz) {
643 prot = p->p_sysent->sv_stackprot;
644 size = limp->rlim_cur - oldssiz;
645 addr = p->p_sysent->sv_usrstack -
649 size = oldssiz - limp->rlim_cur;
650 addr = p->p_sysent->sv_usrstack - oldssiz;
652 addr = trunc_page(addr);
653 size = round_page(size);
654 (void)vm_map_protect(&p->p_vmspace->vm_map,
655 addr, addr + size, prot, FALSE);
660 * The data size limit may need to be changed to a value
661 * that makes sense for the 32 bit binary.
663 if (p->p_sysent->sv_fixlimits != NULL)
664 p->p_sysent->sv_fixlimits(p);
668 #ifndef _SYS_SYSPROTO_H_
669 struct __getrlimit_args {
681 register struct __getrlimit_args *uap;
687 if (uap->which >= RLIM_NLIMITS)
691 lim_rlimit(p, uap->which, &rlim);
693 error = copyout(&rlim, uap->rlp, sizeof(struct rlimit));
698 * Transform the running time and tick information in proc p into user,
699 * system, and interrupt time usage.
708 struct rusage_ext rux;
712 PROC_LOCK_ASSERT(p, MA_OWNED);
713 mtx_assert(&sched_lock, MA_NOTOWNED);
715 mtx_lock_spin(&sched_lock);
717 FOREACH_THREAD_IN_PROC(p, td) {
718 if (TD_IS_RUNNING(td)) {
720 * Adjust for the current time slice. This is
721 * actually fairly important since the error here is
722 * on the order of a time quantum which is much
723 * greater than the precision of binuptime().
725 KASSERT(td->td_oncpu != NOCPU,
726 ("%s: running thread has no CPU", __func__));
731 bintime_add(&rux.rux_runtime, &bt);
732 bintime_sub(&rux.rux_runtime,
733 &pcpu_find(td->td_oncpu)->pc_switchtime);
736 calcru1(p, &rux, up, sp);
737 mtx_unlock_spin(&sched_lock);
738 p->p_rux.rux_uu = rux.rux_uu;
739 p->p_rux.rux_su = rux.rux_su;
740 p->p_rux.rux_iu = rux.rux_iu;
750 PROC_LOCK_ASSERT(p, MA_OWNED);
751 calcru1(p, &p->p_crux, up, sp);
755 calcru1(p, ruxp, up, sp)
757 struct rusage_ext *ruxp;
762 /* {user, system, interrupt, total} {ticks, usec}; previous tu: */
763 u_int64_t ut, uu, st, su, it, iu, tt, tu, ptu;
765 ut = ruxp->rux_uticks;
766 st = ruxp->rux_sticks;
767 it = ruxp->rux_iticks;
773 bintime2timeval(&ruxp->rux_runtime, &tv);
774 tu = (u_int64_t)tv.tv_sec * 1000000 + tv.tv_usec;
775 ptu = ruxp->rux_uu + ruxp->rux_su + ruxp->rux_iu;
778 "calcru: runtime went backwards from %ju usec to %ju usec for pid %d (%s)\n",
779 (uintmax_t)ptu, (uintmax_t)tu, p->p_pid, p->p_comm);
782 if ((int64_t)tu < 0) {
783 printf("calcru: negative runtime of %jd usec for pid %d (%s)\n",
784 (intmax_t)tu, p->p_pid, p->p_comm);
793 /* Enforce monotonicity. */
794 if (uu < ruxp->rux_uu || su < ruxp->rux_su || iu < ruxp->rux_iu) {
795 if (uu < ruxp->rux_uu)
797 else if (uu + ruxp->rux_su + ruxp->rux_iu > tu)
798 uu = tu - ruxp->rux_su - ruxp->rux_iu;
802 su = ((tu - uu) * st) / (st + it);
803 if (su < ruxp->rux_su)
805 else if (uu + su + ruxp->rux_iu > tu)
806 su = tu - uu - ruxp->rux_iu;
808 KASSERT(uu + su + ruxp->rux_iu <= tu,
809 ("calcru: monotonisation botch 1"));
811 KASSERT(iu >= ruxp->rux_iu,
812 ("calcru: monotonisation botch 2"));
818 up->tv_sec = uu / 1000000;
819 up->tv_usec = uu % 1000000;
820 sp->tv_sec = su / 1000000;
821 sp->tv_usec = su % 1000000;
824 #ifndef _SYS_SYSPROTO_H_
825 struct getrusage_args {
827 struct rusage *rusage;
835 register struct thread *td;
836 register struct getrusage_args *uap;
841 error = kern_getrusage(td, uap->who, &ru);
843 error = copyout(&ru, uap->rusage, sizeof(struct rusage));
848 kern_getrusage(td, who, rup)
860 *rup = p->p_stats->p_ru;
861 calcru(p, &rup->ru_utime, &rup->ru_stime);
864 case RUSAGE_CHILDREN:
865 *rup = p->p_stats->p_cru;
866 calccru(p, &rup->ru_utime, &rup->ru_stime);
878 ruadd(ru, rux, ru2, rux2)
880 struct rusage_ext *rux;
882 struct rusage_ext *rux2;
884 register long *ip, *ip2;
887 bintime_add(&rux->rux_runtime, &rux2->rux_runtime);
888 rux->rux_uticks += rux2->rux_uticks;
889 rux->rux_sticks += rux2->rux_sticks;
890 rux->rux_iticks += rux2->rux_iticks;
891 rux->rux_uu += rux2->rux_uu;
892 rux->rux_su += rux2->rux_su;
893 rux->rux_iu += rux2->rux_iu;
894 if (ru->ru_maxrss < ru2->ru_maxrss)
895 ru->ru_maxrss = ru2->ru_maxrss;
897 ip2 = &ru2->ru_first;
898 for (i = &ru->ru_last - &ru->ru_first; i >= 0; i--)
903 * Allocate a new resource limits structure and initialize its
904 * reference count and mutex pointer.
911 limp = malloc(sizeof(struct plimit), M_PLIMIT, M_WAITOK);
912 refcount_init(&limp->pl_refcnt, 1);
921 refcount_acquire(&limp->pl_refcnt);
930 KASSERT(limp->pl_refcnt > 0, ("plimit refcnt underflow"));
931 if (refcount_release(&limp->pl_refcnt))
932 free((void *)limp, M_PLIMIT);
936 * Make a copy of the plimit structure.
937 * We share these structures copy-on-write after fork.
941 struct plimit *dst, *src;
944 KASSERT(dst->pl_refcnt == 1, ("lim_copy to shared limit"));
945 bcopy(src->pl_rlimit, dst->pl_rlimit, sizeof(src->pl_rlimit));
949 * Return the hard limit for a particular system resource. The
950 * which parameter specifies the index into the rlimit array.
953 lim_max(struct proc *p, int which)
957 lim_rlimit(p, which, &rl);
958 return (rl.rlim_max);
962 * Return the current (soft) limit for a particular system resource.
963 * The which parameter which specifies the index into the rlimit array
966 lim_cur(struct proc *p, int which)
970 lim_rlimit(p, which, &rl);
971 return (rl.rlim_cur);
975 * Return a copy of the entire rlimit structure for the system limit
976 * specified by 'which' in the rlimit structure pointed to by 'rlp'.
979 lim_rlimit(struct proc *p, int which, struct rlimit *rlp)
982 PROC_LOCK_ASSERT(p, MA_OWNED);
983 KASSERT(which >= 0 && which < RLIM_NLIMITS,
984 ("request for invalid resource limit"));
985 *rlp = p->p_limit->pl_rlimit[which];
989 * Find the uidinfo structure for a uid. This structure is used to
990 * track the total resource consumption (process count, socket buffer
991 * size, etc.) for the uid and impose limits.
997 uihashtbl = hashinit(maxproc / 16, M_UIDINFO, &uihash);
998 mtx_init(&uihashtbl_mtx, "uidinfo hash", NULL, MTX_DEF);
1002 * Look up a uidinfo struct for the parameter uid.
1003 * uihashtbl_mtx must be locked.
1005 static struct uidinfo *
1009 struct uihashhead *uipp;
1010 struct uidinfo *uip;
1012 mtx_assert(&uihashtbl_mtx, MA_OWNED);
1014 LIST_FOREACH(uip, uipp, ui_hash)
1015 if (uip->ui_uid == uid)
1022 * Find or allocate a struct uidinfo for a particular uid.
1023 * Increase refcount on uidinfo struct returned.
1024 * uifree() should be called on a struct uidinfo when released.
1030 struct uidinfo *old_uip, *uip;
1032 mtx_lock(&uihashtbl_mtx);
1033 uip = uilookup(uid);
1035 mtx_unlock(&uihashtbl_mtx);
1036 uip = malloc(sizeof(*uip), M_UIDINFO, M_WAITOK | M_ZERO);
1037 mtx_lock(&uihashtbl_mtx);
1039 * There's a chance someone created our uidinfo while we
1040 * were in malloc and not holding the lock, so we have to
1041 * make sure we don't insert a duplicate uidinfo.
1043 if ((old_uip = uilookup(uid)) != NULL) {
1044 /* Someone else beat us to it. */
1045 free(uip, M_UIDINFO);
1048 uip->ui_mtxp = mtx_pool_alloc(mtxpool_sleep);
1050 LIST_INSERT_HEAD(UIHASH(uid), uip, ui_hash);
1054 mtx_unlock(&uihashtbl_mtx);
1059 * Place another refcount on a uidinfo struct.
1063 struct uidinfo *uip;
1068 UIDINFO_UNLOCK(uip);
1072 * Since uidinfo structs have a long lifetime, we use an
1073 * opportunistic refcounting scheme to avoid locking the lookup hash
1076 * If the refcount hits 0, we need to free the structure,
1077 * which means we need to lock the hash.
1079 * After locking the struct and lowering the refcount, if we find
1080 * that we don't need to free, simply unlock and return.
1082 * If refcount lowering results in need to free, bump the count
1083 * back up, loose the lock and aquire the locks in the proper
1084 * order to try again.
1088 struct uidinfo *uip;
1091 /* Prepare for optimal case. */
1094 if (--uip->ui_ref != 0) {
1095 UIDINFO_UNLOCK(uip);
1099 /* Prepare for suboptimal case. */
1101 UIDINFO_UNLOCK(uip);
1102 mtx_lock(&uihashtbl_mtx);
1106 * We must subtract one from the count again because we backed out
1107 * our initial subtraction before dropping the lock.
1108 * Since another thread may have added a reference after we dropped the
1109 * initial lock we have to test for zero again.
1111 if (--uip->ui_ref == 0) {
1112 LIST_REMOVE(uip, ui_hash);
1113 mtx_unlock(&uihashtbl_mtx);
1114 if (uip->ui_sbsize != 0)
1115 printf("freeing uidinfo: uid = %d, sbsize = %jd\n",
1116 uip->ui_uid, (intmax_t)uip->ui_sbsize);
1117 if (uip->ui_proccnt != 0)
1118 printf("freeing uidinfo: uid = %d, proccnt = %ld\n",
1119 uip->ui_uid, uip->ui_proccnt);
1120 UIDINFO_UNLOCK(uip);
1121 FREE(uip, M_UIDINFO);
1125 mtx_unlock(&uihashtbl_mtx);
1126 UIDINFO_UNLOCK(uip);
1130 * Change the count associated with number of processes
1131 * a given user is using. When 'max' is 0, don't enforce a limit
1134 chgproccnt(uip, diff, max)
1135 struct uidinfo *uip;
1141 /* Don't allow them to exceed max, but allow subtraction. */
1142 if (diff > 0 && uip->ui_proccnt + diff > max && max != 0) {
1143 UIDINFO_UNLOCK(uip);
1146 uip->ui_proccnt += diff;
1147 if (uip->ui_proccnt < 0)
1148 printf("negative proccnt for uid = %d\n", uip->ui_uid);
1149 UIDINFO_UNLOCK(uip);
1154 * Change the total socket buffer size a user has used.
1157 chgsbsize(uip, hiwat, to, max)
1158 struct uidinfo *uip;
1166 new = uip->ui_sbsize + to - *hiwat;
1167 /* Don't allow them to exceed max, but allow subtraction. */
1168 if (to > *hiwat && new > max) {
1169 UIDINFO_UNLOCK(uip);
1172 uip->ui_sbsize = new;
1173 UIDINFO_UNLOCK(uip);
1176 printf("negative sbsize for uid = %d\n", uip->ui_uid);