mirror of
https://github.com/adtools/clib2.git
synced 2025-12-08 14:59:05 +00:00
git-svn-id: file:///Users/olsen/Code/migration-svn-zu-git/logical-line-staging/clib2/trunk@14685 87f5fb63-7c3d-0410-a384-fd976d0f7a62
256 lines
6.5 KiB
C
256 lines
6.5 KiB
C
/*
|
|
* $Id: stdlib_constructor_begin.c,v 1.1.1.1 2004-07-26 16:31:52 obarthel Exp $
|
|
*
|
|
* :ts=4
|
|
*
|
|
* Portable ISO 'C' (1994) runtime library for the Amiga computer
|
|
* Copyright (c) 2002-2004 by Olaf Barthel <olsen@sourcery.han.de>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* - Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* - Neither the name of Olaf Barthel nor the names of contributors
|
|
* may be used to endorse or promote products derived from this
|
|
* software without specific prior written permission.
|
|
*
|
|
* 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 OWNER 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.
|
|
*/
|
|
|
|
#ifndef _STDLIB_HEADERS_H
|
|
#include "stdlib_headers.h"
|
|
#endif /* _STDLIB_HEADERS_H */
|
|
|
|
/****************************************************************************/
|
|
|
|
#include <stdlib.h>
|
|
#include <setjmp.h>
|
|
|
|
/****************************************************************************/
|
|
|
|
#if defined(__amigaos4__)
|
|
|
|
/****************************************************************************/
|
|
|
|
/*
|
|
* Dummy constructor and destructor array. The linker script will put these at the
|
|
* very beginning of section ".ctors" and ".dtors". crtend.o contains a similar entry
|
|
* with a NULL pointer entry and is put at the end of the sections. This way, the init
|
|
* code can find the global constructor/destructor pointers
|
|
*/
|
|
static void (*__CTOR_LIST__[1]) (void) __attribute__((section(".ctors"))) = { (void *)-1 };
|
|
static void (*__DTOR_LIST__[1]) (void) __attribute__((section(".dtors"))) = { (void *)-1 };
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_ctors(void)
|
|
{
|
|
void (**pFuncPtr)(void);
|
|
|
|
/* Skip the first entry in the list (it's -1 anyway) */
|
|
pFuncPtr = __CTOR_LIST__ + 1;
|
|
|
|
/* Call all constructors in forward order */
|
|
while (*pFuncPtr != NULL)
|
|
(**pFuncPtr++)();
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_dtors(void)
|
|
{
|
|
static ULONG i = ~0UL;
|
|
void (**pFuncPtr)(void);
|
|
|
|
if(i == ~0UL)
|
|
{
|
|
ULONG j = (ULONG)__DTOR_LIST__[0];
|
|
|
|
if(j == ~0UL)
|
|
{
|
|
/* Find the end of the destructors list. */
|
|
j = 1;
|
|
|
|
while(__DTOR_LIST__[j] != NULL)
|
|
j++;
|
|
|
|
/* We're at the NULL entry now. Go back by one. */
|
|
j--;
|
|
}
|
|
|
|
i = j;
|
|
}
|
|
|
|
/* If one of the destructors drops into
|
|
* exit(), processing will continue with
|
|
* the next following destructor.
|
|
*/
|
|
(void)setjmp(__exit_jmp_buf);
|
|
|
|
/* Call all destructors in reverse order. */
|
|
pFuncPtr = &__DTOR_LIST__[i];
|
|
while(i > 0)
|
|
{
|
|
i--;
|
|
|
|
(**pFuncPtr--)();
|
|
}
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
#elif defined(__SASC)
|
|
|
|
/****************************************************************************/
|
|
|
|
extern int (* __far __ctors[])(void);
|
|
extern void (* __far __dtors[])(void);
|
|
|
|
/****************************************************************************/
|
|
|
|
/* With SAS/C this function is placed in front of the first constructor
|
|
* table entry. It will invoke all following constructors and
|
|
* finally all the destructors. We don't use this approach here.
|
|
*/
|
|
void
|
|
__construct(void)
|
|
{
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_ctors(void)
|
|
{
|
|
void * volatile p = &__ctors;
|
|
|
|
/* The address is NULL if no constructor functions are to be used. */
|
|
if(p != NULL)
|
|
{
|
|
int i;
|
|
|
|
for(i = 0 ; __ctors[i] != NULL ; i++)
|
|
{
|
|
if((*__ctors[i])() != 0)
|
|
exit(RETURN_FAIL);
|
|
}
|
|
}
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_dtors(void)
|
|
{
|
|
void * volatile p = &__dtors;
|
|
|
|
/* The address is NULL if no destructor functions are to be used. */
|
|
if(p != NULL)
|
|
{
|
|
static int i;
|
|
|
|
/* If one of the destructors drops into
|
|
* exit(), processing will continue with
|
|
* the next following destructor.
|
|
*/
|
|
(void)setjmp(__exit_jmp_buf);
|
|
|
|
while(__dtors[i] != NULL)
|
|
{
|
|
/* Increment this before jumping in, so that the next
|
|
* invocation will always pick up the destructor following
|
|
* the one we will invoke rigt now.
|
|
*/
|
|
i++;
|
|
|
|
(*__dtors[i-1])();
|
|
}
|
|
}
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
#else
|
|
|
|
/****************************************************************************/
|
|
|
|
typedef void (*func_ptr)(void);
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_ctors(void)
|
|
{
|
|
extern func_ptr __CTOR_LIST__[];
|
|
ULONG nptrs = (ULONG)__CTOR_LIST__[0];
|
|
ULONG i;
|
|
|
|
/* Call all constructors in forward order */
|
|
for(i = 0 ; i < nptrs ; i++)
|
|
__CTOR_LIST__[1+i]();
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
static void
|
|
_do_dtors(void)
|
|
{
|
|
extern func_ptr __DTOR_LIST__[];
|
|
extern jmp_buf __exit_jmp_buf;
|
|
ULONG nptrs = (ULONG)__DTOR_LIST__[0];
|
|
static ULONG i;
|
|
|
|
/* If one of the destructors drops into
|
|
* exit(), processing will continue with
|
|
* the next following destructor.
|
|
*/
|
|
(void)setjmp(__exit_jmp_buf);
|
|
|
|
/* Call all destructors in reverse order */
|
|
while(i++ < nptrs)
|
|
__DTOR_LIST__[1+nptrs - i]();
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
#endif /*__amigaos4__ */
|
|
|
|
/****************************************************************************/
|
|
|
|
/* FIXME: Do we need to put these in .init/.fini sections? */
|
|
|
|
//void _init(void) __attribute__((section(".init")));
|
|
//void _fini(void) __attribute__((section(".fini")));
|
|
|
|
/****************************************************************************/
|
|
|
|
void
|
|
_init(void)
|
|
{
|
|
_do_ctors();
|
|
}
|
|
|
|
/****************************************************************************/
|
|
|
|
void
|
|
_fini(void)
|
|
{
|
|
_do_dtors();
|
|
}
|