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