Simplify code and add copyright.

This commit is contained in:
pk 1994-01-06 23:39:25 +00:00
parent a3051779c5
commit e2c9704c72

View File

@ -1,43 +1,62 @@
/*
* CRT module for GNU C++ compiles shared libraries.
* Copyright (c) 1993 Paul Kranenburg
* All rights reserved.
*
* $Id: c++rt0.c,v 1.1 1994/01/05 21:05:37 pk Exp $
* 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 Paul Kranenburg.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software withough specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*
* $Id: c++rt0.c,v 1.2 1994/01/06 23:39:25 pk Exp $
*/
void (*__CTOR_LIST__[2])(void);
void (*__DTOR_LIST__[2])(void);
/*
* Run-time module for GNU C++ compiled shared libraries.
*
* The linker constructs the following arrays of pointers to global
* constructors and destructors. The first element contains the
* number of pointers in each.
* The tables are also null-terminated.
*/
void (*__CTOR_LIST__[0])(void);
void (*__DTOR_LIST__[0])(void);
/* Run all the global destructors on exit from the program. */
static void
__do_global_dtors(void)
__dtors(void)
{
unsigned long nptrs = (unsigned long) __DTOR_LIST__[0];
unsigned i;
unsigned long i = (unsigned long) __DTOR_LIST__[0];
void (**p)(void) = __DTOR_LIST__ + i;
/*
* Some systems place the number of pointers
* in the first word of the table.
* On other systems, that word is -1.
* In all cases, the table is null-terminated.
*/
/* If the length is not recorded, count up to the null. */
if (nptrs == -1)
for (nptrs = 0; __DTOR_LIST__[nptrs + 1] != 0; nptrs++);
/* GNU LD format. */
for (i = nptrs; i >= 1; i--)
__DTOR_LIST__[i] ();
while (i--)
(**p--)();
}
static void
__do_global_ctors(void)
__ctors(void)
{
void (**p)(void);
void (**p)(void) = __CTOR_LIST__ + 1;
for (p = __CTOR_LIST__ + 1; *p; )
while (*p)
(**p++)();
}
@ -48,10 +67,14 @@ __init(void)
{
static int initialized = 0;
/*
* Call global constructors.
* Arrange to call global destructors at exit.
*/
if (!initialized) {
initialized = 1;
__do_global_ctors();
atexit(__do_global_dtors);
__ctors();
atexit(__dtors);
}
}