lfunc.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  1. /*
  2. ** $Id: lfunc.c,v 2.7 2005/01/19 15:54:26 roberto Exp roberto $
  3. ** Auxiliary functions to manipulate prototypes and closures
  4. ** See Copyright Notice in lua.h
  5. */
  6. #include <stddef.h>
  7. #define lfunc_c
  8. #define LUA_CORE
  9. #include "lua.h"
  10. #include "lfunc.h"
  11. #include "lgc.h"
  12. #include "lmem.h"
  13. #include "lobject.h"
  14. #include "lstate.h"
  15. Closure *luaF_newCclosure (lua_State *L, int nelems) {
  16. Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
  17. luaC_link(L, obj2gco(c), LUA_TFUNCTION);
  18. c->c.isC = 1;
  19. c->c.nupvalues = cast(lu_byte, nelems);
  20. return c;
  21. }
  22. Closure *luaF_newLclosure (lua_State *L, int nelems, TValue *e) {
  23. Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
  24. luaC_link(L, obj2gco(c), LUA_TFUNCTION);
  25. c->l.isC = 0;
  26. c->l.g = *e;
  27. c->l.nupvalues = cast(lu_byte, nelems);
  28. while (nelems--) c->l.upvals[nelems] = NULL;
  29. return c;
  30. }
  31. UpVal *luaF_newupval (lua_State *L) {
  32. UpVal *uv = luaM_new(L, UpVal);
  33. luaC_link(L, obj2gco(uv), LUA_TUPVAL);
  34. uv->v = &uv->u.value;
  35. setnilvalue(uv->v);
  36. return uv;
  37. }
  38. UpVal *luaF_findupval (lua_State *L, StkId level) {
  39. global_State *g = G(L);
  40. GCObject **pp = &L->openupval;
  41. UpVal *p;
  42. UpVal *uv;
  43. while ((p = ngcotouv(*pp)) != NULL && p->v >= level) {
  44. lua_assert(p->v != &p->u.value);
  45. if (p->v == level) { /* found a corresponding upvalue? */
  46. if (isdead(g, obj2gco(p))) /* is it dead? */
  47. changewhite(obj2gco(p)); /* ressurect it */
  48. return p;
  49. }
  50. pp = &p->next;
  51. }
  52. uv = luaM_new(L, UpVal); /* not found: create a new one */
  53. uv->tt = LUA_TUPVAL;
  54. uv->marked = luaC_white(g);
  55. uv->v = level; /* current value lives in the stack */
  56. uv->next = *pp; /* chain it in the proper position */
  57. *pp = obj2gco(uv);
  58. uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */
  59. uv->u.l.next = g->uvhead.u.l.next;
  60. uv->u.l.next->u.l.prev = uv;
  61. g->uvhead.u.l.next = uv;
  62. lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  63. return uv;
  64. }
  65. static void unlinkupval (UpVal *uv) {
  66. lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  67. uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */
  68. uv->u.l.prev->u.l.next = uv->u.l.next;
  69. }
  70. void luaF_freeupval (lua_State *L, UpVal *uv) {
  71. if (uv->v != &uv->u.value) /* is it open? */
  72. unlinkupval(uv); /* remove from open list */
  73. luaM_free(L, uv); /* free upvalue */
  74. }
  75. void luaF_close (lua_State *L, StkId level) {
  76. UpVal *uv;
  77. global_State *g = G(L);
  78. while ((uv = ngcotouv(L->openupval)) != NULL && uv->v >= level) {
  79. GCObject *o = obj2gco(uv);
  80. lua_assert(!isblack(o) && uv->v != &uv->u.value);
  81. L->openupval = uv->next; /* remove from `open' list */
  82. if (isdead(g, o))
  83. luaF_freeupval(L, uv); /* free upvalue */
  84. else {
  85. unlinkupval(uv);
  86. setobj(L, &uv->u.value, uv->v);
  87. if (isgray(o)) {
  88. gray2black(o); /* closed upvalues are never gray */
  89. luaC_barrier(L, uv, &uv->u.value);
  90. }
  91. uv->v = &uv->u.value; /* now current value lives here */
  92. luaC_linkupval(L, uv); /* link upvalue into `gcroot' list */
  93. }
  94. }
  95. }
  96. Proto *luaF_newproto (lua_State *L) {
  97. Proto *f = luaM_new(L, Proto);
  98. luaC_link(L, obj2gco(f), LUA_TPROTO);
  99. f->k = NULL;
  100. f->sizek = 0;
  101. f->p = NULL;
  102. f->sizep = 0;
  103. f->code = NULL;
  104. f->sizecode = 0;
  105. f->sizelineinfo = 0;
  106. f->sizeupvalues = 0;
  107. f->nups = 0;
  108. f->upvalues = NULL;
  109. f->numparams = 0;
  110. f->is_vararg = 0;
  111. f->maxstacksize = 0;
  112. f->lineinfo = NULL;
  113. f->sizelocvars = 0;
  114. f->locvars = NULL;
  115. f->lineDefined = 0;
  116. f->source = NULL;
  117. return f;
  118. }
  119. void luaF_freeproto (lua_State *L, Proto *f) {
  120. luaM_freearray(L, f->code, f->sizecode, Instruction);
  121. luaM_freearray(L, f->p, f->sizep, Proto *);
  122. luaM_freearray(L, f->k, f->sizek, TValue);
  123. luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
  124. luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
  125. luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
  126. luaM_free(L, f);
  127. }
  128. void luaF_freeclosure (lua_State *L, Closure *c) {
  129. int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
  130. sizeLclosure(c->l.nupvalues);
  131. luaM_freemem(L, c, size);
  132. }
  133. /*
  134. ** Look for n-th local variable at line `line' in function `func'.
  135. ** Returns NULL if not found.
  136. */
  137. const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
  138. int i;
  139. for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
  140. if (pc < f->locvars[i].endpc) { /* is variable active? */
  141. local_number--;
  142. if (local_number == 0)
  143. return getstr(f->locvars[i].varname);
  144. }
  145. }
  146. return NULL; /* not found */
  147. }