123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577 |
- -- $Id: testes/calls.lua $
- -- See Copyright Notice in file lua.h
- global <const> *
- print("testing functions and calls")
- local debug = require "debug"
- -- get the opportunity to test 'type' too ;)
- assert(type(1<2) == 'boolean')
- assert(type(true) == 'boolean' and type(false) == 'boolean')
- assert(type(nil) == 'nil'
- and type(-3) == 'number'
- and type'x' == 'string'
- and type{} == 'table'
- and type(type) == 'function')
- assert(type(assert) == type(print))
- local function f (x) return a:x (x) end
- assert(type(f) == 'function')
- assert(not pcall(type))
- -- testing local-function recursion
- global fact = false
- do
- local res = 1
- local function fact (n)
- if n==0 then return res
- else return n*fact(n-1)
- end
- end
- assert(fact(5) == 120)
- end
- assert(fact == false)
- fact = nil
- -- testing declarations
- local a = {i = 10}
- local self = 20
- function a:x (x) return x+self.i end
- function a.y (x) return x+self end
- assert(a:x(1)+10 == a.y(1))
- a.t = {i=-100}
- a["t"].x = function (self, a,b) return self.i+a+b end
- assert(a.t:x(2,3) == -95)
- do
- local a = {x=0}
- function a:add (x) self.x, a.y = self.x+x, 20; return self end
- assert(a:add(10):add(20):add(30).x == 60 and a.y == 20)
- end
- local a = {b={c={}}}
- function a.b.c.f1 (x) return x+1 end
- function a.b.c:f2 (x,y) self[x] = y end
- assert(a.b.c.f1(4) == 5)
- a.b.c:f2('k', 12); assert(a.b.c.k == 12)
- print('+')
- global t = nil -- 'declare' t
- function f(a,b,c) local d = 'a'; t={a,b,c,d} end
- f( -- this line change must be valid
- 1,2)
- assert(t[1] == 1 and t[2] == 2 and t[3] == nil and t[4] == 'a')
- f(1,2, -- this one too
- 3,4)
- assert(t[1] == 1 and t[2] == 2 and t[3] == 3 and t[4] == 'a')
- t = nil -- delete 't'
- global function fat(x)
- if x <= 1 then return 1
- else return x*load("return fat(" .. x-1 .. ")", "")()
- end
- end
- assert(load "load 'assert(fat(6)==720)' () ")()
- a = load('return fat(5), 3')
- local a,b = a()
- assert(a == 120 and b == 3)
- fat = nil
- print('+')
- local function err_on_n (n)
- if n==0 then error(); exit(1);
- else err_on_n (n-1); exit(1);
- end
- end
- do
- local function dummy (n)
- if n > 0 then
- assert(not pcall(err_on_n, n))
- dummy(n-1)
- end
- end
- dummy(10)
- end
- _G.deep = nil -- "declaration" (used by 'all.lua')
- global function deep (n)
- if n>0 then deep(n-1) end
- end
- deep(10)
- deep(180)
- print"testing tail calls"
- function deep (n) if n>0 then return deep(n-1) else return 101 end end
- assert(deep(30000) == 101)
- a = {}
- function a:deep (n) if n>0 then return self:deep(n-1) else return 101 end end
- assert(a:deep(30000) == 101)
- do -- tail calls x varargs
- local function foo (x, ...) local a = {...}; return x, a[1], a[2] end
- local function foo1 (x) return foo(10, x, x + 1) end
- local a, b, c = foo1(-2)
- assert(a == 10 and b == -2 and c == -1)
- -- tail calls x metamethods
- local t = setmetatable({}, {__call = foo})
- local function foo2 (x) return t(10, x) end
- a, b, c = foo2(100)
- assert(a == t and b == 10 and c == 100)
- a, b = (function () return foo() end)()
- assert(a == nil and b == nil)
- local X, Y, A
- local function foo (x, y, ...) X = x; Y = y; A = {...} end
- local function foo1 (...) return foo(...) end
- local a, b, c = foo1()
- assert(X == nil and Y == nil and #A == 0)
- a, b, c = foo1(10)
- assert(X == 10 and Y == nil and #A == 0)
- a, b, c = foo1(10, 20)
- assert(X == 10 and Y == 20 and #A == 0)
- a, b, c = foo1(10, 20, 30)
- assert(X == 10 and Y == 20 and #A == 1 and A[1] == 30)
- end
- do -- C-stack overflow while handling C-stack overflow
- local function loop ()
- assert(pcall(loop))
- end
- local err, msg = xpcall(loop, loop)
- assert(not err and string.find(msg, "error"))
- end
- do -- tail calls x chain of __call
- local n = 10000 -- depth
- local function foo ()
- if n == 0 then return 1023
- else n = n - 1; return foo()
- end
- end
- -- build a chain of __call metamethods ending in function 'foo'
- for i = 1, 15 do
- foo = setmetatable({}, {__call = foo})
- end
- -- call the first one as a tail call in a new coroutine
- -- (to ensure stack is not preallocated)
- assert(coroutine.wrap(function() return foo() end)() == 1023)
- end
- print('+')
- do print"testing chains of '__call'"
- local N = 15
- local u = table.pack
- for i = 1, N do
- u = setmetatable({i}, {__call = u})
- end
- local Res = u("a", "b", "c")
- assert(Res.n == N + 3)
- for i = 1, N do
- assert(Res[i][1] == i)
- end
- assert(Res[N + 1] == "a" and Res[N + 2] == "b" and Res[N + 3] == "c")
- local function u (...)
- local n = debug.getinfo(1, 't').extraargs
- assert(select("#", ...) == n)
- return n
- end
- for i = 0, N do
- assert(u() == i)
- u = setmetatable({}, {__call = u})
- end
- end
- do -- testing chains too long
- local a = {}
- for i = 1, 16 do -- one too many
- a = setmetatable({}, {__call = a})
- end
- local status, msg = pcall(a)
- assert(not status and string.find(msg, "too long"))
- setmetatable(a, {__call = a}) -- infinite chain
- local status, msg = pcall(a)
- assert(not status and string.find(msg, "too long"))
- -- again, with a tail call
- local status, msg = pcall(function () return a() end)
- assert(not status and string.find(msg, "too long"))
- end
- a = nil
- (function (x) a=x end)(23)
- assert(a == 23 and (function (x) return x*2 end)(20) == 40)
- -- testing closures
- -- fixed-point operator
- local Z = function (le)
- local function a (f)
- return le(function (x) return f(f)(x) end)
- end
- return a(a)
- end
- -- non-recursive factorial
- local F = function (f)
- return function (n)
- if n == 0 then return 1
- else return n*f(n-1) end
- end
- end
- local fat = Z(F)
- assert(fat(0) == 1 and fat(4) == 24 and Z(F)(5)==5*Z(F)(4))
- local function g (z)
- local function f (a,b,c,d)
- return function (x,y) return a+b+c+d+a+x+y+z end
- end
- return f(z,z+1,z+2,z+3)
- end
- local f = g(10)
- assert(f(9, 16) == 10+11+12+13+10+9+16+10)
- print('+')
- -- testing multiple returns
- local function unlpack (t, i)
- i = i or 1
- if (i <= #t) then
- return t[i], unlpack(t, i+1)
- end
- end
- local function equaltab (t1, t2)
- assert(#t1 == #t2)
- for i = 1, #t1 do
- assert(t1[i] == t2[i])
- end
- end
- local pack = function (...) return (table.pack(...)) end
- local function f() return 1,2,30,4 end
- local function ret2 (a,b) return a,b end
- local a,b,c,d = unlpack{1,2,3}
- assert(a==1 and b==2 and c==3 and d==nil)
- a = {1,2,3,4,false,10,'alo',false,assert}
- equaltab(pack(unlpack(a)), a)
- equaltab(pack(unlpack(a), -1), {1,-1})
- a,b,c,d = ret2(f()), ret2(f())
- assert(a==1 and b==1 and c==2 and d==nil)
- a,b,c,d = unlpack(pack(ret2(f()), ret2(f())))
- assert(a==1 and b==1 and c==2 and d==nil)
- a,b,c,d = unlpack(pack(ret2(f()), (ret2(f()))))
- assert(a==1 and b==1 and c==nil and d==nil)
- a = ret2{ unlpack{1,2,3}, unlpack{3,2,1}, unlpack{"a", "b"}}
- assert(a[1] == 1 and a[2] == 3 and a[3] == "a" and a[4] == "b")
- -- testing calls with 'incorrect' arguments
- rawget({}, "x", 1)
- rawset({}, "x", 1, 2)
- assert(math.sin(1,2) == math.sin(1))
- table.sort({10,9,8,4,19,23,0,0}, function (a,b) return a<b end, "extra arg")
- -- test for generic load
- local x = "-- a comment\0\0\0\n x = 10 + \n23; \
- local a = function () x = 'hi' end; \
- return '\0'"
- local function read1 (x)
- local i = 0
- return function ()
- collectgarbage()
- i=i+1
- return string.sub(x, i, i)
- end
- end
- local function cannotload (msg, a,b)
- assert(not a and string.find(b, msg))
- end
- a = assert(load(read1(x), "modname", "t", _G))
- assert(a() == "\0" and _G.x == 33)
- assert(debug.getinfo(a).source == "modname")
- -- cannot read text in binary mode
- cannotload("attempt to load a text chunk", load(read1(x), "modname", "b", {}))
- cannotload("attempt to load a text chunk", load(x, "modname", "b"))
- a = assert(load(function () return nil end))
- a() -- empty chunk
- assert(not load(function () return true end))
- -- small bug
- local t = {nil, "return ", "3"}
- local f, msg = load(function () return table.remove(t, 1) end)
- assert(f() == nil) -- should read the empty chunk
- -- another small bug (in 5.2.1)
- f = load(string.dump(function () return 1 end), nil, "b", {})
- assert(type(f) == "function" and f() == 1)
- do -- another bug (in 5.4.0)
- -- loading a binary long string interrupted by GC cycles
- local f = string.dump(function ()
- return '01234567890123456789012345678901234567890123456789'
- end)
- f = load(read1(f))
- assert(f() == '01234567890123456789012345678901234567890123456789')
- end
- x = string.dump(load("x = 1; return x"))
- a = assert(load(read1(x), nil, "b"))
- assert(a() == 1 and _G.x == 1)
- cannotload("attempt to load a binary chunk", load(read1(x), nil, "t"))
- cannotload("attempt to load a binary chunk", load(x, nil, "t"))
- _G.x = nil
- assert(not pcall(string.dump, print)) -- no dump of C functions
- cannotload("unexpected symbol", load(read1("*a = 123")))
- cannotload("unexpected symbol", load("*a = 123"))
- cannotload("hhi", load(function () error("hhi") end))
- -- any value is valid for _ENV
- assert(load("return _ENV", nil, nil, 123)() == 123)
- -- load when _ENV is not first upvalue
- global XX; local x
- XX = 123
- local function h ()
- local y=x -- use 'x', so that it becomes 1st upvalue
- return XX -- global name
- end
- local d = string.dump(h)
- x = load(d, "", "b")
- assert(debug.getupvalue(x, 2) == '_ENV')
- debug.setupvalue(x, 2, _G)
- assert(x() == 123)
- assert(assert(load("return XX + ...", nil, nil, {XX = 13}))(4) == 17)
- XX = nil
- -- test generic load with nested functions
- x = [[
- return function (x)
- return function (y)
- return function (z)
- return x+y+z
- end
- end
- end
- ]]
- a = assert(load(read1(x), "read", "t"))
- assert(a()(2)(3)(10) == 15)
- -- repeat the test loading a binary chunk
- x = string.dump(a)
- a = assert(load(read1(x), "read", "b"))
- assert(a()(2)(3)(10) == 15)
- -- test for dump/undump with upvalues
- local a, b = 20, 30
- x = load(string.dump(function (x)
- if x == "set" then a = 10+b; b = b+1 else
- return a
- end
- end), "", "b", nil)
- assert(x() == nil)
- assert(debug.setupvalue(x, 1, "hi") == "a")
- assert(x() == "hi")
- assert(debug.setupvalue(x, 2, 13) == "b")
- assert(not debug.setupvalue(x, 3, 10)) -- only 2 upvalues
- x("set")
- assert(x() == 23)
- x("set")
- assert(x() == 24)
- -- test for dump/undump with many upvalues
- do
- local nup = 200 -- maximum number of local variables
- local prog = {"local a1"}
- for i = 2, nup do prog[#prog + 1] = ", a" .. i end
- prog[#prog + 1] = " = 1"
- for i = 2, nup do prog[#prog + 1] = ", " .. i end
- local sum = 1
- prog[#prog + 1] = "; return function () return a1"
- for i = 2, nup do prog[#prog + 1] = " + a" .. i; sum = sum + i end
- prog[#prog + 1] = " end"
- prog = table.concat(prog)
- local f = assert(load(prog))()
- assert(f() == sum)
- f = load(string.dump(f)) -- main chunk now has many upvalues
- local a = 10
- local h = function () return a end
- for i = 1, nup do
- debug.upvaluejoin(f, i, h, 1)
- end
- assert(f() == 10 * nup)
- end
- -- test for long method names
- do
- local t = {x = 1}
- function t:_012345678901234567890123456789012345678901234567890123456789 ()
- return self.x
- end
- assert(t:_012345678901234567890123456789012345678901234567890123456789() == 1)
- end
- -- test for bug in parameter adjustment
- assert((function () return nil end)(4) == nil)
- assert((function () local a; return a end)(4) == nil)
- assert((function (a) return a end)() == nil)
- print("testing binary chunks")
- do
- local headformat = "c4BBc6BiBI4BjBn"
- local header = { -- header components
- "\27Lua", -- signature
- 0x55, -- version 5.5 (0x55)
- 0, -- format
- "\x19\x93\r\n\x1a\n", -- a binary string
- string.packsize("i"), -- size of an int
- -0x5678, -- an int
- 4, -- size of an instruction
- 0x12345678, -- an instruction (4 bytes)
- string.packsize("j"), -- size of a Lua integer
- -0x5678, -- a Lua integer
- string.packsize("n"), -- size of a Lua float
- -370.5, -- a Lua float
- }
- local c = string.dump(function ()
- local a = 1; local b = 3;
- local f = function () return a + b + _ENV.c; end -- upvalues
- local s1 = "a constant"
- local s2 = "another constant"
- return a + b * 3
- end)
- assert(assert(load(c))() == 10)
- -- check header
- local t = {string.unpack(headformat, c)}
- for i = 1, #header do
- assert(t[i] == header[i])
- end
- -- Testing corrupted header.
- -- A single wrong byte in the head invalidates the chunk,
- -- except for the Lua float check. (If numbers are long double,
- -- the representation may need padding, and changing that padding
- -- will not invalidate the chunk.)
- local headlen = string.packsize(headformat)
- headlen = headlen - string.packsize("n") -- remove float check
- for i = 1, headlen do
- local s = string.sub(c, 1, i - 1) ..
- string.char((string.byte(string.sub(c, i, i)) + 1) & 0xFF) ..
- string.sub(c, i + 1, -1)
- assert(#s == #c and s ~= c)
- assert(not load(s))
- end
- -- loading truncated binary chunks
- for i = 1, #c - 1 do
- local st, msg = load(string.sub(c, 1, i))
- assert(not st and string.find(msg, "truncated"))
- end
- end
- do -- check reuse of strings in dumps
- local str = "|" .. string.rep("X", 50) .. "|"
- local foo = load(string.format([[
- local str <const> = "%s"
- return {
- function () return str end,
- function () return str end,
- function () return str end
- }
- ]], str))
- -- count occurrences of 'str' inside the dump
- local dump = string.dump(foo)
- local _, count = string.gsub(dump, str, {})
- -- there should be only two occurrences:
- -- one inside the source, other the string itself.
- assert(count == 2)
- if T then -- check reuse of strings in undump
- local funcs = load(dump)()
- assert(string.format("%p", T.listk(funcs[1])[1]) ==
- string.format("%p", T.listk(funcs[3])[1]))
- end
- end
- do -- test limit of multiple returns (254 values)
- local code = "return 10" .. string.rep(",10", 253)
- local res = {assert(load(code))()}
- assert(#res == 254 and res[254] == 10)
- code = code .. ",10"
- local status, msg = load(code)
- assert(not status and string.find(msg, "too many returns"))
- end
- print('OK')
- return deep
|