Link-Time Optimization of Address Calculation on a 64-bit Architecture (1994)
| Citations: | 90 - 12 self |
BibTeX
@INPROCEEDINGS{Srivastava94link-timeoptimization,
author = {Amitabh Srivastava and David W. Wall},
title = {Link-Time Optimization of Address Calculation on a 64-bit Architecture},
booktitle = {},
year = {1994},
pages = {49--60}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Compilers for new machines with 64-bit addresses must generate code that works when the memory used by the program is large. Procedures and global variables are accessed indirectly via global address tables, and calling conventions include code to establish the addressability of the appropriate tables. In the common case of a program that does not require a lot of memory, all of this can be simplified considerably, with a corresponding reduction in program size and execution time. We have used our link-time code modification system OM to perform program transformations related to global address use on the Alpha AXP. Though simple, many of these are whole-program optimizations that can be done only when we can see the entire program at once, so link-time is an ideal occasion to perform them. This paper describes the optimizations performed and shows their effects on program size and performance. Relatively modest transformations, possible without moving code, improve the p...
Citations
No citations identified.
