Abstract

The ability to predict at compile time the likelihood of a particular branch being taken provides valuable information for several optimizations, including global instruction scheduling, code layout, function inlining, interprocedural register allocation and many high level optimizations. Previous attempts at static branch prediction have either used simple heuristics, which can be quite inaccurate, or put the burden onto the programmer by using execution profiling data or source code hints. This paper presents a new approach to static branch prediction called value range propagation. This method tracks the weighted value ranges of variables through a program, much like constant propagation. These value ranges may be either numeric or symbolic in nature. Branch prediction is then performed by simply consulting the value range of the appropriate variable. Heuristics are used as a fallback for cases where the value range of the variable cannot be determined statically. In the process, va...

Citations

255	Optimally Profiling and Tracing Programs - Ball, Larus - 1994
249	HANSEN: Profile Guided Code Positioning - PETTIS, C - 1990
116	Using profile information to assist classic code optimizations - Chang, Mahlke, et al. - 1991
76	Compiler analysis of the value ranges for variables - Harrison - 1977
39	Symbolic evaluation and the global value graph - Reif, Lewis - 1977
3	Support for Programming Languages and Operating Systems - McFarling, Hennessy - 1989
2	Banerjee88] Utpal Banerjee. Dependence Analysis for Supercomputing - Callahan, Cooper, et al. - 1993