File Manager

003 File Manager

Current Path: /usr/src/contrib/lua/src

usr / src / contrib / lua / src /

📁 ..
📄 Makefile(7.34 KB)
📄 lapi.c(34.08 KB)
📄 lapi.h(1.27 KB)
📄 lauxlib.c(30.94 KB)
📄 lauxlib.h(8.64 KB)
📄 lbaselib.c(14.44 KB)
📄 lcode.c(49.85 KB)
📄 lcode.h(3.71 KB)
📄 lcorolib.c(4.57 KB)
📄 lctype.c(2.4 KB)
📄 lctype.h(2.07 KB)
📄 ldblib.c(12.94 KB)
📄 ldebug.c(24.61 KB)
📄 ldebug.h(1.87 KB)
📄 ldo.c(27.19 KB)
📄 ldo.h(2.77 KB)
📄 ldump.c(4.66 KB)
📄 lfunc.c(8.95 KB)
📄 lfunc.h(1.72 KB)
📄 lgc.c(54.47 KB)
📄 lgc.h(5.87 KB)
📄 linit.c(1.58 KB)
📄 liolib.c(21.25 KB)
📄 ljumptab.h(1.62 KB)
📄 llex.c(16.38 KB)
📄 llex.h(2.35 KB)
📄 llimits.h(8.72 KB)
📄 lmathlib.c(18.43 KB)
📄 lmem.c(5.83 KB)
📄 lmem.h(3.29 KB)
📄 loadlib.c(22.39 KB)
📄 lobject.c(18.45 KB)
📄 lobject.h(21.49 KB)
📄 lopcodes.c(4.03 KB)
📄 lopcodes.h(12.38 KB)
📄 lopnames.h(1.12 KB)
📄 loslib.c(11.53 KB)
📄 lparser.c(54.72 KB)
📄 lparser.h(5.8 KB)
📄 lprefix.h(828 B)
📄 lstate.c(10.73 KB)
📄 lstate.h(13.24 KB)
📄 lstring.c(7.32 KB)
📄 lstring.h(1.57 KB)
📄 lstrlib.c(52.83 KB)
📄 ltable.c(29.89 KB)
📄 ltable.h(1.92 KB)
📄 ltablib.c(12.82 KB)
📄 ltm.c(7.97 KB)
📄 ltm.h(2.84 KB)
📄 lua.c(18.46 KB)
📄 lua.h(15.4 KB)
📄 lua.hpp(191 B)
📄 luac.c(14.79 KB)
📄 luaconf.h.dist(20.27 KB)
📄 lualib.h(1.16 KB)
📄 lundump.c(7.68 KB)
📄 lundump.h(863 B)
📄 lutf8lib.c(7.9 KB)
📄 lvm.c(55.76 KB)
📄 lvm.h(4.25 KB)
📄 lzio.c(1.29 KB)
📄 lzio.h(1.4 KB)

Editing: lmem.c

/*
** $Id: lmem.c $
** Interface to Memory Manager
** See Copyright Notice in lua.h
*/

#define lmem_c
#define LUA_CORE

#include "lprefix.h"

#include <stddef.h>

#include "lua.h"

#include "ldebug.h"
#include "ldo.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"

#if defined(EMERGENCYGCTESTS)
/*
** First allocation will fail whenever not building initial state
** and not shrinking a block. (This fail will trigger 'tryagain' and
** a full GC cycle at every allocation.)
*/
static void *firsttry (global_State *g, void *block, size_t os, size_t ns) {
  if (ttisnil(&g->nilvalue) && ns > os)
    return NULL;  /* fail */
  else  /* normal allocation */
    return (*g->frealloc)(g->ud, block, os, ns);
}
#else
#define firsttry(g,block,os,ns)    ((*g->frealloc)(g->ud, block, os, ns))
#endif

/*
** About the realloc function:
** void *frealloc (void *ud, void *ptr, size_t osize, size_t nsize);
** ('osize' is the old size, 'nsize' is the new size)
**
** - frealloc(ud, p, x, 0) frees the block 'p' and returns NULL.
** Particularly, frealloc(ud, NULL, 0, 0) does nothing,
** which is equivalent to free(NULL) in ISO C.
**
** - frealloc(ud, NULL, x, s) creates a new block of size 's'
** (no matter 'x'). Returns NULL if it cannot create the new block.
**
** - otherwise, frealloc(ud, b, x, y) reallocates the block 'b' from
** size 'x' to size 'y'. Returns NULL if it cannot reallocate the
** block to the new size.
*/

/*
** {==================================================================
** Functions to allocate/deallocate arrays for the Parser
** ===================================================================
*/

/*
** Minimum size for arrays during parsing, to avoid overhead of
** reallocating to size 1, then 2, and then 4. All these arrays
** will be reallocated to exact sizes or erased when parsing ends.
*/
#define MINSIZEARRAY	4

void *luaM_growaux_ (lua_State *L, void *block, int nelems, int *psize,
                     int size_elems, int limit, const char *what) {
  void *newblock;
  int size = *psize;
  if (nelems + 1 <= size)  /* does one extra element still fit? */
    return block;  /* nothing to be done */
  if (size >= limit / 2) {  /* cannot double it? */
    if (unlikely(size >= limit))  /* cannot grow even a little? */
      luaG_runerror(L, "too many %s (limit is %d)", what, limit);
    size = limit;  /* still have at least one free place */
  }
  else {
    size *= 2;
    if (size < MINSIZEARRAY)
      size = MINSIZEARRAY;  /* minimum size */
  }
  lua_assert(nelems + 1 <= size && size <= limit);
  /* 'limit' ensures that multiplication will not overflow */
  newblock = luaM_saferealloc_(L, block, cast_sizet(*psize) * size_elems,
                                         cast_sizet(size) * size_elems);
  *psize = size;  /* update only when everything else is OK */
  return newblock;
}

/*
** In prototypes, the size of the array is also its number of
** elements (to save memory). So, if it cannot shrink an array
** to its number of elements, the only option is to raise an
** error.
*/
void *luaM_shrinkvector_ (lua_State *L, void *block, int *size,
                          int final_n, int size_elem) {
  void *newblock;
  size_t oldsize = cast_sizet((*size) * size_elem);
  size_t newsize = cast_sizet(final_n * size_elem);
  lua_assert(newsize <= oldsize);
  newblock = luaM_saferealloc_(L, block, oldsize, newsize);
  *size = final_n;
  return newblock;
}

/* }================================================================== */

l_noret luaM_toobig (lua_State *L) {
  luaG_runerror(L, "memory allocation error: block too big");
}

/*
** Free memory
*/
void luaM_free_ (lua_State *L, void *block, size_t osize) {
  global_State *g = G(L);
  lua_assert((osize == 0) == (block == NULL));
  (*g->frealloc)(g->ud, block, osize, 0);
  g->GCdebt -= osize;
}

/*
** In case of allocation fail, this function will call the GC to try
** to free some memory and then try the allocation again.
** (It should not be called when shrinking a block, because then the
** interpreter may be in the middle of a collection step.)
*/
static void *tryagain (lua_State *L, void *block,
                       size_t osize, size_t nsize) {
  global_State *g = G(L);
  if (ttisnil(&g->nilvalue)) {  /* is state fully build? */
    luaC_fullgc(L, 1);  /* try to free some memory... */
    return (*g->frealloc)(g->ud, block, osize, nsize);  /* try again */
  }
  else return NULL;  /* cannot free any memory without a full state */
}

/*
** Generic allocation routine.
** If allocation fails while shrinking a block, do not try again; the
** GC shrinks some blocks and it is not reentrant.
*/
void *luaM_realloc_ (lua_State *L, void *block, size_t osize, size_t nsize) {
  void *newblock;
  global_State *g = G(L);
  lua_assert((osize == 0) == (block == NULL));
  newblock = firsttry(g, block, osize, nsize);
  if (unlikely(newblock == NULL && nsize > 0)) {
    if (nsize > osize)  /* not shrinking a block? */
      newblock = tryagain(L, block, osize, nsize);
    if (newblock == NULL)  /* still no memory? */
      return NULL;  /* do not update 'GCdebt' */
  }
  lua_assert((nsize == 0) == (newblock == NULL));
  g->GCdebt = (g->GCdebt + nsize) - osize;
  return newblock;
}

void *luaM_saferealloc_ (lua_State *L, void *block, size_t osize,
                                                    size_t nsize) {
  void *newblock = luaM_realloc_(L, block, osize, nsize);
  if (unlikely(newblock == NULL && nsize > 0))  /* allocation failed? */
    luaM_error(L);
  return newblock;
}

void *luaM_malloc_ (lua_State *L, size_t size, int tag) {
  if (size == 0)
    return NULL;  /* that's all */
  else {
    global_State *g = G(L);
    void *newblock = firsttry(g, NULL, tag, size);
    if (unlikely(newblock == NULL)) {
      newblock = tryagain(L, NULL, tag, size);
      if (newblock == NULL)
        luaM_error(L);
    }
    g->GCdebt += size;
    return newblock;
  }
}

003 File Manager

Editing: lmem.c

Upload File

Create Folder