sh/miscbltin.c - android_system_core - Gitiles

 /*	$NetBSD: miscbltin.c,v 1.34.2.1 2005/04/07 11:34:20 tron Exp $	*/

 /*-
  * 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.
  * 3. 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.
  */

 #include <sys/cdefs.h>
 #ifndef lint
 #if 0
 static char sccsid[] = "@(#)miscbltin.c	8.4 (Berkeley) 5/4/95";
 #else
 __RCSID("$NetBSD: miscbltin.c,v 1.34.2.1 2005/04/07 11:34:20 tron Exp $");
 #endif
 #endif /* not lint */

 /*
  * Miscelaneous builtins.
  */

 #include <sys/types.h>		/* quad_t */
 #include <sys/param.h>		/* BSD4_4 */
 #include <sys/stat.h>
 #include <sys/time.h>
 #include <sys/resource.h>
 #include <unistd.h>
 #include <stdlib.h>
 #include <ctype.h>
 #include <errno.h>

 #include "shell.h"
 #include "options.h"
 #include "var.h"
 #include "output.h"
 #include "memalloc.h"
 #include "error.h"
 #include "miscbltin.h"
 #include "mystring.h"

 #undef rflag


 /*
  * The read builtin.
  * Backslahes escape the next char unless -r is specified.
  *
  * This uses unbuffered input, which may be avoidable in some cases.
  *
  * Note that if IFS=' :' then read x y should work so that:
  * 'a b'	x='a', y='b'
  * ' a b '	x='a', y='b'
  * ':b'		x='',  y='b'
  * ':'		x='',  y=''
  * '::'		x='',  y=''
  * ': :'	x='',  y=''
  * ':::'	x='',  y='::'
  * ':b c:'	x='',  y='b c:'
  */

 int
 readcmd(int argc, char **argv)
 {
 	char **ap;
 	char c;
 	int rflag;
 	char *prompt;
 	const char *ifs;
 	char *p;
 	int startword;
 	int status;
 	int i;
 	int is_ifs;
 	int saveall = 0;

 	rflag = 0;
 	prompt = NULL;
 	while ((i = nextopt("p:r")) != '\0') {
 		if (i == 'p')
 			prompt = optionarg;
 		else
 			rflag = 1;
 	}

 	if (prompt && isatty(0)) {
 		out2str(prompt);
 		flushall();
 	}

 	if (*(ap = argptr) == NULL)
 		error("arg count");

 	if ((ifs = bltinlookup("IFS", 1)) == NULL)
 		ifs = " \t\n";

 	status = 0;
 	startword = 2;
 	STARTSTACKSTR(p);
 	for (;;) {
 		if (read(0, &c, 1) != 1) {
 			status = 1;
 			break;
 		}
 		if (c == '\0')
 			continue;
 		if (c == '\\' && !rflag) {
 			if (read(0, &c, 1) != 1) {
 				status = 1;
 				break;
 			}
 			if (c != '\n')
 				STPUTC(c, p);
 			continue;
 		}
 		if (c == '\n')
 			break;
 		if (strchr(ifs, c))
 			is_ifs = strchr(" \t\n", c) ? 1 : 2;
 		else
 			is_ifs = 0;

 		if (startword != 0) {
 			if (is_ifs == 1) {
 				/* Ignore leading IFS whitespace */
 				if (saveall)
 					STPUTC(c, p);
 				continue;
 			}
 			if (is_ifs == 2 && startword == 1) {
 				/* Only one non-whitespace IFS per word */
 				startword = 2;
 				if (saveall)
 					STPUTC(c, p);
 				continue;
 			}
 		}

 		if (is_ifs == 0) {
 			/* append this character to the current variable */
 			startword = 0;
 			if (saveall)
 				/* Not just a spare terminator */
 				saveall++;
 			STPUTC(c, p);
 			continue;
 		}

 		/* end of variable... */
 		startword = is_ifs;

 		if (ap[1] == NULL) {
 			/* Last variable needs all IFS chars */
 			saveall++;
 			STPUTC(c, p);
 			continue;
 		}

 		STACKSTRNUL(p);
 		setvar(*ap, stackblock(), 0);
 		ap++;
 		STARTSTACKSTR(p);
 	}
 	STACKSTRNUL(p);

 	/* Remove trailing IFS chars */
 	for (; stackblock() <= --p; *p = 0) {
 		if (!strchr(ifs, *p))
 			break;
 		if (strchr(" \t\n", *p))
 			/* Always remove whitespace */
 			continue;
 		if (saveall > 1)
 			/* Don't remove non-whitespace unless it was naked */
 			break;
 	}
 	setvar(*ap, stackblock(), 0);

 	/* Set any remaining args to "" */
 	while (*++ap != NULL)
 		setvar(*ap, nullstr, 0);
 	return status;
 }


 int
 umaskcmd(int argc, char **argv)
 {
 	char *ap;
 	int mask;
 	int i;
 	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];

 			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);
 		}
 	} else {
 		if (isdigit((unsigned char)*ap)) {
 			mask = 0;
 			do {
 				if (*ap >= '8' || *ap < '0')
 					error("Illegal number: %s", argv[1]);
 				mask = (mask << 3) + (*ap - '0');
 			} while (*++ap != '\0');
 			umask(mask);
 		} else
 			error("Illegal mode: %s", ap);
 	}
 	return 0;
 }

 #if 1
 /*
  * 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.
  */

 struct limits {
 	const char *name;
 	int	cmd;
 	int	factor;	/* multiply by to get rlim_{cur,max} values */
 	char	option;
 };

 static const struct limits limits[] = {
 #ifdef RLIMIT_CPU
 	{ "time(seconds)",		RLIMIT_CPU,	   1, 't' },
 #endif
 #ifdef RLIMIT_FSIZE
 	{ "file(blocks)",		RLIMIT_FSIZE,	 512, 'f' },
 #endif
 #ifdef RLIMIT_DATA
 	{ "data(kbytes)",		RLIMIT_DATA,	1024, 'd' },
 #endif
 #ifdef RLIMIT_STACK
 	{ "stack(kbytes)",		RLIMIT_STACK,	1024, 's' },
 #endif
 #ifdef  RLIMIT_CORE
 	{ "coredump(blocks)",		RLIMIT_CORE,	 512, 'c' },
 #endif
 #ifdef RLIMIT_RSS
 	{ "memory(kbytes)",		RLIMIT_RSS,	1024, 'm' },
 #endif
 #ifdef RLIMIT_MEMLOCK
 	{ "locked memory(kbytes)",	RLIMIT_MEMLOCK, 1024, 'l' },
 #endif
 #ifdef RLIMIT_NPROC
 	{ "process(processes)",		RLIMIT_NPROC,      1, 'p' },
 #endif
 #ifdef RLIMIT_NOFILE
 	{ "nofiles(descriptors)",	RLIMIT_NOFILE,     1, 'n' },
 #endif
 #ifdef RLIMIT_VMEM
 	{ "vmemory(kbytes)",		RLIMIT_VMEM,	1024, 'v' },
 #endif
 #ifdef RLIMIT_SWAP
 	{ "swap(kbytes)",		RLIMIT_SWAP,	1024, 'w' },
 #endif
 #ifdef RLIMIT_SBSIZE
 	{ "sbsize(bytes)",		RLIMIT_SBSIZE,	   1, 'b' },
 #endif
 	{ (char *) 0,			0,		   0,  '\0' }
 };

 int
 ulimitcmd(int argc, char **argv)
 {
 	int	c;
 	rlim_t val = 0;
 	enum { SOFT = 0x1, HARD = 0x2 }
 			how = SOFT | HARD;
 	const struct limits	*l;
 	int		set, all = 0;
 	int		optc, what;
 	struct rlimit	limit;

 	what = 'f';
 	while ((optc = nextopt("HSabtfdsmcnpl")) != '\0')
 		switch (optc) {
 		case 'H':
 			how = HARD;
 			break;
 		case 'S':
 			how = SOFT;
 			break;
 		case 'a':
 			all = 1;
 			break;
 		default:
 			what = optc;
 		}

 	for (l = limits; l->name && l->option != what; l++)
 		;
 	if (!l->name)
 		error("internal error (%c)", what);

 	set = *argptr ? 1 : 0;
 	if (set) {
 		char *p = *argptr;

 		if (all || argptr[1])
 			error("too many arguments");
 		if (strcmp(p, "unlimited") == 0)
 			val = RLIM_INFINITY;
 		else {
 			val = (rlim_t) 0;

 			while ((c = *p++) >= '0' && c <= '9')
 			{
 				val = (val * 10) + (long)(c - '0');
 				if ((long)val < 0)
 					break;
 			}
 			if (c)
 				error("bad number");
 			val *= l->factor;
 		}
 	}
 	if (all) {
 		for (l = limits; l->name; l++) {
 			getrlimit(l->cmd, &limit);
 			if (how & SOFT)
 				val = limit.rlim_cur;
 			else if (how & HARD)
 				val = limit.rlim_max;

 			out1fmt("%-20s ", l->name);
 			if (val == RLIM_INFINITY)
 				out1fmt("unlimited\n");
 			else
 			{
 				val /= l->factor;
 #ifdef BSD4_4
 				out1fmt("%lld\n", (long long) val);
 #else
 				out1fmt("%ld\n", (long) val);
 #endif
 			}
 		}
 		return 0;
 	}

 	getrlimit(l->cmd, &limit);
 	if (set) {
 		if (how & HARD)
 			limit.rlim_max = val;
 		if (how & SOFT)
 			limit.rlim_cur = val;
 		if (setrlimit(l->cmd, &limit) < 0)
 			error("error setting limit (%s)", strerror(errno));
 	} 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;
 #ifdef BSD4_4
 			out1fmt("%lld\n", (long long) val);
 #else
 			out1fmt("%ld\n", (long) val);
 #endif
 		}
 	}
 	return 0;
 }
 #endif
	/* $NetBSD: miscbltin.c,v 1.34.2.1 2005/04/07 11:34:20 tron Exp $ */

	/*-
	* 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.
	* 3. 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.
	*/

	#include <sys/cdefs.h>
	#ifndef lint
	#if 0
	static char sccsid[] = "@(#)miscbltin.c 8.4 (Berkeley) 5/4/95";
	#else
	__RCSID("$NetBSD: miscbltin.c,v 1.34.2.1 2005/04/07 11:34:20 tron Exp $");
	#endif
	#endif /* not lint */

	/*
	* Miscelaneous builtins.
	*/

	#include <sys/types.h> /* quad_t */
	#include <sys/param.h> /* BSD4_4 */
	#include <sys/stat.h>
	#include <sys/time.h>
	#include <sys/resource.h>
	#include <unistd.h>
	#include <stdlib.h>
	#include <ctype.h>
	#include <errno.h>

	#include "shell.h"
	#include "options.h"
	#include "var.h"
	#include "output.h"
	#include "memalloc.h"
	#include "error.h"
	#include "miscbltin.h"
	#include "mystring.h"

	#undef rflag



	/*
	* The read builtin.
	* Backslahes escape the next char unless -r is specified.
	*
	* This uses unbuffered input, which may be avoidable in some cases.
	*
	* Note that if IFS=' :' then read x y should work so that:
	* 'a b' x='a', y='b'
	* ' a b ' x='a', y='b'
	* ':b' x='', y='b'
	* ':' x='', y=''
	* '::' x='', y=''
	* ': :' x='', y=''
	* ':::' x='', y='::'
	* ':b c:' x='', y='b c:'
	*/

	int
	readcmd(int argc, char **argv)
	{
	char **ap;
	char c;
	int rflag;
	char *prompt;
	const char *ifs;
	char *p;
	int startword;
	int status;
	int i;
	int is_ifs;
	int saveall = 0;

	rflag = 0;
	prompt = NULL;
	while ((i = nextopt("p:r")) != '\0') {
	if (i == 'p')
	prompt = optionarg;
	else
	rflag = 1;
	}

	if (prompt && isatty(0)) {
	out2str(prompt);
	flushall();
	}

	if (*(ap = argptr) == NULL)
	error("arg count");

	if ((ifs = bltinlookup("IFS", 1)) == NULL)
	ifs = " \t\n";

	status = 0;
	startword = 2;
	STARTSTACKSTR(p);
	for (;;) {
	if (read(0, &c, 1) != 1) {
	status = 1;
	break;
	}
	if (c == '\0')
	continue;
	if (c == '\\' && !rflag) {
	if (read(0, &c, 1) != 1) {
	status = 1;
	break;
	}
	if (c != '\n')
	STPUTC(c, p);
	continue;
	}
	if (c == '\n')
	break;
	if (strchr(ifs, c))
	is_ifs = strchr(" \t\n", c) ? 1 : 2;
	else
	is_ifs = 0;

	if (startword != 0) {
	if (is_ifs == 1) {
	/* Ignore leading IFS whitespace */
	if (saveall)
	STPUTC(c, p);
	continue;
	}
	if (is_ifs == 2 && startword == 1) {
	/* Only one non-whitespace IFS per word */
	startword = 2;
	if (saveall)
	STPUTC(c, p);
	continue;
	}
	}

	if (is_ifs == 0) {
	/* append this character to the current variable */
	startword = 0;
	if (saveall)
	/* Not just a spare terminator */
	saveall++;
	STPUTC(c, p);
	continue;
	}

	/* end of variable... */
	startword = is_ifs;

	if (ap[1] == NULL) {
	/* Last variable needs all IFS chars */
	saveall++;
	STPUTC(c, p);
	continue;
	}

	STACKSTRNUL(p);
	setvar(*ap, stackblock(), 0);
	ap++;
	STARTSTACKSTR(p);
	}
	STACKSTRNUL(p);

	/* Remove trailing IFS chars */
	for (; stackblock() <= --p; *p = 0) {
	if (!strchr(ifs, *p))
	break;
	if (strchr(" \t\n", *p))
	/* Always remove whitespace */
	continue;
	if (saveall > 1)
	/* Don't remove non-whitespace unless it was naked */
	break;
	}
	setvar(*ap, stackblock(), 0);

	/* Set any remaining args to "" */
	while (*++ap != NULL)
	setvar(*ap, nullstr, 0);
	return status;
	}



	int
	umaskcmd(int argc, char **argv)
	{
	char *ap;
	int mask;
	int i;
	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];

	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);
	}
	} else {
	if (isdigit((unsigned char)*ap)) {
	mask = 0;
	do {
	if (ap >= '8' \|\| ap < '0')
	error("Illegal number: %s", argv[1]);
	mask = (mask << 3) + (*ap - '0');
	} while (*++ap != '\0');
	umask(mask);
	} else
	error("Illegal mode: %s", ap);
	}
	return 0;
	}

	#if 1
	/*
	* 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.
	*/

	struct limits {
	const char *name;
	int cmd;
	int factor; /* multiply by to get rlim_{cur,max} values */
	char option;
	};

	static const struct limits limits[] = {
	#ifdef RLIMIT_CPU
	{ "time(seconds)", RLIMIT_CPU, 1, 't' },
	#endif
	#ifdef RLIMIT_FSIZE
	{ "file(blocks)", RLIMIT_FSIZE, 512, 'f' },
	#endif
	#ifdef RLIMIT_DATA
	{ "data(kbytes)", RLIMIT_DATA, 1024, 'd' },
	#endif
	#ifdef RLIMIT_STACK
	{ "stack(kbytes)", RLIMIT_STACK, 1024, 's' },
	#endif
	#ifdef RLIMIT_CORE
	{ "coredump(blocks)", RLIMIT_CORE, 512, 'c' },
	#endif
	#ifdef RLIMIT_RSS
	{ "memory(kbytes)", RLIMIT_RSS, 1024, 'm' },
	#endif
	#ifdef RLIMIT_MEMLOCK
	{ "locked memory(kbytes)", RLIMIT_MEMLOCK, 1024, 'l' },
	#endif
	#ifdef RLIMIT_NPROC
	{ "process(processes)", RLIMIT_NPROC, 1, 'p' },
	#endif
	#ifdef RLIMIT_NOFILE
	{ "nofiles(descriptors)", RLIMIT_NOFILE, 1, 'n' },
	#endif
	#ifdef RLIMIT_VMEM
	{ "vmemory(kbytes)", RLIMIT_VMEM, 1024, 'v' },
	#endif
	#ifdef RLIMIT_SWAP
	{ "swap(kbytes)", RLIMIT_SWAP, 1024, 'w' },
	#endif
	#ifdef RLIMIT_SBSIZE
	{ "sbsize(bytes)", RLIMIT_SBSIZE, 1, 'b' },
	#endif
	{ (char *) 0, 0, 0, '\0' }
	};

	int
	ulimitcmd(int argc, char **argv)
	{
	int c;
	rlim_t val = 0;
	enum { SOFT = 0x1, HARD = 0x2 }
	how = SOFT \| HARD;
	const struct limits *l;
	int set, all = 0;
	int optc, what;
	struct rlimit limit;

	what = 'f';
	while ((optc = nextopt("HSabtfdsmcnpl")) != '\0')
	switch (optc) {
	case 'H':
	how = HARD;
	break;
	case 'S':
	how = SOFT;
	break;
	case 'a':
	all = 1;
	break;
	default:
	what = optc;
	}

	for (l = limits; l->name && l->option != what; l++)
	;
	if (!l->name)
	error("internal error (%c)", what);

	set = *argptr ? 1 : 0;
	if (set) {
	char p = argptr;

	if (all \|\| argptr[1])
	error("too many arguments");
	if (strcmp(p, "unlimited") == 0)
	val = RLIM_INFINITY;
	else {
	val = (rlim_t) 0;

	while ((c = *p++) >= '0' && c <= '9')
	{
	val = (val * 10) + (long)(c - '0');
	if ((long)val < 0)
	break;
	}
	if (c)
	error("bad number");
	val *= l->factor;
	}
	}
	if (all) {
	for (l = limits; l->name; l++) {
	getrlimit(l->cmd, &limit);
	if (how & SOFT)
	val = limit.rlim_cur;
	else if (how & HARD)
	val = limit.rlim_max;

	out1fmt("%-20s ", l->name);
	if (val == RLIM_INFINITY)
	out1fmt("unlimited\n");
	else
	{
	val /= l->factor;
	#ifdef BSD4_4
	out1fmt("%lld\n", (long long) val);
	#else
	out1fmt("%ld\n", (long) val);
	#endif
	}
	}
	return 0;
	}

	getrlimit(l->cmd, &limit);
	if (set) {
	if (how & HARD)
	limit.rlim_max = val;
	if (how & SOFT)
	limit.rlim_cur = val;
	if (setrlimit(l->cmd, &limit) < 0)
	error("error setting limit (%s)", strerror(errno));
	} 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;
	#ifdef BSD4_4
	out1fmt("%lld\n", (long long) val);
	#else
	out1fmt("%ld\n", (long) val);
	#endif
	}
	}
	return 0;
	}
	#endif