Add CALL and RET Support for Subroutines

Subroutine Call Mechanism

CALL saves the return address (current PC) on the stack and jumps to a subroutine. RET pops that address back into PC, resuming the caller. This is how main invokes printf without losing its place.

cCopy
Loading…

Stack Frame Layout

On entry, callees often save frame pointer and allocate locals:

• Caller pushes arguments (or passes in registers per ABI)
• CALL pushes return address
• Callee saves BP, adjusts SP for locals
• RET reverses the sequence

For example, if PC=0x100 when CALL executes at 0x50, the stack holds 0x51 (address of the next instruction) and PC jumps to the function entry.

For this exercise, you will extend your stack with CALL and RET opcodes. You will need nested calls working before the pipeline tasks, because mispredicted returns are a classic branch-predictor failure mode in real silicon.

Working Through the Exercise

Keep the relevant datasheet, ISA manual, or architecture textbook chapter open while you implement. When your output disagrees with the reference trace on the same program, the bug is usually a mis-decoded opcode, a stale register read, or a flag bit left unchanged after arithmetic.

• Trace first: walk one failing input by hand before changing random lines
• Read the manual: skim the official doc for the mechanism named in this task
• Compare baselines: save measurements from the prior step so speedups are honest

For this exercise, you will use those habits while implementing the requirement in the starter code. Microarchitectural product names change across CPU generations, but the control ideas (fetch, bypass, cache lines, vector lanes) stay stable enough to debug from first principles.