lgc.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. /*
  2. ** $Id: lgc.c,v 1.20 1999/01/22 18:08:03 roberto Exp roberto $
  3. ** Garbage Collector
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include "ldo.h"
  7. #include "lfunc.h"
  8. #include "lgc.h"
  9. #include "lmem.h"
  10. #include "lobject.h"
  11. #include "lstate.h"
  12. #include "lstring.h"
  13. #include "ltable.h"
  14. #include "ltm.h"
  15. #include "lua.h"
  16. static int markobject (TObject *o);
  17. /*
  18. ** =======================================================
  19. ** REF mechanism
  20. ** =======================================================
  21. */
  22. int luaC_ref (TObject *o, int lock) {
  23. int ref;
  24. if (ttype(o) == LUA_T_NIL)
  25. ref = -1; /* special ref for nil */
  26. else {
  27. for (ref=0; ref<L->refSize; ref++)
  28. if (L->refArray[ref].status == FREE)
  29. break;
  30. if (ref == L->refSize) { /* no more empty spaces? */
  31. L->refArray = luaM_growvector(L->refArray, L->refSize, 1, struct ref,
  32. refEM, MAX_INT);
  33. L->refSize++;
  34. }
  35. L->refArray[ref].o = *o;
  36. L->refArray[ref].status = lock ? LOCK : HOLD;
  37. }
  38. return ref;
  39. }
  40. void lua_unref (int ref)
  41. {
  42. if (ref >= 0 && ref < L->refSize)
  43. L->refArray[ref].status = FREE;
  44. }
  45. TObject* luaC_getref (int ref)
  46. {
  47. if (ref == -1)
  48. return &luaO_nilobject;
  49. if (ref >= 0 && ref < L->refSize &&
  50. (L->refArray[ref].status == LOCK || L->refArray[ref].status == HOLD))
  51. return &L->refArray[ref].o;
  52. else
  53. return NULL;
  54. }
  55. static void travlock (void)
  56. {
  57. int i;
  58. for (i=0; i<L->refSize; i++)
  59. if (L->refArray[i].status == LOCK)
  60. markobject(&L->refArray[i].o);
  61. }
  62. static int ismarked (TObject *o)
  63. {
  64. /* valid only for locked objects */
  65. switch (o->ttype) {
  66. case LUA_T_STRING: case LUA_T_USERDATA:
  67. return o->value.ts->head.marked;
  68. case LUA_T_ARRAY:
  69. return o->value.a->head.marked;
  70. case LUA_T_CLOSURE:
  71. return o->value.cl->head.marked;
  72. case LUA_T_PROTO:
  73. return o->value.tf->head.marked;
  74. #ifdef DEBUG
  75. case LUA_T_LINE: case LUA_T_CLMARK:
  76. case LUA_T_CMARK: case LUA_T_PMARK:
  77. LUA_INTERNALERROR("invalid type");
  78. #endif
  79. default: /* nil, number or cproto */
  80. return 1;
  81. }
  82. }
  83. static void invalidaterefs (void)
  84. {
  85. int i;
  86. for (i=0; i<L->refSize; i++)
  87. if (L->refArray[i].status == HOLD && !ismarked(&L->refArray[i].o))
  88. L->refArray[i].status = COLLECTED;
  89. }
  90. void luaC_hashcallIM (Hash *l)
  91. {
  92. TObject t;
  93. ttype(&t) = LUA_T_ARRAY;
  94. for (; l; l=(Hash *)l->head.next) {
  95. avalue(&t) = l;
  96. luaD_gcIM(&t);
  97. }
  98. }
  99. void luaC_strcallIM (TaggedString *l)
  100. {
  101. TObject o;
  102. ttype(&o) = LUA_T_USERDATA;
  103. for (; l; l=(TaggedString *)l->head.next)
  104. if (l->constindex == -1) { /* is userdata? */
  105. tsvalue(&o) = l;
  106. luaD_gcIM(&o);
  107. }
  108. }
  109. static GCnode *listcollect (GCnode *l)
  110. {
  111. GCnode *frees = NULL;
  112. while (l) {
  113. GCnode *next = l->next;
  114. l->marked = 0;
  115. while (next && !next->marked) {
  116. l->next = next->next;
  117. next->next = frees;
  118. frees = next;
  119. next = l->next;
  120. }
  121. l = next;
  122. }
  123. return frees;
  124. }
  125. static void strmark (TaggedString *s)
  126. {
  127. if (!s->head.marked)
  128. s->head.marked = 1;
  129. }
  130. static void protomark (TProtoFunc *f) {
  131. if (!f->head.marked) {
  132. int i;
  133. f->head.marked = 1;
  134. strmark(f->fileName);
  135. for (i=0; i<f->nconsts; i++)
  136. markobject(&f->consts[i]);
  137. }
  138. }
  139. static void closuremark (Closure *f)
  140. {
  141. if (!f->head.marked) {
  142. int i;
  143. f->head.marked = 1;
  144. for (i=f->nelems; i>=0; i--)
  145. markobject(&f->consts[i]);
  146. }
  147. }
  148. static void hashmark (Hash *h)
  149. {
  150. if (!h->head.marked) {
  151. int i;
  152. h->head.marked = 1;
  153. for (i=0; i<nhash(h); i++) {
  154. Node *n = node(h,i);
  155. if (ttype(ref(n)) != LUA_T_NIL) {
  156. markobject(&n->ref);
  157. markobject(&n->val);
  158. }
  159. }
  160. }
  161. }
  162. static void globalmark (void)
  163. {
  164. TaggedString *g;
  165. for (g=(TaggedString *)L->rootglobal.next; g; g=(TaggedString *)g->head.next){
  166. LUA_ASSERT(g->constindex >= 0, "userdata in global list");
  167. if (g->u.s.globalval.ttype != LUA_T_NIL) {
  168. markobject(&g->u.s.globalval);
  169. strmark(g); /* cannot collect non nil global variables */
  170. }
  171. }
  172. }
  173. static int markobject (TObject *o)
  174. {
  175. switch (ttype(o)) {
  176. case LUA_T_USERDATA: case LUA_T_STRING:
  177. strmark(tsvalue(o));
  178. break;
  179. case LUA_T_ARRAY:
  180. hashmark(avalue(o));
  181. break;
  182. case LUA_T_CLOSURE: case LUA_T_CLMARK:
  183. closuremark(o->value.cl);
  184. break;
  185. case LUA_T_PROTO: case LUA_T_PMARK:
  186. protomark(o->value.tf);
  187. break;
  188. default: break; /* numbers, cprotos, etc */
  189. }
  190. return 0;
  191. }
  192. static void markall (void)
  193. {
  194. luaD_travstack(markobject); /* mark stack objects */
  195. globalmark(); /* mark global variable values and names */
  196. travlock(); /* mark locked objects */
  197. luaT_travtagmethods(markobject); /* mark fallbacks */
  198. }
  199. long lua_collectgarbage (long limit)
  200. {
  201. unsigned long recovered = L->nblocks; /* to subtract nblocks after gc */
  202. Hash *freetable;
  203. TaggedString *freestr;
  204. TProtoFunc *freefunc;
  205. Closure *freeclos;
  206. markall();
  207. invalidaterefs();
  208. freestr = luaS_collector();
  209. freetable = (Hash *)listcollect(&(L->roottable));
  210. freefunc = (TProtoFunc *)listcollect(&(L->rootproto));
  211. freeclos = (Closure *)listcollect(&(L->rootcl));
  212. L->GCthreshold *= 4; /* to avoid GC during GC */
  213. luaC_hashcallIM(freetable); /* GC tag methods for tables */
  214. luaC_strcallIM(freestr); /* GC tag methods for userdata */
  215. luaD_gcIM(&luaO_nilobject); /* GC tag method for nil (signal end of GC) */
  216. luaH_free(freetable);
  217. luaS_free(freestr);
  218. luaF_freeproto(freefunc);
  219. luaF_freeclosure(freeclos);
  220. recovered = recovered-L->nblocks;
  221. L->GCthreshold = (limit == 0) ? 2*L->nblocks : L->nblocks+limit;
  222. return recovered;
  223. }
  224. void luaC_checkGC (void)
  225. {
  226. if (L->nblocks >= L->GCthreshold)
  227. lua_collectgarbage(0);
  228. }