- [NEW] Ara usa Lua 5.5.0
- [NEW] Lua ara es una llibreria estàtica, pa no compilarlo cada vegada (Linux, falta en Windows) - [FIX] Arreglats mig kilo de warnings - [FIX] include <mutex> per a lua.debug
This commit is contained in:
151
source/external/lua/lgc.h
vendored
151
source/external/lua/lgc.h
vendored
@@ -8,6 +8,9 @@
|
||||
#define lgc_h
|
||||
|
||||
|
||||
#include <stddef.h>
|
||||
|
||||
|
||||
#include "lobject.h"
|
||||
#include "lstate.h"
|
||||
|
||||
@@ -20,8 +23,9 @@
|
||||
** never point to a white one. Moreover, any gray object must be in a
|
||||
** "gray list" (gray, grayagain, weak, allweak, ephemeron) so that it
|
||||
** can be visited again before finishing the collection cycle. (Open
|
||||
** upvalues are an exception to this rule.) These lists have no meaning
|
||||
** when the invariant is not being enforced (e.g., sweep phase).
|
||||
** upvalues are an exception to this rule, as they are attached to
|
||||
** a corresponding thread.) These lists have no meaning when the
|
||||
** invariant is not being enforced (e.g., sweep phase).
|
||||
*/
|
||||
|
||||
|
||||
@@ -45,10 +49,10 @@
|
||||
|
||||
/*
|
||||
** macro to tell when main invariant (white objects cannot point to black
|
||||
** ones) must be kept. During a collection, the sweep
|
||||
** phase may break the invariant, as objects turned white may point to
|
||||
** still-black objects. The invariant is restored when sweep ends and
|
||||
** all objects are white again.
|
||||
** ones) must be kept. During a collection, the sweep phase may break
|
||||
** the invariant, as objects turned white may point to still-black
|
||||
** objects. The invariant is restored when sweep ends and all objects
|
||||
** are white again.
|
||||
*/
|
||||
|
||||
#define keepinvariant(g) ((g)->gcstate <= GCSatomic)
|
||||
@@ -117,69 +121,144 @@
|
||||
#define setage(o,a) ((o)->marked = cast_byte(((o)->marked & (~AGEBITS)) | a))
|
||||
#define isold(o) (getage(o) > G_SURVIVAL)
|
||||
|
||||
#define changeage(o,f,t) \
|
||||
check_exp(getage(o) == (f), (o)->marked ^= ((f)^(t)))
|
||||
|
||||
/*
|
||||
** In generational mode, objects are created 'new'. After surviving one
|
||||
** cycle, they become 'survival'. Both 'new' and 'survival' can point
|
||||
** to any other object, as they are traversed at the end of the cycle.
|
||||
** We call them both 'young' objects.
|
||||
** If a survival object survives another cycle, it becomes 'old1'.
|
||||
** 'old1' objects can still point to survival objects (but not to
|
||||
** new objects), so they still must be traversed. After another cycle
|
||||
** (that, being old, 'old1' objects will "survive" no matter what)
|
||||
** finally the 'old1' object becomes really 'old', and then they
|
||||
** are no more traversed.
|
||||
**
|
||||
** To keep its invariants, the generational mode uses the same barriers
|
||||
** also used by the incremental mode. If a young object is caught in a
|
||||
** forward barrier, it cannot become old immediately, because it can
|
||||
** still point to other young objects. Instead, it becomes 'old0',
|
||||
** which in the next cycle becomes 'old1'. So, 'old0' objects is
|
||||
** old but can point to new and survival objects; 'old1' is old
|
||||
** but cannot point to new objects; and 'old' cannot point to any
|
||||
** young object.
|
||||
**
|
||||
** If any old object ('old0', 'old1', 'old') is caught in a back
|
||||
** barrier, it becomes 'touched1' and goes into a gray list, to be
|
||||
** visited at the end of the cycle. There it evolves to 'touched2',
|
||||
** which can point to survivals but not to new objects. In yet another
|
||||
** cycle then it becomes 'old' again.
|
||||
**
|
||||
** The generational mode must also control the colors of objects,
|
||||
** because of the barriers. While the mutator is running, young objects
|
||||
** are kept white. 'old', 'old1', and 'touched2' objects are kept black,
|
||||
** as they cannot point to new objects; exceptions are threads and open
|
||||
** upvalues, which age to 'old1' and 'old' but are kept gray. 'old0'
|
||||
** objects may be gray or black, as in the incremental mode. 'touched1'
|
||||
** objects are kept gray, as they must be visited again at the end of
|
||||
** the cycle.
|
||||
*/
|
||||
|
||||
|
||||
/* Default Values for GC parameters */
|
||||
#define LUAI_GENMAJORMUL 100
|
||||
/*
|
||||
** {======================================================
|
||||
** Default Values for GC parameters
|
||||
** =======================================================
|
||||
*/
|
||||
|
||||
/*
|
||||
** Minor collections will shift to major ones after LUAI_MINORMAJOR%
|
||||
** bytes become old.
|
||||
*/
|
||||
#define LUAI_MINORMAJOR 70
|
||||
|
||||
/*
|
||||
** Major collections will shift to minor ones after a collection
|
||||
** collects at least LUAI_MAJORMINOR% of the new bytes.
|
||||
*/
|
||||
#define LUAI_MAJORMINOR 50
|
||||
|
||||
/*
|
||||
** A young (minor) collection will run after creating LUAI_GENMINORMUL%
|
||||
** new bytes.
|
||||
*/
|
||||
#define LUAI_GENMINORMUL 20
|
||||
|
||||
/* wait memory to double before starting new cycle */
|
||||
#define LUAI_GCPAUSE 200
|
||||
|
||||
/* incremental */
|
||||
|
||||
/* Number of bytes must be LUAI_GCPAUSE% before starting new cycle */
|
||||
#define LUAI_GCPAUSE 250
|
||||
|
||||
/*
|
||||
** some gc parameters are stored divided by 4 to allow a maximum value
|
||||
** up to 1023 in a 'lu_byte'.
|
||||
** Step multiplier: The collector handles LUAI_GCMUL% work units for
|
||||
** each new allocated word. (Each "work unit" corresponds roughly to
|
||||
** sweeping one object or traversing one slot.)
|
||||
*/
|
||||
#define getgcparam(p) ((p) * 4)
|
||||
#define setgcparam(p,v) ((p) = (v) / 4)
|
||||
#define LUAI_GCMUL 200
|
||||
|
||||
#define LUAI_GCMUL 100
|
||||
/* How many bytes to allocate before next GC step */
|
||||
#define LUAI_GCSTEPSIZE (200 * sizeof(Table))
|
||||
|
||||
/* how much to allocate before next GC step (log2) */
|
||||
#define LUAI_GCSTEPSIZE 13 /* 8 KB */
|
||||
|
||||
#define setgcparam(g,p,v) (g->gcparams[LUA_GCP##p] = luaO_codeparam(v))
|
||||
#define applygcparam(g,p,x) luaO_applyparam(g->gcparams[LUA_GCP##p], x)
|
||||
|
||||
/* }====================================================== */
|
||||
|
||||
|
||||
/*
|
||||
** Check whether the declared GC mode is generational. While in
|
||||
** generational mode, the collector can go temporarily to incremental
|
||||
** mode to improve performance. This is signaled by 'g->lastatomic != 0'.
|
||||
** Control when GC is running:
|
||||
*/
|
||||
#define isdecGCmodegen(g) (g->gckind == KGC_GEN || g->lastatomic != 0)
|
||||
#define GCSTPUSR 1 /* bit true when GC stopped by user */
|
||||
#define GCSTPGC 2 /* bit true when GC stopped by itself */
|
||||
#define GCSTPCLS 4 /* bit true when closing Lua state */
|
||||
#define gcrunning(g) ((g)->gcstp == 0)
|
||||
|
||||
|
||||
/*
|
||||
** Does one step of collection when debt becomes positive. 'pre'/'pos'
|
||||
** Does one step of collection when debt becomes zero. 'pre'/'pos'
|
||||
** allows some adjustments to be done only when needed. macro
|
||||
** 'condchangemem' is used only for heavy tests (forcing a full
|
||||
** GC cycle on every opportunity)
|
||||
*/
|
||||
|
||||
#if !defined(HARDMEMTESTS)
|
||||
#define condchangemem(L,pre,pos,emg) ((void)0)
|
||||
#else
|
||||
#define condchangemem(L,pre,pos,emg) \
|
||||
{ if (gcrunning(G(L))) { pre; luaC_fullgc(L, emg); pos; } }
|
||||
#endif
|
||||
|
||||
#define luaC_condGC(L,pre,pos) \
|
||||
{ if (G(L)->GCdebt > 0) { pre; luaC_step(L); pos;}; \
|
||||
condchangemem(L,pre,pos); }
|
||||
{ if (G(L)->GCdebt <= 0) { pre; luaC_step(L); pos;}; \
|
||||
condchangemem(L,pre,pos,0); }
|
||||
|
||||
/* more often than not, 'pre'/'pos' are empty */
|
||||
#define luaC_checkGC(L) luaC_condGC(L,(void)0,(void)0)
|
||||
|
||||
|
||||
#define luaC_barrier(L,p,v) ( \
|
||||
(iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \
|
||||
luaC_barrier_(L,obj2gco(p),gcvalue(v)) : cast_void(0))
|
||||
|
||||
#define luaC_barrierback(L,p,v) ( \
|
||||
(iscollectable(v) && isblack(p) && iswhite(gcvalue(v))) ? \
|
||||
luaC_barrierback_(L,p) : cast_void(0))
|
||||
|
||||
#define luaC_objbarrier(L,p,o) ( \
|
||||
(isblack(p) && iswhite(o)) ? \
|
||||
luaC_barrier_(L,obj2gco(p),obj2gco(o)) : cast_void(0))
|
||||
|
||||
#define luaC_barrier(L,p,v) ( \
|
||||
iscollectable(v) ? luaC_objbarrier(L,p,gcvalue(v)) : cast_void(0))
|
||||
|
||||
#define luaC_objbarrierback(L,p,o) ( \
|
||||
(isblack(p) && iswhite(o)) ? luaC_barrierback_(L,p) : cast_void(0))
|
||||
|
||||
#define luaC_barrierback(L,p,v) ( \
|
||||
iscollectable(v) ? luaC_objbarrierback(L, p, gcvalue(v)) : cast_void(0))
|
||||
|
||||
LUAI_FUNC void luaC_fix (lua_State *L, GCObject *o);
|
||||
LUAI_FUNC void luaC_freeallobjects (lua_State *L);
|
||||
LUAI_FUNC void luaC_step (lua_State *L);
|
||||
LUAI_FUNC void luaC_runtilstate (lua_State *L, int statesmask);
|
||||
LUAI_FUNC void luaC_runtilstate (lua_State *L, int state, int fast);
|
||||
LUAI_FUNC void luaC_fullgc (lua_State *L, int isemergency);
|
||||
LUAI_FUNC GCObject *luaC_newobj (lua_State *L, int tt, size_t sz);
|
||||
LUAI_FUNC GCObject *luaC_newobj (lua_State *L, lu_byte tt, size_t sz);
|
||||
LUAI_FUNC GCObject *luaC_newobjdt (lua_State *L, lu_byte tt, size_t sz,
|
||||
size_t offset);
|
||||
LUAI_FUNC void luaC_barrier_ (lua_State *L, GCObject *o, GCObject *v);
|
||||
LUAI_FUNC void luaC_barrierback_ (lua_State *L, GCObject *o);
|
||||
LUAI_FUNC void luaC_checkfinalizer (lua_State *L, GCObject *o, Table *mt);
|
||||
|
||||
Reference in New Issue
Block a user