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