mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
b072cf7882
Patch by Michele Scandale! Rewrite of the functions used to compute the backedge taken count of a loop on LT and GT comparisons. I decided to split the handling of LT and GT cases becasue the trick "a > b == -a < -b" in some cases prevents the trip count computation due to the multiplication by -1 on the two operands of the comparison. This issue comes from the conservative computation of value range of SCEVs: taking the negative SCEV of an expression that have a small positive range (e.g. [0,31]), we would have a SCEV with a fullset as value range. Indeed, in the new rewritten function I tried to better handle the maximum backedge taken count computation when MAX/MIN expression are used to handle the cases where no entry guard is found. Some test have been modified in order to check the new value correctly (I manually check them and reasoning on possible overflow the new values seem correct). I finally added a new test case related to the multiplication by -1 issue on GT comparisons. llvm-svn: 194116
23 lines
523 B
LLVM
23 lines
523 B
LLVM
; RUN: opt < %s -analyze -scalar-evolution 2>&1 | FileCheck %s
|
|
|
|
; CHECK: /u 5
|
|
|
|
define i8 @foo0(i8 %i0) nounwind {
|
|
entry:
|
|
br label %bb1
|
|
|
|
bb: ; preds = %bb1
|
|
%0 = add i8 %j.0, 1 ; <i8> [#uses=1]
|
|
%1 = add i8 %i.0, 5 ; <i8> [#uses=1]
|
|
br label %bb1
|
|
|
|
bb1: ; preds = %bb, %entry
|
|
%j.0 = phi i8 [ 0, %entry ], [ %0, %bb ] ; <i8> [#uses=2]
|
|
%i.0 = phi i8 [ %i0, %entry ], [ %1, %bb ] ; <i8> [#uses=2]
|
|
%2 = icmp sgt i8 %i.0, 100 ; <i1> [#uses=1]
|
|
br i1 %2, label %return, label %bb
|
|
|
|
return: ; preds = %bb1
|
|
ret i8 %j.0
|
|
}
|