NDLI: Data descriptors: a compile-time model of data and addressing

Content Provider	ACM Digital Library
Author	Holt, R. C.
Copyright Year	1987
Abstract	Data descriptors, which have evolved from Wilcox's value descriptors [16], are a notation for representing run-time data objects at compile time. One of the principal reasons for developing this notation was to aid in the rapid construction of code generators, especially for new microprocessors. Each data descriptor contains a base, a displacement, and a level of indirection. For example, a variable $\textit{x}$ lying at displacement 28 from base register B3 is represented by this data descriptor: @B3.28. The general form of a data descriptor is $@\textit{kb.d.i}$ where $\textit{k}$ gives the number of levels of indirection, $\textit{b}$ is a base, $\textit{d}$ is a displacement, and $\textit{I}$ is an index.Data descriptors are convenient for representing addressing in Fortran (with static allocation and common blocks), in Pascal and Turing (with automatic allocation and stack frames), and in more general languages such as Euclid and PL/I. This generality of data descriptors allows code generation to be largely independent of the source language.Data descriptors are able to encode the addressing modes of typical computer architectures such as the IBM 360 and the PDP-11. This generality of data descriptors allows code generation to be largely machine independent.This paper gives a machine independent method of storage allocation that uses data descriptors. Techniques are given for local optimization of basic arithmetic and addressing code using data descriptors. Target machine dependencies are isolated so that the part of the code generator that handles high-level addressing (such as subscripting) is machine independent. The techniques described in this paper have proven effective in the rapid development of a number of production code generators.
Starting Page	367
Ending Page	389
Page Count	23
File Format	PDF
ISSN	01640925
e-ISSN	15584593
DOI	10.1145/24039.24051
Volume Number	9
Issue Number	3
Journal	ACM Transactions on Programming Languages and Systems (TOPLAS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1987-07-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Multiprocessing Approach to Compile-Time Symbol Resolution

Explicit data placement (XDP):a methodology for explicit compile-time representation and optimization of data movement

A software science model of compile time

Data buffering: run-time versus compile-time support

Domain specific language implementation via compile-time meta-programming

Explicit data placement (XDP)(extended abstract): a methodology for explicit compile-time representation and optimization of data movement

A Compile-Time Optimization Method for WCET Reduction in Real-Time Embedded Systems through Block Formation

A position paper on compile-time program analysis

Reducing false sharing on shared memory multiprocessors through compile time data transformations

Data descriptors: a compile-time model of data and addressing

Similar Documents

A Multiprocessing Approach to Compile-Time Symbol Resolution

Explicit data placement (XDP):a methodology for explicit compile-time representation and optimization of data movement

A software science model of compile time

Data buffering: run-time versus compile-time support

Domain specific language implementation via compile-time meta-programming

Explicit data placement (XDP)(extended abstract): a methodology for explicit compile-time representation and optimization of data movement

A Compile-Time Optimization Method for WCET Reduction in Real-Time Embedded Systems through Block Formation

A position paper on compile-time program analysis

Reducing false sharing on shared memory multiprocessors through compile time data transformations

Data descriptors: a compile-time model of data and addressing