kern_resource.c revision 1.25
1 /* $NetBSD: kern_resource.c,v 1.25 1994/12/24 15:07:29 cgd 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 #if defined(COMPAT_43) || defined(COMPAT_SUNOS) || defined(COMPAT_SVR4) 202 /* ARGSUSED */ 203 int 204 compat_43_setrlimit(p, uap, retval) 205 struct proc *p; 206 struct compat_43_setrlimit_args /* { 207 syscallarg(u_int) which; 208 syscallarg(struct ogetrlimit *) rlp; 209 } */ *uap; 210 register_t *retval; 211 { 212 struct orlimit olim; 213 struct rlimit lim; 214 int error; 215 216 if (error = copyin((caddr_t)SCARG(uap, rlp), (caddr_t)&olim, 217 sizeof (struct orlimit))) 218 return (error); 219 lim.rlim_cur = olim.rlim_cur; 220 lim.rlim_max = olim.rlim_max; 221 return (dosetrlimit(p, SCARG(uap, which), &lim)); 222 } 223 224 /* ARGSUSED */ 225 int 226 compat_43_getrlimit(p, uap, retval) 227 struct proc *p; 228 register struct compat_43_getrlimit_args /* { 229 syscallarg(u_int) which; 230 syscallarg(struct ogetrlimit *) rlp; 231 } */ *uap; 232 register_t *retval; 233 { 234 struct orlimit olim; 235 236 if (SCARG(uap, which) >= RLIM_NLIMITS) 237 return (EINVAL); 238 olim.rlim_cur = p->p_rlimit[SCARG(uap, which)].rlim_cur; 239 if (olim.rlim_cur == -1) 240 olim.rlim_cur = 0x7fffffff; 241 olim.rlim_max = p->p_rlimit[SCARG(uap, which)].rlim_max; 242 if (olim.rlim_max == -1) 243 olim.rlim_max = 0x7fffffff; 244 return (copyout((caddr_t)&olim, (caddr_t)SCARG(uap, rlp), 245 sizeof(olim))); 246 } 247 #endif /* COMPAT_43 || COMPAT_SUNOS || COMPAT_SVR4 */ 248 249 /* ARGSUSED */ 250 int 251 setrlimit(p, uap, retval) 252 struct proc *p; 253 register struct setrlimit_args /* { 254 syscallarg(u_int) which; 255 syscallarg(struct rlimit *) rlp; 256 } */ *uap; 257 register_t *retval; 258 { 259 struct rlimit alim; 260 int error; 261 262 if (error = copyin((caddr_t)SCARG(uap, rlp), (caddr_t)&alim, 263 sizeof (struct rlimit))) 264 return (error); 265 return (dosetrlimit(p, SCARG(uap, which), &alim)); 266 } 267 268 int 269 dosetrlimit(p, which, limp) 270 struct proc *p; 271 u_int which; 272 struct rlimit *limp; 273 { 274 register struct rlimit *alimp; 275 extern unsigned maxdmap, maxsmap; 276 int error; 277 278 if (which >= RLIM_NLIMITS) 279 return (EINVAL); 280 alimp = &p->p_rlimit[which]; 281 if (limp->rlim_cur > alimp->rlim_max || 282 limp->rlim_max > alimp->rlim_max) 283 if (error = suser(p->p_ucred, &p->p_acflag)) 284 return (error); 285 if (limp->rlim_cur > limp->rlim_max) 286 limp->rlim_cur = limp->rlim_max; 287 if (p->p_limit->p_refcnt > 1 && 288 (p->p_limit->p_lflags & PL_SHAREMOD) == 0) { 289 p->p_limit->p_refcnt--; 290 p->p_limit = limcopy(p->p_limit); 291 alimp = &p->p_rlimit[which]; 292 } 293 294 switch (which) { 295 296 case RLIMIT_DATA: 297 if (limp->rlim_cur > maxdmap) 298 limp->rlim_cur = maxdmap; 299 if (limp->rlim_max > maxdmap) 300 limp->rlim_max = maxdmap; 301 break; 302 303 case RLIMIT_STACK: 304 if (limp->rlim_cur > maxsmap) 305 limp->rlim_cur = maxsmap; 306 if (limp->rlim_max > maxsmap) 307 limp->rlim_max = maxsmap; 308 /* 309 * Stack is allocated to the max at exec time with only 310 * "rlim_cur" bytes accessible. If stack limit is going 311 * up make more accessible, if going down make inaccessible. 312 */ 313 if (limp->rlim_cur != alimp->rlim_cur) { 314 vm_offset_t addr; 315 vm_size_t size; 316 vm_prot_t prot; 317 318 if (limp->rlim_cur > alimp->rlim_cur) { 319 prot = VM_PROT_ALL; 320 size = limp->rlim_cur - alimp->rlim_cur; 321 addr = USRSTACK - limp->rlim_cur; 322 } else { 323 prot = VM_PROT_NONE; 324 size = alimp->rlim_cur - limp->rlim_cur; 325 addr = USRSTACK - alimp->rlim_cur; 326 } 327 addr = trunc_page(addr); 328 size = round_page(size); 329 (void) vm_map_protect(&p->p_vmspace->vm_map, 330 addr, addr+size, prot, FALSE); 331 } 332 break; 333 334 case RLIMIT_NOFILE: 335 if (limp->rlim_cur > maxfiles) 336 limp->rlim_cur = maxfiles; 337 if (limp->rlim_max > maxfiles) 338 limp->rlim_max = maxfiles; 339 break; 340 341 case RLIMIT_NPROC: 342 if (limp->rlim_cur > maxproc) 343 limp->rlim_cur = maxproc; 344 if (limp->rlim_max > maxproc) 345 limp->rlim_max = maxproc; 346 break; 347 } 348 *alimp = *limp; 349 return (0); 350 } 351 352 /* ARGSUSED */ 353 int 354 getrlimit(p, uap, retval) 355 struct proc *p; 356 register struct getrlimit_args /* { 357 syscallarg(u_int) which; 358 syscallarg(struct rlimit *) rlp; 359 } */ *uap; 360 register_t *retval; 361 { 362 363 if (SCARG(uap, which) >= RLIM_NLIMITS) 364 return (EINVAL); 365 return (copyout((caddr_t)&p->p_rlimit[SCARG(uap, which)], 366 (caddr_t)SCARG(uap, rlp), sizeof (struct rlimit))); 367 } 368 369 /* 370 * Transform the running time and tick information in proc p into user, 371 * system, and interrupt time usage. 372 */ 373 void 374 calcru(p, up, sp, ip) 375 register struct proc *p; 376 register struct timeval *up; 377 register struct timeval *sp; 378 register struct timeval *ip; 379 { 380 register u_quad_t u, st, ut, it, tot; 381 register u_long sec, usec; 382 register int s; 383 struct timeval tv; 384 385 s = splstatclock(); 386 st = p->p_sticks; 387 ut = p->p_uticks; 388 it = p->p_iticks; 389 splx(s); 390 391 tot = st + ut + it; 392 if (tot == 0) { 393 up->tv_sec = up->tv_usec = 0; 394 sp->tv_sec = sp->tv_usec = 0; 395 if (ip != NULL) 396 ip->tv_sec = ip->tv_usec = 0; 397 return; 398 } 399 400 sec = p->p_rtime.tv_sec; 401 usec = p->p_rtime.tv_usec; 402 if (p == curproc) { 403 /* 404 * Adjust for the current time slice. This is actually fairly 405 * important since the error here is on the order of a time 406 * quantum, which is much greater than the sampling error. 407 */ 408 microtime(&tv); 409 sec += tv.tv_sec - runtime.tv_sec; 410 usec += tv.tv_usec - runtime.tv_usec; 411 } 412 u = sec * 1000000 + usec; 413 st = (u * st) / tot; 414 sp->tv_sec = st / 1000000; 415 sp->tv_usec = st % 1000000; 416 ut = (u * ut) / tot; 417 up->tv_sec = ut / 1000000; 418 up->tv_usec = ut % 1000000; 419 if (ip != NULL) { 420 it = (u * it) / tot; 421 ip->tv_sec = it / 1000000; 422 ip->tv_usec = it % 1000000; 423 } 424 } 425 426 /* ARGSUSED */ 427 int 428 getrusage(p, uap, retval) 429 register struct proc *p; 430 register struct getrusage_args /* { 431 syscallarg(int) who; 432 syscallarg(struct rusage *) rusage; 433 } */ *uap; 434 register_t *retval; 435 { 436 register struct rusage *rup; 437 438 switch (SCARG(uap, who)) { 439 440 case RUSAGE_SELF: 441 rup = &p->p_stats->p_ru; 442 calcru(p, &rup->ru_utime, &rup->ru_stime, NULL); 443 break; 444 445 case RUSAGE_CHILDREN: 446 rup = &p->p_stats->p_cru; 447 break; 448 449 default: 450 return (EINVAL); 451 } 452 return (copyout((caddr_t)rup, (caddr_t)SCARG(uap, rusage), 453 sizeof (struct rusage))); 454 } 455 456 void 457 ruadd(ru, ru2) 458 register struct rusage *ru, *ru2; 459 { 460 register long *ip, *ip2; 461 register int i; 462 463 __timeradd(&ru->ru_utime, &ru2->ru_utime); 464 __timeradd(&ru->ru_stime, &ru2->ru_stime); 465 if (ru->ru_maxrss < ru2->ru_maxrss) 466 ru->ru_maxrss = ru2->ru_maxrss; 467 ip = &ru->ru_first; ip2 = &ru2->ru_first; 468 for (i = &ru->ru_last - &ru->ru_first; i >= 0; i--) 469 *ip++ += *ip2++; 470 } 471 472 /* 473 * Make a copy of the plimit structure. 474 * We share these structures copy-on-write after fork, 475 * and copy when a limit is changed. 476 */ 477 struct plimit * 478 limcopy(lim) 479 struct plimit *lim; 480 { 481 register struct plimit *copy; 482 483 MALLOC(copy, struct plimit *, sizeof(struct plimit), 484 M_SUBPROC, M_WAITOK); 485 bcopy(lim->pl_rlimit, copy->pl_rlimit, 486 sizeof(struct rlimit) * RLIM_NLIMITS); 487 copy->p_lflags = 0; 488 copy->p_refcnt = 1; 489 return (copy); 490 } 491
Indexes created Sun Sep 21 14:09:52 GMT 2025