编译原理-全动态内存管理.pptVIP

Chapter 7 Dynamic Memory Parameter Passing Mechanisms Instructor Jianhui Yue Software College @SCU compilerscu@21 Limitations of Stack-Based Environment If a reference to a local variable in a procedure can be returned to the caller, the result will be dangling reference. When the procedure is exited, the activation record will be deallocated from the stack. addr = dangle() causes addr to point to an unsafe location. Such program is erroneous in C. (No compiler will give an error message) Limitations of Stack-Based Environment (cont) C prohibits local procedures. Functional programming languages (LISP, ML) Functions must be able to be locally defined Passed as parameters Returned as results. Stack-based runtime environment is inadequate for these languages. Fully Dynamic Environment It can deallocate activation records only when all references to them have disappeared. Activation records can be dynamically freed at arbitrary times during execution. Fully dynamic environment is more complicated. Tracking the references during execution. Finding and deallocating inaccessible areas of memory at arbitrary times during execution (garbage collection). Activation Records The basic structure of an activation record remains the same: Space for parameters and local variables. Control and access links. The exited activation record remains in memory, to be deallocated at some later time. The entire additional complexity can be encapsulated in a memory manager that replaces the runtime stack operations with more general allocation and deallocation routines. Object-Oriented Languages OO languages require special mechanisms in the runtime environment to implement their added features: Objects Methods Inheritance Dynamic binding OO languages vary in their requirements for the runtime environment: C++ retains the stack-based environment of C, no automatic dynamic memory management Smalltalk requires fully dynamic environment similar to LISP Implementation of Objects K