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 <limits.h> 55 #include <pwd.h> 56 #include <stdio.h> 57 #include <stdlib.h> 58 #include <string.h> 59 60 static int donice(int, int, int, int); 61 static int getnum(const char *, const char *, int *); 62 static void usage(void); 63 64 /* 65 * Change the priority (nice) of processes 66 * or groups of processes which are already 67 * running. 68 */ 69 int 70 main(int argc, char *argv[]) 71 { 72 struct passwd *pwd; 73 int errs, incr, prio, which, who; 74 75 errs = 0; 76 incr = 0; 77 which = PRIO_PROCESS; 78 who = 0; 79 argc--, argv++; 80 if (argc < 2) 81 usage(); 82 if (strcmp(*argv, "-n") == 0) { 83 incr = 1; 84 argc--, argv++; 85 if (argc < 2) 86 usage(); 87 } 88 if (getnum("priority", *argv, &prio)) 89 return (1); 90 argc--, argv++; 91 for (; argc > 0; argc--, argv++) { 92 if (strcmp(*argv, "-g") == 0) { 93 which = PRIO_PGRP; 94 continue; 95 } 96 if (strcmp(*argv, "-u") == 0) { 97 which = PRIO_USER; 98 continue; 99 } 100 if (strcmp(*argv, "-p") == 0) { 101 which = PRIO_PROCESS; 102 continue; 103 } 104 if (which == PRIO_USER) { 105 pwd = getpwnam(*argv); 106 if (pwd == NULL) { 107 warnx("%s: unknown user", *argv); 108 continue; 109 } 110 who = pwd->pw_uid; 111 } else { 112 if (getnum("pid", *argv, &who)) 113 continue; 114 if (who < 0) { 115 warnx("%s: bad value", *argv); 116 continue; 117 } 118 } 119 errs += donice(which, who, prio, incr); 120 } 121 exit(errs != 0); 122 } 123 124 static int 125 donice(int which, int who, int prio, int incr) 126 { 127 int oldprio; 128 129 errno = 0; 130 oldprio = getpriority(which, who); 131 if (oldprio == -1 && errno) { 132 warn("%d: getpriority", who); 133 return (1); 134 } 135 if (incr) 136 prio = oldprio + prio; 137 if (prio > PRIO_MAX) 138 prio = PRIO_MAX; 139 if (prio < PRIO_MIN) 140 prio = PRIO_MIN; 141 if (setpriority(which, who, prio) < 0) { 142 warn("%d: setpriority", who); 143 return (1); 144 } 145 printf("%d: old priority %d, new priority %d\n", who, oldprio, prio); 146 return (0); 147 } 148 149 static int 150 getnum(const char *com, const char *str, int *val) 151 { 152 long v; 153 char *ep; 154 155 errno = 0; 156 v = strtol(str, &ep, NULL); 157 if (v < INT_MIN || v > INT_MAX || errno == ERANGE) { 158 warnx("%s argument %s is out of range.", com, str); 159 return (1); 160 } 161 if (ep == str || *ep != '\0' || errno != 0) { 162 warnx("Bad %s argument: %s.", com, str); 163 return (1); 164 } 165 166 *val = (int)v; 167 return (0); 168 } 169 170 static void 171 usage() 172 { 173 fprintf(stderr, "%s\n%s\n", 174 "usage: renice [priority | [-n incr]] [ [ -p ] pids ] [ [ -g ] pgrps ]", 175 " [ [ -u ] users ]"); 176 exit(1); 177 } 178