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
|
/* Copyright (C) 2001-2020 Artifex Software, Inc.
All Rights Reserved.
This software is provided AS-IS with no warranty, either express or
implied.
This software is distributed under license and may not be copied,
modified or distributed except as expressly authorized under the terms
of the license contained in the file LICENSE in this distribution.
Refer to licensing information at http://www.artifex.com or contact
Artifex Software, Inc., 1305 Grant Avenue - Suite 200, Novato,
CA 94945, U.S.A., +1(415)492-9861, for further information.
*/
/* POSIX pthreads threads / semaphore / monitor implementation */
#include "std.h"
#include "string_.h"
#include "malloc_.h"
#include "unistd_.h" /* for __USE_UNIX98 */
#include <pthread.h>
#include "gserrors.h"
#include "gpsync.h"
#include "assert_.h"
/*
* Thanks to Larry Jones <larry.jones@sdrc.com> for this revision of
* Aladdin's original code into a form that depends only on POSIX APIs.
*/
/*
* Some old versions of the pthreads library define
* pthread_attr_setdetachstate as taking a Boolean rather than an enum.
* Compensate for this here.
*/
#ifndef PTHREAD_CREATE_DETACHED
# define PTHREAD_CREATE_DETACHED 1
#endif
/* ------- Synchronization primitives -------- */
/* Semaphore supports wait/signal semantics */
typedef struct pt_semaphore_t {
int count;
pthread_mutex_t mutex;
pthread_cond_t cond;
} pt_semaphore_t;
uint
gp_semaphore_sizeof(void)
{
return sizeof(pt_semaphore_t);
}
/*
* This procedure should really check errno and return something
* more informative....
*/
#define SEM_ERROR_CODE(scode)\
(scode != 0 ? gs_note_error(gs_error_ioerror) : 0)
int
gp_semaphore_open(gp_semaphore * sema)
{
pt_semaphore_t * const sem = (pt_semaphore_t *)sema;
int scode;
#ifdef MEMENTO
if (Memento_squeezing()) {
/* If squeezing, we nobble all the locking functions to do nothing.
* We also ensure we never actually create threads (elsewhere),
* so this is still safe. */
memset(&sem->mutex, 0, sizeof(sem->mutex));
memset(&sem->cond, 0, sizeof(sem->cond));
return 0;
}
#endif
if (!sema)
return -1; /* semaphores are not movable */
sem->count = 0;
scode = pthread_mutex_init(&sem->mutex, NULL);
if (scode == 0)
{
scode = pthread_cond_init(&sem->cond, NULL);
if (scode)
pthread_mutex_destroy(&sem->mutex);
}
if (scode)
memset(sem, 0, sizeof(*sem));
return SEM_ERROR_CODE(scode);
}
int
gp_semaphore_close(gp_semaphore * sema)
{
pt_semaphore_t * const sem = (pt_semaphore_t *)sema;
int scode, scode2;
#ifdef MEMENTO
if (Memento_squeezing())
return 0;
#endif
scode = pthread_cond_destroy(&sem->cond);
scode2 = pthread_mutex_destroy(&sem->mutex);
if (scode == 0)
scode = scode2;
return SEM_ERROR_CODE(scode);
}
int
gp_semaphore_wait(gp_semaphore * sema)
{
pt_semaphore_t * const sem = (pt_semaphore_t *)sema;
int scode, scode2;
#ifdef MEMENTO
if (Memento_squeezing()) {
/* If squeezing, we nobble all the locking functions to do nothing.
* We also ensure we never actually create threads (elsewhere),
* so this is still safe. */
return 0;
}
#endif
scode = pthread_mutex_lock(&sem->mutex);
if (scode != 0)
return SEM_ERROR_CODE(scode);
while (sem->count == 0) {
scode = pthread_cond_wait(&sem->cond, &sem->mutex);
if (scode != 0)
break;
}
if (scode == 0)
--sem->count;
scode2 = pthread_mutex_unlock(&sem->mutex);
if (scode == 0)
scode = scode2;
return SEM_ERROR_CODE(scode);
}
int
gp_semaphore_signal(gp_semaphore * sema)
{
pt_semaphore_t * const sem = (pt_semaphore_t *)sema;
int scode, scode2;
#ifdef MEMENTO
if (Memento_squeezing())
return 0;
#endif
scode = pthread_mutex_lock(&sem->mutex);
if (scode != 0)
return SEM_ERROR_CODE(scode);
if (sem->count++ == 0)
scode = pthread_cond_signal(&sem->cond);
scode2 = pthread_mutex_unlock(&sem->mutex);
if (scode == 0)
scode = scode2;
return SEM_ERROR_CODE(scode);
}
/* Monitor supports enter/leave semantics */
/*
* We need PTHREAD_MUTEX_RECURSIVE behavior, but this isn't
* supported on all pthread platforms, so if it's available
* we'll use it, otherwise we'll emulate it.
* GS_RECURSIVE_MUTEXATTR is set by the configure script
* on Unix-like machines to the attribute setting for
* PTHREAD_MUTEX_RECURSIVE - on linux this is usually
* PTHREAD_MUTEX_RECURSIVE_NP
*/
typedef struct gp_pthread_recursive_s {
pthread_mutex_t mutex; /* actual mutex */
#ifndef GS_RECURSIVE_MUTEXATTR
pthread_t self_id; /* owner */
int lcount;
#endif
} gp_pthread_recursive_t;
uint
gp_monitor_sizeof(void)
{
return sizeof(gp_pthread_recursive_t);
}
int
gp_monitor_open(gp_monitor * mona)
{
pthread_mutex_t *mon;
int scode;
pthread_mutexattr_t attr;
pthread_mutexattr_t *attrp = NULL;
if (!mona)
return -1; /* monitors are not movable */
#ifdef MEMENTO
if (Memento_squeezing()) {
memset(mona, 0, sizeof(*mona));
return 0;
}
#endif
#ifdef GS_RECURSIVE_MUTEXATTR
attrp = &attr;
scode = pthread_mutexattr_init(attrp);
if (scode < 0) goto done;
scode = pthread_mutexattr_settype(attrp, GS_RECURSIVE_MUTEXATTR);
if (scode < 0) {
goto done;
}
#else
((gp_pthread_recursive_t *)mona)->self_id = 0; /* Not valid unless mutex is locked */
((gp_pthread_recursive_t *)mona)->lcount = 0;
#endif
mon = &((gp_pthread_recursive_t *)mona)->mutex;
scode = pthread_mutex_init(mon, attrp);
if (attrp)
(void)pthread_mutexattr_destroy(attrp);
done:
return SEM_ERROR_CODE(scode);
}
int
gp_monitor_close(gp_monitor * mona)
{
pthread_mutex_t * const mon = &((gp_pthread_recursive_t *)mona)->mutex;
int scode;
#ifdef MEMENTO
if (Memento_squeezing())
return 0;
#endif
scode = pthread_mutex_destroy(mon);
return SEM_ERROR_CODE(scode);
}
int
gp_monitor_enter(gp_monitor * mona)
{
pthread_mutex_t * const mon = (pthread_mutex_t *)mona;
int scode;
#ifdef MEMENTO
if (Memento_squeezing()) {
return 0;
}
#endif
#ifdef GS_RECURSIVE_MUTEXATTR
scode = pthread_mutex_lock(mon);
#else
assert(((gp_pthread_recursive_t *)mona)->lcount >= 0);
if ((scode = pthread_mutex_trylock(mon)) == 0) {
((gp_pthread_recursive_t *)mona)->self_id = pthread_self();
((gp_pthread_recursive_t *)mona)->lcount++;
} else {
if (pthread_equal(pthread_self(),((gp_pthread_recursive_t *)mona)->self_id)) {
((gp_pthread_recursive_t *)mona)->lcount++;
scode = 0;
}
else {
/* we were not the owner, wait */
scode = pthread_mutex_lock(mon);
((gp_pthread_recursive_t *)mona)->self_id = pthread_self();
((gp_pthread_recursive_t *)mona)->lcount++;
}
}
#endif
return SEM_ERROR_CODE(scode);
}
int
gp_monitor_leave(gp_monitor * mona)
{
pthread_mutex_t * const mon = (pthread_mutex_t *)mona;
int scode = 0;
#ifdef MEMENTO
if (Memento_squeezing())
return 0;
#endif
#ifdef GS_RECURSIVE_MUTEXATTR
scode = pthread_mutex_unlock(mon);
#else
assert(((gp_pthread_recursive_t *)mona)->lcount > 0 && ((gp_pthread_recursive_t *)mona)->self_id != 0);
if (pthread_equal(pthread_self(),((gp_pthread_recursive_t *)mona)->self_id)) {
if ((--((gp_pthread_recursive_t *)mona)->lcount) == 0) {
((gp_pthread_recursive_t *)mona)->self_id = 0; /* Not valid unless mutex is locked */
scode = pthread_mutex_unlock(mon);
}
}
else {
scode = -1 /* should be EPERM */;
}
#endif
return SEM_ERROR_CODE(scode);
}
/* --------- Thread primitives ---------- */
/*
* In order to deal with the type mismatch between our thread API, where
* the starting procedure returns void, and the API defined by pthreads,
* where the procedure returns void *, we need to create a wrapper
* closure.
*/
typedef struct gp_thread_creation_closure_s {
gp_thread_creation_callback_t proc; /* actual start procedure */
void *proc_data; /* closure data for proc */
} gp_thread_creation_closure_t;
/* Wrapper procedure called to start the new thread. */
static void *
gp_thread_begin_wrapper(void *thread_data /* gp_thread_creation_closure_t * */)
{
gp_thread_creation_closure_t closure;
closure = *(gp_thread_creation_closure_t *)thread_data;
free(thread_data);
DISCARD(closure.proc(closure.proc_data));
return NULL; /* return value is ignored */
}
int
gp_create_thread(gp_thread_creation_callback_t proc, void *proc_data)
{
gp_thread_creation_closure_t *closure;
pthread_t ignore_thread;
pthread_attr_t attr;
int code;
#ifdef MEMENTO
if (Memento_squeezing()) {
eprintf("Can't create threads when memory squeezing with forks\n");
Memento_bt();
return_error(gs_error_VMerror);
}
#endif
closure = (gp_thread_creation_closure_t *)malloc(sizeof(*closure));
if (!closure)
return_error(gs_error_VMerror);
closure->proc = proc;
closure->proc_data = proc_data;
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
code = pthread_create(&ignore_thread, &attr, gp_thread_begin_wrapper,
closure);
if (code) {
free(closure);
return_error(gs_error_ioerror);
}
return 0;
}
int
gp_thread_start(gp_thread_creation_callback_t proc, void *proc_data,
gp_thread_id *thread)
{
gp_thread_creation_closure_t *closure =
(gp_thread_creation_closure_t *)malloc(sizeof(*closure));
pthread_t new_thread;
pthread_attr_t attr;
int code;
if (!closure)
return_error(gs_error_VMerror);
closure->proc = proc;
closure->proc_data = proc_data;
pthread_attr_init(&attr);
pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);
code = pthread_create(&new_thread, &attr, gp_thread_begin_wrapper,
closure);
if (code) {
*thread = NULL;
free(closure);
return_error(gs_error_ioerror);
}
*thread = (gp_thread_id)new_thread;
return 0;
}
void gp_thread_finish(gp_thread_id thread)
{
if (thread == NULL)
return;
pthread_join((pthread_t)thread, NULL);
}
void (gp_monitor_label)(gp_monitor * mona, const char *name)
{
pthread_mutex_t * const mon = &((gp_pthread_recursive_t *)mona)->mutex;
(void)mon;
(void)name;
Bobbin_label_mutex(mon, name);
}
void (gp_semaphore_label)(gp_semaphore * sema, const char *name)
{
pt_semaphore_t * const sem = (pt_semaphore_t *)sema;
(void)sem;
(void)name;
Bobbin_label_mutex(&sem->mutex, name);
Bobbin_label_cond(&sem->cond, name);
}
void (gp_thread_label)(gp_thread_id thread, const char *name)
{
(void)thread;
(void)name;
Bobbin_label_thread((pthread_t)thread, name);
}
|