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