lfunc.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /*
  2. ** $Id: lfunc.c,v 2.40 2014/02/15 13:12:01 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. /*
  28. ** fill a closure with new closed upvalues
  29. */
  30. void luaF_initupvals (lua_State *L, LClosure *cl) {
  31. int i;
  32. for (i = 0; i < cl->nupvalues; i++) {
  33. UpVal *uv = luaM_new(L, UpVal);
  34. uv->refcount = 1;
  35. uv->v = &uv->u.value; /* make it closed */
  36. setnilvalue(uv->v);
  37. cl->upvals[i] = uv;
  38. }
  39. }
  40. UpVal *luaF_findupval (lua_State *L, StkId level) {
  41. UpVal **pp = &L->openupval;
  42. UpVal *p;
  43. UpVal *uv;
  44. lua_assert(isintwups(L) || L->openupval == NULL);
  45. while (*pp != NULL && (p = *pp)->v >= level) {
  46. lua_assert(upisopen(p));
  47. if (p->v == level) /* found a corresponding upvalue? */
  48. return p; /* return it */
  49. pp = &p->u.open.next;
  50. }
  51. /* not found: create a new upvalue */
  52. uv = luaM_new(L, UpVal);
  53. uv->refcount = 0;
  54. uv->u.open.next = *pp; /* link it to list of open upvalues */
  55. uv->u.open.touched = 1;
  56. *pp = uv;
  57. uv->v = level; /* current value lives in the stack */
  58. if (!isintwups(L)) { /* thread not in list of threads with upvalues? */
  59. L->twups = G(L)->twups; /* link it to the list */
  60. G(L)->twups = L;
  61. }
  62. return uv;
  63. }
  64. void luaF_close (lua_State *L, StkId level) {
  65. UpVal *uv;
  66. while (L->openupval != NULL && (uv = L->openupval)->v >= level) {
  67. lua_assert(upisopen(uv));
  68. L->openupval = uv->u.open.next; /* remove from `open' list */
  69. if (uv->refcount == 0) /* no references? */
  70. luaM_free(L, uv); /* free upvalue */
  71. else {
  72. setobj(L, &uv->u.value, uv->v); /* move value to upvalue slot */
  73. uv->v = &uv->u.value; /* now current value lives here */
  74. luaC_upvalbarrier(L, uv);
  75. }
  76. }
  77. }
  78. Proto *luaF_newproto (lua_State *L) {
  79. Proto *f = &luaC_newobj(L, LUA_TPROTO, sizeof(Proto))->p;
  80. f->k = NULL;
  81. f->sizek = 0;
  82. f->p = NULL;
  83. f->sizep = 0;
  84. f->code = NULL;
  85. f->cache = NULL;
  86. f->sizecode = 0;
  87. f->lineinfo = NULL;
  88. f->sizelineinfo = 0;
  89. f->upvalues = NULL;
  90. f->sizeupvalues = 0;
  91. f->numparams = 0;
  92. f->is_vararg = 0;
  93. f->maxstacksize = 0;
  94. f->locvars = NULL;
  95. f->sizelocvars = 0;
  96. f->linedefined = 0;
  97. f->lastlinedefined = 0;
  98. f->source = NULL;
  99. return f;
  100. }
  101. void luaF_freeproto (lua_State *L, Proto *f) {
  102. luaM_freearray(L, f->code, f->sizecode);
  103. luaM_freearray(L, f->p, f->sizep);
  104. luaM_freearray(L, f->k, f->sizek);
  105. luaM_freearray(L, f->lineinfo, f->sizelineinfo);
  106. luaM_freearray(L, f->locvars, f->sizelocvars);
  107. luaM_freearray(L, f->upvalues, f->sizeupvalues);
  108. luaM_free(L, f);
  109. }
  110. /*
  111. ** Look for n-th local variable at line `line' in function `func'.
  112. ** Returns NULL if not found.
  113. */
  114. const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
  115. int i;
  116. for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
  117. if (pc < f->locvars[i].endpc) { /* is variable active? */
  118. local_number--;
  119. if (local_number == 0)
  120. return getstr(f->locvars[i].varname);
  121. }
  122. }
  123. return NULL; /* not found */
  124. }