1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-31 12:41:49 +01:00

ValueTracking: Don't recurse too deeply in computeKnownBitsFromAssume

Respect the MaxDepth recursion limit, doing otherwise will trigger an
assert in computeKnownBits.

This fixes PR21891.

llvm-svn: 224168
This commit is contained in:
David Majnemer 2014-12-12 23:59:29 +00:00
parent b5c6a89ee6
commit 70ded5026c
2 changed files with 22 additions and 0 deletions

View File

@ -511,6 +511,10 @@ static void computeKnownBitsFromAssume(Value *V, APInt &KnownZero,
return;
}
// The remaining tests are all recursive, so bail out if we hit the limit.
if (Depth == MaxDepth)
continue;
Value *A, *B;
auto m_V = m_CombineOr(m_Specific(V),
m_CombineOr(m_PtrToInt(m_Specific(V)),

View File

@ -0,0 +1,18 @@
; RUN: opt %s -instcombine
define i32 @f(i32 %theNumber) {
entry:
%cmp = icmp sgt i32 %theNumber, -1
call void @llvm.assume(i1 %cmp)
br i1 true, label %if.then, label %if.end
if.then: ; preds = %entry
%shl = shl nuw i32 %theNumber, 1
br label %if.end
if.end: ; preds = %if.then, %entry
%phi = phi i32 [ %shl, %if.then ], [ undef, %entry ]
ret i32 %phi
}
declare void @llvm.assume(i1)