Chapter 7 Runtime Environments Section 0 Overview.ppt

Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (3) access links P0 P1 P2 Call P2 Call P1 TOP Top-SP P2 P1 P0 Access link Access link Access link Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (3) access links TOP Top-SP P2 P1 P0 Access link Access link Access link P0 P1 P2 Call P2 Call P1 Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (4) displays Faster access to global than with access links can be obtained using an array d of pointers to activation records, called a display. Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (4) displays Suppose control is in an activation of a procedure pj at nesting depth j, then the display of activation of pj is: j－1 Sp for p0 …… Sp for pj-1 Sp for pj j 0 d[j+1] Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (4) displays When a new activation record for a procedure at nesting depth i is setup, we A) save the value of d[i] in the new activation record; B) set d[i] to point to the new activation record. Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures (5) non-displays non-display of current procedure =non-display of caller+start address of current local activation record Chapter 7 Runtime Environments Section 2 Storage allocation strategies 4. Stack allocation 4)Stack allocation for nested procedures Caller’s SP Calling Return address Amount of parameters Formal parameters Local data Array data Temporaries Returned value Local display global display Chapter 7 Runtime Environments Section 2 Storage allocation strategies