github/amiga-clib2
1
0
Fork 0
mirror of https://github.com/adtools/clib2.git synced 2026-05-09 06:35:02 +00:00
Code Releases Wiki Activity

Initial import into SourceForge CVS

Browse Source 
git-svn-id: file:///Users/olsen/Code/migration-svn-zu-git/logical-line-staging/clib2/trunk@14685 87f5fb63-7c3d-0410-a384-fd976d0f7a62
This commit is contained in:
Olaf Barthel
2004-07-26 16:36:55 +00:00
parent a9e8f137ad
commit 91bcdea2a2
669 changed files with 80825 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

117
library/stdlib_stack_usage.c Normal file
View File

@@ -0,0 +1,117 @@
/*
* $Id: stdlib_stack_usage.c,v 1.1.1.1 2004-07-26 16:32:07 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.
*/
#include "stdlib_headers.h"
/****************************************************************************/
#include "macros.h"
/****************************************************************************/
#ifndef NDEBUG
static struct StackSwapStruct stack_swap_struct;
#endif /* NDEBUG */
/****************************************************************************/
#define STACK_FILL_COOKIE 0xA1
/****************************************************************************/
void
__stack_usage_init(struct StackSwapStruct * UNUSED stk)
{
#ifndef NDEBUG
{
if(stk != NULL)
{
size_t stack_size = ((ULONG)stk->stk_Upper - (ULONG)stk->stk_Lower);
memset(stk->stk_Lower,STACK_FILL_COOKIE,stack_size);
stack_swap_struct = (*stk);
}
}
#endif /* NDEBUG */
}
/****************************************************************************/
void
__stack_usage_exit(void)
{
#ifndef NDEBUG
{
if(stack_swap_struct.stk_Lower != NULL && stack_swap_struct.stk_Upper != 0)
{
const UBYTE * m = (const UBYTE *)stack_swap_struct.stk_Lower;
size_t stack_size = ((ULONG)stack_swap_struct.stk_Upper - (ULONG)stack_swap_struct.stk_Lower);
size_t total,i;
total = 0;
/* Figure out how much of the stack was used by checking
if the fill pattern was overwritten. */
for(i = 0 ; i < stack_size ; i++)
{
/* Strangely, the first long word is always trashed,
even if the stack doesn't grow down this far... */
if(i > sizeof(LONG) && m[i] != STACK_FILL_COOKIE)
break;
total++;
}
kprintf("[%s] total amount of stack space used = %ld bytes\n",
__program_name,stack_size - total);
stack_swap_struct.stk_Lower = NULL;
stack_swap_struct.stk_Upper = 0;
}
if(__stk_maxsize == 0)
{
kprintf("[%s] no stack extension was performed\n",
__program_name);
}
else
{
kprintf("[%s] maximum size of extended stack = %ld bytes, stack was extended %ld times\n",
__program_name,__stk_maxsize,__stk_extensions);
}
}
#endif /* NDEBUG */
}