The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/contrib/openzfs/module/lua/lstate.h

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

    1 /*
    2 ** $Id: lstate.h,v 2.82.1.1 2013/04/12 18:48:47 roberto Exp $
    3 ** Global State
    4 ** See Copyright Notice in lua.h
    5 */
    6 
    7 #ifndef lstate_h
    8 #define lstate_h
    9 
   10 #include <sys/lua/lua.h>
   11 
   12 #include "lobject.h"
   13 #include "ltm.h"
   14 #include "lzio.h"
   15 
   16 
   17 /*
   18 
   19 ** Some notes about garbage-collected objects:  All objects in Lua must
   20 ** be kept somehow accessible until being freed.
   21 **
   22 ** Lua keeps most objects linked in list g->allgc. The link uses field
   23 ** 'next' of the CommonHeader.
   24 **
   25 ** Strings are kept in several lists headed by the array g->strt.hash.
   26 **
   27 ** Open upvalues are not subject to independent garbage collection. They
   28 ** are collected together with their respective threads. Lua keeps a
   29 ** double-linked list with all open upvalues (g->uvhead) so that it can
   30 ** mark objects referred by them. (They are always gray, so they must
   31 ** be remarked in the atomic step. Usually their contents would be marked
   32 ** when traversing the respective threads, but the thread may already be
   33 ** dead, while the upvalue is still accessible through closures.)
   34 **
   35 ** Objects with finalizers are kept in the list g->finobj.
   36 **
   37 ** The list g->tobefnz links all objects being finalized.
   38 
   39 */
   40 
   41 
   42 struct lua_longjmp;  /* defined in ldo.c */
   43 
   44 
   45 
   46 /* extra stack space to handle TM calls and some other extras */
   47 #define EXTRA_STACK   5
   48 
   49 
   50 #define BASIC_STACK_SIZE        (2*LUA_MINSTACK)
   51 
   52 
   53 /* kinds of Garbage Collection */
   54 #define KGC_NORMAL      0
   55 #define KGC_EMERGENCY   1       /* gc was forced by an allocation failure */
   56 #define KGC_GEN         2       /* generational collection */
   57 
   58 
   59 typedef struct stringtable {
   60   GCObject **hash;
   61   lu_int32 nuse;  /* number of elements */
   62   int size;
   63 } stringtable;
   64 
   65 
   66 /*
   67 ** information about a call
   68 */
   69 typedef struct CallInfo {
   70   StkId func;  /* function index in the stack */
   71   StkId top;  /* top for this function */
   72   struct CallInfo *previous, *next;  /* dynamic call link */
   73   short nresults;  /* expected number of results from this function */
   74   lu_byte callstatus;
   75   ptrdiff_t extra;
   76   union {
   77     struct {  /* only for Lua functions */
   78       StkId base;  /* base for this function */
   79       const Instruction *savedpc;
   80     } l;
   81     struct {  /* only for C functions */
   82       int ctx;  /* context info. in case of yields */
   83       lua_CFunction k;  /* continuation in case of yields */
   84       ptrdiff_t old_errfunc;
   85       lu_byte old_allowhook;
   86       lu_byte status;
   87     } c;
   88   } u;
   89 } CallInfo;
   90 
   91 
   92 /*
   93 ** Bits in CallInfo status
   94 */
   95 #define CIST_LUA        (1<<0)  /* call is running a Lua function */
   96 #define CIST_HOOKED     (1<<1)  /* call is running a debug hook */
   97 #define CIST_REENTRY    (1<<2)  /* call is running on same invocation of
   98                                    luaV_execute of previous call */
   99 #define CIST_YIELDED    (1<<3)  /* call reentered after suspension */
  100 #define CIST_YPCALL     (1<<4)  /* call is a yieldable protected call */
  101 #define CIST_STAT       (1<<5)  /* call has an error status (pcall) */
  102 #define CIST_TAIL       (1<<6)  /* call was tail called */
  103 #define CIST_HOOKYIELD  (1<<7)  /* last hook called yielded */
  104 
  105 
  106 #define isLua(ci)       ((ci)->callstatus & CIST_LUA)
  107 
  108 
  109 /*
  110 ** `global state', shared by all threads of this state
  111 */
  112 typedef struct global_State {
  113   lua_Alloc frealloc;  /* function to reallocate memory */
  114   void *ud;         /* auxiliary data to `frealloc' */
  115   lu_mem totalbytes;  /* number of bytes currently allocated - GCdebt */
  116   l_mem GCdebt;  /* bytes allocated not yet compensated by the collector */
  117   lu_mem GCmemtrav;  /* memory traversed by the GC */
  118   lu_mem GCestimate;  /* an estimate of the non-garbage memory in use */
  119   stringtable strt;  /* hash table for strings */
  120   TValue l_registry;
  121   unsigned int seed;  /* randomized seed for hashes */
  122   lu_byte currentwhite;
  123   lu_byte gcstate;  /* state of garbage collector */
  124   lu_byte gckind;  /* kind of GC running */
  125   lu_byte gcrunning;  /* true if GC is running */
  126   int sweepstrgc;  /* position of sweep in `strt' */
  127   GCObject *allgc;  /* list of all collectable objects */
  128   GCObject *finobj;  /* list of collectable objects with finalizers */
  129   GCObject **sweepgc;  /* current position of sweep in list 'allgc' */
  130   GCObject **sweepfin;  /* current position of sweep in list 'finobj' */
  131   GCObject *gray;  /* list of gray objects */
  132   GCObject *grayagain;  /* list of objects to be traversed atomically */
  133   GCObject *weak;  /* list of tables with weak values */
  134   GCObject *ephemeron;  /* list of ephemeron tables (weak keys) */
  135   GCObject *allweak;  /* list of all-weak tables */
  136   GCObject *tobefnz;  /* list of userdata to be GC */
  137   UpVal uvhead;  /* head of double-linked list of all open upvalues */
  138   Mbuffer buff;  /* temporary buffer for string concatenation */
  139   int gcpause;  /* size of pause between successive GCs */
  140   int gcmajorinc;  /* pause between major collections (only in gen. mode) */
  141   int gcstepmul;  /* GC `granularity' */
  142   lua_CFunction panic;  /* to be called in unprotected errors */
  143   struct lua_State *mainthread;
  144   const lua_Number *version;  /* pointer to version number */
  145   TString *memerrmsg;  /* memory-error message */
  146   TString *tmname[TM_N];  /* array with tag-method names */
  147   struct Table *mt[LUA_NUMTAGS];  /* metatables for basic types */
  148 } global_State;
  149 
  150 
  151 /*
  152 ** `per thread' state
  153 */
  154 struct lua_State {
  155   CommonHeader;
  156   lu_byte status;
  157   StkId top;  /* first free slot in the stack */
  158   global_State *l_G;
  159   CallInfo *ci;  /* call info for current function */
  160   const Instruction *oldpc;  /* last pc traced */
  161   StkId stack_last;  /* last free slot in the stack */
  162   StkId stack;  /* stack base */
  163   int stacksize;
  164   unsigned short nny;  /* number of non-yieldable calls in stack */
  165   unsigned short nCcalls;  /* number of nested C calls */
  166   lu_byte hookmask;
  167   lu_byte allowhook;
  168   lu_byte runerror; /* handling a runtime error */
  169   int basehookcount;
  170   int hookcount;
  171   lua_Hook hook;
  172   GCObject *openupval;  /* list of open upvalues in this stack */
  173   GCObject *gclist;
  174   struct lua_longjmp *errorJmp;  /* current error recover point */
  175   ptrdiff_t errfunc;  /* current error handling function (stack index) */
  176   CallInfo base_ci;  /* CallInfo for first level (C calling Lua) */
  177 };
  178 
  179 
  180 #define G(L)    (L->l_G)
  181 
  182 
  183 /*
  184 ** Union of all collectable objects
  185 */
  186 union GCObject {
  187   GCheader gch;  /* common header */
  188   union TString ts;
  189   union Udata u;
  190   union Closure cl;
  191   struct Table h;
  192   struct Proto p;
  193   struct UpVal uv;
  194   struct lua_State th;  /* thread */
  195 };
  196 
  197 
  198 #define gch(o)          (&(o)->gch)
  199 
  200 /* macros to convert a GCObject into a specific value */
  201 #define rawgco2ts(o)  \
  202         check_exp(novariant((o)->gch.tt) == LUA_TSTRING, &((o)->ts))
  203 #define gco2ts(o)       (&rawgco2ts(o)->tsv)
  204 #define rawgco2u(o)     check_exp((o)->gch.tt == LUA_TUSERDATA, &((o)->u))
  205 #define gco2u(o)        (&rawgco2u(o)->uv)
  206 #define gco2lcl(o)      check_exp((o)->gch.tt == LUA_TLCL, &((o)->cl.l))
  207 #define gco2ccl(o)      check_exp((o)->gch.tt == LUA_TCCL, &((o)->cl.c))
  208 #define gco2cl(o)  \
  209         check_exp(novariant((o)->gch.tt) == LUA_TFUNCTION, &((o)->cl))
  210 #define gco2t(o)        check_exp((o)->gch.tt == LUA_TTABLE, &((o)->h))
  211 #define gco2p(o)        check_exp((o)->gch.tt == LUA_TPROTO, &((o)->p))
  212 #define gco2uv(o)       check_exp((o)->gch.tt == LUA_TUPVAL, &((o)->uv))
  213 #define gco2th(o)       check_exp((o)->gch.tt == LUA_TTHREAD, &((o)->th))
  214 
  215 /* macro to convert any Lua object into a GCObject */
  216 #define obj2gco(v)      (cast(GCObject *, (v)))
  217 
  218 
  219 /* actual number of total bytes allocated */
  220 #define gettotalbytes(g)        ((g)->totalbytes + (g)->GCdebt)
  221 
  222 LUAI_FUNC void luaE_setdebt (global_State *g, l_mem debt);
  223 LUAI_FUNC void luaE_freethread (lua_State *L, lua_State *L1);
  224 LUAI_FUNC CallInfo *luaE_extendCI (lua_State *L);
  225 LUAI_FUNC void luaE_freeCI (lua_State *L);
  226 
  227 
  228 #endif

Cache object: 6405e3062ddef6d7ef9b99f3f017ce40


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.