summaryrefslogtreecommitdiff
path: root/apps/plugins/lua/lfunc.c
blob: 813e88f5831bb9cfb6f5dabfae930df30231fa67 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/*
** $Id: lfunc.c,v 2.12.1.2 2007/12/28 14:58:43 roberto Exp $
** Auxiliary functions to manipulate prototypes and closures
** See Copyright Notice in lua.h
*/


#include <stddef.h>

#define lfunc_c
#define LUA_CORE

#include "lua.h"

#include "lfunc.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lstate.h"



Closure *luaF_newCclosure (lua_State *L, int nelems, Table *e) {
  Closure *c = cast(Closure *, luaM_malloc(L, sizeCclosure(nelems)));
  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
  c->c.isC = 1;
  c->c.env = e;
  c->c.nupvalues = cast_byte(nelems);
  return c;
}


Closure *luaF_newLclosure (lua_State *L, int nelems, Table *e) {
  Closure *c = cast(Closure *, luaM_malloc(L, sizeLclosure(nelems)));
  luaC_link(L, obj2gco(c), LUA_TFUNCTION);
  c->l.isC = 0;
  c->l.env = e;
  c->l.nupvalues = cast_byte(nelems);
  while (nelems--) c->l.upvals[nelems] = NULL;
  return c;
}


UpVal *luaF_newupval (lua_State *L) {
  UpVal *uv = luaM_new(L, UpVal);
  luaC_link(L, obj2gco(uv), LUA_TUPVAL);
  uv->v = &uv->u.value;
  setnilvalue(uv->v);
  return uv;
}


UpVal *luaF_findupval (lua_State *L, StkId level) {
  global_State *g = G(L);
  GCObject **pp = &L->openupval;
  UpVal *p;
  UpVal *uv;
  while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) {
    lua_assert(p->v != &p->u.value);
    if (p->v == level) {  /* found a corresponding upvalue? */
      if (isdead(g, obj2gco(p)))  /* is it dead? */
        changewhite(obj2gco(p));  /* ressurect it */
      return p;
    }
    pp = &p->next;
  }
  uv = luaM_new(L, UpVal);  /* not found: create a new one */
  uv->tt = LUA_TUPVAL;
  uv->marked = luaC_white(g);
  uv->v = level;  /* current value lives in the stack */
  uv->next = *pp;  /* chain it in the proper position */
  *pp = obj2gco(uv);
  uv->u.l.prev = &g->uvhead;  /* double link it in `uvhead' list */
  uv->u.l.next = g->uvhead.u.l.next;
  uv->u.l.next->u.l.prev = uv;
  g->uvhead.u.l.next = uv;
  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  return uv;
}


static void unlinkupval (UpVal *uv) {
  lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv);
  uv->u.l.next->u.l.prev = uv->u.l.prev;  /* remove from `uvhead' list */
  uv->u.l.prev->u.l.next = uv->u.l.next;
}


void luaF_freeupval (lua_State *L, UpVal *uv) {
  if (uv->v != &uv->u.value)  /* is it open? */
    unlinkupval(uv);  /* remove from open list */
  luaM_free(L, uv);  /* free upvalue */
}


void luaF_close (lua_State *L, StkId level) {
  UpVal *uv;
  global_State *g = G(L);
  while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) {
    GCObject *o = obj2gco(uv);
    lua_assert(!isblack(o) && uv->v != &uv->u.value);
    L->openupval = uv->next;  /* remove from `open' list */
    if (isdead(g, o))
      luaF_freeupval(L, uv);  /* free upvalue */
    else {
      unlinkupval(uv);
      setobj(L, &uv->u.value, uv->v);
      uv->v = &uv->u.value;  /* now current value lives here */
      luaC_linkupval(L, uv);  /* link upvalue into `gcroot' list */
    }
  }
}


Proto *luaF_newproto (lua_State *L) {
  Proto *f = luaM_new(L, Proto);
  luaC_link(L, obj2gco(f), LUA_TPROTO);
  f->k = NULL;
  f->sizek = 0;
  f->p = NULL;
  f->sizep = 0;
  f->code = NULL;
  f->sizecode = 0;
  f->sizelineinfo = 0;
  f->sizeupvalues = 0;
  f->nups = 0;
  f->upvalues = NULL;
  f->numparams = 0;
  f->is_vararg = 0;
  f->maxstacksize = 0;
  f->lineinfo = NULL;
  f->sizelocvars = 0;
  f->locvars = NULL;
  f->linedefined = 0;
  f->lastlinedefined = 0;
  f->source = NULL;
  return f;
}


void luaF_freeproto (lua_State *L, Proto *f) {
  luaM_freearray(L, f->code, f->sizecode, Instruction);
  luaM_freearray(L, f->p, f->sizep, Proto *);
  luaM_freearray(L, f->k, f->sizek, TValue);
  luaM_freearray(L, f->lineinfo, f->sizelineinfo, int);
  luaM_freearray(L, f->locvars, f->sizelocvars, struct LocVar);
  luaM_freearray(L, f->upvalues, f->sizeupvalues, TString *);
  luaM_free(L, f);
}


void luaF_freeclosure (lua_State *L, Closure *c) {
  int size = (c->c.isC) ? sizeCclosure(c->c.nupvalues) :
                          sizeLclosure(c->l.nupvalues);
  luaM_freemem(L, c, size);
}


/*
** Look for n-th local variable at line `line' in function `func'.
** Returns NULL if not found.
*/
const char *luaF_getlocalname (const Proto *f, int local_number, int pc) {
  int i;
  for (i = 0; i<f->sizelocvars && f->locvars[i].startpc <= pc; i++) {
    if (pc < f->locvars[i].endpc) {  /* is variable active? */
      local_number--;
      if (local_number == 0)
        return getstr(f->locvars[i].varname);
    }
  }
  return NULL;  /* not found */
}

der8: movem.l (%a1), %d5-%d7/%a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (%a0)+, %a6, %acc0 mac.l %a6, %d6, (%a0)+, %a6, %acc0 mac.l %a6, %d5, (-7*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) lea.l (-6*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .order7: movem.l (%a1), %d6-%d7/%a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (%a0)+, %a6, %acc0 mac.l %a6, %d6, (-6*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) lea.l (-5*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .order6: movem.l (%a1), %d7/%a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (-5*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) lea.l (-4*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .order5: movem.l (%a1), %a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (-4*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) lea.l (-3*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .order4: movem.l (%a1), %a2-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (-3*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) subq.l #8, %a0 subq.l #1, %d0 jne 1b jra .exit .order3: movem.l (%a1), %a3-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (-2*4, %a0), %a6, %acc0 movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) subq.l #4, %a0 subq.l #1, %d0 jne 1b jra .exit .order2: movem.l (%a1), %a4-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, %acc0 | data for next iteration is already loaded movclr.l %acc0, %d2 asr.l %d1, %d2 add.l %d2, (%a0) subq.l #1, %d0 jne 1b jra .exit .order1: | no point in using mac here move.l (%a1), %a5 1: move.l %a5, %d2 muls.l (%a0)+, %d2 asr.l %d1, %d2 add.l %d2, (%a0) subq.l #1, %d0 jne 1b jra .exit .default: /* we do the filtering in an unrolled by 4 loop as far as we can, and then do the rest by jump table. */ lea.l (%a1, %d2.l*4), %a2 | need to start in the other end of coefs move.l %a0, %a3 | working copy of history pointer move.l %d2, %d3 lsr.l #2, %d3 | coefs/4, num of iterations needed in next loop move.l (%a3)+, %a5 | preload data for loop 1: lea.l (-4*4, %a2), %a2 | move lpc coef pointer four samples backwards movem.l (%a2), %d4-%d7 | load four coefs mac.l %a5, %d7, (%a3)+, %a5, %acc0 mac.l %a5, %d6, (%a3)+, %a5, %acc0 mac.l %a5, %d5, (%a3)+, %a5, %acc0 mac.l %a5, %d4, (%a3)+, %a5, %acc0 subq.l #1, %d3 | any more unrolled loop operations left? jne 1b moveq.l #3, %d3 | mask 0x00000003 and.l %d2, %d3 | get the remaining samples to be filtered jmp.l (2, %pc, %d3*2) | then jump into mac.l chain | jumptable: bra.b 3f | none left bra.b 2f | one left bra.b 1f | two left | three left move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 1: move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 2: move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 3: movclr.l %acc0, %d3 | get result asr.l %d1, %d3 | shift qlevel bits right add.l %a5, %d3 | add residual, which is in a5 by now move.l %d3, -(%a3) | save, a3 is also one past save location addq.l #4, %a0 | increment history pointer subq.l #1, %d0 | decrement sample count jne .default | are we done? jra .exit | if so, fall through to exit /* This routine deals with sample widths 24 and lower. All LPC filtering up to order 8 is done in specially optimised unrolled loops, while every order above this is handled by a slower default routine. */ .global lpc_decode_emac_wide .align 2 lpc_decode_emac_wide: lea.l (-44, %sp), %sp movem.l %d2-%d7/%a2-%a6, (%sp) movem.l (44+4, %sp), %d0-%d1/%d3/%a0-%a1 /* d0 = blocksize, d1 = qlevel, d3 = pred_order a0 = data, a1 = coeffs */ /* the data pointer always lags behind history pointer by 'pred_order' samples. since we have one loop for each order, we can hard code this and free a register by not saving data pointer. */ move.l %d3, %d2 neg.l %d2 lea.l (%a0, %d2.l*4), %a0 | history clr.l %d2 move.l %d2, %macsr | we'll need integer mode for this tst.l %d0 jeq .exit | zero samples to process, exit moveq.l #32, %d2 sub.l %d1, %d2 | calculate shift amount for extension byte moveq.l #8, %d4 cmp.l %d4, %d3 jgt .wdefault | order is over 8, jump to default case jmp.l (2, %pc, %d3.l*4) | jump to loop corresponding to pred_order | jumptable: bra.w .exit | zero order filter isn't possible, exit function bra.w .worder1 bra.w .worder2 bra.w .worder3 bra.w .worder4 bra.w .worder5 bra.w .worder6 bra.w .worder7 | last jump table entry coincides with target, so leave it out .worder8: movem.l (%a1), %d5-%d7/%a1-%a5 | load lpc coefs move.l (%a0)+, %a6 | load first history sample 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (%a0)+, %a6, %acc0 mac.l %a6, %d6, (%a0)+, %a6, %acc0 mac.l %a6, %d5, (-7*4, %a0), %a6, %acc0 | load for the next iteration move.l %accext01, %d4 | get top 8 bits of sum movclr.l %acc0, %d3 | then botten 32 bits lsr.l %d1, %d3 | shift bottom bits qlevel bits right asl.l %d2, %d4 | shift top bits 32 - qlevel bits left or.l %d4, %d3 | now combine results add.l %d3, (%a0) | add residual and save lea.l (-6*4, %a0), %a0 | point history back at second element subq.l #1, %d0 | decrement sample count jne 1b | are we done? jra .exit .worder7: movem.l (%a1), %d6-%d7/%a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (%a0)+, %a6, %acc0 mac.l %a6, %d6, (-6*4, %a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) lea.l (-5*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .worder6: movem.l (%a1), %d7/%a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (%a0)+, %a6, %acc0 mac.l %a6, %d7, (-5*4, %a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) lea.l (-4*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .worder5: movem.l (%a1), %a1-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (%a0)+, %a6, %acc0 mac.l %a6, %a1, (-4*4, %a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) lea.l (-3*4, %a0), %a0 subq.l #1, %d0 jne 1b jra .exit .worder4: movem.l (%a1), %a2-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (%a0)+, %a6, %acc0 mac.l %a6, %a2, (-3*4, %a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) subq.l #8, %a0 subq.l #1, %d0 jne 1b jra .exit .worder3: movem.l (%a1), %a3-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, (%a0)+, %a6, %acc0 mac.l %a6, %a3, (-2*4, %a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) subq.l #4, %a0 subq.l #1, %d0 jne 1b jra .exit .worder2: movem.l (%a1), %a4-%a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0)+, %a6, %acc0 mac.l %a6, %a4, %acc0 | data for next iteration is already loaded move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %d3, (%a0) subq.l #1, %d0 jne 1b jra .exit .worder1: move.l (%a1), %a5 move.l (%a0)+, %a6 1: mac.l %a6, %a5, (%a0), %a6, %acc0 move.l %accext01, %d4 movclr.l %acc0, %d3 lsr.l %d1, %d3 asl.l %d2, %d4 or.l %d4, %d3 add.l %a6, %d3 | residual is already in a6 move.l %d3, (%a0)+ subq.l #1, %d0 jne 1b jra .exit .wdefault: /* we do the filtering in an unrolled by 4 loop as far as we can, and then do the rest by jump table. */ lea.l (%a1, %d3.l*4), %a2 | need to start in the other end of coefs move.l %a0, %a3 | working copy of history pointer move.l %d3, %d4 lsr.l #2, %d4 | coefs/4, num of iterations needed in next loop move.l (%a3)+, %a5 | preload data for loop 1: lea.l (-4*4, %a2), %a2 | move lpc coef pointer four samples backwards movem.l (%a2), %d5-%d7/%a4 | load four coefs mac.l %a5, %a4, (%a3)+, %a5, %acc0 mac.l %a5, %d7, (%a3)+, %a5, %acc0 mac.l %a5, %d6, (%a3)+, %a5, %acc0 mac.l %a5, %d5, (%a3)+, %a5, %acc0 subq.l #1, %d4 | any more unrolled loop operations left? jne 1b moveq.l #3, %d4 | mask 0x00000003 and.l %d3, %d4 | get the remaining samples to be filtered jmp.l (2, %pc, %d4*2) | then jump into mac.l chain | jumptable: bra.b 3f | none left bra.b 2f | one left bra.b 1f | two left | three left move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 1: move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 2: move.l -(%a2), %d4 mac.l %a5, %d4, (%a3)+, %a5, %acc0 3: move.l %accext01, %d5 | get high 32 bits of result movclr.l %acc0, %d4 | get low 32 bits of result lsr.l %d1, %d4 | shift qlevel bits right asl.l %d2, %d5 | shift 32 - qlevel bits left or.l %d5, %d4 | combine top and low bits after shift add.l %a5, %d4 | add residual, which is in a5 by now move.l %d4, -(%a3) | save, a3 is also one past save location addq.l #4, %a0 | increment history pointer subq.l #1, %d0 | decrement sample count jne .wdefault | are we done? | if so, fall through to exit .exit: movem.l (%sp), %d2-%d7/%a2-%a6 lea.l (44, %sp), %sp rts