Automatic generation of peephole optimizations

ACM SIGPLAN Notices

Volumn 39, Issue 4, 2004, Pages 104-105

  Davidson, Jack W ^a   Fraser, Christopher W ^b  

^a University of Virginia   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PEEPHOLE OPTIMIZERS (PO); RETARGETABLE COMPILERS; TRANSLATION GRAMMAR;

ALGORITHMS; CODE CONVERTERS; CODES (SYMBOLS); COMPUTER NETWORKS; COMPUTER SOFTWARE; OPTIMIZATION; PROGRAM COMPILERS;

COMPUTER PROGRAMMING;

EID: 3142770711     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/989393.989407     Document Type: Conference Paper

References (33)

1. Manuel E. Benitez and Jack W. Davidson. Code generation for streaming: an access/execute mechanism. ASPLOS'91:132-141, 4/91.
2. Manuel E. Benitez. Register Allocation and Phase Interactions in a Retargetable Optimizing Compiler. Ph.D. dissertation, Univ. of Virginia, Charlottesville, VA, 1994.
3. Manuel E. Benitez and Jack W. Davidson. The advantages of machine-dependent global optimization. PLSA'94:105-124, 3/94.
4. Christina Cifuentes and Mike Van Emmerik. UQBT: Adaptable binary translation at low cost. IEEE Computer 33(3):60-66, 3/2000.
5. Jack W. Davidson and Christopher W. Fraser. The design and application of a retargetable peephole optimizer. ACM TOPLAS 2(2):191-202, 4/80.
6. Jack W. Davidson. Simplifying Code Generation Through Peephole Optimization. Ph.D. dissertation, Univ. of Arizona, Tucson, AZ, 1981.
7. Jack W. Davidson and Christopher W. Fraser. Eliminating redundant object code. POPL '52:128-132, 1/82.
8. Jack W. Davidson and Christopher W. Fraser. Automatic generation of peephole optimizations. CC'84:111-116, 6/84.
9. Jack W. Davidson and Christopher W. Fraser. Register allocation and exhaustive peephole optimization. Software - Practice&Experience 14(9):857-865, 9/84.
10. Jack W. Davidson and Christopher W. Fraser. Code selection through object code optimization. ACM TOPLAS 6(4):505-526, 10/84.
11. Jack W. Davidson and Christopher W. Fraser. Automatic inference and fast interpretation of peephole optimization rules. Software - Practice&Experience 17(11):801-812, 11/87.
12. Jack W. Davidson and Sanjay Jinturkar. Memory access coalescing: a technique for eliminating redundant memory accesses. PLDI'94:186-195, 6/94.
13. Jack W. Davidson and David B. Whalley. Quick compilers using peephole optimizations. Software - Practice&Experience 19(1):195-203, 1/89.
14. Christopher W. Fraser. A compact, machine-independent peephole optimizer. POPL'79:1-6, 1/79.
15. Christopher W. Fraser and Alan L. Wendt. Automatic generation of fast optimizing code generators. PLDI'88:79-84, 6/88.
16. Robert Giegerich. A formal framework for the derivation of machine-specific optimizers. ACM TOPLAS 5(3):478-498, 7/83.
17. Craig Hansen. MicroUnity's MediaProcessor architecture. IEEE Micro 16(4):34-41, 8/96.
18. David R. Hanson. The Y programming language. SIGPLAN Notices 16(2):59-68, 2/81.
19. Christopher Healy, Mikael Sjödin, Viresh Rustagi, and David Whalley. Bounding loop iterations for timing analysis. RTAS'98:12-21, 6/98.
20. Andy Johnson, James Loveluck, and Ira Goldstein. The ANDF technology program at the OSF RI. OSF/RI Technical Report, Cambridge, MA and Grenoble, France, 1992.
21. Sungjoon Jung and Yunheung Paek. The very portable optimizer for digital signal processors. Proc. of the 2001 Intl. Conf. on Compilers, Architecture, and Synthesis for Embedded Systems:84-92, 11/01.
22. Peter B. Kessler. Discovering machine-specific code improvements. CC'86:249-254, 6/86.
23. Robert R. Kessler. Peep - An architectural description driven peephole optimizer. CC'84:106-110, 6/84.
24. Jinhwan Kim, Sungjoon Jung, Yunheung Paek and Gang-Ryung Uh. Experience with a retargetable compiler for a commercial network processor. Proc. of the 2002 Intl. Conf. on Compilers, Architecture, and Synthesis for Embedded Systems:178-187, 10/02.
25. W. M. McKeeman. Peephole optimization. CACM 8(7):443-444, 7/65.
26. B. J. McKenzie. Fast peephole optimization techniques. Software - Practice&Experience 19(12):1151-1162, 12/89.
27. Frank Mueller and David Whalley. Avoiding unconditional branches by code replication. PLDI'92:322-330, 6/92.
28. Frank Mueller and David Whalley. Fast instruction cache analysis via static cache simulation. Proc. of the 28th Annual Simulation Symposium:105-114, 4/95.
29. Richard M. Stallman. Using the GNU Compiler Collection. Free Software Foundation, 4/02.
30. Gang-Ryung Uh and David Whalley. Coalescing conditional branches into efficient indirect jumps. Proc. of the Static Analysis Symposium:315-329, 9/97.
31. Randall T. White, Frank Mueller, Christopher A. Healy, David B. Whalley, and Marion G. Harmon. Timing analysis for data caches and set-associative caches. RTAS'97:192-202, 6/97.
32. William Wulf, Richard K. Johnsson, Charles B. Weinstock, Steven O. Hobbs, and Charles M. Geschke. The Design of an Optimizing Compiler. Elsevier, New York, 1975.
33. Minghuo Yang, Gang-Ryung Uh, and David B. Whalley. Efficient and effective branch reordering using profile data. ACM TOPLAS, to appear.