169 lines
4 KiB
C
169 lines
4 KiB
C
|
/*
|
||
|
|
* 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.,
|
||
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 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 long done = 0;
|
||
|
|
|
||
|
|
void * func(void * arg)
|
||
|
|
{
|
||
|
|
sched_yield();
|
||
|
|
|
||
|
|
InterlockedIncrement(&done);
|
||
|
|
|
||
|
|
return (void *) 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
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++)
|
||
|
|
{
|
||
|
|
while(pthread_create(&t[i], &attr, func, NULL) != 0)
|
||
|
|
Sleep(1);
|
||
|
|
}
|
||
|
|
|
||
|
|
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;
|
||
|
|
}
|