lfunc.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139
  1. /*
  2. ** $Id: lfunc.c,v 2.37 2013/08/27 20:04:00 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 n) {
  16. Closure *c = &luaC_newobj(L, LUA_TCCL, sizeCclosure(n))->cl;
  17. c->c.nupvalues = cast_byte(n);
  18. return c;
  19. }
  20. Closure *luaF_newLclosure (lua_State *L, int n) {
  21. Closure *c = &luaC_newobj(L, LUA_TLCL, sizeLclosure(n))->cl;
  22. c->l.p = NULL;
  23. c->l.nupvalues = cast_byte(n);
  24. while (n--) c->l.upvals[n] = NULL;
  25. return c;
  26. }
  27. void luaF_initupvals (lua_State *L, LClosure *cl) {
  28. int i;
  29. for (i = 0; i < cl->nupvalues; i++) {
  30. UpVal *uv = luaM_new(L, UpVal);
  31. uv->refcount = 1;
  32. uv->v = &uv->u.value; /* make it closed */
  33. setnilvalue(uv->v);
  34. cl->upvals[i] = uv;
  35. }
  36. }
  37. UpVal *luaF_findupval (lua_State *L, StkId level) {
  38. UpVal **pp = &L->openupval;
  39. UpVal *p;
  40. UpVal *uv;
  41. while (*pp != NULL && (p = *pp)->v >= level) {
  42. lua_assert(upisopen(p));
  43. if (p->v == level) /* found a corresponding upvalue? */
  44. return p; /* return it */
  45. pp = &p->u.op.next;
  46. }
  47. /* not found: create a new one */
  48. uv = luaM_new(L, UpVal);
  49. uv->refcount = 0;
  50. uv->u.op.next = *pp;
  51. *pp = uv;
  52. uv->v = level; /* current value lives in the stack */
  53. return uv;
  54. }
  55. void luaF_close (lua_State *L, StkId level) {
  56. UpVal *uv;
  57. while (L->openupval != NULL && (uv = L->openupval)->v >= level) {
  58. lua_assert(upisopen(uv));
  59. L->openupval = uv->u.op.next; /* remove from `open' list */
  60. if (uv->refcount == 0) /* no references? */
  61. luaM_free(L, uv); /* free upvalue */
  62. else {
  63. setobj(L, &uv->u.value, uv->v); /* move value to upvalue slot */
  64. uv->v = &uv->u.value; /* now current value lives here */
  65. luaC_upvalbarrier(L, uv);
  66. }
  67. }
  68. }
  69. Proto *luaF_newproto (lua_State *L) {
  70. Proto *f = &luaC_newobj(L, LUA_TPROTO, sizeof(Proto))->p;
  71. nolocal(obj2gco(f)); /* prototypes are never local */
  72. f->k = NULL;
  73. f->sizek = 0;
  74. f->p = NULL;
  75. f->sizep = 0;
  76. f->code = NULL;
  77. f->cache = NULL;
  78. f->sizecode = 0;
  79. f->lineinfo = NULL;
  80. f->sizelineinfo = 0;
  81. f->upvalues = NULL;
  82. f->sizeupvalues = 0;
  83. f->numparams = 0;
  84. f->is_vararg = 0;
  85. f->maxstacksize = 0;
  86. f->locvars = NULL;
  87. f->sizelocvars = 0;
  88. f->linedefined = 0;
  89. f->lastlinedefined = 0;
  90. f->source = NULL;
  91. return f;
  92. }
  93. void luaF_freeproto (lua_State *L, Proto *f) {
  94. luaM_freearray(L, f->code, f->sizecode);
  95. luaM_freearray(L, f->p, f->sizep);
  96. luaM_freearray(L, f->k, f->sizek);
  97. luaM_freearray(L, f->lineinfo, f->sizelineinfo);
  98. luaM_freearray(L, f->locvars, f->sizelocvars);
  99. luaM_freearray(L, f->upvalues, f->sizeupvalues);
  100. luaM_free(L, f);
  101. }
  102. /*
  103. ** Look for n-th local variable at line `line' in function `func'.
  104. ** Returns NULL if not found.
  105. */
  106. const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
  107. int i;
  108. for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
  109. if (pc < f->locvars[i].endpc) { /* is variable active? */
  110. local_number--;
  111. if (local_number == 0)
  112. return getstr(f->locvars[i].varname);
  113. }
  114. }
  115. return NULL; /* not found */
  116. }