|
@ -25,6 +25,9 @@ |
|
|
|
|
|
|
|
|
#define MAXUTF 0x7FFFFFFFu |
|
|
#define MAXUTF 0x7FFFFFFFu |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define MSGInvalid "invalid UTF-8 code" |
|
|
|
|
|
|
|
|
/*
|
|
|
/*
|
|
|
** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. |
|
|
** Integer type for decoded UTF-8 values; MAXUTF needs 31 bits. |
|
|
*/ |
|
|
*/ |
|
@ -35,7 +38,8 @@ typedef unsigned long utfint; |
|
|
#endif |
|
|
#endif |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define iscont(p) ((*(p) & 0xC0) == 0x80) |
|
|
#define iscont(c) (((c) & 0xC0) == 0x80) |
|
|
|
|
|
#define iscontp(p) iscont(*(p)) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* from strlib */ |
|
|
/* from strlib */ |
|
@ -65,7 +69,7 @@ static const char *utf8_decode (const char *s, utfint *val, int strict) { |
|
|
int count = 0; /* to count number of continuation bytes */ |
|
|
int count = 0; /* to count number of continuation bytes */ |
|
|
for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ |
|
|
for (; c & 0x40; c <<= 1) { /* while it needs continuation bytes... */ |
|
|
unsigned int cc = (unsigned char)s[++count]; /* read next byte */ |
|
|
unsigned int cc = (unsigned char)s[++count]; /* read next byte */ |
|
|
if ((cc & 0xC0) != 0x80) /* not a continuation byte? */ |
|
|
if (!iscont(cc)) /* not a continuation byte? */ |
|
|
return NULL; /* invalid byte sequence */ |
|
|
return NULL; /* invalid byte sequence */ |
|
|
res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ |
|
|
res = (res << 6) | (cc & 0x3F); /* add lower 6 bits from cont. byte */ |
|
|
} |
|
|
} |
|
@ -140,7 +144,7 @@ static int codepoint (lua_State *L) { |
|
|
utfint code; |
|
|
utfint code; |
|
|
s = utf8_decode(s, &code, !lax); |
|
|
s = utf8_decode(s, &code, !lax); |
|
|
if (s == NULL) |
|
|
if (s == NULL) |
|
|
return luaL_error(L, "invalid UTF-8 code"); |
|
|
return luaL_error(L, MSGInvalid); |
|
|
lua_pushinteger(L, code); |
|
|
lua_pushinteger(L, code); |
|
|
n++; |
|
|
n++; |
|
|
} |
|
|
} |
|
@ -190,16 +194,16 @@ static int byteoffset (lua_State *L) { |
|
|
"position out of bounds"); |
|
|
"position out of bounds"); |
|
|
if (n == 0) { |
|
|
if (n == 0) { |
|
|
/* find beginning of current byte sequence */ |
|
|
/* find beginning of current byte sequence */ |
|
|
while (posi > 0 && iscont(s + posi)) posi--; |
|
|
while (posi > 0 && iscontp(s + posi)) posi--; |
|
|
} |
|
|
} |
|
|
else { |
|
|
else { |
|
|
if (iscont(s + posi)) |
|
|
if (iscontp(s + posi)) |
|
|
return luaL_error(L, "initial position is a continuation byte"); |
|
|
return luaL_error(L, "initial position is a continuation byte"); |
|
|
if (n < 0) { |
|
|
if (n < 0) { |
|
|
while (n < 0 && posi > 0) { /* move back */ |
|
|
while (n < 0 && posi > 0) { /* move back */ |
|
|
do { /* find beginning of previous character */ |
|
|
do { /* find beginning of previous character */ |
|
|
posi--; |
|
|
posi--; |
|
|
} while (posi > 0 && iscont(s + posi)); |
|
|
} while (posi > 0 && iscontp(s + posi)); |
|
|
n++; |
|
|
n++; |
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
@ -208,7 +212,7 @@ static int byteoffset (lua_State *L) { |
|
|
while (n > 0 && posi < (lua_Integer)len) { |
|
|
while (n > 0 && posi < (lua_Integer)len) { |
|
|
do { /* find beginning of next character */ |
|
|
do { /* find beginning of next character */ |
|
|
posi++; |
|
|
posi++; |
|
|
} while (iscont(s + posi)); /* (cannot pass final '\0') */ |
|
|
} while (iscontp(s + posi)); /* (cannot pass final '\0') */ |
|
|
n--; |
|
|
n--; |
|
|
} |
|
|
} |
|
|
} |
|
|
} |
|
@ -226,15 +230,15 @@ static int iter_aux (lua_State *L, int strict) { |
|
|
const char *s = luaL_checklstring(L, 1, &len); |
|
|
const char *s = luaL_checklstring(L, 1, &len); |
|
|
lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); |
|
|
lua_Unsigned n = (lua_Unsigned)lua_tointeger(L, 2); |
|
|
if (n < len) { |
|
|
if (n < len) { |
|
|
while (iscont(s + n)) n++; /* skip continuation bytes */ |
|
|
while (iscontp(s + n)) n++; /* go to next character */ |
|
|
} |
|
|
} |
|
|
if (n >= len) /* (also handles original 'n' being negative) */ |
|
|
if (n >= len) /* (also handles original 'n' being negative) */ |
|
|
return 0; /* no more codepoints */ |
|
|
return 0; /* no more codepoints */ |
|
|
else { |
|
|
else { |
|
|
utfint code; |
|
|
utfint code; |
|
|
const char *next = utf8_decode(s + n, &code, strict); |
|
|
const char *next = utf8_decode(s + n, &code, strict); |
|
|
if (next == NULL) |
|
|
if (next == NULL || iscontp(next)) |
|
|
return luaL_error(L, "invalid UTF-8 code"); |
|
|
return luaL_error(L, MSGInvalid); |
|
|
lua_pushinteger(L, n + 1); |
|
|
lua_pushinteger(L, n + 1); |
|
|
lua_pushinteger(L, code); |
|
|
lua_pushinteger(L, code); |
|
|
return 2; |
|
|
return 2; |
|
@ -253,7 +257,8 @@ static int iter_auxlax (lua_State *L) { |
|
|
|
|
|
|
|
|
static int iter_codes (lua_State *L) { |
|
|
static int iter_codes (lua_State *L) { |
|
|
int lax = lua_toboolean(L, 2); |
|
|
int lax = lua_toboolean(L, 2); |
|
|
luaL_checkstring(L, 1); |
|
|
const char *s = luaL_checkstring(L, 1); |
|
|
|
|
|
luaL_argcheck(L, !iscontp(s), 1, MSGInvalid); |
|
|
lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); |
|
|
lua_pushcfunction(L, lax ? iter_auxlax : iter_auxstrict); |
|
|
lua_pushvalue(L, 1); |
|
|
lua_pushvalue(L, 1); |
|
|
lua_pushinteger(L, 0); |
|
|
lua_pushinteger(L, 0); |
|
|