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
|
/*
* File: reuse2.c
*
*
* --------------------------------------------------------------------------
*
* Pthreads-win32 - POSIX Threads Library for Win32
* Copyright(C) 1998 John E. Bossom
* Copyright(C) 1999,2005 Pthreads-win32 contributors
*
* Contact Email: rpj@callisto.canberra.edu.au
*
* The current list of contributors is contained
* in the file CONTRIBUTORS included with the source
* code distribution. The list can also be seen at the
* following World Wide Web location:
* http://sources.redhat.com/pthreads-win32/contributors.html
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library in the file COPYING.LIB;
* if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*
* --------------------------------------------------------------------------
*
* Test Synopsis:
* - Test that thread reuse works for detached threads.
* - Analyse thread struct reuse.
*
* Test Method (Validation or Falsification):
* -
*
* Requirements Tested:
* -
*
* Features Tested:
* -
*
* Cases Tested:
* -
*
* Description:
* -
*
* Environment:
* - This test is implementation specific
* because it uses knowledge of internals that should be
* opaque to an application.
*
* Input:
* - None.
*
* Output:
* - File name, Line number, and failed expression on failure.
* - No output on success.
*
* Assumptions:
* -
*
* Pass Criteria:
* - Process returns zero exit status.
*
* Fail Criteria:
* - Process returns non-zero exit status.
*/
#include "test.h"
/*
*/
enum {
NUMTHREADS = 10000
};
static int dummy = 19;
static long done = 0;
void * func(void * arg)
{
int i;
int j;
sched_yield();
for (i = 1; i < 10000; i++)
{
if (i * dummy % dummy == 0)
{
j = dummy;
}
}
InterlockedIncrement(&done);
return (void *) j;
}
int
main()
{
pthread_t t[NUMTHREADS];
pthread_attr_t attr;
int i;
unsigned int notUnique = 0,
totalHandles = 0,
reuseMax = 0,
reuseMin = NUMTHREADS;
assert(pthread_attr_init(&attr) == 0);
assert(pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED) == 0);
for (i = 0; i < NUMTHREADS; i++)
{
assert(pthread_create(&t[i], &attr, func, NULL) == 0);
}
while (NUMTHREADS > InterlockedExchangeAdd((LPLONG)&done, 0L))
Sleep(100);
Sleep(100);
/*
* Analyse reuse by computing min and max number of times pthread_create()
* returned the same pthread_t value.
*/
for (i = 0; i < NUMTHREADS; i++)
{
if (t[i].p != NULL)
{
unsigned int j, thisMax;
thisMax = t[i].x;
for (j = i+1; j < NUMTHREADS; j++)
if (t[i].p == t[j].p)
{
if (t[i].x == t[j].x)
notUnique++;
if (thisMax < t[j].x)
thisMax = t[j].x;
t[j].p = NULL;
}
if (reuseMin > thisMax)
reuseMin = thisMax;
if (reuseMax < thisMax)
reuseMax = thisMax;
}
}
for (i = 0; i < NUMTHREADS; i++)
if (t[i].p != NULL)
totalHandles++;
/*
* pthread_t reuse counts start at 0, so we need to add 1
* to the max and min values derived above.
*/
printf("For %d total threads:\n", NUMTHREADS);
printf("Non-unique IDs = %d\n", notUnique);
printf("Reuse maximum = %d\n", reuseMax + 1);
printf("Reuse minimum = %d\n", reuseMin + 1);
printf("Total handles = %d\n", totalHandles);
return 0;
}
|
