5
* --------------------------------------------------------------------------
7
* Pthreads-win32 - POSIX Threads Library for Win32
8
* Copyright(C) 1998 John E. Bossom
9
* Copyright(C) 1999,2005 Pthreads-win32 contributors
11
* Contact Email: rpj@callisto.canberra.edu.au
13
* The current list of contributors is contained
14
* in the file CONTRIBUTORS included with the source
15
* code distribution. The list can also be seen at the
16
* following World Wide Web location:
17
* http://sources.redhat.com/pthreads-win32/contributors.html
19
* This library is free software; you can redistribute it and/or
20
* modify it under the terms of the GNU Lesser General Public
21
* License as published by the Free Software Foundation; either
22
* version 2 of the License, or (at your option) any later version.
24
* This library is distributed in the hope that it will be useful,
25
* but WITHOUT ANY WARRANTY; without even the implied warranty of
26
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
27
* Lesser General Public License for more details.
29
* You should have received a copy of the GNU Lesser General Public
30
* License along with this library in the file COPYING.LIB;
31
* if not, write to the Free Software Foundation, Inc.,
32
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
34
* --------------------------------------------------------------------------
36
* Create several pthread_once objects and channel several threads
37
* through each. Make the init_routine cancelable and cancel them
40
* Depends on API functions:
43
* pthread_testcancel()
50
#define NUM_THREADS 100 /* Targeting each once control */
53
pthread_once_t o = PTHREAD_ONCE_INIT;
54
pthread_once_t once[NUM_ONCE];
61
static sharedInt_t numOnce = {0, {0}};
62
static sharedInt_t numThreads = {0, {0}};
67
EnterCriticalSection(&numOnce.cs);
69
LeaveCriticalSection(&numOnce.cs);
70
/* Simulate slow once routine so that following threads pile up behind it */
72
/* test for cancelation late so we're sure to have waiters. */
80
* Cancel every thread. These threads are deferred cancelable only, so
81
* only the thread performing the init_routine will see it (there are
82
* no other cancelation points here). The result will be that every thread
83
* eventually cancels only when it becomes the new initter.
85
pthread_cancel(pthread_self());
86
assert(pthread_once(&once[(int) arg], myfunc) == 0);
87
EnterCriticalSection(&numThreads.cs);
89
LeaveCriticalSection(&numThreads.cs);
96
pthread_t t[NUM_THREADS][NUM_ONCE];
99
InitializeCriticalSection(&numThreads.cs);
100
InitializeCriticalSection(&numOnce.cs);
102
for (j = 0; j < NUM_ONCE; j++)
106
for (i = 0; i < NUM_THREADS; i++)
108
assert(pthread_create(&t[i][j], NULL, mythread, (void *) j) == 0);
112
for (j = 0; j < NUM_ONCE; j++)
113
for (i = 0; i < NUM_THREADS; i++)
114
if (pthread_join(t[i][j], NULL) != 0)
115
printf("Join failed for [thread,once] = [%d,%d]\n", i, j);
118
* All threads will cancel, none will return normally from
119
* pthread_once and so numThreads should never be incremented. However,
120
* numOnce should be incremented by every thread (NUM_THREADS*NUM_ONCE).
122
assert(numOnce.i == NUM_ONCE * NUM_THREADS);
123
assert(numThreads.i == 0);
125
DeleteCriticalSection(&numOnce.cs);
126
DeleteCriticalSection(&numThreads.cs);