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
|
#include <stdio.h>
#include <assert.h>
#include <emscripten.h>
struct Info {
int i;
float f;
char c;
double d;
};
int w1;
Info x[3] = { { 22, 3.159, 97, 2.1828 },
{ 55123, 987612.563, 190, 0.0009 },
{ -102, -12.532, -21, -51252 } };
int stage = 1;
void c2(char *data, int size, void *arg) { // tests queuing up several messages, each with different data
assert((int)arg == stage);
Info *x2 = (Info*)data;
int i = stage - 3;
printf("c2-%d\n", i);
printf("%d, %.2f, %d, %.2f\n", x2[0].i, x2[0].f, x2[0].c, x2[0].d);
printf("%d, %.2f, %d, %.2f\n", x[i].i, x[i].f, x[i].c, x[i].d);
assert(x2[0].i == x[i].i+1);
assert(x2[0].f == x[i].f-1);
assert(x2[0].c == x[i].c+1);
assert(x2[0].d == x[i].d-1);
if (stage == 5) {
int result = 11;
REPORT_RESULT();
}
stage++;
}
void c1(char *data, int size, void *arg) { // tests copying + buffer enlargement
assert((int)arg == stage);
Info *x2 = (Info*)data;
assert(x2 != x && x2 != x+1 && x2 != x+2);
for (int i = 0; i < size/sizeof(Info); i++) {
printf("c1-%d\n", i);
printf(" %d, %.2f, %d, %.2f\n", x2[i].i, x2[i].f, x2[i].c, x2[i].d);
printf(" %d, %.2f, %d, %.2f\n", x[i].i, x[i].f, x[i].c, x[i].d);
assert(x2[i].i == x[i].i);
assert(x2[i].f == x[i].f);
assert(x2[i].c == x[i].c);
assert(x2[i].d == x[i].d);
}
if (stage < 2) {
emscripten_call_worker(w1, "one", (char*)x, sizeof(Info)*3, c1, (void*)2);
} else {
emscripten_call_worker(w1, "two", (char*)&x[0], sizeof(Info), c2, (void*)3);
emscripten_call_worker(w1, "two", (char*)&x[1], sizeof(Info), c2, (void*)4);
emscripten_call_worker(w1, "two", (char*)&x[2], sizeof(Info), c2, (void*)5);
}
stage++;
}
int main() {
w1 = emscripten_create_worker("worker.js");
emscripten_call_worker(w1, "one", (char*)x, sizeof(Info)*2, c1, (void*)1);
return 0;
}
|
