1 /* 2 * Copyright (c) 1983, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 static const char copyright[] = 36 "@(#) Copyright (c) 1983, 1989, 1993\n\ 37 The Regents of the University of California. All rights reserved.\n"; 38 #endif /* not lint */ 39 40 #ifndef lint 41 #if 0 42 static char sccsid[] = "@(#)renice.c 8.1 (Berkeley) 6/9/93"; 43 #endif 44 static const char rcsid[] = 45 "$FreeBSD$"; 46 #endif /* not lint */ 47 48 #include <sys/types.h> 49 #include <sys/time.h> 50 #include <sys/resource.h> 51 52 #include <err.h> 53 #include <errno.h> 54 #include <stdio.h> 55 #include <stdlib.h> 56 #include <pwd.h> 57 58 int donice __P((int, int, int)); 59 static void usage __P((void)); 60 61 /* 62 * Change the priority (nice) of processes 63 * or groups of processes which are already 64 * running. 65 */ 66 int 67 main(argc, argv) 68 char **argv; 69 { 70 int which = PRIO_PROCESS; 71 int who = 0, prio, errs = 0; 72 73 argc--, argv++; 74 if (argc < 2) 75 usage(); 76 prio = atoi(*argv); 77 argc--, argv++; 78 if (prio > PRIO_MAX) 79 prio = PRIO_MAX; 80 if (prio < PRIO_MIN) 81 prio = PRIO_MIN; 82 for (; argc > 0; argc--, argv++) { 83 if (strcmp(*argv, "-g") == 0) { 84 which = PRIO_PGRP; 85 continue; 86 } 87 if (strcmp(*argv, "-u") == 0) { 88 which = PRIO_USER; 89 continue; 90 } 91 if (strcmp(*argv, "-p") == 0) { 92 which = PRIO_PROCESS; 93 continue; 94 } 95 if (which == PRIO_USER) { 96 register struct passwd *pwd = getpwnam(*argv); 97 98 if (pwd == NULL) { 99 warnx("%s: unknown user", *argv); 100 continue; 101 } 102 who = pwd->pw_uid; 103 } else { 104 who = atoi(*argv); 105 if (who < 0) { 106 warnx("%s: bad value", *argv); 107 continue; 108 } 109 } 110 errs += donice(which, who, prio); 111 } 112 exit(errs != 0); 113 } 114 115 static void 116 usage() 117 { 118 fprintf(stderr, 119 "usage: renice priority [ [ -p ] pids ] [ [ -g ] pgrps ] [ [ -u ] users ]\n"); 120 exit(1); 121 } 122 123 int 124 donice(which, who, prio) 125 int which, who, prio; 126 { 127 int oldprio; 128 129 errno = 0, oldprio = getpriority(which, who); 130 if (oldprio == -1 && errno) { 131 warn("%d: getpriority", who); 132 return (1); 133 } 134 if (setpriority(which, who, prio) < 0) { 135 warn("%d: setpriority", who); 136 return (1); 137 } 138 printf("%d: old priority %d, new priority %d\n", who, oldprio, prio); 139 return (0); 140 } 141