-
Notifications
You must be signed in to change notification settings - Fork 88
/
run_tests.cpp
294 lines (254 loc) · 7.79 KB
/
run_tests.cpp
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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
/*
* TinyJS
*
* A single-file Javascript-alike engine
*
* Authored By Gordon Williams <[email protected]>
*
* Copyright (C) 2009 Pur3 Ltd
*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is furnished to do
* so, subject to the following conditions:
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
/*
* This is a program to run all the tests in the tests folder...
*/
#include "TinyJS.h"
#include "TinyJS_Functions.h"
#include "TinyJS_MathFunctions.h"
#include <assert.h>
#include <sys/stat.h>
#include <string>
#include <sstream>
#include <stdio.h>
#ifdef MTRACE
#include <mcheck.h>
#endif
//#define INSANE_MEMORY_DEBUG
#ifdef INSANE_MEMORY_DEBUG
// needs -rdynamic when compiling/linking
#include <execinfo.h>
#include <malloc.h>
#include <map>
#include <vector>
using namespace std;
void **get_stackframe() {
void **trace = (void**)malloc(sizeof(void*)*17);
int trace_size = 0;
for (int i=0;i<17;i++) trace[i]=(void*)0;
trace_size = backtrace(trace, 16);
return trace;
}
void print_stackframe(char *header, void **trace) {
char **messages = (char **)NULL;
int trace_size = 0;
trace_size = 0;
while (trace[trace_size]) trace_size++;
messages = backtrace_symbols(trace, trace_size);
printf("%s\n", header);
for (int i=0; i<trace_size; ++i) {
printf("%s\n", messages[i]);
}
//free(messages);
}
/* Prototypes for our hooks. */
static void *my_malloc_hook (size_t, const void *);
static void my_free_hook (void*, const void *);
static void *(*old_malloc_hook) (size_t, const void *);
static void (*old_free_hook) (void*, const void *);
map<void *, void **> malloced;
static void *my_malloc_hook(size_t size, const void *caller) {
/* Restore all old hooks */
__malloc_hook = old_malloc_hook;
__free_hook = old_free_hook;
/* Call recursively */
void *result = malloc (size);
/* we call malloc here, so protect it too. */
//printf ("malloc (%u) returns %p\n", (unsigned int) size, result);
malloced[result] = get_stackframe();
/* Restore our own hooks */
__malloc_hook = my_malloc_hook;
__free_hook = my_free_hook;
return result;
}
static void my_free_hook(void *ptr, const void *caller) {
/* Restore all old hooks */
__malloc_hook = old_malloc_hook;
__free_hook = old_free_hook;
/* Call recursively */
free (ptr);
/* we call malloc here, so protect it too. */
//printf ("freed pointer %p\n", ptr);
if (malloced.find(ptr) == malloced.end()) {
/*fprintf(stderr, "INVALID FREE\n");
void *trace[16];
int trace_size = 0;
trace_size = backtrace(trace, 16);
backtrace_symbols_fd(trace, trace_size, STDERR_FILENO);*/
} else
malloced.erase(ptr);
/* Restore our own hooks */
__malloc_hook = my_malloc_hook;
__free_hook = my_free_hook;
}
void memtracing_init() {
old_malloc_hook = __malloc_hook;
old_free_hook = __free_hook;
__malloc_hook = my_malloc_hook;
__free_hook = my_free_hook;
}
long gethash(void **trace) {
unsigned long hash = 0;
while (*trace) {
hash = (hash<<1) ^ (hash>>63) ^ (unsigned long)*trace;
trace++;
}
return hash;
}
void memtracing_kill() {
/* Restore all old hooks */
__malloc_hook = old_malloc_hook;
__free_hook = old_free_hook;
map<long, void**> hashToReal;
map<long, int> counts;
map<void *, void **>::iterator it = malloced.begin();
while (it!=malloced.end()) {
long hash = gethash(it->second);
hashToReal[hash] = it->second;
if (counts.find(hash) == counts.end())
counts[hash] = 1;
else
counts[hash]++;
it++;
}
vector<pair<int, long> > sorting;
map<long, int>::iterator countit = counts.begin();
while (countit!=counts.end()) {
sorting.push_back(pair<int, long>(countit->second, countit->first));
countit++;
}
// sort
bool done = false;
while (!done) {
done = true;
for (int i=0;i<sorting.size()-1;i++) {
if (sorting[i].first < sorting[i+1].first) {
pair<int, long> t = sorting[i];
sorting[i] = sorting[i+1];
sorting[i+1] = t;
done = false;
}
}
}
for (int i=0;i<sorting.size();i++) {
long hash = sorting[i].second;
int count = sorting[i].first;
char header[256];
sprintf(header, "--------------------------- LEAKED %d", count);
print_stackframe(header, hashToReal[hash]);
}
}
#endif // INSANE_MEMORY_DEBUG
bool run_test(const char *filename) {
printf("TEST %s ", filename);
struct stat results;
if (!stat(filename, &results) == 0) {
printf("Cannot stat file! '%s'\n", filename);
return false;
}
int size = results.st_size;
FILE *file = fopen( filename, "rb" );
/* if we open as text, the number of bytes read may be > the size we read */
if( !file ) {
printf("Unable to open file! '%s'\n", filename);
return false;
}
char *buffer = new char[size+1];
long actualRead = fread(buffer,1,size,file);
buffer[actualRead]=0;
buffer[size]=0;
fclose(file);
CTinyJS s;
registerFunctions(&s);
registerMathFunctions(&s);
s.root->addChild("result", new CScriptVar("0",SCRIPTVAR_INTEGER));
try {
s.execute(buffer);
} catch (CScriptException *e) {
printf("ERROR: %s\n", e->text.c_str());
}
bool pass = s.root->getParameter("result")->getBool();
if (pass)
printf("PASS\n");
else {
char fn[64];
sprintf(fn, "%s.fail.js", filename);
FILE *f = fopen(fn, "wt");
if (f) {
std::ostringstream symbols;
s.root->getJSON(symbols);
fprintf(f, "%s", symbols.str().c_str());
fclose(f);
}
printf("FAIL - symbols written to %s\n", fn);
}
delete[] buffer;
return pass;
}
int main(int argc, char **argv)
{
#ifdef MTRACE
mtrace();
#endif
#ifdef INSANE_MEMORY_DEBUG
memtracing_init();
#endif
printf("TinyJS test runner\n");
printf("USAGE:\n");
printf(" ./run_tests test.js : run just one test\n");
printf(" ./run_tests : run all tests\n");
if (argc==2) {
return !run_test(argv[1]);
}
int test_num = 1;
int count = 0;
int passed = 0;
while (test_num<1000) {
char fn[32];
sprintf(fn, "tests/test%03d.js", test_num);
// check if the file exists - if not, assume we're at the end of our tests
FILE *f = fopen(fn,"r");
if (!f) break;
fclose(f);
if (run_test(fn))
passed++;
count++;
test_num++;
}
printf("Done. %d tests, %d pass, %d fail\n", count, passed, count-passed);
#ifdef INSANE_MEMORY_DEBUG
memtracing_kill();
#endif
#ifdef _DEBUG
#ifdef _WIN32
_CrtDumpMemoryLeaks();
#endif
#endif
#ifdef MTRACE
muntrace();
#endif
return 0;
}