2007-12-30 17:41:49 +01:00
|
|
|
/***************************************************************************
|
|
|
|
|
2009-08-17 12:41:51 +02:00
|
|
|
gbx_stack.c
|
2007-12-30 17:41:49 +01:00
|
|
|
|
2011-12-31 03:39:20 +01:00
|
|
|
(c) 2000-2012 Benoît Minisini <gambas@users.sourceforge.net>
|
2007-12-30 17:41:49 +01:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
2009-08-17 12:41:51 +02:00
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
2007-12-30 17:41:49 +01:00
|
|
|
any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
2011-06-03 02:51:09 +02:00
|
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
|
2011-12-31 03:39:20 +01:00
|
|
|
MA 02110-1301, USA.
|
2007-12-30 17:41:49 +01:00
|
|
|
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
#define __GBX_STACK_C
|
|
|
|
|
2009-08-01 17:13:50 +02:00
|
|
|
#include <sys/resource.h>
|
2012-03-06 02:50:41 +01:00
|
|
|
#include <sys/mman.h>
|
2009-08-01 17:13:50 +02:00
|
|
|
|
2007-12-30 17:41:49 +01:00
|
|
|
#include "gb_common.h"
|
|
|
|
#include "gb_error.h"
|
|
|
|
#include "gb_alloc.h"
|
|
|
|
#include "gbx_exec.h"
|
|
|
|
#include "gb_error.h"
|
|
|
|
#include "gbx_string.h"
|
|
|
|
#include "gbx_stack.h"
|
|
|
|
|
2008-01-17 22:39:26 +01:00
|
|
|
char *STACK_base = NULL;
|
2012-03-06 02:50:41 +01:00
|
|
|
size_t STACK_size;
|
2008-01-17 22:39:26 +01:00
|
|
|
char *STACK_limit = NULL;
|
|
|
|
STACK_CONTEXT *STACK_frame;
|
|
|
|
int STACK_frame_count;
|
2007-12-30 17:41:49 +01:00
|
|
|
|
2010-06-13 14:03:29 +02:00
|
|
|
uintptr_t STACK_process_stack_limit;
|
2009-08-01 17:13:50 +02:00
|
|
|
|
2008-01-17 22:39:26 +01:00
|
|
|
void STACK_init(void)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
2009-08-01 17:13:50 +02:00
|
|
|
int stack;
|
|
|
|
struct rlimit limit;
|
|
|
|
uintptr_t max;
|
|
|
|
|
|
|
|
// Get the maximum stack size allowed
|
|
|
|
if (getrlimit(RLIMIT_STACK, &limit))
|
|
|
|
ERROR_panic("Cannot get stack size limit");
|
|
|
|
|
|
|
|
if (limit.rlim_cur == RLIM_INFINITY)
|
2012-03-06 02:50:41 +01:00
|
|
|
max = 64 << 20; // 64 Mb if there is no limit.
|
2009-08-01 17:13:50 +02:00
|
|
|
else
|
|
|
|
max = (uintptr_t)limit.rlim_cur;
|
|
|
|
|
2013-01-01 12:55:40 +01:00
|
|
|
STACK_size = max - sizeof(VALUE) * 256; // some security
|
|
|
|
#if DEBUG_STACK
|
|
|
|
fprintf(stderr, "STACK_size = %ld\n", STACK_size);
|
|
|
|
#endif
|
|
|
|
|
2012-07-30 19:54:28 +02:00
|
|
|
STACK_base = mmap(NULL, STACK_size, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, -1, 0);
|
|
|
|
|
2012-03-06 02:50:41 +01:00
|
|
|
//fprintf(stderr, "Stack = %p %ld\n", STACK_base, STACK_size);
|
|
|
|
|
2013-01-01 12:55:40 +01:00
|
|
|
STACK_process_stack_limit = (uintptr_t)&stack - max + 65536;
|
2009-08-01 17:13:50 +02:00
|
|
|
|
2007-12-30 17:41:49 +01:00
|
|
|
STACK_limit = (STACK_base + STACK_size);
|
|
|
|
STACK_frame = (STACK_CONTEXT *)STACK_limit;
|
|
|
|
STACK_frame_count = 0;
|
|
|
|
|
|
|
|
SP = (VALUE *)STACK_base;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-01-17 22:39:26 +01:00
|
|
|
void STACK_exit(void)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
|
|
|
if (STACK_base)
|
2012-03-06 02:50:41 +01:00
|
|
|
{
|
|
|
|
munmap(STACK_base, STACK_size);
|
|
|
|
STACK_base = NULL;
|
|
|
|
}
|
2007-12-30 17:41:49 +01:00
|
|
|
}
|
|
|
|
|
2008-03-20 00:50:34 +01:00
|
|
|
#if DEBUG_STACK
|
2009-05-27 20:42:48 +02:00
|
|
|
bool STACK_check(int need)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
|
|
|
static VALUE *old = NULL;
|
|
|
|
|
2013-01-01 12:55:40 +01:00
|
|
|
fprintf(stderr, "STACK_check: SP = %d need = %d limit = %d\n", (int)(((char *)SP - STACK_base) / sizeof(VALUE)), need, (int)((STACK_limit - STACK_base) / sizeof(VALUE)));
|
|
|
|
|
2007-12-30 17:41:49 +01:00
|
|
|
if (SP > old)
|
|
|
|
{
|
2013-01-01 12:55:40 +01:00
|
|
|
fprintf(stderr, "**** STACK_check: -> %ld bytes\n", ((char *)SP - STACK_base));
|
2007-12-30 17:41:49 +01:00
|
|
|
old = SP;
|
|
|
|
}
|
2009-05-27 20:42:48 +02:00
|
|
|
|
2013-01-01 12:55:40 +01:00
|
|
|
if (((char *)(SP + need) + sizeof(STACK_CONTEXT)) >= STACK_limit)
|
2009-05-27 20:42:48 +02:00
|
|
|
{
|
2012-03-08 02:41:23 +01:00
|
|
|
THROW_STACK();
|
2009-05-27 20:42:48 +02:00
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return FALSE;
|
2007-12-30 17:41:49 +01:00
|
|
|
}
|
2008-03-20 00:50:34 +01:00
|
|
|
#endif
|
2007-12-30 17:41:49 +01:00
|
|
|
|
2010-06-13 14:03:29 +02:00
|
|
|
#if 0
|
2008-10-31 00:32:38 +01:00
|
|
|
void STACK_push_frame(STACK_CONTEXT *context, int need)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
2009-08-01 17:13:50 +02:00
|
|
|
int stack;
|
|
|
|
//fprintf(stderr, "current_stack = %u -> %u / %u\n", current_stack, _process_stack_base - current_stack, _process_stack_max);
|
|
|
|
|
|
|
|
if ((uintptr_t)&stack < _process_stack_limit)
|
|
|
|
THROW(E_STACK);
|
|
|
|
|
2008-10-31 00:32:38 +01:00
|
|
|
if ((char *)(SP + need + 8 + sizeof(STACK_CONTEXT)) >= STACK_limit)
|
2009-05-27 20:42:48 +02:00
|
|
|
{
|
|
|
|
//fprintf(stderr, "**** STACK_GROW: STACK_push_frame\n");
|
|
|
|
//THROW(E_STACK);
|
|
|
|
STACK_grow();
|
|
|
|
}
|
2008-10-31 00:32:38 +01:00
|
|
|
|
|
|
|
//if (((char *)SP + sizeof(STACK_CONTEXT) * 2) >= (char *)STACK_frame)
|
|
|
|
// THROW(E_STACK);
|
2007-12-30 17:41:49 +01:00
|
|
|
|
|
|
|
STACK_frame--;
|
2008-03-19 15:32:30 +01:00
|
|
|
|
|
|
|
//*STACK_frame = *context;
|
|
|
|
STACK_copy(STACK_frame, context);
|
|
|
|
|
2007-12-30 17:41:49 +01:00
|
|
|
STACK_frame_count++;
|
|
|
|
STACK_limit = (char *)STACK_frame;
|
|
|
|
|
|
|
|
//fprintf(stderr, "STACK_push_frame: [%d] PC = %p FP = %p (%s)\n", STACK_frame_count, context->pc, context->fp,
|
|
|
|
// context->fp ? (context->fp->debug ? context->fp->debug->name : 0) : 0);
|
|
|
|
}
|
|
|
|
|
2008-01-17 22:39:26 +01:00
|
|
|
void STACK_pop_frame(STACK_CONTEXT *context)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
|
|
|
if (STACK_frame_count <= 0)
|
|
|
|
ERROR_panic("STACK_pop_frame: Stack frame is void");
|
|
|
|
|
2008-03-19 15:32:30 +01:00
|
|
|
//*context = *STACK_frame;
|
|
|
|
STACK_copy(context, STACK_frame);
|
|
|
|
|
2007-12-30 17:41:49 +01:00
|
|
|
STACK_frame++;
|
|
|
|
STACK_frame_count--;
|
|
|
|
STACK_limit = (char *)STACK_frame;
|
|
|
|
|
|
|
|
//fprintf(stderr, "STACK_pop_frame: [%d] PC = %p FP = %p (%s)\n", STACK_frame_count, context->pc, context->fp,
|
|
|
|
// context->fp ? (context->fp->debug ? context->fp->debug->name : 0) : 0);
|
|
|
|
}
|
2010-06-13 14:03:29 +02:00
|
|
|
#endif
|
2007-12-30 17:41:49 +01:00
|
|
|
|
2009-07-08 21:57:50 +02:00
|
|
|
bool STACK_has_error_handler(void)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < STACK_frame_count; i++)
|
|
|
|
if (STACK_frame[i].ec != NULL)
|
|
|
|
return TRUE;
|
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
2008-01-17 22:39:26 +01:00
|
|
|
STACK_CONTEXT *STACK_get_frame(int frame)
|
2007-12-30 17:41:49 +01:00
|
|
|
{
|
|
|
|
if (frame >= 0 && frame < STACK_frame_count)
|
|
|
|
return &STACK_frame[frame];
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
2009-05-27 20:42:48 +02:00
|
|
|
|
2011-08-31 04:28:48 +02:00
|
|
|
STACK_BACKTRACE *STACK_get_backtrace(void)
|
|
|
|
{
|
|
|
|
STACK_BACKTRACE *bt, *pbt;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (STACK_frame_count == 0)
|
|
|
|
return NULL;
|
|
|
|
|
2013-03-30 00:33:01 +01:00
|
|
|
ALLOC(&bt, sizeof(STACK_BACKTRACE) * (1 + STACK_frame_count));
|
2011-08-31 04:28:48 +02:00
|
|
|
|
|
|
|
bt->cp = CP;
|
|
|
|
bt->fp = FP;
|
|
|
|
bt->pc = PC;
|
|
|
|
|
|
|
|
for (i = 0, pbt = &bt[1]; i < STACK_frame_count; i++, pbt++)
|
|
|
|
{
|
|
|
|
pbt->cp = STACK_frame[i].cp;
|
|
|
|
pbt->fp = STACK_frame[i].fp;
|
|
|
|
pbt->pc = STACK_frame[i].pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mark the end of the backtrace
|
|
|
|
pbt--;
|
2011-09-09 00:04:52 +02:00
|
|
|
STACK_backtrace_set_end(pbt);
|
2011-08-31 04:28:48 +02:00
|
|
|
|
|
|
|
return bt;
|
|
|
|
}
|
2012-03-04 00:57:36 +01:00
|
|
|
|
2012-07-22 02:04:56 +02:00
|
|
|
/*void STACK_free_gosub_stack(STACK_GOSUB *gosub)
|
2012-03-04 00:57:36 +01:00
|
|
|
{
|
2012-03-05 00:43:07 +01:00
|
|
|
int i, j;
|
2012-03-04 00:57:36 +01:00
|
|
|
STACK_GOSUB *p;
|
|
|
|
|
2012-03-05 00:43:07 +01:00
|
|
|
if (FP->n_ctrl)
|
2012-03-04 00:57:36 +01:00
|
|
|
{
|
2012-03-05 00:43:07 +01:00
|
|
|
for (i = 0, p = gosub; i < ARRAY_count(gosub); i++, p++)
|
|
|
|
{
|
|
|
|
for (j = 0; j < FP->n_ctrl; j++)
|
|
|
|
RELEASE(&p->ctrl[j]);
|
|
|
|
|
|
|
|
FREE(&p->ctrl, "STACK_free_gosub_stack");
|
|
|
|
}
|
2012-03-04 00:57:36 +01:00
|
|
|
}
|
2012-03-05 00:43:07 +01:00
|
|
|
|
|
|
|
ARRAY_delete(&gosub);
|
2012-07-22 02:04:56 +02:00
|
|
|
}*/
|