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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
|
/*
* Copyright (C) 2009-2012 Tobias Brunner
* Hochschule fuer Technik Rapperswil
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*/
#define _GNU_SOURCE
#include <pthread.h>
#include <signal.h>
#include <semaphore.h>
#ifdef HAVE_GETTID
#include <sys/types.h>
#include <unistd.h>
#endif
#ifdef HAVE_SYS_GETTID
#include <sys/syscall.h>
static inline pid_t gettid()
{
return syscall(SYS_gettid);
}
#endif
#include <library.h>
#include <utils/debug.h>
#include <threading/thread_value.h>
#include <threading/mutex.h>
#include <collections/linked_list.h>
#include "thread.h"
typedef struct private_thread_t private_thread_t;
struct private_thread_t {
/**
* Public interface.
*/
thread_t public;
/**
* Human-readable ID of this thread.
*/
u_int id;
/**
* ID of the underlying thread.
*/
pthread_t thread_id;
/**
* Main function of this thread (NULL for the main thread).
*/
thread_main_t main;
/**
* Argument for the main function.
*/
void *arg;
/**
* Stack of cleanup handlers.
*/
linked_list_t *cleanup_handlers;
/**
* Mutex to make modifying thread properties safe.
*/
mutex_t *mutex;
/**
* Semaphore used to sync the creation/start of the thread.
*/
sem_t created;
/**
* TRUE if this thread has been detached or joined, i.e. can be cleaned
* up after terminating.
*/
bool detached_or_joined;
/**
* TRUE if the threads has terminated (cancelled, via thread_exit or
* returned from the main function)
*/
bool terminated;
};
typedef struct {
/**
* Cleanup callback function.
*/
thread_cleanup_t cleanup;
/**
* Argument provided to the cleanup function.
*/
void *arg;
} cleanup_handler_t;
/**
* Next thread ID.
*/
static u_int next_id;
/**
* Mutex to safely access the next thread ID.
*/
static mutex_t *id_mutex;
/**
* Store the thread object in a thread-specific value.
*/
static thread_value_t *current_thread;
#ifndef HAVE_PTHREAD_CANCEL
/* if pthread_cancel is not available, we emulate it using a signal */
#ifdef ANDROID
#define SIG_CANCEL SIGUSR2
#else
#define SIG_CANCEL (SIGRTMIN+7)
#endif
/* the signal handler for SIG_CANCEL uses pthread_exit to terminate the
* "cancelled" thread */
static void cancel_signal_handler(int sig)
{
pthread_exit(NULL);
}
#endif
/**
* Destroy an internal thread object.
*
* @note The mutex of this thread object has to be locked, it gets unlocked
* automatically.
*/
static void thread_destroy(private_thread_t *this)
{
if (!this->terminated || !this->detached_or_joined)
{
this->mutex->unlock(this->mutex);
return;
}
this->cleanup_handlers->destroy(this->cleanup_handlers);
this->mutex->unlock(this->mutex);
this->mutex->destroy(this->mutex);
sem_destroy(&this->created);
free(this);
}
METHOD(thread_t, cancel, void,
private_thread_t *this)
{
this->mutex->lock(this->mutex);
if (pthread_equal(this->thread_id, pthread_self()))
{
this->mutex->unlock(this->mutex);
DBG1(DBG_LIB, "!!! CANNOT CANCEL CURRENT THREAD !!!");
return;
}
#ifdef HAVE_PTHREAD_CANCEL
pthread_cancel(this->thread_id);
#else
pthread_kill(this->thread_id, SIG_CANCEL);
#endif /* HAVE_PTHREAD_CANCEL */
this->mutex->unlock(this->mutex);
}
METHOD(thread_t, kill_, void,
private_thread_t *this, int sig)
{
this->mutex->lock(this->mutex);
if (pthread_equal(this->thread_id, pthread_self()))
{
/* it might actually be possible to send a signal to pthread_self (there
* is an example in raise(3) describing that), the problem is though,
* that the thread only returns here after the signal handler has
* returned, so depending on the signal, the lock might not get
* unlocked. */
this->mutex->unlock(this->mutex);
DBG1(DBG_LIB, "!!! CANNOT SEND SIGNAL TO CURRENT THREAD !!!");
return;
}
pthread_kill(this->thread_id, sig);
this->mutex->unlock(this->mutex);
}
METHOD(thread_t, detach, void,
private_thread_t *this)
{
this->mutex->lock(this->mutex);
pthread_detach(this->thread_id);
this->detached_or_joined = TRUE;
thread_destroy(this);
}
METHOD(thread_t, join, void*,
private_thread_t *this)
{
pthread_t thread_id;
void *val;
this->mutex->lock(this->mutex);
if (pthread_equal(this->thread_id, pthread_self()))
{
this->mutex->unlock(this->mutex);
DBG1(DBG_LIB, "!!! CANNOT JOIN CURRENT THREAD !!!");
return NULL;
}
if (this->detached_or_joined)
{
this->mutex->unlock(this->mutex);
DBG1(DBG_LIB, "!!! CANNOT JOIN DETACHED THREAD !!!");
return NULL;
}
thread_id = this->thread_id;
this->detached_or_joined = TRUE;
if (this->terminated)
{
/* thread has terminated before the call to join */
thread_destroy(this);
}
else
{
/* thread_destroy is called when the thread terminates normally */
this->mutex->unlock(this->mutex);
}
pthread_join(thread_id, &val);
return val;
}
/**
* Create an internal thread object.
*/
static private_thread_t *thread_create_internal()
{
private_thread_t *this;
INIT(this,
.public = {
.cancel = _cancel,
.kill = _kill_,
.detach = _detach,
.join = _join,
},
.cleanup_handlers = linked_list_create(),
.mutex = mutex_create(MUTEX_TYPE_DEFAULT),
);
sem_init(&this->created, FALSE, 0);
return this;
}
/**
* Main cleanup function for threads.
*/
static void thread_cleanup(private_thread_t *this)
{
cleanup_handler_t *handler;
this->mutex->lock(this->mutex);
while (this->cleanup_handlers->remove_last(this->cleanup_handlers,
(void**)&handler) == SUCCESS)
{
handler->cleanup(handler->arg);
free(handler);
}
this->terminated = TRUE;
thread_destroy(this);
}
/**
* Main function wrapper for threads.
*/
static void *thread_main(private_thread_t *this)
{
void *res;
sem_wait(&this->created);
current_thread->set(current_thread, this);
pthread_cleanup_push((thread_cleanup_t)thread_cleanup, this);
/* TODO: this is not 100% portable as pthread_t is an opaque type (i.e.
* could be of any size, or even a struct) */
#ifdef HAVE_GETTID
DBG2(DBG_LIB, "created thread %.2d [%u]",
this->id, gettid());
#elif defined(WIN32)
DBG2(DBG_LIB, "created thread %.2d [%p]",
this->id, this->thread_id.p);
#else
DBG2(DBG_LIB, "created thread %.2d [%lx]",
this->id, (u_long)this->thread_id);
#endif
res = this->main(this->arg);
pthread_cleanup_pop(TRUE);
return res;
}
/**
* Described in header.
*/
thread_t *thread_create(thread_main_t main, void *arg)
{
private_thread_t *this = thread_create_internal();
this->main = main;
this->arg = arg;
if (pthread_create(&this->thread_id, NULL, (void*)thread_main, this) != 0)
{
DBG1(DBG_LIB, "failed to create thread!");
this->mutex->lock(this->mutex);
thread_destroy(this);
return NULL;
}
id_mutex->lock(id_mutex);
this->id = next_id++;
id_mutex->unlock(id_mutex);
sem_post(&this->created);
return &this->public;
}
/**
* Described in header.
*/
thread_t *thread_current()
{
private_thread_t *this;
this = (private_thread_t*)current_thread->get(current_thread);
if (!this)
{
this = thread_create_internal();
id_mutex->lock(id_mutex);
this->id = next_id++;
id_mutex->unlock(id_mutex);
current_thread->set(current_thread, (void*)this);
}
return &this->public;
}
/**
* Described in header.
*/
u_int thread_current_id()
{
private_thread_t *this = (private_thread_t*)thread_current();
return this ? this->id : 0;
}
/**
* Described in header.
*/
void thread_cleanup_push(thread_cleanup_t cleanup, void *arg)
{
private_thread_t *this = (private_thread_t*)thread_current();
cleanup_handler_t *handler;
INIT(handler,
.cleanup = cleanup,
.arg = arg,
);
this->mutex->lock(this->mutex);
this->cleanup_handlers->insert_last(this->cleanup_handlers, handler);
this->mutex->unlock(this->mutex);
}
/**
* Described in header.
*/
void thread_cleanup_pop(bool execute)
{
private_thread_t *this = (private_thread_t*)thread_current();
cleanup_handler_t *handler;
this->mutex->lock(this->mutex);
if (this->cleanup_handlers->remove_last(this->cleanup_handlers,
(void**)&handler) != SUCCESS)
{
this->mutex->unlock(this->mutex);
DBG1(DBG_LIB, "!!! THREAD CLEANUP ERROR !!!");
return;
}
this->mutex->unlock(this->mutex);
if (execute)
{
handler->cleanup(handler->arg);
}
free(handler);
}
/**
* Described in header.
*/
bool thread_cancelability(bool enable)
{
#ifdef HAVE_PTHREAD_CANCEL
int old;
pthread_setcancelstate(enable ? PTHREAD_CANCEL_ENABLE
: PTHREAD_CANCEL_DISABLE, &old);
return old == PTHREAD_CANCEL_ENABLE;
#else
sigset_t new, old;
sigemptyset(&new);
sigaddset(&new, SIG_CANCEL);
pthread_sigmask(enable ? SIG_UNBLOCK : SIG_BLOCK, &new, &old);
return sigismember(&old, SIG_CANCEL) == 0;
#endif /* HAVE_PTHREAD_CANCEL */
}
/**
* Described in header.
*/
void thread_cancellation_point()
{
bool old = thread_cancelability(TRUE);
#ifdef HAVE_PTHREAD_CANCEL
pthread_testcancel();
#endif /* HAVE_PTHREAD_CANCEL */
thread_cancelability(old);
}
/**
* Described in header.
*/
void thread_exit(void *val)
{
pthread_exit(val);
}
/**
* A dummy thread value that reserved pthread_key_t value "0". A buggy PKCS#11
* library mangles this key, without owning it, so we allocate it for them.
*/
static thread_value_t *dummy1;
/**
* Described in header.
*/
void threads_init()
{
private_thread_t *main_thread = thread_create_internal();
dummy1 = thread_value_create(NULL);
next_id = 1;
main_thread->id = 0;
main_thread->thread_id = pthread_self();
current_thread = thread_value_create(NULL);
current_thread->set(current_thread, (void*)main_thread);
id_mutex = mutex_create(MUTEX_TYPE_DEFAULT);
#ifndef HAVE_PTHREAD_CANCEL
{ /* install a signal handler for our custom SIG_CANCEL */
struct sigaction action = {
.sa_handler = cancel_signal_handler
};
sigaction(SIG_CANCEL, &action, NULL);
}
#endif /* HAVE_PTHREAD_CANCEL */
}
/**
* Described in header.
*/
void threads_deinit()
{
private_thread_t *main_thread = (private_thread_t*)thread_current();
dummy1->destroy(dummy1);
main_thread->mutex->lock(main_thread->mutex);
main_thread->terminated = TRUE;
main_thread->detached_or_joined = TRUE;
thread_destroy(main_thread);
current_thread->destroy(current_thread);
id_mutex->destroy(id_mutex);
}
|