FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
emscripten/tests/pthread/test_pthread_barrier.cpp at incoming · JavaScriptIOT/emscripten · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
JavaScriptIOT
/
emscripten
Public
forked from
emscripten-core/emscripten
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
emscripten
/
tests
/
pthread
/
test_pthread_barrier.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
83 lines (69 loc) · 1.87 KB
Breadcrumbs
emscripten
/
tests
/
pthread
/
test_pthread_barrier.cpp
Copy path
File metadata and controls
83 lines (69 loc) · 1.87 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
This file tests pthread barrier usage.
#
include
<
emscripten/threading.h
>
#
include
<
pthread.h
>
#
include
<
stdlib.h
>
#
include
<
stdio.h
>
#
include
<
assert.h
>
#
define
N
100
#
define
THREADS
8
int
matrix[N][N] = {};
int
intermediate[N] = {};
//
Barrier variable
pthread_barrier_t
barr;
//
Sums a single row of a matrix.
int
sum_row
(
int
r)
{
int
sum =
0
;
for
(
int
i =
0
; i < N; ++i)
sum += matrix[r][i];
return
sum;
}
void
*
thread_main
(
void
*arg)
{
//
Each thread sums individual rows.
int
id = (
int
)arg;
for
(
int
i = id; i < N; i +=
THREADS
)
intermediate[i] =
sum_row
(i);
//
Synchronization point
int
rc =
pthread_barrier_wait
(&barr);
if
(rc !=
0
&& rc !=
PTHREAD_BARRIER_SERIAL_THREAD
)
{
printf
(
"
Could not wait on barrier
\n
"
);
exit
(-
1
);
}
//
Then each thread sums the one intermediate vector.
int
totalSum =
0
;
for
(
int
i =
0
; i < N; ++i)
totalSum += intermediate[i];
pthread_exit
((
void
*)totalSum);
}
int
main
(
int
argc,
char
**argv)
{
pthread_t
thr[
THREADS
];
//
Create the matrix and compute the expected result.
int
expectedTotalSum =
0
;
srand
(
time
(
NULL
));
for
(
int
i =
0
; i < N; ++i)
for
(
int
j =
0
; j < N; ++j)
{
matrix[i][j] =
rand
();
expectedTotalSum += matrix[i][j];
}
printf
(
"
The sum of the matrix is %d.
\n
"
, expectedTotalSum);
//
Barrier initialization
int
ret =
pthread_barrier_init
(&barr,
NULL
,
THREADS
);
assert
(ret ==
0
);
for
(
int
i =
0
; i <
THREADS
; ++i)
pthread_create
(&thr[i],
NULL
, &thread_main, (
void
*)i);
if
(
emscripten_has_threading_support
())
{
for
(
int
i =
0
; i <
THREADS
; ++i)
{
int
totalSum =
0
;
pthread_join
(thr[i], (
void
**)&totalSum);
assert
(totalSum == expectedTotalSum);
}
}
#
ifdef
REPORT_RESULT
REPORT_RESULT
(
0
);
#
endif
}
Back
|
FazBrowse Home
|
New Git URL