RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-16 23:19:37 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Commit 124487 broke 254.gap. See if disabling the part that might be triggered

Browse Source 
by PR9088 fixes things.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@124561 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Duncan Sands 2011-01-30 18:24:20 +00:00
parent 1895e98ef3
commit 7af00c0f6e
2 changed files with 5 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Analysis/InstructionSimplify.cpp
View File

@ -804,11 +804,11 @@ static Value *SimplifyDiv(unsigned Opcode, Value *Op0, Value *Op1,
Value *X = 0, *Y = 0;
if (match(Op0, m_Mul(m_Value(X), m_Value(Y))) && (X == Op1 || Y == Op1)) {
if (Y != Op1) std::swap(X, Y); // Ensure expression is (X * Y) / Y, Y = Op1
BinaryOperator *Mul = cast<BinaryOperator>(Op0);
// If the Mul knows it does not overflow, then we are good to go.
if ((isSigned && Mul->hasNoSignedWrap()) ||
(!isSigned && Mul->hasNoUnsignedWrap()))
return X;
// BinaryOperator *Mul = cast<BinaryOperator>(Op0);
// // If the Mul knows it does not overflow, then we are good to go.
// if ((isSigned && Mul->hasNoSignedWrap()) ||
// (!isSigned && Mul->hasNoUnsignedWrap()))
// return X;
// If X has the form X = A / Y then X * Y cannot overflow.
if (BinaryOperator *Div = dyn_cast<BinaryOperator>(X))
if (Div->getOpcode() == Opcode && Div->getOperand(1) == Y)

4
test/Transforms/InstSimplify/2010-12-20-Reassociate.ll
View File

@ -92,12 +92,10 @@ define i32 @sub3(i32 %x, i32 %y) {
}
define i32 @sdiv1(i32 %x, i32 %y) {
; CHECK: @sdiv1
; (no overflow X * Y) / Y -> X
%mul = mul nsw i32 %x, %y
%r = sdiv i32 %mul, %y
ret i32 %r
; CHECK: ret i32 %x
}
define i32 @sdiv2(i32 %x, i32 %y) {
@ -138,12 +136,10 @@ define i32 @sdiv5(i32 %x, i32 %y) {
}
define i32 @udiv1(i32 %x, i32 %y) {
; CHECK: @udiv1
; (no overflow X * Y) / Y -> X
%mul = mul nuw i32 %x, %y
%r = udiv i32 %mul, %y
ret i32 %r
; CHECK: ret i32 %x
}
define i32 @udiv2(i32 %x, i32 %y) {