ltable.c File Reference

#include <string.h>
#include "lua.h"
#include "ldebug.h"
#include "ldo.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
#include "lvm.h"

Go to the source code of this file.

Macros
#define	ltable_c
#define	LUA_CORE
#define	MAXBITS   (LUAI_BITSINT-2)
#define	MAXASIZE   (1 << MAXBITS)
#define	hashpow2(t, n)   (gnode(t, lmod((n), sizenode(t))))
#define	hashstr(t, str)   hashpow2(t, (str)->tsv.hash)
#define	hashboolean(t, p)   hashpow2(t, p)
#define	hashmod(t, n)   (gnode(t, ((n) % ((sizenode(t)-1)|1))))
#define	hashpointer(t, p)   hashmod(t, IntPoint(p))
#define	dummynode   (&dummynode_)
#define	isdummy(n)   ((n) == dummynode)

Functions
static Node *	hashnum (const Table *t, lua_Number n)
static Node *	mainposition (const Table *t, const TValue *key)
static int	arrayindex (const TValue *key)
static int	findindex (lua_State *L, Table *t, StkId key)
int	luaH_next (lua_State *L, Table *t, StkId key)
static int	computesizes (int nums[], int *narray)
static int	countint (const TValue *key, int *nums)
static int	numusearray (const Table *t, int *nums)
static int	numusehash (const Table *t, int *nums, int *pnasize)
static void	setarrayvector (lua_State *L, Table *t, int size)
static void	setnodevector (lua_State *L, Table *t, int size)
void	luaH_resize (lua_State *L, Table *t, int nasize, int nhsize)
void	luaH_resizearray (lua_State *L, Table *t, int nasize)
static void	rehash (lua_State *L, Table *t, const TValue *ek)
Table *	luaH_new (lua_State *L)
void	luaH_free (lua_State *L, Table *t)
static Node *	getfreepos (Table *t)
TValue *	luaH_newkey (lua_State *L, Table *t, const TValue *key)
const TValue *	luaH_getint (Table *t, int key)
const TValue *	luaH_getstr (Table *t, TString *key)
const TValue *	luaH_get (Table *t, const TValue *key)
TValue *	luaH_set (lua_State *L, Table *t, const TValue *key)
void	luaH_setint (lua_State *L, Table *t, int key, TValue *value)
static int	unbound_search (Table *t, unsigned int j)
int	luaH_getn (Table *t)

Variables
static const Node	dummynode_

Macro Definition Documentation

dummynode

#define dummynode   (&dummynode_)

Definition at line 67 of file lua-5.2.4/src/ltable.c.

Referenced by setnodevector().

hashboolean

#define hashboolean	(		t,
			p )   hashpow2(t, p)

Definition at line 54 of file lua-5.2.4/src/ltable.c.

Referenced by mainposition().

hashmod

#define hashmod	(		t,
			n )   (gnode(t, ((n) % ((sizenode(t)-1)|1))))

Definition at line 61 of file lua-5.2.4/src/ltable.c.

Referenced by hashnum().

hashpointer

#define hashpointer	(		t,
			p )   hashmod(t, IntPoint(p))

Definition at line 64 of file lua-5.2.4/src/ltable.c.

Referenced by mainposition().

hashpow2

#define hashpow2	(		t,
			n )   (gnode(t, lmod((n), sizenode(t))))

Definition at line 51 of file lua-5.2.4/src/ltable.c.

hashstr

#define hashstr	(		t,
			str )   hashpow2(t, (str)->tsv.hash)

Definition at line 53 of file lua-5.2.4/src/ltable.c.

Referenced by luaH_getstr(), and mainposition().

isdummy

#define isdummy

(

n

)

((n) == dummynode)

Definition at line 69 of file lua-5.2.4/src/ltable.c.

Referenced by freehash(), getfreepos(), getfreepos(), luaH_free(), luaH_getn(), luaH_newkey(), luaH_newkey(), luaH_resize(), and luaH_resizearray().

ltable_c

#define ltable_c

Definition at line 23 of file lua-5.2.4/src/ltable.c.

LUA_CORE

#define LUA_CORE

Definition at line 24 of file lua-5.2.4/src/ltable.c.

MAXASIZE

#define MAXASIZE   (1 << MAXBITS)

Definition at line 48 of file lua-5.2.4/src/ltable.c.

Referenced by countint().

MAXBITS

#define MAXBITS   (LUAI_BITSINT-2)

Definition at line 45 of file lua-5.2.4/src/ltable.c.

Referenced by numusearray(), rehash(), and setnodevector().

Function Documentation

arrayindex()

static int arrayindex ( const TValue * key )

static

Definition at line 127 of file lua-5.2.4/src/ltable.c.

                                          {
  if (ttisnumber(key)) {
    lua_Number n = nvalue(key);
    int k;
    lua_number2int(k, n);
    if (luai_numeq(cast_num(k), n))
      return k;
  }
  return -1;  /* `key' did not match some condition */
}

References cast_num, lua_number2int, luai_numeq, nvalue, and ttisnumber.

Referenced by countint(), and findindex().

computesizes()

static int computesizes ( int nums[], int * narray )

static

Definition at line 196 of file lua-5.2.4/src/ltable.c.

                                                  {
  int i;
  int twotoi;  /* 2^i */
  int a = 0;  /* number of elements smaller than 2^i */
  int na = 0;  /* number of elements to go to array part */
  int n = 0;  /* optimal size for array part */
  for (i = 0, twotoi = 1; twotoi/2 < *narray; i++, twotoi *= 2) {
    if (nums[i] > 0) {
      a += nums[i];
      if (a > twotoi/2) {  /* more than half elements present? */
        n = twotoi;  /* optimal size (till now) */
        na = a;  /* all elements smaller than n will go to array part */
      }
    }
    if (a == *narray) break;  /* all elements already counted */
  }
  *narray = n;
  lua_assert(*narray/2 <= na && na <= *narray);
  return na;
}

References lua_assert.

Referenced by rehash().

countint()

static int countint ( const TValue * key, int * nums )

static

Definition at line 218 of file lua-5.2.4/src/ltable.c.

                                                   {
  int k = arrayindex(key);
  if (0 < k && k <= MAXASIZE) {  /* is `key' an appropriate array index? */
    nums[luaO_ceillog2(k)]++;  /* count as such */
    return 1;
  }
  else
    return 0;
}

References arrayindex(), luaO_ceillog2(), and MAXASIZE.

Referenced by numusehash(), and rehash().

findindex()

static int findindex ( lua_State * L, Table * t, StkId key )

static

Definition at line 144 of file lua-5.2.4/src/ltable.c.

                                                         {
  int i;
  if (ttisnil(key)) return -1;  /* first iteration */
  i = arrayindex(key);
  if (0 < i && i <= t->sizearray)  /* is `key' inside array part? */
    return i-1;  /* yes; that's the index (corrected to C) */
  else {
    Node *n = mainposition(t, key);
    for (;;) {  /* check whether `key' is somewhere in the chain */
      /* key may be dead already, but it is ok to use it in `next' */
      if (luaV_rawequalobj(gkey(n), key) ||
            (ttisdeadkey(gkey(n)) && iscollectable(key) &&
             deadvalue(gkey(n)) == gcvalue(key))) {
        i = cast_int(n - gnode(t, 0));  /* key index in hash table */
        /* hash elements are numbered after array ones */
        return i + t->sizearray;
      }
      else n = gnext(n);
      if (n == NULL)
        luaG_runerror(L, "invalid key to " LUA_QL("next"));  /* key not found */
    }
  }
}

References arrayindex(), cast_int, deadvalue, gcvalue, gkey, gnext, gnode, iscollectable, LUA_QL, luaG_runerror(), luaV_rawequalobj, mainposition(), NULL, Table::sizearray, ttisdeadkey, and ttisnil.

Referenced by luaH_next().

getfreepos()

static Node * getfreepos ( Table * t )

static

Definition at line 387 of file lua-5.2.4/src/ltable.c.

                                   {
  while (t->lastfree > t->node) {
    t->lastfree--;
    if (ttisnil(gkey(t->lastfree)))
      return t->lastfree;
  }
  return NULL;  /* could not find a free place */
}

References gkey, Table::lastfree, Table::node, NULL, and ttisnil.

Referenced by luaH_newkey().

hashnum()

static Node * hashnum ( const Table * t, lua_Number n )

static

Definition at line 80 of file lua-5.2.4/src/ltable.c.

                                                    {
  int i;
  luai_hashnum(i, n);
  if (i < 0) {
    if (cast(unsigned int, i) == 0u - i)  /* use unsigned to avoid overflows */
      i = 0;  /* handle INT_MIN */
    i = -i;  /* must be a positive value */
  }
  return hashmod(t, i);
}

References cast, hashmod, and luai_hashnum.

Referenced by luaH_getint(), and mainposition().

luaH_free()

void luaH_free	(	lua_State *	L,
		Table *	t )

Definition at line 379 of file lua-5.2.4/src/ltable.c.

                                        {
  if (!isdummy(t->node))
    luaM_freearray(L, t->node, cast(size_t, sizenode(t)));
  luaM_freearray(L, t->array, t->sizearray);
  luaM_free(L, t);
}

References Table::array, cast, isdummy, luaM_free, luaM_freearray, Table::node, Table::sizearray, and sizenode.

luaH_get()

const TValue * luaH_get	(	Table *	t,
		const TValue *	key )

Definition at line 481 of file lua-5.2.4/src/ltable.c.

                                                     {
  switch (ttype(key)) {
    case LUA_TSHRSTR: return luaH_getstr(t, rawtsvalue(key));
    case LUA_TNIL: return luaO_nilobject;
    case LUA_TNUMBER: {
      int k;
      lua_Number n = nvalue(key);
      lua_number2int(k, n);
      if (luai_numeq(cast_num(k), n)) /* index is int? */
        return luaH_getint(t, k);  /* use specialized version */
      /* else go through */
    }
    default: {
      Node *n = mainposition(t, key);
      do {  /* check whether `key' is somewhere in the chain */
        if (luaV_rawequalobj(gkey(n), key))
          return gval(n);  /* that's it */
        else n = gnext(n);
      } while (n);
      return luaO_nilobject;
    }
  }
}

References cast_num, gkey, gnext, gval, lua_number2int, LUA_TNIL, LUA_TNUMBER, LUA_TSHRSTR, luaH_getint(), luaH_getstr(), luai_numeq, luaO_nilobject, luaV_rawequalobj, mainposition(), nvalue, rawtsvalue, and ttype.

Referenced by luaH_set().

luaH_getint()

const TValue * luaH_getint	(	Table *	t,
		int	key )

Definition at line 446 of file lua-5.2.4/src/ltable.c.

                                              {
  /* (1 <= key && key <= t->sizearray) */
  if (cast(unsigned int, key-1) < cast(unsigned int, t->sizearray))
    return &t->array[key-1];
  else {
    lua_Number nk = cast_num(key);
    Node *n = hashnum(t, nk);
    do {  /* check whether `key' is somewhere in the chain */
      if (ttisnumber(gkey(n)) && luai_numeq(nvalue(gkey(n)), nk))
        return gval(n);  /* that's it */
      else n = gnext(n);
    } while (n);
    return luaO_nilobject;
  }
}

References Table::array, cast, cast_num, gkey, gnext, gval, hashnum(), luai_numeq, luaO_nilobject, nvalue, Table::sizearray, and ttisnumber.

Referenced by lua_getglobal(), lua_getglobal(), lua_geti(), lua_load(), lua_rawgeti(), lua_rawgeti(), lua_setglobal(), lua_setglobal(), lua_seti(), luaH_get(), luaH_setint(), and unbound_search().

luaH_getn()

int luaH_getn

(

Table *

t

)

Definition at line 560 of file lua-5.2.4/src/ltable.c.

                         {
  unsigned int j = t->sizearray;
  if (j > 0 && ttisnil(&t->array[j - 1])) {
    /* there is a boundary in the array part: (binary) search for it */
    unsigned int i = 0;
    while (j - i > 1) {
      unsigned int m = (i+j)/2;
      if (ttisnil(&t->array[m - 1])) j = m;
      else i = m;
    }
    return i;
  }
  /* else must find a boundary in hash part */
  else if (isdummy(t->node))  /* hash part is empty? */
    return j;  /* that is easy... */
  else return unbound_search(t, j);
}

References Table::array, isdummy, Table::node, Table::sizearray, ttisnil, and unbound_search().

luaH_getstr()

const TValue * luaH_getstr	(	Table *	t,
		TString *	key )

Definition at line 466 of file lua-5.2.4/src/ltable.c.

                                                   {
  Node *n = hashstr(t, key);
  lua_assert(key->tsv.tt == LUA_TSHRSTR);
  do {  /* check whether `key' is somewhere in the chain */
    if (ttisshrstring(gkey(n)) && eqshrstr(rawtsvalue(gkey(n)), key))
      return gval(n);  /* that's it */
    else n = gnext(n);
  } while (n);
  return luaO_nilobject;
}

References eqshrstr, gkey, gnext, gval, hashstr, lua_assert, LUA_TSHRSTR, luaO_nilobject, rawtsvalue, TString::tsv, and ttisshrstring.

Referenced by luaH_get().

luaH_new()

Table * luaH_new

(

lua_State *

L

)

Definition at line 368 of file lua-5.2.4/src/ltable.c.

                               {
  Table *t = &luaC_newobj(L, LUA_TTABLE, sizeof(Table), NULL, 0)->h;
  t->metatable = NULL;
  t->flags = cast_byte(~0);
  t->array = NULL;
  t->sizearray = 0;
  setnodevector(L, t, 0);
  return t;
}

References Table::array, cast_byte, Table::flags, GCObject::h, LUA_TTABLE, luaC_newobj(), Table::metatable, NULL, setnodevector(), and Table::sizearray.

luaH_newkey()

TValue * luaH_newkey	(	lua_State *	L,
		Table *	t,
		const TValue *	key )

Definition at line 405 of file lua-5.2.4/src/ltable.c.

                                                                {
  Node *mp;
  if (ttisnil(key)) luaG_runerror(L, "table index is nil");
  else if (ttisnumber(key) && luai_numisnan(L, nvalue(key)))
    luaG_runerror(L, "table index is NaN");
  mp = mainposition(t, key);
  if (!ttisnil(gval(mp)) || isdummy(mp)) {  /* main position is taken? */
    Node *othern;
    Node *n = getfreepos(t);  /* get a free place */
    if (n == NULL) {  /* cannot find a free place? */
      rehash(L, t, key);  /* grow table */
      /* whatever called 'newkey' take care of TM cache and GC barrier */
      return luaH_set(L, t, key);  /* insert key into grown table */
    }
    lua_assert(!isdummy(n));
    othern = mainposition(t, gkey(mp));
    if (othern != mp) {  /* is colliding node out of its main position? */
      /* yes; move colliding node into free position */
      while (gnext(othern) != mp) othern = gnext(othern);  /* find previous */
      gnext(othern) = n;  /* redo the chain with `n' in place of `mp' */
      *n = *mp;  /* copy colliding node into free pos. (mp->next also goes) */
      gnext(mp) = NULL;  /* now `mp' is free */
      setnilvalue(gval(mp));
    }
    else {  /* colliding node is in its own main position */
      /* new node will go into free position */
      gnext(n) = gnext(mp);  /* chain new position */
      gnext(mp) = n;
      mp = n;
    }
  }
  setobj2t(L, gkey(mp), key);
  luaC_barrierback(L, obj2gco(t), key);
  lua_assert(ttisnil(gval(mp)));
  return gval(mp);
}

References getfreepos(), gkey, gnext, gval, isdummy, lua_assert, luaC_barrierback, luaG_runerror(), luaH_set(), luai_numisnan, mainposition(), NULL, nvalue, obj2gco, rehash(), setnilvalue, setobj2t, ttisnil, and ttisnumber.

Referenced by luaH_set(), luaH_setint(), luaV_finishset(), and luaV_settable().

luaH_next()

int luaH_next	(	lua_State *	L,
		Table *	t,
		StkId	key )

Definition at line 169 of file lua-5.2.4/src/ltable.c.

                                                  {
  int i = findindex(L, t, key);  /* find original element */
  for (i++; i < t->sizearray; i++) {  /* try first array part */
    if (!ttisnil(&t->array[i])) {  /* a non-nil value? */
      setnvalue(key, cast_num(i+1));
      setobj2s(L, key+1, &t->array[i]);
      return 1;
    }
  }
  for (i -= t->sizearray; i < sizenode(t); i++) {  /* then hash part */
    if (!ttisnil(gval(gnode(t, i)))) {  /* a non-nil value? */
      setobj2s(L, key, gkey(gnode(t, i)));
      setobj2s(L, key+1, gval(gnode(t, i)));
      return 1;
    }
  }
  return 0;  /* no more elements */
}

References Table::array, cast_num, findindex(), gkey, gnode, gval, setnvalue, setobj2s, Table::sizearray, sizenode, and ttisnil.

luaH_resize()

void luaH_resize	(	lua_State *	L,
		Table *	t,
		int	nasize,
		int	nhsize )

Definition at line 304 of file lua-5.2.4/src/ltable.c.

                                                                  {
  int i;
  int oldasize = t->sizearray;
  int oldhsize = t->lsizenode;
  Node *nold = t->node;  /* save old hash ... */
  if (nasize > oldasize)  /* array part must grow? */
    setarrayvector(L, t, nasize);
  /* create new hash part with appropriate size */
  setnodevector(L, t, nhsize);
  if (nasize < oldasize) {  /* array part must shrink? */
    t->sizearray = nasize;
    /* re-insert elements from vanishing slice */
    for (i=nasize; i<oldasize; i++) {
      if (!ttisnil(&t->array[i]))
        luaH_setint(L, t, i + 1, &t->array[i]);
    }
    /* shrink array */
    luaM_reallocvector(L, t->array, oldasize, nasize, TValue);
  }
  /* re-insert elements from hash part */
  for (i = twoto(oldhsize) - 1; i >= 0; i--) {
    Node *old = nold+i;
    if (!ttisnil(gval(old))) {
      /* doesn't need barrier/invalidate cache, as entry was
         already present in the table */
      setobjt2t(L, luaH_set(L, t, gkey(old)), gval(old));
    }
  }
  if (!isdummy(nold))
    luaM_freearray(L, nold, cast(size_t, twoto(oldhsize))); /* free old array */
}

References Table::array, cast, gkey, gval, isdummy, Table::lsizenode, luaH_set(), luaH_setint(), luaM_freearray, luaM_reallocvector, Table::node, setarrayvector(), setnodevector(), setobjt2t, Table::sizearray, ttisnil, and twoto.

Referenced by init_registry(), init_registry(), init_registry(), lua_createtable(), luaH_resizearray(), luaV_execute(), luaV_execute(), and rehash().

luaH_resizearray()

void luaH_resizearray	(	lua_State *	L,
		Table *	t,
		int	nasize )

Definition at line 337 of file lua-5.2.4/src/ltable.c.

                                                           {
  int nsize = isdummy(t->node) ? 0 : sizenode(t);
  luaH_resize(L, t, nasize, nsize);
}

References isdummy, luaH_resize(), Table::node, and sizenode.

luaH_set()

TValue * luaH_set	(	lua_State *	L,
		Table *	t,
		const TValue *	key )

Definition at line 510 of file lua-5.2.4/src/ltable.c.

                                                             {
  const TValue *p = luaH_get(t, key);
  if (p != luaO_nilobject)
    return cast(TValue *, p);
  else return luaH_newkey(L, t, key);
}

References cast, luaH_get(), luaH_newkey(), and luaO_nilobject.

Referenced by luaH_newkey(), and luaH_resize().

luaH_setint()

void luaH_setint	(	lua_State *	L,
		Table *	t,
		int	key,
		TValue *	value )

Definition at line 518 of file lua-5.2.4/src/ltable.c.

                                                                  {
  const TValue *p = luaH_getint(t, key);
  TValue *cell;
  if (p != luaO_nilobject)
    cell = cast(TValue *, p);
  else {
    TValue k;
    setnvalue(&k, cast_num(key));
    cell = luaH_newkey(L, t, &k);
  }
  setobj2t(L, cell, value);
}

References cast, cast_num, luaH_getint(), luaH_newkey(), luaO_nilobject, setnvalue, setobj2t, and value.

Referenced by collectvalidlines(), collectvalidlines(), collectvalidlines(), init_registry(), init_registry(), lua_rawseti(), lua_rawseti(), luaH_resize(), and luaV_execute().

mainposition()

static Node * mainposition ( const Table * t, const TValue * key )

static

Definition at line 97 of file lua-5.2.4/src/ltable.c.

                                                              {
  switch (ttype(key)) {
    case LUA_TNUMBER:
      return hashnum(t, nvalue(key));
    case LUA_TLNGSTR: {
      TString *s = rawtsvalue(key);
      if (s->tsv.extra == 0) {  /* no hash? */
        s->tsv.hash = luaS_hash(getstr(s), s->tsv.len, s->tsv.hash);
        s->tsv.extra = 1;  /* now it has its hash */
      }
      return hashstr(t, rawtsvalue(key));
    }
    case LUA_TSHRSTR:
      return hashstr(t, rawtsvalue(key));
    case LUA_TBOOLEAN:
      return hashboolean(t, bvalue(key));
    case LUA_TLIGHTUSERDATA:
      return hashpointer(t, pvalue(key));
    case LUA_TLCF:
      return hashpointer(t, fvalue(key));
    default:
      return hashpointer(t, gcvalue(key));
  }
}

References bvalue, fvalue, gcvalue, getstr, hashboolean, hashnum(), hashpointer, hashstr, LUA_TBOOLEAN, LUA_TLCF, LUA_TLIGHTUSERDATA, LUA_TLNGSTR, LUA_TNUMBER, LUA_TSHRSTR, luaS_hash(), nvalue, pvalue, rawtsvalue, s, and ttype.

Referenced by findindex(), luaH_get(), and luaH_newkey().

numusearray()

static int numusearray ( const Table * t, int * nums )

static

Definition at line 229 of file lua-5.2.4/src/ltable.c.

                                                   {
  int lg;
  int ttlg;  /* 2^lg */
  int ause = 0;  /* summation of `nums' */
  int i = 1;  /* count to traverse all array keys */
  for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) {  /* for each slice */
    int lc = 0;  /* counter */
    int lim = ttlg;
    if (lim > t->sizearray) {
      lim = t->sizearray;  /* adjust upper limit */
      if (i > lim)
        break;  /* no more elements to count */
    }
    /* count elements in range (2^(lg-1), 2^lg] */
    for (; i <= lim; i++) {
      if (!ttisnil(&t->array[i-1]))
        lc++;
    }
    nums[lg] += lc;
    ause += lc;
  }
  return ause;
}

References Table::array, MAXBITS, Table::sizearray, and ttisnil.

Referenced by rehash().

numusehash()

static int numusehash ( const Table * t, int * nums, int * pnasize )

static

Definition at line 254 of file lua-5.2.4/src/ltable.c.

                                                                {
  int totaluse = 0;  /* total number of elements */
  int ause = 0;  /* summation of `nums' */
  int i = sizenode(t);
  while (i--) {
    Node *n = &t->node[i];
    if (!ttisnil(gval(n))) {
      ause += countint(gkey(n), nums);
      totaluse++;
    }
  }
  *pnasize += ause;
  return totaluse;
}

References countint(), gkey, gval, Table::node, sizenode, and ttisnil.

Referenced by rehash().

rehash()

static void rehash ( lua_State * L, Table * t, const TValue * ek )

static

Definition at line 343 of file lua-5.2.4/src/ltable.c.

                                                              {
  int nasize, na;
  int nums[MAXBITS+1];  /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */
  int i;
  int totaluse;
  for (i=0; i<=MAXBITS; i++) nums[i] = 0;  /* reset counts */
  nasize = numusearray(t, nums);  /* count keys in array part */
  totaluse = nasize;  /* all those keys are integer keys */
  totaluse += numusehash(t, nums, &nasize);  /* count keys in hash part */
  /* count extra key */
  nasize += countint(ek, nums);
  totaluse++;
  /* compute new size for array part */
  na = computesizes(nums, &nasize);
  /* resize the table to new computed sizes */
  luaH_resize(L, t, nasize, totaluse - na);
}

References computesizes(), countint(), luaH_resize(), MAXBITS, numusearray(), and numusehash().

Referenced by luaH_newkey().

setarrayvector()

static void setarrayvector ( lua_State * L, Table * t, int size )

static

Definition at line 270 of file lua-5.2.4/src/ltable.c.

                                                              {
  int i;
  luaM_reallocvector(L, t->array, t->sizearray, size, TValue);
  for (i=t->sizearray; i<size; i++)
     setnilvalue(&t->array[i]);
  t->sizearray = size;
}

References Table::array, luaM_reallocvector, setnilvalue, and Table::sizearray.

Referenced by luaH_resize().

setnodevector()

static void setnodevector ( lua_State * L, Table * t, int size )

static

Definition at line 279 of file lua-5.2.4/src/ltable.c.

                                                             {
  int lsize;
  if (size == 0) {  /* no elements to hash part? */
    t->node = cast(Node *, dummynode);  /* use common `dummynode' */
    lsize = 0;
  }
  else {
    int i;
    lsize = luaO_ceillog2(size);
    if (lsize > MAXBITS)
      luaG_runerror(L, "table overflow");
    size = twoto(lsize);
    t->node = luaM_newvector(L, size, Node);
    for (i=0; i<size; i++) {
      Node *n = gnode(t, i);
      gnext(n) = NULL;
      setnilvalue(gkey(n));
      setnilvalue(gval(n));
    }
  }
  t->lsizenode = cast_byte(lsize);
  t->lastfree = gnode(t, size);  /* all positions are free */
}

References cast, cast_byte, dummynode, gkey, gnext, gnode, gval, Table::lastfree, Table::lsizenode, luaG_runerror(), luaM_newvector, luaO_ceillog2(), MAXBITS, Table::node, NULL, setnilvalue, and twoto.

Referenced by luaH_new(), and luaH_resize().

unbound_search()

static int unbound_search ( Table * t, unsigned int j )

static

Definition at line 532 of file lua-5.2.4/src/ltable.c.

                                                     {
  unsigned int i = j;  /* i is zero or a present index */
  j++;
  /* find `i' and `j' such that i is present and j is not */
  while (!ttisnil(luaH_getint(t, j))) {
    i = j;
    j *= 2;
    if (j > cast(unsigned int, MAX_INT)) {  /* overflow? */
      /* table was built with bad purposes: resort to linear search */
      i = 1;
      while (!ttisnil(luaH_getint(t, i))) i++;
      return i - 1;
    }
  }
  /* now do a binary search between them */
  while (j - i > 1) {
    unsigned int m = (i+j)/2;
    if (ttisnil(luaH_getint(t, m))) j = m;
    else i = m;
  }
  return i;
}

References cast, luaH_getint(), MAX_INT, and ttisnil.

Referenced by luaH_getn().

Variable Documentation

dummynode_

const Node dummynode_

static

Initial value:

= {
  {NILCONSTANT},  
  {{NILCONSTANT, NULL}}  
}

Definition at line 71 of file lua-5.2.4/src/ltable.c.

                               {
  {NILCONSTANT},  /* value */
  {{NILCONSTANT, NULL}}  /* key */
};