|
|
1.1 ! root 1: /*- ! 2: * Copyright (c) 1990 The Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Chris Torek. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted ! 9: * provided that: (1) source distributions retain this entire copyright ! 10: * notice and comment, and (2) distributions including binaries display ! 11: * the following acknowledgement: ``This product includes software ! 12: * developed by the University of California, Berkeley and its contributors'' ! 13: * in the documentation or other materials provided with the distribution ! 14: * and in all advertising materials mentioning features or use of this ! 15: * software. Neither the name of the University nor the names of its ! 16: * contributors may be used to endorse or promote products derived ! 17: * from this software without specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: */ ! 22: ! 23: #if defined(LIBC_SCCS) && !defined(lint) ! 24: static char sccsid[] = "@(#)atexit.c 5.1 (Berkeley) 5/15/90"; ! 25: #endif /* LIBC_SCCS and not lint */ ! 26: ! 27: #include <stddef.h> ! 28: #include <stdlib.h> ! 29: #include "atexit.h" ! 30: ! 31: /* ! 32: * Register a function to be performed at exit. ! 33: */ ! 34: int ! 35: atexit(fn) ! 36: void (*fn)(); ! 37: { ! 38: static struct atexit __atexit0; /* one guaranteed table */ ! 39: register struct atexit *p; ! 40: ! 41: if ((p = __atexit) == NULL) ! 42: __atexit = p = &__atexit0; ! 43: if (p->ind >= ATEXIT_SIZE) { ! 44: if ((p = malloc(sizeof(*p))) == NULL) ! 45: return (-1); ! 46: __atexit->next = p; ! 47: __atexit = p; ! 48: } ! 49: p->fns[p->ind++] = fn; ! 50: return (0); ! 51: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.