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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
/*
** $Id: test.c,v 1.10 1999/07/02 19:34:26 lhf Exp $
** test integrity
** See Copyright Notice in lua.h
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "luac.h"
#define AT "pc=%d"
#define ATLOC 0)
#define UNSAFE(s) \
luaL_verror("unsafe code at " AT IN "\n " s,at,INLOC
TObject* luaU_getconstant(TProtoFunc* tf, int i, int at)
{
if (i>=tf->nconsts) UNSAFE("bad constant #%d (max=%d)"),i,tf->nconsts-1,ATLOC;
return tf->consts+i;
}
static int check(int n, TProtoFunc* tf, int at, int sp, int ss)
{
if (n==0) return sp;
sp+=n;
if (sp<00) UNSAFE("stack underflow (sp=%d)"),sp,ATLOC;
if (sp>ss) UNSAFE("stack overflow (sp=%d ss=%d)"),sp,ss,ATLOC;
return sp;
}
#define CHECK(before,after) \
sp=check(-(before),tf,at,sp,ss), sp=check(after,tf,at,sp,ss)
static int jmpok(TProtoFunc* tf, int size, int at, int d)
{
int to=at+d;
if (to<2 || to>=size)
UNSAFE("invalid jump to %d (valid range is 2..%d)"),to,size-1,ATLOC;
return to;
}
static void TestStack(TProtoFunc* tf, int size, int* SP, int* JP)
{
Byte* code=tf->code;
Byte* p=code;
int longarg=0;
int ss=0;
int sp=0;
for (;;)
{
Opcode OP;
int n=INFO(tf,p,&OP);
int op=OP.class;
int i=OP.arg+longarg;
int at=p-code;
longarg=0;
switch (op) /* test sanity of operands */
{
case PUSHCONSTANT:
case GETGLOBAL:
case GETDOTTED:
case PUSHSELF:
case SETGLOBAL:
case CLOSURE:
{
TObject* o=luaU_getconstant(tf,i,at);
if ((op==CLOSURE && ttype(o)!=LUA_T_PROTO)
|| (op==GETGLOBAL && ttype(o)!=LUA_T_STRING)
|| (op==SETGLOBAL && ttype(o)!=LUA_T_STRING))
UNSAFE("bad operand to %s"),OP.name,ATLOC;
break;
}
case PUSHLOCAL:
if (i>=sp) UNSAFE("bad local #%d (max=%d)"),i,sp-1,ATLOC;
break;
case SETLOCAL:
if (i>=(sp-1)) UNSAFE("bad local #%d (max=%d)"),i,sp-2,ATLOC;
break;
case ONTJMP:
case ONFJMP: /* negate to remember ON?JMP */
JP[at]=-jmpok(tf,size,at,i+n);
break;
case JMP: /* remember JMP targets */
case IFFJMP:
JP[at]= jmpok(tf,size,at,i+n);
break;
case IFTUPJMP:
case IFFUPJMP:
JP[at]= jmpok(tf,size,at,-i+n);
break;
}
SP[at]=sp; /* remember depth before instruction */
switch (op)
{
case STACK: ss=i; break;
case ARGS: CHECK(0,i); break;
case VARARGS: break;
case ENDCODE: return;
case RETCODE: CHECK(i,0); sp=i; break;
case CALL: CHECK(OP.arg2+1,i); break;
case TAILCALL: CHECK(OP.arg2,0); sp=i; break;
case PUSHNIL: CHECK(0,i+1); break;
case POP: CHECK(0,-i); break;
case PUSHNUMBER:
case PUSHNUMBERNEG:
case PUSHCONSTANT:
case PUSHUPVALUE:
case PUSHLOCAL:
case GETGLOBAL: CHECK(0,1); break;
case GETTABLE: CHECK(2,1); break;
case GETDOTTED: CHECK(1,1); break;
case PUSHSELF: CHECK(1,2); break;
case CREATEARRAY: CHECK(0,1); break;
case SETLOCAL: CHECK(1,0); break;
case SETGLOBAL: CHECK(1,0); break;
case SETTABLEPOP: CHECK(3,0); break;
case SETTABLE: CHECK(i+3,i+2); break;
case SETLIST: CHECK(OP.arg2+1,1); break;
case SETMAP: CHECK(2*(i+1)+1,1); break;
case NEQOP:
case EQOP:
case LTOP:
case LEOP:
case GTOP:
case GEOP:
case ADDOP:
case SUBOP:
case MULTOP:
case DIVOP:
case POWOP:
case CONCOP: CHECK(2,1); break;
case MINUSOP:
case NOTOP: CHECK(1,1); break;
case ONTJMP:
case ONFJMP:
case IFFJMP:
case IFTUPJMP:
case IFFUPJMP: CHECK(1,0); break;
case JMP: break;
case CLOSURE: CHECK(OP.arg2,1); break;
case SETLINE: break;
case LONGARG:
longarg=i<<16;
if (longarg<0) UNSAFE("longarg overflow"),ATLOC;
break;
case CHECKSTACK: break;
default: /* cannot happen */
UNSAFE("cannot test opcode %d [%s]"),OP.op,OP.name,ATLOC;
break;
}
p+=n;
}
}
static void TestJumps(TProtoFunc* tf, int size, int* SP, int* JP)
{
int i;
for (i=0; i<size; i++)
{
int to=JP[i];
if (to!=0)
{
int at=i; /* for ATLOC */
int a,b,j;
int on=(to<0); /* ON?JMP */
if (on) to=-to;
a=SP[to];
if (a<0)
UNSAFE("invalid jump to %d (not an instruction)"),to,ATLOC;
for (j=i; SP[++j]<0; ) /* find next instruction */
;
b=SP[j]+on;
if (a!=b)
UNSAFE("stack inconsistency in jump to %d (expected %d, found %d)"),
to,a,b,ATLOC;
}
}
}
static void TestCode(TProtoFunc* tf)
{
static int* SP=NULL;
static int* JP=NULL;
int size=luaU_codesize(tf);
luaM_reallocvector(SP,size,int); memset(SP,-1,size*sizeof(int));
luaM_reallocvector(JP,size,int); memset(JP, 0,size*sizeof(int));
TestStack(tf,size,SP,JP);
TestJumps(tf,size,SP,JP);
}
#undef AT
#define AT "locvars[%d]"
static void TestLocals(TProtoFunc* tf)
{
LocVar* v;
int l=1;
int d=0;
if (tf->locvars==NULL) return;
for (v=tf->locvars; v->line>=0; v++)
{
int at=v-tf->locvars; /* for ATLOC */
if (l>v->line)
UNSAFE("bad line number %d; expected at least %d"),v->line,l,ATLOC;
l=v->line;
if (v->varname==NULL)
{
if (--d<0) UNSAFE("no scope to close"),ATLOC;
}
else
++d;
}
}
static void TestFunction(TProtoFunc* tf);
static void TestConstants(TProtoFunc* tf)
{
int i,n=tf->nconsts;
for (i=0; i<n; i++)
{
TObject* o=tf->consts+i;
switch (ttype(o))
{
case LUA_T_NUMBER:
break;
case LUA_T_STRING:
break;
case LUA_T_PROTO:
TestFunction(tfvalue(o));
break;
case LUA_T_NIL:
break;
default: /* cannot happen */
luaU_badconstant("print",i,o,tf);
break;
}
}
}
static void TestFunction(TProtoFunc* tf)
{
TestCode(tf);
TestLocals(tf);
TestConstants(tf);
}
void luaU_testchunk(TProtoFunc* Main)
{
TestFunction(Main);
}
|
