aboutsummaryrefslogtreecommitdiff
path: root/lgc.c
diff options
context:
space:
mode:
Diffstat (limited to 'lgc.c')
-rw-r--r--lgc.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/lgc.c b/lgc.c
index 036020ae..389d69bb 100644
--- a/lgc.c
+++ b/lgc.c
@@ -1,5 +1,5 @@
1/* 1/*
2** $Id: lgc.c,v 2.236 2017/10/31 15:29:28 roberto Exp $ 2** $Id: lgc.c,v 2.238 2017/11/07 13:25:26 roberto Exp roberto $
3** Garbage Collector 3** Garbage Collector
4** See Copyright Notice in lua.h 4** See Copyright Notice in lua.h
5*/ 5*/
@@ -507,7 +507,7 @@ static lu_mem traversetable (global_State *g, Table *h) {
507** mode, check the generational invariant. If the cache is old, 507** mode, check the generational invariant. If the cache is old,
508** everything is ok. If the prototype is 'old0', everything 508** everything is ok. If the prototype is 'old0', everything
509** is ok too. (It will naturally be visited again.) If the 509** is ok too. (It will naturally be visited again.) If the
510** prototype is older than 'old0', then its cache (whith is new) 510** prototype is older than 'old0', then its cache (which is new)
511** must be visited again in the next collection, so the prototype 511** must be visited again in the next collection, so the prototype
512** goes to the 'protogray' list. (If the prototype has a cache, 512** goes to the 'protogray' list. (If the prototype has a cache,
513** it is already immutable and does not need other barriers; 513** it is already immutable and does not need other barriers;
@@ -1195,7 +1195,7 @@ static void entergen (lua_State *L, global_State *g) {
1195 luaC_runtilstate(L, bitmask(GCSpause)); /* prepare to start a new cycle */ 1195 luaC_runtilstate(L, bitmask(GCSpause)); /* prepare to start a new cycle */
1196 luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */ 1196 luaC_runtilstate(L, bitmask(GCSpropagate)); /* start new cycle */
1197 atomic(L); 1197 atomic(L);
1198 /* sweep all ellements making them old */ 1198 /* sweep all elements making them old */
1199 sweep2old(L, &g->allgc); 1199 sweep2old(L, &g->allgc);
1200 /* everything alive now is old */ 1200 /* everything alive now is old */
1201 g->reallyold = g->old = g->survival = g->allgc; 1201 g->reallyold = g->old = g->survival = g->allgc;