Commit | Line | Data |
---|---|---|
fe8fff3d WJ |
1 | /* |
2 | * Copyright (c) 1983 The Regents of the University of California. | |
3 | * 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 | char copyright[] = | |
36 | "@(#) Copyright (c) 1989 The Regents of the University of California.\n\ | |
37 | All rights reserved.\n"; | |
38 | #endif /* not lint */ | |
39 | ||
40 | #ifndef lint | |
41 | static char sccsid[] = "@(#)renice.c 5.3 (Berkeley) 6/1/90"; | |
42 | #endif /* not lint */ | |
43 | ||
44 | #include <sys/time.h> | |
45 | #include <sys/resource.h> | |
46 | #include <stdio.h> | |
47 | #include <pwd.h> | |
48 | ||
49 | /* | |
50 | * Change the priority (nice) of processes | |
51 | * or groups of processes which are already | |
52 | * running. | |
53 | */ | |
54 | main(argc, argv) | |
55 | char **argv; | |
56 | { | |
57 | int which = PRIO_PROCESS; | |
58 | int who = 0, prio, errs = 0; | |
59 | ||
60 | argc--, argv++; | |
61 | if (argc < 2) { | |
62 | fprintf(stderr, "usage: renice priority [ [ -p ] pids ] "); | |
63 | fprintf(stderr, "[ [ -g ] pgrps ] [ [ -u ] users ]\n"); | |
64 | exit(1); | |
65 | } | |
66 | prio = atoi(*argv); | |
67 | argc--, argv++; | |
68 | if (prio > PRIO_MAX) | |
69 | prio = PRIO_MAX; | |
70 | if (prio < PRIO_MIN) | |
71 | prio = PRIO_MIN; | |
72 | for (; argc > 0; argc--, argv++) { | |
73 | if (strcmp(*argv, "-g") == 0) { | |
74 | which = PRIO_PGRP; | |
75 | continue; | |
76 | } | |
77 | if (strcmp(*argv, "-u") == 0) { | |
78 | which = PRIO_USER; | |
79 | continue; | |
80 | } | |
81 | if (strcmp(*argv, "-p") == 0) { | |
82 | which = PRIO_PROCESS; | |
83 | continue; | |
84 | } | |
85 | if (which == PRIO_USER) { | |
86 | register struct passwd *pwd = getpwnam(*argv); | |
87 | ||
88 | if (pwd == NULL) { | |
89 | fprintf(stderr, "renice: %s: unknown user\n", | |
90 | *argv); | |
91 | continue; | |
92 | } | |
93 | who = pwd->pw_uid; | |
94 | } else { | |
95 | who = atoi(*argv); | |
96 | if (who < 0) { | |
97 | fprintf(stderr, "renice: %s: bad value\n", | |
98 | *argv); | |
99 | continue; | |
100 | } | |
101 | } | |
102 | errs += donice(which, who, prio); | |
103 | } | |
104 | exit(errs != 0); | |
105 | } | |
106 | ||
107 | donice(which, who, prio) | |
108 | int which, who, prio; | |
109 | { | |
110 | int oldprio; | |
111 | extern int errno; | |
112 | ||
113 | errno = 0, oldprio = getpriority(which, who); | |
114 | if (oldprio == -1 && errno) { | |
115 | fprintf(stderr, "renice: %d: ", who); | |
116 | perror("getpriority"); | |
117 | return (1); | |
118 | } | |
119 | if (setpriority(which, who, prio) < 0) { | |
120 | fprintf(stderr, "renice: %d: ", who); | |
121 | perror("setpriority"); | |
122 | return (1); | |
123 | } | |
124 | printf("%d: old priority %d, new priority %d\n", who, oldprio, prio); | |
125 | return (0); | |
126 | } |