lfunc.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172
  1. /*
  2. ** $Id: lfunc.c,v 2.24 2010/05/10 18:23:45 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 "lopcodes.h"
  15. #include "lstate.h"
  16. Closure *luaF_newCclosure (lua_State *L, int n) {
  17. Closure *c = &luaC_newobj(L, LUA_TFUNCTION, sizeCclosure(n), NULL, 0)->cl;
  18. c->c.isC = 1;
  19. c->c.nupvalues = cast_byte(n);
  20. return c;
  21. }
  22. Closure *luaF_newLclosure (lua_State *L, Proto *p) {
  23. int n = p->sizeupvalues;
  24. Closure *c = &luaC_newobj(L, LUA_TFUNCTION, sizeLclosure(n), NULL, 0)->cl;
  25. c->l.isC = 0;
  26. c->l.p = p;
  27. c->l.nupvalues = cast_byte(n);
  28. while (n--) c->l.upvals[n] = NULL;
  29. return c;
  30. }
  31. UpVal *luaF_newupval (lua_State *L) {
  32. UpVal *uv = &luaC_newobj(L, LUA_TUPVAL, sizeof(UpVal), NULL, 0)->uv;
  33. uv->v = &uv->u.value;
  34. setnilvalue(uv->v);
  35. return uv;
  36. }
  37. UpVal *luaF_findupval (lua_State *L, StkId level) {
  38. global_State *g = G(L);
  39. GCObject **pp = &L->openupval;
  40. UpVal *p;
  41. UpVal *uv;
  42. while (*pp != NULL && (p = gco2uv(*pp))->v >= level) {
  43. GCObject *o = obj2gco(p);
  44. lua_assert(p->v != &p->u.value);
  45. if (p->v == level) { /* found a corresponding upvalue? */
  46. if (isdead(g, o)) /* is it dead? */
  47. changewhite(o); /* ressurrect it */
  48. return p;
  49. }
  50. resetoldbit(o); /* may create a newer upval after this one */
  51. pp = &p->next;
  52. }
  53. /* not found: create a new one */
  54. uv = &luaC_newobj(L, LUA_TUPVAL, sizeof(UpVal), pp, 0)->uv;
  55. uv->v = level; /* current value lives in the stack */
  56. uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */
  57. uv->u.l.next = g->uvhead.u.l.next;
  58. uv->u.l.next->u.l.prev = uv;
  59. g->uvhead.u.l.next = uv;
  60. lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  61. return uv;
  62. }
  63. static void unlinkupval (UpVal *uv) {
  64. lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  65. uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */
  66. uv->u.l.prev->u.l.next = uv->u.l.next;
  67. }
  68. void luaF_freeupval (lua_State *L, UpVal *uv) {
  69. if (uv->v != &uv->u.value) /* is it open? */
  70. unlinkupval(uv); /* remove from open list */
  71. luaM_free(L, uv); /* free upvalue */
  72. }
  73. void luaF_close (lua_State *L, StkId level) {
  74. UpVal *uv;
  75. global_State *g = G(L);
  76. while (L->openupval != NULL && (uv = gco2uv(L->openupval))->v >= level) {
  77. GCObject *o = obj2gco(uv);
  78. lua_assert(!isblack(o) && uv->v != &uv->u.value);
  79. L->openupval = uv->next; /* remove from `open' list */
  80. if (isdead(g, o))
  81. luaF_freeupval(L, uv); /* free upvalue */
  82. else {
  83. unlinkupval(uv); /* remove upvalue from 'uvhead' list */
  84. setobj(L, &uv->u.value, uv->v); /* move value to upvalue slot */
  85. uv->v = &uv->u.value; /* now current value lives here */
  86. gch(o)->next = g->allgc; /* link upvalue into 'allgc' list */
  87. g->allgc = o;
  88. luaC_checkupvalcolor(g, uv);
  89. }
  90. }
  91. }
  92. Proto *luaF_newproto (lua_State *L) {
  93. Proto *f = &luaC_newobj(L, LUA_TPROTO, sizeof(Proto), NULL, 0)->p;
  94. f->k = NULL;
  95. f->sizek = 0;
  96. f->p = NULL;
  97. f->sizep = 0;
  98. f->code = NULL;
  99. f->cache = NULL;
  100. f->sizecode = 0;
  101. f->lineinfo = NULL;
  102. f->sizelineinfo = 0;
  103. f->upvalues = NULL;
  104. f->sizeupvalues = 0;
  105. f->numparams = 0;
  106. f->is_vararg = 0;
  107. f->maxstacksize = 0;
  108. f->locvars = NULL;
  109. f->sizelocvars = 0;
  110. f->linedefined = 0;
  111. f->lastlinedefined = 0;
  112. f->source = NULL;
  113. return f;
  114. }
  115. void luaF_freeproto (lua_State *L, Proto *f) {
  116. luaM_freearray(L, f->code, f->sizecode);
  117. luaM_freearray(L, f->p, f->sizep);
  118. luaM_freearray(L, f->k, f->sizek);
  119. luaM_freearray(L, f->lineinfo, f->sizelineinfo);
  120. luaM_freearray(L, f->locvars, f->sizelocvars);
  121. luaM_freearray(L, f->upvalues, f->sizeupvalues);
  122. luaM_free(L, f);
  123. }
  124. void luaF_freeclosure (lua_State *L, Closure *c) {
  125. int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
  126. sizeLclosure(c->l.nupvalues);
  127. luaM_freemem(L, c, size);
  128. }
  129. /*
  130. ** Look for n-th local variable at line `line' in function `func'.
  131. ** Returns NULL if not found.
  132. */
  133. const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
  134. int i;
  135. for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
  136. if (pc < f->locvars[i].endpc) { /* is variable active? */
  137. local_number--;
  138. if (local_number == 0)
  139. return getstr(f->locvars[i].varname);
  140. }
  141. }
  142. return NULL; /* not found */
  143. }