gc.lua 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680
  1. -- $Id: testes/gc.lua $
  2. -- See Copyright Notice in file all.lua
  3. print('testing incremental garbage collection')
  4. local debug = require"debug"
  5. assert(collectgarbage("isrunning"))
  6. collectgarbage()
  7. local oldmode = collectgarbage("incremental")
  8. -- changing modes should return previous mode
  9. assert(collectgarbage("generational") == "incremental")
  10. assert(collectgarbage("generational") == "generational")
  11. assert(collectgarbage("incremental") == "generational")
  12. assert(collectgarbage("incremental") == "incremental")
  13. local function nop () end
  14. local function gcinfo ()
  15. return collectgarbage"count" * 1024
  16. end
  17. -- test weird parameters to 'collectgarbage'
  18. do
  19. collectgarbage("incremental")
  20. local opause = collectgarbage("param", "pause", 100)
  21. local ostepmul = collectgarbage("param", "stepmul", 100)
  22. assert(collectgarbage("param", "pause") == 100)
  23. assert(collectgarbage("param", "stepmul") == 100)
  24. local t = {0, 2, 10, 90, 500, 5000, 30000, 0x7ffffffe}
  25. for i = 1, #t do
  26. collectgarbage("param", "pause", t[i])
  27. for j = 1, #t do
  28. collectgarbage("param", "stepmul", t[j])
  29. collectgarbage("step", t[j])
  30. end
  31. end
  32. -- restore original parameters
  33. collectgarbage("param", "pause", opause)
  34. collectgarbage("param", "stepmul", ostepmul)
  35. collectgarbage()
  36. end
  37. --
  38. -- test the "size" of basic GC steps (whatever they mean...)
  39. --
  40. do print("steps")
  41. local function dosteps (siz)
  42. collectgarbage()
  43. local a = {}
  44. for i=1,100 do a[i] = {{}}; local b = {} end
  45. local x = gcinfo()
  46. local i = 0
  47. repeat -- do steps until it completes a collection cycle
  48. i = i+1
  49. until collectgarbage("step", siz)
  50. assert(gcinfo() < x)
  51. return i -- number of steps
  52. end
  53. if not _port then
  54. collectgarbage"stop"
  55. assert(dosteps(10) < dosteps(2))
  56. collectgarbage"restart"
  57. end
  58. end
  59. _G["while"] = 234
  60. --
  61. -- tests for GC activation when creating different kinds of objects
  62. --
  63. local function GC1 ()
  64. local u
  65. local b -- (above 'u' it in the stack)
  66. local finish = false
  67. u = setmetatable({}, {__gc = function () finish = true end})
  68. b = {34}
  69. repeat u = {} until finish
  70. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  71. finish = false; local i = 1
  72. u = setmetatable({}, {__gc = function () finish = true end})
  73. repeat i = i + 1; u = tostring(i) .. tostring(i) until finish
  74. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  75. finish = false
  76. u = setmetatable({}, {__gc = function () finish = true end})
  77. repeat local i; u = function () return i end until finish
  78. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  79. end
  80. local function GC2 ()
  81. local u
  82. local finish = false
  83. u = {setmetatable({}, {__gc = function () finish = true end})}
  84. local b = {34}
  85. repeat u = {{}} until finish
  86. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  87. finish = false; local i = 1
  88. u = {setmetatable({}, {__gc = function () finish = true end})}
  89. repeat i = i + 1; u = {tostring(i) .. tostring(i)} until finish
  90. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  91. finish = false
  92. u = {setmetatable({}, {__gc = function () finish = true end})}
  93. repeat local i; u = {function () return i end} until finish
  94. assert(b[1] == 34) -- 'u' was collected, but 'b' was not
  95. end
  96. local function GC() GC1(); GC2() end
  97. do
  98. print("creating many objects")
  99. local limit = 5000
  100. for i = 1, limit do
  101. local a = {}; a = nil
  102. end
  103. local a = "a"
  104. for i = 1, limit do
  105. a = i .. "b";
  106. a = string.gsub(a, '(%d%d*)', "%1 %1")
  107. a = "a"
  108. end
  109. a = {}
  110. function a:test ()
  111. for i = 1, limit do
  112. load(string.format("function temp(a) return 'a%d' end", i), "")()
  113. assert(temp() == string.format('a%d', i))
  114. end
  115. end
  116. a:test()
  117. _G.temp = nil
  118. end
  119. -- collection of functions without locals, globals, etc.
  120. do local f = function () end end
  121. print("functions with errors")
  122. local prog = [[
  123. do
  124. a = 10;
  125. function foo(x,y)
  126. a = sin(a+0.456-0.23e-12);
  127. return function (z) return sin(%x+z) end
  128. end
  129. local x = function (w) a=a+w; end
  130. end
  131. ]]
  132. do
  133. local step = 1
  134. if _soft then step = 13 end
  135. for i=1, string.len(prog), step do
  136. for j=i, string.len(prog), step do
  137. pcall(load(string.sub(prog, i, j), ""))
  138. end
  139. end
  140. end
  141. rawset(_G, "a", nil)
  142. _G.x = nil
  143. do
  144. foo = nil
  145. print('long strings')
  146. local x = "01234567890123456789012345678901234567890123456789012345678901234567890123456789"
  147. assert(string.len(x)==80)
  148. local s = ''
  149. local k = math.min(300, (math.maxinteger // 80) // 2)
  150. for n = 1, k do s = s..x; local j=tostring(n) end
  151. assert(string.len(s) == k*80)
  152. s = string.sub(s, 1, 10000)
  153. local s, i = string.gsub(s, '(%d%d%d%d)', '')
  154. assert(i==10000 // 4)
  155. assert(_G["while"] == 234)
  156. _G["while"] = nil
  157. end
  158. if not _port then
  159. -- test the pace of the collector
  160. collectgarbage(); collectgarbage()
  161. local x = gcinfo()
  162. collectgarbage"stop"
  163. repeat
  164. local a = {}
  165. until gcinfo() > 3 * x
  166. collectgarbage"restart"
  167. assert(collectgarbage("isrunning"))
  168. repeat
  169. local a = {}
  170. until gcinfo() <= x * 2
  171. end
  172. print("clearing tables")
  173. local lim = 15
  174. local a = {}
  175. -- fill a with `collectable' indices
  176. for i=1,lim do a[{}] = i end
  177. b = {}
  178. for k,v in pairs(a) do b[k]=v end
  179. -- remove all indices and collect them
  180. for n in pairs(b) do
  181. a[n] = undef
  182. assert(type(n) == 'table' and next(n) == nil)
  183. collectgarbage()
  184. end
  185. b = nil
  186. collectgarbage()
  187. for n in pairs(a) do error'cannot be here' end
  188. for i=1,lim do a[i] = i end
  189. for i=1,lim do assert(a[i] == i) end
  190. print('weak tables')
  191. a = {}; setmetatable(a, {__mode = 'k'});
  192. -- fill a with some `collectable' indices
  193. for i=1,lim do a[{}] = i end
  194. -- and some non-collectable ones
  195. for i=1,lim do a[i] = i end
  196. for i=1,lim do local s=string.rep('@', i); a[s] = s..'#' end
  197. collectgarbage()
  198. local i = 0
  199. for k,v in pairs(a) do assert(k==v or k..'#'==v); i=i+1 end
  200. assert(i == 2*lim)
  201. a = {}; setmetatable(a, {__mode = 'v'});
  202. a[1] = string.rep('b', 21)
  203. collectgarbage()
  204. assert(a[1]) -- strings are *values*
  205. a[1] = undef
  206. -- fill a with some `collectable' values (in both parts of the table)
  207. for i=1,lim do a[i] = {} end
  208. for i=1,lim do a[i..'x'] = {} end
  209. -- and some non-collectable ones
  210. for i=1,lim do local t={}; a[t]=t end
  211. for i=1,lim do a[i+lim]=i..'x' end
  212. collectgarbage()
  213. local i = 0
  214. for k,v in pairs(a) do assert(k==v or k-lim..'x' == v); i=i+1 end
  215. assert(i == 2*lim)
  216. a = {}; setmetatable(a, {__mode = 'kv'});
  217. local x, y, z = {}, {}, {}
  218. -- keep only some items
  219. a[1], a[2], a[3] = x, y, z
  220. a[string.rep('$', 11)] = string.rep('$', 11)
  221. -- fill a with some `collectable' values
  222. for i=4,lim do a[i] = {} end
  223. for i=1,lim do a[{}] = i end
  224. for i=1,lim do local t={}; a[t]=t end
  225. collectgarbage()
  226. assert(next(a) ~= nil)
  227. local i = 0
  228. for k,v in pairs(a) do
  229. assert((k == 1 and v == x) or
  230. (k == 2 and v == y) or
  231. (k == 3 and v == z) or k==v);
  232. i = i+1
  233. end
  234. assert(i == 4)
  235. x,y,z=nil
  236. collectgarbage()
  237. assert(next(a) == string.rep('$', 11))
  238. -- 'bug' in 5.1
  239. a = {}
  240. local t = {x = 10}
  241. local C = setmetatable({key = t}, {__mode = 'v'})
  242. local C1 = setmetatable({[t] = 1}, {__mode = 'k'})
  243. a.x = t -- this should not prevent 't' from being removed from
  244. -- weak table 'C' by the time 'a' is finalized
  245. setmetatable(a, {__gc = function (u)
  246. assert(C.key == nil)
  247. assert(type(next(C1)) == 'table')
  248. end})
  249. a, t = nil
  250. collectgarbage()
  251. collectgarbage()
  252. assert(next(C) == nil and next(C1) == nil)
  253. C, C1 = nil
  254. -- ephemerons
  255. local mt = {__mode = 'k'}
  256. a = {{10},{20},{30},{40}}; setmetatable(a, mt)
  257. x = nil
  258. for i = 1, 100 do local n = {}; a[n] = {k = {x}}; x = n end
  259. GC()
  260. local n = x
  261. local i = 0
  262. while n do n = a[n].k[1]; i = i + 1 end
  263. assert(i == 100)
  264. x = nil
  265. GC()
  266. for i = 1, 4 do assert(a[i][1] == i * 10); a[i] = undef end
  267. assert(next(a) == nil)
  268. local K = {}
  269. a[K] = {}
  270. for i=1,10 do a[K][i] = {}; a[a[K][i]] = setmetatable({}, mt) end
  271. x = nil
  272. local k = 1
  273. for j = 1,100 do
  274. local n = {}; local nk = k%10 + 1
  275. a[a[K][nk]][n] = {x, k = k}; x = n; k = nk
  276. end
  277. GC()
  278. local n = x
  279. local i = 0
  280. while n do local t = a[a[K][k]][n]; n = t[1]; k = t.k; i = i + 1 end
  281. assert(i == 100)
  282. K = nil
  283. GC()
  284. -- assert(next(a) == nil)
  285. -- testing errors during GC
  286. if T then
  287. collectgarbage("stop") -- stop collection
  288. local u = {}
  289. local s = {}; setmetatable(s, {__mode = 'k'})
  290. setmetatable(u, {__gc = function (o)
  291. local i = s[o]
  292. s[i] = true
  293. assert(not s[i - 1]) -- check proper finalization order
  294. if i == 8 then error("@expected@") end -- error during GC
  295. end})
  296. for i = 6, 10 do
  297. local n = setmetatable({}, getmetatable(u))
  298. s[n] = i
  299. end
  300. warn("@on"); warn("@store")
  301. collectgarbage()
  302. assert(string.find(_WARN, "error in __gc"))
  303. assert(string.match(_WARN, "@(.-)@") == "expected"); _WARN = false
  304. for i = 8, 10 do assert(s[i]) end
  305. for i = 1, 5 do
  306. local n = setmetatable({}, getmetatable(u))
  307. s[n] = i
  308. end
  309. collectgarbage()
  310. for i = 1, 10 do assert(s[i]) end
  311. getmetatable(u).__gc = nil
  312. warn("@normal")
  313. end
  314. print '+'
  315. -- testing userdata
  316. if T==nil then
  317. (Message or print)('\n >>> testC not active: skipping userdata GC tests <<<\n')
  318. else
  319. local function newproxy(u)
  320. return debug.setmetatable(T.newuserdata(0), debug.getmetatable(u))
  321. end
  322. collectgarbage("stop") -- stop collection
  323. local u = newproxy(nil)
  324. debug.setmetatable(u, {__gc = true})
  325. local s = 0
  326. local a = {[u] = 0}; setmetatable(a, {__mode = 'vk'})
  327. for i=1,10 do a[newproxy(u)] = i end
  328. for k in pairs(a) do assert(getmetatable(k) == getmetatable(u)) end
  329. local a1 = {}; for k,v in pairs(a) do a1[k] = v end
  330. for k,v in pairs(a1) do a[v] = k end
  331. for i =1,10 do assert(a[i]) end
  332. getmetatable(u).a = a1
  333. getmetatable(u).u = u
  334. do
  335. local u = u
  336. getmetatable(u).__gc = function (o)
  337. assert(a[o] == 10-s)
  338. assert(a[10-s] == undef) -- udata already removed from weak table
  339. assert(getmetatable(o) == getmetatable(u))
  340. assert(getmetatable(o).a[o] == 10-s)
  341. s=s+1
  342. end
  343. end
  344. a1, u = nil
  345. assert(next(a) ~= nil)
  346. collectgarbage()
  347. assert(s==11)
  348. collectgarbage()
  349. assert(next(a) == nil) -- finalized keys are removed in two cycles
  350. end
  351. -- __gc x weak tables
  352. local u = setmetatable({}, {__gc = true})
  353. -- __gc metamethod should be collected before running
  354. setmetatable(getmetatable(u), {__mode = "v"})
  355. getmetatable(u).__gc = function (o) os.exit(1) end -- cannot happen
  356. u = nil
  357. collectgarbage()
  358. local u = setmetatable({}, {__gc = true})
  359. local m = getmetatable(u)
  360. m.x = {[{0}] = 1; [0] = {1}}; setmetatable(m.x, {__mode = "kv"});
  361. m.__gc = function (o)
  362. assert(next(getmetatable(o).x) == nil)
  363. m = 10
  364. end
  365. u, m = nil
  366. collectgarbage()
  367. assert(m==10)
  368. do -- tests for string keys in weak tables
  369. collectgarbage(); collectgarbage()
  370. local m = collectgarbage("count") -- current memory
  371. local a = setmetatable({}, {__mode = "kv"})
  372. a[string.rep("a", 2^22)] = 25 -- long string key -> number value
  373. a[string.rep("b", 2^22)] = {} -- long string key -> colectable value
  374. a[{}] = 14 -- colectable key
  375. collectgarbage()
  376. local k, v = next(a) -- string key with number value preserved
  377. assert(k == string.rep("a", 2^22) and v == 25)
  378. assert(next(a, k) == nil) -- everything else cleared
  379. assert(a[string.rep("b", 2^22)] == undef)
  380. a[k] = undef -- erase this last entry
  381. k = nil
  382. collectgarbage()
  383. assert(next(a) == nil)
  384. -- make sure will not try to compare with dead key
  385. assert(a[string.rep("b", 100)] == undef)
  386. assert(collectgarbage("count") <= m + 1) -- eveything collected
  387. end
  388. -- errors during collection
  389. if T then
  390. warn("@store")
  391. u = setmetatable({}, {__gc = function () error "@expected error" end})
  392. u = nil
  393. collectgarbage()
  394. assert(string.find(_WARN, "@expected error")); _WARN = false
  395. warn("@normal")
  396. end
  397. if not _soft then
  398. print("long list")
  399. local a = {}
  400. for i = 1,200000 do
  401. a = {next = a}
  402. end
  403. a = nil
  404. collectgarbage()
  405. end
  406. -- create many threads with self-references and open upvalues
  407. print("self-referenced threads")
  408. local thread_id = 0
  409. local threads = {}
  410. local function fn (thread)
  411. local x = {}
  412. threads[thread_id] = function()
  413. thread = x
  414. end
  415. coroutine.yield()
  416. end
  417. while thread_id < 1000 do
  418. local thread = coroutine.create(fn)
  419. coroutine.resume(thread, thread)
  420. thread_id = thread_id + 1
  421. end
  422. -- Create a closure (function inside 'f') with an upvalue ('param') that
  423. -- points (through a table) to the closure itself and to the thread
  424. -- ('co' and the initial value of 'param') where closure is running.
  425. -- Then, assert that table (and therefore everything else) will be
  426. -- collected.
  427. do
  428. local collected = false -- to detect collection
  429. collectgarbage(); collectgarbage("stop")
  430. do
  431. local function f (param)
  432. ;(function ()
  433. assert(type(f) == 'function' and type(param) == 'thread')
  434. param = {param, f}
  435. setmetatable(param, {__gc = function () collected = true end})
  436. coroutine.yield(100)
  437. end)()
  438. end
  439. local co = coroutine.create(f)
  440. assert(coroutine.resume(co, co))
  441. end
  442. -- Now, thread and closure are not reacheable any more.
  443. collectgarbage()
  444. assert(collected)
  445. collectgarbage("restart")
  446. end
  447. do
  448. collectgarbage()
  449. collectgarbage"stop"
  450. collectgarbage("step") -- steps should not unblock the collector
  451. local x = gcinfo()
  452. repeat
  453. for i=1,1000 do _ENV.a = {} end -- no collection during the loop
  454. until gcinfo() > 2 * x
  455. collectgarbage"restart"
  456. _ENV.a = nil
  457. end
  458. if T then -- tests for weird cases collecting upvalues
  459. local function foo ()
  460. local a = {x = 20}
  461. coroutine.yield(function () return a.x end) -- will run collector
  462. assert(a.x == 20) -- 'a' is 'ok'
  463. a = {x = 30} -- create a new object
  464. assert(T.gccolor(a) == "white") -- of course it is new...
  465. coroutine.yield(100) -- 'a' is still local to this thread
  466. end
  467. local t = setmetatable({}, {__mode = "kv"})
  468. collectgarbage(); collectgarbage('stop')
  469. -- create coroutine in a weak table, so it will never be marked
  470. t.co = coroutine.wrap(foo)
  471. local f = t.co() -- create function to access local 'a'
  472. T.gcstate("enteratomic") -- ensure all objects are traversed
  473. assert(T.gcstate() == "enteratomic")
  474. assert(t.co() == 100) -- resume coroutine, creating new table for 'a'
  475. assert(T.gccolor(t.co) == "white") -- thread was not traversed
  476. T.gcstate("pause") -- collect thread, but should mark 'a' before that
  477. assert(t.co == nil and f() == 30) -- ensure correct access to 'a'
  478. collectgarbage("restart")
  479. -- test barrier in sweep phase (backing userdata to gray)
  480. local u = T.newuserdata(0, 1) -- create a userdata
  481. collectgarbage()
  482. collectgarbage"stop"
  483. local a = {} -- avoid 'u' as first element in 'allgc'
  484. T.gcstate"enteratomic"
  485. T.gcstate"sweepallgc"
  486. local x = {}
  487. assert(T.gccolor(u) == "black") -- userdata is "old" (black)
  488. assert(T.gccolor(x) == "white") -- table is "new" (white)
  489. debug.setuservalue(u, x) -- trigger barrier
  490. assert(T.gccolor(u) == "gray") -- userdata changed back to gray
  491. collectgarbage"restart"
  492. print"+"
  493. end
  494. if T then
  495. local debug = require "debug"
  496. collectgarbage("stop")
  497. local x = T.newuserdata(0)
  498. local y = T.newuserdata(0)
  499. debug.setmetatable(y, {__gc = nop}) -- bless the new udata before...
  500. debug.setmetatable(x, {__gc = nop}) -- ...the old one
  501. assert(T.gccolor(y) == "white")
  502. T.checkmemory()
  503. collectgarbage("restart")
  504. end
  505. if T then
  506. print("emergency collections")
  507. collectgarbage()
  508. collectgarbage()
  509. T.totalmem(T.totalmem() + 200)
  510. for i=1,200 do local a = {} end
  511. T.totalmem(0)
  512. collectgarbage()
  513. local t = T.totalmem("table")
  514. local a = {{}, {}, {}} -- create 4 new tables
  515. assert(T.totalmem("table") == t + 4)
  516. t = T.totalmem("function")
  517. a = function () end -- create 1 new closure
  518. assert(T.totalmem("function") == t + 1)
  519. t = T.totalmem("thread")
  520. a = coroutine.create(function () end) -- create 1 new coroutine
  521. assert(T.totalmem("thread") == t + 1)
  522. end
  523. -- create an object to be collected when state is closed
  524. do
  525. local setmetatable,assert,type,print,getmetatable =
  526. setmetatable,assert,type,print,getmetatable
  527. local tt = {}
  528. tt.__gc = function (o)
  529. assert(getmetatable(o) == tt)
  530. -- create new objects during GC
  531. local a = 'xuxu'..(10+3)..'joao', {}
  532. ___Glob = o -- ressurrect object!
  533. setmetatable({}, tt) -- creates a new one with same metatable
  534. print(">>> closing state " .. "<<<\n")
  535. end
  536. local u = setmetatable({}, tt)
  537. ___Glob = {u} -- avoid object being collected before program end
  538. end
  539. -- create several objects to raise errors when collected while closing state
  540. if T then
  541. local error, assert, find, warn = error, assert, string.find, warn
  542. local n = 0
  543. local lastmsg
  544. local mt = {__gc = function (o)
  545. n = n + 1
  546. assert(n == o[1])
  547. if n == 1 then
  548. _WARN = false
  549. elseif n == 2 then
  550. assert(find(_WARN, "@expected warning"))
  551. lastmsg = _WARN -- get message from previous error (first 'o')
  552. else
  553. assert(lastmsg == _WARN) -- subsequent error messages are equal
  554. end
  555. warn("@store"); _WARN = false
  556. error"@expected warning"
  557. end}
  558. for i = 10, 1, -1 do
  559. -- create object and preserve it until the end
  560. table.insert(___Glob, setmetatable({i}, mt))
  561. end
  562. end
  563. -- just to make sure
  564. assert(collectgarbage'isrunning')
  565. do -- check that the collector is not reentrant in incremental mode
  566. local res = true
  567. setmetatable({}, {__gc = function ()
  568. res = collectgarbage()
  569. end})
  570. collectgarbage()
  571. assert(not res)
  572. end
  573. collectgarbage(oldmode)
  574. print('OK')