1bb535300SJeff Roberson /* 2df2cf821SDavid Xu * Copyright (c) 2005, David Xu <davidxu@freebsd.org> 3bb535300SJeff Roberson * All rights reserved. 4bb535300SJeff Roberson * 5bb535300SJeff Roberson * Redistribution and use in source and binary forms, with or without 6bb535300SJeff Roberson * modification, are permitted provided that the following conditions 7bb535300SJeff Roberson * are met: 8bb535300SJeff Roberson * 1. Redistributions of source code must retain the above copyright 9df2cf821SDavid Xu * notice unmodified, this list of conditions, and the following 10df2cf821SDavid Xu * disclaimer. 11bb535300SJeff Roberson * 2. Redistributions in binary form must reproduce the above copyright 12bb535300SJeff Roberson * notice, this list of conditions and the following disclaimer in the 13bb535300SJeff Roberson * documentation and/or other materials provided with the distribution. 14bb535300SJeff Roberson * 15df2cf821SDavid Xu * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16df2cf821SDavid Xu * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17df2cf821SDavid Xu * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18df2cf821SDavid Xu * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19df2cf821SDavid Xu * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20df2cf821SDavid Xu * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21df2cf821SDavid Xu * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22df2cf821SDavid Xu * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23df2cf821SDavid Xu * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24df2cf821SDavid Xu * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25bb535300SJeff Roberson * 26bb535300SJeff Roberson * $FreeBSD$ 27df2cf821SDavid Xu * 28bb535300SJeff Roberson */ 29a091d823SDavid Xu 30a091d823SDavid Xu #include "namespace.h" 31bb535300SJeff Roberson #include <pthread.h> 32a091d823SDavid Xu #include "un-namespace.h" 33a091d823SDavid Xu 34bb535300SJeff Roberson #include "thr_private.h" 35bb535300SJeff Roberson 36bb535300SJeff Roberson __weak_reference(_pthread_once, pthread_once); 37bb535300SJeff Roberson 38a091d823SDavid Xu #define ONCE_NEVER_DONE PTHREAD_NEEDS_INIT 39a091d823SDavid Xu #define ONCE_DONE PTHREAD_DONE_INIT 40a091d823SDavid Xu #define ONCE_IN_PROGRESS 0x02 411b3418b2SDavid Xu #define ONCE_WAIT 0x03 42a091d823SDavid Xu 43a091d823SDavid Xu /* 44a091d823SDavid Xu * POSIX: 45a091d823SDavid Xu * The pthread_once() function is not a cancellation point. However, 46a091d823SDavid Xu * if init_routine is a cancellation point and is canceled, the effect 47a091d823SDavid Xu * on once_control shall be as if pthread_once() was never called. 48a091d823SDavid Xu */ 49a091d823SDavid Xu 50a091d823SDavid Xu static void 51a091d823SDavid Xu once_cancel_handler(void *arg) 52a091d823SDavid Xu { 53*b684727bSKonstantin Belousov pthread_once_t *once_control; 54a091d823SDavid Xu 55*b684727bSKonstantin Belousov once_control = arg; 56*b684727bSKonstantin Belousov if (atomic_cmpset_rel_int(&once_control->state, ONCE_IN_PROGRESS, 57*b684727bSKonstantin Belousov ONCE_NEVER_DONE)) 581b3418b2SDavid Xu return; 591b3418b2SDavid Xu atomic_store_rel_int(&once_control->state, ONCE_NEVER_DONE); 601b3418b2SDavid Xu _thr_umtx_wake(&once_control->state, INT_MAX, 0); 61a091d823SDavid Xu } 62a091d823SDavid Xu 63bb535300SJeff Roberson int 64bb535300SJeff Roberson _pthread_once(pthread_once_t *once_control, void (*init_routine) (void)) 65bb535300SJeff Roberson { 665150e987SDavid Xu struct pthread *curthread; 671b3418b2SDavid Xu int state; 68a091d823SDavid Xu 69aad93b04SRyan Stone _thr_check_init(); 70aad93b04SRyan Stone 711b3418b2SDavid Xu for (;;) { 721b3418b2SDavid Xu state = once_control->state; 733e7e67c0SKonstantin Belousov if (state == ONCE_DONE) { 743e7e67c0SKonstantin Belousov atomic_thread_fence_acq(); 75a091d823SDavid Xu return (0); 763e7e67c0SKonstantin Belousov } 771b3418b2SDavid Xu if (state == ONCE_NEVER_DONE) { 78*b684727bSKonstantin Belousov if (atomic_cmpset_int(&once_control->state, state, 79*b684727bSKonstantin Belousov ONCE_IN_PROGRESS)) 801b3418b2SDavid Xu break; 811b3418b2SDavid Xu } else if (state == ONCE_IN_PROGRESS) { 82*b684727bSKonstantin Belousov if (atomic_cmpset_int(&once_control->state, state, 83*b684727bSKonstantin Belousov ONCE_WAIT)) 84*b684727bSKonstantin Belousov _thr_umtx_wait_uint(&once_control->state, 85*b684727bSKonstantin Belousov ONCE_WAIT, NULL, 0); 861b3418b2SDavid Xu } else if (state == ONCE_WAIT) { 87*b684727bSKonstantin Belousov _thr_umtx_wait_uint(&once_control->state, state, 88*b684727bSKonstantin Belousov NULL, 0); 891b3418b2SDavid Xu } else 901b3418b2SDavid Xu return (EINVAL); 911b3418b2SDavid Xu } 921b3418b2SDavid Xu 935150e987SDavid Xu curthread = _get_curthread(); 945150e987SDavid Xu THR_CLEANUP_PUSH(curthread, once_cancel_handler, once_control); 95bb535300SJeff Roberson init_routine(); 965150e987SDavid Xu THR_CLEANUP_POP(curthread, 0); 97*b684727bSKonstantin Belousov if (atomic_cmpset_rel_int(&once_control->state, ONCE_IN_PROGRESS, 98*b684727bSKonstantin Belousov ONCE_DONE)) 991b3418b2SDavid Xu return (0); 1001b3418b2SDavid Xu atomic_store_rel_int(&once_control->state, ONCE_DONE); 1011b3418b2SDavid Xu _thr_umtx_wake(&once_control->state, INT_MAX, 0); 102bb535300SJeff Roberson return (0); 103bb535300SJeff Roberson } 104a091d823SDavid Xu 1056f716c2fSDavid Xu void 106*b684727bSKonstantin Belousov _thr_once_init(void) 1076f716c2fSDavid Xu { 1086f716c2fSDavid Xu } 109