Efficient and Effective Branch Reordering Using Profile Data
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on deeper pipelines and higher multiple issue. Reducing the number of conditional branches executed often results in a substantial performance benefit. This paper describes a code-improving transformation to reorder sequences of conditional branches that compare a common variable to constants. The goal is to obtain an ordering where the fewest average number of branches in the sequence will be executed. First, sequences of branches that can be reordered are detected in the control flow. Second, profiling information is collected to predict the probability that each branch will transfer control out of the sequence. Third, the cost of performing each conditional branch is estimated. Fourth, the most beneficial ordering of the branches based on the estimated probability and cost is selected. The most beneficial ordering often includes the insertion of additional conditional branches that did not previously exist in the sequence. Finally, the control flow is restructured to reflect the new ordering. The results of applying the transformation are on average reductions of about 8%; fewer instructions executed and 13%; branches performed, as well as about a 4%; decrease in execution time.
Yang, Minghui; Uh, Gang-Ryung; and Whalley, David B.. (2002). "Efficient and Effective Branch Reordering Using Profile Data". ACM Transactions on Programming Languages and Systems (TOPLAS), 24(6), 667-697. http://dx.doi.org/10.1145/586088.586091