Optimization of range checking

ABSTRACT

An analysis is given for optimizing run-time range checks in regions of high execution frequency. These optimizations are accomplished using strength reduction, code motion and common subexpression elimination. Test programs, using the above optimizations, are used to illustrate run-time improvements.

REFERENCES

• 1: George Radin, The 801 minicomputer, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.39-47, March 01-03, 1982, Palo Alto, California, United States
• 2: Marc Auslander , Martin Hopkins, An overview of the PL.8 compiler, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.22-31, June 23-25, 1982, Boston, Massachusetts, United States
• 3: Rajiv Gupta, A fresh look at optimizing array bound checking, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.272-282, June 1990, White Plains, New York, United States
• 4: Rajiv Gupta, Optimizing array bound checks using flow analysis, ACM Letters on Programming Languages and Systems (LOPLAS), v.2 n.1-4, p.135-150, March–Dec. 1993 [doi>10.1145/176454.176507]
• 5: K. John Gough, Herbert Klären, Eliminating Range Checks Using Static Single Assignment Form, Proc. 19th Australasian Computer Conference, Melbourne, Australia, 1996
• 6: XL Fortran for AIX Users' Guide, IBM Corp. Form SC09-4946
• 7: Kevin O'Brien, Bill Hay, Joanne Minish, Hartmann Schaffer, Bob Schloss, Arvin Shepherd, Matthew Zaleski, Advanced Compiler Technology for the RISC System/6000 Architecture, IBM RISC System/6000 Technology, IBM Corp., Armonk NY (1990)
• 8: F. E. Allen , J. Cocke, A program data flow analysis procedure, Communications of the ACM, v.19 n.3, p.137, March 1976 [doi>10.1145/360018.360025]
• 9: Cocke J. and Markstein P., Measurement of Code Improvement Algorithms, Proceedings of IFIPS (1980); 221--228.
• 10: Harrison W., Compiler Analysis of the Value Ranges for Variables, IEEE Transactions of Software Engineering, (May 1977); 243--250.
• 11: Schwartz J. T., On Programming - An Interim Report on the SETL Project. Installment II: The SETL Language and Examples of Its Use, Courant Institute of Mathematical Sciences, N.Y.U., (1973); 293--310.
• 12: Welsh, J., Economic Range Checks in Pascal, Software - Practice and Experience, (1978); Vol. 8, 85--97