Add real examples

- lua_load
- luaL_loadbufferx
- luaL_dostring
- luaL_loadstring

Author: ligurio

luaL_dostring/abs.lua

@@ -0,0 +1,16 @@
+local abs = math.abs
+local expect_error = function() end
+
+do --- smoke
+  assert(abs(-1.5) == 1.5)
+  assert(abs("-1.5") == 1.5)
+end
+
+do --- argcheck
+  expect_error(function() abs() end,
+      "bad argument #1 to 'abs' (number expected, got no value)")
+  expect_error(function() abs(false) end,
+      "bad argument #1 to 'abs' (number expected, got boolean)")
+  expect_error(function() abs("a") end,
+      "bad argument #1 to 'abs' (number expected, got string)")
+end

luaL_dostring/alias_alloc.lua

@@ -0,0 +1,54 @@
+
+do
+  local t = {1}
+  local x
+  for i=1,100 do
+    local v = {i}
+    t[1] = v[1]
+    x = v[1]
+  end
+  assert(x == 100 and t[1] == 100)
+end
+
+do
+  local t = {1}
+  local x,y
+  for i=1,100 do
+    local v = {i}
+    local w = {i+1}
+    x = v[1]
+    y = w[1]
+  end
+  assert(x == 100 and y == 101)
+end
+
+do
+  local mt = {}
+  local t = setmetatable({}, mt)
+  local x
+  for i=1,100 do
+    local v = {}
+    setmetatable(v, getmetatable(t))
+    assert(getmetatable(v) == mt)
+  end
+end
+
+-- See also sink_alloc.lua
+do
+  local x,k={1,2},{3,4}
+  for i=1,100 do x = {x[1]+k[1], x[2]+k[2]} end
+  assert(x[1] == 301)
+  assert(x[2] == 402)
+end
+
+-- FLOAD for tab.asize/tab.array crossing NEWREF.
+do
+  local t = {1}
+  for i=1,100 do
+    local v = {}
+    local w = {}
+    v[1] = t[1]
+    w[1] = t[1]
+  end
+end
+

luaL_dostring/alloc.lua

@@ -0,0 +1,126 @@
+local assert = assert
+
+do --- DCE or sink trivial TNEW or TDUP.
+  for i=1,100 do local t={} end
+  for i=1,100 do local t={1} end
+end
+
+do --- Sink TNEW/TDUP + ASTORE/HSTORE.
+  for i=1,100 do local t={i}; assert(t[1] == i) end
+  for i=1,100 do local t={foo=i}; assert(t.foo == i) end
+  for i=1,100 do local t={1,i}; assert(t[2] == i) end
+  for i=1,100 do local t={bar=1,foo=i}; assert(t.foo == i) end
+end
+
+do --- Sink outermost table of nested TNEW.
+  local x
+  for i=1,100 do
+    local t = {[0]={{1,i}}}
+    if i == 90 then x = t end
+    assert(t[0][1][2] == i)
+  end
+  assert(x[0][1][2] == 90)
+  for i=1,100 do
+    local t = {foo={bar={baz=i}}}
+    if i == 90 then x = t end
+    assert(t.foo.bar.baz == i)
+  end
+  assert(x.foo.bar.baz == 90)
+end
+
+do --- Sink one TNEW + FSTORE.
+  for i=1,100 do local t = setmetatable({}, {}) end
+end
+
+do --- Sink TDUP or TDUP + HSTORE. Guard of HREFK eliminated.
+  local x
+  for i=1,100 do local t = { foo = 1 }; x = t.foo; end
+  assert(x == 1)
+  for i=1,100 do local t = { foo = i }; x = t.foo; end
+  assert(x == 100)
+end
+
+do --- Sink of simplified complex add, unused in next iteration, drop PHI.
+  local x={1,2}
+  for i=1,100 do x = {x[1]+3, x[2]+4} end
+  assert(x[1] == 301)
+  assert(x[2] == 402)
+end
+
+do --- Sink of complex add, unused in next iteration, drop PHI.
+  local x,k={1.5,2.5},{3.5,4.5}
+  for i=1,100 do x = {x[1]+k[1], x[2]+k[2]} end
+  assert(x[1] == 351.5)
+  assert(x[2] == 452.5)
+end
+
+do --- Sink of TDUP with stored values that are both PHI and non-PHI.
+  local x,k={1,2},{3,4}
+  for i=1,100 do x = {x[1]+k[1], k[2]} end
+  assert(x[1] == 301)
+  assert(x[2] == 4)
+end
+
+do --- Sink of CONV.
+  local t = {1}
+  local x,y
+  for i=1,200 do
+    local v = {i}
+    local w = {i+1}
+    x = v[1]
+    y = w[1]
+    if i > 100 then end
+  end
+  assert(x == 200 and y == 201)
+end
+
+do --- Sink of stores with numbers.
+  local x = {1.5, 0}
+  for i=1,200 do x = {x[1]+1, 99.5}; x[2]=4.5; if i > 100 then end end
+  assert(x[1] == 201.5)
+  assert(x[2] == 4.5)
+end
+
+do --- Sink of stores with constants.
+  for i=1,100 do local t = {false}; t[1] = true; if i > 100 then g=t end end
+end
+
+do --- Sink with two references to the same table.
+  for i=1,200 do
+    local t = {i}
+    local q = t
+    if i > 100 then assert(t == q) end
+  end
+end
+
+do --- point
+  local point
+  point = {
+    new = function(self, x, y)
+      return setmetatable({x=x, y=y}, self)
+    end,
+    __add = function(a, b)
+     return point:new(a.x + b.x, a.y + b.y)
+    end,
+  }
+  point.__index = point
+  local a, b = point:new(1, 1), point:new(2, 2)
+  for i=1,100 do a = (a + b) + b end
+  assert(a.x == 401)
+  assert(a.y == 401)
+  assert(getmetatable(a) == point)
+  for i=1,200 do a = (a + b) + b; if i > 100 then end end
+  assert(a.x == 1201)
+  assert(a.y == 1201)
+  assert(getmetatable(a) == point)
+end
+
+do --- untitled
+  local t = {}
+  for i=1,20 do t[i] = 1 end
+  for i=1,20 do
+    for a,b in ipairs(t) do
+      local s = {i}
+    end
+  end
+end

luaL_dostring/andor.lua

@@ -0,0 +1,61 @@
+do --- smoke
+  local x = ((1 or false) and true) or false
+  assert(x == true)
+end
+
+do --- allcases
+  local basiccases = {
+    {"nil", nil},
+    {"false", false},
+    {"true", true},
+    {"10", 10},
+  }
+
+  local mem = {basiccases}    -- for memoization
+
+  local function allcases (n)
+    if mem[n] then return mem[n] end
+    local res = {}
+    -- include all smaller cases
+    for _, v in ipairs(allcases(n - 1)) do
+      res[#res + 1] = v
+    end
+    for i = 1, n - 1 do
+      for _, v1 in ipairs(allcases(i)) do
+        for _, v2 in ipairs(allcases(n - i)) do
+    res[#res + 1] = {
+      "(" .. v1[1] .. " and " .. v2[1] .. ")",
+      v1[2] and v2[2]
+    }
+    res[#res + 1] = {
+      "(" .. v1[1] .. " or " .. v2[1] .. ")",
+      v1[2] or v2[2]
+    }
+        end
+      end
+    end
+    mem[n] = res   -- memoize
+    return res
+  end
+
+  for _, v in pairs(allcases(4)) do
+    local res = (loadstring or load)("return " .. v[1])()
+    if res ~= v[2] then
+      error(string.format("bad conditional eval\n%s\nexpected: %s\ngot: %s",
+        v[1], tostring(v[2]), tostring(res)))
+    end
+  end
+end
+
+do --- tracefib
+  -- 0001    KSHORT   1   2
+  -- 0002    ISGE     0   1
+  -- 0003    JMP      1 => 0006
+  -- 0004    KSHORT   1   1
+  -- 0005    JMP      1 => 0013
+  --                 ^^^ must be 2
+  -- fix in jmp_patchtestreg
+  local function fib(n) return (n < 2) and 1 or fib(n-1)+fib(n-2) end
+  assert(fib(5) == 8)
+  assert(fib(10) == 89)
+end

luaL_dostring/api_call.lua

@@ -0,0 +1,98 @@
+-- local ctest = require("ctest")
+
+local function ret0() end
+local function ret1() return 1 end
+local function ret2() return 1,2 end
+local function ret3() return 1,2,3 end
+local function retva(...) return ... end
+local function ret1va(...) return 1,... end
+
+local function pack(...)
+  return { n = select('#', ...), ... }
+end
+
+local function ck(res, ...)
+  local ok = pack(...)
+  if res.n ~= ok.n then error("nresults wrong: "..res.n.." ~= "..ok.n, 2) end
+  for i=1,res.n do
+    if res[i] ~= ok[i] then
+      error("result["..i.."] wrong: "..tostring(res[i]).." ~= "..tostring(ok[i]), 2)
+    end
+  end
+end
+
+local function test_adjust_results(testfunc)
+
+  local function cc(nres, f, ...)
+    return pack(testfunc(nres, f, ...))
+  end
+
+  ck(cc(0, ret0))
+  ck(cc(0, ret1))
+  ck(cc(0, ret2))
+  ck(cc(0, ret3))
+  ck(cc(0, retva))
+
+  ck(cc(1, ret0), nil)
+  ck(cc(1, ret1), 1)
+  ck(cc(1, ret2), 1)
+  ck(cc(1, ret3), 1)
+  ck(cc(1, retva), nil)
+  ck(cc(1, retva, 1), 1)
+
+  ck(cc(2, ret0), nil, nil)
+  ck(cc(2, ret1), 1, nil)
+  ck(cc(2, ret2), 1, 2)
+  ck(cc(2, ret3), 1, 2)
+  ck(cc(2, retva), nil, nil)
+  ck(cc(2, retva, 1), 1, nil)
+  ck(cc(2, retva, 1, 2), 1, 2)
+
+  ck(cc(-1, ret0))
+  ck(cc(-1, ret1), 1)
+  ck(cc(-1, ret2), 1, 2)
+  ck(cc(-1, ret3), 1, 2, 3)
+  ck(cc(-1, retva))
+  ck(cc(-1, retva, 1), 1)
+  ck(cc(-1, retva, 1, 2), 1, 2)
+end
+
+-- test_adjust_results(ctest.call)
+-- test_adjust_results(ctest.pcall_err)
+
+
+local function gcshrink()
+  for i=1,10 do collectgarbage() end
+end
+
+-- assert(select('#', ctest.call(2000, gcshrink)) == 2000)
+gcshrink()
+-- assert(select('#', ctest.call(7000, gcshrink)) == 7000)
+gcshrink()
+
+local function test_yield(resume, yield)
+  local function inpcall()
+    ck(pack(yield(6, 7)), 18, 19)
+  end
+  local co = coroutine.create(function(...)
+    ck(pack(...), 11, 12)
+    ck(pack(yield(1, 2)))
+    ck(pack(yield()), 13, 14, 15)
+    ck(pack(yield(3, 4, 5)), 16, 17)
+    assert(pcall(inpcall) == true)
+    return 8, 9
+  end)
+
+  ck(pack(resume(co, 11, 12)), true, 1, 2)
+  ck(pack(resume(co)), true)
+  ck(pack(resume(co, 13, 14, 15)), true, 3, 4, 5)
+  ck(pack(resume(co, 16, 17)), true, 6, 7)
+  ck(pack(resume(co, 18, 19)), true, 8, 9)
+  assert(resume(co) == false)
+end
+
+test_yield(coroutine.resume, coroutine.yield)
+-- test_yield(ctest.resume, coroutine.yield)
+-- test_yield(coroutine.resume, ctest.yield)
+-- test_yield(ctest.resume, ctest.yield)
+