1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00

[Reassociation] Fix miscompile for va_arg arguments.

iisUnmovableInstruction() had a list of instructions hardcoded which are
considered unmovable. The list lacked (at least) an entry for the va_arg
and cmpxchg instructions.
Fix this by introducing a new Instruction::mayBeMemoryDependent()
instead of maintaining another instruction list.

Patch by Matthias Braun <matze@braunis.de>.

Differential Revision: http://reviews.llvm.org/D11577

rdar://problem/22118647

llvm-svn: 244244
This commit is contained in:
Quentin Colombet 2015-08-06 18:44:34 +00:00
parent 8ecabffd63
commit 4323bdacbd
4 changed files with 44 additions and 22 deletions

View File

@ -258,6 +258,16 @@ namespace llvm {
const DominatorTree *DT = nullptr, const DominatorTree *DT = nullptr,
const TargetLibraryInfo *TLI = nullptr); const TargetLibraryInfo *TLI = nullptr);
/// Returns true if the result or effects of the given instructions \p I
/// depend on or influence global memory.
/// Memory dependence arises for example if the the instruction reads from
/// memory or may produce effects or undefined behaviour. Memory dependent
/// instructions generally cannot be reorderd with respect to other memory
/// dependent instructions or moved into non-dominated basic blocks.
/// Instructions which just compute a value based on the values of their
/// operands are not memory dependent.
bool mayBeMemoryDependent(const Instruction &I);
/// isKnownNonNull - Return true if this pointer couldn't possibly be null by /// isKnownNonNull - Return true if this pointer couldn't possibly be null by
/// its definition. This returns true for allocas, non-extern-weak globals /// its definition. This returns true for allocas, non-extern-weak globals
/// and byval arguments. /// and byval arguments.

View File

@ -3161,6 +3161,10 @@ bool llvm::isSafeToSpeculativelyExecute(const Value *V,
} }
} }
bool llvm::mayBeMemoryDependent(const Instruction &I) {
return I.mayReadOrWriteMemory() || !isSafeToSpeculativelyExecute(&I);
}
/// Return true if we know that the specified value is never null. /// Return true if we know that the specified value is never null.
bool llvm::isKnownNonNull(const Value *V, const TargetLibraryInfo *TLI) { bool llvm::isKnownNonNull(const Value *V, const TargetLibraryInfo *TLI) {
// Alloca never returns null, malloc might. // Alloca never returns null, malloc might.

View File

@ -26,6 +26,7 @@
#include "llvm/ADT/STLExtras.h" #include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SetVector.h" #include "llvm/ADT/SetVector.h"
#include "llvm/ADT/Statistic.h" #include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/ValueTracking.h"
#include "llvm/IR/CFG.h" #include "llvm/IR/CFG.h"
#include "llvm/IR/Constants.h" #include "llvm/IR/Constants.h"
#include "llvm/IR/DerivedTypes.h" #include "llvm/IR/DerivedTypes.h"
@ -255,27 +256,6 @@ static BinaryOperator *isReassociableOp(Value *V, unsigned Opcode1,
return nullptr; return nullptr;
} }
static bool isUnmovableInstruction(Instruction *I) {
switch (I->getOpcode()) {
case Instruction::PHI:
case Instruction::LandingPad:
case Instruction::Alloca:
case Instruction::Load:
case Instruction::Invoke:
case Instruction::UDiv:
case Instruction::SDiv:
case Instruction::FDiv:
case Instruction::URem:
case Instruction::SRem:
case Instruction::FRem:
return true;
case Instruction::Call:
return !isa<DbgInfoIntrinsic>(I);
default:
return false;
}
}
void Reassociate::BuildRankMap(Function &F) { void Reassociate::BuildRankMap(Function &F) {
unsigned i = 2; unsigned i = 2;
@ -295,7 +275,7 @@ void Reassociate::BuildRankMap(Function &F) {
// we cannot move. This ensures that the ranks for these instructions are // we cannot move. This ensures that the ranks for these instructions are
// all different in the block. // all different in the block.
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
if (isUnmovableInstruction(I)) if (mayBeMemoryDependent(*I))
ValueRankMap[&*I] = ++BBRank; ValueRankMap[&*I] = ++BBRank;
} }
} }

View File

@ -0,0 +1,28 @@
; RUN: opt -S -reassociate -die < %s | FileCheck %s
; The two va_arg instructions depend on the memory/context, are therfore not
; identical and the sub should not be optimized to 0 by reassociate.
;
; CHECK-LABEL @func(
; ...
; CHECK: %v0 = va_arg i8** %varargs, i32
; CHECK: %v1 = va_arg i8** %varargs, i32
; CHECK: %v0.neg = sub i32 0, %v0
; CHECK: %sub = add i32 %v0.neg, 1
; CHECK: %add = add i32 %sub, %v1
; ...
; CHECK: ret i32 %add
define i32 @func(i32 %dummy, ...) {
%varargs = alloca i8*, align 8
%varargs1 = bitcast i8** %varargs to i8*
call void @llvm.va_start(i8* %varargs1)
%v0 = va_arg i8** %varargs, i32
%v1 = va_arg i8** %varargs, i32
%sub = sub nsw i32 %v1, %v0
%add = add nsw i32 %sub, 1
call void @llvm.va_end(i8* %varargs1)
ret i32 %add
}
declare void @llvm.va_start(i8*)
declare void @llvm.va_end(i8*)