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
|
// Copyright 2015 The Emscripten Authors. All rights reserved.
// Emscripten is available under two separate licenses, the MIT license and the
// University of Illinois/NCSA Open Source License. Both these licenses can be
// found in the LICENSE file.
#include <pthread.h>
#include <emscripten/em_asm.h>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#define NUM_THREADS 8
#define N 6
static void *thread_start(void *arg)
{
long n = (long)arg;
long *mem[N] = {};
for(long i = 0; i < N; ++i)
{
mem[i] = (long*)malloc(4);
*mem[i] = n+i;
}
for(long i = 0; i < N; ++i)
{
long k = *mem[i];
if (k != n+i)
{
EM_ASM(console.error('Memory corrupted! mem[i]: ' + $0 + ', i: ' + $1 + ', n: ' + $2), k, i, n);
pthread_exit((void*)1);
}
assert(*mem[i] == n+i);
free(mem[i]);
}
EM_ASM(console.log('Worker with task number ' + $0 + ' finished.'), n);
pthread_exit(0);
}
int main()
{
pthread_t thr[NUM_THREADS];
for(int i = 0; i < NUM_THREADS; ++i)
pthread_create(&thr[i], NULL, thread_start, (void*)(i*N));
int result = 0;
for(int i = 0; i < NUM_THREADS; ++i) {
int res = 0;
pthread_join(thr[i], (void**)&res);
result += res;
}
printf("Test finished with result %d\n", result);
assert(result == 0);
return 0;
}
|
