|
|
@ -1,46 +1,43 @@ |
|
|
|
/*- |
|
|
|
* Copyright (c) 1990 The Regents of the University of California. |
|
|
|
/* |
|
|
|
* Copyright (c) 2002 Daniel Hartmeier |
|
|
|
* All rights reserved. |
|
|
|
* |
|
|
|
* This code is derived from software contributed to Berkeley by |
|
|
|
* Chris Torek. |
|
|
|
* |
|
|
|
* Redistribution and use in source and binary forms, with or without |
|
|
|
* modification, are permitted provided that the following conditions |
|
|
|
* are met: |
|
|
|
* 1. Redistributions of source code must retain the above copyright |
|
|
|
* notice, this list of conditions and the following disclaimer. |
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
|
|
|
* notice, this list of conditions and the following disclaimer in the |
|
|
|
* documentation and/or other materials provided with the distribution. |
|
|
|
* 3. All advertising materials mentioning features or use of this software |
|
|
|
* must display the following acknowledgement: |
|
|
|
* This product includes software developed by the University of |
|
|
|
* California, Berkeley and its contributors. |
|
|
|
* 4. Neither the name of the University nor the names of its contributors |
|
|
|
* may be used to endorse or promote products derived from this software |
|
|
|
* without specific prior written permission. |
|
|
|
* |
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
|
|
|
* SUCH DAMAGE. |
|
|
|
* - Redistributions of source code must retain the above copyright |
|
|
|
* notice, this list of conditions and the following disclaimer. |
|
|
|
* - Redistributions in binary form must reproduce the above |
|
|
|
* copyright notice, this list of conditions and the following |
|
|
|
* disclaimer in the documentation and/or other materials provided |
|
|
|
* with the distribution. |
|
|
|
* |
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
|
|
|
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
|
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
|
|
* POSSIBILITY OF SUCH DAMAGE. |
|
|
|
* |
|
|
|
*/ |
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint) |
|
|
|
static char *rcsid = "$OpenBSD: atexit.c,v 1.4 2002/07/31 18:13:16 dhartmei Exp $"; |
|
|
|
static char *rcsid = "$OpenBSD: atexit.c,v 1.5 2002/08/30 07:58:07 dhartmei Exp $"; |
|
|
|
#endif /* LIBC_SCCS and not lint */ |
|
|
|
|
|
|
|
#include <sys/types.h> |
|
|
|
#include <sys/mman.h> |
|
|
|
#include <stdlib.h> |
|
|
|
#include "atexit.h" |
|
|
|
|
|
|
|
int __atexit_invalid = 1; |
|
|
|
struct atexit *__atexit; |
|
|
|
|
|
|
|
/* |
|
|
@ -50,18 +47,37 @@ int |
|
|
|
atexit(fn) |
|
|
|
void (*fn)(); |
|
|
|
{ |
|
|
|
static struct atexit __atexit0; /* one guaranteed table */ |
|
|
|
register struct atexit *p; |
|
|
|
register struct atexit *p = __atexit; |
|
|
|
register int pgsize = getpagesize(); |
|
|
|
|
|
|
|
if ((p = __atexit) == NULL) |
|
|
|
__atexit = p = &__atexit0; |
|
|
|
else if (p->ind >= ATEXIT_SIZE) { |
|
|
|
if ((p = malloc(sizeof(*p))) == NULL) |
|
|
|
if (pgsize < sizeof(*p)) |
|
|
|
return (-1); |
|
|
|
if (p != NULL) { |
|
|
|
if (p->ind + 1 >= p->max) |
|
|
|
p = NULL; |
|
|
|
else if (mprotect(p, pgsize, PROT_READ | PROT_WRITE)) |
|
|
|
return (-1); |
|
|
|
} |
|
|
|
if (p == NULL) { |
|
|
|
if (__atexit_invalid) { |
|
|
|
/* malloc.c wants the first mmap() for sbrk() |
|
|
|
games ('nice hack'), so enforce |
|
|
|
malloc_init() with a dummy call. */ |
|
|
|
free(malloc(1)); |
|
|
|
__atexit_invalid = 0; |
|
|
|
} |
|
|
|
p = mmap(NULL, pgsize, PROT_READ | PROT_WRITE, |
|
|
|
MAP_ANON | MAP_PRIVATE, -1, 0); |
|
|
|
if (p == MAP_FAILED) |
|
|
|
return (-1); |
|
|
|
p->ind = 0; |
|
|
|
p->max = (pgsize - ((char *)&p->fns[0] - (char *)p)) / |
|
|
|
sizeof(p->fns[0]); |
|
|
|
p->next = __atexit; |
|
|
|
__atexit = p; |
|
|
|
} |
|
|
|
p->fns[p->ind++] = fn; |
|
|
|
if (mprotect(p, pgsize, PROT_READ)) |
|
|
|
return (-1); |
|
|
|
return (0); |
|
|
|
} |