miscbltin.c revision 1.33 1 1.33 christos /* $NetBSD: miscbltin.c,v 1.33 2004/04/17 15:41:29 christos Exp $ */
2 1.13 cgd
3 1.1 cgd /*-
4 1.7 jtc * Copyright (c) 1991, 1993
5 1.7 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Kenneth Almquist.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.32 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.19 christos #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.13 cgd #if 0
38 1.14 christos static char sccsid[] = "@(#)miscbltin.c 8.4 (Berkeley) 5/4/95";
39 1.13 cgd #else
40 1.33 christos __RCSID("$NetBSD: miscbltin.c,v 1.33 2004/04/17 15:41:29 christos Exp $");
41 1.13 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd /*
45 1.1 cgd * Miscelaneous builtins.
46 1.1 cgd */
47 1.1 cgd
48 1.23 christos #include <sys/types.h> /* quad_t */
49 1.23 christos #include <sys/param.h> /* BSD4_4 */
50 1.8 jtc #include <sys/stat.h>
51 1.14 christos #include <sys/time.h>
52 1.14 christos #include <sys/resource.h>
53 1.9 jtc #include <unistd.h>
54 1.27 christos #include <stdlib.h>
55 1.9 jtc #include <ctype.h>
56 1.28 christos #include <errno.h>
57 1.14 christos
58 1.1 cgd #include "shell.h"
59 1.1 cgd #include "options.h"
60 1.1 cgd #include "var.h"
61 1.1 cgd #include "output.h"
62 1.1 cgd #include "memalloc.h"
63 1.1 cgd #include "error.h"
64 1.19 christos #include "miscbltin.h"
65 1.1 cgd #include "mystring.h"
66 1.1 cgd
67 1.20 kleink #undef rflag
68 1.1 cgd
69 1.1 cgd
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * The read builtin. The -e option causes backslashes to escape the
73 1.1 cgd * following character.
74 1.1 cgd *
75 1.1 cgd * This uses unbuffered input, which may be avoidable in some cases.
76 1.1 cgd */
77 1.1 cgd
78 1.12 cgd int
79 1.31 christos readcmd(int argc, char **argv)
80 1.12 cgd {
81 1.1 cgd char **ap;
82 1.1 cgd int backslash;
83 1.1 cgd char c;
84 1.20 kleink int rflag;
85 1.1 cgd char *prompt;
86 1.1 cgd char *ifs;
87 1.1 cgd char *p;
88 1.1 cgd int startword;
89 1.1 cgd int status;
90 1.1 cgd int i;
91 1.1 cgd
92 1.20 kleink rflag = 0;
93 1.1 cgd prompt = NULL;
94 1.20 kleink while ((i = nextopt("p:r")) != '\0') {
95 1.1 cgd if (i == 'p')
96 1.30 christos prompt = optionarg;
97 1.1 cgd else
98 1.20 kleink rflag = 1;
99 1.1 cgd }
100 1.1 cgd if (prompt && isatty(0)) {
101 1.1 cgd out2str(prompt);
102 1.1 cgd flushall();
103 1.1 cgd }
104 1.6 cgd if (*(ap = argptr) == NULL)
105 1.1 cgd error("arg count");
106 1.1 cgd if ((ifs = bltinlookup("IFS", 1)) == NULL)
107 1.1 cgd ifs = nullstr;
108 1.1 cgd status = 0;
109 1.1 cgd startword = 1;
110 1.1 cgd backslash = 0;
111 1.1 cgd STARTSTACKSTR(p);
112 1.1 cgd for (;;) {
113 1.1 cgd if (read(0, &c, 1) != 1) {
114 1.1 cgd status = 1;
115 1.1 cgd break;
116 1.1 cgd }
117 1.1 cgd if (c == '\0')
118 1.1 cgd continue;
119 1.1 cgd if (backslash) {
120 1.1 cgd backslash = 0;
121 1.1 cgd if (c != '\n')
122 1.1 cgd STPUTC(c, p);
123 1.1 cgd continue;
124 1.1 cgd }
125 1.20 kleink if (!rflag && c == '\\') {
126 1.1 cgd backslash++;
127 1.1 cgd continue;
128 1.1 cgd }
129 1.1 cgd if (c == '\n')
130 1.1 cgd break;
131 1.1 cgd if (startword && *ifs == ' ' && strchr(ifs, c)) {
132 1.1 cgd continue;
133 1.1 cgd }
134 1.1 cgd startword = 0;
135 1.1 cgd if (backslash && c == '\\') {
136 1.1 cgd if (read(0, &c, 1) != 1) {
137 1.1 cgd status = 1;
138 1.1 cgd break;
139 1.1 cgd }
140 1.1 cgd STPUTC(c, p);
141 1.1 cgd } else if (ap[1] != NULL && strchr(ifs, c) != NULL) {
142 1.1 cgd STACKSTRNUL(p);
143 1.1 cgd setvar(*ap, stackblock(), 0);
144 1.1 cgd ap++;
145 1.1 cgd startword = 1;
146 1.1 cgd STARTSTACKSTR(p);
147 1.1 cgd } else {
148 1.1 cgd STPUTC(c, p);
149 1.1 cgd }
150 1.1 cgd }
151 1.1 cgd STACKSTRNUL(p);
152 1.21 christos /* Remove trailing blanks */
153 1.22 christos while (stackblock() <= --p && strchr(ifs, *p) != NULL)
154 1.21 christos *p = '\0';
155 1.1 cgd setvar(*ap, stackblock(), 0);
156 1.1 cgd while (*++ap != NULL)
157 1.1 cgd setvar(*ap, nullstr, 0);
158 1.1 cgd return status;
159 1.1 cgd }
160 1.1 cgd
161 1.1 cgd
162 1.1 cgd
163 1.12 cgd int
164 1.31 christos umaskcmd(int argc, char **argv)
165 1.12 cgd {
166 1.8 jtc char *ap;
167 1.1 cgd int mask;
168 1.1 cgd int i;
169 1.8 jtc int symbolic_mode = 0;
170 1.8 jtc
171 1.8 jtc while ((i = nextopt("S")) != '\0') {
172 1.8 jtc symbolic_mode = 1;
173 1.8 jtc }
174 1.1 cgd
175 1.8 jtc INTOFF;
176 1.8 jtc mask = umask(0);
177 1.8 jtc umask(mask);
178 1.8 jtc INTON;
179 1.8 jtc
180 1.8 jtc if ((ap = *argptr) == NULL) {
181 1.8 jtc if (symbolic_mode) {
182 1.8 jtc char u[4], g[4], o[4];
183 1.8 jtc
184 1.8 jtc i = 0;
185 1.8 jtc if ((mask & S_IRUSR) == 0)
186 1.8 jtc u[i++] = 'r';
187 1.8 jtc if ((mask & S_IWUSR) == 0)
188 1.8 jtc u[i++] = 'w';
189 1.8 jtc if ((mask & S_IXUSR) == 0)
190 1.8 jtc u[i++] = 'x';
191 1.8 jtc u[i] = '\0';
192 1.8 jtc
193 1.8 jtc i = 0;
194 1.8 jtc if ((mask & S_IRGRP) == 0)
195 1.8 jtc g[i++] = 'r';
196 1.8 jtc if ((mask & S_IWGRP) == 0)
197 1.8 jtc g[i++] = 'w';
198 1.8 jtc if ((mask & S_IXGRP) == 0)
199 1.8 jtc g[i++] = 'x';
200 1.8 jtc g[i] = '\0';
201 1.8 jtc
202 1.8 jtc i = 0;
203 1.8 jtc if ((mask & S_IROTH) == 0)
204 1.8 jtc o[i++] = 'r';
205 1.8 jtc if ((mask & S_IWOTH) == 0)
206 1.8 jtc o[i++] = 'w';
207 1.8 jtc if ((mask & S_IXOTH) == 0)
208 1.8 jtc o[i++] = 'x';
209 1.8 jtc o[i] = '\0';
210 1.8 jtc
211 1.8 jtc out1fmt("u=%s,g=%s,o=%s\n", u, g, o);
212 1.8 jtc } else {
213 1.8 jtc out1fmt("%.4o\n", mask);
214 1.8 jtc }
215 1.1 cgd } else {
216 1.25 christos if (isdigit((unsigned char)*ap)) {
217 1.8 jtc mask = 0;
218 1.8 jtc do {
219 1.8 jtc if (*ap >= '8' || *ap < '0')
220 1.8 jtc error("Illegal number: %s", argv[1]);
221 1.8 jtc mask = (mask << 3) + (*ap - '0');
222 1.8 jtc } while (*++ap != '\0');
223 1.8 jtc umask(mask);
224 1.8 jtc } else {
225 1.16 christos void *set;
226 1.8 jtc
227 1.26 itohy INTOFF;
228 1.26 itohy if ((set = setmode(ap)) != 0) {
229 1.26 itohy mask = getmode(set, ~mask & 0777);
230 1.26 itohy ckfree(set);
231 1.26 itohy }
232 1.26 itohy INTON;
233 1.26 itohy if (!set)
234 1.26 itohy error("Illegal mode: %s", ap);
235 1.26 itohy
236 1.8 jtc umask(~mask & 0777);
237 1.14 christos }
238 1.14 christos }
239 1.14 christos return 0;
240 1.14 christos }
241 1.14 christos
242 1.14 christos /*
243 1.14 christos * ulimit builtin
244 1.14 christos *
245 1.14 christos * This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
246 1.14 christos * Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
247 1.14 christos * ash by J.T. Conklin.
248 1.14 christos *
249 1.14 christos * Public domain.
250 1.14 christos */
251 1.14 christos
252 1.14 christos struct limits {
253 1.14 christos const char *name;
254 1.14 christos int cmd;
255 1.14 christos int factor; /* multiply by to get rlim_{cur,max} values */
256 1.14 christos char option;
257 1.14 christos };
258 1.14 christos
259 1.14 christos static const struct limits limits[] = {
260 1.14 christos #ifdef RLIMIT_CPU
261 1.14 christos { "time(seconds)", RLIMIT_CPU, 1, 't' },
262 1.14 christos #endif
263 1.14 christos #ifdef RLIMIT_FSIZE
264 1.14 christos { "file(blocks)", RLIMIT_FSIZE, 512, 'f' },
265 1.14 christos #endif
266 1.14 christos #ifdef RLIMIT_DATA
267 1.14 christos { "data(kbytes)", RLIMIT_DATA, 1024, 'd' },
268 1.14 christos #endif
269 1.14 christos #ifdef RLIMIT_STACK
270 1.14 christos { "stack(kbytes)", RLIMIT_STACK, 1024, 's' },
271 1.14 christos #endif
272 1.14 christos #ifdef RLIMIT_CORE
273 1.14 christos { "coredump(blocks)", RLIMIT_CORE, 512, 'c' },
274 1.14 christos #endif
275 1.14 christos #ifdef RLIMIT_RSS
276 1.14 christos { "memory(kbytes)", RLIMIT_RSS, 1024, 'm' },
277 1.14 christos #endif
278 1.14 christos #ifdef RLIMIT_MEMLOCK
279 1.14 christos { "locked memory(kbytes)", RLIMIT_MEMLOCK, 1024, 'l' },
280 1.14 christos #endif
281 1.14 christos #ifdef RLIMIT_NPROC
282 1.14 christos { "process(processes)", RLIMIT_NPROC, 1, 'p' },
283 1.14 christos #endif
284 1.14 christos #ifdef RLIMIT_NOFILE
285 1.14 christos { "nofiles(descriptors)", RLIMIT_NOFILE, 1, 'n' },
286 1.14 christos #endif
287 1.14 christos #ifdef RLIMIT_VMEM
288 1.14 christos { "vmemory(kbytes)", RLIMIT_VMEM, 1024, 'v' },
289 1.14 christos #endif
290 1.14 christos #ifdef RLIMIT_SWAP
291 1.14 christos { "swap(kbytes)", RLIMIT_SWAP, 1024, 'w' },
292 1.14 christos #endif
293 1.33 christos #ifdef RLIMIT_SBSIZE
294 1.33 christos { "sbsize(kbytes)", RLIMIT_SBSIZE, 1, 'b' },
295 1.33 christos #endif
296 1.14 christos { (char *) 0, 0, 0, '\0' }
297 1.14 christos };
298 1.14 christos
299 1.14 christos int
300 1.31 christos ulimitcmd(int argc, char **argv)
301 1.14 christos {
302 1.17 tls int c;
303 1.19 christos rlim_t val = 0;
304 1.14 christos enum { SOFT = 0x1, HARD = 0x2 }
305 1.14 christos how = SOFT | HARD;
306 1.14 christos const struct limits *l;
307 1.14 christos int set, all = 0;
308 1.14 christos int optc, what;
309 1.14 christos struct rlimit limit;
310 1.14 christos
311 1.14 christos what = 'f';
312 1.33 christos while ((optc = nextopt("HSabtfdsmcnpl")) != '\0')
313 1.14 christos switch (optc) {
314 1.14 christos case 'H':
315 1.14 christos how = HARD;
316 1.14 christos break;
317 1.14 christos case 'S':
318 1.14 christos how = SOFT;
319 1.14 christos break;
320 1.14 christos case 'a':
321 1.14 christos all = 1;
322 1.14 christos break;
323 1.14 christos default:
324 1.14 christos what = optc;
325 1.14 christos }
326 1.14 christos
327 1.14 christos for (l = limits; l->name && l->option != what; l++)
328 1.14 christos ;
329 1.14 christos if (!l->name)
330 1.28 christos error("internal error (%c)", what);
331 1.14 christos
332 1.14 christos set = *argptr ? 1 : 0;
333 1.14 christos if (set) {
334 1.14 christos char *p = *argptr;
335 1.14 christos
336 1.14 christos if (all || argptr[1])
337 1.28 christos error("too many arguments");
338 1.14 christos if (strcmp(p, "unlimited") == 0)
339 1.14 christos val = RLIM_INFINITY;
340 1.14 christos else {
341 1.15 jtc val = (rlim_t) 0;
342 1.14 christos
343 1.14 christos while ((c = *p++) >= '0' && c <= '9')
344 1.14 christos {
345 1.14 christos val = (val * 10) + (long)(c - '0');
346 1.15 jtc if (val < (rlim_t) 0)
347 1.14 christos break;
348 1.14 christos }
349 1.14 christos if (c)
350 1.28 christos error("bad number");
351 1.14 christos val *= l->factor;
352 1.14 christos }
353 1.14 christos }
354 1.14 christos if (all) {
355 1.14 christos for (l = limits; l->name; l++) {
356 1.14 christos getrlimit(l->cmd, &limit);
357 1.14 christos if (how & SOFT)
358 1.14 christos val = limit.rlim_cur;
359 1.14 christos else if (how & HARD)
360 1.14 christos val = limit.rlim_max;
361 1.14 christos
362 1.14 christos out1fmt("%-20s ", l->name);
363 1.14 christos if (val == RLIM_INFINITY)
364 1.14 christos out1fmt("unlimited\n");
365 1.14 christos else
366 1.14 christos {
367 1.14 christos val /= l->factor;
368 1.18 christos #ifdef BSD4_4
369 1.29 lukem out1fmt("%lld\n", (long long) val);
370 1.18 christos #else
371 1.18 christos out1fmt("%ld\n", (long) val);
372 1.18 christos #endif
373 1.14 christos }
374 1.14 christos }
375 1.14 christos return 0;
376 1.14 christos }
377 1.14 christos
378 1.14 christos getrlimit(l->cmd, &limit);
379 1.14 christos if (set) {
380 1.28 christos if (how & HARD)
381 1.28 christos limit.rlim_max = val;
382 1.14 christos if (how & SOFT)
383 1.14 christos limit.rlim_cur = val;
384 1.14 christos if (setrlimit(l->cmd, &limit) < 0)
385 1.28 christos error("error setting limit (%s)", strerror(errno));
386 1.14 christos } else {
387 1.14 christos if (how & SOFT)
388 1.14 christos val = limit.rlim_cur;
389 1.14 christos else if (how & HARD)
390 1.14 christos val = limit.rlim_max;
391 1.14 christos
392 1.14 christos if (val == RLIM_INFINITY)
393 1.14 christos out1fmt("unlimited\n");
394 1.14 christos else
395 1.14 christos {
396 1.14 christos val /= l->factor;
397 1.18 christos #ifdef BSD4_4
398 1.29 lukem out1fmt("%lld\n", (long long) val);
399 1.18 christos #else
400 1.18 christos out1fmt("%ld\n", (long) val);
401 1.18 christos #endif
402 1.8 jtc }
403 1.1 cgd }
404 1.1 cgd return 0;
405 1.1 cgd }
406