lfunc.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /*
  2. ** $Id: lfunc.c,v 1.68 2003/10/02 19:21:09 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. #include "lua.h"
  9. #include "lfunc.h"
  10. #include "lgc.h"
  11. #include "lmem.h"
  12. #include "lobject.h"
  13. #include "lstate.h"
  14. #define sizeCclosure(n) (cast(int, sizeof(CClosure)) + \
  15. cast(int, sizeof(TObject)*((n)-1)))
  16. #define sizeLclosure(n) (cast(int, sizeof(LClosure)) + \
  17. cast(int, sizeof(TObject *)*((n)-1)))
  18. Closure *luaF_newCclosure (lua_State *L, int nelems) {
  19. Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
  20. luaC_link(L, valtogco(c), LUA_TFUNCTION);
  21. c->c.isC = 1;
  22. c->c.nupvalues = cast(lu_byte, nelems);
  23. return c;
  24. }
  25. Closure *luaF_newLclosure (lua_State *L, int nelems, TObject *e) {
  26. Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
  27. luaC_link(L, valtogco(c), LUA_TFUNCTION);
  28. c->l.isC = 0;
  29. c->l.g = *e;
  30. c->l.nupvalues = cast(lu_byte, nelems);
  31. return c;
  32. }
  33. UpVal *luaF_newupval (lua_State *L) {
  34. UpVal *p = luaM_new(L, UpVal);
  35. luaC_link(L, valtogco(p), LUA_TUPVAL);
  36. p->v = &p->value;
  37. setnilvalue(p->v);
  38. return p;
  39. }
  40. UpVal *luaF_findupval (lua_State *L, StkId level) {
  41. GCObject **pp = &L->openupval;
  42. UpVal *p;
  43. UpVal *v;
  44. while ((p = ngcotouv(*pp)) != NULL && p->v >= level) {
  45. if (p->v == level) return p;
  46. pp = &p->next;
  47. }
  48. v = luaM_new(L, UpVal); /* not found: create a new one */
  49. v->tt = LUA_TUPVAL;
  50. v->marked = 1; /* open upvalues should not be collected */
  51. v->v = level; /* current value lives in the stack */
  52. v->next = *pp; /* chain it in the proper position */
  53. *pp = valtogco(v);
  54. return v;
  55. }
  56. void luaF_close (lua_State *L, StkId level) {
  57. UpVal *p;
  58. while ((p = ngcotouv(L->openupval)) != NULL && p->v >= level) {
  59. setobj(&p->value, p->v); /* save current value (write barrier) */
  60. p->v = &p->value; /* now current value lives here */
  61. L->openupval = p->next; /* remove from `open' list */
  62. luaC_link(L, valtogco(p), LUA_TUPVAL);
  63. }
  64. }
  65. Proto *luaF_newproto (lua_State *L) {
  66. Proto *f = luaM_new(L, Proto);
  67. luaC_link(L, valtogco(f), LUA_TPROTO);
  68. f->k = NULL;
  69. f->sizek = 0;
  70. f->p = NULL;
  71. f->sizep = 0;
  72. f->code = NULL;
  73. f->sizecode = 0;
  74. f->sizelineinfo = 0;
  75. f->sizeupvalues = 0;
  76. f->nups = 0;
  77. f->upvalues = NULL;
  78. f->numparams = 0;
  79. f->is_vararg = 0;
  80. f->maxstacksize = 0;
  81. f->lineinfo = NULL;
  82. f->sizelocvars = 0;
  83. f->locvars = NULL;
  84. f->lineDefined = 0;
  85. f->source = NULL;
  86. return f;
  87. }
  88. void luaF_freeproto (lua_State *L, Proto *f) {
  89. luaM_freearray(L, f->code, f->sizecode, Instruction);
  90. luaM_freearray(L, f->p, f->sizep, Proto *);
  91. luaM_freearray(L, f->k, f->sizek, TObject);
  92. luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
  93. luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
  94. luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
  95. luaM_freelem(L, f);
  96. }
  97. void luaF_freeclosure (lua_State *L, Closure *c) {
  98. int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
  99. sizeLclosure(c->l.nupvalues);
  100. luaM_free(L, c, size);
  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. }