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
|
// Shave and a Haircut
// (c) 2019 Epic Games
// US Patent 6720962
#ifdef _WIN32
#include <windows.h>
#include <process.h>
#else
#include <pthread.h>
#include <stdlib.h>
#endif
#include "shaveSDKFUNCS.h"
typedef struct
{
enum
{
kWaiting,
kWorkAvailable,
kRunning,
kExit
} state;
unsigned index;
ThreadFunc func;
void *data;
ShaveMutex *mutex;
ShaveCond *completionCond;
ShaveCond stateCond;
#ifdef _WIN32
HANDLE id;
#else
pthread_t id;
#endif
} ThreadInfo;
typedef struct
{
ShaveMutex mutex;
int numThreads;
ThreadInfo *threads;
ShaveCond completionCond;
} ThreadGroup;
#ifdef _WIN32
static unsigned __stdcall
threadProc( void *data )
#else
static void *
threadProc( void *data )
#endif
{
ThreadInfo *info = ( ThreadInfo * ) data;
SHAVEmutex_lock( info->mutex );
while( info->state != kExit )
{
while( info->state == kWaiting )
SHAVEcond_wait( &info->stateCond, info->mutex );
if( info->state == kWorkAvailable )
{
info->state = kRunning;
SHAVEmutex_unlock( info->mutex );
( info->func ) ( info->index, info->data );
SHAVEmutex_lock( info->mutex );
info->state = kWaiting;
SHAVEcond_signal( info->completionCond );
}
}
SHAVEmutex_unlock( info->mutex );
return 0;
}
void *
SHAVEstart_thread_group( int maxThreads )
{
//
// Create the thread group.
//
int i;
int st;
ThreadGroup *group = ( ThreadGroup * ) malloc( sizeof( ThreadGroup ) );
if( group )
{
if( maxThreads <= 0 )
{
group->numThreads = 0;
group->threads = NULL;
}
else
{
group->numThreads = maxThreads;
group->threads = ( ThreadInfo * ) malloc( sizeof( ThreadInfo ) * maxThreads );
if( !group->threads )
{
free( group );
group = NULL;
}
else
{
#ifdef _WIN32
unsigned threadID;
#endif
SHAVEmutex_create( &group->mutex );
SHAVEcond_create( &group->completionCond );
//
// Create the individual threads within the group.
//
for( i = 0; i < maxThreads; i++ )
{
group->threads[i].index = ( unsigned ) i;
group->threads[i].state = kWaiting;
group->threads[i].mutex = &group->mutex;
group->threads[i].completionCond = &group->completionCond;
SHAVEcond_create( &group->threads[i].stateCond );
#ifdef _WIN32
group->threads[i].id = ( HANDLE ) _beginthreadex( NULL, 0, threadProc, &group->threads[i], 0, &threadID );
st = ( group->threads[i].id == 0 );
#else
st = pthread_create( &group->threads[i].id, NULL, threadProc, &group->threads[i] );
#endif
if( st != 0 )
{
if( i > 0 )
{
group->numThreads = i;
SHAVEend_thread_group( group );
}
group = NULL;
break;
}
}
}
}
}
return group;
}
void
SHAVEstart_thread( void *groupHdl, ThreadFunc func, void *data )
{
ThreadGroup *group = ( ThreadGroup * ) groupHdl;
if( group->numThreads == 0 )
func( 0, data );
else
{
int i;
int threadStarted = 0;
SHAVEmutex_lock( &group->mutex );
while( !threadStarted )
{
//
// Loop through each of the threads, looking for one which is ready
// to do work.
//
for( i = 0; i < group->numThreads; i++ )
{
if( group->threads[i].state == kWaiting )
{
group->threads[i].func = func;
group->threads[i].data = data;
group->threads[i].state = kWorkAvailable;
SHAVEcond_signal( &group->threads[i].stateCond );
threadStarted = 1;
break;
}
}
//
// If none of the threads was ready for work, then wait for one of
// them to signal that it's done with its current task.
//
if( !threadStarted )
SHAVEcond_wait( &group->completionCond, &group->mutex );
}
SHAVEmutex_unlock( &group->mutex );
}
}
void
SHAVEwait_thread_group( void *groupHdl )
{
ThreadGroup *group = ( ThreadGroup * ) groupHdl;
if( group->numThreads > 0 )
{
int i;
SHAVEmutex_lock( &group->mutex );
for( i = 0; i < group->numThreads; i++ )
{
//
// Wait for the thread to finish whatever it's doing.
//
while( group->threads[i].state != kWaiting )
SHAVEcond_wait( &group->completionCond, &group->mutex );
}
SHAVEmutex_unlock( &group->mutex );
}
}
void
SHAVEend_thread_group( void *groupHdl )
{
ThreadGroup *group = ( ThreadGroup * ) groupHdl;
if( group->numThreads > 0 )
{
int i;
SHAVEmutex_lock( &group->mutex );
for( i = 0; i < group->numThreads; i++ )
{
//
// Wait for the thread to finish whatever it's doing.
//
while( group->threads[i].state != kWaiting )
SHAVEcond_wait( &group->completionCond, &group->mutex );
//
// Tell the thread to exit.
//
group->threads[i].state = kExit;
SHAVEcond_signal( &group->threads[i].stateCond );
//
// Wait for it to finish exiting.
//
SHAVEmutex_unlock( &group->mutex );
#ifdef _WIN32
WaitForSingleObject( group->threads[i].id, INFINITE );
CloseHandle( group->threads[i].id );
#else
pthread_join( group->threads[i].id, NULL );
#endif
SHAVEmutex_lock( &group->mutex );
SHAVEcond_destroy( &group->threads[i].stateCond );
}
SHAVEmutex_unlock( &group->mutex );
SHAVEmutex_destroy( &group->mutex );
SHAVEcond_destroy( &group->completionCond );
free( group->threads );
}
free( group );
}
void
SHAVEabort_thread_group( void *groupHdl )
{
#ifdef _WIN32
//
// Windows does not provide any way of aborting a thread, so we must
// wait for all the threads to finish.
//
SHAVEend_thread_group( groupHdl );
#else
ThreadGroup *group = ( ThreadGroup * ) groupHdl;
if( group->numThreads > 0 )
{
int i;
for( i = 0; i < group->numThreads; i++ )
{
//
// Cancel the thread.
//
pthread_cancel( group->threads[i].id );
//
// Wait for it to finish exiting.
//
pthread_join( group->threads[i].id, NULL );
SHAVEcond_destroy( &group->threads[i].stateCond );
}
SHAVEcond_destroy( &group->completionCond );
SHAVEmutex_destroy( &group->mutex );
free( group->threads );
}
free( group );
#endif
}
int
SHAVEnum_processors( )
{
#if defined(linux)
int n = sysconf( _SC_NPROCESSORS_ONLN );
if( n < 1 )
n = 1;
return n;
#elif defined(OSMac_)
return MPProcessors( );
#elif defined(_WIN32)
SYSTEM_INFO info;
GetSystemInfo( &info );
return info.dwNumberOfProcessors;
#endif
return 1;
}
void
SHAVEset_max_threads( int n )
{
if( n > SHAVE_MAX_THREADS )
GmaxThreads = SHAVE_MAX_THREADS;
else
GmaxThreads = n;
}
//
// Initialize a mutex.
//
void
SHAVEmutex_create( ShaveMutex * mutex )
{
#ifndef NOLIB
#ifdef _WIN32
*mutex = CreateMutex( NULL, FALSE, NULL );
#else
pthread_mutex_init( mutex, NULL );
#endif
#endif
}
//
// Free up any resources used by a mutex.
//
void
SHAVEmutex_destroy( ShaveMutex * mutex )
{
#ifndef NOLIB
#ifdef _WIN32
CloseHandle( *mutex );
#else
pthread_mutex_destroy( mutex );
#endif
#endif
}
//
// Lock a mutex. If it's currently locked by someone else, wait
// for it to come free first.
//
void
SHAVEmutex_lock( ShaveMutex * mutex )
{
#ifndef NOLIB
#ifdef _WIN32
WaitForSingleObject( *mutex, INFINITE );
#else
pthread_mutex_lock( mutex );
#endif
#endif
}
//
// Unlock a mutex.
//
void
SHAVEmutex_unlock( ShaveMutex * mutex )
{
#ifndef NOLIB
#ifdef _WIN32
ReleaseMutex( *mutex );
#else
pthread_mutex_unlock( mutex );
#endif
#endif
}
//
// Create a condition variable.
//
void
SHAVEcond_create( ShaveCond * cond )
{
#ifndef NOLIB
#ifdef _WIN32
*cond = CreateEvent( NULL, FALSE, FALSE, NULL );
#else
pthread_cond_init( cond, NULL );
#endif
#endif
}
//
// Destroy a condition variable.
//
void
SHAVEcond_destroy( ShaveCond * cond )
{
#ifndef NOLIB
#ifdef _WIN32
CloseHandle( *cond );
#else
pthread_cond_destroy( cond );
#endif
#endif
}
//
// Signal the condition. If there are threads waiting on it one (and only
// one) will be activated.
//
void
SHAVEcond_signal( ShaveCond * cond )
{
#ifndef NOLIB
#ifdef _WIN32
SetEvent( *cond );
#else
pthread_cond_signal( cond );
#endif
#endif
}
//
// Wait for the condition to be signalled.
//
void
SHAVEcond_wait( ShaveCond * cond, ShaveMutex * mutex )
{
#ifndef NOLIB
#ifdef _WIN32
SignalObjectAndWait( *mutex, *cond, INFINITE, FALSE );
#else
pthread_cond_wait( cond, mutex );
#endif
#endif
}
|