miden-processor 0.24.0

use alloc::sync::Arc;

use miden_air::{StackCols, SystemCols};
use miden_core::program::MIN_STACK_DEPTH;

use super::{
    super::{
        block_stack::ExecutionContextInfo,
        trace_state::{
            BlockAddressReplay, BlockStackReplay, DecoderState, StackState, SystemState,
        },
        utils::RowMajorTraceWriter,
    },
    core_trace_fragment::BasicBlockContext,
    processor::ReplayProcessor,
};
use crate::{
    ExecutionError, Felt, ONE, Word, ZERO,
    continuation_stack::{Continuation, ContinuationStack},
    errors::MapExecErrNoCtx,
    mast::{ExecutableMastForest, MastNode, MastNodeExt, MastNodeId, SparseMastForest},
    trace::trace_state::NodeFlags,
    tracer::{OperationHelperRegisters, Tracer},
};

mod trace_row;

// TRACER FINAL STATE
// ================================================================================================

/// The final state of a [`CoreTraceGenerationTracer`] after trace generation completes.
///
/// Contains the last stack and system trace cols (or zeros if none were written), which are needed
/// to initialize the first row of the next fragment, as well as the number of trace rows that were
/// built.
pub(crate) struct TracerFinalState {
    pub last_stack_cols: StackCols<Felt>,
    pub last_system_cols: SystemCols<Felt>,
    pub num_rows_written: usize,
}

// CORE TRACE GENERATION TRACER
// ================================================================================================

/// A tracer implementation for generating a core trace fragment of a predetermined number of rows.
///
/// This tracer is used in conjunction with the [`ReplayProcessor`] to fill in trace rows for a
/// fragment of the execution. Trace rows are written in [`Tracer::finalize_clock_cycle`] after
/// collecting the necessary state in [`Tracer::start_clock_cycle`].
///
/// The tracer handles errors internally; if an error is encountered during execution, it is stored
/// and all subsequent calls to these methods become no-ops. The error is returned by
/// `into_final_state()`, which should be called after trace generation completes to retrieve the
/// final state of the tracer (or the error, if one was encountered).
#[derive(Debug)]
pub(crate) struct CoreTraceGenerationTracer<'a> {
    /// The writer for the core trace fragment.
    writer: RowMajorTraceWriter<'a, Felt>,
    /// The index of the next row to write in the trace fragment.
    row_write_index: usize,

    /// The decoder state being replayed, tracking the current and parent block addresses.
    decoder_state: DecoderState,
    /// Replays the sequence of block addresses that were assigned during the initial execution.
    block_address_replay: BlockAddressReplay,
    /// Replays block stack push/pop operations (parent address and block context) from the
    /// initial execution.
    block_stack_replay: BlockStackReplay,

    /// Buffered stack trace column data from the current clock cycle. Written to the fragment on
    /// the *next* clock cycle (since stack columns are one row behind), and returned via
    /// [`into_parts`](Self::into_parts) so the next fragment can continue from this state.
    stack_cols: Option<StackCols<Felt>>,
    /// Buffered system trace column data from the current clock cycle. Written to the fragment on
    /// the *next* clock cycle (since system columns are one row behind), and returned via
    /// [`into_parts`](Self::into_parts) so the next fragment can continue from this state.
    system_cols: Option<SystemCols<Felt>>,

    /// Execution context info captured at the beginning of a DYNCALL clock cycle (in
    /// [`start_clock_cycle`](Tracer::start_clock_cycle)) to be used when finalizing it.
    ctx_info: Option<ExecutionContextInfo>,
    /// Loop condition captured at the beginning of a `FinishLoop` clock cycle (in
    /// [`start_clock_cycle`](Tracer::start_clock_cycle)). `true` means the loop body will be
    /// re-executed (REPEAT); `false` means the loop is finished (END).
    finish_loop_condition: Option<bool>,
    /// Hash of the called procedure for `Dyn` nodes, captured at the beginning of a DYN clock
    /// cycle (in [`start_clock_cycle`](Tracer::start_clock_cycle)) to be used when finalizing
    /// it.
    dyn_callee_hash: Option<Word>,

    /// The continuation captured at the beginning of the clock cycle (in
    /// [`start_clock_cycle`](Tracer::start_clock_cycle)), describing what is being executed at
    /// this cycle.
    continuation: Option<Continuation<Arc<SparseMastForest>>>,

    /// Whether the node ending in this clock cycle is a body of a LOOP node. This is determined
    /// by peeking at the continuation stack in [`start_clock_cycle`](Tracer::start_clock_cycle)
    /// to check if the next clock-incrementing continuation is a `FinishLoop`.
    ///
    /// This is only relevant for END operations (Finish* continuations).
    is_loop_body: bool,

    /// If an error is encountered during trace generation, it is stored here. Once set, all
    /// subsequent `start_clock_cycle` and `finalize_clock_cycle` calls become no-ops, and the
    /// error is returned by [`into_parts`](Self::into_parts).
    error_encountered: Option<ExecutionError>,
}

impl<'a> CoreTraceGenerationTracer<'a> {
    pub fn new(
        writer: RowMajorTraceWriter<'a, Felt>,
        decoder_state: DecoderState,
        block_address_replay: BlockAddressReplay,
        block_stack_replay: BlockStackReplay,
    ) -> Self {
        Self {
            writer,
            row_write_index: 0,
            decoder_state,
            block_address_replay,
            block_stack_replay,
            stack_cols: None,
            system_cols: None,
            ctx_info: None,
            finish_loop_condition: None,
            dyn_callee_hash: None,
            continuation: None,
            is_loop_body: false,
            error_encountered: None,
        }
    }

    /// Consumes this tracer and returns its final state, or an error if one was encountered
    /// during trace generation.
    pub fn into_final_state(self) -> Result<TracerFinalState, ExecutionError> {
        if let Some(err) = self.error_encountered {
            return Err(err);
        }

        Ok(TracerFinalState {
            last_stack_cols: self.stack_cols.unwrap_or(StackCols {
                top: [ZERO; MIN_STACK_DEPTH],
                b0: ZERO,
                b1: ZERO,
                h0: ZERO,
            }),
            last_system_cols: self.system_cols.unwrap_or(SystemCols {
                clk: ZERO,
                ctx: ZERO,
                fn_hash: [ZERO; miden_core::WORD_SIZE],
            }),
            num_rows_written: self.row_write_index,
        })
    }

    // HELPER METHODS
    // --------------------------------------------------------------------------------------------

    /// Fills a trace row for a `StartNode` continuation based on the type of node being started.
    fn fill_start_row(
        &mut self,
        node_id: MastNodeId,
        processor: &ReplayProcessor,
        current_forest: &Arc<SparseMastForest>,
    ) -> Result<(), ExecutionError> {
        let node = get_node_in_forest(current_forest, node_id)?;

        match node {
            MastNode::Block(basic_block_node) => {
                self.fill_basic_block_start_trace_row(
                    &processor.system,
                    &processor.stack,
                    basic_block_node,
                )?;
            },
            MastNode::Join(join_node) => {
                self.fill_join_start_trace_row(
                    &processor.system,
                    &processor.stack,
                    join_node,
                    current_forest,
                )?;
            },
            MastNode::Split(split_node) => {
                self.fill_split_start_trace_row(
                    &processor.system,
                    &processor.stack,
                    split_node,
                    current_forest,
                )?;
            },
            MastNode::Loop(loop_node) => {
                self.fill_loop_start_trace_row(
                    &processor.system,
                    &processor.stack,
                    loop_node,
                    current_forest,
                )?;
            },
            MastNode::Call(call_node) => {
                self.fill_call_start_trace_row(
                    &processor.system,
                    &processor.stack,
                    call_node,
                    current_forest,
                )?;
            },
            MastNode::Dyn(dyn_node) => {
                let callee_hash = self.dyn_callee_hash.take().ok_or(ExecutionError::Internal(
                    "dyn callee hash not stored at start of clock cycle",
                ))?;

                if dyn_node.is_dyncall() {
                    let ctx_info = self.ctx_info.take().ok_or(ExecutionError::Internal(
                        "execution context info not stored at start of clock cycle for DYNCALL node",
                    ))?;

                    self.fill_dyncall_start_trace_row(
                        &processor.system,
                        &processor.stack,
                        callee_hash,
                        ctx_info,
                    );
                } else {
                    self.fill_dyn_start_trace_row(&processor.system, &processor.stack, callee_hash);
                }
            },
            MastNode::External(_) => {
                unreachable!("The Tracer contract guarantees that external nodes do not occur here")
            },
        }

        Ok(())
    }

    /// Returns the execution context info for a DYNCALL node, or `None` if the continuation does
    /// not represent a `StartNode` for a DYNCALL. The state of the processor is expected to be at
    /// the beginning of the DYNCALL execution (i.e., during `start_clock_cycle()`).
    ///
    /// Recall that DYNCALL drops the top stack element, which represents the memory address where
    /// the callee hash is stored. The execution context info is captured *after* the top stack
    /// element has been dropped, as per the semantics of DYNCALL.
    fn get_execution_context_for_dyncall(
        &self,
        current_forest: &Arc<SparseMastForest>,
        continuation: &Continuation<Arc<SparseMastForest>>,
        processor: &ReplayProcessor,
    ) -> Result<Option<ExecutionContextInfo>, ExecutionError> {
        let Continuation::StartNode(node_id) = &continuation else {
            return Ok(None);
        };

        let Some(node) = current_forest.get_node_by_id(*node_id) else {
            return Err(ExecutionError::Internal("invalid node ID stored in continuation"));
        };

        let MastNode::Dyn(dyn_node) = node else {
            return Ok(None);
        };

        if !dyn_node.is_dyncall() {
            return Ok(None);
        }

        let (stack_depth_after_drop, overflow_addr_after_drop) =
            if processor.stack.stack_depth() > MIN_STACK_DEPTH {
                // Stack is above minimum depth, so peek at the overflow replay for the post-pop
                // overflow address.
                let (_, overflow_addr_after_drop) = processor
                .stack_overflow_replay
                .peek_replay_pop_overflow()
                .ok_or(ExecutionError::Internal(
                    "stack depth is above minimum, but no corresponding overflow pop in the replay",
                ))?;
                let stack_depth_after_drop = processor.stack.stack_depth() - 1;

                (stack_depth_after_drop as u32, *overflow_addr_after_drop)
            } else {
                // Stack is at minimum depth already, so the overflow address is ZERO and the depth
                // remains the same after the drop.
                (processor.stack.stack_depth() as u32, ZERO)
            };

        Ok(Some(ExecutionContextInfo::new(
            processor.system.ctx,
            processor.system.fn_hash,
            stack_depth_after_drop,
            overflow_addr_after_drop,
        )))
    }

    /// Returns the loop condition sitting on top of the stack for a `FinishLoop` continuation, or
    /// `None` if the continuation is not a `FinishLoop`.
    ///
    /// The loop condition is `true` if the top of the stack equals ONE (meaning the loop body
    /// should be re-executed), and `false` otherwise (meaning the loop is finished).
    fn get_finish_loop_condition(
        &self,
        continuation: &Continuation<Arc<SparseMastForest>>,
        processor: &ReplayProcessor,
    ) -> Option<bool> {
        if let Continuation::FinishLoop(_) = &continuation {
            let condition = processor.stack.get(0);
            return Some(condition == ONE);
        }

        None
    }

    /// Returns the `NodeFlags` for an END operation based on the continuation type and state
    /// captured in `start_clock_cycle`.
    fn compute_node_flags(
        &self,
        continuation: &Continuation<Arc<SparseMastForest>>,
        current_forest: &Arc<SparseMastForest>,
    ) -> Result<NodeFlags, ExecutionError> {
        let is_loop_body = self.is_loop_body;

        match continuation {
            Continuation::FinishLoop(_) => {
                // The Loop node itself is ending. With do-while semantics every loop is entered, so
                // the `is_loop` flag is unconditionally true here.
                Ok(NodeFlags::new(is_loop_body, true, false, false))
            },
            Continuation::FinishCall(node_id) => {
                let node = get_node_in_forest(current_forest, *node_id)?;
                let MastNode::Call(call_node) = node else {
                    return Err(ExecutionError::Internal(
                        "expected call node in FinishCall continuation",
                    ));
                };
                let is_syscall = call_node.is_syscall();
                let is_call = !is_syscall;
                Ok(NodeFlags::new(is_loop_body, false, is_call, is_syscall))
            },
            Continuation::FinishDyn(node_id) => {
                let node = get_node_in_forest(current_forest, *node_id)?;
                let MastNode::Dyn(dyn_node) = node else {
                    return Err(ExecutionError::Internal(
                        "expected dyn node in FinishDyn continuation",
                    ));
                };
                let is_call = dyn_node.is_dyncall();
                Ok(NodeFlags::new(is_loop_body, false, is_call, false))
            },
            Continuation::FinishJoin(_)
            | Continuation::FinishSplit(_)
            | Continuation::FinishBasicBlock(_) => {
                Ok(NodeFlags::new(is_loop_body, false, false, false))
            },
            _ => {
                Err(ExecutionError::Internal("compute_node_flags called for non-END continuation"))
            },
        }
    }

    /// Returns the callee hash for a `Dyn` node, or `None` if the continuation is not a
    /// `StartNode` for a `Dyn` node.
    ///
    /// The callee hash is read from the memory reads replay, as `Dyn` nodes read the procedure
    /// hash (as a word) from memory.
    fn get_dyn_callee_hash(
        &self,
        continuation: &Continuation<Arc<SparseMastForest>>,
        processor: &ReplayProcessor,
        current_forest: &Arc<SparseMastForest>,
    ) -> Result<Option<Word>, ExecutionError> {
        if let Continuation::StartNode(node_id) = continuation {
            let Some(node) = current_forest.get_node_by_id(*node_id) else {
                return Err(ExecutionError::Internal("invalid node ID stored in continuation"));
            };

            if let MastNode::Dyn(_) = node {
                let (word_read, _addr, _ctx, _clk) =
                    processor.memory_reads_replay.iter_read_words().next().ok_or(
                        ExecutionError::Internal(
                            "dyn node reads the procedure hash (word) from memory",
                        ),
                    )?;
                return Ok(Some(word_read));
            }
        }

        Ok(None)
    }
}

// TRACER IMPLEMENTATION
// ================================================================================================

impl Tracer for CoreTraceGenerationTracer<'_> {
    type Processor = ReplayProcessor;
    type Forest = Arc<SparseMastForest>;

    fn start_clock_cycle(
        &mut self,
        processor: &ReplayProcessor,
        continuation: Continuation<Arc<SparseMastForest>>,
        continuation_stack: &ContinuationStack<Arc<SparseMastForest>>,
        current_forest: &Arc<SparseMastForest>,
    ) {
        if self.error_encountered.is_some() {
            return;
        }

        let result = (|| -> Result<(), ExecutionError> {
            // If this is a DYNCALL node, store execution context info needed when writing the trace
            // row in finalize_clock_cycle.
            self.ctx_info =
                self.get_execution_context_for_dyncall(current_forest, &continuation, processor)?;
            self.finish_loop_condition = self.get_finish_loop_condition(&continuation, processor);
            self.dyn_callee_hash =
                self.get_dyn_callee_hash(&continuation, processor, current_forest)?;

            // For END operations, determine if the ending node is a body of a LOOP by checking
            // whether the next clock-incrementing continuation is a FinishLoop.
            self.is_loop_body = matches!(
                continuation_stack.iter_continuations_for_next_clock().last(),
                Some(Continuation::FinishLoop(_))
            );

            // Store state for finalizing the clock cycle later.
            self.continuation = Some(continuation);

            Ok(())
        })();

        if let Err(e) = result {
            self.error_encountered = Some(e);
        }
    }

    fn finalize_clock_cycle(
        &mut self,
        processor: &ReplayProcessor,
        op_helper_registers: OperationHelperRegisters,
        current_forest: &Arc<SparseMastForest>,
    ) {
        if self.error_encountered.is_some() {
            return;
        }

        use Continuation::*;

        let result = (|| -> Result<(), ExecutionError> {
            let continuation = self.continuation.as_ref().ok_or(ExecutionError::Internal(
                "continuation not stored at start of clock cycle",
            ))?;

            match continuation {
                StartNode(node_id) => {
                    self.decoder_state.replay_node_start(
                        &mut self.block_address_replay,
                        &mut self.block_stack_replay,
                    )?;

                    self.fill_start_row(*node_id, processor, current_forest)?;
                },
                FinishJoin(node_id) => {
                    let node = get_node_in_forest(current_forest, *node_id)?;
                    let flags = self.compute_node_flags(continuation, current_forest)?;
                    self.fill_end_trace_row(
                        &processor.system,
                        &processor.stack,
                        node.digest(),
                        flags.to_hasher_state_second_word(),
                    )?;
                },
                FinishSplit(node_id) => {
                    let node = get_node_in_forest(current_forest, *node_id)?;
                    let flags = self.compute_node_flags(continuation, current_forest)?;
                    self.fill_end_trace_row(
                        &processor.system,
                        &processor.stack,
                        node.digest(),
                        flags.to_hasher_state_second_word(),
                    )?;
                },
                FinishLoop(node_id) => {
                    let loop_condition = self.finish_loop_condition.take().ok_or(
                        ExecutionError::Internal(
                            "loop condition not stored at start of clock cycle for FinishLoop continuation",
                        ),
                    )?;

                    if loop_condition {
                        // Loop body is about to be re-executed, so fill in a REPEAT row.
                        let MastNode::Loop(loop_node) =
                            get_node_in_forest(current_forest, *node_id)?
                        else {
                            return Err(ExecutionError::Internal(
                                "expected loop node in FinishLoop continuation",
                            ));
                        };
                        let current_addr = self.decoder_state.current_addr;

                        self.fill_loop_repeat_trace_row(
                            &processor.system,
                            &processor.stack,
                            loop_node,
                            current_forest,
                            current_addr,
                        )?;
                    } else {
                        // Loop is finished, so fill in an END row.
                        let node = get_node_in_forest(current_forest, *node_id)?;
                        let flags = self.compute_node_flags(continuation, current_forest)?;
                        self.fill_end_trace_row(
                            &processor.system,
                            &processor.stack,
                            node.digest(),
                            flags.to_hasher_state_second_word(),
                        )?;
                    }
                },
                FinishCall(node_id) => {
                    let node = get_node_in_forest(current_forest, *node_id)?;
                    let flags = self.compute_node_flags(continuation, current_forest)?;
                    self.fill_end_trace_row(
                        &processor.system,
                        &processor.stack,
                        node.digest(),
                        flags.to_hasher_state_second_word(),
                    )?;
                },
                FinishDyn(node_id) => {
                    let node = get_node_in_forest(current_forest, *node_id)?;
                    let flags = self.compute_node_flags(continuation, current_forest)?;
                    self.fill_end_trace_row(
                        &processor.system,
                        &processor.stack,
                        node.digest(),
                        flags.to_hasher_state_second_word(),
                    )?;
                },
                ResumeBasicBlock { node_id, batch_index, op_idx_in_batch } => {
                    let MastNode::Block(basic_block_node) =
                        get_node_in_forest(current_forest, *node_id)?
                    else {
                        return Err(ExecutionError::Internal(
                            "expected basic block node in ResumeBasicBlock continuation",
                        ));
                    };

                    let mut basic_block_context = BasicBlockContext::new_at_op(
                        basic_block_node,
                        *batch_index,
                        *op_idx_in_batch,
                    )
                    .map_exec_err_no_ctx()?;
                    let current_batch = basic_block_node
                        .op_batches()
                        .get(*batch_index)
                        .ok_or(ExecutionError::Internal("batch index out of bounds"))?;
                    let operation = *current_batch
                        .ops()
                        .get(*op_idx_in_batch)
                        .ok_or(ExecutionError::Internal("op index in batch out of bounds"))?;
                    let (_, op_idx_in_group) = current_batch
                        .op_idx_in_batch_to_group(*op_idx_in_batch)
                        .ok_or(ExecutionError::Internal("invalid op index in batch"))?;

                    self.fill_operation_trace_row(
                        &processor.system,
                        &processor.stack,
                        operation,
                        op_idx_in_group,
                        op_helper_registers.to_user_op_helpers(),
                        &mut basic_block_context,
                    );
                },
                Respan { node_id, batch_index } => {
                    let MastNode::Block(basic_block_node) =
                        get_node_in_forest(current_forest, *node_id)?
                    else {
                        return Err(ExecutionError::Internal(
                            "expected basic block node in Respan continuation",
                        ));
                    };

                    let mut basic_block_context =
                        BasicBlockContext::new_at_batch_start(basic_block_node, *batch_index)
                            .map_exec_err_no_ctx()?;
                    let current_batch = basic_block_node
                        .op_batches()
                        .get(*batch_index)
                        .ok_or(ExecutionError::Internal("batch index out of bounds"))?;

                    self.fill_respan_trace_row(
                        &processor.system,
                        &processor.stack,
                        current_batch,
                        &mut basic_block_context,
                    )?;
                },
                FinishBasicBlock(node_id) => {
                    let MastNode::Block(basic_block_node) =
                        get_node_in_forest(current_forest, *node_id)?
                    else {
                        return Err(ExecutionError::Internal(
                            "expected basic block node in FinishBasicBlock continuation",
                        ));
                    };

                    let flags = self.compute_node_flags(continuation, current_forest)?;
                    self.fill_basic_block_end_trace_row(
                        &processor.system,
                        &processor.stack,
                        basic_block_node,
                        flags.to_hasher_state_second_word(),
                    )?;
                },
                EnterForest { .. } => {
                    unreachable!(
                        "Tracer contract guarantees that EnterForest continuations do not occur here"
                    )
                },
            }

            Ok(())
        })();

        if let Err(e) = result {
            self.error_encountered = Some(e);
        }
    }
}

// HELPER FUNCTIONS
// ================================================================================================

/// Returns a reference to the node with the given ID from the forest, or an error if not found.
fn get_node_in_forest<F>(forest: &F, node_id: MastNodeId) -> Result<&MastNode, ExecutionError>
where
    F: ExecutableMastForest + ?Sized,
{
    forest
        .get_node_by_id(node_id)
        .ok_or(ExecutionError::Internal("invalid node ID stored in continuation"))
}

/// Returns the digest of the node with the given ID from the forest, or an error if not found.
///
/// Prefer this over [`get_node_in_forest`] when only the digest is needed: on a
/// [`miden_core::mast::SparseMastForest`], digest-only entries are reachable through this path
/// but not through [`get_node_in_forest`].
fn get_digest_in_forest<F>(forest: &F, node_id: MastNodeId) -> Result<Word, ExecutionError>
where
    F: ExecutableMastForest + ?Sized,
{
    forest
        .get_digest_by_id(node_id)
        .ok_or(ExecutionError::Internal("invalid node ID stored in continuation"))
}

// TESTS
// ================================================================================================

#[cfg(test)]
mod tests {
    use alloc::vec;

    use miden_core::{
        mast::{DynNodeBuilder, MastForestContributor},
        precompile::PrecompileTranscriptState,
    };

    use super::*;
    use crate::{
        ContextId,
        trace::{
            parallel::CORE_TRACE_WIDTH,
            trace_state::{
                AdviceReplay, ExecutionContextReplay, HasherResponseReplay,
                MastForestResolutionReplay, MemoryReadsReplay, StackOverflowReplay, StackState,
                SystemState,
            },
            utils::RowMajorTraceWriter,
        },
    };

    /// Ensures that `get_execution_context_for_dyncall()` correctly populates the
    /// `parent_next_overflow_addr` field of the execution context info when the stack is at
    /// MIN_STACK_DEPTH with a non-empty overflow table replay.
    ///
    /// Scenario: the stack is at MIN_STACK_DEPTH (16), but the `StackOverflowReplay` contains a
    /// pending overflow pop (representing a future pop that will occur as the stack grows beyond
    /// the minimum depth) with a non-zero overflow address. This simulates a state where the
    /// overflow table replay is non-empty, even though the stack is currently at minimum depth. In
    /// this case, `get_execution_context_for_dyncall()` should return execution context info with
    /// `parent_next_overflow_addr` equal to the stack's `last_overflow_addr` (which is ZERO),
    /// rather than peeking at the replay queue and returning the post-pop overflow address from the
    /// future/unrelated overflow pop (which is non-zero).
    ///
    /// (`last_overflow_addr != ZERO`). The overflow replay queue contains a stale entry whose
    /// post-pop overflow address is 42. The method should return the stack's `last_overflow_addr`,
    /// but instead peeks at the replay queue and returns ZERO.
    #[test]
    fn get_execution_context_for_dyncall_at_min_stack_depth_with_overflow_entries() {
        // Build a MastForest with a single DYNCALL node.
        let mut forest = miden_core::mast::MastForest::new();
        let dyncall_node_id = DynNodeBuilder::new_dyncall().add_to_forest(&mut forest).unwrap();
        // Build a sparse forest containing only the visited dyncall node (matching what the
        // execution tracer would produce for this fragment).
        let mut sparse_builder = miden_core::mast::SparseMastForestBuilder::new(Arc::new(forest));
        sparse_builder.record_visit(dyncall_node_id, miden_core::mast::VisitKind::FullVisit);
        let forest = Arc::new(sparse_builder.finalize());

        let continuation = Continuation::StartNode(dyncall_node_id);

        // Create a stack of depth 16 (and hence `last_overflow_addr == ZERO`).
        let stack = StackState::new([ZERO; MIN_STACK_DEPTH], MIN_STACK_DEPTH, ZERO);

        // Place an entry in the overflow replay queue that corresponds to a future pop (once the
        // stack will have grown beyond the minimum depth).
        let overflow_addr_of_future_pop = Felt::new_unchecked(42);
        let mut stack_overflow_replay = StackOverflowReplay::new();
        stack_overflow_replay
            .record_pop_overflow(Felt::new_unchecked(99), overflow_addr_of_future_pop);

        let system = SystemState {
            clk: 0u32.into(),
            ctx: ContextId::root(),
            fn_hash: Word::default(),
            pc_transcript_state: PrecompileTranscriptState::default(),
        };

        let processor = ReplayProcessor::new(
            system,
            stack,
            stack_overflow_replay,
            ExecutionContextReplay::default(),
            AdviceReplay::default(),
            MemoryReadsReplay::default(),
            HasherResponseReplay::default(),
            MastForestResolutionReplay::default(),
            vec![forest.clone()],
            crate::ExecutionOptions::DEFAULT_MAX_STACK_DEPTH,
            1u32.into(),
        );

        let mut buffer = vec![ZERO; CORE_TRACE_WIDTH];
        let writer = RowMajorTraceWriter::new(&mut buffer, CORE_TRACE_WIDTH);

        let tracer = CoreTraceGenerationTracer::new(
            writer,
            DecoderState { current_addr: ZERO, parent_addr: ZERO },
            BlockAddressReplay::default(),
            BlockStackReplay::default(),
        );

        // Call the method under test.
        let ctx_info = tracer
            .get_execution_context_for_dyncall(&forest, &continuation, &processor)
            .expect("replay should not fail")
            .expect("should return Some for a DYNCALL StartNode continuation");

        // check for bug: When the stack is at MIN_STACK_DEPTH with a non-empty overflow table
        // replay queue, parent_next_overflow_addr should reflect the current overflow state of
        // ZERO; NOT the non-zero overflow address from the future pop in the replay queue (which
        // would indicate an incorrect peek at the replay queue).
        assert_eq!(
            ctx_info.parent_next_overflow_addr, ZERO,
            "parent_next_overflow_addr should be ZERO, reflecting the current overflow state of the stack, \
            and should not reflect the non-zero overflow address from the future pop in the replay queue"
        );
    }
}