580 lines
16 KiB
Rust
580 lines
16 KiB
Rust
//! MLua compatibility layer for Lua 5.1/JIT
|
|
//!
|
|
//! Based on github.com/keplerproject/lua-compat-5.3
|
|
|
|
use std::convert::TryInto;
|
|
use std::mem;
|
|
use std::os::raw::{c_char, c_int, c_void};
|
|
use std::ptr;
|
|
|
|
use super::lauxlib::*;
|
|
use super::lua::*;
|
|
|
|
#[inline(always)]
|
|
unsafe fn compat53_reverse(L: *mut lua_State, mut a: c_int, mut b: c_int) {
|
|
while a < b {
|
|
lua_pushvalue(L, a);
|
|
lua_pushvalue(L, b);
|
|
lua_replace(L, a);
|
|
lua_replace(L, b);
|
|
a += 1;
|
|
b -= 1;
|
|
}
|
|
}
|
|
|
|
const COMPAT53_LEVELS1: c_int = 12; // size of the first part of the stack
|
|
const COMPAT53_LEVELS2: c_int = 10; // size of the second part of the stack
|
|
|
|
unsafe fn compat53_countlevels(L: *mut lua_State) -> c_int {
|
|
let mut ar: lua_Debug = mem::zeroed();
|
|
let (mut li, mut le) = (1, 1);
|
|
// find an upper bound
|
|
while lua_getstack(L, le, &mut ar) != 0 {
|
|
li = le;
|
|
le *= 2;
|
|
}
|
|
// do a binary search
|
|
while li < le {
|
|
let m = (li + le) / 2;
|
|
if lua_getstack(L, m, &mut ar) != 0 {
|
|
li = m + 1
|
|
} else {
|
|
le = m;
|
|
}
|
|
}
|
|
le - 1
|
|
}
|
|
|
|
unsafe fn compat53_checkmode(
|
|
L: *mut lua_State,
|
|
mode: *const c_char,
|
|
modename: *const c_char,
|
|
err: c_int,
|
|
) -> c_int {
|
|
unsafe fn strchr(s: *const c_char, c: c_char) -> *const c_char {
|
|
let mut st = s;
|
|
while *st != 0 && *st != c {
|
|
st = st.offset(1);
|
|
}
|
|
if *st == c {
|
|
st
|
|
} else {
|
|
ptr::null()
|
|
}
|
|
}
|
|
|
|
if !mode.is_null() && strchr(mode, *modename).is_null() {
|
|
lua_pushfstring(
|
|
L,
|
|
cstr!("attempt to load a %s chunk (mode is '%s')"),
|
|
modename,
|
|
mode,
|
|
);
|
|
return err;
|
|
}
|
|
LUA_OK
|
|
}
|
|
|
|
unsafe fn compat53_findfield(L: *mut lua_State, objidx: c_int, level: c_int) -> c_int {
|
|
if level == 0 || lua_istable(L, -1) == 0 {
|
|
return 0; // not found
|
|
}
|
|
|
|
lua_pushnil(L); // start 'next' loop
|
|
while lua_next(L, -2) != 0 {
|
|
// for each pair in table
|
|
if lua_type(L, -2) == LUA_TSTRING {
|
|
// ignore non-string keys
|
|
if lua_rawequal(L, objidx, -1) != 0 {
|
|
// found object?
|
|
lua_pop(L, 1); // remove value (but keep name)
|
|
return 1;
|
|
} else if compat53_findfield(L, objidx, level - 1) != 0 {
|
|
// try recursively
|
|
lua_remove(L, -2); // remove table (but keep name)
|
|
lua_pushliteral(L, ".");
|
|
lua_insert(L, -2); // place '.' between the two names
|
|
lua_concat(L, 3);
|
|
return 1;
|
|
}
|
|
}
|
|
lua_pop(L, 1); // remove value
|
|
}
|
|
0 // not found
|
|
}
|
|
|
|
unsafe fn compat53_pushglobalfuncname(L: *mut lua_State, ar: *mut lua_Debug) -> c_int {
|
|
let top = lua_gettop(L);
|
|
lua_getinfo(L, cstr!("f"), ar); // push function
|
|
lua_pushvalue(L, LUA_GLOBALSINDEX);
|
|
if compat53_findfield(L, top + 1, 2) != 0 {
|
|
lua_copy(L, -1, top + 1); // move name to proper place
|
|
lua_pop(L, 2); // remove pushed values
|
|
1
|
|
} else {
|
|
lua_settop(L, top); // remove function and global table
|
|
0
|
|
}
|
|
}
|
|
|
|
unsafe fn compat53_pushfuncname(L: *mut lua_State, ar: *mut lua_Debug) {
|
|
if *(*ar).namewhat != b'\0' as c_char {
|
|
// is there a name?
|
|
lua_pushfstring(L, cstr!("function '%s'"), (*ar).name);
|
|
} else if *(*ar).what == b'm' as c_char {
|
|
// main?
|
|
lua_pushliteral(L, "main chunk");
|
|
} else if *(*ar).what == b'C' as c_char {
|
|
if compat53_pushglobalfuncname(L, ar) != 0 {
|
|
lua_pushfstring(L, cstr!("function '%s'"), lua_tostring(L, -1));
|
|
lua_remove(L, -2); // remove name
|
|
} else {
|
|
lua_pushliteral(L, "?");
|
|
}
|
|
} else {
|
|
lua_pushfstring(
|
|
L,
|
|
cstr!("function <%s:%d>"),
|
|
(*ar).short_src.as_ptr(),
|
|
(*ar).linedefined,
|
|
);
|
|
}
|
|
}
|
|
|
|
//
|
|
// lua ported functions
|
|
//
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_absindex(L: *mut lua_State, mut idx: c_int) -> c_int {
|
|
if idx < 0 && idx > LUA_REGISTRYINDEX {
|
|
idx += lua_gettop(L) + 1;
|
|
}
|
|
idx
|
|
}
|
|
|
|
pub unsafe fn lua_rotate(L: *mut lua_State, mut idx: c_int, mut n: c_int) {
|
|
idx = lua_absindex(L, idx);
|
|
if n > 0 {
|
|
// Faster version
|
|
for _ in 0..n {
|
|
lua_insert(L, idx);
|
|
}
|
|
return;
|
|
}
|
|
let n_elems = lua_gettop(L) - idx + 1;
|
|
if n < 0 {
|
|
n += n_elems;
|
|
}
|
|
if n > 0 && n < n_elems {
|
|
luaL_checkstack(L, 2, cstr!("not enough stack slots available"));
|
|
n = n_elems - n;
|
|
compat53_reverse(L, idx, idx + n - 1);
|
|
compat53_reverse(L, idx + n, idx + n_elems - 1);
|
|
compat53_reverse(L, idx, idx + n_elems - 1);
|
|
}
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_copy(L: *mut lua_State, fromidx: c_int, toidx: c_int) {
|
|
let abs_to = lua_absindex(L, toidx);
|
|
luaL_checkstack(L, 1, cstr!("not enough stack slots"));
|
|
lua_pushvalue(L, fromidx);
|
|
lua_replace(L, abs_to);
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_isinteger(L: *mut lua_State, idx: c_int) -> c_int {
|
|
if lua_type(L, idx) == LUA_TNUMBER {
|
|
let n = lua_tonumber(L, idx);
|
|
let i = lua_tointeger(L, idx);
|
|
if (n - i as lua_Number).abs() < lua_Number::EPSILON {
|
|
return 1;
|
|
}
|
|
}
|
|
0
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_tointeger(L: *mut lua_State, i: c_int) -> lua_Integer {
|
|
lua_tointegerx(L, i, ptr::null_mut())
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_tonumberx(L: *mut lua_State, i: c_int, isnum: *mut c_int) -> lua_Number {
|
|
let n = lua_tonumber(L, i);
|
|
if !isnum.is_null() {
|
|
*isnum = (n != 0.0 || lua_isnumber(L, i) != 0) as c_int;
|
|
}
|
|
n
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_tointegerx(L: *mut lua_State, i: c_int, isnum: *mut c_int) -> lua_Integer {
|
|
let mut ok = 0;
|
|
let n = lua_tonumberx(L, i, &mut ok);
|
|
let n_int = n as lua_Integer;
|
|
if ok != 0 && (n - n_int as lua_Number).abs() < lua_Number::EPSILON {
|
|
if !isnum.is_null() {
|
|
*isnum = 1;
|
|
}
|
|
return n_int;
|
|
}
|
|
if !isnum.is_null() {
|
|
*isnum = 0;
|
|
}
|
|
0
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawlen(L: *mut lua_State, idx: c_int) -> usize {
|
|
lua_objlen(L, idx)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_pushlstring(L: *mut lua_State, s: *const c_char, l: usize) -> *const c_char {
|
|
if l == 0 {
|
|
lua_pushlstring_(L, cstr!(""), 0);
|
|
} else {
|
|
lua_pushlstring_(L, s, l);
|
|
}
|
|
lua_tostring(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_pushstring(L: *mut lua_State, s: *const c_char) -> *const c_char {
|
|
lua_pushstring_(L, s);
|
|
lua_tostring(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_getglobal(L: *mut lua_State, var: *const c_char) -> c_int {
|
|
lua_getglobal_(L, var);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_gettable(L: *mut lua_State, idx: c_int) -> c_int {
|
|
lua_gettable_(L, idx);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_getfield(L: *mut lua_State, idx: c_int, k: *const c_char) -> c_int {
|
|
lua_getfield_(L, idx, k);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_geti(L: *mut lua_State, mut idx: c_int, n: lua_Integer) -> c_int {
|
|
idx = lua_absindex(L, idx);
|
|
lua_pushinteger(L, n);
|
|
lua_gettable(L, idx)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawget(L: *mut lua_State, idx: c_int) -> c_int {
|
|
lua_rawget_(L, idx);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawgeti(L: *mut lua_State, idx: c_int, n: lua_Integer) -> c_int {
|
|
let n = n.try_into().expect("cannot convert index to lua_Integer");
|
|
lua_rawgeti_(L, idx, n);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawgetp(L: *mut lua_State, idx: c_int, p: *const c_void) -> c_int {
|
|
let abs_i = lua_absindex(L, idx);
|
|
lua_pushlightuserdata(L, p as *mut c_void);
|
|
lua_rawget(L, abs_i)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_getuservalue(L: *mut lua_State, idx: c_int) -> c_int {
|
|
lua_getfenv(L, idx);
|
|
lua_type(L, -1)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_seti(L: *mut lua_State, mut idx: c_int, n: lua_Integer) {
|
|
luaL_checkstack(L, 1, cstr!("not enough stack slots available"));
|
|
idx = lua_absindex(L, idx);
|
|
lua_pushinteger(L, n);
|
|
lua_insert(L, -2);
|
|
lua_settable(L, idx);
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawseti(L: *mut lua_State, idx: c_int, n: lua_Integer) {
|
|
let n = n.try_into().expect("cannot convert index from lua_Integer");
|
|
lua_rawseti_(L, idx, n)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_rawsetp(L: *mut lua_State, idx: c_int, p: *const c_void) {
|
|
let abs_i = lua_absindex(L, idx);
|
|
luaL_checkstack(L, 1, cstr!("not enough stack slots"));
|
|
lua_pushlightuserdata(L, p as *mut c_void);
|
|
lua_insert(L, -2);
|
|
lua_rawset(L, abs_i);
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_setuservalue(L: *mut lua_State, idx: c_int) {
|
|
luaL_checktype(L, -1, LUA_TTABLE);
|
|
lua_setfenv(L, idx);
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_dump(
|
|
L: *mut lua_State,
|
|
writer: lua_Writer,
|
|
data: *mut c_void,
|
|
_strip: c_int,
|
|
) -> c_int {
|
|
lua_dump_(L, writer, data)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_len(L: *mut lua_State, idx: c_int) {
|
|
match lua_type(L, idx) {
|
|
LUA_TSTRING => {
|
|
lua_pushnumber(L, lua_objlen(L, idx) as lua_Number);
|
|
}
|
|
LUA_TTABLE => {
|
|
if luaL_callmeta(L, idx, cstr!("__len")) == 0 {
|
|
lua_pushnumber(L, lua_objlen(L, idx) as lua_Number);
|
|
}
|
|
}
|
|
LUA_TUSERDATA if luaL_callmeta(L, idx, cstr!("__len")) != 0 => {}
|
|
_ => {
|
|
luaL_error(
|
|
L,
|
|
cstr!("attempt to get length of a %s value"),
|
|
lua_typename(L, lua_type(L, idx)),
|
|
);
|
|
}
|
|
}
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_pushglobaltable(L: *mut lua_State) {
|
|
lua_pushvalue(L, LUA_GLOBALSINDEX);
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn lua_resume(
|
|
L: *mut lua_State,
|
|
_from: *mut lua_State,
|
|
narg: c_int,
|
|
nres: *mut c_int,
|
|
) -> c_int {
|
|
let ret = lua_resume_(L, narg);
|
|
if (ret == LUA_OK || ret == LUA_YIELD) && !(nres.is_null()) {
|
|
*nres = lua_gettop(L);
|
|
}
|
|
ret
|
|
}
|
|
|
|
//
|
|
// lauxlib ported functions
|
|
//
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_checkstack(L: *mut lua_State, sz: c_int, msg: *const c_char) {
|
|
if lua_checkstack(L, sz + LUA_MINSTACK) == 0 {
|
|
if !msg.is_null() {
|
|
luaL_error(L, cstr!("stack overflow (%s)"), msg);
|
|
} else {
|
|
lua_pushliteral(L, "stack overflow");
|
|
lua_error(L);
|
|
}
|
|
}
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_getmetafield(L: *mut lua_State, obj: c_int, e: *const c_char) -> c_int {
|
|
if luaL_getmetafield_(L, obj, e) != 0 {
|
|
lua_type(L, -1)
|
|
} else {
|
|
LUA_TNIL
|
|
}
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_newmetatable(L: *mut lua_State, tname: *const c_char) -> c_int {
|
|
if luaL_newmetatable_(L, tname) != 0 {
|
|
lua_pushstring_(L, tname);
|
|
lua_setfield(L, -2, cstr!("__name"));
|
|
1
|
|
} else {
|
|
0
|
|
}
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_loadbufferx(
|
|
L: *mut lua_State,
|
|
buff: *const c_char,
|
|
sz: usize,
|
|
name: *const c_char,
|
|
mode: *const c_char,
|
|
) -> c_int {
|
|
let status = if sz > 0 && *buff as u8 == LUA_SIGNATURE[0] {
|
|
compat53_checkmode(L, mode, cstr!("binary"), LUA_ERRSYNTAX)
|
|
} else {
|
|
compat53_checkmode(L, mode, cstr!("text"), LUA_ERRSYNTAX)
|
|
};
|
|
if status != LUA_OK {
|
|
return status;
|
|
}
|
|
luaL_loadbuffer(L, buff, sz, name)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_len(L: *mut lua_State, idx: c_int) -> lua_Integer {
|
|
let mut isnum = 0;
|
|
luaL_checkstack(L, 1, cstr!("not enough stack slots"));
|
|
lua_len(L, idx);
|
|
let res = lua_tointegerx(L, -1, &mut isnum);
|
|
lua_pop(L, 1);
|
|
if isnum == 0 {
|
|
luaL_error(L, cstr!("object length is not an integer"));
|
|
}
|
|
res
|
|
}
|
|
|
|
pub unsafe fn luaL_traceback(
|
|
L: *mut lua_State,
|
|
L1: *mut lua_State,
|
|
msg: *const c_char,
|
|
mut level: c_int,
|
|
) {
|
|
let mut ar: lua_Debug = mem::zeroed();
|
|
let top = lua_gettop(L);
|
|
let numlevels = compat53_countlevels(L1);
|
|
let mark = if numlevels > COMPAT53_LEVELS1 + COMPAT53_LEVELS2 {
|
|
COMPAT53_LEVELS1
|
|
} else {
|
|
0
|
|
};
|
|
|
|
if !msg.is_null() {
|
|
lua_pushfstring(L, cstr!("%s\n"), msg);
|
|
}
|
|
lua_pushliteral(L, "stack traceback:");
|
|
while lua_getstack(L1, level, &mut ar) != 0 {
|
|
level += 1;
|
|
if level == mark {
|
|
// too many levels?
|
|
lua_pushliteral(L, "\n\t..."); // add a '...'
|
|
level = numlevels - COMPAT53_LEVELS2; // and skip to last ones
|
|
} else {
|
|
lua_getinfo(L1, cstr!("Slnt"), &mut ar);
|
|
lua_pushfstring(L, cstr!("\n\t%s:"), ar.short_src.as_ptr());
|
|
if ar.currentline > 0 {
|
|
lua_pushfstring(L, cstr!("%d:"), ar.currentline);
|
|
}
|
|
lua_pushliteral(L, " in ");
|
|
compat53_pushfuncname(L, &mut ar);
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
}
|
|
}
|
|
lua_concat(L, lua_gettop(L) - top);
|
|
}
|
|
|
|
pub unsafe fn luaL_tolstring(L: *mut lua_State, mut idx: c_int, len: *mut usize) -> *const c_char {
|
|
idx = lua_absindex(L, idx);
|
|
if luaL_callmeta(L, idx, cstr!("__tostring")) == 0 {
|
|
match lua_type(L, idx) {
|
|
LUA_TNIL => {
|
|
lua_pushliteral(L, "nil");
|
|
}
|
|
LUA_TSTRING | LUA_TNUMBER => {
|
|
lua_pushvalue(L, idx);
|
|
}
|
|
LUA_TBOOLEAN => {
|
|
if lua_toboolean(L, idx) == 0 {
|
|
lua_pushliteral(L, "false");
|
|
} else {
|
|
lua_pushliteral(L, "true");
|
|
}
|
|
}
|
|
t => {
|
|
let tt = luaL_getmetafield(L, idx, cstr!("__name"));
|
|
let name = if tt == LUA_TSTRING {
|
|
lua_tostring(L, -1)
|
|
} else {
|
|
lua_typename(L, t)
|
|
};
|
|
lua_pushfstring(L, cstr!("%s: %p"), name, lua_topointer(L, idx));
|
|
if tt != LUA_TNIL {
|
|
lua_replace(L, -2); // remove '__name'
|
|
}
|
|
}
|
|
};
|
|
} else if lua_isstring(L, -1) == 0 {
|
|
luaL_error(L, cstr!("'__tostring' must return a string"));
|
|
}
|
|
lua_tolstring(L, -1, len)
|
|
}
|
|
|
|
#[inline(always)]
|
|
pub unsafe fn luaL_setmetatable(L: *mut lua_State, tname: *const c_char) {
|
|
luaL_checkstack(L, 1, cstr!("not enough stack slots"));
|
|
luaL_getmetatable(L, tname);
|
|
lua_setmetatable(L, -2);
|
|
}
|
|
|
|
pub unsafe fn luaL_getsubtable(L: *mut lua_State, idx: c_int, fname: *const c_char) -> c_int {
|
|
let abs_i = lua_absindex(L, idx);
|
|
luaL_checkstack(L, 3, cstr!("not enough stack slots"));
|
|
lua_pushstring_(L, fname);
|
|
if lua_gettable(L, abs_i) == LUA_TTABLE {
|
|
return 1;
|
|
}
|
|
lua_pop(L, 1);
|
|
lua_newtable(L);
|
|
lua_pushstring_(L, fname);
|
|
lua_pushvalue(L, -2);
|
|
lua_settable(L, abs_i);
|
|
0
|
|
}
|
|
|
|
pub unsafe fn luaL_requiref(
|
|
L: *mut lua_State,
|
|
modname: *const c_char,
|
|
openf: lua_CFunction,
|
|
glb: c_int,
|
|
) {
|
|
luaL_checkstack(L, 3, cstr!("not enough stack slots available"));
|
|
luaL_getsubtable(L, LUA_REGISTRYINDEX, cstr!("_LOADED"));
|
|
if lua_getfield(L, -1, modname) == LUA_TNIL {
|
|
lua_pop(L, 1);
|
|
lua_pushcfunction(L, openf);
|
|
lua_pushstring(L, modname);
|
|
#[cfg(feature = "lua51")]
|
|
{
|
|
lua_call(L, 1, 1);
|
|
lua_pushvalue(L, -1);
|
|
lua_setfield(L, -3, modname);
|
|
}
|
|
#[cfg(feature = "luajit")]
|
|
{
|
|
lua_call(L, 1, 0);
|
|
lua_getfield(L, -1, modname);
|
|
}
|
|
}
|
|
if glb != 0 {
|
|
lua_pushvalue(L, -1);
|
|
lua_setglobal(L, modname);
|
|
} else {
|
|
lua_pushnil(L);
|
|
lua_setglobal(L, modname);
|
|
}
|
|
lua_replace(L, -2);
|
|
}
|