8 * common.h: Common Linux kernel-isms.
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; but version 2 of the License only due
13 * to code included from the Linux kernel.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
24 * Copyright (c) 2006 Paul E. McKenney, IBM.
26 * Much code taken from the Linux kernel. For such code, the option
27 * to redistribute under later versions of GPL might not be available.
30 #include <urcu/arch.h>
32 #define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)]))
33 #define BUILD_BUG_ON_ZERO(e) (sizeof(char[1 - 2 * !!(e)]) - 1)
39 #define ____cacheline_internodealigned_in_smp \
40 __attribute__((__aligned__(CAA_CACHE_LINE_SIZE)))
43 * api_pthreads.h: API mapping to pthreads environment.
45 * This program is free software; you can redistribute it and/or modify
46 * it under the terms of the GNU General Public License as published by
47 * the Free Software Foundation; either version 2 of the License, or
48 * (at your option) any later version. However, please note that much
49 * of the code in this file derives from the Linux kernel, and that such
50 * code may not be available except under GPLv2.
52 * This program is distributed in the hope that it will be useful,
53 * but WITHOUT ANY WARRANTY; without even the implied warranty of
54 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
55 * GNU General Public License for more details.
57 * You should have received a copy of the GNU General Public License
58 * along with this program; if not, write to the Free Software
59 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
61 * Copyright (c) 2006 Paul E. McKenney, IBM.
68 #include <sys/types.h>
72 #include <sys/param.h>
73 /* #include "atomic.h" */
76 * Exclusive locking primitives.
79 typedef pthread_mutex_t spinlock_t
;
81 #define DEFINE_SPINLOCK(lock) spinlock_t lock = PTHREAD_MUTEX_INITIALIZER;
82 #define __SPIN_LOCK_UNLOCKED(lockp) PTHREAD_MUTEX_INITIALIZER
84 static void spin_lock_init(spinlock_t
*sp
)
86 if (pthread_mutex_init(sp
, NULL
) != 0) {
87 perror("spin_lock_init:pthread_mutex_init");
92 static void spin_lock(spinlock_t
*sp
)
94 if (pthread_mutex_lock(sp
) != 0) {
95 perror("spin_lock:pthread_mutex_lock");
100 static void spin_unlock(spinlock_t
*sp
)
102 if (pthread_mutex_unlock(sp
) != 0) {
103 perror("spin_unlock:pthread_mutex_unlock");
108 #define spin_lock_irqsave(l, f) do { f = 1; spin_lock(l); } while (0)
109 #define spin_unlock_irqrestore(l, f) do { f = 0; spin_unlock(l); } while (0)
112 * Thread creation/destruction primitives.
115 typedef pthread_t thread_id_t
;
117 #define NR_THREADS 128
119 #define __THREAD_ID_MAP_EMPTY ((thread_id_t) 0)
120 #define __THREAD_ID_MAP_WAITING ((thread_id_t) 1)
121 thread_id_t __thread_id_map
[NR_THREADS
];
122 spinlock_t __thread_id_map_mutex
;
124 #define for_each_thread(t) \
125 for (t = 0; t < NR_THREADS; t++)
127 #define for_each_running_thread(t) \
128 for (t = 0; t < NR_THREADS; t++) \
129 if ((__thread_id_map[t] != __THREAD_ID_MAP_EMPTY) && \
130 (__thread_id_map[t] != __THREAD_ID_MAP_WAITING))
132 #define for_each_tid(t, tid) \
133 for (t = 0; t < NR_THREADS; t++) \
134 if ((((tid) = __thread_id_map[t]) != __THREAD_ID_MAP_EMPTY) && \
135 ((tid) != __THREAD_ID_MAP_WAITING))
137 pthread_key_t thread_id_key
;
139 static int __smp_thread_id(void)
142 thread_id_t tid
= pthread_self();
144 for (i
= 0; i
< NR_THREADS
; i
++) {
145 if (__thread_id_map
[i
] == tid
) {
146 long v
= i
+ 1; /* must be non-NULL. */
148 if (pthread_setspecific(thread_id_key
, (void *)v
) != 0) {
149 perror("pthread_setspecific");
155 spin_lock(&__thread_id_map_mutex
);
156 for (i
= 0; i
< NR_THREADS
; i
++) {
157 if (__thread_id_map
[i
] == tid
)
158 spin_unlock(&__thread_id_map_mutex
);
161 spin_unlock(&__thread_id_map_mutex
);
162 fprintf(stderr
, "smp_thread_id: Rogue thread, id: %d(%#x)\n",
167 static int smp_thread_id(void)
171 id
= pthread_getspecific(thread_id_key
);
173 return __smp_thread_id();
174 return (long)(id
- 1);
177 static thread_id_t
create_thread(void *(*func
)(void *), void *arg
)
182 spin_lock(&__thread_id_map_mutex
);
183 for (i
= 0; i
< NR_THREADS
; i
++) {
184 if (__thread_id_map
[i
] == __THREAD_ID_MAP_EMPTY
)
187 if (i
>= NR_THREADS
) {
188 spin_unlock(&__thread_id_map_mutex
);
189 fprintf(stderr
, "Thread limit of %d exceeded!\n", NR_THREADS
);
192 __thread_id_map
[i
] = __THREAD_ID_MAP_WAITING
;
193 spin_unlock(&__thread_id_map_mutex
);
194 if (pthread_create(&tid
, NULL
, func
, arg
) != 0) {
195 perror("create_thread:pthread_create");
198 __thread_id_map
[i
] = tid
;
202 static void *wait_thread(thread_id_t tid
)
207 for (i
= 0; i
< NR_THREADS
; i
++) {
208 if (__thread_id_map
[i
] == tid
)
211 if (i
>= NR_THREADS
){
212 fprintf(stderr
, "wait_thread: bad tid = %d(%#x)\n",
216 if (pthread_join(tid
, &vp
) != 0) {
217 perror("wait_thread:pthread_join");
220 __thread_id_map
[i
] = __THREAD_ID_MAP_EMPTY
;
224 static void wait_all_threads(void)
229 for (i
= 1; i
< NR_THREADS
; i
++) {
230 tid
= __thread_id_map
[i
];
231 if (tid
!= __THREAD_ID_MAP_EMPTY
&&
232 tid
!= __THREAD_ID_MAP_WAITING
)
233 (void)wait_thread(tid
);
237 #ifndef HAVE_CPU_SET_T
238 typedef unsigned long cpu_set_t
;
239 # define CPU_ZERO(cpuset) do { *(cpuset) = 0; } while(0)
240 # define CPU_SET(cpu, cpuset) do { *(cpuset) |= (1UL << (cpu)); } while(0)
243 static void run_on(int cpu
)
245 #if HAVE_SCHED_SETAFFINITY
250 #if SCHED_SETAFFINITY_ARGS == 2
251 sched_setaffinity(0, &mask
);
253 sched_setaffinity(0, sizeof(mask
), &mask
);
255 #endif /* HAVE_SCHED_SETAFFINITY */
259 * timekeeping -- very crude -- should use MONOTONIC...
262 long long get_microseconds(void)
266 if (gettimeofday(&tv
, NULL
) != 0)
268 return ((long long)tv
.tv_sec
) * 1000000LL + (long long)tv
.tv_usec
;
272 * Per-thread variables.
275 #define DEFINE_PER_THREAD(type, name) \
278 __attribute__((__aligned__(CAA_CACHE_LINE_SIZE))); \
279 } __per_thread_##name[NR_THREADS];
280 #define DECLARE_PER_THREAD(type, name) extern DEFINE_PER_THREAD(type, name)
282 #define per_thread(name, thread) __per_thread_##name[thread].v
283 #define __get_thread_var(name) per_thread(name, smp_thread_id())
285 #define init_per_thread(name, v) \
288 for (__i_p_t_i = 0; __i_p_t_i < NR_THREADS; __i_p_t_i++) \
289 per_thread(name, __i_p_t_i) = v; \
292 DEFINE_PER_THREAD(int, smp_processor_id
);
298 #define BUG_ON(c) do { if (!(c)) abort(); } while (0)
301 * Initialization -- Must be called before calling any primitives.
304 static void smp_init(void)
308 spin_lock_init(&__thread_id_map_mutex
);
309 __thread_id_map
[0] = pthread_self();
310 for (i
= 1; i
< NR_THREADS
; i
++)
311 __thread_id_map
[i
] = __THREAD_ID_MAP_EMPTY
;
312 init_per_thread(smp_processor_id
, 0);
313 if (pthread_key_create(&thread_id_key
, NULL
) != 0) {
314 perror("pthread_key_create");