PPT: Run Time Storage Organization | Compiler Design - Computer Science Engineering (CSE) PDF Download

 Page 1


Run-Time Environments
Page 2


Run-Time Environments
Outline
? Compiler must do the storage allocation and provide
access to variables and data
? Memory management
? Stack allocation
? Heap management
? Garbage collection
Page 3


Run-Time Environments
Outline
? Compiler must do the storage allocation and provide
access to variables and data
? Memory management
? Stack allocation
? Heap management
? Garbage collection
Storage Organization
Page 4


Run-Time Environments
Outline
? Compiler must do the storage allocation and provide
access to variables and data
? Memory management
? Stack allocation
? Heap management
? Garbage collection
Storage Organization Static vs. Dynamic Allocation
? Static: Compile time, Dynamic: Runtime allocation
? Many compilers use some combination of following
? Stack storage: for local variables, parameters and so on
? Heap storage: Data that may outlive the call to the
procedure that created it
? Stack allocation is a valid allocation for procedures
since procedure calls are nested
Page 5


Run-Time Environments
Outline
? Compiler must do the storage allocation and provide
access to variables and data
? Memory management
? Stack allocation
? Heap management
? Garbage collection
Storage Organization Static vs. Dynamic Allocation
? Static: Compile time, Dynamic: Runtime allocation
? Many compilers use some combination of following
? Stack storage: for local variables, parameters and so on
? Heap storage: Data that may outlive the call to the
procedure that created it
? Stack allocation is a valid allocation for procedures
since procedure calls are nested
Sketch of a quicksort program