1 /* 2 * Copyright (c) 1995 John Birrell <jb@cimlogic.com.au>. 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 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by John Birrell. 16 * 4. Neither the name of the author nor the names of any co-contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY JOHN BIRRELL AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * $FreeBSD$ 33 */ 34 35 #include <signal.h> 36 #include <errno.h> 37 #include <stdlib.h> 38 #include <pthread.h> 39 40 #include "thr_private.h" 41 42 __weak_reference(_pthread_cleanup_push, pthread_cleanup_push); 43 __weak_reference(_pthread_cleanup_pop, pthread_cleanup_pop); 44 45 void 46 _pthread_cleanup_push(void (*routine) (void *), void *routine_arg) 47 { 48 struct pthread *curthread = _get_curthread(); 49 struct pthread_cleanup *new; 50 51 if ((new = (struct pthread_cleanup *) 52 malloc(sizeof(struct pthread_cleanup))) != NULL) { 53 new->routine = routine; 54 new->routine_arg = routine_arg; 55 new->onstack = 0; 56 new->next = curthread->cleanup; 57 58 curthread->cleanup = new; 59 } 60 } 61 62 void 63 _pthread_cleanup_pop(int execute) 64 { 65 struct pthread *curthread = _get_curthread(); 66 struct pthread_cleanup *old; 67 68 if ((old = curthread->cleanup) != NULL) { 69 curthread->cleanup = old->next; 70 if (execute) { 71 old->routine(old->routine_arg); 72 } 73 if (old->onstack == 0) 74 free(old); 75 } 76 } 77