Optimization on array bound check and redundancy elimination
V. Vijay Kumar, K. V. N. Sunitha · International Conference on Systems · 2005
Compiler optimization technology has been steadily advancing as more sophisticated processors hit the market. For high end embedded processors, today's most advanced compilers take advantage of both CPU specific and application specific information to optimize code intelligently for optimal result. This paper discusses one such sophisticated optimization technique which combines array bound check optimization together with redundancy elimination combined with folding. The array bound check optimization described in this paper reduces the run time overhead by eliminating unnecessary bound checks. The results and comparisons demonstrate number of advantages of this method over the existing methods.