Commit | Line | Data |
---|---|---|
102d1d23 MD |
1 | /* |
2 | * test_perthreadloc_timing.c | |
3 | * | |
4 | * Per thread locks - test program | |
5 | * | |
6 | * Copyright February 2009 - Mathieu Desnoyers <mathieu.desnoyers@polymtl.ca> | |
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> | |
32 | #include <sys/syscall.h> | |
33 | #include <pthread.h> | |
94b343fd | 34 | #include <errno.h> |
833dbdb6 | 35 | |
ec4e58a3 | 36 | #include <urcu/arch.h> |
102d1d23 MD |
37 | |
38 | #if defined(_syscall0) | |
39 | _syscall0(pid_t, gettid) | |
40 | #elif defined(__NR_gettid) | |
41 | static inline pid_t gettid(void) | |
42 | { | |
43 | return syscall(__NR_gettid); | |
44 | } | |
45 | #else | |
46 | #warning "use pid as tid" | |
47 | static inline pid_t gettid(void) | |
48 | { | |
49 | return getpid(); | |
50 | } | |
51 | #endif | |
52 | ||
ec4e58a3 | 53 | #include <urcu.h> |
102d1d23 MD |
54 | |
55 | struct test_array { | |
56 | int a; | |
57 | }; | |
58 | ||
59 | static struct test_array test_array = { 8 }; | |
60 | ||
61 | struct per_thread_lock { | |
62 | pthread_mutex_t lock; | |
b430c6d4 | 63 | } __attribute__((aligned(CACHE_LINE_SIZE))); /* cache-line aligned */ |
102d1d23 MD |
64 | |
65 | static struct per_thread_lock *per_thread_lock; | |
66 | ||
67 | #define OUTER_READ_LOOP 200U | |
68 | #define INNER_READ_LOOP 100000U | |
69 | #define READ_LOOP ((unsigned long long)OUTER_READ_LOOP * INNER_READ_LOOP) | |
70 | ||
71 | #define OUTER_WRITE_LOOP 10U | |
72 | #define INNER_WRITE_LOOP 200U | |
73 | #define WRITE_LOOP ((unsigned long long)OUTER_WRITE_LOOP * INNER_WRITE_LOOP) | |
74 | ||
2c9689fe MD |
75 | static int num_read; |
76 | static int num_write; | |
102d1d23 | 77 | |
2c9689fe MD |
78 | #define NR_READ num_read |
79 | #define NR_WRITE num_write | |
80 | ||
b430c6d4 MD |
81 | static cycles_t __attribute__((aligned(CACHE_LINE_SIZE))) *reader_time; |
82 | static cycles_t __attribute__((aligned(CACHE_LINE_SIZE))) *writer_time; | |
102d1d23 MD |
83 | |
84 | void *thr_reader(void *arg) | |
85 | { | |
86 | int i, j; | |
87 | cycles_t time1, time2; | |
88 | long tidx = (long)arg; | |
89 | ||
90 | printf("thread_begin %s, thread id : %lx, tid %lu\n", | |
91 | "reader", pthread_self(), (unsigned long)gettid()); | |
92 | sleep(2); | |
93 | ||
94 | time1 = get_cycles(); | |
95 | for (i = 0; i < OUTER_READ_LOOP; i++) { | |
96 | for (j = 0; j < INNER_READ_LOOP; j++) { | |
97 | pthread_mutex_lock(&per_thread_lock[tidx].lock); | |
98 | assert(test_array.a == 8); | |
99 | pthread_mutex_unlock(&per_thread_lock[tidx].lock); | |
100 | } | |
101 | } | |
102 | time2 = get_cycles(); | |
103 | ||
104 | reader_time[tidx] = time2 - time1; | |
105 | ||
106 | sleep(2); | |
107 | printf("thread_end %s, thread id : %lx, tid %lu\n", | |
108 | "reader", pthread_self(), (unsigned long)gettid()); | |
109 | return ((void*)1); | |
110 | ||
111 | } | |
112 | ||
113 | void *thr_writer(void *arg) | |
114 | { | |
115 | int i, j; | |
116 | long tidx; | |
117 | cycles_t time1, time2; | |
118 | ||
119 | printf("thread_begin %s, thread id : %lx, tid %lu\n", | |
120 | "writer", pthread_self(), (unsigned long)gettid()); | |
121 | sleep(2); | |
122 | ||
123 | for (i = 0; i < OUTER_WRITE_LOOP; i++) { | |
124 | for (j = 0; j < INNER_WRITE_LOOP; j++) { | |
125 | time1 = get_cycles(); | |
126 | for (tidx = 0; tidx < NR_READ; tidx++) { | |
127 | pthread_mutex_lock(&per_thread_lock[tidx].lock); | |
128 | } | |
129 | test_array.a = 8; | |
130 | for (tidx = NR_READ - 1; tidx >= 0; tidx--) { | |
131 | pthread_mutex_unlock(&per_thread_lock[tidx].lock); | |
132 | } | |
133 | time2 = get_cycles(); | |
134 | writer_time[(unsigned long)arg] += time2 - time1; | |
fc606a74 | 135 | usleep(1); |
102d1d23 | 136 | } |
102d1d23 MD |
137 | } |
138 | ||
139 | printf("thread_end %s, thread id : %lx, tid %lu\n", | |
140 | "writer", pthread_self(), (unsigned long)gettid()); | |
141 | return ((void*)2); | |
142 | } | |
143 | ||
2c9689fe | 144 | int main(int argc, char **argv) |
102d1d23 MD |
145 | { |
146 | int err; | |
2c9689fe | 147 | pthread_t *tid_reader, *tid_writer; |
102d1d23 MD |
148 | void *tret; |
149 | int i; | |
150 | cycles_t tot_rtime = 0; | |
151 | cycles_t tot_wtime = 0; | |
152 | ||
2c9689fe MD |
153 | if (argc < 2) { |
154 | printf("Usage : %s nr_readers nr_writers\n", argv[0]); | |
155 | exit(-1); | |
156 | } | |
157 | num_read = atoi(argv[1]); | |
158 | num_write = atoi(argv[2]); | |
159 | ||
160 | reader_time = malloc(sizeof(*reader_time) * num_read); | |
161 | writer_time = malloc(sizeof(*writer_time) * num_write); | |
162 | tid_reader = malloc(sizeof(*tid_reader) * num_read); | |
163 | tid_writer = malloc(sizeof(*tid_writer) * num_write); | |
164 | ||
102d1d23 MD |
165 | printf("thread %-6s, thread id : %lx, tid %lu\n", |
166 | "main", pthread_self(), (unsigned long)gettid()); | |
167 | ||
168 | per_thread_lock = malloc(sizeof(struct per_thread_lock) * NR_READ); | |
169 | ||
170 | for (i = 0; i < NR_READ; i++) { | |
171 | pthread_mutex_init(&per_thread_lock[i].lock, NULL); | |
172 | } | |
173 | for (i = 0; i < NR_READ; i++) { | |
174 | err = pthread_create(&tid_reader[i], NULL, thr_reader, | |
175 | (void *)(long)i); | |
176 | if (err != 0) | |
177 | exit(1); | |
178 | } | |
179 | for (i = 0; i < NR_WRITE; i++) { | |
180 | err = pthread_create(&tid_writer[i], NULL, thr_writer, | |
181 | (void *)(long)i); | |
182 | if (err != 0) | |
183 | exit(1); | |
184 | } | |
185 | ||
186 | sleep(10); | |
187 | ||
188 | for (i = 0; i < NR_READ; i++) { | |
189 | err = pthread_join(tid_reader[i], &tret); | |
190 | if (err != 0) | |
191 | exit(1); | |
192 | tot_rtime += reader_time[i]; | |
193 | } | |
194 | for (i = 0; i < NR_WRITE; i++) { | |
195 | err = pthread_join(tid_writer[i], &tret); | |
196 | if (err != 0) | |
197 | exit(1); | |
198 | tot_wtime += writer_time[i]; | |
199 | } | |
200 | printf("Time per read : %g cycles\n", | |
201 | (double)tot_rtime / ((double)NR_READ * (double)READ_LOOP)); | |
202 | printf("Time per write : %g cycles\n", | |
203 | (double)tot_wtime / ((double)NR_WRITE * (double)WRITE_LOOP)); | |
204 | free(per_thread_lock); | |
205 | ||
2c9689fe MD |
206 | free(reader_time); |
207 | free(writer_time); | |
208 | free(tid_reader); | |
209 | free(tid_writer); | |
210 | ||
102d1d23 MD |
211 | return 0; |
212 | } |