Abstract
The use of a standard binary format in the later part of code generation promotes efficiency and interchangeability of tools, but leaves little information on the source file in the machine code representation. We propose a new approach to code generation, based on a single, highly structured internal format used during proper compilation, machine code generation and linkage. This format offers new opportunities for whole-program optimizations. We have implemented and tested a code generator based on this format. Although the use of traditional a binary format is more efficient, we believe that the increase in code size and compilation times are largely compensated by the opportunities offered by this new trajectory. To support this assertion, we discuss some of its potential applications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andrea G. M. Cilio, Irenusz Karkowski, and Henk Corporaal. Fixed-point Arithmetic for ASIP Code Generation. In Proceedings of the 4th conference of the Advanced School for Computing and Imaging, June 1998.
Henk Corporaal. Microprocessor Architectures; from VLIW to TTA. John Wiley, 1997. ISBN 0-471-97157-X.
Brian Deitrich, Ben-Chung Cheng, and Wen-mei W. Hwu. Improving static branch prediction in a compiler. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 1998.
Jack Greenbaum. Generating Object Files Directly from SUIF/MACHSUIF Using GNU libbfd.a. In Proceedings of the Second SUIF workshop, August 1997.
Stanford Compiler Group. The SUIF Library. Stanford University, 1994.
Joseph Hummel, Laurie J. Hendren, and Alexandru Nicolau. A general data dependence test for dynamic, pointer-based data structures. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, June 1994.
Wen-mei W. Hwu et al. and Compiler technology for future microprocessors. IEEE Transactions on Computers, 41(12):1625–1640, December 1995.
Johan Janssen and Henk Corporaal. Registers on demand: an integrated region scheduler and register allocator. In Conference on Compiler Construction, April 1998.
Clifford Liem. Retargetable Compilers for Embedded Core Processors. Kluwer Academic Publishers, 1997. ISBN 0-7923-9959-5.
Michael D. Smith. Extending SUIF for Machine-dependent Optimizations. In Proceedings of the First SUIF Worshop, January 1996.
Amitabh Srivastava and David W. Wall. A practical system for intermodule code optimization at link-time. Technical Report 6, Western Research Laboratory, Digital Equipment Corporation, December 1992.
David W. Wall. Global register allocation at link time. Technical Report 6, Western Research Laboratory, Digital Equipment Corporation, October, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Cilio, A.G.M., Corporaal, H. (1999). A linker for effective whole-program optimizations. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100625
Download citation
DOI: https://doi.org/10.1007/BFb0100625
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65821-4
Online ISBN: 978-3-540-48933-7
eBook Packages: Springer Book Archive