/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1982-2012 AT&T Intellectual Property *
* and is licensed under the *
* Eclipse Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* http://www.eclipse.org/org/documents/epl-v10.html *
* (with md5 checksum b35adb5213ca9657e911e9befb180842) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* David Korn <dgk@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* KornShell lexical analyzer
*
* Written by David Korn
* AT&T Labs
*
*/
#include <ast.h>
#include <stak.h>
#include <fcin.h>
#include <nval.h>
#include "FEATURE/options"
#if KSHELL
# include "defs.h"
#else
# include <shell.h>
# define nv_getval(np) ((np)->nvalue)
Shell_t sh = {1};
#endif /* KSHELL */
#include "argnod.h"
#include "test.h"
#include "lexstates.h"
#include "io.h"
#define TEST_RE 3
#define SYNBAD 3 /* exit value for syntax errors */
#define STACK_ARRAY 3 /* size of depth match stack growth */
#if _lib_iswblank < 0 /* set in lexstates.h to enable this code */
int
local_iswblank(wchar_t wc)
{
static int initialized;
static wctype_t wt;
if (!initialized)
{
initialized = 1;
wt = wctype("blank");
}
return(iswctype(wc, wt));
}
#endif
/*
* This structure allows for arbitrary depth nesting of (...), {...}, [...]
*/
struct lexstate
{
char incase; /* 1 for case pattern, 2 after case */
char intest; /* 1 inside [[...]] */
char testop1; /* 1 when unary test op legal */
char testop2; /* 1 when binary test op legal */
char reservok; /* >0 for reserved word legal */
char skipword; /* next word can't be reserved */
char last_quote; /* last multi-line quote character */
char nestedbrace; /* ${var op {...}} */
};
struct lexdata
{
char nocopy;
char paren;
char dolparen;
char nest;
char docword;
char nested_tilde;
char *docend;
char noarg;
char balance;
char warn;
char message;
char arith;
char *first;
int level;
int lastc;
int lex_max;
int *lex_match;
int lex_state;
int docextra;
#if SHOPT_KIA
off_t kiaoff;
#endif
};
#define _SHLEX_PRIVATE \
struct lexdata lexd; \
struct lexstate lex;
#include "shlex.h"
#define pushlevel(lp,c,s) ((lp->lexd.level>=lp->lexd.lex_max?stack_grow(lp):1) &&\
((lp->lexd.lex_match[lp->lexd.level++]=lp->lexd.lastc),\
lp->lexd.lastc=(((s)<<CHAR_BIT)|(c))))
#define oldmode(lp) (lp->lexd.lastc>>CHAR_BIT)
#define endchar(lp) (lp->lexd.lastc&0xff)
#define setchar(lp,c) (lp->lexd.lastc = ((lp->lexd.lastc&~0xff)|(c)))
#define poplevel(lp) (lp->lexd.lastc=lp->lexd.lex_match[--lp->lexd.level])
static char *fmttoken(Lex_t*, int, char*);
#ifdef SF_BUFCONST
static int alias_exceptf(Sfio_t*, int, void*, Sfdisc_t*);
#else
static int alias_exceptf(Sfio_t*, int, Sfdisc_t*);
#endif
static void setupalias(Lex_t*,const char*, Namval_t*);
static int comsub(Lex_t*,int);
static void nested_here(Lex_t*);
static int here_copy(Lex_t*, struct ionod*);
static int stack_grow(Lex_t*);
static const Sfdisc_t alias_disc = { NULL, NULL, NULL, alias_exceptf, NULL };
#if SHOPT_KIA
static void refvar(Lex_t *lp, int type)
{
register Shell_t *shp = lp->sh;
register Stk_t *stkp = shp->stk;
off_t off = (fcseek(0)-(type+1))-(lp->lexd.first?lp->lexd.first:fcfirst());
unsigned long r;
if(lp->lexd.first)
{
off = (fcseek(0)-(type+1)) - lp->lexd.first;
r=kiaentity(lp,lp->lexd.first+lp->lexd.kiaoff+type,off-lp->lexd.kiaoff,'v',-1,-1,lp->current,'v',0,"");
}
else
{
int n,offset = stktell(stkp);
char *savptr,*begin;
off = offset + (fcseek(0)-(type+1)) - fcfirst();
if(lp->lexd.kiaoff < offset)
{
/* variable starts on stak, copy remainder */
if(off>offset)
sfwrite(stkp,fcfirst()+type,off-offset);
n = stktell(stkp)-lp->lexd.kiaoff;
begin = stkptr(stkp,lp->lexd.kiaoff);
}
else
{
/* variable in data buffer */
begin = fcfirst()+(type+lp->lexd.kiaoff-offset);
n = off-lp->lexd.kiaoff;
}
savptr = stkfreeze(stkp,0);
r=kiaentity(lp,begin,n,'v',-1,-1,lp->current,'v',0,"");
stkset(stkp,savptr,offset);
}
sfprintf(lp->kiatmp,"p;%..64d;v;%..64d;%d;%d;r;\n",lp->current,r,shp->inlineno,shp->inlineno);
}
#endif /* SHOPT_KIA */
/*
* This routine gets called when reading across a buffer boundary
* If lexd.nocopy is off, then current token is saved on the stack
*/
static void lex_advance(Sfio_t *iop, const char *buff, register int size, void *context)
{
register Lex_t *lp = (Lex_t*)context;
register Shell_t *shp = lp->sh;
register Sfio_t *log= shp->funlog;
Stk_t *stkp = shp->stk;
#if KSHELL
/* write to history file and to stderr if necessary */
if(iop && !sfstacked(iop))
{
if(sh_isstate(SH_HISTORY) && shp->gd->hist_ptr)
log = shp->gd->hist_ptr->histfp;
sfwrite(log, (void*)buff, size);
if(sh_isstate(SH_VERBOSE))
sfwrite(sfstderr, buff, size);
}
#endif
if(lp->lexd.nocopy)
return;
if(lp->lexd.dolparen && lp->lexd.docword && lp->lexd.docend)
{
int n = size - (lp->lexd.docend-(char*)buff);
sfwrite(shp->strbuf,lp->lexd.docend,n);
lp->lexd.docextra += n;
if(sffileno(iop)>=0)
lp->lexd.docend = sfsetbuf(iop,(Void_t*)iop,0);
else
lp->lexd.docend = fcfirst();
}
if(lp->lexd.first)
{
size -= (lp->lexd.first-(char*)buff);
buff = lp->lexd.first;
if(!lp->lexd.noarg)
lp->arg = (struct argnod*)stkseek(stkp,ARGVAL);
#if SHOPT_KIA
lp->lexd.kiaoff += ARGVAL;
#endif /* SHOPT_KIA */
}
if(size>0 && (lp->arg||lp->lexd.noarg))
{
sfwrite(stkp,buff,size);
lp->lexd.first = 0;
}
}
/*
* fill up another input buffer
* preserves lexical state
*/
static int lexfill(Lex_t *lp)
{
register int c;
Lex_t savelex;
struct argnod *ap;
int aok,docextra;
savelex = *lp;
ap = lp->arg;
c = fcfill();
if(ap)
lp->arg = ap;
docextra = lp->lexd.docextra;
lp->lex = savelex.lex;
lp->lexd = savelex.lexd;
if(fcfile() || c)
lp->lexd.first = 0;
aok= lp->aliasok;
ap = lp->arg;
memcpy(lp, &savelex, offsetof(Lex_t,lexd));
lp->arg = ap;
lp->aliasok = aok;
if(lp->lexd.docword && docextra)
{
lp->lexd.docextra = docextra;
lp->lexd.docend = fcseek(0)-1;
}
return(c);
}
/*
* mode=1 for reinitialization
*/
Lex_t *sh_lexopen(Lex_t *lp, Shell_t *sp, int mode)
{
if(!lp)
{
lp = (Lex_t*)newof(0,Lex_t,1,0);
lp->sh = sp;
}
fcnotify(lex_advance,lp);
lp->lex.intest = lp->lex.incase = lp->lex.skipword = lp->lexd.warn = 0;
lp->comp_assign = 0;
lp->lex.reservok = 1;
if(!sh_isoption(SH_DICTIONARY) && sh_isoption(SH_NOEXEC))
lp->lexd.warn=1;
if(!mode)
{
lp->lexd.noarg = lp->lexd.level= lp->lexd.dolparen = lp->lexd.balance = 0;
lp->lexd.nocopy = lp->lexd.docword = lp->lexd.nest = lp->lexd.paren = 0;
lp->lexd.lex_state = lp->lexd.lastc=0;
lp->lexd.docend = 0;
lp->lexd.nested_tilde = 0;
}
lp->comsub = 0;
return(lp);
}
#ifdef DBUG
extern int lextoken(Lex_t*);
int sh_lex(Lex_t *lp)
{
Shell_t *shp = lp->sh;
register int flag;
char *quoted, *macro, *split, *expand;
char tokstr[3];
register int tok = lextoken(lp);
quoted = macro = split = expand = "";
if(tok==0 && (flag=lp->arg->argflag))
{
if(flag&ARG_MAC)
macro = "macro:";
if(flag&ARG_EXP)
expand = "expand:";
if(flag&ARG_QUOTED)
quoted = "quoted:";
}
sfprintf(sfstderr,"%d: line %d: %o:%s%s%s%s %s\n",getpid(),shp->inlineno,tok,quoted,
macro, split, expand, fmttoken(lp,tok,tokstr));
return(tok);
}
#define sh_lex lextoken
#endif
/*
* Get the next word and put it on the top of the stak
* A pointer to the current word is stored in lp->arg
* Returns the token type
*/
int sh_lex(Lex_t* lp)
{
register Shell_t *shp = lp->sh;
register const char *state;
register int n, c, mode=ST_BEGIN, wordflags=0;
Stk_t *stkp = shp->stk;
int inlevel=lp->lexd.level, assignment=0, ingrave=0;
int epatchar=0;
Sfio_t *sp;
#if SHOPT_MULTIBYTE
LEN=1;
#endif /* SHOPT_MULTIBYTE */
if(lp->lexd.paren)
{
lp->lexd.paren = 0;
return(lp->token=LPAREN);
}
if(lp->noreserv)
{
lp->lex.reservok = 0;
while((fcgetc(c)) && c==' ' || c== '\t' || c=='\n');
fcseek(-LEN);
if(c=='[')
lp->assignok = SH_ASSIGN;
}
if(lp->lex.incase)
lp->assignok = 0;
else
lp->assignok |= lp->lex.reservok;
if(lp->comp_assign==2)
lp->comp_assign = lp->lex.reservok = 0;
lp->lexd.arith = (lp->lexd.nest==1);
if(lp->lexd.nest)
{
pushlevel(lp,lp->lexd.nest,ST_NONE);
lp->lexd.nest = 0;
mode = lp->lexd.lex_state;
}
else if(lp->lexd.docword)
{
if(fcgetc(c)=='-' || c=='#')
{
lp->lexd.docword++;
lp->digits=(c=='#'?3:1);
}
else if(c=='<')
{
lp->digits=2;
lp->lexd.docword=0;
}
else if(c>0)
fcseek(-LEN);
}
if(!lp->lexd.dolparen)
{
lp->arg = 0;
if(mode!=ST_BEGIN)
lp->lexd.first = fcseek(0);
else
lp->lexd.first = 0;
}
lp->lastline = lp->sh->inlineno;
while(1)
{
/* skip over characters in the current state */
state = sh_lexstates[mode];
while((n=STATE(state,c))==0);
switch(n)
{
case S_BREAK:
fcseek(-LEN);
goto breakloop;
case S_EOF:
sp = fcfile();
if((n=lexfill(lp)) > 0)
{
fcseek(-1);
continue;
}
/* check for zero byte in file */
if(n==0 && fcfile())
{
if(shp->readscript)
{
char *cp = error_info.id;
errno = ENOEXEC;
error_info.id = shp->readscript;
errormsg(SH_DICT,ERROR_system(ERROR_NOEXEC),e_exec,cp);
}
else
{
lp->token = -1;
sh_syntax(lp);
}
}
/* end-of-file */
if(mode==ST_BEGIN)
return(lp->token=EOFSYM);
if(mode >ST_NORM && lp->lexd.level>0)
{
switch(c=endchar(lp))
{
case '$':
if(mode==ST_LIT)
{
c = '\'';
break;
}
mode = oldmode(lp);
poplevel(lp);
continue;
case RBRACT:
c = LBRACT;
break;
case 1: /* for ((...)) */
case RPAREN:
c = LPAREN;
break;
default:
c = LBRACE;
break;
case '"': case '`': case '\'':
lp->lexd.balance = c;
break;
}
if(sp && !(sfset(sp,0,0)&SF_STRING))
{
lp->lasttok = c;
lp->token = EOFSYM;
sh_syntax(lp);
}
lp->lexd.balance = c;
}
goto breakloop;
case S_COM:
/* skip one or more comment line(s) */
lp->lex.reservok = !lp->lex.intest;
if((n=lp->lexd.nocopy) && lp->lexd.dolparen)
lp->lexd.nocopy--;
do
{
while(fcgetc(c)>0 && c!='\n');
if(c<=0 || lp->heredoc)
{
shp->inlineno++;
break;
}
while(shp->inlineno++,fcpeek(0)=='\n')
fcseek(1);
while(state[c=fcpeek(0)]==0)
fcseek(1);
}
while(c=='#');
lp->lexd.nocopy = n;
if(c<0)
return(lp->token=EOFSYM);
n = S_NLTOK;
shp->inlineno--;
/* FALL THRU */
case S_NLTOK:
/* check for here-document */
if(lp->heredoc)
{
if(!lp->lexd.dolparen)
lp->lexd.nocopy++;
c = shp->inlineno;
if(here_copy(lp,lp->heredoc)<=0 && lp->lasttok)
{
lp->lasttok = IODOCSYM;
lp->token = EOFSYM;
lp->lastline = c;
sh_syntax(lp);
}
if(!lp->lexd.dolparen)
lp->lexd.nocopy--;
lp->heredoc = 0;
}
lp->lex.reservok = !lp->lex.intest;
lp->lex.skipword = 0;
/* FALL THRU */
case S_NL:
/* skip over new-lines */
lp->lex.last_quote = 0;
while(shp->inlineno++,fcget()=='\n');
fcseek(-LEN);
if(n==S_NLTOK)
{
lp->comp_assign = 0;
return(lp->token='\n');
}
case S_BLNK:
if(lp->lex.incase<=TEST_RE)
continue;
/* implicit RPAREN for =~ test operator */
if(inlevel+1==lp->lexd.level)
{
if(lp->lex.intest)
fcseek(-LEN);
c = RPAREN;
goto do_pop;
}
continue;
case S_OP:
/* return operator token */
if(c=='<' || c=='>')
{
if(lp->lex.testop2)
lp->lex.testop2 = 0;
else
{
lp->digits = (c=='>');
lp->lex.skipword = 1;
lp->aliasok = lp->lex.reservok;
if(lp->lex.incase<2)
lp->lex.reservok = 0;
}
}
else
{
lp->lex.reservok = !lp->lex.intest;
if(c==RPAREN)
{
if(!lp->lexd.dolparen)
lp->lex.incase = 0;
return(lp->token=c);
}
lp->lex.testop1 = lp->lex.intest;
}
if(fcgetc(n)>0)
fcseek(-LEN);
if(state[n]==S_OP || n=='#')
{
if(n==c)
{
if(c=='<')
lp->lexd.docword=1;
else if(n==LPAREN)
{
if(lp->lex.intest)
return(c);
lp->lexd.nest=1;
lp->lastline = shp->inlineno;
lp->lexd.lex_state = ST_NESTED;
fcseek(1);
return(sh_lex(lp));
}
c |= SYMREP;
}
else if(c=='(' || c==')')
return(lp->token=c);
else if(c=='&')
{
if(!sh_isoption(SH_POSIX) && n=='>' && (sh_isoption(SH_BASH) || sh_isstate(SH_PROFILE)))
{
if(!sh_isoption(SH_BASH) && !lp->nonstandard)
{
lp->nonstandard = 1;
errormsg(SH_DICT,ERROR_warn(0),e_lexnonstandard,shp->inlineno);
}
lp->digits = -1;
c = '>';
}
else if(n=='|')
c |= SYMPIPE;
else
n = 0;
}
else if(n=='&')
c |= SYMAMP;
else if(c!='<' && c!='>')
n = 0;
else if(n==LPAREN)
{
c |= SYMLPAR;
lp->lex.reservok = 1;
lp->lex.skipword = 0;
}
else if(n=='|')
c |= SYMPIPE;
else if(c=='<' && n=='>')
{
lp->digits = 1;
c = IORDWRSYM;
fcgetc(n);
if(fcgetc(n)==';')
{
lp->token = c = IORDWRSYMT;
if(lp->inexec)
sh_syntax(lp);
}
else if(n>0)
fcseek(-LEN);
n= 0;
}
else if(n=='#' && (c=='<'||c=='>'))
c |= SYMSHARP;
else if(n==';' && c=='>')
{
c |= SYMSEMI;
if(lp->inexec)
{
lp->token = c;
sh_syntax(lp);
}
}
else
n = 0;
if(n)
{
fcseek(1);
lp->lex.incase = (c==BREAKCASESYM || c==FALLTHRUSYM);
}
else
{
if(lp->lexd.warn && (n=fcpeek(0))!=RPAREN && n!=' ' && n!='\t')
errormsg(SH_DICT,ERROR_warn(0),e_lexspace,shp->inlineno,c,n);
}
}
if(c==LPAREN && lp->comp_assign && !lp->lex.intest && !lp->lex.incase)
lp->comp_assign = 2;
else
lp->comp_assign = 0;
return(lp->token=c);
case S_ESC:
/* check for \<new-line> */
fcgetc(n);
c=2;
#if SHOPT_CRNL
if(n=='\r')
{
if(fcgetc(n)=='\n')
c=3;
else
{
n='\r';
fcseek(-LEN);
}
}
#endif /* SHOPT_CRNL */
if(n=='\n')
{
Sfio_t *sp;
struct argnod *ap;
shp->inlineno++;
/* synchronize */
if(!(sp=fcfile()))
state=fcseek(0);
fcclose();
ap = lp->arg;
if(sp)
fcfopen(sp);
else
fcsopen((char*)state);
/* remove \new-line */
n = stktell(stkp)-c;
stkseek(stkp,n);
lp->arg = ap;
if(n<=ARGVAL)
{
mode = 0;
lp->lexd.first = 0;
}
continue;
}
wordflags |= ARG_QUOTED;
if(mode==ST_DOL)
goto err;
#ifndef STR_MAXIMAL
else if(mode==ST_NESTED && lp->lexd.warn &&
endchar(lp)==RBRACE &&
sh_lexstates[ST_DOL][n]==S_DIG
)
errormsg(SH_DICT,ERROR_warn(0),e_lexfuture,shp->inlineno,n);
#endif /* STR_MAXIMAL */
break;
case S_NAME:
if(!lp->lex.skipword)
lp->lex.reservok *= 2;
/* FALL THRU */
case S_TILDE:
if(c=='~' && mode==ST_NESTED)
{
if(endchar(lp)==RBRACE)
{
lp->lexd.nested_tilde++;
goto tilde;
}
continue;
}
case S_RES:
if(!lp->lexd.dolparen)
lp->lexd.first = fcseek(0)-LEN;
else if(lp->lexd.docword)
lp->lexd.docend = fcseek(0)-LEN;
mode = ST_NAME;
if(c=='.')
fcseek(-LEN);
if(n!=S_TILDE)
continue;
tilde:
fcgetc(n);
if(n>0)
{
if(c=='~' && n==LPAREN)
{
if(lp->lexd.nested_tilde)
lp->lexd.nested_tilde++;
else if(lp->lex.incase)
lp->lex.incase = TEST_RE;
}
fcseek(-LEN);
if(lp->lexd.nested_tilde)
{
lp->lexd.nested_tilde--;
continue;
}
}
if(n==LPAREN)
goto epat;
wordflags = ARG_MAC;
mode = ST_NORM;
continue;
case S_REG:
if(mode==ST_BEGIN)
{
do_reg:
/* skip new-line joining */
if(c=='\\' && fcpeek(0)=='\n')
{
shp->inlineno++;
fcseek(1);
continue;
}
fcseek(-LEN);
if(!lp->lexd.dolparen)
lp->lexd.first = fcseek(0);
else if(lp->lexd.docword)
lp->lexd.docend = fcseek(0);
if(c=='[' && lp->assignok>=SH_ASSIGN)
{
mode = ST_NAME;
continue;
}
}
mode = ST_NORM;
continue;
case S_LIT:
if(oldmode(lp)==ST_NONE && !lp->lexd.noarg) /* in ((...)) */
{
if((c=fcpeek(0))==LPAREN || c==RPAREN || c=='$' || c==LBRACE || c==RBRACE || c=='[' || c==']')
{
if(fcpeek(1)=='\'')
fcseek(2);
}
continue;
}
wordflags |= ARG_QUOTED;
if(mode==ST_DOL)
{
if(endchar(lp)!='$')
goto err;
if(oldmode(lp)==ST_QUOTE) /* $' within "" or `` */
{
if(lp->lexd.warn)
errormsg(SH_DICT,ERROR_warn(0),e_lexslash,shp->inlineno);
mode = ST_LIT;
}
}
if(mode!=ST_LIT)
{
if(lp->lexd.warn && lp->lex.last_quote && shp->inlineno > lp->lastline && fcpeek(-2)!='$')
errormsg(SH_DICT,ERROR_warn(0),e_lexlongquote,lp->lastline,lp->lex.last_quote);
lp->lex.last_quote = 0;
lp->lastline = shp->inlineno;
if(mode!=ST_DOL)
pushlevel(lp,'\'',mode);
mode = ST_LIT;
continue;
}
/* check for multi-line single-quoted string */
else if(shp->inlineno > lp->lastline)
lp->lex.last_quote = '\'';
mode = oldmode(lp);
poplevel(lp);
break;
case S_ESC2:
/* \ inside '' */
if(endchar(lp)=='$')
{
fcgetc(n);
if(n=='\n')
shp->inlineno++;
}
continue;
case S_GRAVE:
if(lp->lexd.warn && (mode!=ST_QUOTE || endchar(lp)!='`'))
errormsg(SH_DICT,ERROR_warn(0),e_lexobsolete1,shp->inlineno);
wordflags |=(ARG_MAC|ARG_EXP);
if(mode==ST_QUOTE)
ingrave = !ingrave;
/* FALL THRU */
case S_QUOTE:
if(oldmode(lp)==ST_NONE && lp->lexd.arith) /* in ((...)) */
{
if(n!=S_GRAVE || fcpeek(0)=='\'')
continue;
}
if(n==S_QUOTE)
wordflags |=ARG_QUOTED;
if(mode!=ST_QUOTE)
{
if(c!='"' || mode!=ST_QNEST)
{
if(lp->lexd.warn && lp->lex.last_quote && shp->inlineno > lp->lastline)
errormsg(SH_DICT,ERROR_warn(0),e_lexlongquote,lp->lastline,lp->lex.last_quote);
lp->lex.last_quote=0;
lp->lastline = shp->inlineno;
pushlevel(lp,c,mode);
}
ingrave ^= (c=='`');
mode = ST_QUOTE;
continue;
}
else if((n=endchar(lp))==c)
{
if(shp->inlineno > lp->lastline)
lp->lex.last_quote = c;
mode = oldmode(lp);
poplevel(lp);
}
else if(c=='"' && n==RBRACE)
mode = ST_QNEST;
break;
case S_DOL:
/* don't check syntax inside `` */
if(mode==ST_QUOTE && ingrave)
continue;
#if SHOPT_KIA
if(lp->lexd.first)
lp->lexd.kiaoff = fcseek(0)-lp->lexd.first;
else
lp->lexd.kiaoff = stktell(stkp)+fcseek(0)-fcfirst();
#endif /* SHOPT_KIA */
pushlevel(lp,'$',mode);
mode = ST_DOL;
continue;
case S_PAR:
do_comsub:
wordflags |= ARG_MAC;
mode = oldmode(lp);
poplevel(lp);
fcseek(-LEN);
n = lp->digits;
wordflags |= comsub(lp,c);
lp->digits = n;
continue;
case S_RBRA:
if((n=endchar(lp)) == '$')
goto err;
if(mode!=ST_QUOTE || n==RBRACE)
{
mode = oldmode(lp);
poplevel(lp);
}
break;
case S_EDOL:
/* end $identifier */
#if SHOPT_KIA
if(lp->kiafile)
refvar(lp,0);
#endif /* SHOPT_KIA */
if(lp->lexd.warn && c==LBRACT && !lp->lex.intest && !lp->lexd.arith && oldmode(lp)!= ST_NESTED)
errormsg(SH_DICT,ERROR_warn(0),e_lexusebrace,shp->inlineno);
fcseek(-LEN);
mode = oldmode(lp);
poplevel(lp);
break;
case S_DOT:
/* make sure next character is alpha */
if(fcgetc(n)>0)
{
if(n=='.')
fcgetc(n);
if(n>0)
fcseek(-LEN);
}
if(isaletter(n) || n==LBRACT)
continue;
if(mode==ST_NAME)
{
if(n=='=')
continue;
break;
}
else if(n==RBRACE)
continue;
if(isastchar(n))
continue;
goto err;
case S_SPC1:
wordflags |= ARG_MAC;
if(endchar(lp)==RBRACE)
{
setchar(lp,c);
continue;
}
/* FALL THRU */
case S_ALP:
if(c=='.' && endchar(lp)=='$')
goto err;
case S_SPC2:
case S_DIG:
wordflags |= ARG_MAC;
switch(endchar(lp))
{
case '$':
if(n==S_ALP) /* $identifier */
mode = ST_DOLNAME;
else
{
mode = oldmode(lp);
poplevel(lp);
}
break;
#if SHOPT_TYPEDEF
case '@':
#endif /* SHOPT_TYPEDEF */
case '!':
if(n!=S_ALP)
goto dolerr;
case '#':
if(c=='#')
n = S_ALP;
case RBRACE:
if(n==S_ALP)
{
setchar(lp,RBRACE);
if(c=='.')
fcseek(-LEN);
mode = ST_BRACE;
}
else
{
if(fcgetc(c)>0)
fcseek(-LEN);
if(state[c]==S_ALP)
goto err;
if(n==S_DIG)
setchar(lp,'0');
else
setchar(lp,'!');
}
break;
case '0':
if(n==S_DIG)
break;
default:
goto dolerr;
}
break;
dolerr:
case S_ERR:
if((n=endchar(lp)) == '$')
goto err;
if(c=='*' || (n=sh_lexstates[ST_BRACE][c])!=S_MOD1 && n!=S_MOD2)
{
/* see whether inside `...` */
mode = oldmode(lp);
poplevel(lp);
if((n = endchar(lp)) != '`')
goto err;
pushlevel(lp,RBRACE,mode);
}
else
setchar(lp,RBRACE);
mode = ST_NESTED;
continue;
case S_MOD1:
if(oldmode(lp)==ST_QUOTE || oldmode(lp)==ST_NONE)
{
/* allow ' inside "${...}" */
if(c==':' && fcgetc(n)>0)
{
n = state[n];
fcseek(-LEN);
}
if(n==S_MOD1)
{
mode = ST_QUOTE;
continue;
}
}
/* FALL THRU */
case S_MOD2:
#if SHOPT_KIA
if(lp->kiafile)
refvar(lp,1);
#endif /* SHOPT_KIA */
if(c!=':' && fcgetc(n)>0)
{
if(n!=c)
c = 0;
if(!c || (fcgetc(n)>0))
{
fcseek(-LEN);
if(n==LPAREN)
{
if(c!='%')
{
lp->token = n;
sh_syntax(lp);
}
else if(lp->lexd.warn)
errormsg(SH_DICT,ERROR_warn(0),e_lexquote,shp->inlineno,'%');
}
}
}
lp->lex.nestedbrace = 0;
mode = ST_NESTED;
continue;
case S_LBRA:
if((c=endchar(lp)) == '$')
{
if(fcgetc(c)>0)
fcseek(-LEN);
setchar(lp,RBRACE);
if(state[c]!=S_ERR && c!=RBRACE)
continue;
if((n=sh_lexstates[ST_BEGIN][c])==0 || n==S_OP || n==S_NLTOK)
{
c = LBRACE;
goto do_comsub;
}
}
err:
if(iswalpha(c))
continue;
n = endchar(lp);
mode = oldmode(lp);
poplevel(lp);
if(n!='$')
{
lp->token = c;
sh_syntax(lp);
}
else
{
if(lp->lexd.warn && c!='/' && sh_lexstates[ST_NORM][c]!=S_BREAK && (c!='"' || mode==ST_QUOTE))
errormsg(SH_DICT,ERROR_warn(0),e_lexslash,shp->inlineno);
else if(c=='"' && mode!=ST_QUOTE && !ingrave)
wordflags |= ARG_MESSAGE;
fcseek(-LEN);
}
continue;
case S_META:
if(lp->lexd.warn && endchar(lp)==RBRACE && !lp->lexd.nested_tilde)
errormsg(SH_DICT,ERROR_warn(0),e_lexusequote,shp->inlineno,c);
continue;
case S_PUSH:
fcgetc(n);
if(n==RPAREN)
continue;
else
fcseek(-LEN);
pushlevel(lp,RPAREN,mode);
mode = ST_NESTED;
continue;
case S_POP:
do_pop:
if(c==RBRACE && mode==ST_NESTED && lp->lex.nestedbrace)
{
lp->lex.nestedbrace--;
continue;
}
if(lp->lexd.level <= inlevel)
break;
if(lp->lexd.level==inlevel+1 && lp->lex.incase>=TEST_RE && !lp->lex.intest)
{
fcseek(-LEN);
goto breakloop;
}
n = endchar(lp);
if(c==RBRACT && !(n==RBRACT || n==RPAREN))
continue;
if((c==RBRACE||c==RPAREN) && n==RPAREN)
{
if(fcgetc(n)==LPAREN)
{
if(c!=RPAREN)
fcseek(-LEN);
continue;
}
if(n>0)
fcseek(-LEN);
n = RPAREN;
}
if(c==RBRACE)
lp->lexd.nested_tilde = 0;
if(c==';' && n!=';')
{
if(lp->lexd.warn && n==RBRACE)
errormsg(SH_DICT,ERROR_warn(0),e_lexusequote,shp->inlineno,c);
continue;
}
if(mode==ST_QNEST)
{
if(lp->lexd.warn)
errormsg(SH_DICT,ERROR_warn(0),e_lexescape,shp->inlineno,c);
continue;
}
mode = oldmode(lp);
poplevel(lp);
if(epatchar!='~')
epatchar = '@';
/* quotes in subscript need expansion */
if(mode==ST_NAME && (wordflags&ARG_QUOTED))
wordflags |= ARG_MAC;
/* check for ((...)) */
if(n==1 && c==RPAREN)
{
if(fcgetc(n)==RPAREN)
{
if(mode==ST_NONE && !lp->lexd.dolparen)
goto breakloop;
lp->lex.reservok = 1;
lp->lex.skipword = 0;
return(lp->token=EXPRSYM);
}
/* backward compatibility */
{
if(lp->lexd.warn)
errormsg(SH_DICT,ERROR_warn(0),e_lexnested,shp->inlineno);
if(!(state=lp->lexd.first))
state = fcfirst();
else
{
n = state-fcseek(0);
fcseek(n);
}
lp->lexd.paren = 1;
}
return(lp->token=LPAREN);
}
if(mode==ST_NONE)
return(0);
if(c!=n)
{
lp->token = c;
sh_syntax(lp);
}
if(c==RBRACE && (mode==ST_NAME||mode==ST_NORM))
goto epat;
continue;
case S_EQ:
assignment = lp->assignok;
/* FALL THRU */
case S_COLON:
if(assignment)
{
if(fcgetc(c)=='~')
wordflags |= ARG_MAC;
else if(c!=LPAREN && assignment==SH_COMPASSIGN)
assignment = 0;
if(c!=EOF)
fcseek(-LEN);
}
break;
case S_LABEL:
if(lp->lex.reservok && !lp->lex.incase)
{
c = fcget();
fcseek(-LEN);
if(state[c]==S_BREAK)
{
assignment = -1;
goto breakloop;
}
}
break;
case S_BRACT:
/* check for possible subscript */
if((n=endchar(lp))==RBRACT || n==RPAREN ||
(mode==ST_BRACE) ||
(oldmode(lp)==ST_NONE) ||
(mode==ST_NAME && (lp->assignok||lp->lexd.level)))
{
fcgetc(n);
if(n>0 && n==']')
{
if(mode==ST_NAME)
errormsg(SH_DICT,ERROR_exit(SYNBAD),e_lexsyntax1, shp->inlineno, "[]", "empty subscript");
if(!epatchar || epatchar=='%')
continue;
}
else
fcseek(-LEN);
pushlevel(lp,RBRACT,mode);
wordflags |= ARG_QUOTED;
mode = ST_NESTED;
continue;
}
wordflags |= ARG_EXP;
break;
case S_BRACE:
{
int isfirst;
if(lp->lexd.dolparen)
{
if(mode==ST_BEGIN && (lp->lex.reservok||lp->comsub))
{
if(lp->comsub)
return(lp->token=c);
fcgetc(n);
if(n>0)
fcseek(-LEN);
else
n = '\n';
if(n==RBRACT || sh_lexstates[ST_NORM][n])
return(lp->token=c);
}
break;
}
else if(mode==ST_NESTED && endchar(lp)==RBRACE)
{
lp->lex.nestedbrace++;
continue;
}
else if(mode==ST_BEGIN)
{
if(lp->comsub && c==RBRACE)
return(lp->token=c);
goto do_reg;
}
isfirst = (lp->lexd.first&&fcseek(0)==lp->lexd.first+1);
fcgetc(n);
/* check for {} */
if(c==LBRACE && n==RBRACE)
break;
if(n>0)
fcseek(-LEN);
else if(lp->lex.reservok)
break;
/* check for reserved word { or } */
if(lp->lex.reservok && state[n]==S_BREAK && isfirst)
break;
if(sh_isoption(SH_BRACEEXPAND) && c==LBRACE && !assignment && state[n]!=S_BREAK
&& !lp->lex.incase && !lp->lex.intest
&& !lp->lex.skipword)
{
wordflags |= ARG_EXP;
}
if(c==RBRACE && n==LPAREN)
goto epat;
break;
}
case S_PAT:
wordflags |= ARG_EXP;
/* FALL THRU */
case S_EPAT:
epat:
if(fcgetc(n)==LPAREN && c!='[')
{
epatchar = c;
if(lp->lex.incase==TEST_RE)
{
lp->lex.incase++;
pushlevel(lp,RPAREN,ST_NORM);
mode = ST_NESTED;
}
wordflags |= ARG_EXP;
pushlevel(lp,RPAREN,mode);
mode = ST_NESTED;
continue;
}
if(lp->lexd.warn && c=='[' && n=='^')
errormsg(SH_DICT,ERROR_warn(0),e_lexcharclass,shp->inlineno);
if(n>0)
fcseek(-LEN);
if(n=='=' && c=='+' && mode==ST_NAME)
continue;
break;
}
lp->comp_assign = 0;
if(mode==ST_NAME)
mode = ST_NORM;
else if(mode==ST_NONE)
return(0);
}
breakloop:
if(lp->lexd.nocopy)
{
lp->lexd.balance = 0;
return(0);
}
if(lp->lexd.dolparen)
{
lp->lexd.balance = 0;
if(lp->lexd.docword)
nested_here(lp);
lp->lexd.message = (wordflags&ARG_MESSAGE);
return(lp->token=0);
}
if(!(state=lp->lexd.first))
state = fcfirst();
n = fcseek(0)-(char*)state;
if(!lp->arg)
lp->arg = (struct argnod*)stkseek(stkp,ARGVAL);
if(n>0)
sfwrite(stkp,state,n);
/* add balancing character if necessary */
if(lp->lexd.balance)
{
sfputc(stkp,lp->lexd.balance);
lp->lexd.balance = 0;
}
sfputc(stkp,0);
stkseek(stkp,stktell(stkp)-1);
state = stkptr(stkp,ARGVAL);
n = stktell(stkp)-ARGVAL;
lp->lexd.first=0;
if(n==1)
{
/* check for numbered redirection */
n = state[0];
if((c=='<' || c=='>') && isadigit(n))
{
c = sh_lex(lp);
lp->digits = (n-'0');
return(c);
}
if(n==LBRACT)
c = 0;
else if(n==RBRACE && lp->comsub)
return(lp->token=n);
else if(n=='~')
c = ARG_MAC;
else
c = (wordflags&ARG_EXP);
n = 1;
}
else if(n>2 && state[0]=='{' && state[n-1]=='}' && !lp->lex.intest && !lp->lex.incase && (c=='<' || c== '>') && sh_isoption(SH_BRACEEXPAND))
{
if(!strchr(state,','))
{
stkseek(stkp,stktell(stkp)-1);
lp->arg = (struct argnod*)stkfreeze(stkp,1);
return(lp->token=IOVNAME);
}
c = wordflags;
}
else
c = wordflags;
if(assignment<0)
{
stkseek(stkp,stktell(stkp)-1);
lp->arg = (struct argnod*)stkfreeze(stkp,1);
lp->lex.reservok = 1;
return(lp->token=LABLSYM);
}
if(assignment || (lp->lex.intest&&!lp->lex.incase) || mode==ST_NONE)
c &= ~ARG_EXP;
if((c&ARG_EXP) && (c&ARG_QUOTED))
c |= ARG_MAC;
if(mode==ST_NONE)
{
/* eliminate trailing )) */
stkseek(stkp,stktell(stkp)-2);
}
if(c&ARG_MESSAGE)
{
if(sh_isoption(SH_DICTIONARY))
lp->arg = sh_endword(shp,2);
c |= ARG_MAC;
}
if(c==0 || (c&(ARG_MAC|ARG_EXP|ARG_MESSAGE)))
{
lp->arg = (struct argnod*)stkfreeze(stkp,1);
lp->arg->argflag = (c?c:ARG_RAW);
}
else if(mode==ST_NONE)
lp->arg = sh_endword(shp,-1);
else
lp->arg = sh_endword(shp,0);
state = lp->arg->argval;
lp->comp_assign = assignment;
if(assignment)
lp->arg->argflag |= ARG_ASSIGN;
else if(!lp->lex.skipword)
lp->assignok = 0;
lp->arg->argchn.cp = 0;
lp->arg->argnxt.ap = 0;
if(mode==ST_NONE)
return(lp->token=EXPRSYM);
if(lp->lex.intest)
{
if(lp->lex.testop1)
{
lp->lex.testop1 = 0;
if(n==2 && state[0]=='-' && state[2]==0 &&
strchr(test_opchars,state[1]))
{
if(lp->lexd.warn && state[1]=='a')
errormsg(SH_DICT,ERROR_warn(0),e_lexobsolete2,shp->inlineno);
lp->digits = state[1];
lp->token = TESTUNOP;
}
else if(n==1 && state[0]=='!' && state[1]==0)
{
lp->lex.testop1 = 1;
lp->token = '!';
}
else
{
lp->lex.testop2 = 1;
lp->token = 0;
}
return(lp->token);
}
lp->lex.incase = 0;
c = sh_lookup(state,shtab_testops);
switch(c)
{
case TEST_END:
lp->lex.testop2 = lp->lex.intest = 0;
lp->lex.reservok = 1;
lp->token = ETESTSYM;
return(lp->token);
case TEST_SEQ:
if(lp->lexd.warn && state[1]==0)
errormsg(SH_DICT,ERROR_warn(0),e_lexobsolete3,shp->inlineno);
/* FALL THRU */
default:
if(lp->lex.testop2)
{
if(lp->lexd.warn && (c&TEST_ARITH))
errormsg(SH_DICT,ERROR_warn(0),e_lexobsolete4,shp->inlineno,state);
if(c&TEST_PATTERN)
lp->lex.incase = 1;
else if(c==TEST_REP)
lp->lex.incase = TEST_RE;
lp->lex.testop2 = 0;
lp->digits = c;
lp->token = TESTBINOP;
return(lp->token);
}
case TEST_OR: case TEST_AND:
case 0:
return(lp->token=0);
}
}
if(lp->lex.reservok /* && !lp->lex.incase*/ && n<=2)
{
/* check for {, }, ! */
c = state[0];
if(n==1 && (c=='{' || c=='}' || c=='!'))
{
if(lp->lexd.warn && c=='{' && lp->lex.incase==2)
errormsg(SH_DICT,ERROR_warn(0),e_lexobsolete6,shp->inlineno);
if(lp->lex.incase==1 && c==RBRACE)
lp->lex.incase = 0;
return(lp->token=c);
}
else if(!lp->lex.incase && c==LBRACT && state[1]==LBRACT)
{
lp->lex.intest = lp->lex.testop1 = 1;
lp->lex.testop2 = lp->lex.reservok = 0;
return(lp->token=BTESTSYM);
}
}
c = 0;
if(!lp->lex.skipword)
{
if(n>1 && lp->lex.reservok==1 && mode==ST_NAME &&
(c=sh_lookup(state,shtab_reserved)))
{
if(lp->lex.incase)
{
if(lp->lex.incase >1)
lp->lex.incase = 1;
else if(c==ESACSYM)
lp->lex.incase = 0;
else
c = 0;
}
else if(c==FORSYM || c==CASESYM || c==SELECTSYM || c==FUNCTSYM || c==NSPACESYM)
{
lp->lex.skipword = 1;
lp->lex.incase = 2*(c==CASESYM);
}
else
lp->lex.skipword = 0;
if(c==INSYM)
lp->lex.reservok = 0;
else if(c==TIMESYM)
{
/* yech - POSIX requires time -p */
while(fcgetc(n)==' ' || n=='\t');
if(n>0)
fcseek(-LEN);
if(n=='-')
c=0;
}
return(lp->token=c);
}
if(!(wordflags&ARG_QUOTED) && (lp->lex.reservok||lp->aliasok))
{
/* check for aliases */
Namval_t* np;
if(!lp->lex.incase && !assignment && fcpeek(0)!=LPAREN &&
(np=nv_search(state,shp->alias_tree,HASH_SCOPE))
&& !nv_isattr(np,NV_NOEXPAND)
#if KSHELL
&& (lp->aliasok!=2 || nv_isattr(np,BLT_DCL))
&& (!sh_isstate(SH_NOALIAS) || nv_isattr(np,NV_NOFREE))
#endif /* KSHELL */
&& (state=nv_getval(np)))
{
setupalias(lp,state,np);
nv_onattr(np,NV_NOEXPAND);
lp->lex.reservok = 1;
lp->assignok |= lp->lex.reservok;
return(sh_lex(lp));
}
}
lp->lex.reservok = 0;
}
lp->lex.skipword = lp->lexd.docword = 0;
return(lp->token=c);
}
/*
* read to end of command substitution
*/
static int comsub(register Lex_t *lp, int endtok)
{
register int n,c,count=1;
register int line=lp->sh->inlineno;
char *first,*cp=fcseek(0),word[5];
int off, messages=0, assignok=lp->assignok, csub;
struct lexstate save;
save = lp->lex;
csub = lp->comsub;
sh_lexopen(lp,lp->sh,1);
lp->lexd.dolparen++;
lp->lex.incase=0;
pushlevel(lp,0,0);
lp->comsub = (endtok==LBRACE);
if(first=lp->lexd.first)
off = cp-first;
else
off = cp-fcfirst();
if(off<0)
c=*cp, *cp=0;
n = sh_lex(lp);
if(off<0)
*cp = c;
if(n==endtok || off<0)
{
if(endtok==LPAREN && lp->lexd.paren)
{
if(first==lp->lexd.first)
{
n = cp+1-(char*)fcseek(0);
fcseek(n);
}
count++;
lp->lexd.paren = 0;
fcgetc(c);
}
while(1)
{
/* look for case and esac */
n=0;
while(1)
{
fcgetc(c);
/* skip leading white space */
if(n==0 && !sh_lexstates[ST_BEGIN][c])
continue;
if(n==4)
break;
if(sh_lexstates[ST_NAME][c])
goto skip;
word[n++] = c;
}
if(sh_lexstates[ST_NAME][c]==S_BREAK)
{
if(memcmp(word,"case",4)==0)
lp->lex.incase=1;
else if(memcmp(word,"esac",4)==0)
lp->lex.incase=0;
}
skip:
if(c && (c!='#' || n==0))
fcseek(-LEN);
if(c==RBRACE && lp->lex.incase)
lp->lex.incase=0;
c=sh_lex(lp);
switch(c)
{
case LBRACE:
if(endtok==LBRACE && !lp->lex.incase)
{
lp->comsub = 0;
count++;
}
break;
case RBRACE:
rbrace:
if(endtok==LBRACE && --count<=0)
goto done;
if(count==1)
lp->comsub = endtok==LBRACE;
break;
case IPROCSYM: case OPROCSYM:
case LPAREN:
if(endtok==LPAREN && !lp->lex.incase)
count++;
break;
case RPAREN:
if(lp->lex.incase)
lp->lex.incase=0;
else if(endtok==LPAREN && --count<=0)
goto done;
break;
case EOFSYM:
lp->lastline = line;
lp->lasttok = endtok;
sh_syntax(lp);
case IOSEEKSYM:
if(fcgetc(c)!='#' && c>0)
fcseek(-LEN);
break;
case IODOCSYM:
lp->lexd.docextra = 0;
sh_lex(lp);
break;
case 0:
lp->lex.reservok = 0;
messages |= lp->lexd.message;
break;
case ';':
do
fcgetc(c);
while(!sh_lexstates[ST_BEGIN][c]);
if(c==RBRACE && endtok==LBRACE)
goto rbrace;
if(c>0)
fcseek(-LEN);
/* fall through*/
default:
lp->lex.reservok = 1;
}
}
}
done:
poplevel(lp);
lp->comsub = csub;
lp->lastline = line;
lp->lexd.dolparen--;
lp->lex = save;
lp->assignok = (endchar(lp)==RBRACT?assignok:0);
if(lp->heredoc)
errormsg(SH_DICT,ERROR_exit(SYNBAD),e_lexsyntax5,lp->sh->inlineno,lp->heredoc->ioname);
return(messages);
}
/*
* here-doc nested in $(...)
* allocate ionode with delimiter filled in without disturbing stak
*/
static void nested_here(register Lex_t *lp)
{
register struct ionod *iop;
register int n=0,offset;
struct argnod *arg = lp->arg;
Stk_t *stkp = lp->sh->stk;
char *base;
if(offset=stktell(stkp))
base = stkfreeze(stkp,0);
if(lp->lexd.docend)
n = fcseek(0)-lp->lexd.docend;
iop = newof(0,struct ionod,1,lp->lexd.docextra+n+ARGVAL);
iop->iolst = lp->heredoc;
stkseek(stkp,ARGVAL);
if(lp->lexd.docextra)
{
sfseek(lp->sh->strbuf,(Sfoff_t)0, SEEK_SET);
sfmove(lp->sh->strbuf,stkp,lp->lexd.docextra,-1);
sfseek(lp->sh->strbuf,(Sfoff_t)0, SEEK_SET);
}
sfwrite(stkp,lp->lexd.docend,n);
lp->arg = sh_endword(lp->sh,0);
iop->ioname = (char*)(iop+1);
strcpy(iop->ioname,lp->arg->argval);
iop->iofile = (IODOC|IORAW);
if(lp->lexd.docword>1)
iop->iofile |= IOSTRIP;
lp->heredoc = iop;
lp->arg = arg;
lp->lexd.docword = 0;
if(offset)
stkset(stkp,base,offset);
else
stkseek(stkp,0);
}
/*
* skip to <close> character
* if <copy> is non,zero, then the characters are copied to the stack
* <state> is the initial lexical state
*/
void sh_lexskip(Lex_t *lp,int close, register int copy, int state)
{
register char *cp;
lp->lexd.nest = close;
lp->lexd.lex_state = state;
lp->lexd.noarg = 1;
if(copy)
fcnotify(lex_advance,lp);
else
lp->lexd.nocopy++;
sh_lex(lp);
lp->lexd.noarg = 0;
if(copy)
{
fcnotify(0,lp);
if(!(cp=lp->lexd.first))
cp = fcfirst();
if((copy = fcseek(0)-cp) > 0)
sfwrite(lp->sh->stk,cp,copy);
}
else
lp->lexd.nocopy--;
}
#if SHOPT_CRNL
ssize_t _sfwrite(Sfio_t *sp, const Void_t *buff, size_t n)
{
const char *cp = (const char*)buff, *next=cp, *ep = cp + n;
int m=0,k;
while(next = (const char*)memchr(next,'\r',ep-next))
if(*++next=='\n')
{
if(k=next-cp-1)
{
if((k=sfwrite(sp,cp,k)) < 0)
return(m>0?m:-1);
m += k;
}
cp = next;
}
if((k=sfwrite(sp,cp,ep-cp)) < 0)
return(m>0?m:-1);
return(m+k);
}
# define sfwrite _sfwrite
#endif /* SHOPT_CRNL */
/*
* read in here-document from script
* quoted here documents, and here-documents without special chars are
* noted with the IOQUOTE flag
* returns 1 for complete here-doc, 0 for EOF
*/
static int here_copy(Lex_t *lp,register struct ionod *iop)
{
register const char *state;
register int c,n;
register char *bufp,*cp;
register Sfio_t *sp=lp->sh->heredocs, *funlog;
int stripcol=0,stripflg, nsave, special=0;
if(funlog=lp->sh->funlog)
{
if(fcfill()>0)
fcseek(-LEN);
lp->sh->funlog = 0;
}
if(iop->iolst)
here_copy(lp,iop->iolst);
iop->iooffset = sfseek(sp,(off_t)0,SEEK_END);
iop->iosize = 0;
iop->iodelim=iop->ioname;
/* check for and strip quoted characters in delimiter string */
if(stripflg=iop->iofile&IOSTRIP)
{
while(*iop->iodelim=='\t')
iop->iodelim++;
/* skip over leading tabs in document */
if(iop->iofile&IOLSEEK)
{
iop->iofile &= ~IOLSEEK;
while(fcgetc(c)=='\t' || c==' ')
{
if(c==' ')
stripcol++;
else
stripcol += 8 - stripcol%8;
}
}
else
while(fcgetc(c)=='\t');
if(c>0)
fcseek(-LEN);
}
if(iop->iofile&IOQUOTE)
state = sh_lexstates[ST_LIT];
else
state = sh_lexstates[ST_QUOTE];
bufp = fcseek(0);
n = S_NL;
while(1)
{
if(n!=S_NL)
{
/* skip over regular characters */
#if SHOPT_MULTIBYTE
do
{
if(fcleft()< MB_LEN_MAX && mbsize(fcseek(0))<0)
{
n = S_EOF;
LEN = -fcleft();
break;
}
}
#endif /* SHOPT_MULTIBYTE */
while((n=STATE(state,c))==0);
}
if(n==S_EOF || !(c=fcget()))
{
if(LEN < 0)
c = fclast()-bufp;
else
c= (fcseek(0)-1)-bufp;
if(!lp->lexd.dolparen && c)
{
if(n==S_ESC)
c--;
if(!lp->lexd.dolparen && (c=sfwrite(sp,bufp,c))>0)
iop->iosize += c;
}
#if SHOPT_MULTIBYTE
if(LEN==0)
LEN=1;
if(LEN < 0)
{
n = LEN;
c = fcmbget(&LEN);
LEN += n;
}
else
#endif /* SHOPT_MULTIBYTE */
c = lexfill(lp);
if(c<0)
break;
if(n==S_ESC)
{
#if SHOPT_CRNL
if(c=='\r' && (c=fcget())!=NL)
fcseek(-LEN);
#endif /* SHOPT_CRNL */
if(c==NL)
fcseek(1);
else if(!lp->lexd.dolparen)
{
iop->iosize++;
sfputc(sp,'\\');
}
}
bufp = fcseek(-LEN);
}
else
fcseek(-LEN);
switch(n)
{
case S_NL:
lp->sh->inlineno++;
if((stripcol && c==' ') || (stripflg && c=='\t'))
{
if(!lp->lexd.dolparen)
{
/* write out line */
n = fcseek(0)-bufp;
if((n=sfwrite(sp,bufp,n))>0)
iop->iosize += n;
}
/* skip over tabs */
if(stripcol)
{
int col=0;
do
{
fcgetc(c);
if(c==' ')
col++;
else
col += 8 - col%8;
if(col>stripcol)
break;
}
while (c==' ' || c=='\t');
}
else while(c=='\t')
fcgetc(c);
if(c<=0)
goto done;
bufp = fcseek(-LEN);
}
if(c!=iop->iodelim[0])
break;
cp = fcseek(0);
nsave = n = 0;
while(1)
{
if(!(c=fcget()))
{
if(!lp->lexd.dolparen && (c=cp-bufp))
{
if((c=sfwrite(sp,cp=bufp,c))>0)
iop->iosize+=c;
}
nsave = n;
if((c=lexfill(lp))<=0)
{
c = iop->iodelim[n]==0;
goto done;
}
}
#if SHOPT_CRNL
if(c=='\r' && (c=fcget())!=NL)
{
if(c)
fcseek(-LEN);
c='\r';
}
#endif /* SHOPT_CRNL */
if(c==NL)
lp->sh->inlineno++;
if(iop->iodelim[n]==0 && (c==NL||c==RPAREN))
{
if(!lp->lexd.dolparen && (n=cp-bufp))
{
if((n=sfwrite(sp,bufp,n))>0)
iop->iosize += n;
}
lp->sh->inlineno--;
if(c==RPAREN)
fcseek(-LEN);
goto done;
}
if(iop->iodelim[n++]!=c)
{
/*
* The match for delimiter failed.
* nsave>0 only when a buffer boundary
* was crossed while checking the
* delimiter
*/
if(!lp->lexd.dolparen && nsave>0)
{
if((n=sfwrite(sp,iop->iodelim,nsave))>0)
iop->iosize += n;
bufp = fcfirst();
}
if(c==NL)
fcseek(-LEN);
break;
}
}
break;
case S_ESC:
n=1;
#if SHOPT_CRNL
if(c=='\r')
{
fcseek(1);
if(c=fcget())
fcseek(-LEN);
if(c==NL)
n=2;
else
{
special++;
break;
}
}
#endif /* SHOPT_CRNL */
if(c==NL)
{
/* new-line joining */
lp->sh->inlineno++;
if(!lp->lexd.dolparen && (n=(fcseek(0)-bufp)-n)>=0)
{
if(n && (n=sfwrite(sp,bufp,n))>0)
iop->iosize += n;
bufp = fcseek(0)+1;
}
}
else
special++;
fcget();
break;
case S_GRAVE:
case S_DOL:
special++;
break;
}
n=0;
}
done:
lp->sh->funlog = funlog;
if(lp->lexd.dolparen)
free((void*)iop);
else if(!special)
iop->iofile |= IOQUOTE;
return(c);
}
/*
* generates string for given token
*/
static char *fmttoken(Lex_t *lp, register int sym, char *tok)
{
int n=1;
if(sym < 0)
return((char*)sh_translate(e_lexzerobyte));
if(sym==0)
return(lp->arg?lp->arg->argval:"?");
if(lp->lex.intest && lp->arg && *lp->arg->argval)
return(lp->arg->argval);
if(sym&SYMRES)
{
register const Shtable_t *tp=shtab_reserved;
while(tp->sh_number && tp->sh_number!=sym)
tp++;
return((char*)tp->sh_name);
}
if(sym==EOFSYM)
return((char*)sh_translate(e_endoffile));
if(sym==NL)
return((char*)sh_translate(e_newline));
tok[0] = sym;
if(sym&SYMREP)
tok[n++] = sym;
else
{
switch(sym&SYMMASK)
{
case SYMAMP:
sym = '&';
break;
case SYMPIPE:
sym = '|';
break;
case SYMGT:
sym = '>';
break;
case SYMLPAR:
sym = LPAREN;
break;
case SYMSHARP:
sym = '#';
break;
case SYMSEMI:
if(tok[0]=='<')
tok[n++] = '>';
sym = ';';
break;
default:
sym = 0;
}
tok[n++] = sym;
}
tok[n] = 0;
return(tok);
}
/*
* print a bad syntax message
*/
void sh_syntax(Lex_t *lp)
{
register Shell_t *shp = lp->sh;
register const char *cp = sh_translate(e_unexpected);
register char *tokstr;
register int tok = lp->token;
char tokbuf[3];
Sfio_t *sp;
if((tok==EOFSYM) && lp->lasttok)
{
tok = lp->lasttok;
cp = sh_translate(e_unmatched);
}
else
lp->lastline = shp->inlineno;
tokstr = fmttoken(lp,tok,tokbuf);
if((sp=fcfile()) || (shp->infd>=0 && (sp=shp->sftable[shp->infd])))
{
/* clear out any pending input */
register Sfio_t *top;
while(fcget()>0);
fcclose();
while(top=sfstack(sp,SF_POPSTACK))
sfclose(top);
}
else
fcclose();
shp->inlineno = lp->inlineno;
shp->st.firstline = lp->firstline;
#if KSHELL
if(!sh_isstate(SH_INTERACTIVE) && !sh_isstate(SH_PROFILE))
#else
if(shp->inlineno!=1)
#endif
errormsg(SH_DICT,ERROR_exit(SYNBAD),e_lexsyntax1,lp->lastline,tokstr,cp);
else
errormsg(SH_DICT,ERROR_exit(SYNBAD),e_lexsyntax2,tokstr,cp);
}
static char *stack_shift(Stk_t *stkp, register char *sp,char *dp)
{
register char *ep;
register int offset = stktell(stkp);
register int left = offset-(sp-stkptr(stkp,0));
register int shift = (dp+1-sp);
offset += shift;
stkseek(stkp,offset);
sp = stkptr(stkp,offset);
ep = sp - shift;
while(left--)
*--sp = *--ep;
return(sp);
}
/*
* Assumes that current word is unfrozen on top of the stak
* If <mode> is zero, gets rid of quoting and consider argument as string
* and returns pointer to frozen arg
* If mode==1, just replace $"..." strings with international strings
* The result is left on the stak
* If mode==2, the each $"" string is printed on standard output
*/
struct argnod *sh_endword(Shell_t *shp,int mode)
{
register const char *state = sh_lexstates[ST_NESTED];
register int n;
register char *sp,*dp;
register int inquote=0, inlit=0; /* set within quoted strings */
struct argnod* argp=0;
char *ep=0, *xp=0;
int bracket=0;
Stk_t *stkp=shp->stk;
sfputc(stkp,0);
sp = stkptr(stkp,ARGVAL);
#if SHOPT_MULTIBYTE
if(mbwide())
{
do
{
int len;
switch(len = mbsize(sp))
{
case -1: /* illegal multi-byte char */
case 0:
case 1:
n=state[*sp++];
break;
default:
/*
* None of the state tables contain
* entries for multibyte characters,
* however, they should be treated
* the same as any other alph
* character. Therefore, we'll use
* the state of the 'a' character.
*/
n=state['a'];
sp += len;
}
}
while(n == 0);
}
else
#endif /* SHOPT_MULTIBYTE */
while((n=state[*sp++])==0);
dp = sp;
if(mode<0)
inquote = 1;
while(1)
{
switch(n)
{
case S_EOF:
stkseek(stkp,dp-stkptr(stkp,0));
if(mode<=0)
{
argp = (struct argnod*)stkfreeze(stkp,0);
argp->argflag = ARG_RAW|ARG_QUOTED;
}
return(argp);
case S_LIT:
if(!(inquote&1))
{
inlit = !inlit;
if(mode==0 || (mode<0 && bracket))
{
dp--;
if(ep)
{
*dp = 0;
stresc(ep);
dp = ep+ strlen(ep);
}
ep = 0;
}
}
break;
case S_QUOTE:
if(mode<0 && !bracket)
break;
if(!inlit)
{
if(mode<=0)
dp--;
inquote = inquote^1;
if(ep)
{
char *msg;
if(mode==2)
{
sfprintf(sfstdout,"%.*s\n",dp-ep,ep);
ep = 0;
break;
}
*--dp = 0;
#if ERROR_VERSION >= 20000317L
msg = ERROR_translate(0,error_info.id,0,ep);
#else
# if ERROR_VERSION >= 20000101L
msg = ERROR_translate(error_info.id,ep);
# else
msg = ERROR_translate(ep,2);
# endif
#endif
n = strlen(msg);
dp = ep+n;
if(sp-dp <= 1)
{
sp = stack_shift(stkp,sp,dp);
dp = sp-1;
ep = dp-n;
}
memmove(ep,msg,n);
*dp++ = '"';
}
ep = 0;
}
break;
case S_DOL: /* check for $'...' and $"..." */
if(inlit)
break;
if(*sp==LPAREN || *sp==LBRACE)
{
inquote <<= 1;
break;
}
if(inquote&1)
break;
if(*sp=='\'' || *sp=='"')
{
if(*sp=='"')
inquote |= 1;
else
inlit = 1;
sp++;
if((mode==0||(mode<0&&bracket)) || (inquote&1))
{
if(mode==2)
ep = dp++;
else if(mode==1)
(ep=dp)[-1] = '"';
else
ep = --dp;
}
}
break;
case S_ESC:
#if SHOPT_CRNL
if(*sp=='\r' && sp[1]=='\n')
sp++;
#endif /* SHOPT_CRNL */
if(inlit || mode>0)
{
if(mode<0)
{
if(dp>=sp)
{
sp = stack_shift(stkp,sp,dp+1);
dp = sp-2;
}
*dp++ = '\\';
}
if(ep)
*dp++ = *sp++;
break;
}
n = *sp;
#if SHOPT_DOS
if(!(inquote&1) && sh_lexstates[ST_NORM][n]==0)
break;
#endif /* SHOPT_DOS */
if(!(inquote&1) || (sh_lexstates[ST_QUOTE][n] && n!=RBRACE))
{
if(n=='\n')
dp--;
else
dp[-1] = n;
sp++;
}
break;
case S_POP:
if(sp[-1]!=RBRACT)
break;
if(!inlit && !(inquote&1))
{
inquote >>= 1;
if(xp)
dp = sh_checkid(xp,dp);
xp = 0;
if(--bracket<=0 && mode<0)
inquote = 1;
}
else if((inlit||inquote) && mode<0)
{
dp[-1] = '\\';
if(dp>=sp)
{
sp = stack_shift(stkp,sp,dp);
dp = sp-1;
}
*dp++ = ']';
}
break;
case S_BRACT:
if(dp[-2]=='.')
xp = dp;
if(mode<0)
{
if(inlit || (bracket&&inquote))
{
dp[-1] = '\\';
if(dp>=sp)
{
sp = stack_shift(stkp,sp,dp);
dp = sp-1;
}
*dp++ = '[';
}
else if(bracket++==0)
inquote = 0;
}
break;
}
#if SHOPT_MULTIBYTE
if(mbwide())
{
do
{
int len;
switch(len = mbsize(sp))
{
case -1: /* illegal multi-byte char */
case 0:
case 1:
n=state[*dp++ = *sp++];
break;
default:
/*
* None of the state tables contain
* entries for multibyte characters,
* however, they should be treated
* the same as any other alph
* character. Therefore, we'll use
* the state of the 'a' character.
*/
while(len--)
*dp++ = *sp++;
n=state['a'];
}
}
while(n == 0);
}
else
#endif /* SHOPT_MULTIBYTE */
while((n=state[*dp++ = *sp++])==0);
}
}
struct alias
{
Sfdisc_t disc;
Namval_t *np;
int nextc;
int line;
char buf[2];
Lex_t *lp;
};
/*
* This code gets called whenever an end of string is found with alias
*/
#ifndef SF_ATEXIT
# define SF_ATEXIT 0
#endif
/*
* This code gets called whenever an end of string is found with alias
*/
#ifdef SF_BUFCONST
static int alias_exceptf(Sfio_t *iop,int type,void *data, Sfdisc_t *handle)
#else
static int alias_exceptf(Sfio_t *iop,int type,Sfdisc_t *handle)
#endif
{
register struct alias *ap = (struct alias*)handle;
register Namval_t *np;
register Lex_t *lp;
if(type==0 || type==SF_ATEXIT || !ap)
return(0);
lp = ap->lp;
np = ap->np;
if(type!=SF_READ)
{
if(type==SF_CLOSING)
{
register Sfdisc_t *dp = sfdisc(iop,SF_POPDISC);
if(dp!=handle)
sfdisc(iop,dp);
}
else if(type==SF_FINAL)
free((void*)ap);
goto done;
}
if(ap->nextc)
{
/* if last character is a blank, then next work can be alias */
register int c = fcpeek(-1);
if(isblank(c))
lp->aliasok = 1;
*ap->buf = ap->nextc;
ap->nextc = 0;
sfsetbuf(iop,ap->buf,1);
return(1);
}
done:
if(np)
nv_offattr(np,NV_NOEXPAND);
return(0);
}
static void setupalias(Lex_t *lp, const char *string,Namval_t *np)
{
register Sfio_t *iop, *base;
struct alias *ap = (struct alias*)malloc(sizeof(struct alias));
ap->disc = alias_disc;
ap->lp = lp;
ap->buf[1] = 0;
if(ap->np = np)
{
#if SHOPT_KIA
if(lp->kiafile)
{
unsigned long r;
r=kiaentity(lp,nv_name(np),-1,'p',0,0,lp->current,'a',0,"");
sfprintf(lp->kiatmp,"p;%..64d;p;%..64d;%d;%d;e;\n",lp->current,r,lp->sh->inlineno,lp->sh->inlineno);
}
#endif /* SHOPT_KIA */
if((ap->nextc=fcget())==0)
ap->nextc = ' ';
}
else
ap->nextc = 0;
iop = sfopen(NIL(Sfio_t*),(char*)string,"s");
sfdisc(iop, &ap->disc);
lp->lexd.nocopy++;
if(!(base=fcfile()))
base = sfopen(NIL(Sfio_t*),fcseek(0),"s");
fcclose();
sfstack(base,iop);
fcfopen(base);
lp->lexd.nocopy--;
}
/*
* grow storage stack for nested constructs by STACK_ARRAY
*/
static int stack_grow(Lex_t *lp)
{
lp->lexd.lex_max += STACK_ARRAY;
if(lp->lexd.lex_match)
lp->lexd.lex_match = (int*)realloc((char*)lp->lexd.lex_match,sizeof(int)*lp->lexd.lex_max);
else
lp->lexd.lex_match = (int*)malloc(sizeof(int)*STACK_ARRAY);
return(lp->lexd.lex_match!=0);
}