Run-Time Storage Organization.ppt

Run-Time Storage Organization 66.648 Compiler Design Lecture (03/23/98) Computer Science Rensselaer Polytechnic Lecture Outline Run-Time Storage Organization Examples Administration Run-Time Storage Organization A program obtains a single contiguous block of storage (virtual memory) from the operating system at the start of program execution. The generated code assumes a subdivision of the storage into different areas/ Code -- this area contains the generated target code for all procedures in the program. The size of this can be determined statically by the compiler/linker. Static Data Static Data-- this area contains global data objects whose size can be determined statically at compile time. Static variables are mapped to offsets in the static data area. Stack Stack--runtime stack of activation records reflecting the stack structure of dynamic procedure calls and returns. An activation record contains the information needed by a single procedure call. Local variables are mapped to offsets in the activation record. Heap Heap -- used to store all other program data (data that is dynamically sized or data with lifetime pattern that cannot be represented in the run-time stack). Heap data allocation incurs more overhead than static or stack data allocation. Languages and Storage Organization Fortran - Static Pascal - Stack/heap C Stack/Heap Activation Record Public class X { public static void main(String argsv[]) { int n; n =10; System.out.println(fib(n)); } int fib(int n) { if (n==0) return 1 else if (n==1) return 1 else return(fib(n-1)+fib(n-2)); }} Compile Time Layout of Local Data Local variables offsets are calculated depending on its size. These offsets can be computed relative to the start of the stack frame, and can be used to specify the layout of local data in the stack frame. Local variables accesses get translated to negative-valued offsets on the stack pointer. Non-Local Variable An access to a lexically scoped nonlocal variable gets translated to le