diff options
| author | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2022-11-01 15:42:08 -0300 |
|---|---|---|
| committer | Roberto Ierusalimschy <roberto@inf.puc-rio.br> | 2022-11-01 15:42:08 -0300 |
| commit | 8047b2d03eaaeee44871a11f8d3a3135f2639b1a (patch) | |
| tree | 2b2d246e2c63ba0accd7c3463a0d331669abe1ef /lmem.h | |
| parent | ee645472ebe153e2c6669c84a632297a8110bdb6 (diff) | |
| download | lua-8047b2d03eaaeee44871a11f8d3a3135f2639b1a.tar.gz lua-8047b2d03eaaeee44871a11f8d3a3135f2639b1a.tar.bz2 lua-8047b2d03eaaeee44871a11f8d3a3135f2639b1a.zip | |
Tables have a 'lastfree' information only when needed
Only tables with some minimum number of entries in their hash part
have a 'lastfree' field, kept in a header before the node vector.
Diffstat (limited to 'lmem.h')
| -rw-r--r-- | lmem.h | 2 |
1 files changed, 2 insertions, 0 deletions
| @@ -63,6 +63,8 @@ | |||
| 63 | 63 | ||
| 64 | #define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) | 64 | #define luaM_newobject(L,tag,s) luaM_malloc_(L, (s), tag) |
| 65 | 65 | ||
| 66 | #define luaM_newblock(L, size) luaM_newvector(L, size, char) | ||
| 67 | |||
| 66 | #define luaM_growvector(L,v,nelems,size,t,limit,e) \ | 68 | #define luaM_growvector(L,v,nelems,size,t,limit,e) \ |
| 67 | ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ | 69 | ((v)=cast(t *, luaM_growaux_(L,v,nelems,&(size),sizeof(t), \ |
| 68 | luaM_limitN(limit,t),e))) | 70 | luaM_limitN(limit,t),e))) |