kern_resource.c revision 1.29
1 /* $NetBSD: kern_resource.c,v 1.29 1995/06/24 20:34:03 christos Exp $ */ 2 3 /*- 4 * Copyright (c) 1982, 1986, 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 * 40 * @(#)kern_resource.c 8.5 (Berkeley) 1/21/94 41 */ 42 43 #include <sys/param.h> 44 #include <sys/systm.h> 45 #include <sys/kernel.h> 46 #include <sys/file.h> 47 #include <sys/resourcevar.h> 48 #include <sys/malloc.h> 49 #include <sys/proc.h> 50 51 #include <sys/mount.h> 52 #include <sys/syscallargs.h> 53 54 #include <vm/vm.h> 55 56 int donice __P((struct proc *curp, struct proc *chgp, int n)); 57 int dosetrlimit __P((struct proc *p, u_int which, struct rlimit *limp)); 58 59 /* 60 * Resource controls and accounting. 61 */ 62 63 int 64 getpriority(curp, uap, retval) 65 struct proc *curp; 66 register struct getpriority_args /* { 67 syscallarg(int) which; 68 syscallarg(int) who; 69 } */ *uap; 70 register_t *retval; 71 { 72 register struct proc *p; 73 register int low = PRIO_MAX + 1; 74 75 switch (SCARG(uap, which)) { 76 77 case PRIO_PROCESS: 78 if (SCARG(uap, who) == 0) 79 p = curp; 80 else 81 p = pfind(SCARG(uap, who)); 82 if (p == 0) 83 break; 84 low = p->p_nice; 85 break; 86 87 case PRIO_PGRP: { 88 register struct pgrp *pg; 89 90 if (SCARG(uap, who) == 0) 91 pg = curp->p_pgrp; 92 else if ((pg = pgfind(SCARG(uap, who))) == NULL) 93 break; 94 for (p = pg->pg_members.lh_first; p != 0; p = p->p_pglist.le_next) { 95 if (p->p_nice < low) 96 low = p->p_nice; 97 } 98 break; 99 } 100 101 case PRIO_USER: 102 if (SCARG(uap, who) == 0) 103 SCARG(uap, who) = curp->p_ucred->cr_uid; 104 for (p = allproc.lh_first; p != 0; p = p->p_list.le_next) 105 if (p->p_ucred->cr_uid == SCARG(uap, who) && 106 p->p_nice < low) 107 low = p->p_nice; 108 break; 109 110 default: 111 return (EINVAL); 112 } 113 if (low == PRIO_MAX + 1) 114 return (ESRCH); 115 *retval = low; 116 return (0); 117 } 118 119 /* ARGSUSED */ 120 int 121 setpriority(curp, uap, retval) 122 struct proc *curp; 123 register struct setpriority_args /* { 124 syscallarg(int) which; 125 syscallarg(int) who; 126 syscallarg(int) prio; 127 } */ *uap; 128 register_t *retval; 129 { 130 register struct proc *p; 131 int found = 0, error = 0; 132 133 switch (SCARG(uap, which)) { 134 135 case PRIO_PROCESS: 136 if (SCARG(uap, who) == 0) 137 p = curp; 138 else 139 p = pfind(SCARG(uap, who)); 140 if (p == 0) 141 break; 142 error = donice(curp, p, SCARG(uap, prio)); 143 found++; 144 break; 145 146 case PRIO_PGRP: { 147 register struct pgrp *pg; 148 149 if (SCARG(uap, who) == 0) 150 pg = curp->p_pgrp; 151 else if ((pg = pgfind(SCARG(uap, who))) == NULL) 152 break; 153 for (p = pg->pg_members.lh_first; p != 0; 154 p = p->p_pglist.le_next) { 155 error = donice(curp, p, SCARG(uap, prio)); 156 found++; 157 } 158 break; 159 } 160 161 case PRIO_USER: 162 if (SCARG(uap, who) == 0) 163 SCARG(uap, who) = curp->p_ucred->cr_uid; 164 for (p = allproc.lh_first; p != 0; p = p->p_list.le_next) 165 if (p->p_ucred->cr_uid == SCARG(uap, who)) { 166 error = donice(curp, p, SCARG(uap, prio)); 167 found++; 168 } 169 break; 170 171 default: 172 return (EINVAL); 173 } 174 if (found == 0) 175 return (ESRCH); 176 return (error); 177 } 178 179 int 180 donice(curp, chgp, n) 181 register struct proc *curp, *chgp; 182 register int n; 183 { 184 register struct pcred *pcred = curp->p_cred; 185 186 if (pcred->pc_ucred->cr_uid && pcred->p_ruid && 187 pcred->pc_ucred->cr_uid != chgp->p_ucred->cr_uid && 188 pcred->p_ruid != chgp->p_ucred->cr_uid) 189 return (EPERM); 190 if (n > PRIO_MAX) 191 n = PRIO_MAX; 192 if (n < PRIO_MIN) 193 n = PRIO_MIN; 194 if (n < chgp->p_nice && suser(pcred->pc_ucred, &curp->p_acflag)) 195 return (EACCES); 196 chgp->p_nice = n; 197 (void)resetpriority(chgp); 198 return (0); 199 } 200 201 /* ARGSUSED */ 202 int 203 setrlimit(p, uap, retval) 204 struct proc *p; 205 register struct setrlimit_args /* { 206 syscallarg(u_int) which; 207 syscallarg(struct rlimit *) rlp; 208 } */ *uap; 209 register_t *retval; 210 { 211 struct rlimit alim; 212 int error; 213 214 if (error = copyin((caddr_t)SCARG(uap, rlp), (caddr_t)&alim, 215 sizeof (struct rlimit))) 216 return (error); 217 return (dosetrlimit(p, SCARG(uap, which), &alim)); 218 } 219 220 int 221 dosetrlimit(p, which, limp) 222 struct proc *p; 223 u_int which; 224 struct rlimit *limp; 225 { 226 register struct rlimit *alimp; 227 extern unsigned maxdmap, maxsmap; 228 int error; 229 230 if (which >= RLIM_NLIMITS) 231 return (EINVAL); 232 alimp = &p->p_rlimit[which]; 233 if (limp->rlim_cur > alimp->rlim_max || 234 limp->rlim_max > alimp->rlim_max) 235 if (error = suser(p->p_ucred, &p->p_acflag)) 236 return (error); 237 if (limp->rlim_cur > limp->rlim_max) 238 limp->rlim_cur = limp->rlim_max; 239 if (p->p_limit->p_refcnt > 1 && 240 (p->p_limit->p_lflags & PL_SHAREMOD) == 0) { 241 p->p_limit->p_refcnt--; 242 p->p_limit = limcopy(p->p_limit); 243 alimp = &p->p_rlimit[which]; 244 } 245 246 switch (which) { 247 248 case RLIMIT_DATA: 249 if (limp->rlim_cur > maxdmap) 250 limp->rlim_cur = maxdmap; 251 if (limp->rlim_max > maxdmap) 252 limp->rlim_max = maxdmap; 253 break; 254 255 case RLIMIT_STACK: 256 if (limp->rlim_cur > maxsmap) 257 limp->rlim_cur = maxsmap; 258 if (limp->rlim_max > maxsmap) 259 limp->rlim_max = maxsmap; 260 /* 261 * Stack is allocated to the max at exec time with only 262 * "rlim_cur" bytes accessible. If stack limit is going 263 * up make more accessible, if going down make inaccessible. 264 */ 265 if (limp->rlim_cur != alimp->rlim_cur) { 266 vm_offset_t addr; 267 vm_size_t size; 268 vm_prot_t prot; 269 270 if (limp->rlim_cur > alimp->rlim_cur) { 271 prot = VM_PROT_ALL; 272 size = limp->rlim_cur - alimp->rlim_cur; 273 addr = USRSTACK - limp->rlim_cur; 274 } else { 275 prot = VM_PROT_NONE; 276 size = alimp->rlim_cur - limp->rlim_cur; 277 addr = USRSTACK - alimp->rlim_cur; 278 } 279 addr = trunc_page(addr); 280 size = round_page(size); 281 (void) vm_map_protect(&p->p_vmspace->vm_map, 282 addr, addr+size, prot, FALSE); 283 } 284 break; 285 286 case RLIMIT_NOFILE: 287 if (limp->rlim_cur > maxfiles) 288 limp->rlim_cur = maxfiles; 289 if (limp->rlim_max > maxfiles) 290 limp->rlim_max = maxfiles; 291 break; 292 293 case RLIMIT_NPROC: 294 if (limp->rlim_cur > maxproc) 295 limp->rlim_cur = maxproc; 296 if (limp->rlim_max > maxproc) 297 limp->rlim_max = maxproc; 298 break; 299 } 300 *alimp = *limp; 301 return (0); 302 } 303 304 /* ARGSUSED */ 305 int 306 getrlimit(p, uap, retval) 307 struct proc *p; 308 register struct getrlimit_args /* { 309 syscallarg(u_int) which; 310 syscallarg(struct rlimit *) rlp; 311 } */ *uap; 312 register_t *retval; 313 { 314 315 if (SCARG(uap, which) >= RLIM_NLIMITS) 316 return (EINVAL); 317 return (copyout((caddr_t)&p->p_rlimit[SCARG(uap, which)], 318 (caddr_t)SCARG(uap, rlp), sizeof (struct rlimit))); 319 } 320 321 /* 322 * Transform the running time and tick information in proc p into user, 323 * system, and interrupt time usage. 324 */ 325 void 326 calcru(p, up, sp, ip) 327 register struct proc *p; 328 register struct timeval *up; 329 register struct timeval *sp; 330 register struct timeval *ip; 331 { 332 register u_quad_t u, st, ut, it, tot; 333 register u_long sec, usec; 334 register int s; 335 struct timeval tv; 336 337 s = splstatclock(); 338 st = p->p_sticks; 339 ut = p->p_uticks; 340 it = p->p_iticks; 341 splx(s); 342 343 tot = st + ut + it; 344 if (tot == 0) { 345 up->tv_sec = up->tv_usec = 0; 346 sp->tv_sec = sp->tv_usec = 0; 347 if (ip != NULL) 348 ip->tv_sec = ip->tv_usec = 0; 349 return; 350 } 351 352 sec = p->p_rtime.tv_sec; 353 usec = p->p_rtime.tv_usec; 354 if (p == curproc) { 355 /* 356 * Adjust for the current time slice. This is actually fairly 357 * important since the error here is on the order of a time 358 * quantum, which is much greater than the sampling error. 359 */ 360 microtime(&tv); 361 sec += tv.tv_sec - runtime.tv_sec; 362 usec += tv.tv_usec - runtime.tv_usec; 363 } 364 u = sec * 1000000 + usec; 365 st = (u * st) / tot; 366 sp->tv_sec = st / 1000000; 367 sp->tv_usec = st % 1000000; 368 ut = (u * ut) / tot; 369 up->tv_sec = ut / 1000000; 370 up->tv_usec = ut % 1000000; 371 if (ip != NULL) { 372 it = (u * it) / tot; 373 ip->tv_sec = it / 1000000; 374 ip->tv_usec = it % 1000000; 375 } 376 } 377 378 /* ARGSUSED */ 379 int 380 getrusage(p, uap, retval) 381 register struct proc *p; 382 register struct getrusage_args /* { 383 syscallarg(int) who; 384 syscallarg(struct rusage *) rusage; 385 } */ *uap; 386 register_t *retval; 387 { 388 register struct rusage *rup; 389 390 switch (SCARG(uap, who)) { 391 392 case RUSAGE_SELF: 393 rup = &p->p_stats->p_ru; 394 calcru(p, &rup->ru_utime, &rup->ru_stime, NULL); 395 break; 396 397 case RUSAGE_CHILDREN: 398 rup = &p->p_stats->p_cru; 399 break; 400 401 default: 402 return (EINVAL); 403 } 404 return (copyout((caddr_t)rup, (caddr_t)SCARG(uap, rusage), 405 sizeof (struct rusage))); 406 } 407 408 void 409 ruadd(ru, ru2) 410 register struct rusage *ru, *ru2; 411 { 412 register long *ip, *ip2; 413 register int i; 414 415 timeradd(&ru->ru_utime, &ru2->ru_utime, &ru->ru_utime); 416 timeradd(&ru->ru_stime, &ru2->ru_stime, &ru->ru_stime); 417 if (ru->ru_maxrss < ru2->ru_maxrss) 418 ru->ru_maxrss = ru2->ru_maxrss; 419 ip = &ru->ru_first; ip2 = &ru2->ru_first; 420 for (i = &ru->ru_last - &ru->ru_first; i >= 0; i--) 421 *ip++ += *ip2++; 422 } 423 424 /* 425 * Make a copy of the plimit structure. 426 * We share these structures copy-on-write after fork, 427 * and copy when a limit is changed. 428 */ 429 struct plimit * 430 limcopy(lim) 431 struct plimit *lim; 432 { 433 register struct plimit *copy; 434 435 MALLOC(copy, struct plimit *, sizeof(struct plimit), 436 M_SUBPROC, M_WAITOK); 437 bcopy(lim->pl_rlimit, copy->pl_rlimit, 438 sizeof(struct rlimit) * RLIM_NLIMITS); 439 copy->p_lflags = 0; 440 copy->p_refcnt = 1; 441 return (copy); 442 } 443
Indexes created Sun Sep 21 16:09:51 GMT 2025