File: test_pthread_create.c

package info (click to toggle)
emscripten 3.1.69%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 121,860 kB
  • sloc: ansic: 636,110; cpp: 425,974; javascript: 78,401; python: 58,404; sh: 49,154; pascal: 5,237; makefile: 3,366; asm: 2,415; lisp: 1,869
file content (93 lines) | stat: -rw-r--r-- 2,558 bytes parent folder | download | duplicates (2)
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
// 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 <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <emscripten/em_asm.h>
#include <emscripten/console.h>
#include <assert.h>

#define NUM_THREADS 8

unsigned int global_shared_data[NUM_THREADS];

void *ThreadMain(void *arg) {
  long idx = (long)arg;
  unsigned int param = global_shared_data[idx];

#define N 100

  emscripten_errf("Thread idx %lu: sorting %d numbers with param %d", idx, N, param);

  unsigned int n[N];
  // Create a shifted increasing sequence of numbers [0, N-1[
  for (unsigned int i = 0; i < N; ++i) {
    n[i] = (i + param) % N;
  }

  // Sort the sequence to ordered [0, N[
  for (unsigned int i = 0; i < N; ++i) {
    for (unsigned int j = i; j < N; ++j) {
      if (n[i] > n[j]) {
        unsigned int t = n[i];
        n[i] = n[j];
        n[j] = t;
      }
    }
  }
  // Ensure all elements are in place.
  intptr_t numGood = 0;
  for (unsigned int i = 0; i < N; ++i) {
    if (n[i] == i) {
      ++numGood;
    } else {
      emscripten_errf("n[%d]=%d", i, n[i]);
    }
  }

  emscripten_outf("Thread idx %ld with param %d: all done with result %ld.", idx, param, numGood);
  pthread_exit((void*)numGood);
}

pthread_t thread[NUM_THREADS];

void CreateThread(intptr_t i) {
  static int counter = 1;
  // Arbitrary random'ish data for perturbing the sort for this thread task.
  global_shared_data[i] = (counter++ * 12141231) & 0x7FFFFFFF;
  // emscripten_outf("Main: Creating thread idx %d (param %d)", i, global_shared_data[i]);
  int rc = pthread_create(&thread[i], NULL, ThreadMain, (void*)i);
  assert(rc == 0);
}

int main() {
  // Create initial threads.
  for (int i = 0; i < NUM_THREADS; ++i)
    CreateThread(i);

  int numThreadsToCreate = 1000;

  // Join all threads and create more.
  while (numThreadsToCreate > 0) {
    for (int i = 0; i < NUM_THREADS; ++i) {
      if (thread[i]) {
        intptr_t status;
        int rc = pthread_join(thread[i], (void**)&status);
        assert(rc == 0);
        emscripten_errf("Main: Joined thread idx %d (param %d) with status %d", i, global_shared_data[i], (int)status);
        assert(status == N);
        thread[i] = 0;
        if (numThreadsToCreate > 0) {
          --numThreadsToCreate;
          CreateThread(i);
        }
      }
    }
  }

  printf("All threads joined.\n");
  return 0;
}