1994-05-26 06:18:55 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
2010-05-11 23:19:28 +00:00
|
|
|
* Copyright (c) 1997-2005
|
|
|
|
* Herbert Xu <herbert@gondor.apana.org.au>. All rights reserved.
|
2015-12-31 17:51:15 +00:00
|
|
|
* Copyright (c) 2010-2015
|
|
|
|
* Jilles Tjoelker <jilles@stack.nl>. All rights reserved.
|
1994-05-26 06:18:55 +00:00
|
|
|
*
|
|
|
|
* 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.
|
2017-02-28 23:42:47 +00:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1994-05-26 06:18:55 +00:00
|
|
|
* 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[] = "@(#)expand.c 8.5 (Berkeley) 5/15/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
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <dirent.h>
|
2010-10-13 13:22:11 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <inttypes.h>
|
1996-10-31 07:15:57 +00:00
|
|
|
#include <limits.h>
|
2010-10-13 13:22:11 +00:00
|
|
|
#include <pwd.h>
|
1998-09-06 21:13:09 +00:00
|
|
|
#include <stdio.h>
|
2010-10-13 13:22:11 +00:00
|
|
|
#include <stdlib.h>
|
2002-12-26 14:28:54 +00:00
|
|
|
#include <string.h>
|
2010-10-13 13:22:11 +00:00
|
|
|
#include <unistd.h>
|
2011-05-08 11:32:20 +00:00
|
|
|
#include <wchar.h>
|
2011-06-15 21:48:10 +00:00
|
|
|
#include <wctype.h>
|
1996-09-01 10:22:36 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* Routines to expand arguments to commands. We have to deal with
|
|
|
|
* backquotes, shell variables, and file metacharacters.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "shell.h"
|
|
|
|
#include "main.h"
|
|
|
|
#include "nodes.h"
|
|
|
|
#include "eval.h"
|
|
|
|
#include "expand.h"
|
|
|
|
#include "syntax.h"
|
|
|
|
#include "parser.h"
|
|
|
|
#include "jobs.h"
|
|
|
|
#include "options.h"
|
|
|
|
#include "var.h"
|
|
|
|
#include "input.h"
|
|
|
|
#include "output.h"
|
|
|
|
#include "memalloc.h"
|
|
|
|
#include "error.h"
|
|
|
|
#include "mystring.h"
|
1996-09-01 10:22:36 +00:00
|
|
|
#include "arith.h"
|
|
|
|
#include "show.h"
|
2011-06-13 21:03:27 +00:00
|
|
|
#include "builtins.h"
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
enum wordstate { WORD_IDLE, WORD_WS_DELIMITED, WORD_QUOTEMARK };
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
struct worddest {
|
2015-12-31 18:47:54 +00:00
|
|
|
struct arglist *list;
|
2015-12-31 17:51:15 +00:00
|
|
|
enum wordstate state;
|
1994-05-26 06:18:55 +00:00
|
|
|
};
|
|
|
|
|
2010-10-13 04:01:01 +00:00
|
|
|
static char *expdest; /* output of current string */
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2017-03-16 21:53:55 +00:00
|
|
|
static const char *argstr(const char *, struct nodelist **restrict, int,
|
|
|
|
struct worddest *);
|
2016-01-24 22:26:25 +00:00
|
|
|
static const char *exptilde(const char *, int);
|
2017-03-16 21:53:55 +00:00
|
|
|
static const char *expari(const char *, struct nodelist **restrict, int,
|
|
|
|
struct worddest *);
|
2015-12-31 17:51:15 +00:00
|
|
|
static void expbackq(union node *, int, int, struct worddest *);
|
2017-04-02 13:29:27 +00:00
|
|
|
static const char *subevalvar_trim(const char *, struct nodelist **restrict,
|
|
|
|
int, int, int);
|
2017-04-02 13:43:45 +00:00
|
|
|
static const char *subevalvar_misc(const char *, struct nodelist **restrict,
|
|
|
|
const char *, int, int, int);
|
2017-03-16 21:53:55 +00:00
|
|
|
static const char *evalvar(const char *, struct nodelist **restrict, int,
|
|
|
|
struct worddest *);
|
2014-03-14 21:45:37 +00:00
|
|
|
static int varisset(const char *, int);
|
2015-12-31 17:51:15 +00:00
|
|
|
static void strtodest(const char *, int, int, int, struct worddest *);
|
|
|
|
static void reprocess(int, int, int, int, struct worddest *);
|
|
|
|
static void varvalue(const char *, int, int, int, struct worddest *);
|
2015-12-31 18:47:54 +00:00
|
|
|
static void expandmeta(char *, struct arglist *);
|
2015-10-11 21:33:00 +00:00
|
|
|
static void expmeta(char *, char *, struct arglist *);
|
|
|
|
static int expsortcmp(const void *, const void *);
|
2015-12-31 17:51:15 +00:00
|
|
|
static int patmatch(const char *, const char *);
|
|
|
|
static void cvtnum(int, char *);
|
2016-07-14 09:34:42 +00:00
|
|
|
static int collate_range_cmp(wchar_t, wchar_t);
|
2010-10-13 22:18:03 +00:00
|
|
|
|
2015-10-11 21:33:00 +00:00
|
|
|
void
|
|
|
|
emptyarglist(struct arglist *list)
|
|
|
|
{
|
|
|
|
|
|
|
|
list->args = list->smallarg;
|
|
|
|
list->count = 0;
|
|
|
|
list->capacity = sizeof(list->smallarg) / sizeof(list->smallarg[0]);
|
|
|
|
}
|
|
|
|
|
2015-11-01 22:07:40 +00:00
|
|
|
void
|
2015-10-11 21:33:00 +00:00
|
|
|
appendarglist(struct arglist *list, char *str)
|
|
|
|
{
|
|
|
|
char **newargs;
|
|
|
|
int newcapacity;
|
|
|
|
|
|
|
|
if (list->count >= list->capacity) {
|
|
|
|
newcapacity = list->capacity * 2;
|
|
|
|
if (newcapacity < 16)
|
|
|
|
newcapacity = 16;
|
|
|
|
if (newcapacity > INT_MAX / (int)sizeof(newargs[0]))
|
|
|
|
error("Too many entries in arglist");
|
|
|
|
newargs = stalloc(newcapacity * sizeof(newargs[0]));
|
|
|
|
memcpy(newargs, list->args, list->count * sizeof(newargs[0]));
|
|
|
|
list->args = newargs;
|
|
|
|
list->capacity = newcapacity;
|
|
|
|
}
|
|
|
|
list->args[list->count++] = str;
|
|
|
|
}
|
|
|
|
|
2016-07-14 09:34:42 +00:00
|
|
|
static int
|
|
|
|
collate_range_cmp(wchar_t c1, wchar_t c2)
|
|
|
|
{
|
2017-04-02 14:02:10 +00:00
|
|
|
wchar_t s1[2], s2[2];
|
2016-07-14 09:34:42 +00:00
|
|
|
|
|
|
|
s1[0] = c1;
|
2017-04-02 14:02:10 +00:00
|
|
|
s1[1] = L'\0';
|
2016-07-14 09:34:42 +00:00
|
|
|
s2[0] = c2;
|
2017-04-02 14:02:10 +00:00
|
|
|
s2[1] = L'\0';
|
2016-07-14 09:34:42 +00:00
|
|
|
return (wcscoll(s1, s2));
|
|
|
|
}
|
|
|
|
|
2010-12-11 22:13:29 +00:00
|
|
|
static char *
|
|
|
|
stputs_quotes(const char *data, const char *syntax, char *p)
|
|
|
|
{
|
|
|
|
while (*data) {
|
|
|
|
CHECKSTRSPACE(2, p);
|
|
|
|
if (syntax[(int)*data] == CCTL)
|
|
|
|
USTPUTC(CTLESC, p);
|
|
|
|
USTPUTC(*data++, p);
|
|
|
|
}
|
|
|
|
return (p);
|
|
|
|
}
|
|
|
|
#define STPUTS_QUOTES(data, syntax, p) p = stputs_quotes((data), syntax, p)
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
static char *
|
2015-12-31 18:47:54 +00:00
|
|
|
nextword(char c, int flag, char *p, struct worddest *dst)
|
2015-12-31 17:51:15 +00:00
|
|
|
{
|
|
|
|
int is_ws;
|
|
|
|
|
|
|
|
is_ws = c == '\t' || c == '\n' || c == ' ';
|
|
|
|
if (p != stackblock() || (is_ws ? dst->state == WORD_QUOTEMARK :
|
|
|
|
dst->state != WORD_WS_DELIMITED) || c == '\0') {
|
|
|
|
STPUTC('\0', p);
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_GLOB)
|
|
|
|
expandmeta(grabstackstr(p), dst->list);
|
|
|
|
else
|
|
|
|
appendarglist(dst->list, grabstackstr(p));
|
2015-12-31 17:51:15 +00:00
|
|
|
dst->state = is_ws ? WORD_WS_DELIMITED : WORD_IDLE;
|
|
|
|
} else if (!is_ws && dst->state == WORD_WS_DELIMITED)
|
|
|
|
dst->state = WORD_IDLE;
|
|
|
|
/* Reserve space while the stack string is empty. */
|
2015-12-31 18:47:54 +00:00
|
|
|
appendarglist(dst->list, NULL);
|
|
|
|
dst->list->count--;
|
2015-12-31 17:51:15 +00:00
|
|
|
STARTSTACKSTR(p);
|
|
|
|
return p;
|
|
|
|
}
|
2015-12-31 18:47:54 +00:00
|
|
|
#define NEXTWORD(c, flag, p, dstlist) p = nextword(c, flag, p, dstlist)
|
2015-12-31 17:51:15 +00:00
|
|
|
|
|
|
|
static char *
|
2015-12-31 18:47:54 +00:00
|
|
|
stputs_split(const char *data, const char *syntax, int flag, char *p,
|
2015-12-31 17:51:15 +00:00
|
|
|
struct worddest *dst)
|
|
|
|
{
|
|
|
|
const char *ifs;
|
|
|
|
char c;
|
|
|
|
|
|
|
|
ifs = ifsset() ? ifsval() : " \t\n";
|
|
|
|
while (*data) {
|
|
|
|
CHECKSTRSPACE(2, p);
|
|
|
|
c = *data++;
|
|
|
|
if (strchr(ifs, c) != NULL) {
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD(c, flag, p, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
continue;
|
|
|
|
}
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_GLOB && syntax[(int)c] == CCTL)
|
2015-12-31 17:51:15 +00:00
|
|
|
USTPUTC(CTLESC, p);
|
|
|
|
USTPUTC(c, p);
|
|
|
|
}
|
|
|
|
return (p);
|
|
|
|
}
|
2015-12-31 18:47:54 +00:00
|
|
|
#define STPUTS_SPLIT(data, syntax, flag, p, dst) p = stputs_split((data), syntax, flag, p, dst)
|
2015-12-31 17:51:15 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
2010-09-05 21:12:48 +00:00
|
|
|
* Perform expansions on an argument, placing the resulting list of arguments
|
|
|
|
* in arglist. Parameter expansion, command substitution and arithmetic
|
|
|
|
* expansion are always performed; additional expansions can be requested
|
|
|
|
* via flag (EXP_*).
|
|
|
|
* The result is left in the stack string.
|
2011-02-02 21:48:53 +00:00
|
|
|
* When arglist is NULL, perform here document expansion.
|
2010-09-05 21:12:48 +00:00
|
|
|
*
|
2017-05-06 13:28:42 +00:00
|
|
|
* When doing something that may cause this to be re-entered, make sure
|
|
|
|
* the stack string is empty via grabstackstr() and do not assume expdest
|
|
|
|
* remains valid.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
void
|
2002-02-02 06:50:57 +00:00
|
|
|
expandarg(union node *arg, struct arglist *arglist, int flag)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
2015-12-31 17:51:15 +00:00
|
|
|
struct worddest exparg;
|
2017-03-16 21:53:55 +00:00
|
|
|
struct nodelist *argbackq;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-12-31 18:47:54 +00:00
|
|
|
if (fflag)
|
|
|
|
flag &= ~EXP_GLOB;
|
1994-05-26 06:18:55 +00:00
|
|
|
argbackq = arg->narg.backquote;
|
2015-12-31 18:47:54 +00:00
|
|
|
exparg.list = arglist;
|
2015-12-31 17:51:15 +00:00
|
|
|
exparg.state = WORD_IDLE;
|
1994-05-26 06:18:55 +00:00
|
|
|
STARTSTACKSTR(expdest);
|
2017-03-16 21:53:55 +00:00
|
|
|
argstr(arg->narg.text, &argbackq, flag, &exparg);
|
1994-05-26 06:18:55 +00:00
|
|
|
if (arglist == NULL) {
|
2011-06-09 23:12:23 +00:00
|
|
|
STACKSTRNUL(expdest);
|
1994-05-26 06:18:55 +00:00
|
|
|
return; /* here document expanded */
|
|
|
|
}
|
2015-12-31 18:47:54 +00:00
|
|
|
if ((flag & EXP_SPLIT) == 0 || expdest != stackblock() ||
|
2015-12-31 17:51:15 +00:00
|
|
|
exparg.state == WORD_QUOTEMARK) {
|
|
|
|
STPUTC('\0', expdest);
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_SPLIT) {
|
|
|
|
if (flag & EXP_GLOB)
|
|
|
|
expandmeta(grabstackstr(expdest), exparg.list);
|
|
|
|
else
|
|
|
|
appendarglist(exparg.list, grabstackstr(expdest));
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2015-12-31 18:47:54 +00:00
|
|
|
if ((flag & EXP_SPLIT) == 0)
|
2015-12-31 17:51:15 +00:00
|
|
|
appendarglist(arglist, grabstackstr(expdest));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2010-09-05 21:12:48 +00:00
|
|
|
* Perform parameter expansion, command substitution and arithmetic
|
|
|
|
* expansion, and tilde expansion if requested via EXP_TILDE/EXP_VARTILDE.
|
2014-03-02 22:59:34 +00:00
|
|
|
* Processing ends at a CTLENDVAR or CTLENDARI character as well as '\0'.
|
2010-09-05 21:12:48 +00:00
|
|
|
* This is used to expand word in ${var+word} etc.
|
2015-12-31 18:47:54 +00:00
|
|
|
* If EXP_GLOB or EXP_CASE are set, keep and/or generate CTLESC
|
2010-09-05 21:12:48 +00:00
|
|
|
* characters to allow for further processing.
|
2015-12-31 17:51:15 +00:00
|
|
|
*
|
2015-12-31 18:47:54 +00:00
|
|
|
* If EXP_SPLIT is set, dst receives any complete words produced.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
2016-01-24 22:26:25 +00:00
|
|
|
static const char *
|
2017-03-16 21:53:55 +00:00
|
|
|
argstr(const char *p, struct nodelist **restrict argbackq, int flag,
|
|
|
|
struct worddest *dst)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1997-04-28 03:28:43 +00:00
|
|
|
char c;
|
2015-12-31 18:47:54 +00:00
|
|
|
int quotes = flag & (EXP_GLOB | EXP_CASE); /* do CTLESC */
|
1994-05-26 06:18:55 +00:00
|
|
|
int firsteq = 1;
|
2010-10-29 13:42:18 +00:00
|
|
|
int split_lit;
|
|
|
|
int lit_quoted;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2010-10-29 13:42:18 +00:00
|
|
|
split_lit = flag & EXP_SPLIT_LIT;
|
|
|
|
lit_quoted = flag & EXP_LIT_QUOTED;
|
|
|
|
flag &= ~(EXP_SPLIT_LIT | EXP_LIT_QUOTED);
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*p == '~' && (flag & (EXP_TILDE | EXP_VARTILDE)))
|
|
|
|
p = exptilde(p, flag);
|
|
|
|
for (;;) {
|
2010-11-23 22:17:39 +00:00
|
|
|
CHECKSTRSPACE(2, expdest);
|
1994-05-26 06:18:55 +00:00
|
|
|
switch (c = *p++) {
|
|
|
|
case '\0':
|
2014-03-04 22:30:38 +00:00
|
|
|
return (p - 1);
|
2010-09-05 21:12:48 +00:00
|
|
|
case CTLENDVAR:
|
2014-03-02 22:59:34 +00:00
|
|
|
case CTLENDARI:
|
2014-03-04 22:30:38 +00:00
|
|
|
return (p);
|
1998-09-06 21:13:09 +00:00
|
|
|
case CTLQUOTEMARK:
|
2010-10-29 13:42:18 +00:00
|
|
|
lit_quoted = 1;
|
1998-09-06 21:13:09 +00:00
|
|
|
/* "$@" syntax adherence hack */
|
2015-11-18 21:09:03 +00:00
|
|
|
if (p[0] == CTLVAR && (p[1] & VSQUOTE) != 0 &&
|
|
|
|
p[2] == '@' && p[3] == '=')
|
1998-09-06 21:13:09 +00:00
|
|
|
break;
|
2015-12-31 18:47:54 +00:00
|
|
|
if ((flag & EXP_SPLIT) != 0 && expdest == stackblock())
|
2015-12-31 17:51:15 +00:00
|
|
|
dst->state = WORD_QUOTEMARK;
|
1998-09-06 21:13:09 +00:00
|
|
|
break;
|
2010-10-29 13:42:18 +00:00
|
|
|
case CTLQUOTEEND:
|
|
|
|
lit_quoted = 0;
|
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case CTLESC:
|
|
|
|
c = *p++;
|
2015-12-31 17:51:15 +00:00
|
|
|
if (split_lit && !lit_quoted &&
|
|
|
|
strchr(ifsset() ? ifsval() : " \t\n", c) != NULL) {
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD(c, flag, expdest, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (quotes)
|
|
|
|
USTPUTC(CTLESC, expdest);
|
2010-11-23 22:17:39 +00:00
|
|
|
USTPUTC(c, expdest);
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case CTLVAR:
|
2017-03-16 21:53:55 +00:00
|
|
|
p = evalvar(p, argbackq, flag, dst);
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case CTLBACKQ:
|
|
|
|
case CTLBACKQ|CTLQUOTE:
|
2017-03-16 21:53:55 +00:00
|
|
|
expbackq((*argbackq)->n, c & CTLQUOTE, flag, dst);
|
|
|
|
*argbackq = (*argbackq)->next;
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
2014-03-02 22:59:34 +00:00
|
|
|
case CTLARI:
|
2017-03-16 21:53:55 +00:00
|
|
|
p = expari(p, argbackq, flag, dst);
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case ':':
|
|
|
|
case '=':
|
|
|
|
/*
|
|
|
|
* sort of a hack - expand tildes in variable
|
|
|
|
* assignments (after the first '=' and after ':'s).
|
|
|
|
*/
|
2015-12-31 17:51:15 +00:00
|
|
|
if (split_lit && !lit_quoted &&
|
|
|
|
strchr(ifsset() ? ifsval() : " \t\n", c) != NULL) {
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD(c, flag, expdest, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-11-23 22:17:39 +00:00
|
|
|
USTPUTC(c, expdest);
|
2010-10-29 13:42:18 +00:00
|
|
|
if (flag & EXP_VARTILDE && *p == '~' &&
|
|
|
|
(c != '=' || firsteq)) {
|
|
|
|
if (c == '=')
|
|
|
|
firsteq = 0;
|
1994-05-26 06:18:55 +00:00
|
|
|
p = exptilde(p, flag);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
2015-12-31 17:51:15 +00:00
|
|
|
if (split_lit && !lit_quoted &&
|
|
|
|
strchr(ifsset() ? ifsval() : " \t\n", c) != NULL) {
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD(c, flag, expdest, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-11-23 22:17:39 +00:00
|
|
|
USTPUTC(c, expdest);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-09-05 21:12:48 +00:00
|
|
|
/*
|
|
|
|
* Perform tilde expansion, placing the result in the stack string and
|
|
|
|
* returning the next position in the input string to process.
|
|
|
|
*/
|
2016-01-24 22:26:25 +00:00
|
|
|
static const char *
|
|
|
|
exptilde(const char *p, int flag)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
2016-01-24 22:26:25 +00:00
|
|
|
char c;
|
|
|
|
const char *startp = p;
|
|
|
|
const char *user;
|
1994-05-26 06:18:55 +00:00
|
|
|
struct passwd *pw;
|
|
|
|
char *home;
|
2016-01-24 22:26:25 +00:00
|
|
|
int len;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-02-15 22:38:00 +00:00
|
|
|
for (;;) {
|
|
|
|
c = *p;
|
1994-05-26 06:18:55 +00:00
|
|
|
switch(c) {
|
2009-12-25 15:29:18 +00:00
|
|
|
case CTLESC: /* This means CTL* are always considered quoted. */
|
|
|
|
case CTLVAR:
|
|
|
|
case CTLBACKQ:
|
|
|
|
case CTLBACKQ | CTLQUOTE:
|
|
|
|
case CTLARI:
|
|
|
|
case CTLENDARI:
|
1998-09-13 19:24:57 +00:00
|
|
|
case CTLQUOTEMARK:
|
|
|
|
return (startp);
|
1994-05-26 06:18:55 +00:00
|
|
|
case ':':
|
2015-02-15 22:38:00 +00:00
|
|
|
if ((flag & EXP_VARTILDE) == 0)
|
|
|
|
break;
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
case '\0':
|
1994-05-26 06:18:55 +00:00
|
|
|
case '/':
|
2010-04-03 22:04:44 +00:00
|
|
|
case CTLENDVAR:
|
2016-01-24 22:26:25 +00:00
|
|
|
len = p - startp - 1;
|
|
|
|
STPUTBIN(startp + 1, len, expdest);
|
|
|
|
STACKSTRNUL(expdest);
|
|
|
|
user = expdest - len;
|
|
|
|
if (*user == '\0') {
|
2015-02-15 22:38:00 +00:00
|
|
|
home = lookupvar("HOME");
|
|
|
|
} else {
|
2016-01-24 22:26:25 +00:00
|
|
|
pw = getpwnam(user);
|
2015-02-15 22:38:00 +00:00
|
|
|
home = pw != NULL ? pw->pw_dir : NULL;
|
|
|
|
}
|
2016-01-24 22:26:25 +00:00
|
|
|
STADJUST(-len, expdest);
|
2015-02-15 22:38:00 +00:00
|
|
|
if (home == NULL || *home == '\0')
|
|
|
|
return (startp);
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(home, flag, VSNORMAL, 1, NULL);
|
2015-02-15 22:38:00 +00:00
|
|
|
return (p);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2014-03-02 22:59:34 +00:00
|
|
|
* Expand arithmetic expression.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
2016-01-24 22:26:25 +00:00
|
|
|
static const char *
|
2017-03-16 21:53:55 +00:00
|
|
|
expari(const char *p, struct nodelist **restrict argbackq, int flag,
|
|
|
|
struct worddest *dst)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
2014-03-02 22:59:34 +00:00
|
|
|
char *q, *start;
|
2008-04-28 07:26:34 +00:00
|
|
|
arith_t result;
|
1998-09-06 21:13:09 +00:00
|
|
|
int begoff;
|
|
|
|
int quoted;
|
2014-03-02 22:59:34 +00:00
|
|
|
int adj;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2014-03-02 22:59:34 +00:00
|
|
|
quoted = *p++ == '"';
|
|
|
|
begoff = expdest - stackblock();
|
2017-03-16 21:53:55 +00:00
|
|
|
p = argstr(p, argbackq, 0, NULL);
|
2014-03-02 22:59:34 +00:00
|
|
|
STPUTC('\0', expdest);
|
|
|
|
start = stackblock() + begoff;
|
|
|
|
|
2010-04-25 20:43:19 +00:00
|
|
|
q = grabstackstr(expdest);
|
2014-03-02 22:59:34 +00:00
|
|
|
result = arith(start);
|
2010-04-25 20:43:19 +00:00
|
|
|
ungrabstackstr(q, expdest);
|
2014-03-02 22:59:34 +00:00
|
|
|
|
|
|
|
start = stackblock() + begoff;
|
|
|
|
adj = start - expdest;
|
|
|
|
STADJUST(adj, expdest);
|
|
|
|
|
|
|
|
CHECKSTRSPACE((int)(DIGITS(result) + 1), expdest);
|
|
|
|
fmtstr(expdest, DIGITS(result), ARITH_FORMAT_STR, result);
|
|
|
|
adj = strlen(expdest);
|
|
|
|
STADJUST(adj, expdest);
|
2017-05-14 13:14:19 +00:00
|
|
|
/*
|
|
|
|
* If this is quoted, a '-' must not indicate a range in [...].
|
|
|
|
* If this is not quoted, splitting may occur.
|
|
|
|
*/
|
|
|
|
if (quoted ?
|
|
|
|
result < 0 && begoff > 1 && flag & (EXP_GLOB | EXP_CASE) :
|
|
|
|
flag & EXP_SPLIT)
|
|
|
|
reprocess(expdest - adj - stackblock(), flag, VSNORMAL, quoted,
|
|
|
|
dst);
|
2014-03-02 22:59:34 +00:00
|
|
|
return p;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2010-09-05 21:12:48 +00:00
|
|
|
* Perform command substitution.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
2010-10-13 22:18:03 +00:00
|
|
|
static void
|
2015-12-31 17:51:15 +00:00
|
|
|
expbackq(union node *cmd, int quoted, int flag, struct worddest *dst)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
struct backcmd in;
|
|
|
|
int i;
|
|
|
|
char buf[128];
|
|
|
|
char *p;
|
|
|
|
char *dest = expdest;
|
|
|
|
char lastc;
|
|
|
|
char const *syntax = quoted? DQSYNTAX : BASESYNTAX;
|
2015-12-31 18:47:54 +00:00
|
|
|
int quotes = flag & (EXP_GLOB | EXP_CASE);
|
2013-04-01 17:18:22 +00:00
|
|
|
size_t nnl;
|
2015-12-31 17:51:15 +00:00
|
|
|
const char *ifs;
|
2017-04-28 16:16:22 +00:00
|
|
|
int startloc;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
INTOFF;
|
|
|
|
p = grabstackstr(dest);
|
|
|
|
evalbackcmd(cmd, &in);
|
|
|
|
ungrabstackstr(p, dest);
|
|
|
|
|
|
|
|
p = in.buf;
|
2017-04-28 16:16:22 +00:00
|
|
|
startloc = dest - stackblock();
|
2003-05-31 06:27:57 +00:00
|
|
|
nnl = 0;
|
2015-12-31 18:47:54 +00:00
|
|
|
if (!quoted && flag & EXP_SPLIT)
|
2015-12-31 17:51:15 +00:00
|
|
|
ifs = ifsset() ? ifsval() : " \t\n";
|
|
|
|
else
|
|
|
|
ifs = "";
|
2017-05-06 13:28:42 +00:00
|
|
|
/* Remove trailing newlines */
|
1994-05-26 06:18:55 +00:00
|
|
|
for (;;) {
|
|
|
|
if (--in.nleft < 0) {
|
|
|
|
if (in.fd < 0)
|
|
|
|
break;
|
2016-07-31 13:11:34 +00:00
|
|
|
while ((i = read(in.fd, buf, sizeof buf)) < 0 && errno == EINTR)
|
|
|
|
;
|
1994-05-26 06:18:55 +00:00
|
|
|
TRACE(("expbackq: read returns %d\n", i));
|
|
|
|
if (i <= 0)
|
|
|
|
break;
|
|
|
|
p = buf;
|
|
|
|
in.nleft = i - 1;
|
|
|
|
}
|
|
|
|
lastc = *p++;
|
2015-12-31 17:51:15 +00:00
|
|
|
if (lastc == '\0')
|
|
|
|
continue;
|
2017-04-28 16:16:22 +00:00
|
|
|
if (nnl > 0 && lastc != '\n') {
|
|
|
|
NEXTWORD('\n', flag, dest, dst);
|
|
|
|
nnl = 0;
|
|
|
|
}
|
|
|
|
if (strchr(ifs, lastc) != NULL) {
|
|
|
|
if (lastc == '\n')
|
|
|
|
nnl++;
|
|
|
|
else
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD(lastc, flag, dest, dst);
|
2017-04-28 16:16:22 +00:00
|
|
|
} else {
|
|
|
|
CHECKSTRSPACE(2, dest);
|
|
|
|
if (quotes && syntax[(int)lastc] == CCTL)
|
|
|
|
USTPUTC(CTLESC, dest);
|
|
|
|
USTPUTC(lastc, dest);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
2017-04-28 16:16:22 +00:00
|
|
|
while (dest > stackblock() + startloc && STTOPC(dest) == '\n')
|
|
|
|
STUNPUTC(dest);
|
1996-09-01 10:22:36 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
if (in.fd >= 0)
|
|
|
|
close(in.fd);
|
|
|
|
if (in.buf)
|
|
|
|
ckfree(in.buf);
|
2017-03-04 22:58:34 +00:00
|
|
|
if (in.jp) {
|
|
|
|
p = grabstackstr(dest);
|
1999-04-21 11:52:39 +00:00
|
|
|
exitstatus = waitforjob(in.jp, (int *)NULL);
|
2017-03-04 22:58:34 +00:00
|
|
|
ungrabstackstr(p, dest);
|
|
|
|
}
|
2017-03-19 21:18:53 +00:00
|
|
|
TRACE(("expbackq: done\n"));
|
1994-05-26 06:18:55 +00:00
|
|
|
expdest = dest;
|
|
|
|
INTON;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-02-15 22:38:00 +00:00
|
|
|
static void
|
|
|
|
recordleft(const char *str, const char *loc, char *startp)
|
|
|
|
{
|
|
|
|
int amount;
|
|
|
|
|
|
|
|
amount = ((str - 1) - (loc - startp)) - expdest;
|
|
|
|
STADJUST(amount, expdest);
|
|
|
|
while (loc != str - 1)
|
|
|
|
*startp++ = *loc++;
|
|
|
|
}
|
|
|
|
|
2017-04-02 13:29:27 +00:00
|
|
|
static const char *
|
|
|
|
subevalvar_trim(const char *p, struct nodelist **restrict argbackq, int strloc,
|
2017-03-16 21:53:55 +00:00
|
|
|
int subtype, int startloc)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
|
|
|
char *startp;
|
|
|
|
char *loc = NULL;
|
2015-12-29 20:51:29 +00:00
|
|
|
char *str;
|
1996-09-01 10:22:36 +00:00
|
|
|
int c = 0;
|
1996-12-14 06:20:03 +00:00
|
|
|
int amount;
|
|
|
|
|
2017-04-02 13:29:27 +00:00
|
|
|
p = argstr(p, argbackq, EXP_CASE | EXP_TILDE, NULL);
|
1996-09-01 10:22:36 +00:00
|
|
|
STACKSTRNUL(expdest);
|
|
|
|
startp = stackblock() + startloc;
|
2015-12-29 20:51:29 +00:00
|
|
|
str = stackblock() + strloc;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
switch (subtype) {
|
|
|
|
case VSTRIMLEFT:
|
1997-04-28 03:28:43 +00:00
|
|
|
for (loc = startp; loc < str; loc++) {
|
1996-09-01 10:22:36 +00:00
|
|
|
c = *loc;
|
|
|
|
*loc = '\0';
|
2015-12-31 17:51:15 +00:00
|
|
|
if (patmatch(str, startp)) {
|
1996-09-01 10:22:36 +00:00
|
|
|
*loc = c;
|
2015-02-15 22:38:00 +00:00
|
|
|
recordleft(str, loc, startp);
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
|
|
|
*loc = c;
|
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSTRIMLEFTMAX:
|
1999-04-09 15:23:48 +00:00
|
|
|
for (loc = str - 1; loc >= startp;) {
|
1996-09-01 10:22:36 +00:00
|
|
|
c = *loc;
|
|
|
|
*loc = '\0';
|
2015-12-31 17:51:15 +00:00
|
|
|
if (patmatch(str, startp)) {
|
1996-09-01 10:22:36 +00:00
|
|
|
*loc = c;
|
2015-02-15 22:38:00 +00:00
|
|
|
recordleft(str, loc, startp);
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
|
|
|
*loc = c;
|
1999-04-09 15:23:48 +00:00
|
|
|
loc--;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSTRIMRIGHT:
|
1999-04-09 15:23:48 +00:00
|
|
|
for (loc = str - 1; loc >= startp;) {
|
2015-12-31 17:51:15 +00:00
|
|
|
if (patmatch(str, loc)) {
|
1996-12-14 06:20:03 +00:00
|
|
|
amount = loc - expdest;
|
|
|
|
STADJUST(amount, expdest);
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
1999-04-09 15:23:48 +00:00
|
|
|
loc--;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSTRIMRIGHTMAX:
|
|
|
|
for (loc = startp; loc < str - 1; loc++) {
|
2015-12-31 17:51:15 +00:00
|
|
|
if (patmatch(str, loc)) {
|
1996-12-14 06:20:03 +00:00
|
|
|
amount = loc - expdest;
|
|
|
|
STADJUST(amount, expdest);
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
abort();
|
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
amount = (expdest - stackblock() - strloc) + 1;
|
|
|
|
STADJUST(-amount, expdest);
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-04-02 13:43:45 +00:00
|
|
|
static const char *
|
|
|
|
subevalvar_misc(const char *p, struct nodelist **restrict argbackq,
|
|
|
|
const char *var, int subtype, int startloc, int varflags)
|
2015-12-29 20:51:29 +00:00
|
|
|
{
|
2018-11-28 20:03:53 +00:00
|
|
|
const char *end;
|
2015-12-29 20:51:29 +00:00
|
|
|
char *startp;
|
|
|
|
int amount;
|
|
|
|
|
2018-11-28 20:03:53 +00:00
|
|
|
end = argstr(p, argbackq, EXP_TILDE, NULL);
|
2015-12-29 20:51:29 +00:00
|
|
|
STACKSTRNUL(expdest);
|
|
|
|
startp = stackblock() + startloc;
|
|
|
|
|
|
|
|
switch (subtype) {
|
|
|
|
case VSASSIGN:
|
|
|
|
setvar(var, startp, 0);
|
|
|
|
amount = startp - expdest;
|
|
|
|
STADJUST(amount, expdest);
|
2018-11-28 20:03:53 +00:00
|
|
|
return end;
|
2015-12-29 20:51:29 +00:00
|
|
|
|
|
|
|
case VSQUESTION:
|
|
|
|
if (*p != CTLENDVAR) {
|
|
|
|
outfmt(out2, "%s\n", startp);
|
|
|
|
error((char *)NULL);
|
|
|
|
}
|
|
|
|
error("%.*s: parameter %snot set", (int)(p - var - 1),
|
|
|
|
var, (varflags & VSNUL) ? "null or " : "");
|
|
|
|
|
|
|
|
default:
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* Expand a variable, and return a pointer to the next character in the
|
|
|
|
* input string.
|
|
|
|
*/
|
|
|
|
|
2016-01-24 22:26:25 +00:00
|
|
|
static const char *
|
2017-03-16 21:53:55 +00:00
|
|
|
evalvar(const char *p, struct nodelist **restrict argbackq, int flag,
|
|
|
|
struct worddest *dst)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
int subtype;
|
|
|
|
int varflags;
|
2016-01-24 22:26:25 +00:00
|
|
|
const char *var;
|
2014-03-14 21:45:37 +00:00
|
|
|
const char *val;
|
1999-04-13 04:13:09 +00:00
|
|
|
int patloc;
|
1994-05-26 06:18:55 +00:00
|
|
|
int c;
|
|
|
|
int set;
|
|
|
|
int special;
|
|
|
|
int startloc;
|
1996-09-01 10:22:36 +00:00
|
|
|
int varlen;
|
2011-05-07 14:32:16 +00:00
|
|
|
int varlenb;
|
2015-12-31 17:51:15 +00:00
|
|
|
char buf[21];
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2006-11-07 22:46:13 +00:00
|
|
|
varflags = (unsigned char)*p++;
|
1994-05-26 06:18:55 +00:00
|
|
|
subtype = varflags & VSTYPE;
|
|
|
|
var = p;
|
|
|
|
special = 0;
|
|
|
|
if (! is_name(*p))
|
|
|
|
special = 1;
|
|
|
|
p = strchr(p, '=') + 1;
|
2008-05-15 19:55:27 +00:00
|
|
|
if (varflags & VSLINENO) {
|
|
|
|
set = 1;
|
2014-02-27 16:54:43 +00:00
|
|
|
special = 1;
|
|
|
|
val = NULL;
|
2008-05-15 19:55:27 +00:00
|
|
|
} else if (special) {
|
1997-04-28 03:28:43 +00:00
|
|
|
set = varisset(var, varflags & VSNUL);
|
1994-05-26 06:18:55 +00:00
|
|
|
val = NULL;
|
|
|
|
} else {
|
2000-05-15 12:33:17 +00:00
|
|
|
val = bltinlookup(var, 1);
|
1996-09-01 10:22:36 +00:00
|
|
|
if (val == NULL || ((varflags & VSNUL) && val[0] == '\0')) {
|
1994-05-26 06:18:55 +00:00
|
|
|
val = NULL;
|
|
|
|
set = 0;
|
|
|
|
} else
|
|
|
|
set = 1;
|
|
|
|
}
|
1996-09-01 10:22:36 +00:00
|
|
|
varlen = 0;
|
1994-05-26 06:18:55 +00:00
|
|
|
startloc = expdest - stackblock();
|
2009-10-24 21:20:04 +00:00
|
|
|
if (!set && uflag && *var != '@' && *var != '*') {
|
2002-05-19 08:30:16 +00:00
|
|
|
switch (subtype) {
|
|
|
|
case VSNORMAL:
|
|
|
|
case VSTRIMLEFT:
|
|
|
|
case VSTRIMLEFTMAX:
|
|
|
|
case VSTRIMRIGHT:
|
|
|
|
case VSTRIMRIGHTMAX:
|
|
|
|
case VSLENGTH:
|
2003-03-15 07:56:59 +00:00
|
|
|
error("%.*s: parameter not set", (int)(p - var - 1),
|
|
|
|
var);
|
2002-05-19 08:30:16 +00:00
|
|
|
}
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
if (set && subtype != VSPLUS) {
|
|
|
|
/* insert the value of the variable */
|
|
|
|
if (special) {
|
2015-12-31 17:51:15 +00:00
|
|
|
if (varflags & VSLINENO) {
|
|
|
|
if (p - var > (ptrdiff_t)sizeof(buf))
|
|
|
|
abort();
|
|
|
|
memcpy(buf, var, p - var - 1);
|
|
|
|
buf[p - var - 1] = '\0';
|
|
|
|
strtodest(buf, flag, subtype,
|
|
|
|
varflags & VSQUOTE, dst);
|
|
|
|
} else
|
|
|
|
varvalue(var, varflags & VSQUOTE, subtype, flag,
|
|
|
|
dst);
|
1996-09-01 10:22:36 +00:00
|
|
|
if (subtype == VSLENGTH) {
|
2011-05-07 14:32:16 +00:00
|
|
|
varlenb = expdest - stackblock() - startloc;
|
|
|
|
varlen = varlenb;
|
|
|
|
if (localeisutf8) {
|
|
|
|
val = stackblock() + startloc;
|
|
|
|
for (;val != expdest; val++)
|
|
|
|
if ((*val & 0xC0) == 0x80)
|
|
|
|
varlen--;
|
|
|
|
}
|
|
|
|
STADJUST(-varlenb, expdest);
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
} else {
|
1996-09-01 10:22:36 +00:00
|
|
|
if (subtype == VSLENGTH) {
|
|
|
|
for (;*val; val++)
|
2011-05-07 14:32:16 +00:00
|
|
|
if (!localeisutf8 ||
|
|
|
|
(*val & 0xC0) != 0x80)
|
|
|
|
varlen++;
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
2015-02-15 22:38:00 +00:00
|
|
|
else
|
|
|
|
strtodest(val, flag, subtype,
|
2015-12-31 17:51:15 +00:00
|
|
|
varflags & VSQUOTE, dst);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
1996-12-14 06:20:03 +00:00
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
if (subtype == VSPLUS)
|
|
|
|
set = ! set;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
switch (subtype) {
|
|
|
|
case VSLENGTH:
|
2015-12-31 17:51:15 +00:00
|
|
|
cvtnum(varlen, buf);
|
|
|
|
strtodest(buf, flag, VSNORMAL, varflags & VSQUOTE, dst);
|
2015-02-15 22:38:00 +00:00
|
|
|
break;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSNORMAL:
|
2017-04-02 12:37:43 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSPLUS:
|
|
|
|
case VSMINUS:
|
|
|
|
if (!set) {
|
2017-04-02 12:37:43 +00:00
|
|
|
return argstr(p, argbackq,
|
2017-03-16 21:53:55 +00:00
|
|
|
flag | (flag & EXP_SPLIT ? EXP_SPLIT_LIT : 0) |
|
2015-12-31 17:51:15 +00:00
|
|
|
(varflags & VSQUOTE ? EXP_LIT_QUOTED : 0), dst);
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case VSTRIMLEFT:
|
|
|
|
case VSTRIMLEFTMAX:
|
|
|
|
case VSTRIMRIGHT:
|
|
|
|
case VSTRIMRIGHTMAX:
|
2017-04-02 12:37:43 +00:00
|
|
|
if (!set)
|
1996-09-01 10:22:36 +00:00
|
|
|
break;
|
|
|
|
/*
|
|
|
|
* Terminate the string and start recording the pattern
|
|
|
|
* right after it
|
|
|
|
*/
|
|
|
|
STPUTC('\0', expdest);
|
1999-04-13 04:13:09 +00:00
|
|
|
patloc = expdest - stackblock();
|
2017-04-02 13:29:27 +00:00
|
|
|
p = subevalvar_trim(p, argbackq, patloc, subtype, startloc);
|
2015-12-31 17:51:15 +00:00
|
|
|
reprocess(startloc, flag, VSNORMAL, varflags & VSQUOTE, dst);
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_SPLIT && *var == '@' && varflags & VSQUOTE)
|
2015-12-31 17:51:15 +00:00
|
|
|
dst->state = WORD_QUOTEMARK;
|
2017-04-02 13:29:27 +00:00
|
|
|
return p;
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
case VSASSIGN:
|
|
|
|
case VSQUESTION:
|
|
|
|
if (!set) {
|
2017-04-02 13:43:45 +00:00
|
|
|
p = subevalvar_misc(p, argbackq, var, subtype,
|
2017-03-18 16:09:30 +00:00
|
|
|
startloc, varflags);
|
|
|
|
/* assert(subtype == VSASSIGN); */
|
2017-04-02 13:43:45 +00:00
|
|
|
val = lookupvar(var);
|
|
|
|
strtodest(val, flag, subtype, varflags & VSQUOTE, dst);
|
|
|
|
return p;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
1996-09-01 10:22:36 +00:00
|
|
|
break;
|
|
|
|
|
2006-11-05 18:36:05 +00:00
|
|
|
case VSERROR:
|
|
|
|
c = p - var - 1;
|
|
|
|
error("${%.*s%s}: Bad substitution", c, var,
|
|
|
|
(c > 0 && *p != CTLENDVAR) ? "..." : "");
|
|
|
|
|
1996-09-01 10:22:36 +00:00
|
|
|
default:
|
|
|
|
abort();
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
1996-09-01 10:22:36 +00:00
|
|
|
|
2017-04-02 12:37:43 +00:00
|
|
|
{ /* skip to end of alternative */
|
1994-05-26 06:18:55 +00:00
|
|
|
int nesting = 1;
|
|
|
|
for (;;) {
|
|
|
|
if ((c = *p++) == CTLESC)
|
|
|
|
p++;
|
2017-04-02 12:37:43 +00:00
|
|
|
else if (c == CTLBACKQ || c == (CTLBACKQ|CTLQUOTE))
|
|
|
|
*argbackq = (*argbackq)->next;
|
|
|
|
else if (c == CTLVAR) {
|
1994-05-26 06:18:55 +00:00
|
|
|
if ((*p++ & VSTYPE) != VSNORMAL)
|
|
|
|
nesting++;
|
|
|
|
} else if (c == CTLENDVAR) {
|
|
|
|
if (--nesting == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2017-05-06 13:28:42 +00:00
|
|
|
* Test whether a special or positional parameter is set.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
|
2010-10-13 22:18:03 +00:00
|
|
|
static int
|
2014-03-14 21:45:37 +00:00
|
|
|
varisset(const char *name, int nulok)
|
1997-04-28 03:28:43 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
|
1997-04-28 03:28:43 +00:00
|
|
|
if (*name == '!')
|
2010-06-29 22:37:45 +00:00
|
|
|
return backgndpidset();
|
1997-04-28 03:28:43 +00:00
|
|
|
else if (*name == '@' || *name == '*') {
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*shellparam.p == NULL)
|
|
|
|
return 0;
|
1997-04-28 03:28:43 +00:00
|
|
|
|
|
|
|
if (nulok) {
|
|
|
|
char **av;
|
|
|
|
|
|
|
|
for (av = shellparam.p; *av; av++)
|
|
|
|
if (**av != '\0')
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
1996-09-10 02:42:33 +00:00
|
|
|
} else if (is_digit(*name)) {
|
1997-04-28 03:28:43 +00:00
|
|
|
char *ap;
|
2014-07-12 21:54:11 +00:00
|
|
|
long num;
|
1997-04-28 03:28:43 +00:00
|
|
|
|
2014-07-12 21:54:11 +00:00
|
|
|
errno = 0;
|
|
|
|
num = strtol(name, NULL, 10);
|
|
|
|
if (errno != 0 || num > shellparam.nparam)
|
1997-04-28 03:28:43 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (num == 0)
|
|
|
|
ap = arg0;
|
|
|
|
else
|
|
|
|
ap = shellparam.p[num - 1];
|
|
|
|
|
|
|
|
if (nulok && (ap == NULL || *ap == '\0'))
|
|
|
|
return 0;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2010-12-11 22:13:29 +00:00
|
|
|
static void
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(const char *p, int flag, int subtype, int quoted,
|
|
|
|
struct worddest *dst)
|
2010-12-11 22:13:29 +00:00
|
|
|
{
|
2015-12-31 17:51:15 +00:00
|
|
|
if (subtype == VSLENGTH || subtype == VSTRIMLEFT ||
|
|
|
|
subtype == VSTRIMLEFTMAX || subtype == VSTRIMRIGHT ||
|
|
|
|
subtype == VSTRIMRIGHTMAX)
|
|
|
|
STPUTS(p, expdest);
|
2015-12-31 18:47:54 +00:00
|
|
|
else if (flag & EXP_SPLIT && !quoted && dst != NULL)
|
|
|
|
STPUTS_SPLIT(p, BASESYNTAX, flag, expdest, dst);
|
|
|
|
else if (flag & (EXP_GLOB | EXP_CASE))
|
2010-12-11 22:13:29 +00:00
|
|
|
STPUTS_QUOTES(p, quoted ? DQSYNTAX : BASESYNTAX, expdest);
|
|
|
|
else
|
|
|
|
STPUTS(p, expdest);
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
static void
|
|
|
|
reprocess(int startloc, int flag, int subtype, int quoted,
|
|
|
|
struct worddest *dst)
|
|
|
|
{
|
|
|
|
static char *buf = NULL;
|
|
|
|
static size_t buflen = 0;
|
|
|
|
char *startp;
|
|
|
|
size_t len, zpos, zlen;
|
|
|
|
|
|
|
|
startp = stackblock() + startloc;
|
|
|
|
len = expdest - startp;
|
2018-09-05 19:16:09 +00:00
|
|
|
if (len >= SIZE_MAX / 2 || len > PTRDIFF_MAX)
|
2015-12-31 17:51:15 +00:00
|
|
|
abort();
|
|
|
|
INTOFF;
|
|
|
|
if (len >= buflen) {
|
|
|
|
ckfree(buf);
|
|
|
|
buf = NULL;
|
|
|
|
}
|
|
|
|
if (buflen < 128)
|
|
|
|
buflen = 128;
|
|
|
|
while (len >= buflen)
|
|
|
|
buflen <<= 1;
|
|
|
|
if (buf == NULL)
|
|
|
|
buf = ckmalloc(buflen);
|
|
|
|
INTON;
|
|
|
|
memcpy(buf, startp, len);
|
|
|
|
buf[len] = '\0';
|
2018-09-05 19:16:09 +00:00
|
|
|
STADJUST(-(ptrdiff_t)len, expdest);
|
2015-12-31 17:51:15 +00:00
|
|
|
for (zpos = 0;;) {
|
|
|
|
zlen = strlen(buf + zpos);
|
|
|
|
strtodest(buf + zpos, flag, subtype, quoted, dst);
|
|
|
|
zpos += zlen + 1;
|
|
|
|
if (zpos == len + 1)
|
|
|
|
break;
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_SPLIT && (quoted || (zlen > 0 && zpos < len)))
|
|
|
|
NEXTWORD('\0', flag, expdest, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
2017-05-06 13:28:42 +00:00
|
|
|
* Add the value of a special or positional parameter to the stack string.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
|
2010-10-13 22:18:03 +00:00
|
|
|
static void
|
2015-12-31 17:51:15 +00:00
|
|
|
varvalue(const char *name, int quoted, int subtype, int flag,
|
|
|
|
struct worddest *dst)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
int num;
|
|
|
|
char *p;
|
|
|
|
int i;
|
2015-12-31 17:51:15 +00:00
|
|
|
int splitlater;
|
2014-10-28 22:14:31 +00:00
|
|
|
char sep[2];
|
1994-05-26 06:18:55 +00:00
|
|
|
char **ap;
|
2015-12-31 17:51:15 +00:00
|
|
|
char buf[(NSHORTOPTS > 10 ? NSHORTOPTS : 10) + 1];
|
|
|
|
|
|
|
|
if (subtype == VSLENGTH)
|
|
|
|
flag &= ~EXP_FULL;
|
|
|
|
splitlater = subtype == VSTRIMLEFT || subtype == VSTRIMLEFTMAX ||
|
|
|
|
subtype == VSTRIMRIGHT || subtype == VSTRIMRIGHTMAX;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
1996-09-10 02:42:33 +00:00
|
|
|
switch (*name) {
|
1994-05-26 06:18:55 +00:00
|
|
|
case '$':
|
|
|
|
num = rootpid;
|
2014-10-15 21:20:56 +00:00
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case '?':
|
1996-09-01 10:22:36 +00:00
|
|
|
num = oexitstatus;
|
2014-10-15 21:20:56 +00:00
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case '#':
|
|
|
|
num = shellparam.nparam;
|
2014-10-15 21:20:56 +00:00
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case '!':
|
2010-06-29 22:37:45 +00:00
|
|
|
num = backgndpidval();
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case '-':
|
2015-12-31 17:51:15 +00:00
|
|
|
p = buf;
|
2015-08-29 19:41:47 +00:00
|
|
|
for (i = 0 ; i < NSHORTOPTS ; i++) {
|
2016-01-07 23:13:20 +00:00
|
|
|
if (optval[i])
|
|
|
|
*p++ = optletter[i];
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
*p = '\0';
|
|
|
|
strtodest(buf, flag, subtype, quoted, dst);
|
2014-10-15 21:20:56 +00:00
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
case '@':
|
2015-12-31 18:47:54 +00:00
|
|
|
if (flag & EXP_SPLIT && quoted) {
|
1998-09-06 21:13:09 +00:00
|
|
|
for (ap = shellparam.p ; (p = *ap++) != NULL ; ) {
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(p, flag, subtype, quoted, dst);
|
|
|
|
if (*ap) {
|
|
|
|
if (splitlater)
|
|
|
|
STPUTC('\0', expdest);
|
|
|
|
else
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD('\0', flag, expdest,
|
|
|
|
dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
}
|
1998-09-06 21:13:09 +00:00
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
if (shellparam.nparam > 0)
|
|
|
|
dst->state = WORD_QUOTEMARK;
|
2014-10-15 21:20:56 +00:00
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2002-08-25 13:01:47 +00:00
|
|
|
/* FALLTHROUGH */
|
1994-05-26 06:18:55 +00:00
|
|
|
case '*':
|
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 (ifsset())
|
2014-10-28 22:14:31 +00:00
|
|
|
sep[0] = ifsval()[0];
|
1998-09-06 21:13:09 +00:00
|
|
|
else
|
2014-10-28 22:14:31 +00:00
|
|
|
sep[0] = ' ';
|
|
|
|
sep[1] = '\0';
|
1994-05-26 06:18:55 +00:00
|
|
|
for (ap = shellparam.p ; (p = *ap++) != NULL ; ) {
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(p, flag, subtype, quoted, dst);
|
2011-05-27 15:56:13 +00:00
|
|
|
if (!*ap)
|
|
|
|
break;
|
2014-10-28 22:14:31 +00:00
|
|
|
if (sep[0])
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(sep, flag, subtype, quoted, dst);
|
2015-12-31 18:47:54 +00:00
|
|
|
else if (flag & EXP_SPLIT && !quoted && **ap != '\0') {
|
2015-12-31 17:51:15 +00:00
|
|
|
if (splitlater)
|
|
|
|
STPUTC('\0', expdest);
|
|
|
|
else
|
2015-12-31 18:47:54 +00:00
|
|
|
NEXTWORD('\0', flag, expdest, dst);
|
2015-12-31 17:51:15 +00:00
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2014-10-15 21:20:56 +00:00
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
default:
|
1996-09-10 02:42:33 +00:00
|
|
|
if (is_digit(*name)) {
|
|
|
|
num = atoi(name);
|
2014-07-12 10:27:30 +00:00
|
|
|
if (num == 0)
|
|
|
|
p = arg0;
|
|
|
|
else if (num > 0 && num <= shellparam.nparam)
|
1996-09-10 02:42:33 +00:00
|
|
|
p = shellparam.p[num - 1];
|
2014-07-12 10:27:30 +00:00
|
|
|
else
|
2014-10-15 21:20:56 +00:00
|
|
|
return;
|
2015-12-31 17:51:15 +00:00
|
|
|
strtodest(p, flag, subtype, quoted, dst);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2014-10-15 21:20:56 +00:00
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2015-12-31 17:51:15 +00:00
|
|
|
cvtnum(num, buf);
|
|
|
|
strtodest(buf, flag, subtype, quoted, dst);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-10-13 04:01:01 +00:00
|
|
|
static char expdir[PATH_MAX];
|
2010-08-10 22:45:59 +00:00
|
|
|
#define expdir_end (expdir + sizeof(expdir))
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2010-09-05 21:12:48 +00:00
|
|
|
/*
|
|
|
|
* Perform pathname generation and remove control characters.
|
2015-12-31 20:15:57 +00:00
|
|
|
* At this point, the only control characters should be CTLESC.
|
2015-10-11 21:33:00 +00:00
|
|
|
* The results are stored in the list dstlist.
|
2010-09-05 21:12:48 +00:00
|
|
|
*/
|
2010-10-13 22:18:03 +00:00
|
|
|
static void
|
2015-12-31 18:47:54 +00:00
|
|
|
expandmeta(char *pattern, struct arglist *dstlist)
|
1996-09-01 10:22:36 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
char *p;
|
2015-10-11 21:33:00 +00:00
|
|
|
int firstmatch;
|
1994-05-26 06:18:55 +00:00
|
|
|
char c;
|
|
|
|
|
2015-12-31 18:56:11 +00:00
|
|
|
firstmatch = dstlist->count;
|
|
|
|
p = pattern;
|
|
|
|
for (; (c = *p) != '\0'; p++) {
|
|
|
|
/* fast check for meta chars */
|
|
|
|
if (c == '*' || c == '?' || c == '[') {
|
|
|
|
INTOFF;
|
|
|
|
expmeta(expdir, pattern, dstlist);
|
|
|
|
INTON;
|
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2015-12-31 18:56:11 +00:00
|
|
|
}
|
|
|
|
if (dstlist->count == firstmatch) {
|
|
|
|
/*
|
|
|
|
* no matches
|
|
|
|
*/
|
|
|
|
rmescapes(pattern);
|
|
|
|
appendarglist(dstlist, pattern);
|
|
|
|
} else {
|
|
|
|
qsort(&dstlist->args[firstmatch],
|
|
|
|
dstlist->count - firstmatch,
|
|
|
|
sizeof(dstlist->args[0]), expsortcmp);
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do metacharacter (i.e. *, ?, [...]) expansion.
|
|
|
|
*/
|
|
|
|
|
2010-10-13 22:18:03 +00:00
|
|
|
static void
|
2015-10-11 21:33:00 +00:00
|
|
|
expmeta(char *enddir, char *name, struct arglist *arglist)
|
2002-02-02 06:50:57 +00:00
|
|
|
{
|
2013-04-01 17:18:22 +00:00
|
|
|
const char *p;
|
|
|
|
const char *q;
|
|
|
|
const char *start;
|
1994-05-26 06:18:55 +00:00
|
|
|
char *endname;
|
|
|
|
int metaflag;
|
|
|
|
struct stat statb;
|
|
|
|
DIR *dirp;
|
|
|
|
struct dirent *dp;
|
|
|
|
int atend;
|
|
|
|
int matchdot;
|
2010-05-11 23:19:28 +00:00
|
|
|
int esc;
|
2011-12-28 23:30:17 +00:00
|
|
|
int namlen;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
metaflag = 0;
|
|
|
|
start = name;
|
2010-05-11 23:19:28 +00:00
|
|
|
for (p = name; esc = 0, *p; p += esc + 1) {
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*p == '*' || *p == '?')
|
|
|
|
metaflag = 1;
|
|
|
|
else if (*p == '[') {
|
|
|
|
q = p + 1;
|
1997-06-06 23:04:33 +00:00
|
|
|
if (*q == '!' || *q == '^')
|
1994-05-26 06:18:55 +00:00
|
|
|
q++;
|
|
|
|
for (;;) {
|
|
|
|
if (*q == CTLESC)
|
|
|
|
q++;
|
|
|
|
if (*q == '/' || *q == '\0')
|
|
|
|
break;
|
|
|
|
if (*++q == ']') {
|
|
|
|
metaflag = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (*p == '\0')
|
|
|
|
break;
|
2010-05-11 23:19:28 +00:00
|
|
|
else {
|
|
|
|
if (*p == CTLESC)
|
|
|
|
esc++;
|
|
|
|
if (p[esc] == '/') {
|
|
|
|
if (metaflag)
|
|
|
|
break;
|
|
|
|
start = p + esc + 1;
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (metaflag == 0) { /* we've reached the end of the file name */
|
|
|
|
if (enddir != expdir)
|
|
|
|
metaflag++;
|
|
|
|
for (p = name ; ; p++) {
|
|
|
|
if (*p == CTLESC)
|
|
|
|
p++;
|
|
|
|
*enddir++ = *p;
|
|
|
|
if (*p == '\0')
|
|
|
|
break;
|
2010-08-10 22:45:59 +00:00
|
|
|
if (enddir == expdir_end)
|
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
2005-07-07 18:10:33 +00:00
|
|
|
if (metaflag == 0 || lstat(expdir, &statb) >= 0)
|
2015-10-11 21:33:00 +00:00
|
|
|
appendarglist(arglist, stsavestr(expdir));
|
1994-05-26 06:18:55 +00:00
|
|
|
return;
|
|
|
|
}
|
2013-04-01 17:18:22 +00:00
|
|
|
endname = name + (p - name);
|
1994-05-26 06:18:55 +00:00
|
|
|
if (start != name) {
|
|
|
|
p = name;
|
|
|
|
while (p < start) {
|
|
|
|
if (*p == CTLESC)
|
|
|
|
p++;
|
|
|
|
*enddir++ = *p++;
|
2010-08-10 22:45:59 +00:00
|
|
|
if (enddir == expdir_end)
|
|
|
|
return;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (enddir == expdir) {
|
|
|
|
p = ".";
|
|
|
|
} else if (enddir == expdir + 1 && *expdir == '/') {
|
|
|
|
p = "/";
|
|
|
|
} else {
|
|
|
|
p = expdir;
|
|
|
|
enddir[-1] = '\0';
|
|
|
|
}
|
|
|
|
if ((dirp = opendir(p)) == NULL)
|
|
|
|
return;
|
|
|
|
if (enddir != expdir)
|
|
|
|
enddir[-1] = '/';
|
|
|
|
if (*endname == 0) {
|
|
|
|
atend = 1;
|
|
|
|
} else {
|
|
|
|
atend = 0;
|
2010-05-11 23:19:28 +00:00
|
|
|
*endname = '\0';
|
|
|
|
endname += esc + 1;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
matchdot = 0;
|
1998-09-06 21:13:09 +00:00
|
|
|
p = start;
|
|
|
|
if (*p == CTLESC)
|
|
|
|
p++;
|
|
|
|
if (*p == '.')
|
1994-05-26 06:18:55 +00:00
|
|
|
matchdot++;
|
|
|
|
while (! int_pending() && (dp = readdir(dirp)) != NULL) {
|
|
|
|
if (dp->d_name[0] == '.' && ! matchdot)
|
|
|
|
continue;
|
2015-12-31 17:51:15 +00:00
|
|
|
if (patmatch(start, dp->d_name)) {
|
2011-12-28 23:30:17 +00:00
|
|
|
namlen = dp->d_namlen;
|
|
|
|
if (enddir + namlen + 1 > expdir_end)
|
2010-08-10 22:45:59 +00:00
|
|
|
continue;
|
2011-12-28 23:30:17 +00:00
|
|
|
memcpy(enddir, dp->d_name, namlen + 1);
|
2010-08-10 22:45:59 +00:00
|
|
|
if (atend)
|
2015-10-11 21:33:00 +00:00
|
|
|
appendarglist(arglist, stsavestr(expdir));
|
2010-08-10 22:45:59 +00:00
|
|
|
else {
|
2011-12-28 23:40:46 +00:00
|
|
|
if (dp->d_type != DT_UNKNOWN &&
|
|
|
|
dp->d_type != DT_DIR &&
|
|
|
|
dp->d_type != DT_LNK)
|
|
|
|
continue;
|
2011-12-28 23:30:17 +00:00
|
|
|
if (enddir + namlen + 2 > expdir_end)
|
1996-09-01 10:22:36 +00:00
|
|
|
continue;
|
2011-12-28 23:30:17 +00:00
|
|
|
enddir[namlen] = '/';
|
|
|
|
enddir[namlen + 1] = '\0';
|
2015-10-11 21:33:00 +00:00
|
|
|
expmeta(enddir + namlen + 1, endname, arglist);
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
closedir(dirp);
|
|
|
|
if (! atend)
|
2010-05-11 23:19:28 +00:00
|
|
|
endname[-esc - 1] = esc ? CTLESC : '/';
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-10-11 21:33:00 +00:00
|
|
|
static int
|
|
|
|
expsortcmp(const void *p1, const void *p2)
|
2002-02-02 06:50:57 +00:00
|
|
|
{
|
2015-10-11 21:33:00 +00:00
|
|
|
const char *s1 = *(const char * const *)p1;
|
|
|
|
const char *s2 = *(const char * const *)p2;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2016-07-16 13:26:18 +00:00
|
|
|
return (strcoll(s1, s2));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2011-05-08 11:32:20 +00:00
|
|
|
static wchar_t
|
|
|
|
get_wc(const char **p)
|
|
|
|
{
|
|
|
|
wchar_t c;
|
|
|
|
int chrlen;
|
|
|
|
|
|
|
|
chrlen = mbtowc(&c, *p, 4);
|
|
|
|
if (chrlen == 0)
|
|
|
|
return 0;
|
|
|
|
else if (chrlen == -1)
|
|
|
|
c = 0;
|
|
|
|
else
|
|
|
|
*p += chrlen;
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-06-15 21:48:10 +00:00
|
|
|
/*
|
|
|
|
* See if a character matches a character class, starting at the first colon
|
|
|
|
* of "[:class:]".
|
|
|
|
* If a valid character class is recognized, a pointer to the next character
|
|
|
|
* after the final closing bracket is stored into *end, otherwise a null
|
|
|
|
* pointer is stored into *end.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
match_charclass(const char *p, wchar_t chr, const char **end)
|
|
|
|
{
|
|
|
|
char name[20];
|
|
|
|
const char *nameend;
|
|
|
|
wctype_t cclass;
|
|
|
|
|
|
|
|
*end = NULL;
|
|
|
|
p++;
|
|
|
|
nameend = strstr(p, ":]");
|
2013-04-01 17:18:22 +00:00
|
|
|
if (nameend == NULL || (size_t)(nameend - p) >= sizeof(name) ||
|
|
|
|
nameend == p)
|
2011-06-15 21:48:10 +00:00
|
|
|
return 0;
|
|
|
|
memcpy(name, p, nameend - p);
|
|
|
|
name[nameend - p] = '\0';
|
|
|
|
*end = nameend + 2;
|
|
|
|
cclass = wctype(name);
|
|
|
|
/* An unknown class matches nothing but is valid nevertheless. */
|
|
|
|
if (cclass == 0)
|
|
|
|
return 0;
|
|
|
|
return iswctype(chr, cclass);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* Returns true if the pattern matches the string.
|
|
|
|
*/
|
|
|
|
|
2012-01-01 22:17:12 +00:00
|
|
|
static int
|
2015-12-31 17:51:15 +00:00
|
|
|
patmatch(const char *pattern, const char *string)
|
2002-02-02 06:50:57 +00:00
|
|
|
{
|
2011-06-15 21:48:10 +00:00
|
|
|
const char *p, *q, *end;
|
2012-01-01 20:50:19 +00:00
|
|
|
const char *bt_p, *bt_q;
|
1997-04-28 03:28:43 +00:00
|
|
|
char c;
|
2011-05-08 11:32:20 +00:00
|
|
|
wchar_t wc, wc2;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
p = pattern;
|
|
|
|
q = string;
|
2012-01-01 20:50:19 +00:00
|
|
|
bt_p = NULL;
|
|
|
|
bt_q = NULL;
|
1994-05-26 06:18:55 +00:00
|
|
|
for (;;) {
|
|
|
|
switch (c = *p++) {
|
|
|
|
case '\0':
|
2012-01-01 20:50:19 +00:00
|
|
|
if (*q != '\0')
|
|
|
|
goto backtrack;
|
|
|
|
return 1;
|
1994-05-26 06:18:55 +00:00
|
|
|
case CTLESC:
|
|
|
|
if (*q++ != *p++)
|
2012-01-01 20:50:19 +00:00
|
|
|
goto backtrack;
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case '?':
|
2012-01-01 20:50:19 +00:00
|
|
|
if (*q == '\0')
|
|
|
|
return 0;
|
|
|
|
if (localeisutf8) {
|
2011-05-08 11:32:20 +00:00
|
|
|
wc = get_wc(&q);
|
2012-01-01 20:50:19 +00:00
|
|
|
/*
|
|
|
|
* A '?' does not match invalid UTF-8 but a
|
|
|
|
* '*' does, so backtrack.
|
|
|
|
*/
|
|
|
|
if (wc == 0)
|
|
|
|
goto backtrack;
|
|
|
|
} else
|
2016-03-06 17:24:02 +00:00
|
|
|
q++;
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
case '*':
|
|
|
|
c = *p;
|
2015-12-31 20:15:57 +00:00
|
|
|
while (c == '*')
|
1998-09-06 21:13:09 +00:00
|
|
|
c = *++p;
|
2012-01-01 20:50:19 +00:00
|
|
|
/*
|
|
|
|
* If the pattern ends here, we know the string
|
|
|
|
* matches without needing to look at the rest of it.
|
|
|
|
*/
|
|
|
|
if (c == '\0')
|
|
|
|
return 1;
|
|
|
|
/*
|
|
|
|
* First try the shortest match for the '*' that
|
|
|
|
* could work. We can forget any earlier '*' since
|
|
|
|
* there is no way having it match more characters
|
|
|
|
* can help us, given that we are already here.
|
|
|
|
*/
|
|
|
|
bt_p = p;
|
|
|
|
bt_q = q;
|
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case '[': {
|
2015-08-25 21:55:15 +00:00
|
|
|
const char *savep, *saveq;
|
1994-05-26 06:18:55 +00:00
|
|
|
int invert, found;
|
2011-05-08 11:32:20 +00:00
|
|
|
wchar_t chr;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
2015-08-25 21:55:15 +00:00
|
|
|
savep = p, saveq = q;
|
1994-05-26 06:18:55 +00:00
|
|
|
invert = 0;
|
1997-06-06 23:04:33 +00:00
|
|
|
if (*p == '!' || *p == '^') {
|
1994-05-26 06:18:55 +00:00
|
|
|
invert++;
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
found = 0;
|
2012-01-01 20:50:19 +00:00
|
|
|
if (*q == '\0')
|
|
|
|
return 0;
|
|
|
|
if (localeisutf8) {
|
2011-05-08 11:32:20 +00:00
|
|
|
chr = get_wc(&q);
|
2012-01-01 20:50:19 +00:00
|
|
|
if (chr == 0)
|
|
|
|
goto backtrack;
|
|
|
|
} else
|
2011-06-12 12:54:52 +00:00
|
|
|
chr = (unsigned char)*q++;
|
1994-05-26 06:18:55 +00:00
|
|
|
c = *p++;
|
|
|
|
do {
|
2015-08-25 21:55:15 +00:00
|
|
|
if (c == '\0') {
|
|
|
|
p = savep, q = saveq;
|
|
|
|
c = '[';
|
|
|
|
goto dft;
|
|
|
|
}
|
2011-06-15 21:48:10 +00:00
|
|
|
if (c == '[' && *p == ':') {
|
|
|
|
found |= match_charclass(p, chr, &end);
|
2018-04-29 17:46:08 +00:00
|
|
|
if (end != NULL) {
|
2011-06-15 21:48:10 +00:00
|
|
|
p = end;
|
2018-04-29 17:46:08 +00:00
|
|
|
continue;
|
|
|
|
}
|
2011-06-15 21:48:10 +00:00
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
if (c == CTLESC)
|
|
|
|
c = *p++;
|
2011-05-08 11:32:20 +00:00
|
|
|
if (localeisutf8 && c & 0x80) {
|
|
|
|
p--;
|
|
|
|
wc = get_wc(&p);
|
|
|
|
if (wc == 0) /* bad utf-8 */
|
|
|
|
return 0;
|
|
|
|
} else
|
2011-06-12 12:54:52 +00:00
|
|
|
wc = (unsigned char)c;
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*p == '-' && p[1] != ']') {
|
|
|
|
p++;
|
|
|
|
if (*p == CTLESC)
|
|
|
|
p++;
|
2011-05-08 11:32:20 +00:00
|
|
|
if (localeisutf8) {
|
|
|
|
wc2 = get_wc(&p);
|
|
|
|
if (wc2 == 0) /* bad utf-8 */
|
|
|
|
return 0;
|
|
|
|
} else
|
2011-06-12 12:54:52 +00:00
|
|
|
wc2 = (unsigned char)*p++;
|
2016-07-14 09:34:42 +00:00
|
|
|
if ( collate_range_cmp(chr, wc) >= 0
|
|
|
|
&& collate_range_cmp(chr, wc2) <= 0
|
|
|
|
)
|
1994-05-26 06:18:55 +00:00
|
|
|
found = 1;
|
|
|
|
} else {
|
2011-05-08 11:32:20 +00:00
|
|
|
if (chr == wc)
|
1994-05-26 06:18:55 +00:00
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
} while ((c = *p++) != ']');
|
|
|
|
if (found == invert)
|
2012-01-01 20:50:19 +00:00
|
|
|
goto backtrack;
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
dft: default:
|
2012-01-01 20:50:19 +00:00
|
|
|
if (*q == '\0')
|
|
|
|
return 0;
|
|
|
|
if (*q++ == c)
|
|
|
|
break;
|
|
|
|
backtrack:
|
|
|
|
/*
|
|
|
|
* If we have a mismatch (other than hitting the end
|
|
|
|
* of the string), go back to the last '*' seen and
|
|
|
|
* have it match one additional character.
|
|
|
|
*/
|
|
|
|
if (bt_p == NULL)
|
|
|
|
return 0;
|
|
|
|
if (*bt_q == '\0')
|
1994-05-26 06:18:55 +00:00
|
|
|
return 0;
|
2012-01-01 20:50:19 +00:00
|
|
|
bt_q++;
|
|
|
|
p = bt_p;
|
|
|
|
q = bt_q;
|
1994-05-26 06:18:55 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2010-09-05 21:12:48 +00:00
|
|
|
* Remove any CTLESC and CTLQUOTEMARK characters from a string.
|
1994-05-26 06:18:55 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
2002-02-02 06:50:57 +00:00
|
|
|
rmescapes(char *str)
|
1998-09-06 21:13:09 +00:00
|
|
|
{
|
1997-04-28 03:28:43 +00:00
|
|
|
char *p, *q;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
p = str;
|
2010-10-29 13:42:18 +00:00
|
|
|
while (*p != CTLESC && *p != CTLQUOTEMARK && *p != CTLQUOTEEND) {
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*p++ == '\0')
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
q = p;
|
|
|
|
while (*p) {
|
2010-10-29 13:42:18 +00:00
|
|
|
if (*p == CTLQUOTEMARK || *p == CTLQUOTEEND) {
|
1998-09-06 21:13:09 +00:00
|
|
|
p++;
|
|
|
|
continue;
|
|
|
|
}
|
1994-05-26 06:18:55 +00:00
|
|
|
if (*p == CTLESC)
|
|
|
|
p++;
|
|
|
|
*q++ = *p++;
|
|
|
|
}
|
|
|
|
*q = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* See if a pattern matches in a case statement.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2009-12-24 18:41:14 +00:00
|
|
|
casematch(union node *pattern, const char *val)
|
2002-02-02 06:50:57 +00:00
|
|
|
{
|
1994-05-26 06:18:55 +00:00
|
|
|
struct stackmark smark;
|
2017-03-16 21:53:55 +00:00
|
|
|
struct nodelist *argbackq;
|
1994-05-26 06:18:55 +00:00
|
|
|
int result;
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
setstackmark(&smark);
|
|
|
|
argbackq = pattern->narg.backquote;
|
|
|
|
STARTSTACKSTR(expdest);
|
2017-03-16 21:53:55 +00:00
|
|
|
argstr(pattern->narg.text, &argbackq, EXP_TILDE | EXP_CASE, NULL);
|
1994-05-26 06:18:55 +00:00
|
|
|
STPUTC('\0', expdest);
|
|
|
|
p = grabstackstr(expdest);
|
2015-12-31 17:51:15 +00:00
|
|
|
result = patmatch(p, val);
|
1994-05-26 06:18:55 +00:00
|
|
|
popstackmark(&smark);
|
|
|
|
return result;
|
|
|
|
}
|
1996-09-01 10:22:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Our own itoa().
|
|
|
|
*/
|
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
static void
|
2002-02-02 06:50:57 +00:00
|
|
|
cvtnum(int num, char *buf)
|
|
|
|
{
|
1996-09-01 10:22:36 +00:00
|
|
|
char temp[32];
|
|
|
|
int neg = num < 0;
|
|
|
|
char *p = temp + 31;
|
|
|
|
|
|
|
|
temp[31] = '\0';
|
|
|
|
|
|
|
|
do {
|
|
|
|
*--p = num % 10 + '0';
|
|
|
|
} while ((num /= 10) != 0);
|
|
|
|
|
|
|
|
if (neg)
|
|
|
|
*--p = '-';
|
|
|
|
|
2015-12-31 17:51:15 +00:00
|
|
|
memcpy(buf, p, temp + 32 - p);
|
1996-09-01 10:22:36 +00:00
|
|
|
}
|
2002-12-26 14:28:54 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Do most of the work for wordexp(3).
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
|
|
|
wordexpcmd(int argc, char **argv)
|
|
|
|
{
|
|
|
|
size_t len;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
out1fmt("%08x", argc - 1);
|
|
|
|
for (i = 1, len = 0; i < argc; i++)
|
|
|
|
len += strlen(argv[i]);
|
|
|
|
out1fmt("%08x", (int)len);
|
2010-11-20 14:14:52 +00:00
|
|
|
for (i = 1; i < argc; i++)
|
|
|
|
outbin(argv[i], strlen(argv[i]) + 1, out1);
|
2002-12-26 14:28:54 +00:00
|
|
|
return (0);
|
|
|
|
}
|
wordexp: Rewrite to make WRDE_NOCMD reliable.
Shell syntax is too complicated to detect command substitution and unquoted
operators reliably without implementing much of sh's parser. Therefore, have
sh do this detection.
While changing sh's support anyway, also read input from a pipe instead of
arguments to avoid {ARG_MAX} limits and improve privacy, and output count
and length using 16 instead of 8 digits.
The basic concept is:
execl("/bin/sh", "sh", "-c", "freebsd_wordexp ${1:+\"$1\"} -f "$2",
"", flags & WRDE_NOCMD ? "-p" : "", <pipe with words>);
The WRDE_BADCHAR error is still implemented in libc. POSIX requires us to
fail strings containing unquoted braces with code WRDE_BADCHAR. Since this
is normally not a syntax error in sh, there is still a need for checking
code in libc, we_check().
The new we_check() is an optimistic check that all the characters
<newline> | & ; < > ( ) { }
are quoted. To avoid duplicating too much sh logic, such characters are
permitted when quoting characters are seen, even if the quoting characters
may themselves be quoted. This code reports all WRDE_BADCHAR errors; bad
characters that get past it and are a syntax error in sh return WRDE_SYNTAX.
Although many implementations of WRDE_NOCMD erroneously allow some command
substitutions (and ours even documented this), there appears to be code that
relies on its security (codesearch.debian.net shows quite a few uses).
Passing untrusted data to wordexp() still exposes a denial of service
possibility and a fairly large attack surface.
Reviewed by: wblock (man page only)
MFC after: 2 weeks
Relnotes: yes
Security: fixes command execution with wordexp(untrusted, WRDE_NOCMD)
2015-09-30 21:32:29 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Do most of the work for wordexp(3), new version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
|
|
|
freebsd_wordexpcmd(int argc __unused, char **argv __unused)
|
|
|
|
{
|
|
|
|
struct arglist arglist;
|
|
|
|
union node *args, *n;
|
2015-10-11 21:33:00 +00:00
|
|
|
size_t len;
|
wordexp: Rewrite to make WRDE_NOCMD reliable.
Shell syntax is too complicated to detect command substitution and unquoted
operators reliably without implementing much of sh's parser. Therefore, have
sh do this detection.
While changing sh's support anyway, also read input from a pipe instead of
arguments to avoid {ARG_MAX} limits and improve privacy, and output count
and length using 16 instead of 8 digits.
The basic concept is:
execl("/bin/sh", "sh", "-c", "freebsd_wordexp ${1:+\"$1\"} -f "$2",
"", flags & WRDE_NOCMD ? "-p" : "", <pipe with words>);
The WRDE_BADCHAR error is still implemented in libc. POSIX requires us to
fail strings containing unquoted braces with code WRDE_BADCHAR. Since this
is normally not a syntax error in sh, there is still a need for checking
code in libc, we_check().
The new we_check() is an optimistic check that all the characters
<newline> | & ; < > ( ) { }
are quoted. To avoid duplicating too much sh logic, such characters are
permitted when quoting characters are seen, even if the quoting characters
may themselves be quoted. This code reports all WRDE_BADCHAR errors; bad
characters that get past it and are a syntax error in sh return WRDE_SYNTAX.
Although many implementations of WRDE_NOCMD erroneously allow some command
substitutions (and ours even documented this), there appears to be code that
relies on its security (codesearch.debian.net shows quite a few uses).
Passing untrusted data to wordexp() still exposes a denial of service
possibility and a fairly large attack surface.
Reviewed by: wblock (man page only)
MFC after: 2 weeks
Relnotes: yes
Security: fixes command execution with wordexp(untrusted, WRDE_NOCMD)
2015-09-30 21:32:29 +00:00
|
|
|
int ch;
|
|
|
|
int protected = 0;
|
|
|
|
int fd = -1;
|
2015-10-11 21:33:00 +00:00
|
|
|
int i;
|
wordexp: Rewrite to make WRDE_NOCMD reliable.
Shell syntax is too complicated to detect command substitution and unquoted
operators reliably without implementing much of sh's parser. Therefore, have
sh do this detection.
While changing sh's support anyway, also read input from a pipe instead of
arguments to avoid {ARG_MAX} limits and improve privacy, and output count
and length using 16 instead of 8 digits.
The basic concept is:
execl("/bin/sh", "sh", "-c", "freebsd_wordexp ${1:+\"$1\"} -f "$2",
"", flags & WRDE_NOCMD ? "-p" : "", <pipe with words>);
The WRDE_BADCHAR error is still implemented in libc. POSIX requires us to
fail strings containing unquoted braces with code WRDE_BADCHAR. Since this
is normally not a syntax error in sh, there is still a need for checking
code in libc, we_check().
The new we_check() is an optimistic check that all the characters
<newline> | & ; < > ( ) { }
are quoted. To avoid duplicating too much sh logic, such characters are
permitted when quoting characters are seen, even if the quoting characters
may themselves be quoted. This code reports all WRDE_BADCHAR errors; bad
characters that get past it and are a syntax error in sh return WRDE_SYNTAX.
Although many implementations of WRDE_NOCMD erroneously allow some command
substitutions (and ours even documented this), there appears to be code that
relies on its security (codesearch.debian.net shows quite a few uses).
Passing untrusted data to wordexp() still exposes a denial of service
possibility and a fairly large attack surface.
Reviewed by: wblock (man page only)
MFC after: 2 weeks
Relnotes: yes
Security: fixes command execution with wordexp(untrusted, WRDE_NOCMD)
2015-09-30 21:32:29 +00:00
|
|
|
|
|
|
|
while ((ch = nextopt("f:p")) != '\0') {
|
|
|
|
switch (ch) {
|
|
|
|
case 'f':
|
|
|
|
fd = number(shoptarg);
|
|
|
|
break;
|
|
|
|
case 'p':
|
|
|
|
protected = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (*argptr != NULL)
|
|
|
|
error("wrong number of arguments");
|
|
|
|
if (fd < 0)
|
|
|
|
error("missing fd");
|
|
|
|
INTOFF;
|
|
|
|
setinputfd(fd, 1);
|
|
|
|
INTON;
|
|
|
|
args = parsewordexp();
|
|
|
|
popfile(); /* will also close fd */
|
|
|
|
if (protected)
|
|
|
|
for (n = args; n != NULL; n = n->narg.next) {
|
|
|
|
if (n->narg.backquote != NULL) {
|
|
|
|
outcslow('C', out1);
|
|
|
|
error("command substitution disabled");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
outcslow(' ', out1);
|
2015-10-11 21:33:00 +00:00
|
|
|
emptyarglist(&arglist);
|
wordexp: Rewrite to make WRDE_NOCMD reliable.
Shell syntax is too complicated to detect command substitution and unquoted
operators reliably without implementing much of sh's parser. Therefore, have
sh do this detection.
While changing sh's support anyway, also read input from a pipe instead of
arguments to avoid {ARG_MAX} limits and improve privacy, and output count
and length using 16 instead of 8 digits.
The basic concept is:
execl("/bin/sh", "sh", "-c", "freebsd_wordexp ${1:+\"$1\"} -f "$2",
"", flags & WRDE_NOCMD ? "-p" : "", <pipe with words>);
The WRDE_BADCHAR error is still implemented in libc. POSIX requires us to
fail strings containing unquoted braces with code WRDE_BADCHAR. Since this
is normally not a syntax error in sh, there is still a need for checking
code in libc, we_check().
The new we_check() is an optimistic check that all the characters
<newline> | & ; < > ( ) { }
are quoted. To avoid duplicating too much sh logic, such characters are
permitted when quoting characters are seen, even if the quoting characters
may themselves be quoted. This code reports all WRDE_BADCHAR errors; bad
characters that get past it and are a syntax error in sh return WRDE_SYNTAX.
Although many implementations of WRDE_NOCMD erroneously allow some command
substitutions (and ours even documented this), there appears to be code that
relies on its security (codesearch.debian.net shows quite a few uses).
Passing untrusted data to wordexp() still exposes a denial of service
possibility and a fairly large attack surface.
Reviewed by: wblock (man page only)
MFC after: 2 weeks
Relnotes: yes
Security: fixes command execution with wordexp(untrusted, WRDE_NOCMD)
2015-09-30 21:32:29 +00:00
|
|
|
for (n = args; n != NULL; n = n->narg.next)
|
|
|
|
expandarg(n, &arglist, EXP_FULL | EXP_TILDE);
|
2015-10-11 21:33:00 +00:00
|
|
|
for (i = 0, len = 0; i < arglist.count; i++)
|
|
|
|
len += strlen(arglist.args[i]);
|
|
|
|
out1fmt("%016x %016zx", arglist.count, len);
|
|
|
|
for (i = 0; i < arglist.count; i++)
|
|
|
|
outbin(arglist.args[i], strlen(arglist.args[i]) + 1, out1);
|
wordexp: Rewrite to make WRDE_NOCMD reliable.
Shell syntax is too complicated to detect command substitution and unquoted
operators reliably without implementing much of sh's parser. Therefore, have
sh do this detection.
While changing sh's support anyway, also read input from a pipe instead of
arguments to avoid {ARG_MAX} limits and improve privacy, and output count
and length using 16 instead of 8 digits.
The basic concept is:
execl("/bin/sh", "sh", "-c", "freebsd_wordexp ${1:+\"$1\"} -f "$2",
"", flags & WRDE_NOCMD ? "-p" : "", <pipe with words>);
The WRDE_BADCHAR error is still implemented in libc. POSIX requires us to
fail strings containing unquoted braces with code WRDE_BADCHAR. Since this
is normally not a syntax error in sh, there is still a need for checking
code in libc, we_check().
The new we_check() is an optimistic check that all the characters
<newline> | & ; < > ( ) { }
are quoted. To avoid duplicating too much sh logic, such characters are
permitted when quoting characters are seen, even if the quoting characters
may themselves be quoted. This code reports all WRDE_BADCHAR errors; bad
characters that get past it and are a syntax error in sh return WRDE_SYNTAX.
Although many implementations of WRDE_NOCMD erroneously allow some command
substitutions (and ours even documented this), there appears to be code that
relies on its security (codesearch.debian.net shows quite a few uses).
Passing untrusted data to wordexp() still exposes a denial of service
possibility and a fairly large attack surface.
Reviewed by: wblock (man page only)
MFC after: 2 weeks
Relnotes: yes
Security: fixes command execution with wordexp(untrusted, WRDE_NOCMD)
2015-09-30 21:32:29 +00:00
|
|
|
return (0);
|
|
|
|
}
|