mirror of
https://github.com/lua/lua
synced 2024-11-22 04:41:23 +03:00
314745ed84
Test files are more polite regarding the use of globals when locals would do, and when globals are necessary deleting them after use.
407 lines
9.7 KiB
Lua
407 lines
9.7 KiB
Lua
-- $Id: testes/constructs.lua $
|
|
-- See Copyright Notice in file all.lua
|
|
|
|
;;print "testing syntax";;
|
|
|
|
local debug = require "debug"
|
|
|
|
|
|
local function checkload (s, msg)
|
|
assert(string.find(select(2, load(s)), msg))
|
|
end
|
|
|
|
-- testing semicollons
|
|
local a
|
|
do ;;; end
|
|
; do ; a = 3; assert(a == 3) end;
|
|
;
|
|
|
|
|
|
-- invalid operations should not raise errors when not executed
|
|
if false then a = 3 // 0; a = 0 % 0 end
|
|
|
|
|
|
-- testing priorities
|
|
|
|
assert(2^3^2 == 2^(3^2));
|
|
assert(2^3*4 == (2^3)*4);
|
|
assert(2.0^-2 == 1/4 and -2^- -2 == - - -4);
|
|
assert(not nil and 2 and not(2>3 or 3<2));
|
|
assert(-3-1-5 == 0+0-9);
|
|
assert(-2^2 == -4 and (-2)^2 == 4 and 2*2-3-1 == 0);
|
|
assert(-3%5 == 2 and -3+5 == 2)
|
|
assert(2*1+3/3 == 3 and 1+2 .. 3*1 == "33");
|
|
assert(not(2+1 > 3*1) and "a".."b" > "a");
|
|
|
|
assert(0xF0 | 0xCC ~ 0xAA & 0xFD == 0xF4)
|
|
assert(0xFD & 0xAA ~ 0xCC | 0xF0 == 0xF4)
|
|
assert(0xF0 & 0x0F + 1 == 0x10)
|
|
|
|
assert(3^4//2^3//5 == 2)
|
|
|
|
assert(-3+4*5//2^3^2//9+4%10/3 == (-3)+(((4*5)//(2^(3^2)))//9)+((4%10)/3))
|
|
|
|
assert(not ((true or false) and nil))
|
|
assert( true or false and nil)
|
|
|
|
-- old bug
|
|
assert((((1 or false) and true) or false) == true)
|
|
assert((((nil and true) or false) and true) == false)
|
|
|
|
local a,b = 1,nil;
|
|
assert(-(1 or 2) == -1 and (1 and 2)+(-1.25 or -4) == 0.75);
|
|
local x = ((b or a)+1 == 2 and (10 or a)+1 == 11); assert(x);
|
|
x = (((2<3) or 1) == true and (2<3 and 4) == 4); assert(x);
|
|
|
|
local x, y = 1, 2;
|
|
assert((x>y) and x or y == 2);
|
|
x,y=2,1;
|
|
assert((x>y) and x or y == 2);
|
|
|
|
assert(1234567890 == tonumber('1234567890') and 1234567890+1 == 1234567891)
|
|
|
|
do -- testing operators with diffent kinds of constants
|
|
-- operands to consider:
|
|
-- * fit in register
|
|
-- * constant doesn't fit in register
|
|
-- * floats with integral values
|
|
local operand = {3, 100, 5.0, -10, -5.0, 10000, -10000}
|
|
local operator = {"+", "-", "*", "/", "//", "%", "^",
|
|
"&", "|", "^", "<<", ">>",
|
|
"==", "~=", "<", ">", "<=", ">=",}
|
|
for _, op in ipairs(operator) do
|
|
local f = assert(load(string.format([[return function (x,y)
|
|
return x %s y
|
|
end]], op)))();
|
|
for _, o1 in ipairs(operand) do
|
|
for _, o2 in ipairs(operand) do
|
|
local gab = f(o1, o2)
|
|
|
|
_ENV.XX = o1
|
|
local code = string.format("return XX %s %s", op, o2)
|
|
local res = assert(load(code))()
|
|
assert(res == gab)
|
|
|
|
_ENV.XX = o2
|
|
code = string.format("return (%s) %s XX", o1, op)
|
|
res = assert(load(code))()
|
|
assert(res == gab)
|
|
|
|
code = string.format("return (%s) %s %s", o1, op, o2)
|
|
res = assert(load(code))()
|
|
assert(res == gab)
|
|
end
|
|
end
|
|
end
|
|
_ENV.XX = nil
|
|
end
|
|
|
|
|
|
-- silly loops
|
|
repeat until 1; repeat until true;
|
|
while false do end; while nil do end;
|
|
|
|
do -- test old bug (first name could not be an `upvalue')
|
|
local a; local function f(x) x={a=1}; x={x=1}; x={G=1} end
|
|
end
|
|
|
|
|
|
do -- bug since 5.4.0
|
|
-- create code with a table using more than 256 constants
|
|
local code = {"local x = {"}
|
|
for i = 1, 257 do
|
|
code[#code + 1] = i .. ".1,"
|
|
end
|
|
code[#code + 1] = "};"
|
|
code = table.concat(code)
|
|
|
|
-- add "ret" to the end of that code and checks that
|
|
-- it produces the expected value "val"
|
|
local function check (ret, val)
|
|
local code = code .. ret
|
|
code = load(code)
|
|
assert(code() == val)
|
|
end
|
|
|
|
check("return (1 ~ (2 or 3))", 1 ~ 2)
|
|
check("return (1 | (2 or 3))", 1 | 2)
|
|
check("return (1 + (2 or 3))", 1 + 2)
|
|
check("return (1 << (2 or 3))", 1 << 2)
|
|
end
|
|
|
|
|
|
local function f (i)
|
|
if type(i) ~= 'number' then return i,'jojo'; end;
|
|
if i > 0 then return i, f(i-1); end;
|
|
end
|
|
|
|
x = {f(3), f(5), f(10);};
|
|
assert(x[1] == 3 and x[2] == 5 and x[3] == 10 and x[4] == 9 and x[12] == 1);
|
|
assert(x[nil] == nil)
|
|
x = {f'alo', f'xixi', nil};
|
|
assert(x[1] == 'alo' and x[2] == 'xixi' and x[3] == nil);
|
|
x = {f'alo'..'xixi'};
|
|
assert(x[1] == 'aloxixi')
|
|
x = {f{}}
|
|
assert(x[2] == 'jojo' and type(x[1]) == 'table')
|
|
|
|
|
|
local f = function (i)
|
|
if i < 10 then return 'a';
|
|
elseif i < 20 then return 'b';
|
|
elseif i < 30 then return 'c';
|
|
end;
|
|
end
|
|
|
|
assert(f(3) == 'a' and f(12) == 'b' and f(26) == 'c' and f(100) == nil)
|
|
|
|
for i=1,1000 do break; end;
|
|
local n=100;
|
|
local i=3;
|
|
local t = {};
|
|
local a=nil
|
|
while not a do
|
|
a=0; for i=1,n do for i=i,1,-1 do a=a+1; t[i]=1; end; end;
|
|
end
|
|
assert(a == n*(n+1)/2 and i==3);
|
|
assert(t[1] and t[n] and not t[0] and not t[n+1])
|
|
|
|
function f(b)
|
|
local x = 1;
|
|
repeat
|
|
local a;
|
|
if b==1 then local b=1; x=10; break
|
|
elseif b==2 then x=20; break;
|
|
elseif b==3 then x=30;
|
|
else local a,b,c,d=math.sin(1); x=x+1;
|
|
end
|
|
until x>=12;
|
|
return x;
|
|
end;
|
|
|
|
assert(f(1) == 10 and f(2) == 20 and f(3) == 30 and f(4)==12)
|
|
|
|
|
|
local f = function (i)
|
|
if i < 10 then return 'a'
|
|
elseif i < 20 then return 'b'
|
|
elseif i < 30 then return 'c'
|
|
else return 8
|
|
end
|
|
end
|
|
|
|
assert(f(3) == 'a' and f(12) == 'b' and f(26) == 'c' and f(100) == 8)
|
|
|
|
local a, b = nil, 23
|
|
x = {f(100)*2+3 or a, a or b+2}
|
|
assert(x[1] == 19 and x[2] == 25)
|
|
x = {f=2+3 or a, a = b+2}
|
|
assert(x.f == 5 and x.a == 25)
|
|
|
|
a={y=1}
|
|
x = {a.y}
|
|
assert(x[1] == 1)
|
|
|
|
local function f (i)
|
|
while 1 do
|
|
if i>0 then i=i-1;
|
|
else return; end;
|
|
end;
|
|
end;
|
|
|
|
local function g(i)
|
|
while 1 do
|
|
if i>0 then i=i-1
|
|
else return end
|
|
end
|
|
end
|
|
|
|
f(10); g(10);
|
|
|
|
do
|
|
function f () return 1,2,3; end
|
|
local a, b, c = f();
|
|
assert(a==1 and b==2 and c==3)
|
|
a, b, c = (f());
|
|
assert(a==1 and b==nil and c==nil)
|
|
end
|
|
|
|
local a,b = 3 and f();
|
|
assert(a==1 and b==nil)
|
|
|
|
function g() f(); return; end;
|
|
assert(g() == nil)
|
|
function g() return nil or f() end
|
|
a,b = g()
|
|
assert(a==1 and b==nil)
|
|
|
|
print'+';
|
|
|
|
do -- testing constants
|
|
local prog <const> = [[local x <XXX> = 10]]
|
|
checkload(prog, "unknown attribute 'XXX'")
|
|
|
|
checkload([[local xxx <const> = 20; xxx = 10]],
|
|
":1: attempt to assign to const variable 'xxx'")
|
|
|
|
checkload([[
|
|
local xx;
|
|
local xxx <const> = 20;
|
|
local yyy;
|
|
local function foo ()
|
|
local abc = xx + yyy + xxx;
|
|
return function () return function () xxx = yyy end end
|
|
end
|
|
]], ":6: attempt to assign to const variable 'xxx'")
|
|
|
|
checkload([[
|
|
local x <close> = nil
|
|
x = io.open()
|
|
]], ":2: attempt to assign to const variable 'x'")
|
|
end
|
|
|
|
f = [[
|
|
return function ( a , b , c , d , e )
|
|
local x = a >= b or c or ( d and e ) or nil
|
|
return x
|
|
end , { a = 1 , b = 2 >= 1 , } or { 1 };
|
|
]]
|
|
f = string.gsub(f, "%s+", "\n"); -- force a SETLINE between opcodes
|
|
f,a = load(f)();
|
|
assert(a.a == 1 and a.b)
|
|
|
|
function g (a,b,c,d,e)
|
|
if not (a>=b or c or d and e or nil) then return 0; else return 1; end;
|
|
end
|
|
|
|
local function h (a,b,c,d,e)
|
|
while (a>=b or c or (d and e) or nil) do return 1; end;
|
|
return 0;
|
|
end;
|
|
|
|
assert(f(2,1) == true and g(2,1) == 1 and h(2,1) == 1)
|
|
assert(f(1,2,'a') == 'a' and g(1,2,'a') == 1 and h(1,2,'a') == 1)
|
|
assert(f(1,2,'a')
|
|
~= -- force SETLINE before nil
|
|
nil, "")
|
|
assert(f(1,2,'a') == 'a' and g(1,2,'a') == 1 and h(1,2,'a') == 1)
|
|
assert(f(1,2,nil,1,'x') == 'x' and g(1,2,nil,1,'x') == 1 and
|
|
h(1,2,nil,1,'x') == 1)
|
|
assert(f(1,2,nil,nil,'x') == nil and g(1,2,nil,nil,'x') == 0 and
|
|
h(1,2,nil,nil,'x') == 0)
|
|
assert(f(1,2,nil,1,nil) == nil and g(1,2,nil,1,nil) == 0 and
|
|
h(1,2,nil,1,nil) == 0)
|
|
|
|
assert(1 and 2<3 == true and 2<3 and 'a'<'b' == true)
|
|
x = 2<3 and not 3; assert(x==false)
|
|
x = 2<1 or (2>1 and 'a'); assert(x=='a')
|
|
|
|
|
|
do
|
|
local a; if nil then a=1; else a=2; end; -- this nil comes as PUSHNIL 2
|
|
assert(a==2)
|
|
end
|
|
|
|
local function F (a)
|
|
assert(debug.getinfo(1, "n").name == 'F')
|
|
return a,2,3
|
|
end
|
|
|
|
a,b = F(1)~=nil; assert(a == true and b == nil);
|
|
a,b = F(nil)==nil; assert(a == true and b == nil)
|
|
|
|
----------------------------------------------------------------
|
|
------------------------------------------------------------------
|
|
|
|
-- sometimes will be 0, sometimes will not...
|
|
_ENV.GLOB1 = math.random(0, 1)
|
|
|
|
-- basic expressions with their respective values
|
|
local basiccases = {
|
|
{"nil", nil},
|
|
{"false", false},
|
|
{"true", true},
|
|
{"10", 10},
|
|
{"(0==_ENV.GLOB1)", 0 == _ENV.GLOB1},
|
|
}
|
|
|
|
local prog
|
|
|
|
if _ENV.GLOB1 == 0 then
|
|
basiccases[2][1] = "F" -- constant false
|
|
|
|
prog = [[
|
|
local F <const> = false
|
|
if %s then IX = true end
|
|
return %s
|
|
]]
|
|
else
|
|
basiccases[4][1] = "k10" -- constant 10
|
|
|
|
prog = [[
|
|
local k10 <const> = 10
|
|
if %s then IX = true end
|
|
return %s
|
|
]]
|
|
end
|
|
|
|
print('testing short-circuit optimizations (' .. _ENV.GLOB1 .. ')')
|
|
|
|
|
|
-- operators with their respective values
|
|
local binops <const> = {
|
|
{" and ", function (a,b) if not a then return a else return b end end},
|
|
{" or ", function (a,b) if a then return a else return b end end},
|
|
}
|
|
|
|
local cases <const> = {}
|
|
|
|
-- creates all combinations of '(cases[i] op cases[n-i])' plus
|
|
-- 'not(cases[i] op cases[n-i])' (syntax + value)
|
|
local function createcases (n)
|
|
local res = {}
|
|
for i = 1, n - 1 do
|
|
for _, v1 in ipairs(cases[i]) do
|
|
for _, v2 in ipairs(cases[n - i]) do
|
|
for _, op in ipairs(binops) do
|
|
local t = {
|
|
"(" .. v1[1] .. op[1] .. v2[1] .. ")",
|
|
op[2](v1[2], v2[2])
|
|
}
|
|
res[#res + 1] = t
|
|
res[#res + 1] = {"not" .. t[1], not t[2]}
|
|
end
|
|
end
|
|
end
|
|
end
|
|
return res
|
|
end
|
|
|
|
-- do not do too many combinations for soft tests
|
|
local level = _soft and 3 or 4
|
|
|
|
cases[1] = basiccases
|
|
for i = 2, level do cases[i] = createcases(i) end
|
|
print("+")
|
|
|
|
local i = 0
|
|
for n = 1, level do
|
|
for _, v in pairs(cases[n]) do
|
|
local s = v[1]
|
|
local p = load(string.format(prog, s, s), "")
|
|
IX = false
|
|
assert(p() == v[2] and IX == not not v[2])
|
|
i = i + 1
|
|
if i % 60000 == 0 then print('+') end
|
|
end
|
|
end
|
|
IX = nil
|
|
_G.GLOB1 = nil
|
|
------------------------------------------------------------------
|
|
|
|
-- testing some syntax errors (chosen through 'gcov')
|
|
checkload("for x do", "expected")
|
|
checkload("x:call", "expected")
|
|
|
|
print'OK'
|