|  | /* | 
|  | * barrier6.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 | 
|  | * | 
|  | * -------------------------------------------------------------------------- | 
|  | * | 
|  | * Destroy the barrier after initial count threads are released then let | 
|  | * additional threads attempt to wait on it. | 
|  | * | 
|  | */ | 
|  |  | 
|  | #include "test.h" | 
|  |  | 
|  | enum { | 
|  | NUMTHREADS = 31 | 
|  | }; | 
|  |  | 
|  | pthread_barrier_t barrier = NULL; | 
|  | pthread_mutex_t mx = PTHREAD_MUTEX_INITIALIZER; | 
|  | static int serialThreadCount = 0; | 
|  | static int otherThreadCount = 0; | 
|  |  | 
|  | void * | 
|  | func(void * arg) | 
|  | { | 
|  | int result = pthread_barrier_wait(&barrier); | 
|  |  | 
|  | assert(pthread_mutex_lock(&mx) == 0); | 
|  |  | 
|  | if (result == PTHREAD_BARRIER_SERIAL_THREAD) | 
|  | { | 
|  | serialThreadCount++; | 
|  | } | 
|  | else if (0 == result) | 
|  | { | 
|  | otherThreadCount++; | 
|  | } | 
|  | assert(pthread_mutex_unlock(&mx) == 0); | 
|  |  | 
|  | return NULL; | 
|  | } | 
|  |  | 
|  | int | 
|  | main() | 
|  | { | 
|  | int i, j, k; | 
|  | pthread_t t[NUMTHREADS + 1]; | 
|  |  | 
|  | for (j = 1; j <= NUMTHREADS; j++) | 
|  | { | 
|  | int howHigh = j/2 + 1; | 
|  |  | 
|  | printf("Barrier height = %d, Total threads %d\n", howHigh, j); | 
|  |  | 
|  | serialThreadCount = 0; | 
|  | otherThreadCount = 0; | 
|  |  | 
|  | assert(pthread_barrier_init(&barrier, NULL, howHigh) == 0); | 
|  |  | 
|  | for (i = 1; i <= j; i++) | 
|  | { | 
|  | assert(pthread_create(&t[i], NULL, func, NULL) == 0); | 
|  |  | 
|  | if (i == howHigh) | 
|  | { | 
|  | for (k = 1; k <= howHigh; k++) | 
|  | { | 
|  | assert(pthread_join(t[k], NULL) == 0); | 
|  | } | 
|  | assert(pthread_barrier_destroy(&barrier) == 0); | 
|  | } | 
|  | } | 
|  |  | 
|  | for (i = howHigh+1; i <= j; i++) | 
|  | { | 
|  | assert(pthread_join(t[i], NULL) == 0); | 
|  | } | 
|  |  | 
|  | assert(serialThreadCount == 1); | 
|  | assert(otherThreadCount == (howHigh - 1)); | 
|  |  | 
|  | assert(pthread_barrier_destroy(&barrier) == EINVAL); | 
|  | } | 
|  |  | 
|  | assert(pthread_mutex_destroy(&mx) == 0); | 
|  |  | 
|  | return 0; | 
|  | } |