2009-12-08 18:46:35 +00:00
|
|
|
/*
|
|
|
|
** Lexical analyzer.
|
2013-02-11 11:54:48 +00:00
|
|
|
** Copyright (C) 2005-2013 Mike Pall. See Copyright Notice in luajit.h
|
2009-12-08 18:46:35 +00:00
|
|
|
**
|
|
|
|
** Major portions taken verbatim or adapted from the Lua interpreter.
|
|
|
|
** Copyright (C) 1994-2008 Lua.org, PUC-Rio. See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define lj_lex_c
|
|
|
|
#define LUA_CORE
|
|
|
|
|
|
|
|
#include "lj_obj.h"
|
|
|
|
#include "lj_gc.h"
|
|
|
|
#include "lj_err.h"
|
2013-02-27 20:17:27 +00:00
|
|
|
#include "lj_buf.h"
|
2009-12-08 18:46:35 +00:00
|
|
|
#include "lj_str.h"
|
2010-12-24 00:31:39 +00:00
|
|
|
#if LJ_HASFFI
|
|
|
|
#include "lj_tab.h"
|
|
|
|
#include "lj_ctype.h"
|
|
|
|
#include "lj_cdata.h"
|
|
|
|
#include "lualib.h"
|
|
|
|
#endif
|
2011-01-09 16:48:25 +00:00
|
|
|
#include "lj_state.h"
|
2009-12-08 18:46:35 +00:00
|
|
|
#include "lj_lex.h"
|
|
|
|
#include "lj_parse.h"
|
2010-11-09 11:09:54 +00:00
|
|
|
#include "lj_char.h"
|
2012-08-25 21:02:29 +00:00
|
|
|
#include "lj_strscan.h"
|
2013-05-12 21:52:09 +00:00
|
|
|
#include "lj_strfmt.h"
|
2009-12-08 18:46:35 +00:00
|
|
|
|
|
|
|
/* Lua lexer token names. */
|
|
|
|
static const char *const tokennames[] = {
|
|
|
|
#define TKSTR1(name) #name,
|
|
|
|
#define TKSTR2(name, sym) #sym,
|
|
|
|
TKDEF(TKSTR1, TKSTR2)
|
|
|
|
#undef TKSTR1
|
|
|
|
#undef TKSTR2
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
/* -- Buffer handling ----------------------------------------------------- */
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
#define LEX_EOF (-1)
|
|
|
|
#define lex_iseol(ls) (ls->c == '\n' || ls->c == '\r')
|
2009-12-08 18:46:35 +00:00
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Get more input from reader. */
|
|
|
|
static LJ_NOINLINE LexChar lex_more(LexState *ls)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
|
|
|
size_t sz;
|
2013-02-28 01:31:30 +00:00
|
|
|
const char *p = ls->rfunc(ls->L, ls->rdata, &sz);
|
|
|
|
if (p == NULL || sz == 0) return LEX_EOF;
|
|
|
|
ls->pe = p + sz;
|
|
|
|
ls->p = p + 1;
|
|
|
|
return (LexChar)(uint8_t)p[0];
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Get next character. */
|
|
|
|
static LJ_AINLINE LexChar lex_next(LexState *ls)
|
|
|
|
{
|
2013-02-28 01:31:30 +00:00
|
|
|
return (ls->c = ls->p < ls->pe ? (LexChar)(uint8_t)*ls->p++ : lex_more(ls));
|
2013-02-28 00:11:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Save character. */
|
|
|
|
static LJ_AINLINE void lex_save(LexState *ls, LexChar c)
|
2010-11-01 16:53:04 +00:00
|
|
|
{
|
2013-02-28 12:37:56 +00:00
|
|
|
lj_buf_putb(&ls->sb, c);
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Save previous character and get next character. */
|
|
|
|
static LJ_AINLINE LexChar lex_savenext(LexState *ls)
|
|
|
|
{
|
|
|
|
lex_save(ls, ls->c);
|
|
|
|
return lex_next(ls);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Skip line break. Handles "\n", "\r", "\r\n" or "\n\r". */
|
|
|
|
static void lex_newline(LexState *ls)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar old = ls->c;
|
|
|
|
lua_assert(lex_iseol(ls));
|
|
|
|
lex_next(ls); /* Skip "\n" or "\r". */
|
|
|
|
if (lex_iseol(ls) && ls->c != old) lex_next(ls); /* Skip "\n\r" or "\r\n". */
|
2009-12-08 18:46:35 +00:00
|
|
|
if (++ls->linenumber >= LJ_MAX_LINE)
|
2013-02-28 00:11:49 +00:00
|
|
|
lj_lex_error(ls, ls->tok, LJ_ERR_XLINES);
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* -- Scanner for terminals ----------------------------------------------- */
|
|
|
|
|
2010-12-24 00:31:39 +00:00
|
|
|
/* Parse a number literal. */
|
|
|
|
static void lex_number(LexState *ls, TValue *tv)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2012-08-25 21:02:29 +00:00
|
|
|
StrScanFmt fmt;
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar c, xp = 'e';
|
|
|
|
lua_assert(lj_char_isdigit(ls->c));
|
|
|
|
if ((c = ls->c) == '0' && (lex_savenext(ls) | 0x20) == 'x')
|
|
|
|
xp = 'p';
|
|
|
|
while (lj_char_isident(ls->c) || ls->c == '.' ||
|
|
|
|
((ls->c == '-' || ls->c == '+') && (c | 0x20) == xp)) {
|
|
|
|
c = ls->c;
|
|
|
|
lex_savenext(ls);
|
2012-01-20 10:38:14 +00:00
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_save(ls, '\0');
|
2013-02-27 20:17:27 +00:00
|
|
|
fmt = lj_strscan_scan((const uint8_t *)sbufB(&ls->sb), tv,
|
2012-08-25 21:02:29 +00:00
|
|
|
(LJ_DUALNUM ? STRSCAN_OPT_TOINT : STRSCAN_OPT_TONUM) |
|
|
|
|
(LJ_HASFFI ? (STRSCAN_OPT_LL|STRSCAN_OPT_IMAG) : 0));
|
|
|
|
if (LJ_DUALNUM && fmt == STRSCAN_INT) {
|
|
|
|
setitype(tv, LJ_TISNUM);
|
|
|
|
} else if (fmt == STRSCAN_NUM) {
|
|
|
|
/* Already in correct format. */
|
2012-08-26 12:36:00 +00:00
|
|
|
#if LJ_HASFFI
|
|
|
|
} else if (fmt != STRSCAN_ERROR) {
|
2012-08-25 21:02:29 +00:00
|
|
|
lua_State *L = ls->L;
|
|
|
|
GCcdata *cd;
|
|
|
|
lua_assert(fmt == STRSCAN_I64 || fmt == STRSCAN_U64 || fmt == STRSCAN_IMAG);
|
|
|
|
if (!ctype_ctsG(G(L))) {
|
|
|
|
ptrdiff_t oldtop = savestack(L, L->top);
|
|
|
|
luaopen_ffi(L); /* Load FFI library on-demand. */
|
|
|
|
L->top = restorestack(L, oldtop);
|
2010-12-24 00:31:39 +00:00
|
|
|
}
|
2012-08-25 21:02:29 +00:00
|
|
|
if (fmt == STRSCAN_IMAG) {
|
|
|
|
cd = lj_cdata_new_(L, CTID_COMPLEX_DOUBLE, 2*sizeof(double));
|
|
|
|
((double *)cdataptr(cd))[0] = 0;
|
|
|
|
((double *)cdataptr(cd))[1] = numV(tv);
|
|
|
|
} else {
|
|
|
|
cd = lj_cdata_new_(L, fmt==STRSCAN_I64 ? CTID_INT64 : CTID_UINT64, 8);
|
|
|
|
*(uint64_t *)cdataptr(cd) = tv->u64;
|
2011-02-16 23:44:14 +00:00
|
|
|
}
|
2012-08-25 21:02:29 +00:00
|
|
|
lj_parse_keepcdata(ls, tv, cd);
|
2012-08-26 12:36:00 +00:00
|
|
|
#endif
|
2012-08-25 21:02:29 +00:00
|
|
|
} else {
|
|
|
|
lua_assert(fmt == STRSCAN_ERROR);
|
|
|
|
lj_lex_error(ls, TK_number, LJ_ERR_XNUMBER);
|
2010-12-24 00:31:39 +00:00
|
|
|
}
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Skip equal signs for "[=...=[" and "]=...=]" and return their count. */
|
|
|
|
static int lex_skipeq(LexState *ls)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar s = ls->c;
|
2009-12-08 18:46:35 +00:00
|
|
|
lua_assert(s == '[' || s == ']');
|
2013-02-28 00:11:49 +00:00
|
|
|
while (lex_savenext(ls) == '=')
|
2009-12-08 18:46:35 +00:00
|
|
|
count++;
|
2013-02-28 00:11:49 +00:00
|
|
|
return (ls->c == s) ? count : (-count) - 1;
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Parse a long string or long comment (tv set to NULL). */
|
|
|
|
static void lex_longstring(LexState *ls, TValue *tv, int sep)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_savenext(ls); /* Skip second '['. */
|
|
|
|
if (lex_iseol(ls)) /* Skip initial newline. */
|
|
|
|
lex_newline(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
for (;;) {
|
2013-02-28 00:11:49 +00:00
|
|
|
switch (ls->c) {
|
|
|
|
case LEX_EOF:
|
2009-12-08 18:46:35 +00:00
|
|
|
lj_lex_error(ls, TK_eof, tv ? LJ_ERR_XLSTR : LJ_ERR_XLCOM);
|
|
|
|
break;
|
|
|
|
case ']':
|
2013-02-28 00:11:49 +00:00
|
|
|
if (lex_skipeq(ls) == sep) {
|
|
|
|
lex_savenext(ls); /* Skip second ']'. */
|
2009-12-08 18:46:35 +00:00
|
|
|
goto endloop;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_save(ls, '\n');
|
|
|
|
lex_newline(ls);
|
2013-02-27 16:11:31 +00:00
|
|
|
if (!tv) lj_buf_reset(&ls->sb); /* Don't waste space for comments. */
|
2009-12-08 18:46:35 +00:00
|
|
|
break;
|
|
|
|
default:
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_savenext(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
} endloop:
|
|
|
|
if (tv) {
|
2013-02-27 20:17:27 +00:00
|
|
|
GCstr *str = lj_parse_keepstr(ls, sbufB(&ls->sb) + (2 + (MSize)sep),
|
|
|
|
sbuflen(&ls->sb) - 2*(2 + (MSize)sep));
|
2009-12-08 18:46:35 +00:00
|
|
|
setstrV(ls->L, tv, str);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Parse a string. */
|
|
|
|
static void lex_string(LexState *ls, TValue *tv)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar delim = ls->c; /* Delimiter is '\'' or '"'. */
|
|
|
|
lex_savenext(ls);
|
|
|
|
while (ls->c != delim) {
|
|
|
|
switch (ls->c) {
|
|
|
|
case LEX_EOF:
|
2009-12-08 18:46:35 +00:00
|
|
|
lj_lex_error(ls, TK_eof, LJ_ERR_XSTR);
|
|
|
|
continue;
|
|
|
|
case '\n':
|
|
|
|
case '\r':
|
|
|
|
lj_lex_error(ls, TK_string, LJ_ERR_XSTR);
|
|
|
|
continue;
|
|
|
|
case '\\': {
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar c = lex_next(ls); /* Skip the '\\'. */
|
2011-07-19 18:58:10 +00:00
|
|
|
switch (c) {
|
2009-12-08 18:46:35 +00:00
|
|
|
case 'a': c = '\a'; break;
|
|
|
|
case 'b': c = '\b'; break;
|
|
|
|
case 'f': c = '\f'; break;
|
|
|
|
case 'n': c = '\n'; break;
|
|
|
|
case 'r': c = '\r'; break;
|
|
|
|
case 't': c = '\t'; break;
|
|
|
|
case 'v': c = '\v'; break;
|
2010-11-19 16:39:33 +00:00
|
|
|
case 'x': /* Hexadecimal escape '\xXX'. */
|
2013-02-28 00:11:49 +00:00
|
|
|
c = (lex_next(ls) & 15u) << 4;
|
|
|
|
if (!lj_char_isdigit(ls->c)) {
|
|
|
|
if (!lj_char_isxdigit(ls->c)) goto err_xesc;
|
2010-11-19 16:39:33 +00:00
|
|
|
c += 9 << 4;
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
c += (lex_next(ls) & 15u);
|
|
|
|
if (!lj_char_isdigit(ls->c)) {
|
|
|
|
if (!lj_char_isxdigit(ls->c)) goto err_xesc;
|
2010-11-19 16:39:33 +00:00
|
|
|
c += 9;
|
|
|
|
}
|
|
|
|
break;
|
2011-07-19 18:58:10 +00:00
|
|
|
case 'z': /* Skip whitespace. */
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
while (lj_char_isspace(ls->c))
|
|
|
|
if (lex_iseol(ls)) lex_newline(ls); else lex_next(ls);
|
2010-11-22 21:22:12 +00:00
|
|
|
continue;
|
2013-02-28 00:11:49 +00:00
|
|
|
case '\n': case '\r': lex_save(ls, '\n'); lex_newline(ls); continue;
|
2011-07-19 18:58:10 +00:00
|
|
|
case '\\': case '\"': case '\'': break;
|
2013-02-28 00:11:49 +00:00
|
|
|
case LEX_EOF: continue;
|
2009-12-08 18:46:35 +00:00
|
|
|
default:
|
2011-07-19 18:58:10 +00:00
|
|
|
if (!lj_char_isdigit(c))
|
|
|
|
goto err_xesc;
|
|
|
|
c -= '0'; /* Decimal escape '\ddd'. */
|
2013-02-28 00:11:49 +00:00
|
|
|
if (lj_char_isdigit(lex_next(ls))) {
|
|
|
|
c = c*10 + (ls->c - '0');
|
|
|
|
if (lj_char_isdigit(lex_next(ls))) {
|
|
|
|
c = c*10 + (ls->c - '0');
|
2011-07-19 18:58:10 +00:00
|
|
|
if (c > 255) {
|
|
|
|
err_xesc:
|
|
|
|
lj_lex_error(ls, TK_string, LJ_ERR_XESC);
|
2010-11-19 16:39:33 +00:00
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
2010-11-19 16:39:33 +00:00
|
|
|
}
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_save(ls, c);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_save(ls, c);
|
|
|
|
lex_next(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
default:
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_savenext(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_savenext(ls); /* Skip trailing delimiter. */
|
2013-02-27 20:17:27 +00:00
|
|
|
setstrV(ls->L, tv,
|
|
|
|
lj_parse_keepstr(ls, sbufB(&ls->sb)+1, sbuflen(&ls->sb)-2));
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* -- Main lexical scanner ------------------------------------------------ */
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Get next lexical token. */
|
|
|
|
static LexToken lex_scan(LexState *ls, TValue *tv)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-27 16:11:31 +00:00
|
|
|
lj_buf_reset(&ls->sb);
|
2009-12-08 18:46:35 +00:00
|
|
|
for (;;) {
|
2013-02-28 00:11:49 +00:00
|
|
|
if (lj_char_isident(ls->c)) {
|
2009-12-08 18:46:35 +00:00
|
|
|
GCstr *s;
|
2013-02-28 00:11:49 +00:00
|
|
|
if (lj_char_isdigit(ls->c)) { /* Numeric literal. */
|
2010-12-24 00:31:39 +00:00
|
|
|
lex_number(ls, tv);
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_number;
|
|
|
|
}
|
|
|
|
/* Identifier or reserved word. */
|
|
|
|
do {
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_savenext(ls);
|
|
|
|
} while (lj_char_isident(ls->c));
|
2013-02-27 20:17:27 +00:00
|
|
|
s = lj_parse_keepstr(ls, sbufB(&ls->sb), sbuflen(&ls->sb));
|
2012-09-16 16:46:04 +00:00
|
|
|
setstrV(ls->L, tv, s);
|
2009-12-08 18:46:35 +00:00
|
|
|
if (s->reserved > 0) /* Reserved word? */
|
|
|
|
return TK_OFS + s->reserved;
|
|
|
|
return TK_name;
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
switch (ls->c) {
|
2009-12-08 18:46:35 +00:00
|
|
|
case '\n':
|
|
|
|
case '\r':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_newline(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
case ' ':
|
|
|
|
case '\t':
|
|
|
|
case '\v':
|
|
|
|
case '\f':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
case '-':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != '-') return '-';
|
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c == '[') { /* Long comment "--[=*[...]=*]". */
|
|
|
|
int sep = lex_skipeq(ls);
|
|
|
|
lj_buf_reset(&ls->sb); /* `lex_skipeq' may dirty the buffer */
|
2009-12-08 18:46:35 +00:00
|
|
|
if (sep >= 0) {
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_longstring(ls, NULL, sep);
|
2013-02-27 16:11:31 +00:00
|
|
|
lj_buf_reset(&ls->sb);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Short comment "--.*\n". */
|
|
|
|
while (!lex_iseol(ls) && ls->c != LEX_EOF)
|
|
|
|
lex_next(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
continue;
|
|
|
|
case '[': {
|
2013-02-28 00:11:49 +00:00
|
|
|
int sep = lex_skipeq(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
if (sep >= 0) {
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_longstring(ls, tv, sep);
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_string;
|
|
|
|
} else if (sep == -1) {
|
|
|
|
return '[';
|
|
|
|
} else {
|
|
|
|
lj_lex_error(ls, TK_string, LJ_ERR_XLDELIM);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
case '=':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != '=') return '='; else { lex_next(ls); return TK_eq; }
|
2009-12-08 18:46:35 +00:00
|
|
|
case '<':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != '=') return '<'; else { lex_next(ls); return TK_le; }
|
2009-12-08 18:46:35 +00:00
|
|
|
case '>':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != '=') return '>'; else { lex_next(ls); return TK_ge; }
|
2009-12-08 18:46:35 +00:00
|
|
|
case '~':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != '=') return '~'; else { lex_next(ls); return TK_ne; }
|
2012-09-16 16:46:04 +00:00
|
|
|
case ':':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c != ':') return ':'; else { lex_next(ls); return TK_label; }
|
2009-12-08 18:46:35 +00:00
|
|
|
case '"':
|
|
|
|
case '\'':
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_string(ls, tv);
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_string;
|
|
|
|
case '.':
|
2013-02-28 00:11:49 +00:00
|
|
|
if (lex_savenext(ls) == '.') {
|
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c == '.') {
|
|
|
|
lex_next(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_dots; /* ... */
|
2010-04-24 18:23:02 +00:00
|
|
|
}
|
|
|
|
return TK_concat; /* .. */
|
2013-02-28 00:11:49 +00:00
|
|
|
} else if (!lj_char_isdigit(ls->c)) {
|
2009-12-08 18:46:35 +00:00
|
|
|
return '.';
|
|
|
|
} else {
|
2010-12-24 00:31:39 +00:00
|
|
|
lex_number(ls, tv);
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_number;
|
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
case LEX_EOF:
|
2009-12-08 18:46:35 +00:00
|
|
|
return TK_eof;
|
|
|
|
default: {
|
2013-02-28 00:11:49 +00:00
|
|
|
LexChar c = ls->c;
|
|
|
|
lex_next(ls);
|
2009-12-08 18:46:35 +00:00
|
|
|
return c; /* Single-char tokens (+ - / ...). */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* -- Lexer API ----------------------------------------------------------- */
|
|
|
|
|
2010-02-08 04:26:52 +00:00
|
|
|
/* Setup lexer state. */
|
2011-06-12 22:58:13 +00:00
|
|
|
int lj_lex_setup(lua_State *L, LexState *ls)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2012-05-03 17:04:44 +00:00
|
|
|
int header = 0;
|
2009-12-08 18:46:35 +00:00
|
|
|
ls->L = L;
|
|
|
|
ls->fs = NULL;
|
2013-02-28 01:31:30 +00:00
|
|
|
ls->pe = ls->p = NULL;
|
2010-02-08 04:26:52 +00:00
|
|
|
ls->vstack = NULL;
|
|
|
|
ls->sizevstack = 0;
|
|
|
|
ls->vtop = 0;
|
2010-02-08 04:28:57 +00:00
|
|
|
ls->bcstack = NULL;
|
|
|
|
ls->sizebcstack = 0;
|
2009-12-08 18:46:35 +00:00
|
|
|
ls->lookahead = TK_eof; /* No look-ahead token. */
|
|
|
|
ls->linenumber = 1;
|
|
|
|
ls->lastline = 1;
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls); /* Read-ahead first char. */
|
2013-02-28 01:31:30 +00:00
|
|
|
if (ls->c == 0xef && ls->p + 2 <= ls->pe && (uint8_t)ls->p[0] == 0xbb &&
|
2013-02-28 00:11:49 +00:00
|
|
|
(uint8_t)ls->p[1] == 0xbf) { /* Skip UTF-8 BOM (if buffered). */
|
2009-12-08 18:46:35 +00:00
|
|
|
ls->p += 2;
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
2012-05-03 17:04:44 +00:00
|
|
|
header = 1;
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
if (ls->c == '#') { /* Skip POSIX #! header line. */
|
2009-12-08 18:46:35 +00:00
|
|
|
do {
|
2013-02-28 00:11:49 +00:00
|
|
|
lex_next(ls);
|
|
|
|
if (ls->c == LEX_EOF) return 0;
|
|
|
|
} while (!lex_iseol(ls));
|
|
|
|
lex_newline(ls);
|
2012-05-03 17:04:44 +00:00
|
|
|
header = 1;
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
2013-02-28 00:11:49 +00:00
|
|
|
if (ls->c == LUA_SIGNATURE[0]) { /* Bytecode dump. */
|
2012-05-03 17:04:44 +00:00
|
|
|
if (header) {
|
|
|
|
/*
|
|
|
|
** Loading bytecode with an extra header is disabled for security
|
|
|
|
** reasons. This may circumvent the usual check for bytecode vs.
|
|
|
|
** Lua code by looking at the first char. Since this is a potential
|
|
|
|
** security violation no attempt is made to echo the chunkname either.
|
|
|
|
*/
|
2012-09-21 14:32:24 +00:00
|
|
|
setstrV(L, L->top++, lj_err_str(L, LJ_ERR_BCBAD));
|
2012-05-03 17:04:44 +00:00
|
|
|
lj_err_throw(L, LUA_ERRSYNTAX);
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2010-02-08 04:26:52 +00:00
|
|
|
/* Cleanup lexer state. */
|
|
|
|
void lj_lex_cleanup(lua_State *L, LexState *ls)
|
|
|
|
{
|
|
|
|
global_State *g = G(L);
|
2010-02-08 04:28:57 +00:00
|
|
|
lj_mem_freevec(g, ls->bcstack, ls->sizebcstack, BCInsLine);
|
2010-02-08 04:26:52 +00:00
|
|
|
lj_mem_freevec(g, ls->vstack, ls->sizevstack, VarInfo);
|
2013-02-27 16:11:31 +00:00
|
|
|
lj_buf_free(g, &ls->sb);
|
2010-02-08 04:26:52 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Return next lexical token. */
|
2009-12-08 18:46:35 +00:00
|
|
|
void lj_lex_next(LexState *ls)
|
|
|
|
{
|
|
|
|
ls->lastline = ls->linenumber;
|
|
|
|
if (LJ_LIKELY(ls->lookahead == TK_eof)) { /* No lookahead token? */
|
2013-02-28 00:11:49 +00:00
|
|
|
ls->tok = lex_scan(ls, &ls->tokval); /* Get next token. */
|
2009-12-08 18:46:35 +00:00
|
|
|
} else { /* Otherwise return lookahead token. */
|
2013-02-28 00:11:49 +00:00
|
|
|
ls->tok = ls->lookahead;
|
2009-12-08 18:46:35 +00:00
|
|
|
ls->lookahead = TK_eof;
|
2013-02-28 00:11:49 +00:00
|
|
|
ls->tokval = ls->lookaheadval;
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Look ahead for the next token. */
|
2009-12-08 18:46:35 +00:00
|
|
|
LexToken lj_lex_lookahead(LexState *ls)
|
|
|
|
{
|
|
|
|
lua_assert(ls->lookahead == TK_eof);
|
2013-02-28 00:11:49 +00:00
|
|
|
ls->lookahead = lex_scan(ls, &ls->lookaheadval);
|
2009-12-08 18:46:35 +00:00
|
|
|
return ls->lookahead;
|
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Convert token to string. */
|
|
|
|
const char *lj_lex_token2str(LexState *ls, LexToken tok)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-28 00:11:49 +00:00
|
|
|
if (tok > TK_OFS)
|
|
|
|
return tokennames[tok-TK_OFS-1];
|
|
|
|
else if (!lj_char_iscntrl(tok))
|
2013-05-12 21:52:09 +00:00
|
|
|
return lj_strfmt_pushf(ls->L, "%c", tok);
|
2009-12-08 18:46:35 +00:00
|
|
|
else
|
2013-05-12 21:52:09 +00:00
|
|
|
return lj_strfmt_pushf(ls->L, "char(%d)", tok);
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Lexer error. */
|
|
|
|
void lj_lex_error(LexState *ls, LexToken tok, ErrMsg em, ...)
|
2009-12-08 18:46:35 +00:00
|
|
|
{
|
2013-02-28 00:11:49 +00:00
|
|
|
const char *tokstr;
|
2009-12-08 18:46:35 +00:00
|
|
|
va_list argp;
|
2013-02-28 00:11:49 +00:00
|
|
|
if (tok == 0) {
|
|
|
|
tokstr = NULL;
|
|
|
|
} else if (tok == TK_name || tok == TK_string || tok == TK_number) {
|
|
|
|
lex_save(ls, '\0');
|
|
|
|
tokstr = sbufB(&ls->sb);
|
2009-12-08 18:46:35 +00:00
|
|
|
} else {
|
2013-02-28 00:11:49 +00:00
|
|
|
tokstr = lj_lex_token2str(ls, tok);
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
va_start(argp, em);
|
2013-02-28 00:11:49 +00:00
|
|
|
lj_err_lex(ls->L, ls->chunkname, tokstr, ls->linenumber, em, argp);
|
2009-12-08 18:46:35 +00:00
|
|
|
va_end(argp);
|
|
|
|
}
|
|
|
|
|
2013-02-28 00:11:49 +00:00
|
|
|
/* Initialize strings for reserved words. */
|
2009-12-08 18:46:35 +00:00
|
|
|
void lj_lex_init(lua_State *L)
|
|
|
|
{
|
|
|
|
uint32_t i;
|
|
|
|
for (i = 0; i < TK_RESERVED; i++) {
|
|
|
|
GCstr *s = lj_str_newz(L, tokennames[i]);
|
|
|
|
fixstring(s); /* Reserved words are never collected. */
|
2011-02-16 23:44:14 +00:00
|
|
|
s->reserved = (uint8_t)(i+1);
|
2009-12-08 18:46:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|