lgc.c 5.6 KB

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