1 /* vi: set sw=4 ts=4: */
3 * renice implementation for busybox
5 * Copyright (C) 2005 Manuel Novoa III <mjn3@codepoet.org>
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
24 * Setting an absolute priority was obsoleted in SUSv2 and removed
25 * in SUSv3. However, the common linux version of renice does
26 * absolute and not relative. So we'll continue supporting absolute,
27 * although the stdout logging has been removed since both SUSv2 and
28 * SUSv3 specify that stdout isn't used.
30 * This version is lenient in that it doesn't require any IDs. The
31 * options -p, -g, and -u are treated as mode switches for the
32 * following IDs (if any). Multiple switches are allowed.
41 #include <sys/resource.h>
44 #if (PRIO_PROCESS < CHAR_MIN) || (PRIO_PROCESS > CHAR_MAX)
45 #error Assumption violated : PRIO_PROCESS value
47 #if (PRIO_PGRP < CHAR_MIN) || (PRIO_PGRP > CHAR_MAX)
48 #error Assumption violated : PRIO_PGRP value
50 #if (PRIO_USER < CHAR_MIN) || (PRIO_USER > CHAR_MAX)
51 #error Assumption violated : PRIO_USER value
54 static inline int int_add_no_wrap(int a, int b)
59 if (s > a) s = INT_MIN;
61 if (s < a) s = INT_MAX;
67 int renice_main(int argc, char **argv)
69 static const char Xetpriority_msg[] = "%d : %cetpriority";
71 int retval = EXIT_SUCCESS;
72 int which = PRIO_PROCESS; /* Default 'which' value. */
74 int adjustment, new_priority;
79 /* Check if we are using a relative adjustment. */
80 if (argv[0] && (argv[0][0] == '-') && (argv[0][1] == 'n') && !argv[0][2]) {
85 if (!*argv) { /* No args? Then show usage. */
89 /* Get the priority adjustment (absolute or relative). */
90 adjustment = bb_xgetlarg(*argv, 10, INT_MIN, INT_MAX);
93 /* Check for a mode switch. */
94 if ((argv[0][0] == '-') && argv[0][1] && !argv[0][2]) {
95 static const char opts[]
96 = { 'p', 'g', 'u', 0, PRIO_PROCESS, PRIO_PGRP, PRIO_USER };
98 if ((p = strchr(opts, argv[0][1]))) {
104 /* Process an ID arg. */
105 if (which == PRIO_USER) {
107 if (!(p = getpwnam(*argv))) {
108 bb_error_msg("unknown user: %s", *argv);
115 who = strtoul(*argv, &e, 10);
116 if (*e || (*argv == e) || errno) {
117 bb_error_msg("bad value: %s", *argv);
122 /* Get priority to use, and set it. */
126 errno = 0; /* Needed for getpriority error detection. */
127 old_priority = getpriority(which, who);
129 bb_perror_msg(Xetpriority_msg, who, 'g');
133 new_priority = int_add_no_wrap(old_priority, adjustment);
135 new_priority = adjustment;
138 if (setpriority(which, who, new_priority) == 0) {
142 bb_perror_msg(Xetpriority_msg, who, 's');
144 retval = EXIT_FAILURE;
147 /* No need to check for errors outputing to stderr since, if it
148 * was used, the HAD_ERROR label was reached and retval was set. */