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
|
/*
* Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
* University Research and Technology
* Corporation. All rights reserved.
* Copyright (c) 2004-2014 The University of Tennessee and The University
* of Tennessee Research Foundation. All rights
* reserved.
* Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
* University of Stuttgart. All rights reserved.
* Copyright (c) 2004-2005 The Regents of the University of California.
* All rights reserved.
* Copyright (c) 2010 Cisco Systems, Inc. All rights reserved.
* Copyright (c) 2015 Research Organization for Information Science
* and Technology (RIST). All rights reserved.
* $COPYRIGHT$
*
* Additional copyrights may follow
*
* $HEADER$
*/
#define OMPI_BUILDING 0
#include "opal_config.h"
#ifdef HAVE_PTHREAD_H
#include <pthread.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include "opal/sys/atomic.h"
#define TEST_REPS 500
int32_t val32 = 0;
#if OPAL_HAVE_ATOMIC_MATH_64
int64_t val64 = 0;
#endif
int valint = 0;
static void* atomic_math_test(void* arg)
{
int count = *((int*) arg);
int i;
for (i = 0 ; i < count ; ++i) {
(void)opal_atomic_add_32(&val32, 5);
#if OPAL_HAVE_ATOMIC_MATH_64
(void)opal_atomic_add_64(&val64, 6);
#endif
(void)opal_atomic_add(&valint, 4);
}
return NULL;
}
static int
atomic_math_test_th(int count, int thr_count)
{
int value;
pthread_t *th;
int tid;
th = (pthread_t *) malloc(thr_count * sizeof(pthread_t));
if (!th) {
perror("malloc");
exit(EXIT_FAILURE);
}
/* Ok to use a single instance of ip_union_t from the stack here
because a) we're passing the same count to all threads, and b)
we're waiting for all the threads to finish before leaving this
function, so there's no race condition of the instance
disappearing before the threads start. */
value = count;
for (tid = 0; tid < thr_count; tid++) {
if (pthread_create(&th[tid], NULL, atomic_math_test,
(void*) &value) != 0) {
perror("pthread_create");
exit(EXIT_FAILURE);
}
}
/* -- wait for the thread set to finish -- */
for (tid = 0; tid < thr_count; tid++) {
void *thread_return;
if (pthread_join(th[tid], &thread_return) != 0) {
perror("pthread_join");
exit(EXIT_FAILURE);
}
}
free(th);
return 0;
}
int
main(int argc, char *argv[])
{
int ret = 77;
int num_threads = 1;
if (argc != 2) {
printf("*** Incorrect number of arguments. Skipping test\n");
return 77;
}
num_threads = atoi(argv[1]);
ret = atomic_math_test_th(TEST_REPS, num_threads);
if (ret == 77) return ret;
opal_atomic_mb();
if (val32 != TEST_REPS * num_threads * 5) {
printf("opal_atomic_add32 failed. Expected %d, got %d.\n",
TEST_REPS * num_threads * 5, val32);
ret = 1;
}
#if OPAL_HAVE_ATOMIC_MATH_64
if (val64 != TEST_REPS * num_threads * 6) {
/* Safe to case to (int) here because we know it's going to be
a small value */
printf("opal_atomic_add32 failed. Expected %d, got %d.\n",
TEST_REPS * num_threads * 6, (int) val64);
ret = 1;
}
#else
printf(" * skipping 64 bit tests\n");
#endif
if (valint != TEST_REPS * num_threads * 4) {
printf("opal_atomic_add32 failed. Expected %d, got %d.\n",
TEST_REPS * num_threads * 4, valint);
ret = 1;
}
return ret;
}
|
