Method for optimizing array bounds checks in programs

作者: Manish Gupta , Samuel Pratt Midkiff , Jose Eduardo Moreira

DOI:

关键词:

摘要: A method and several variants for optimizing the detection of out bounds array references in computer programs are described, while preserving semantics program. Depending on variant implemented, program is divided at run-time or compile-time into two more regions. The regions differentiated by number checks that need to be performed accesses within region. In particular, some will not any run-time, which increase speed executes. As well, state variables time access detected same as would have been had transformation performed. Moreover, needing known compile-time, enabling further compiler optimizations distinguished created, needed size results from optimization.

参考文章(9)
William N. Joy, Marc Tremblay, James Michael O'Connor, Processor with accelerated array access bounds checking ,(1997)
Marc Tremblay, James Michael O'Connor, Look-up switch accelerator and method of operating same ,(1997)
Victoria Markstein, John Cocke, Peter Markstein, Optimization of range checking compiler construction. ,vol. 39, pp. 114- 119 ,(1982) , 10.1145/800230.806986
Douglas M. Pase, Janet M. Eberhart, Thomas A. MacDonald, Method for the dynamic allocation of array sizes in a multiprocessor system ,(1993)