1 / 11

RUN-TIME STORAGE

RUN-TIME STORAGE. Chuen-Liang Chen Department of Computer Science and Information Engineering National Taiwan University Taipei, TAIWAN. typical program layout. each block can be allocated to a “segment” under segmented memory system

mirandaroberts
Télécharger la présentation

RUN-TIME STORAGE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. RUN-TIME STORAGE Chuen-Liang Chen Department of Computer Science and Information Engineering National Taiwan University Taipei, TAIWAN

  2. typical program layout each block can be allocated to a “segment” under segmented memory system operand stack is required for some computer; Its size can be determined at compile-time Program layout (1/2) highest address heap space stack space have to check collision dynamic static data literal pool program code for library and separately compiled modules static added by linker/loader static data literal pool read only program code read only eg. used by O.S reserved locations lowest address

  3. Program layout (2/2) • for load-and-go compiler highest address static data and literal pool heap space stack space generated iteratively program code library modules reserved locations lowest address

  4. Static allocation • space is allocated in fixed location for the life-time of a program • applicable only when the number and size of data objects is known at compile-time • suitable for • global variables • literals (or put them on a separate “literal pool” ) • the only choice for early language (e.g. without recursion) • preferable to address a data object as (DataArea, Offset) and binding DataArea at link-time

  5. Heap allocation • space is allocated and freed at any time and in any order • suitable for dynamic memory allocation/deallocation • allocation -- in demand • best-fit • first-fit • circular-first-fit • QUIZ: comparison • deallocation • no deallocation (work for implementations with a large virtual memory) • explicit deallocation • implicit deallocation • single reference • reference count • mark-and-sweep garbage collection [ + compaction] • QUIZ: comparison • free-space representation -- bit map, linked list

  6. Stack allocation (1/2) • suitable for recursive call • activation record (AR) -- data space required for a call • push / pop, when “call” / “return” • example -- procedure p(a:integer) is b: real; c: array (1..10) of real; d,e : array (1..N) of integer; begin b := c(a) * 2.51; end; • 2.51 is stored in literal pool • dope vector -- fixed size descriptor for dynamic array; containing size and bounds of array (determined at run-time) space for e determined at run-time space for d pointer to e pointer to d dope vector determined at compile-time c b a control information register Offset = 0

  7. Stack allocation (2/2) • when too many recursive callsÞ too many AR Þ too many registers • solutions: display registers & static and dynamic chains • QUIZ: coroutine? • QUIZ: variable declaration within block?

  8. program runtimestack active scopes (display) of P1 R1 Q1 Q2 S1 S2 R2 P2 P3 Q3 R3 P() int a R3: c 2 Q3: b, S 2 Q() int b P3: a, Q, R 1 1 1 P2: a, Q, R 1 S() int d R2: c 2 P;a,Q,R;b,S;d S2: d 3 S1: d 3 P;a,Q,R;b,S Q2: b, S 2 2 2 R() int c Q1: b, S 2 R1: c 2 P;a,Q,R;c P1: a, Q, R 1 1 1 1 1 1 1 P;a,Q,R Display registers (1/2) • observation (by scoping rules) --at most one active scope for one static nesting level at any time • example --

  9. Display registers (2/2) • strategy -- allocating one display register for one static nesting level • have to be modified when routine call / return • QUIZ: detailed implementation

  10. R3: c Q3: b, S 2 P3: a, Q, R 2 P2: a, Q, R 1 1 1 R2: c 1 S2: d 2 S1: d 3 Q2: b, S 3 Q1: b, S 2 2 2 R1: c 2 P1: a, Q, R 2 1 1 1 1 1 1 1 Static and dynamic chains • using one register only; point to uppermost AR • static chain -- alternative implementation of a display • dynamic chain -- list of AR entry on run-time stack, to restore activation register • example -- runtimestack active scopes (display) of P1 R1 Q1 Q2 S1 S2 R2 P2 P3 Q3 R3 activationregister dynamic chain static chain

  11. Advanced features • formal procedure • QUIZ: how?

More Related