mirror of
https://git.savannah.gnu.org/git/guile.git
synced 2025-04-29 19:30:36 +02:00
* libguile/scm.h (struct scm_thread, scm_thread): Rename from scm_i_thread. * libguile/deprecated.h (scm_i_thread): Add deprecated typedef. * libguile/threads.h: Adapt to renaming. * libguile/intrinsics.h: * libguile/scmsigs.h: * libguile/cache-internal.h: Remove threads.h includes; unnecessary with the forward decl. * libguile/continuations.h: * libguile/gc-inline.h: * libguile/async.h: Adapt scm_thread type name change. * libguile/async.c: * libguile/continuations.c: * libguile/control.c: * libguile/dynstack.c: * libguile/dynwind.c: * libguile/eval.c: * libguile/finalizers.c: * libguile/fluids.c: * libguile/gc.c: * libguile/intrinsics.c: * libguile/load.c: * libguile/memoize.c: * libguile/print.c: * libguile/read.c: * libguile/scmsigs.c: * libguile/script.c: * libguile/stackchk.c: * libguile/stacks.c: * libguile/symbols.c: * libguile/threads.c: * libguile/throw.c: * libguile/vm-engine.c: * libguile/vm.c: Adapt to type name change, and add additional includes as needed.
477 lines
14 KiB
C
477 lines
14 KiB
C
/* Copyright 1996-1997,2000-2001,2006-2014,2017-2018
|
||
Free Software Foundation, Inc.
|
||
|
||
This file is part of Guile.
|
||
|
||
Guile is free software: you can redistribute it and/or modify it
|
||
under the terms of the GNU Lesser General Public License as published
|
||
by the Free Software Foundation, either version 3 of the License, or
|
||
(at your option) any later version.
|
||
|
||
Guile 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 Lesser General Public
|
||
License for more details.
|
||
|
||
You should have received a copy of the GNU Lesser General Public
|
||
License along with Guile. If not, see
|
||
<https://www.gnu.org/licenses/>. */
|
||
|
||
|
||
|
||
|
||
#ifdef HAVE_CONFIG_H
|
||
# include <config.h>
|
||
#endif
|
||
|
||
#include "boolean.h"
|
||
#include "continuations.h"
|
||
#include "control.h"
|
||
#include "debug.h"
|
||
#include "eval.h"
|
||
#include "fluids.h"
|
||
#include "frames.h" /* vm frames */
|
||
#include "gsubr.h"
|
||
#include "list.h"
|
||
#include "macros.h"
|
||
#include "modules.h"
|
||
#include "numbers.h"
|
||
#include "pairs.h"
|
||
#include "private-options.h"
|
||
#include "procprop.h"
|
||
#include "strings.h"
|
||
#include "struct.h"
|
||
#include "symbols.h"
|
||
#include "threads.h"
|
||
#include "vm.h" /* to capture vm stacks */
|
||
|
||
#include "stacks.h"
|
||
|
||
|
||
static SCM scm_sys_stacks;
|
||
|
||
|
||
/* {Stacks}
|
||
*
|
||
* The stack is represented as a struct that holds a frame. The frame itself is
|
||
* linked to the next frame, or #f.
|
||
*
|
||
* Stacks
|
||
* Constructor
|
||
* make-stack
|
||
* Selectors
|
||
* stack-id
|
||
* stack-ref
|
||
* Inspector
|
||
* stack-length
|
||
*/
|
||
|
||
|
||
|
||
/* Count number of debug info frames on a stack, beginning with FRAME.
|
||
*/
|
||
static long
|
||
stack_depth (enum scm_vm_frame_kind kind, const struct scm_frame *frame)
|
||
{
|
||
struct scm_frame tmp;
|
||
long n = 1;
|
||
memcpy (&tmp, frame, sizeof tmp);
|
||
while (scm_c_frame_previous (kind, &tmp))
|
||
++n;
|
||
return n;
|
||
}
|
||
|
||
/* Narrow STACK by cutting away stackframes (mutatingly).
|
||
*
|
||
* Inner frames (most recent) are cut by advancing the frames pointer.
|
||
* Outer frames are cut by decreasing the recorded length.
|
||
*
|
||
* Cut maximally INNER inner frames and OUTER outer frames using
|
||
* the keys INNER_KEY and OUTER_KEY.
|
||
*
|
||
* Frames are cut away starting at the end points and moving towards
|
||
* the center of the stack. The key is normally compared to the
|
||
* operator in application frames. Frames up to and including the key
|
||
* are cut.
|
||
*
|
||
* If INNER_KEY is #t a different scheme is used for inner frames:
|
||
*
|
||
* Frames up to but excluding the first source frame originating from
|
||
* a user module are cut, except for possible application frames
|
||
* between the user frame and the last system frame previously
|
||
* encountered.
|
||
*/
|
||
|
||
static ptrdiff_t
|
||
find_prompt (SCM key)
|
||
{
|
||
ptrdiff_t fp_offset;
|
||
|
||
if (!scm_dynstack_find_prompt (&SCM_I_CURRENT_THREAD->dynstack, key,
|
||
NULL, &fp_offset, NULL, NULL, NULL))
|
||
scm_misc_error ("make-stack", "Prompt tag not found while narrowing stack",
|
||
scm_list_1 (key));
|
||
|
||
return fp_offset;
|
||
}
|
||
|
||
static long
|
||
narrow_stack (long len, enum scm_vm_frame_kind kind, struct scm_frame *frame,
|
||
SCM inner_cut, SCM outer_cut)
|
||
{
|
||
/* Resolve procedure cuts to address ranges, if possible. If the
|
||
debug information has been stripped, this might not be
|
||
possible. */
|
||
if (scm_is_true (scm_program_p (inner_cut)))
|
||
{
|
||
SCM addr_range = scm_program_address_range (inner_cut);
|
||
if (scm_is_pair (addr_range))
|
||
inner_cut = addr_range;
|
||
}
|
||
if (scm_is_true (scm_program_p (outer_cut)))
|
||
{
|
||
SCM addr_range = scm_program_address_range (outer_cut);
|
||
if (scm_is_pair (addr_range))
|
||
outer_cut = addr_range;
|
||
}
|
||
|
||
/* Cut inner part. */
|
||
if (scm_is_true (scm_procedure_p (inner_cut)))
|
||
{
|
||
/* Cut until the given procedure is seen. */
|
||
for (; len ;)
|
||
{
|
||
SCM proc = scm_c_frame_closure (kind, frame);
|
||
len--;
|
||
scm_c_frame_previous (kind, frame);
|
||
if (scm_is_eq (proc, inner_cut))
|
||
break;
|
||
}
|
||
}
|
||
else if (scm_is_pair (inner_cut)
|
||
&& scm_is_integer (scm_car (inner_cut))
|
||
&& scm_is_integer (scm_cdr (inner_cut)))
|
||
{
|
||
/* Cut until an IP within the given range is found. */
|
||
uintptr_t low_pc, high_pc, pc;
|
||
|
||
low_pc = scm_to_uintptr_t (scm_car (inner_cut));
|
||
high_pc = scm_to_uintptr_t (scm_cdr (inner_cut));
|
||
|
||
for (; len ;)
|
||
{
|
||
pc = (uintptr_t) frame->ip;
|
||
len--;
|
||
scm_c_frame_previous (kind, frame);
|
||
if (low_pc <= pc && pc < high_pc)
|
||
break;
|
||
}
|
||
}
|
||
else if (scm_is_integer (inner_cut))
|
||
{
|
||
/* Cut specified number of frames. */
|
||
long inner = scm_to_int (inner_cut);
|
||
|
||
for (; inner && len; --inner)
|
||
{
|
||
len--;
|
||
scm_c_frame_previous (kind, frame);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
/* Cut until the given prompt tag is seen. */
|
||
ptrdiff_t fp_offset = find_prompt (inner_cut);
|
||
for (; len; len--, scm_c_frame_previous (kind, frame))
|
||
if (fp_offset == frame->fp_offset)
|
||
break;
|
||
}
|
||
|
||
/* Cut outer part. */
|
||
if (scm_is_true (scm_procedure_p (outer_cut)))
|
||
{
|
||
long i, new_len;
|
||
struct scm_frame tmp;
|
||
|
||
memcpy (&tmp, frame, sizeof tmp);
|
||
|
||
/* Cut until the given procedure is seen. */
|
||
for (new_len = i = 0; i < len; i++, scm_c_frame_previous (kind, &tmp))
|
||
if (scm_is_eq (scm_c_frame_closure (kind, &tmp), outer_cut))
|
||
new_len = i;
|
||
|
||
len = new_len;
|
||
}
|
||
else if (scm_is_pair (outer_cut)
|
||
&& scm_is_integer (scm_car (outer_cut))
|
||
&& scm_is_integer (scm_cdr (outer_cut)))
|
||
{
|
||
/* Cut until an IP within the given range is found. */
|
||
uintptr_t low_pc, high_pc, pc;
|
||
long i, new_len;
|
||
struct scm_frame tmp;
|
||
|
||
low_pc = scm_to_uintptr_t (scm_car (outer_cut));
|
||
high_pc = scm_to_uintptr_t (scm_cdr (outer_cut));
|
||
|
||
memcpy (&tmp, frame, sizeof tmp);
|
||
|
||
/* Cut until the given procedure is seen. */
|
||
for (new_len = i = 0; i < len; i++, scm_c_frame_previous (kind, &tmp))
|
||
{
|
||
pc = (uintptr_t) tmp.ip;
|
||
if (low_pc <= pc && pc < high_pc)
|
||
new_len = i;
|
||
}
|
||
|
||
len = new_len;
|
||
}
|
||
else if (scm_is_integer (outer_cut))
|
||
{
|
||
/* Cut specified number of frames. */
|
||
long outer = scm_to_int (outer_cut);
|
||
|
||
if (outer < len)
|
||
len -= outer;
|
||
else
|
||
len = 0;
|
||
}
|
||
else
|
||
{
|
||
/* Cut until the given prompt tag is seen. */
|
||
long i;
|
||
struct scm_frame tmp;
|
||
ptrdiff_t fp_offset = find_prompt (outer_cut);
|
||
|
||
memcpy (&tmp, frame, sizeof tmp);
|
||
|
||
for (i = 0; i < len; i++, scm_c_frame_previous (kind, &tmp))
|
||
if (tmp.fp_offset == fp_offset)
|
||
break;
|
||
|
||
if (i < len)
|
||
len = i;
|
||
else
|
||
len = 0;
|
||
}
|
||
|
||
return len;
|
||
}
|
||
|
||
|
||
|
||
/* Stacks
|
||
*/
|
||
|
||
SCM scm_stack_type;
|
||
|
||
SCM_DEFINE (scm_stack_p, "stack?", 1, 0, 0,
|
||
(SCM obj),
|
||
"Return @code{#t} if @var{obj} is a calling stack.")
|
||
#define FUNC_NAME s_scm_stack_p
|
||
{
|
||
return scm_from_bool(SCM_STACKP (obj));
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM_DEFINE (scm_make_stack, "make-stack", 1, 0, 1,
|
||
(SCM obj, SCM args),
|
||
"Create a new stack. If @var{obj} is @code{#t}, the current\n"
|
||
"evaluation stack is used for creating the stack frames,\n"
|
||
"otherwise the frames are taken from @var{obj} (which must be\n"
|
||
"a continuation or a frame object).\n"
|
||
"\n"
|
||
"@var{args} should be a list containing any combination of\n"
|
||
"integer, procedure, address range, prompt tag and @code{#t}\n"
|
||
"values.\n"
|
||
"\n"
|
||
"These values specify various ways of cutting away uninteresting\n"
|
||
"stack frames from the top and bottom of the stack that\n"
|
||
"@code{make-stack} returns. They come in pairs like this:\n"
|
||
"@code{(@var{inner_cut_1} @var{outer_cut_1} @var{inner_cut_2}\n"
|
||
"@var{outer_cut_2} @dots{})}.\n"
|
||
"\n"
|
||
"Each @var{inner_cut_i} can be an integer, a procedure, an\n"
|
||
"address range, or a prompt tag. An integer means to cut away\n"
|
||
"exactly that number of frames. A procedure means to cut\n"
|
||
"away all frames up to but excluding the frame whose procedure\n"
|
||
"matches the specified one. An address range is a pair of\n"
|
||
"integers indicating the low and high addresses of a procedure's\n"
|
||
"code, and is the same as cutting away to a procedure (though\n"
|
||
"with less work). Anything else is interpreted as a prompt tag\n"
|
||
"which cuts away all frames that are inside a prompt with the\n"
|
||
"given tag.\n"
|
||
"\n"
|
||
"Each @var{outer_cut_i} can be an integer, a procedure, an\n"
|
||
"address range, or a prompt tag. An integer means to cut away\n"
|
||
"that number of frames. A procedure means to cut away frames\n"
|
||
"down to but excluding the frame whose procedure matches the\n"
|
||
"specified one. An address range is the same, but with the\n"
|
||
"procedure's code specified as an address range. Anything else\n"
|
||
"is taken to be a prompt tag, which cuts away all frames that are\n"
|
||
"outside a prompt with the given tag.\n"
|
||
"\n"
|
||
"If the @var{outer_cut_i} of the last pair is missing, it is\n"
|
||
"taken as 0.")
|
||
#define FUNC_NAME s_scm_make_stack
|
||
{
|
||
long n;
|
||
SCM inner_cut, outer_cut;
|
||
enum scm_vm_frame_kind kind;
|
||
struct scm_frame frame;
|
||
|
||
/* Extract a pointer to the innermost frame of whatever object
|
||
scm_make_stack was given. */
|
||
if (scm_is_eq (obj, SCM_BOOL_T))
|
||
{
|
||
SCM cont;
|
||
struct scm_vm_cont *c;
|
||
|
||
cont = scm_i_capture_current_stack ();
|
||
c = SCM_VM_CONT_DATA (cont);
|
||
|
||
kind = SCM_VM_FRAME_KIND_CONT;
|
||
frame.stack_holder = c;
|
||
frame.fp_offset = c->fp_offset;
|
||
frame.sp_offset = c->stack_size;
|
||
frame.ip = c->ra;
|
||
}
|
||
else if (SCM_VM_FRAME_P (obj))
|
||
{
|
||
kind = SCM_VM_FRAME_KIND (obj);
|
||
memcpy (&frame, SCM_VM_FRAME_DATA (obj), sizeof frame);
|
||
}
|
||
else if (SCM_CONTINUATIONP (obj))
|
||
/* FIXME: Narrowing to prompt tags should narrow with respect to the prompts
|
||
that were in place when the continuation was captured. */
|
||
{
|
||
kind = SCM_VM_FRAME_KIND_CONT;
|
||
if (!scm_i_continuation_to_frame (obj, &frame))
|
||
return SCM_BOOL_F;
|
||
}
|
||
else if (SCM_PROGRAM_P (obj) && SCM_PROGRAM_IS_PARTIAL_CONTINUATION (obj))
|
||
{
|
||
kind = SCM_VM_FRAME_KIND_CONT;
|
||
if (!scm_i_vm_cont_to_frame (SCM_PROGRAM_FREE_VARIABLE_REF (obj, 0),
|
||
&frame))
|
||
return SCM_BOOL_F;
|
||
}
|
||
else
|
||
{
|
||
SCM_WRONG_TYPE_ARG (SCM_ARG1, obj);
|
||
/* not reached */
|
||
}
|
||
|
||
/* Skip initial boot frame, if any. This is possible if the frame
|
||
originates from a captured continuation. */
|
||
if (scm_i_vm_is_boot_continuation_code (frame.ip)
|
||
&& !scm_c_frame_previous (kind, &frame))
|
||
return SCM_BOOL_F;
|
||
|
||
/* Count number of frames. Also get stack id tag and check whether
|
||
there are more stackframes than we want to record
|
||
(SCM_BACKTRACE_MAXDEPTH). */
|
||
n = stack_depth (kind, &frame);
|
||
|
||
/* Narrow the stack according to the arguments given to scm_make_stack. */
|
||
SCM_VALIDATE_REST_ARGUMENT (args);
|
||
while (n > 0 && !scm_is_null (args))
|
||
{
|
||
inner_cut = SCM_CAR (args);
|
||
args = SCM_CDR (args);
|
||
if (scm_is_null (args))
|
||
{
|
||
outer_cut = SCM_INUM0;
|
||
}
|
||
else
|
||
{
|
||
outer_cut = SCM_CAR (args);
|
||
args = SCM_CDR (args);
|
||
}
|
||
|
||
n = narrow_stack (n, kind, &frame, inner_cut, outer_cut);
|
||
}
|
||
|
||
if (n > 0)
|
||
{
|
||
/* Make the stack object. */
|
||
SCM stack = scm_make_struct_no_tail (scm_stack_type, SCM_EOL);
|
||
SCM_SET_STACK_LENGTH (stack, n);
|
||
SCM_SET_STACK_ID (stack, scm_stack_id (obj));
|
||
SCM_SET_STACK_FRAME (stack, scm_c_make_frame (kind, &frame));
|
||
return stack;
|
||
}
|
||
else
|
||
return SCM_BOOL_F;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM_DEFINE (scm_stack_id, "stack-id", 1, 0, 0,
|
||
(SCM stack),
|
||
"Return the identifier given to @var{stack} by @code{start-stack}.")
|
||
#define FUNC_NAME s_scm_stack_id
|
||
{
|
||
if (scm_is_eq (stack, SCM_BOOL_T)
|
||
/* FIXME: frame case assumes frame still live on the stack, and no
|
||
intervening start-stack. Hmm... */
|
||
|| SCM_VM_FRAME_P (stack))
|
||
{
|
||
/* Fetch most recent start-stack tag. */
|
||
SCM stacks = scm_fluid_ref (scm_sys_stacks);
|
||
return scm_is_pair (stacks) ? scm_car (stacks) : SCM_BOOL_F;
|
||
}
|
||
else if (SCM_CONTINUATIONP (stack))
|
||
/* FIXME: implement me */
|
||
return SCM_BOOL_F;
|
||
else if (SCM_PROGRAM_P (stack) && SCM_PROGRAM_IS_PARTIAL_CONTINUATION (stack))
|
||
/* FIXME: implement me */
|
||
return SCM_BOOL_F;
|
||
else
|
||
{
|
||
SCM_WRONG_TYPE_ARG (SCM_ARG1, stack);
|
||
/* not reached */
|
||
}
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM_DEFINE (scm_stack_ref, "stack-ref", 2, 0, 0,
|
||
(SCM stack, SCM index),
|
||
"Return the @var{index}'th frame from @var{stack}.")
|
||
#define FUNC_NAME s_scm_stack_ref
|
||
{
|
||
unsigned long int c_index;
|
||
SCM frame;
|
||
|
||
SCM_VALIDATE_STACK (1, stack);
|
||
c_index = scm_to_unsigned_integer (index, 0, SCM_STACK_LENGTH(stack)-1);
|
||
frame = SCM_STACK_FRAME (stack);
|
||
while (c_index--)
|
||
frame = scm_frame_previous (frame);
|
||
return frame;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM_DEFINE (scm_stack_length, "stack-length", 1, 0, 0,
|
||
(SCM stack),
|
||
"Return the length of @var{stack}.")
|
||
#define FUNC_NAME s_scm_stack_length
|
||
{
|
||
SCM_VALIDATE_STACK (1, stack);
|
||
return scm_from_long (SCM_STACK_LENGTH (stack));
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
|
||
void
|
||
scm_init_stacks ()
|
||
{
|
||
scm_sys_stacks = scm_make_thread_local_fluid (SCM_BOOL_F);
|
||
scm_c_define ("%stacks", scm_sys_stacks);
|
||
|
||
scm_stack_type = scm_make_vtable (scm_from_locale_string (SCM_STACK_LAYOUT),
|
||
SCM_UNDEFINED);
|
||
scm_set_struct_vtable_name_x (scm_stack_type,
|
||
scm_from_latin1_symbol ("stack"));
|
||
#include "stacks.x"
|
||
}
|