Explore: Subroutine Call

programming, a function (also procedure, method, subroutine, routine, or subprogram) is a callable unit of software logic that has a well-defined interface

In computer science, a call stack is a stack data structure that stores information about the active subroutines and inline blocks of a computer program

where the code has a form that essentially consists entirely of calls to subroutines. It is often used in compilers, which may generate code in that form

function calling convention (a subroutine call on the assembly level) for using the system call, as well as making the system call more modular. Here, the primary

a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said

a subroutine call completes. This is more efficient than the more traditional scheme of storing return addresses on a call stack, sometimes called a machine

standard subroutine CALL address and RET instructions, though they can be simulated. The 16-register design makes possible some interesting subroutine call and

good candidates to fuse with jalr, addi, loads or stores. RISC-V's subroutine call jal (jump and link) places its return address in a register. This is

arguments before the call and then passes the resulting values to the subroutine. In the rival "call by name" approach, the subroutine receives the unevaluated

provides that the next instruction is fetched from elsewhere in memory. A subroutine call not only branches but saves the preceding contents of the PC somewhere