1994-05-26 06:18:55 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Kenneth Almquist.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
1998-05-18 06:44:24 +00:00
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)miscbltin.c 8.4 (Berkeley) 5/4/95";
|
|
|
|
#endif
|
1994-05-26 06:18:55 +00:00
|
|
|
#endif /* not lint */
|
2002-06-30 05:15:05 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
/*
|
1999-05-08 10:22:15 +00:00
|
|
|
* Miscellaneous builtins.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <ctype.h>
|
1996-09-03 13:35:11 +00:00
|
|
|
#include <errno.h>
|
2002-10-01 11:44:38 +00:00
|
|
|
#include <stdint.h>
|
1996-09-03 14:16:06 +00:00
|
|
|
#include <stdio.h>
|
1998-08-25 09:33:34 +00:00
|
|
|
#include <stdlib.h>
|
1997-09-29 15:15:16 +00:00
|
|
|
#include <termios.h>
|
1996-09-01 10:22:36 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
#include "shell.h"
|
|
|
|
#include "options.h"
|
|
|
|
#include "var.h"
|
|
|
|
#include "output.h"
|
|
|
|
#include "memalloc.h"
|
|
|
|
#include "error.h"
|
|
|
|
#include "mystring.h"
|
|
|
|
|
|
|
|
#undef eflag
|
|
|
|
|
2005-08-13 08:31:37 +00:00
|
|
|
int readcmd(int, char **);
|
|
|
|
int umaskcmd(int, char **);
|
|
|
|
int ulimitcmd(int, char **);
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
1999-08-26 08:16:27 +00:00
|
|
|
* The read builtin. The -r option causes backslashes to be treated like
|
|
|
|
* ordinary characters.
|
1994-05-26 06:18:55 +00:00
|
|
|
*
|
|
|
|
* This uses unbuffered input, which may be avoidable in some cases.
|
|
|
|
*/
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
int
|
2002-02-02 06:50:57 +00:00
|
|
|
readcmd(int argc __unused, char **argv __unused)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
char **ap;
|
|
|
|
int backslash;
|
|
|
|
char c;
|
1999-08-26 08:16:27 +00:00
|
|
|
int rflag;
|
1994-05-26 06:18:55 +00:00
|
|
|
char *prompt;
|
|
|
|
char *ifs;
|
|
|
|
char *p;
|
|
|
|
int startword;
|
|
|
|
int status;
|
|
|
|
int i;
|
1997-09-29 15:15:16 +00:00
|
|
|
struct timeval tv;
|
|
|
|
char *tvptr;
|
|
|
|
fd_set ifds;
|
|
|
|
struct termios told, tnew;
|
|
|
|
int tsaved;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
1999-08-26 08:16:27 +00:00
|
|
|
rflag = 0;
|
1994-05-26 06:18:55 +00:00
|
|
|
prompt = NULL;
|
1997-09-29 15:15:16 +00:00
|
|
|
tv.tv_sec = -1;
|
|
|
|
tv.tv_usec = 0;
|
1999-08-26 08:16:27 +00:00
|
|
|
while ((i = nextopt("erp:t:")) != '\0') {
|
1997-09-29 15:15:16 +00:00
|
|
|
switch(i) {
|
|
|
|
case 'p':
|
2000-04-20 09:49:16 +00:00
|
|
|
prompt = shoptarg;
|
1997-09-29 15:15:16 +00:00
|
|
|
break;
|
|
|
|
case 'e':
|
1999-08-26 08:16:27 +00:00
|
|
|
break;
|
|
|
|
case 'r':
|
|
|
|
rflag = 1;
|
1997-09-29 15:15:16 +00:00
|
|
|
break;
|
|
|
|
case 't':
|
2000-04-20 09:49:16 +00:00
|
|
|
tv.tv_sec = strtol(shoptarg, &tvptr, 0);
|
|
|
|
if (tvptr == shoptarg)
|
1997-09-29 15:15:16 +00:00
|
|
|
error("timeout value");
|
|
|
|
switch(*tvptr) {
|
|
|
|
case 0:
|
|
|
|
case 's':
|
|
|
|
break;
|
|
|
|
case 'h':
|
|
|
|
tv.tv_sec *= 60;
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
case 'm':
|
|
|
|
tv.tv_sec *= 60;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
error("timeout unit");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
if (prompt && isatty(0)) {
|
|
|
|
out2str(prompt);
|
|
|
|
flushall();
|
|
|
|
}
|
|
|
|
if (*(ap = argptr) == NULL)
|
|
|
|
error("arg count");
|
|
|
|
if ((ifs = bltinlookup("IFS", 1)) == NULL)
|
|
|
|
ifs = nullstr;
|
1997-09-29 15:15:16 +00:00
|
|
|
|
|
|
|
if (tv.tv_sec >= 0) {
|
|
|
|
/*
|
|
|
|
* See if we can disable input processing; this will
|
|
|
|
* not give the desired result if we are in a pipeline
|
|
|
|
* and someone upstream is still in line-by-line mode.
|
|
|
|
*/
|
|
|
|
tsaved = 0;
|
|
|
|
if (tcgetattr(0, &told) == 0) {
|
|
|
|
memcpy(&tnew, &told, sizeof(told));
|
|
|
|
cfmakeraw(&tnew);
|
|
|
|
tcsetattr(0, TCSANOW, &tnew);
|
|
|
|
tsaved = 1;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Wait for something to become available.
|
|
|
|
*/
|
|
|
|
FD_ZERO(&ifds);
|
|
|
|
FD_SET(0, &ifds);
|
|
|
|
status = select(1, &ifds, NULL, NULL, &tv);
|
|
|
|
if (tsaved)
|
|
|
|
tcsetattr(0, TCSANOW, &told);
|
|
|
|
/*
|
|
|
|
* If there's nothing ready, return an error.
|
|
|
|
*/
|
|
|
|
if (status <= 0)
|
|
|
|
return(1);
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
status = 0;
|
|
|
|
startword = 1;
|
|
|
|
backslash = 0;
|
|
|
|
STARTSTACKSTR(p);
|
|
|
|
for (;;) {
|
2001-07-26 11:02:39 +00:00
|
|
|
if (read(STDIN_FILENO, &c, 1) != 1) {
|
1994-05-26 06:18:55 +00:00
|
|
|
status = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (c == '\0')
|
|
|
|
continue;
|
|
|
|
if (backslash) {
|
|
|
|
backslash = 0;
|
|
|
|
if (c != '\n')
|
|
|
|
STPUTC(c, p);
|
|
|
|
continue;
|
|
|
|
}
|
1999-08-26 08:16:27 +00:00
|
|
|
if (!rflag && c == '\\') {
|
1994-05-26 06:18:55 +00:00
|
|
|
backslash++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (c == '\n')
|
|
|
|
break;
|
|
|
|
if (startword && *ifs == ' ' && strchr(ifs, c)) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
startword = 0;
|
Various small code cleanups resulting from a code reviewing
and linting procedure:
1. Remove useless sub-expression:
- if (*start || (!ifsspc && start > string && (nulonly || 1))) {
+ if (*start || (!ifsspc && start > string)) {
The sub-expression "(nulonly || 1)" always evaluates to true and
according to CVS logs seems to be just a left-over from some
debugging and introduced by accident. Removing the sub-expression
doesn't change semantics and a code inspection showed that the
variable "nulonly" is also not necessary here in any way (and the
expression would require fixing instead of removing).
2. Remove dead code:
- if (backslash && c == '\\') {
- if (read(STDIN_FILENO, &c, 1) != 1) {
- status = 1;
- break;
- }
- STPUTC(c, p);
- } else if (ap[1] != NULL && strchr(ifs, c) != NULL) {
+ if (ap[1] != NULL && strchr(ifs, c) != NULL) {
Inspection of the control and data flow showed that variable
"backslash" is always false (0) when the "if"-expression is
evaluated, hence the whole block is effectively dead code.
Additionally, the skipping of characters after a backslash is already
performed correctly a few lines above, so this code is also not
needed at all. According to the CVS logs and the ASH 0.2 sources,
this code existed in this way already since its early days.
3. Cleanup Style:
- ! trap[signo][0] == '\0' &&
+ ! (trap[signo][0] == '\0') &&
The expression wants to ensure the trap is not assigned the empty
string. But the "!" operator has higher precedence than "==", so the
comparison should be put into parenthesis to form the intended way of
expression. Nevertheless the code was effectively not really broken
as both particular NUL comparisons are semantically equal, of course.
But the parenthesized version is a lot more intuitive.
4. Remove shadowing variable declaration:
- char *q;
The declaration of symbol "q" hides another identical declaration of
"q" in the same context. As the other "q" is already reused multiple
times and also can be reused again without negative side-effects,
just remove the shadowing declaration.
5. Just small cosmetics:
- if (ifsset() != 0)
+ if (ifsset())
The ifsset() macro is already coded by returning the boolean result
of a comparison operator, so no need to compare this boolean result
again against a numerical value. This also aligns the macros usage to
the remaining existing code.
Reviewed by: stefanf@
2005-09-06 19:30:00 +00:00
|
|
|
if (ap[1] != NULL && strchr(ifs, c) != NULL) {
|
1994-05-26 06:18:55 +00:00
|
|
|
STACKSTRNUL(p);
|
|
|
|
setvar(*ap, stackblock(), 0);
|
|
|
|
ap++;
|
|
|
|
startword = 1;
|
|
|
|
STARTSTACKSTR(p);
|
|
|
|
} else {
|
|
|
|
STPUTC(c, p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
STACKSTRNUL(p);
|
|
|
|
setvar(*ap, stackblock(), 0);
|
|
|
|
while (*++ap != NULL)
|
|
|
|
setvar(*ap, nullstr, 0);
|
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
int
|
2002-02-02 06:50:57 +00:00
|
|
|
umaskcmd(int argc __unused, char **argv)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
|
|
|
char *ap;
|
1994-05-26 06:18:55 +00:00
|
|
|
int mask;
|
|
|
|
int i;
|
1996-09-01 10:22:36 +00:00
|
|
|
int symbolic_mode = 0;
|
|
|
|
|
|
|
|
while ((i = nextopt("S")) != '\0') {
|
|
|
|
symbolic_mode = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
INTOFF;
|
|
|
|
mask = umask(0);
|
|
|
|
umask(mask);
|
|
|
|
INTON;
|
|
|
|
|
|
|
|
if ((ap = *argptr) == NULL) {
|
|
|
|
if (symbolic_mode) {
|
|
|
|
char u[4], g[4], o[4];
|
1994-05-26 06:18:55 +00:00
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
i = 0;
|
|
|
|
if ((mask & S_IRUSR) == 0)
|
|
|
|
u[i++] = 'r';
|
|
|
|
if ((mask & S_IWUSR) == 0)
|
|
|
|
u[i++] = 'w';
|
|
|
|
if ((mask & S_IXUSR) == 0)
|
|
|
|
u[i++] = 'x';
|
|
|
|
u[i] = '\0';
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
if ((mask & S_IRGRP) == 0)
|
|
|
|
g[i++] = 'r';
|
|
|
|
if ((mask & S_IWGRP) == 0)
|
|
|
|
g[i++] = 'w';
|
|
|
|
if ((mask & S_IXGRP) == 0)
|
|
|
|
g[i++] = 'x';
|
|
|
|
g[i] = '\0';
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
if ((mask & S_IROTH) == 0)
|
|
|
|
o[i++] = 'r';
|
|
|
|
if ((mask & S_IWOTH) == 0)
|
|
|
|
o[i++] = 'w';
|
|
|
|
if ((mask & S_IXOTH) == 0)
|
|
|
|
o[i++] = 'x';
|
|
|
|
o[i] = '\0';
|
|
|
|
|
|
|
|
out1fmt("u=%s,g=%s,o=%s\n", u, g, o);
|
|
|
|
} else {
|
|
|
|
out1fmt("%.4o\n", mask);
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
} else {
|
1996-09-01 10:22:36 +00:00
|
|
|
if (isdigit(*ap)) {
|
|
|
|
mask = 0;
|
|
|
|
do {
|
|
|
|
if (*ap >= '8' || *ap < '0')
|
2005-09-09 19:59:41 +00:00
|
|
|
error("Illegal number: %s", *argptr);
|
1996-09-01 10:22:36 +00:00
|
|
|
mask = (mask << 3) + (*ap - '0');
|
|
|
|
} while (*++ap != '\0');
|
|
|
|
umask(mask);
|
|
|
|
} else {
|
1996-12-14 06:20:03 +00:00
|
|
|
void *set;
|
2005-10-28 10:45:19 +00:00
|
|
|
INTOFF;
|
1996-09-01 10:22:36 +00:00
|
|
|
if ((set = setmode (ap)) == 0)
|
1998-12-16 04:45:35 +00:00
|
|
|
error("Illegal number: %s", ap);
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
mask = getmode (set, ~mask & 0777);
|
|
|
|
umask(~mask & 0777);
|
1998-12-16 04:45:35 +00:00
|
|
|
free(set);
|
2005-10-28 10:45:19 +00:00
|
|
|
INTON;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
1995-10-19 18:42:12 +00:00
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
/*
|
|
|
|
* ulimit builtin
|
|
|
|
*
|
|
|
|
* This code, originally by Doug Gwyn, Doug Kingston, Eric Gisin, and
|
|
|
|
* Michael Rendell was ripped from pdksh 5.0.8 and hacked for use with
|
|
|
|
* ash by J.T. Conklin.
|
|
|
|
*
|
|
|
|
* Public domain.
|
|
|
|
*/
|
1995-10-19 18:42:12 +00:00
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
struct limits {
|
|
|
|
const char *name;
|
1996-09-03 13:35:11 +00:00
|
|
|
const char *units;
|
1996-09-01 10:22:36 +00:00
|
|
|
int cmd;
|
|
|
|
int factor; /* multiply by to get rlim_{cur,max} values */
|
|
|
|
char option;
|
1995-10-19 18:42:12 +00:00
|
|
|
};
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
static const struct limits limits[] = {
|
|
|
|
#ifdef RLIMIT_CPU
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "cpu time", "seconds", RLIMIT_CPU, 1, 't' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_FSIZE
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "file size", "512-blocks", RLIMIT_FSIZE, 512, 'f' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_DATA
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "data seg size", "kbytes", RLIMIT_DATA, 1024, 'd' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_STACK
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "stack size", "kbytes", RLIMIT_STACK, 1024, 's' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_CORE
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "core file size", "512-blocks", RLIMIT_CORE, 512, 'c' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_RSS
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "max memory size", "kbytes", RLIMIT_RSS, 1024, 'm' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_MEMLOCK
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "locked memory", "kbytes", RLIMIT_MEMLOCK, 1024, 'l' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_NPROC
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "max user processes", (char *)0, RLIMIT_NPROC, 1, 'u' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_NOFILE
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "open files", (char *)0, RLIMIT_NOFILE, 1, 'n' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_VMEM
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "virtual mem size", "kbytes", RLIMIT_VMEM, 1024, 'v' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_SWAP
|
1996-09-03 13:35:11 +00:00
|
|
|
{ "swap limit", "kbytes", RLIMIT_SWAP, 1024, 'w' },
|
1999-10-09 20:56:06 +00:00
|
|
|
#endif
|
|
|
|
#ifdef RLIMIT_SBSIZE
|
|
|
|
{ "sbsize", "bytes", RLIMIT_SBSIZE, 1, 'b' },
|
1996-09-01 10:22:36 +00:00
|
|
|
#endif
|
1996-09-03 13:35:11 +00:00
|
|
|
{ (char *) 0, (char *)0, 0, 0, '\0' }
|
1995-10-19 18:42:12 +00:00
|
|
|
};
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
int
|
2002-02-02 06:50:57 +00:00
|
|
|
ulimitcmd(int argc __unused, char **argv __unused)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1997-04-28 03:06:52 +00:00
|
|
|
int c;
|
2002-10-01 11:44:38 +00:00
|
|
|
rlim_t val = 0;
|
1996-09-01 10:22:36 +00:00
|
|
|
enum { SOFT = 0x1, HARD = 0x2 }
|
|
|
|
how = SOFT | HARD;
|
|
|
|
const struct limits *l;
|
|
|
|
int set, all = 0;
|
|
|
|
int optc, what;
|
|
|
|
struct rlimit limit;
|
1995-10-19 18:42:12 +00:00
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
what = 'f';
|
2002-06-26 00:29:53 +00:00
|
|
|
while ((optc = nextopt("HSatfdsmcnuvlb")) != '\0')
|
1996-09-01 10:22:36 +00:00
|
|
|
switch (optc) {
|
1995-10-19 18:42:12 +00:00
|
|
|
case 'H':
|
1996-09-01 10:22:36 +00:00
|
|
|
how = HARD;
|
1995-10-19 18:42:12 +00:00
|
|
|
break;
|
|
|
|
case 'S':
|
1996-09-01 10:22:36 +00:00
|
|
|
how = SOFT;
|
1995-10-19 18:42:12 +00:00
|
|
|
break;
|
|
|
|
case 'a':
|
1996-09-01 10:22:36 +00:00
|
|
|
all = 1;
|
1995-10-19 18:42:12 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
default:
|
|
|
|
what = optc;
|
1995-10-19 18:42:12 +00:00
|
|
|
}
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
for (l = limits; l->name && l->option != what; l++)
|
|
|
|
;
|
|
|
|
if (!l->name)
|
2002-09-30 13:29:32 +00:00
|
|
|
error("internal error (%c)", what);
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
set = *argptr ? 1 : 0;
|
|
|
|
if (set) {
|
|
|
|
char *p = *argptr;
|
|
|
|
|
|
|
|
if (all || argptr[1])
|
2002-09-30 13:29:32 +00:00
|
|
|
error("too many arguments");
|
1996-09-01 10:22:36 +00:00
|
|
|
if (strcmp(p, "unlimited") == 0)
|
1995-10-19 18:42:12 +00:00
|
|
|
val = RLIM_INFINITY;
|
|
|
|
else {
|
2002-10-01 11:44:38 +00:00
|
|
|
val = 0;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
while ((c = *p++) >= '0' && c <= '9')
|
|
|
|
{
|
|
|
|
val = (val * 10) + (long)(c - '0');
|
2002-10-01 11:44:38 +00:00
|
|
|
if (val < 0)
|
1996-09-01 10:22:36 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (c)
|
2002-09-30 13:29:32 +00:00
|
|
|
error("bad number");
|
1996-09-01 10:22:36 +00:00
|
|
|
val *= l->factor;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (all) {
|
2006-02-04 14:37:50 +00:00
|
|
|
for (l = limits; l->name; l++) {
|
1996-09-03 13:35:11 +00:00
|
|
|
char optbuf[40];
|
|
|
|
if (getrlimit(l->cmd, &limit) < 0)
|
2002-09-30 13:29:32 +00:00
|
|
|
error("can't get limit: %s", strerror(errno));
|
1996-09-01 10:22:36 +00:00
|
|
|
if (how & SOFT)
|
|
|
|
val = limit.rlim_cur;
|
|
|
|
else if (how & HARD)
|
|
|
|
val = limit.rlim_max;
|
|
|
|
|
1996-09-03 13:35:11 +00:00
|
|
|
if (l->units)
|
|
|
|
snprintf(optbuf, sizeof(optbuf),
|
1996-09-03 14:24:44 +00:00
|
|
|
"(%s, -%c) ", l->units, l->option);
|
1996-09-03 13:35:11 +00:00
|
|
|
else
|
|
|
|
snprintf(optbuf, sizeof(optbuf),
|
1996-09-03 14:24:44 +00:00
|
|
|
"(-%c) ", l->option);
|
|
|
|
out1fmt("%-18s %18s ", l->name, optbuf);
|
1996-09-01 10:22:36 +00:00
|
|
|
if (val == RLIM_INFINITY)
|
|
|
|
out1fmt("unlimited\n");
|
|
|
|
else
|
|
|
|
{
|
|
|
|
val /= l->factor;
|
2002-10-01 11:44:38 +00:00
|
|
|
out1fmt("%jd\n", (intmax_t)val);
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
1995-10-19 18:42:12 +00:00
|
|
|
}
|
1996-09-01 10:22:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1996-09-03 13:35:11 +00:00
|
|
|
if (getrlimit(l->cmd, &limit) < 0)
|
2002-09-30 13:29:32 +00:00
|
|
|
error("can't get limit: %s", strerror(errno));
|
1996-09-01 10:22:36 +00:00
|
|
|
if (set) {
|
|
|
|
if (how & SOFT)
|
|
|
|
limit.rlim_cur = val;
|
|
|
|
if (how & HARD)
|
|
|
|
limit.rlim_max = val;
|
|
|
|
if (setrlimit(l->cmd, &limit) < 0)
|
2002-09-30 13:29:32 +00:00
|
|
|
error("bad limit: %s", strerror(errno));
|
1996-09-01 10:22:36 +00:00
|
|
|
} else {
|
|
|
|
if (how & SOFT)
|
|
|
|
val = limit.rlim_cur;
|
|
|
|
else if (how & HARD)
|
|
|
|
val = limit.rlim_max;
|
|
|
|
|
|
|
|
if (val == RLIM_INFINITY)
|
|
|
|
out1fmt("unlimited\n");
|
|
|
|
else
|
|
|
|
{
|
|
|
|
val /= l->factor;
|
2002-10-01 11:44:38 +00:00
|
|
|
out1fmt("%jd\n", (intmax_t)val);
|
1995-10-19 18:42:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|