/* Copyright 1995-1996,1998,2000-2001,2004,2006,2008-2014,2017-2018,2025 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 . */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include #if SCM_HAVE_AUXILIARY_STACK #include #endif #include "async.h" #include "backtrace.h" #include "boolean.h" #include "debug.h" #include "dynstack.h" #include "eval.h" #include "gc-internal.h" #include "gsubr.h" #include "init.h" #include "instructions.h" #include "jit.h" #include "list.h" #include "numbers.h" #include "pairs.h" #include "ports.h" #include "programs.h" #include "stackchk.h" #include "stacks.h" #include "symbols.h" #include "vm.h" #include "continuations-internal.h" /* scm_i_make_continuation will return a procedure whose code will reinstate the continuation. Here, as in gsubr.c, we define the form of that trampoline function. */ struct goto_continuation_code { struct scm_jit_function_data data; uint32_t code[3]; }; struct goto_continuation_code goto_continuation_code = { { /* mcode = */ 0, /* counter = */ 0, /* start = */ sizeof (struct scm_jit_function_data), /* end = */ sizeof (struct scm_jit_function_data) + 12 }, { SCM_PACK_OP_24 (instrument_entry, 0), ((uint32_t) -(sizeof (struct scm_jit_function_data) / 4)), SCM_PACK_OP_24 (continuation_call, 0), } }; static SCM make_continuation_trampoline (struct scm_continuation *cont) { scm_t_bits nfree = 1; scm_t_bits flags = SCM_F_PROGRAM_IS_CONTINUATION; scm_t_bits tag = scm_tc7_program | (nfree << 16) | flags; struct scm_program *ret = scm_allocate_tagged (SCM_I_CURRENT_THREAD, sizeof (struct scm_program) + nfree * sizeof(SCM)); ret->tag_flags_and_free_variable_count = tag; ret->code = goto_continuation_code.code; ret->free_variables[0] = scm_from_continuation (cont); return scm_from_program (ret); } /* {Continuations} */ int scm_i_print_continuation (SCM obj, SCM port, scm_print_state *state SCM_UNUSED) { struct scm_continuation *continuation = scm_to_continuation (obj); scm_puts ("#num_stack_items, 10, port); scm_puts (" @ ", port); scm_uintprint (SCM_UNPACK (obj), 16, port); scm_putc ('>', port); return 1; } static void pin_conservative_roots (scm_thread *thread, void *base, size_t size) { struct gc_mutator *mut = thread->mutator; struct gc_heap *heap = gc_mutator_heap (mut); size_t nwords = size / sizeof (scm_t_bits); scm_t_bits *words = base; for (size_t i = 0; i < nwords; i++) { struct gc_conservative_ref maybe_ref = gc_conservative_ref (words[i]); struct gc_ref ref = gc_resolve_conservative_ref (heap, maybe_ref, 0); if (!gc_ref_is_null (ref)) gc_pin_object (mut, ref); } } /* James Clark came up with this neat one instruction fix for * continuations on the SPARC. It flushes the register windows so * that all the state of the process is contained in the stack. */ #if defined (sparc) || defined (__sparc__) || defined (__sparc) # define SCM_FLUSH_REGISTER_WINDOWS asm("ta 3") #else # define SCM_FLUSH_REGISTER_WINDOWS /* empty */ #endif static void capture_auxiliary_stack (scm_thread *thread, struct scm_continuation *continuation) { #if SCM_HAVE_AUXILIARY_STACK # if !defined __ia64 || !defined __ia64__ # error missing auxiliary stack implementation for architecture # endif char *top; ucontext_t ctx; if (getcontext (&ctx) != 0) abort (); #if defined __hpux __uc_get_ar_bsp (ctx, (uint64_t *) &top); #elif defined linux top = (char *) ctx.uc_mcontext.sc_ar_bsp; #elif defined __FreeBSD__ top = (char *)(ctx.uc_mcontext.mc_special.bspstore + ctx->uc_mcontext.mc_special.ndirty); #else #error missing auxiliary stack implementation for ia64 on this OS #endif continuation->auxiliary_stack_size = top - (char *) thread->auxiliary_stack_base; continuation->auxiliary_stack = scm_allocate_sloppy (SCM_I_CURRENT_THREAD, continuation->auxiliary_stack_size); memcpy (continuation->auxiliary_stack, thread->auxiliary_stack_base, continuation->auxiliary_stack_size); pin_conservative_roots (thread, continuation->auxiliary_stack, continuation->auxiliary_stack_size); #endif /* SCM_HAVE_AUXILIARY_STACK */ } static void restore_auxiliary_stack (scm_thread *thread, struct scm_continuation *continuation) { #if SCM_HAVE_AUXILIARY_STACK memcpy (thread->auxiliary_stack_base, continuation->auxiliary_stack, continuation->auxiliary_stack_size); #endif } SCM scm_i_make_continuation (scm_thread *thread, struct scm_vm_cont *vm_cont) { SCM_FLUSH_REGISTER_WINDOWS; long stack_size = scm_stack_size (thread->continuation_base); struct scm_continuation *continuation = scm_allocate_tagged (SCM_I_CURRENT_THREAD, sizeof (struct scm_continuation) + stack_size * sizeof (SCM_STACKITEM)); continuation->tag = scm_tc16_continuation; memcpy (continuation->jmpbuf, thread->vm.registers, sizeof (jmp_buf)); pin_conservative_roots (thread, continuation->jmpbuf, sizeof (jmp_buf)); capture_auxiliary_stack (thread, continuation); continuation->root = thread->continuation_root; continuation->vm_cont = vm_cont; SCM_STACKITEM * src = thread->continuation_base; #if ! SCM_STACK_GROWS_UP src -= stack_size; #endif memcpy (continuation->stack, src, sizeof (SCM_STACKITEM) * stack_size); continuation->offset = continuation->stack - src; continuation->num_stack_items = stack_size; pin_conservative_roots (thread, continuation->stack, sizeof (SCM_STACKITEM) * stack_size); return make_continuation_trampoline (continuation); } int scm_i_continuation_to_frame (SCM continuation, struct scm_frame *frame) { SCM contregs; struct scm_continuation *cont; struct scm_program *program = scm_to_program (continuation); contregs = scm_program_free_variable_ref (program, 0); cont = scm_to_continuation (contregs); if (cont->vm_cont) { struct scm_vm_cont *data = cont->vm_cont; frame->stack_holder = data; frame->fp_offset = data->fp_offset; frame->sp_offset = data->stack_size; frame->ip = data->vra; return 1; } else return 0; } /* {Apply} */ /* Invoking a continuation proceeds as follows: * * - the stack is made large enough for the called continuation * - the old windchain is unwound down to the branching point * - the continuation stack is copied into place * - the windchain is rewound up to the continuation's context * - the continuation is invoked via longjmp (or setcontext) * * This order is important so that unwind and rewind handlers are run * with their correct stack. */ static void scm_dynthrow (struct scm_continuation *, uint8_t *); /* Grow the stack by a fixed amount to provide space to copy in the * continuation. Possibly this function has to be called several times * recursively before enough space is available. Make sure the compiler does * not optimize the growth array away by storing it's address into a global * variable. */ static scm_t_bits scm_i_dummy; static void grow_stack (struct scm_continuation *cont, uint8_t *mra) { scm_t_bits growth[100]; scm_i_dummy = (scm_t_bits) growth; scm_dynthrow (cont, mra); } /* Copy the continuation stack into the current stack. Calling functions from * within this function is safe, since only stack frames below this function's * own frame are overwritten. Thus, memcpy can be used for best performance. */ static void copy_stack_and_call (struct scm_continuation *continuation, SCM_STACKITEM * dst, uint8_t *mra) { scm_t_dynstack *dynstack; scm_t_bits *joint; scm_thread *thread = SCM_I_CURRENT_THREAD; dynstack = continuation->vm_cont->dynstack; joint = scm_dynstack_unwind_fork (&thread->dynstack, dynstack); memcpy (dst, continuation->stack, sizeof (SCM_STACKITEM) * continuation->num_stack_items); restore_auxiliary_stack (thread, continuation); scm_dynstack_wind (&thread->dynstack, joint); thread->vm.mra_after_abort = mra; longjmp (continuation->jmpbuf, 1); } /* Call grow_stack until the stack space is large enough, then, as the current * stack frame might get overwritten, let copy_stack_and_call perform the * actual copying and continuation calling. */ static void scm_dynthrow (struct scm_continuation *continuation, uint8_t *mra) { scm_thread *thread = SCM_I_CURRENT_THREAD; SCM_STACKITEM *dst = thread->continuation_base; SCM_STACKITEM stack_top_element; #if SCM_STACK_GROWS_UP if (dst + continuation->num_stack_items >= &stack_top_element) grow_stack (cont, mra); #else dst -= continuation->num_stack_items; if (dst <= &stack_top_element) grow_stack (continuation, mra); #endif /* def SCM_STACK_GROWS_UP */ SCM_FLUSH_REGISTER_WINDOWS; copy_stack_and_call (continuation, dst, mra); } void scm_i_reinstate_continuation (struct scm_continuation *cont, uint8_t *mra) { scm_dynthrow (cont, mra); abort (); /* Unreachable. */ } SCM scm_i_with_continuation_barrier (scm_t_catch_body body, void *body_data, scm_t_catch_handler handler, void *handler_data, scm_t_catch_handler pre_unwind_handler, void *pre_unwind_handler_data) { SCM_STACKITEM stack_item; scm_thread *thread = SCM_I_CURRENT_THREAD; SCM old_controot; SCM_STACKITEM *old_contbase; SCM result; /* Establish a fresh continuation root. */ old_controot = thread->continuation_root; old_contbase = thread->continuation_base; thread->continuation_root = scm_cons (scm_thread_handle (thread), old_controot); thread->continuation_base = &stack_item; /* Call FUNC inside a catch all. This is now guaranteed to return directly and exactly once. */ result = scm_c_catch (SCM_BOOL_T, body, body_data, handler, handler_data, pre_unwind_handler, pre_unwind_handler_data); /* Return to old continuation root. */ thread->continuation_base = old_contbase; thread->continuation_root = old_controot; return result; } static int should_print_backtrace (SCM tag, SCM stack) { return SCM_BACKTRACE_P && scm_is_true (stack) && scm_initialized_p /* It's generally not useful to print backtraces for errors reading or expanding code in these fallback catch statements. */ && !scm_is_eq (tag, scm_from_latin1_symbol ("read-error")) && !scm_is_eq (tag, scm_from_latin1_symbol ("syntax-error")); } static void print_exception_and_backtrace (SCM port, SCM tag, SCM args) { SCM stack, frame; /* We get here via a throw to a catch-all. In that case there is the throw frame active, and this catch closure, so narrow by two frames. */ stack = scm_make_stack (SCM_BOOL_T, scm_list_1 (scm_from_int (2))); frame = scm_is_true (stack) ? scm_stack_ref (stack, SCM_INUM0) : SCM_BOOL_F; if (should_print_backtrace (tag, stack)) { scm_puts ("Backtrace:\n", port); scm_display_backtrace_with_highlights (stack, port, SCM_BOOL_F, SCM_BOOL_F, SCM_EOL); scm_newline (port); } scm_print_exception (port, frame, tag, args); } struct c_data { void *(*func) (void *); void *data; void *result; }; static SCM c_body (void *d) { struct c_data *data = (struct c_data *)d; data->result = data->func (data->data); return SCM_UNSPECIFIED; } static SCM c_handler (void *d, SCM tag, SCM args) { struct c_data *data; /* If TAG is `quit', exit() the process. */ if (scm_is_eq (tag, scm_from_latin1_symbol ("quit"))) exit (scm_exit_status (args)); data = (struct c_data *)d; data->result = NULL; return SCM_UNSPECIFIED; } static SCM pre_unwind_handler (void *error_port, SCM tag, SCM args) { /* Print the exception unless TAG is `quit'. */ if (!scm_is_eq (tag, scm_from_latin1_symbol ("quit"))) print_exception_and_backtrace (SCM_PACK_POINTER (error_port), tag, args); return SCM_UNSPECIFIED; } void * scm_c_with_continuation_barrier (void *(*func) (void *), void *data) { struct c_data c_data; c_data.func = func; c_data.data = data; scm_i_with_continuation_barrier (c_body, &c_data, c_handler, &c_data, pre_unwind_handler, SCM_UNPACK_POINTER (scm_current_error_port ())); return c_data.result; } struct scm_data { SCM proc; }; static SCM scm_body (void *d) { struct scm_data *data = (struct scm_data *)d; return scm_call_0 (data->proc); } static SCM scm_handler (void *d, SCM tag, SCM args) { /* Print a message. Note that if TAG is `quit', this will exit() the process. */ scm_handle_by_message_noexit (NULL, tag, args); return SCM_BOOL_F; } SCM_DEFINE (scm_with_continuation_barrier, "with-continuation-barrier", 1,0,0, (SCM proc), "Call @var{proc} and return its result. Do not allow the invocation of\n" "continuations that would leave or enter the dynamic extent of the call\n" "to @code{with-continuation-barrier}. Such an attempt causes an error\n" "to be signaled.\n" "\n" "Throws (such as errors) that are not caught from within @var{proc} are\n" "caught by @code{with-continuation-barrier}. In that case, a short\n" "message is printed to the current error port and @code{#f} is returned.\n" "\n" "Thus, @code{with-continuation-barrier} returns exactly once.\n") #define FUNC_NAME s_scm_with_continuation_barrier { struct scm_data scm_data; scm_data.proc = proc; return scm_i_with_continuation_barrier (scm_body, &scm_data, scm_handler, &scm_data, pre_unwind_handler, SCM_UNPACK_POINTER (scm_current_error_port ())); } #undef FUNC_NAME void scm_init_continuations () { #include "continuations.x" }