Abstract
Programs manipulating data at subword level are growing in number and importance. Examples are programs running on network processors, media processors, or general purpose processors with media extensions. In addition data compression techniques which are vital for embedded system applications result in code operating on subword level as well. Performing analysis on word level, however, is too coarse grain missing opportunities for optimizations. In this paper we introduce a novel program representation which allows reasoning at subword level. This is achieved by making accesses to subwords explicit. First in a local phase statements are analyzed and accesses at subword level identified. Then in a global phase the control-flow is taken into account and the accesses are related to one another. As a result various traditional analyses can be performed on our representation at subword level very easily. We discuss the algorithms for constructing the program representation in detail and illustrate their application with examples.
Supported by DARPA PAC/C Award. F29601-00-1-0183 and NSF grants CCR- 0105355, CCR-0096122, EIA-9806525, and EIA-0080123 to the Univ. of Arizona.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. M. Conte, P. K. Dubey, M. D. Jennings, R. B. Lee, A. Peleg, S. Rathnam, M. Schlansker, P. Song, and A. Wolfe, “Challenges of Combining General-Purpose and Multimedia Processors,” IEEE Computer, Vol. 30, No. 12, pages 33–37, Dec. 1997.
J. Davidson and S. Jinturkar, “Memory access coalescing: a technique for eliminating redundant memory accesses,” ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 186–195, 1994.
J. Fridman, “Data Alignment for Sub-Word Parallelism in DSP,” IEEE Workshop on Signal Processing Systems (SiPS), pages 251–260, 1999.
S. Larsen and S. Amarasinghe, “Exploiting Superword Level Parallelism with Multimedia Instruction Sets,” ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pages 145–156, Vancouver B. C., Canada, June 2000.
X. Nie, L. Gazsi, F. Engel, and G. Fettweis, “A New Network Processor Architecture for High Speed Communications,” IEEE Workshop on Signal Processing Systems (SiPS), pages 548–557, 1999.
A. Peleg and U. Weiser, “MMX Technology Extension to Intel Architecture,” IEEE Computer, 16(4):42–50, August 1996.
M. Stephenson, J. Babb, and S. Amarasinghe, “Bitwidth Analysis with Application to Silicon Compilation,” ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI), pages 108–120, Vancouver B. C., Canada, June 2000.
J. Wagner and R. Leupers, “C Compiler Design for an Industrial Network Processor,” ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), pages 155–164, June 2001.
Y. Zhang and R. Gupta, “Data Compression Transformations for Dynamically Allocated Data Structures,” International Conference on Compiler Construction (CC), Grenoble, France, April 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, R., Mehofer, E., Zhang, Y. (2002). A Representation for Bit Section Based Analysis and Optimization. In: Horspool, R.N. (eds) Compiler Construction. CC 2002. Lecture Notes in Computer Science, vol 2304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45937-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-45937-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43369-9
Online ISBN: 978-3-540-45937-8
eBook Packages: Springer Book Archive