123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170 |
- #include "test.h"
- #include "implement.h"
- enum
- {
- NUMTHREADS = 100
- };
- static int done = 0;
- static void * func(void * arg)
- {
- sched_yield();
- PTE_ATOMIC_INCREMENT(&done);
- return (void *) 0;
- }
- int pthread_test_reuse2()
- {
- 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 > PTE_ATOMIC_EXCHANGE_ADD(&done, 0L))
- pte_osThreadSleep(100);
- pte_osThreadSleep(100);
-
- 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++;
-
- return 0;
- }
|