Commit | Line | Data |
---|---|---|
102d1d23 MD |
1 | /* |
2 | * test_perthreadloc_timing.c | |
3 | * | |
4 | * Per thread locks - test program | |
5 | * | |
6982d6d7 | 6 | * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com> |
102d1d23 MD |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify | |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License along | |
19 | * with this program; if not, write to the Free Software Foundation, Inc., | |
20 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. | |
21 | */ | |
22 | ||
23 | #include <stdio.h> | |
24 | #include <pthread.h> | |
25 | #include <stdlib.h> | |
26 | #include <string.h> | |
27 | #include <sys/types.h> | |
28 | #include <sys/wait.h> | |
29 | #include <unistd.h> | |
30 | #include <stdio.h> | |
31 | #include <assert.h> | |
102d1d23 | 32 | #include <pthread.h> |
94b343fd | 33 | #include <errno.h> |
833dbdb6 | 34 | |
ec4e58a3 | 35 | #include <urcu/arch.h> |
102d1d23 | 36 | |
94df6318 | 37 | #include "thread-id.h" |
102d1d23 | 38 | |
ec4e58a3 | 39 | #include <urcu.h> |
102d1d23 MD |
40 | |
41 | struct test_array { | |
42 | int a; | |
43 | }; | |
44 | ||
45 | static struct test_array test_array = { 8 }; | |
46 | ||
47 | struct per_thread_lock { | |
48 | pthread_mutex_t lock; | |
06f22bdb | 49 | } __attribute__((aligned(CAA_CACHE_LINE_SIZE))); /* cache-line aligned */ |
102d1d23 MD |
50 | |
51 | static struct per_thread_lock *per_thread_lock; | |
52 | ||
53 | #define OUTER_READ_LOOP 200U | |
54 | #define INNER_READ_LOOP 100000U | |
55 | #define READ_LOOP ((unsigned long long)OUTER_READ_LOOP * INNER_READ_LOOP) | |
56 | ||
57 | #define OUTER_WRITE_LOOP 10U | |
58 | #define INNER_WRITE_LOOP 200U | |
59 | #define WRITE_LOOP ((unsigned long long)OUTER_WRITE_LOOP * INNER_WRITE_LOOP) | |
60 | ||
2c9689fe MD |
61 | static int num_read; |
62 | static int num_write; | |
102d1d23 | 63 | |
2c9689fe MD |
64 | #define NR_READ num_read |
65 | #define NR_WRITE num_write | |
66 | ||
3fa18286 MD |
67 | static caa_cycles_t __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *reader_time; |
68 | static caa_cycles_t __attribute__((aligned(CAA_CACHE_LINE_SIZE))) *writer_time; | |
102d1d23 | 69 | |
3b4d3084 | 70 | static |
102d1d23 MD |
71 | void *thr_reader(void *arg) |
72 | { | |
83e334d0 | 73 | unsigned int i, j; |
3fa18286 | 74 | caa_cycles_t time1, time2; |
102d1d23 MD |
75 | long tidx = (long)arg; |
76 | ||
94df6318 MD |
77 | printf("thread_begin %s, tid %lu\n", |
78 | "reader", urcu_get_thread_id()); | |
102d1d23 MD |
79 | sleep(2); |
80 | ||
06f22bdb | 81 | time1 = caa_get_cycles(); |
102d1d23 MD |
82 | for (i = 0; i < OUTER_READ_LOOP; i++) { |
83 | for (j = 0; j < INNER_READ_LOOP; j++) { | |
84 | pthread_mutex_lock(&per_thread_lock[tidx].lock); | |
85 | assert(test_array.a == 8); | |
86 | pthread_mutex_unlock(&per_thread_lock[tidx].lock); | |
87 | } | |
88 | } | |
06f22bdb | 89 | time2 = caa_get_cycles(); |
102d1d23 MD |
90 | |
91 | reader_time[tidx] = time2 - time1; | |
92 | ||
93 | sleep(2); | |
94df6318 MD |
94 | printf("thread_end %s, tid %lu\n", |
95 | "reader", urcu_get_thread_id()); | |
102d1d23 MD |
96 | return ((void*)1); |
97 | ||
98 | } | |
99 | ||
3b4d3084 | 100 | static |
102d1d23 MD |
101 | void *thr_writer(void *arg) |
102 | { | |
83e334d0 | 103 | unsigned int i, j; |
102d1d23 | 104 | long tidx; |
3fa18286 | 105 | caa_cycles_t time1, time2; |
102d1d23 | 106 | |
94df6318 MD |
107 | printf("thread_begin %s, tid %lu\n", |
108 | "writer", urcu_get_thread_id()); | |
102d1d23 MD |
109 | sleep(2); |
110 | ||
111 | for (i = 0; i < OUTER_WRITE_LOOP; i++) { | |
112 | for (j = 0; j < INNER_WRITE_LOOP; j++) { | |
06f22bdb | 113 | time1 = caa_get_cycles(); |
102d1d23 MD |
114 | for (tidx = 0; tidx < NR_READ; tidx++) { |
115 | pthread_mutex_lock(&per_thread_lock[tidx].lock); | |
116 | } | |
117 | test_array.a = 8; | |
118 | for (tidx = NR_READ - 1; tidx >= 0; tidx--) { | |
119 | pthread_mutex_unlock(&per_thread_lock[tidx].lock); | |
120 | } | |
06f22bdb | 121 | time2 = caa_get_cycles(); |
102d1d23 | 122 | writer_time[(unsigned long)arg] += time2 - time1; |
fc606a74 | 123 | usleep(1); |
102d1d23 | 124 | } |
102d1d23 MD |
125 | } |
126 | ||
94df6318 MD |
127 | printf("thread_end %s, tid %lu\n", |
128 | "writer", urcu_get_thread_id()); | |
102d1d23 MD |
129 | return ((void*)2); |
130 | } | |
131 | ||
2c9689fe | 132 | int main(int argc, char **argv) |
102d1d23 MD |
133 | { |
134 | int err; | |
2c9689fe | 135 | pthread_t *tid_reader, *tid_writer; |
102d1d23 MD |
136 | void *tret; |
137 | int i; | |
3fa18286 MD |
138 | caa_cycles_t tot_rtime = 0; |
139 | caa_cycles_t tot_wtime = 0; | |
102d1d23 | 140 | |
2c9689fe MD |
141 | if (argc < 2) { |
142 | printf("Usage : %s nr_readers nr_writers\n", argv[0]); | |
143 | exit(-1); | |
144 | } | |
145 | num_read = atoi(argv[1]); | |
146 | num_write = atoi(argv[2]); | |
147 | ||
9aa14175 MD |
148 | reader_time = calloc(num_read, sizeof(*reader_time)); |
149 | writer_time = calloc(num_write, sizeof(*writer_time)); | |
150 | tid_reader = calloc(num_read, sizeof(*tid_reader)); | |
151 | tid_writer = calloc(num_write, sizeof(*tid_writer)); | |
2c9689fe | 152 | |
94df6318 MD |
153 | printf("thread %-6s, tid %lu\n", |
154 | "main", urcu_get_thread_id()); | |
102d1d23 MD |
155 | |
156 | per_thread_lock = malloc(sizeof(struct per_thread_lock) * NR_READ); | |
157 | ||
158 | for (i = 0; i < NR_READ; i++) { | |
159 | pthread_mutex_init(&per_thread_lock[i].lock, NULL); | |
160 | } | |
161 | for (i = 0; i < NR_READ; i++) { | |
162 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
163 | (void *)(long)i); | |
164 | if (err != 0) | |
165 | exit(1); | |
166 | } | |
167 | for (i = 0; i < NR_WRITE; i++) { | |
168 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
169 | (void *)(long)i); | |
170 | if (err != 0) | |
171 | exit(1); | |
172 | } | |
173 | ||
174 | sleep(10); | |
175 | ||
176 | for (i = 0; i < NR_READ; i++) { | |
177 | err = pthread_join(tid_reader[i], &tret); | |
178 | if (err != 0) | |
179 | exit(1); | |
180 | tot_rtime += reader_time[i]; | |
181 | } | |
182 | for (i = 0; i < NR_WRITE; i++) { | |
183 | err = pthread_join(tid_writer[i], &tret); | |
184 | if (err != 0) | |
185 | exit(1); | |
186 | tot_wtime += writer_time[i]; | |
187 | } | |
188 | printf("Time per read : %g cycles\n", | |
189 | (double)tot_rtime / ((double)NR_READ * (double)READ_LOOP)); | |
190 | printf("Time per write : %g cycles\n", | |
191 | (double)tot_wtime / ((double)NR_WRITE * (double)WRITE_LOOP)); | |
192 | free(per_thread_lock); | |
193 | ||
2c9689fe MD |
194 | free(reader_time); |
195 | free(writer_time); | |
196 | free(tid_reader); | |
197 | free(tid_writer); | |
198 | ||
102d1d23 MD |
199 | return 0; |
200 | } |