lstate.h 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244
  1. /*
  2. ** $Id: lstate.h,v 2.147 2017/11/03 12:12:30 roberto Exp roberto $
  3. ** Global State
  4. ** See Copyright Notice in lua.h
  5. */
  6. #ifndef lstate_h
  7. #define lstate_h
  8. #include "lua.h"
  9. #include "lobject.h"
  10. #include "ltm.h"
  11. #include "lzio.h"
  12. /*
  13. ** Some notes about garbage-collected objects: All objects in Lua must
  14. ** be kept somehow accessible until being freed, so all objects always
  15. ** belong to one (and only one) of these lists, using field 'next' of
  16. ** the 'CommonHeader' for the link:
  17. **
  18. ** 'allgc': all objects not marked for finalization;
  19. ** 'finobj': all objects marked for finalization;
  20. ** 'tobefnz': all objects ready to be finalized;
  21. ** 'fixedgc': all objects that are not to be collected (currently
  22. ** only small strings, such as reserved words).
  23. **
  24. ** Moreover, there is another set of lists that control gray objects.
  25. ** These lists are linked by fields 'gclist'. (All objects that
  26. ** can become gray have such a field. The field is not the same
  27. ** in all objects, but it always has this name.) Any gray object
  28. ** must belong to one of these lists, and all objects in these lists
  29. ** must be gray:
  30. **
  31. ** 'gray': regular gray objects, still waiting to be visited.
  32. ** 'grayagain': objects that must be revisited at the atomic phase.
  33. ** That includes
  34. ** - black objects got in a write barrier;
  35. ** - all kinds of weak tables during propagation phase;
  36. ** - all threads.
  37. ** 'weak': tables with weak values to be cleared;
  38. ** 'ephemeron': ephemeron tables with white->white entries;
  39. ** 'allweak': tables with weak keys and/or weak values to be cleared.
  40. ** There is also a list 'protogray' for prototypes that need to have
  41. ** their caches cleared.
  42. */
  43. struct lua_longjmp; /* defined in ldo.c */
  44. /*
  45. ** Atomic type (relative to signals) to better ensure that 'lua_sethook'
  46. ** is thread safe
  47. */
  48. #if !defined(l_signalT)
  49. #include <signal.h>
  50. #define l_signalT sig_atomic_t
  51. #endif
  52. /* extra stack space to handle TM calls and some other extras */
  53. #define EXTRA_STACK 5
  54. #define BASIC_STACK_SIZE (2*LUA_MINSTACK)
  55. /* kinds of Garbage Collection */
  56. #define KGC_INC 0 /* incremental gc */
  57. #define KGC_GEN 1 /* generational gc */
  58. typedef struct stringtable {
  59. TString **hash;
  60. int nuse; /* number of elements */
  61. int size;
  62. } stringtable;
  63. /*
  64. ** Information about a call.
  65. */
  66. typedef struct CallInfo {
  67. StkId func; /* function index in the stack */
  68. struct CallInfo *previous, *next; /* dynamic call link */
  69. } CallInfo;
  70. /*
  71. ** Bits in CallInfo status
  72. */
  73. #define CIST_OAH (1<<0) /* original value of 'allowhook' */
  74. #define CIST_HOOKED (1<<1) /* call is running a debug hook */
  75. #define CIST_FRESH (1<<2) /* call is running on a fresh invocation
  76. of luaV_execute */
  77. #define CIST_YPCALL (1<<3) /* call is a yieldable protected call */
  78. #define CIST_TAIL (1<<4) /* call was tail called */
  79. #define CIST_HOOKYIELD (1<<5) /* last hook called yielded */
  80. #define CIST_LEQ (1<<6) /* using __lt for __le */
  81. #define CIST_FIN (1<<7) /* call is running a finalizer */
  82. #define isLua(func) isLfunction(s2v(func))
  83. /* assume that CIST_OAH has offset 0 and that 'v' is strictly 0/1 */
  84. #define setoah(st,v) ((st) = ((st) & ~CIST_OAH) | (v))
  85. #define getoah(st) ((st) & CIST_OAH)
  86. /*
  87. ** 'global state', shared by all threads of this state
  88. */
  89. typedef struct global_State {
  90. lua_Alloc frealloc; /* function to reallocate memory */
  91. void *ud; /* auxiliary data to 'frealloc' */
  92. l_mem totalbytes; /* number of bytes currently allocated - GCdebt */
  93. l_mem GCdebt; /* bytes allocated not yet compensated by the collector */
  94. lu_mem GCestimate; /* an estimate of the non-garbage memory in use */
  95. stringtable strt; /* hash table for strings */
  96. TValue l_registry;
  97. unsigned int seed; /* randomized seed for hashes */
  98. lu_byte currentwhite;
  99. lu_byte gcstate; /* state of garbage collector */
  100. lu_byte gckind; /* kind of GC running */
  101. lu_byte genminormul; /* control for minor generational collections */
  102. lu_byte genmajormul; /* control for major generational collections */
  103. lu_byte gcrunning; /* true if GC is running */
  104. lu_byte gcemergency; /* true if this is an emergency collection */
  105. lu_byte gcpause; /* size of pause between successive GCs */
  106. lu_byte gcstepmul; /* GC "speed" */
  107. lu_byte gcstepsize; /* (log2 of) GC granularity */
  108. GCObject *allgc; /* list of all collectable objects */
  109. GCObject **sweepgc; /* current position of sweep in list */
  110. GCObject *finobj; /* list of collectable objects with finalizers */
  111. GCObject *gray; /* list of gray objects */
  112. GCObject *grayagain; /* list of objects to be traversed atomically */
  113. GCObject *weak; /* list of tables with weak values */
  114. GCObject *ephemeron; /* list of ephemeron tables (weak keys) */
  115. GCObject *allweak; /* list of all-weak tables */
  116. GCObject *protogray; /* list of prototypes with "new" caches */
  117. GCObject *tobefnz; /* list of userdata to be GC */
  118. GCObject *fixedgc; /* list of objects not to be collected */
  119. /* fields for generational collector */
  120. GCObject *survival; /* start of objects that survived one GC cycle */
  121. GCObject *old; /* start of old objects */
  122. GCObject *reallyold; /* old objects with more than one cycle */
  123. GCObject *finobjsur; /* list of survival objects with finalizers */
  124. GCObject *finobjold; /* list of old objects with finalizers */
  125. GCObject *finobjrold; /* list of really old objects with finalizers */
  126. struct lua_State *twups; /* list of threads with open upvalues */
  127. lua_CFunction panic; /* to be called in unprotected errors */
  128. struct lua_State *mainthread;
  129. const lua_Number *version; /* pointer to version number */
  130. TString *nfield; /* string "n" (key in vararg tables) */
  131. TString *tmname[TM_N]; /* array with tag-method names */
  132. struct Table *mt[LUA_NUMTAGS]; /* metatables for basic types */
  133. TString *strcache[STRCACHE_N][STRCACHE_M]; /* cache for strings in API */
  134. } global_State;
  135. /*
  136. ** 'per thread' state
  137. */
  138. struct lua_State {
  139. CommonHeader;
  140. unsigned short nci; /* number of items in 'ci' list */
  141. lu_byte status;
  142. StkId top; /* first free slot in the stack */
  143. global_State *l_G;
  144. CallInfo *ci; /* call info for current function */
  145. StkId func; /* current function */
  146. const Instruction *oldpc; /* last pc traced */
  147. StkId stack_last; /* last free slot in the stack */
  148. StkId stack; /* stack base */
  149. UpVal *openupval; /* list of open upvalues in this stack */
  150. GCObject *gclist;
  151. struct lua_State *twups; /* list of threads with open upvalues */
  152. struct lua_longjmp *errorJmp; /* current error recover point */
  153. CallInfo base_ci; /* CallInfo for first level (C calling Lua) */
  154. volatile lua_Hook hook;
  155. ptrdiff_t errfunc; /* current error handling function (stack index) */
  156. int stacksize;
  157. int basehookcount;
  158. int hookcount;
  159. unsigned short nny; /* number of non-yieldable calls in stack */
  160. unsigned short nCcalls; /* number of nested C calls */
  161. l_signalT hookmask;
  162. lu_byte allowhook;
  163. };
  164. #define G(L) (L->l_G)
  165. /*
  166. ** Union of all collectable objects (only for conversions)
  167. */
  168. union GCUnion {
  169. GCObject gc; /* common header */
  170. struct TString ts;
  171. struct Udata u;
  172. union Closure cl;
  173. struct Table h;
  174. struct Proto p;
  175. struct lua_State th; /* thread */
  176. struct UpVal upv;
  177. };
  178. #define cast_u(o) cast(union GCUnion *, (o))
  179. /* macros to convert a GCObject into a specific value */
  180. #define gco2ts(o) \
  181. check_exp(novariant((o)->tt) == LUA_TSTRING, &((cast_u(o))->ts))
  182. #define gco2u(o) check_exp((o)->tt == LUA_TUSERDATA, &((cast_u(o))->u))
  183. #define gco2lcl(o) check_exp((o)->tt == LUA_TLCL, &((cast_u(o))->cl.l))
  184. #define gco2ccl(o) check_exp((o)->tt == LUA_TCCL, &((cast_u(o))->cl.c))
  185. #define gco2cl(o) \
  186. check_exp(novariant((o)->tt) == LUA_TFUNCTION, &((cast_u(o))->cl))
  187. #define gco2t(o) check_exp((o)->tt == LUA_TTABLE, &((cast_u(o))->h))
  188. #define gco2p(o) check_exp((o)->tt == LUA_TPROTO, &((cast_u(o))->p))
  189. #define gco2th(o) check_exp((o)->tt == LUA_TTHREAD, &((cast_u(o))->th))
  190. #define gco2upv(o) check_exp((o)->tt == LUA_TUPVAL, &((cast_u(o))->upv))
  191. /* macro to convert a Lua object into a GCObject */
  192. #define obj2gco(v) (&(cast_u(v)->gc))
  193. /* actual number of total bytes allocated */
  194. #define gettotalbytes(g) cast(lu_mem, (g)->totalbytes + (g)->GCdebt)
  195. LUAI_FUNC void luaE_setdebt (global_State *g, l_mem debt);
  196. LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
  197. LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L);
  198. LUAI_FUNC void luaE_freeCI (lua_State *L);
  199. LUAI_FUNC void luaE_shrinkCI (lua_State *L);
  200. #endif