1*71b3fa15SDavid Xu /*- 2*71b3fa15SDavid Xu * Copyright (c) 2003 David Xu <davidxu@freebsd.org> 3*71b3fa15SDavid Xu * All rights reserved. 4*71b3fa15SDavid Xu * 5*71b3fa15SDavid Xu * Redistribution and use in source and binary forms, with or without 6*71b3fa15SDavid Xu * modification, are permitted provided that the following conditions 7*71b3fa15SDavid Xu * are met: 8*71b3fa15SDavid Xu * 1. Redistributions of source code must retain the above copyright 9*71b3fa15SDavid Xu * notice, this list of conditions and the following disclaimer. 10*71b3fa15SDavid Xu * 2. Redistributions in binary form must reproduce the above copyright 11*71b3fa15SDavid Xu * notice, this list of conditions and the following disclaimer in the 12*71b3fa15SDavid Xu * documentation and/or other materials provided with the distribution. 13*71b3fa15SDavid Xu * 14*71b3fa15SDavid Xu * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15*71b3fa15SDavid Xu * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16*71b3fa15SDavid Xu * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17*71b3fa15SDavid Xu * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18*71b3fa15SDavid Xu * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19*71b3fa15SDavid Xu * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20*71b3fa15SDavid Xu * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21*71b3fa15SDavid Xu * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22*71b3fa15SDavid Xu * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23*71b3fa15SDavid Xu * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24*71b3fa15SDavid Xu * SUCH DAMAGE. 25*71b3fa15SDavid Xu * 26*71b3fa15SDavid Xu * $FreeBSD: src/lib/libpthread/thread/thr_barrier.c,v 1.1 2003/09/04 14:06:43 davidxu Exp $ 27*71b3fa15SDavid Xu * $DragonFly: src/lib/libthread_xu/thread/thr_barrier.c,v 1.1 2005/02/01 12:38:27 davidxu Exp $ 28*71b3fa15SDavid Xu */ 29*71b3fa15SDavid Xu 30*71b3fa15SDavid Xu #include <errno.h> 31*71b3fa15SDavid Xu #include <stdlib.h> 32*71b3fa15SDavid Xu #include <pthread.h> 33*71b3fa15SDavid Xu 34*71b3fa15SDavid Xu #include "thr_private.h" 35*71b3fa15SDavid Xu 36*71b3fa15SDavid Xu __weak_reference(_pthread_barrier_init, pthread_barrier_init); 37*71b3fa15SDavid Xu __weak_reference(_pthread_barrier_wait, pthread_barrier_wait); 38*71b3fa15SDavid Xu __weak_reference(_pthread_barrier_destroy, pthread_barrier_destroy); 39*71b3fa15SDavid Xu 40*71b3fa15SDavid Xu int 41*71b3fa15SDavid Xu _pthread_barrier_destroy(pthread_barrier_t *barrier) 42*71b3fa15SDavid Xu { 43*71b3fa15SDavid Xu pthread_barrier_t bar; 44*71b3fa15SDavid Xu 45*71b3fa15SDavid Xu if (barrier == NULL || *barrier == NULL) 46*71b3fa15SDavid Xu return (EINVAL); 47*71b3fa15SDavid Xu 48*71b3fa15SDavid Xu bar = *barrier; 49*71b3fa15SDavid Xu if (bar->b_waiters > 0) 50*71b3fa15SDavid Xu return (EBUSY); 51*71b3fa15SDavid Xu *barrier = NULL; 52*71b3fa15SDavid Xu free(bar); 53*71b3fa15SDavid Xu return (0); 54*71b3fa15SDavid Xu } 55*71b3fa15SDavid Xu 56*71b3fa15SDavid Xu int 57*71b3fa15SDavid Xu _pthread_barrier_init(pthread_barrier_t *barrier, 58*71b3fa15SDavid Xu const pthread_barrierattr_t *attr, int count) 59*71b3fa15SDavid Xu { 60*71b3fa15SDavid Xu pthread_barrier_t bar; 61*71b3fa15SDavid Xu 62*71b3fa15SDavid Xu if (barrier == NULL || count <= 0) 63*71b3fa15SDavid Xu return (EINVAL); 64*71b3fa15SDavid Xu 65*71b3fa15SDavid Xu bar = malloc(sizeof(struct pthread_barrier)); 66*71b3fa15SDavid Xu if (bar == NULL) 67*71b3fa15SDavid Xu return (ENOMEM); 68*71b3fa15SDavid Xu 69*71b3fa15SDavid Xu _thr_umtx_init(&bar->b_lock); 70*71b3fa15SDavid Xu bar->b_cycle = 0; 71*71b3fa15SDavid Xu bar->b_waiters = 0; 72*71b3fa15SDavid Xu bar->b_count = count; 73*71b3fa15SDavid Xu *barrier = bar; 74*71b3fa15SDavid Xu 75*71b3fa15SDavid Xu return (0); 76*71b3fa15SDavid Xu } 77*71b3fa15SDavid Xu 78*71b3fa15SDavid Xu int 79*71b3fa15SDavid Xu _pthread_barrier_wait(pthread_barrier_t *barrier) 80*71b3fa15SDavid Xu { 81*71b3fa15SDavid Xu struct pthread *curthread = _get_curthread(); 82*71b3fa15SDavid Xu pthread_barrier_t bar; 83*71b3fa15SDavid Xu long cycle; 84*71b3fa15SDavid Xu int ret; 85*71b3fa15SDavid Xu 86*71b3fa15SDavid Xu if (barrier == NULL || *barrier == NULL) 87*71b3fa15SDavid Xu return (EINVAL); 88*71b3fa15SDavid Xu 89*71b3fa15SDavid Xu bar = *barrier; 90*71b3fa15SDavid Xu THR_UMTX_LOCK(curthread, &bar->b_lock); 91*71b3fa15SDavid Xu if (++bar->b_waiters == bar->b_count) { 92*71b3fa15SDavid Xu /* Current thread is lastest thread */ 93*71b3fa15SDavid Xu bar->b_waiters = 0; 94*71b3fa15SDavid Xu bar->b_cycle++; 95*71b3fa15SDavid Xu _thr_umtx_wake(&bar->b_cycle, INT_MAX); 96*71b3fa15SDavid Xu THR_UMTX_UNLOCK(curthread, &bar->b_lock); 97*71b3fa15SDavid Xu ret = PTHREAD_BARRIER_SERIAL_THREAD; 98*71b3fa15SDavid Xu } else { 99*71b3fa15SDavid Xu cycle = bar->b_cycle; 100*71b3fa15SDavid Xu THR_UMTX_UNLOCK(curthread, &bar->b_lock); 101*71b3fa15SDavid Xu do { 102*71b3fa15SDavid Xu _thr_umtx_wait(&bar->b_cycle, cycle, NULL); 103*71b3fa15SDavid Xu /* test cycle to avoid bogus wakeup */ 104*71b3fa15SDavid Xu } while (cycle == bar->b_cycle); 105*71b3fa15SDavid Xu ret = 0; 106*71b3fa15SDavid Xu } 107*71b3fa15SDavid Xu return (ret); 108*71b3fa15SDavid Xu } 109