Chapter 9 Subprogram Control.ppt

Chapter 9 Subprogram Control Consider program as a tree- Each parent calls (transfers control to) child Parent resumes when child completes Copy rule – consider child code as copied into parent Subprogram used to Separate program into logical units Execute functions with different parameters Recursion Must maintain storage for multiple copies of data Code is reentrant – stored separately Storage for return address and data Indirect recursion We do not know the number of times that our code or data will be copied PL/1 – specific statement – is recursive Non-recursive subprogram does not need stack implementation Execution structure Child is explicitly called (exceptions are not) Entrance at top or elsewhere FORTRAN, coroutines (resume) Scheduled subprogram call can delay transfer of control Coroutines have multiple activation records active at one time but single thread of control – their execution can be traced Tasks have multiple activation records active at one time and conceptually allow multiple threads of control Implementation of non-recursive routines For execution efficiency Code and data may be joined, with code directly referencing data address Return address stored in no-op at top of subroutine code Last statement of subroutine is branch to first address, indirectly For reliability, may require that code be stored separately (non self modifying code) Cost in storage of all (but smaller) activation records during program’s lifetime Implementation for recursive routines Activation records (frames) on stack contain Caller’s return address (next CIP) Parameters Local variables Return value for functions and temps Ptr to parent activation record (static chain ptr) Ptr to caller’s activation record (dynamic chain ptr) Register contains PC (Current Instruction Ptr) Register contains base address of activation record (current environment pointer) Register contains stack pointer Storage map in general System and program code Static variables Activation records –