b55300b729
* Start on lua scripting * Implement evalsha, script load, script exists, and script flush * Type conversions from lua to resp/json. Refactor to make luastate and luascripts persistent in the controller. * Change controller.command and all underlying commands to return resp.Value. Serialize only during the ouput. * First stab at tile38 call from lua * Change tile38 into tile38.call in Lua * Property return errors from scripts * Minor refactoring. No locking on script run * Cleanup/refactoring * Create a pool of 5 lua states, allow for more as needed. Refactor. * Use safe map for scripts. Add a limit for max number of lua states. Refactor. * Refactor * Refactor script commands into atomic, read-only, and non-atomic classes. Proper locking for all three classes. Add tests for scripts * More tests for scripts * Properly escape newlines in lua-produced errors * Better test for readonly failure * Correctly convert ok/err messages between lua and resp. Add pcall, sha1hex, error_reply, status_reply functions to tile38 namespace in lua. * Add pcall test. Change writeErr to work with string argument * Make sure eval/evalsha never attempt to write AOF * Add eval-set and eval-get to benchmarks * Fix eval benchmark tests, add more * Improve benchmarks * Optimizations and refactoring. * Add lua memtest * Typo * Add dependency * golint fixes * gofmt fixes * Add scripting commands to the core/commands.json * Use ARGV for args inside lua
78 lines
1.9 KiB
Lua
78 lines
1.9 KiB
Lua
|
|
assert(rawget(_G, "stat") == nil) -- module not loaded before
|
|
|
|
if T == nil then
|
|
stat = function () print"`querytab' nao ativo" end
|
|
return
|
|
end
|
|
|
|
|
|
function checktable (t)
|
|
local asize, hsize, ff = T.querytab(t)
|
|
local l = {}
|
|
for i=0,hsize-1 do
|
|
local key,val,next = T.querytab(t, i + asize)
|
|
if key == nil then
|
|
assert(l[i] == nil and val==nil and next==nil)
|
|
elseif key == "<undef>" then
|
|
assert(val==nil)
|
|
else
|
|
assert(t[key] == val)
|
|
local mp = T.hash(key, t)
|
|
if l[i] then
|
|
assert(l[i] == mp)
|
|
elseif mp ~= i then
|
|
l[i] = mp
|
|
else -- list head
|
|
l[mp] = {mp} -- first element
|
|
while next do
|
|
assert(ff <= next and next < hsize)
|
|
if l[next] then assert(l[next] == mp) else l[next] = mp end
|
|
table.insert(l[mp], next)
|
|
key,val,next = T.querytab(t, next)
|
|
assert(key)
|
|
end
|
|
end
|
|
end
|
|
end
|
|
l.asize = asize; l.hsize = hsize; l.ff = ff
|
|
return l
|
|
end
|
|
|
|
function mostra (t)
|
|
local asize, hsize, ff = T.querytab(t)
|
|
print(asize, hsize, ff)
|
|
print'------'
|
|
for i=0,asize-1 do
|
|
local _, v = T.querytab(t, i)
|
|
print(string.format("[%d] -", i), v)
|
|
end
|
|
print'------'
|
|
for i=0,hsize-1 do
|
|
print(i, T.querytab(t, i+asize))
|
|
end
|
|
print'-------------'
|
|
end
|
|
|
|
function stat (t)
|
|
t = checktable(t)
|
|
local nelem, nlist = 0, 0
|
|
local maxlist = {}
|
|
for i=0,t.hsize-1 do
|
|
if type(t[i]) == 'table' then
|
|
local n = table.getn(t[i])
|
|
nlist = nlist+1
|
|
nelem = nelem + n
|
|
if not maxlist[n] then maxlist[n] = 0 end
|
|
maxlist[n] = maxlist[n]+1
|
|
end
|
|
end
|
|
print(string.format("hsize=%d elements=%d load=%.2f med.len=%.2f (asize=%d)",
|
|
t.hsize, nelem, nelem/t.hsize, nelem/nlist, t.asize))
|
|
for i=1,table.getn(maxlist) do
|
|
local n = maxlist[i] or 0
|
|
print(string.format("%5d %10d %.2f%%", i, n, n*100/nlist))
|
|
end
|
|
end
|
|
|