/** handle one line of the read command.
* more fields than variables -> remainder shall be part of last variable.
* less fields than variables -> remaining variables unset.
*
* @param line complete line of input
* @param ap argument (variable) list
* @param len length of line including trailing '\0'
*/
static void
readcmd_handle_line(char *s, char **ap)
{
struct arglist arglist;
struct strlist *sl;
char *backup;
char *line;
/* ifsbreakup will fiddle with stack region... */
line = stackblock();
s = grabstackstr(s);
/* need a copy, so that delimiters aren't lost
* in case there are more fields than variables */
backup = sstrdup(line);
arglist.lastp = &arglist.list;
ifsbreakup(s, &arglist);
*arglist.lastp = NULL;
ifsfree();
sl = arglist.list;
do {
if (!sl) {
/* nullify remaining arguments */
do {
setvar(*ap, nullstr, 0);
} while (*++ap);
return;
}
/* remaining fields present, but no variables left. */
if (!ap[1] && sl->next) {
size_t offset;
char *remainder;
/* FIXME little bit hacky, assuming that ifsbreakup
* will not modify the length of the string */
offset = sl->text - s;
remainder = backup + offset;
rmescapes(remainder);
setvar(*ap, remainder, 0);
return;
}
/* set variable to field */
rmescapes(sl->text);
setvar(*ap, sl->text, 0);
sl = sl->next;
} while (*++ap);
}
/*
* Perform pathname generation and remove control characters.
* At this point, the only control characters should be CTLESC.
* The results are stored in the list dstlist.
*/
static void
expandmeta(char *pattern, struct arglist *dstlist)
{
char *p;
int firstmatch;
char c;
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;
}
}
if (dstlist->count == firstmatch) {
/*
* no matches
*/
rmescapes(pattern);
appendarglist(dstlist, pattern);
} else {
qsort(&dstlist->args[firstmatch],
dstlist->count - firstmatch,
sizeof(dstlist->args[0]), expsortcmp);
}
}
/*
* Expand arithmetic expression. Backup to start of expression,
* evaluate, place result in (backed up) result, adjust string position.
*/
void
expari(shinstance *psh, int flag)
{
char *p, *start;
int result;
int begoff;
int quotes = flag & (EXP_FULL | EXP_CASE);
int quoted;
/* ifsfree(); */
/*
* This routine is slightly over-complicated for
* efficiency. First we make sure there is
* enough space for the result, which may be bigger
* than the expression if we add exponentation. Next we
* scan backwards looking for the start of arithmetic. If the
* next previous character is a CTLESC character, then we
* have to rescan starting from the beginning since CTLESC
* characters have to be processed left to right.
*/
#if INT_MAX / 1000000000 >= 10 || INT_MIN / 1000000000 <= -10
#error "integers with more than 10 digits are not supported"
#endif
CHECKSTRSPACE(psh, 12 - 2, psh->expdest);
USTPUTC(psh, '\0', psh->expdest);
start = stackblock(psh);
p = psh->expdest - 1;
while (*p != CTLARI && p >= start)
--p;
if (*p != CTLARI)
error(psh, "missing CTLARI (shouldn't happen)");
if (p > start && *(p-1) == CTLESC)
for (p = start; *p != CTLARI; p++)
if (*p == CTLESC)
p++;
if (p[1] == '"')
quoted=1;
else
quoted=0;
begoff = (int)(p - start);
removerecordregions(psh, begoff);
if (quotes)
rmescapes(psh, p+2);
result = arith(psh, p+2);
fmtstr(p, 12, "%d", result);
while (*p++)
;
if (quoted == 0)
recordregion(psh, begoff, (int)(p - 1 - start), 0);
result = (int)(psh->expdest - p + 1);
STADJUST(psh, -result, psh->expdest);
}
/*
* Expand arithmetic expression. Backup to start of expression,
* evaluate, place result in (backed up) result, adjust string position.
*/
void
expari(int flag)
{
char *p, *start;
intmax_t result;
int adjustment;
int begoff;
int quotes = flag & (EXP_FULL | EXP_CASE);
int quoted;
/* ifsfree(); */
/*
* This routine is slightly over-complicated for
* efficiency. First we make sure there is
* enough space for the result, which may be bigger
* than the expression if we add exponentation. Next we
* scan backwards looking for the start of arithmetic. If the
* next previous character is a CTLESC character, then we
* have to rescan starting from the beginning since CTLESC
* characters have to be processed left to right.
*/
/* SPACE_NEEDED is enough for all digits, plus possible "-", plus 2 (why?) */
#define SPACE_NEEDED ((sizeof(intmax_t) * CHAR_BIT + 2) / 3 + 1 + 2)
CHECKSTRSPACE((int)(SPACE_NEEDED - 2), expdest);
USTPUTC('\0', expdest);
start = stackblock();
p = expdest - 1;
while (*p != CTLARI && p >= start)
--p;
if (*p != CTLARI)
error("missing CTLARI (shouldn't happen)");
if (p > start && *(p-1) == CTLESC)
for (p = start; *p != CTLARI; p++)
if (*p == CTLESC)
p++;
if (p[1] == '"')
quoted=1;
else
quoted=0;
begoff = p - start;
removerecordregions(begoff);
if (quotes)
rmescapes(p+2);
result = arith(p+2);
fmtstr(p, SPACE_NEEDED, "%"PRIdMAX, result);
while (*p++)
;
if (quoted == 0)
recordregion(begoff, p - 1 - start, 0);
adjustment = expdest - p + 1;
STADJUST(-adjustment, expdest);
}
/*
* 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.
* When arglist is NULL, perform here document expansion.
*
* Caution: this function uses global state and is not reentrant.
* However, a new invocation after an interrupted invocation is safe
* and will reset the global state for the new call.
*/
void
expandarg(union node* arg, struct arglist* arglist, int32_t flag)
{
struct strlist* sp;
cstring_t p;
argbackq = arg->narg.backquote;
STARTSTACKSTR(expdest);
ifsfirst.next = NULL;
ifslastp = NULL;
argstr(arg->narg.text, flag);
if (arglist == NULL)
{
STACKSTRNUL(expdest);
return; /* here document expanded */
}
STPUTC('\0', expdest);
p = grabstackstr(expdest);
exparg.lastp = &exparg.list;
/*
* TODO - EXP_REDIR
*/
if (flag & EXP_FULL)
{
ifsbreakup(p, &exparg);
*exparg.lastp = NULL;
exparg.lastp = &exparg.list;
expandmeta(exparg.list, flag);
}
else
{
if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
rmescapes(p);
sp = (struct strlist*)stalloc(sizeof(struct strlist));
sp->text = p;
*exparg.lastp = sp;
exparg.lastp = &sp->next;
}
while (ifsfirst.next != NULL)
{
pifsregion_t ifsp;
INTOFF;
ifsp = ifsfirst.next->next;
ckfree(ifsfirst.next);
ifsfirst.next = ifsp;
INTON;
}
*exparg.lastp = NULL;
if (exparg.list)
{
*arglist->lastp = exparg.list;
arglist->lastp = exparg.lastp;
}
}
/*
* Expand arithmetic expression. Backup to start of expression,
* evaluate, place result in (backed up) result, adjust string position.
*/
void
expari(int flag)
{
char *p, *q, *start;
arith_t result;
int begoff;
int quotes = flag & (EXP_FULL | EXP_CASE | EXP_REDIR);
int quoted;
/*
* This routine is slightly over-complicated for
* efficiency. First we make sure there is
* enough space for the result, which may be bigger
* than the expression. Next we
* scan backwards looking for the start of arithmetic. If the
* next previous character is a CTLESC character, then we
* have to rescan starting from the beginning since CTLESC
* characters have to be processed left to right.
*/
CHECKSTRSPACE(DIGITS(result) - 2, expdest);
USTPUTC('\0', expdest);
start = stackblock();
p = expdest - 2;
while (p >= start && *p != CTLARI)
--p;
if (p < start || *p != CTLARI)
error("missing CTLARI (shouldn't happen)");
if (p > start && *(p - 1) == CTLESC)
for (p = start; *p != CTLARI; p++)
if (*p == CTLESC)
p++;
if (p[1] == '"')
quoted=1;
else
quoted=0;
begoff = p - start;
removerecordregions(begoff);
if (quotes)
rmescapes(p+2);
q = grabstackstr(expdest);
result = arith(p+2);
ungrabstackstr(q, expdest);
fmtstr(p, DIGITS(result), ARITH_FORMAT_STR, result);
while (*p++)
;
if (quoted == 0)
recordregion(begoff, p - 1 - start, 0);
result = expdest - p + 1;
STADJUST(-result, expdest);
}
STATIC void
parsefname() {
union node *n = redirnode;
if (readtoken() != TWORD)
synexpect(-1);
if (n->type == NHERE) {
struct heredoc *here = heredoc;
struct heredoc *p;
int i;
if (quoteflag == 0)
n->type = NXHERE;
TRACE(("Here document %d\n", n->type));
if (here->striptabs) {
while (*wordtext == '\t')
wordtext++;
}
if (! noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
synerror("Illegal eof marker for << redirection");
rmescapes(wordtext);
here->eofmark = wordtext;
here->next = NULL;
if (heredoclist == NULL)
heredoclist = here;
else {
for (p = heredoclist ; p->next ; p = p->next);
p->next = here;
}
} else if (n->type == NTOFD || n->type == NFROMFD) {
if (is_digit(wordtext[0]))
n->ndup.dupfd = digit_val(wordtext[0]);
else if (wordtext[0] == '-')
n->ndup.dupfd = -1;
else
goto bad;
if (wordtext[1] != '\0') {
bad:
synerror("Bad fd number");
}
} else {
n->nfile.fname = (union node *)stalloc(sizeof (struct narg));
n = n->nfile.fname;
n->type = NARG;
n->narg.next = NULL;
n->narg.text = wordtext;
n->narg.backquote = backquotelist;
}
}
STATIC void
expandmeta(shinstance *psh, struct strlist *str, int flag)
{
char *p;
struct strlist **savelastp;
struct strlist *sp;
char c;
/* TODO - EXP_REDIR */
while (str) {
if (fflag(psh))
goto nometa;
p = str->text;
for (;;) { /* fast check for meta chars */
if ((c = *p++) == '\0')
goto nometa;
if (c == '*' || c == '?' || c == '[' || c == '!')
break;
}
savelastp = psh->exparg.lastp;
INTOFF;
if (psh->expdir == NULL) {
size_t i = strlen(str->text);
psh->expdir = ckmalloc(psh, i < 2048 ? 2048 : i); /* XXX */
}
expmeta(psh, psh->expdir, str->text);
ckfree(psh, psh->expdir);
psh->expdir = NULL;
INTON;
if (psh->exparg.lastp == savelastp) {
/*
* no matches
*/
nometa:
*psh->exparg.lastp = str;
rmescapes(psh, str->text);
psh->exparg.lastp = &str->next;
} else {
*psh->exparg.lastp = NULL;
*savelastp = sp = expsort(*savelastp);
while (sp->next != NULL)
sp = sp->next;
psh->exparg.lastp = &sp->next;
}
str = str->next;
}
}
/*
* Perform pathname generation and remove control characters.
* At this point, the only control characters should be CTLESC and CTLQUOTEMARK.
* The results are stored in the list exparg.
*/
static void
expandmeta(struct strlist* str, int32_t flag __unused)
{
cstring_t p;
struct strlist** savelastp;
struct strlist* sp;
char c;
(void)flag;
/* TODO - EXP_REDIR */
while (str)
{
if (fflag)
goto nometa;
p = str->text;
for (;;) /* fast check for meta chars */
{
if ((c = *p++) == '\0')
goto nometa;
if (c == '*' || c == '?' || c == '[')
break;
}
savelastp = exparg.lastp;
INTOFF;
expmeta(expdir, str->text);
INTON;
if (exparg.lastp == savelastp)
{
/*
* no matches
*/
nometa:
*exparg.lastp = str;
rmescapes(str->text);
exparg.lastp = &str->next;
}
else
{
*exparg.lastp = NULL;
*savelastp = sp = expsort(*savelastp);
while (sp->next != NULL)
sp = sp->next;
exparg.lastp = &sp->next;
}
str = str->next;
}
}
void
expandarg(shinstance *psh, union node *arg, struct arglist *arglist, int flag)
{
struct strlist *sp;
char *p;
psh->argbackq = arg->narg.backquote;
STARTSTACKSTR(psh, psh->expdest);
psh->ifsfirst.next = NULL;
psh->ifslastp = NULL;
argstr(psh, arg->narg.text, flag);
if (arglist == NULL) {
return; /* here document expanded */
}
STPUTC(psh, '\0', psh->expdest);
p = grabstackstr(psh, psh->expdest);
TRACE2((psh, "expandarg: p='%s'\n", p));
psh->exparg.lastp = &psh->exparg.list;
/*
* TODO - EXP_REDIR
*/
if (flag & EXP_FULL) {
ifsbreakup(psh, p, &psh->exparg);
*psh->exparg.lastp = NULL;
psh->exparg.lastp = &psh->exparg.list;
expandmeta(psh, psh->exparg.list, flag);
} else {
if (flag & EXP_REDIR) /*XXX - for now, just remove escapes */
rmescapes(psh, p);
sp = (struct strlist *)stalloc(psh, sizeof (struct strlist));
sp->text = p;
*psh->exparg.lastp = sp;
psh->exparg.lastp = &sp->next;
}
ifsfree(psh);
*psh->exparg.lastp = NULL;
if (psh->exparg.list) {
*arglist->lastp = psh->exparg.list;
arglist->lastp = psh->exparg.lastp;
}
}
/*
* Perform pathname generation and remove control characters.
* At this point, the only control characters should be CTLESC and CTLQUOTEMARK.
* The results are stored in the list exparg.
*/
static void
expandmeta(struct strlist *str)
{
char *p;
struct strlist **savelastp;
struct strlist *sp;
char c;
while (str) {
savelastp = exparg.lastp;
if (!fflag) {
p = str->text;
for (; (c = *p) != '\0'; p++) {
/* fast check for meta chars */
if (c == '*' || c == '?' || c == '[') {
INTOFF;
expmeta(expdir, str->text);
INTON;
break;
}
}
}
if (exparg.lastp == savelastp) {
/*
* no matches
*/
*exparg.lastp = str;
rmescapes(str->text);
exparg.lastp = &str->next;
} else {
*exparg.lastp = NULL;
*savelastp = sp = expsort(*savelastp);
while (sp->next != NULL)
sp = sp->next;
exparg.lastp = &sp->next;
}
str = str->next;
}
}
STATIC void
parsefname(void)
{
union node *n = redirnode;
if (readtoken() != TWORD)
synexpect(-1);
if (n->type == NHERE) {
struct heredoc *here = heredoc;
struct heredoc *p;
int i;
if (quoteflag == 0)
n->type = NXHERE;
TRACE(("Here document %d\n", n->type));
if (here->striptabs) {
while (*wordtext == '\t')
wordtext++;
}
if (! noexpand(wordtext) || (i = strlen(wordtext)) == 0 || i > EOFMARKLEN)
synerror("Illegal eof marker for << redirection");
rmescapes(wordtext);
here->eofmark = wordtext;
here->next = NULL;
if (heredoclist == NULL)
heredoclist = here;
else {
for (p = heredoclist ; p->next ; p = p->next);
p->next = here;
}
} else if (n->type == NTOFD || n->type == NFROMFD) {
fixredir(n, wordtext, 0);
} else {
n->nfile.fname = makename();
}
}
