- Test m_pkthdr.fw_flags against DUMMYNET_MBUF_TAGGED before trying to locate
[dragonfly/netmp.git] / usr.bin / renice / renice.c
blob65f593294d1c18a5ca931483a561334fe8fcf7b5
1 /*
2 * Copyright (c) 1983, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
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.
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.
33 * @(#) Copyright (c) 1983, 1989, 1993 The Regents of the University of California. All rights reserved.
34 * @(#)renice.c 8.1 (Berkeley) 6/9/93
35 * $FreeBSD: src/usr.bin/renice/renice.c,v 1.4.2.3 2002/06/17 23:58:46 tjr Exp $
36 * $DragonFly: src/usr.bin/renice/renice.c,v 1.4 2005/02/10 21:06:36 liamfoy Exp $
39 #include <sys/time.h>
40 #include <sys/resource.h>
42 #include <err.h>
43 #include <errno.h>
44 #include <limits.h>
45 #include <pwd.h>
46 #include <stdio.h>
47 #include <stdlib.h>
48 #include <string.h>
50 static int donice(int, int, int, int);
51 static int getnum(const char *, const char *, int *);
52 static void usage(void);
55 * Change the priority (nice) of processes
56 * or groups of processes which are already
57 * running.
59 int
60 main(int argc, char *argv[])
62 struct passwd *pwd;
63 int errs, incr, prio, which, who;
65 errs = 0;
66 incr = 0;
67 which = PRIO_PROCESS;
68 who = 0;
69 argc--, argv++;
70 if (argc < 2)
71 usage();
72 if (strcmp(*argv, "-n") == 0) {
73 incr = 1;
74 argc--, argv++;
75 if (argc < 2)
76 usage();
78 if (getnum("priority", *argv, &prio))
79 return (1);
80 argc--, argv++;
81 for (; argc > 0; argc--, argv++) {
82 if (strcmp(*argv, "-g") == 0) {
83 which = PRIO_PGRP;
84 continue;
86 if (strcmp(*argv, "-u") == 0) {
87 which = PRIO_USER;
88 continue;
90 if (strcmp(*argv, "-p") == 0) {
91 which = PRIO_PROCESS;
92 continue;
94 if (which == PRIO_USER) {
95 if ((pwd = getpwnam(*argv)) != NULL)
96 who = pwd->pw_uid;
97 else if (getnum("uid", *argv, &who)) {
98 errs++;
99 continue;
100 } else if (who < 0) {
101 warnx("%s: bad value", *argv);
102 errs++;
103 continue;
105 } else {
106 if (getnum("pid", *argv, &who)) {
107 errs++;
108 continue;
110 if (who < 0) {
111 warnx("%s: bad value", *argv);
112 errs++;
113 continue;
116 errs += donice(which, who, prio, incr);
118 exit(errs != 0);
121 static int
122 donice(int which, int who, int prio, int incr)
124 int oldprio;
126 errno = 0;
127 oldprio = getpriority(which, who);
128 if (oldprio == -1 && errno) {
129 warn("%d: getpriority", who);
130 return (1);
132 if (incr)
133 prio = oldprio + prio;
134 if (prio > PRIO_MAX)
135 prio = PRIO_MAX;
136 if (prio < PRIO_MIN)
137 prio = PRIO_MIN;
138 if (setpriority(which, who, prio) < 0) {
139 warn("%d: setpriority", who);
140 return (1);
142 fprintf(stderr, "%d: old priority %d, new priority %d\n", who,
143 oldprio, prio);
144 return (0);
147 static int
148 getnum(const char *com, const char *str, int *val)
150 long v;
151 char *ep;
153 errno = 0;
154 v = strtol(str, &ep, 10);
155 if (v < INT_MIN || v > INT_MAX || errno == ERANGE) {
156 warnx("%s argument %s is out of range.", com, str);
157 return (1);
159 if (ep == str || *ep != '\0') {
160 warnx("Bad %s argument: %s.", com, str);
161 return (1);
164 *val = (int)v;
165 return (0);
168 static void
169 usage()
171 fprintf(stderr, "%s\n%s\n",
172 "usage: renice [priority | [-n incr]] [[-p] pid ...] [[-g] pgrp ...]",
173 " [[-u] user ...]");
174 exit(1);