RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2026-07-01 21:04:04 -04:00
Code Issues Packages Projects Releases 10 Wiki Activity

[Attributor][FIX] Do not apply h2s for arbitrary mallocs

Browse Source 
H2S did apply to mallocs of non-constant sizes if the uses were OK. This
is now forbidden through reording of the "good" and "bad" cases in the
conditional.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@374698 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Johannes Doerfert
2019-10-13 03:54:08 +00:00
parent 62bc91d4ab
commit cfbbef2231
2 changed files with 30 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/Transforms/IPO/Attributor.cpp
+25 -19
View File
@@ -3620,30 +3620,36 @@ ChangeStatus AAHeapToStackImpl::updateImpl(Attributor &A) {
};
auto MallocCallocCheck = [&](Instruction &I) {
if (isMallocLikeFn(&I, TLI)) {
if (auto *Size = dyn_cast<ConstantInt>(I.getOperand(0)))
if (!Size->getValue().sle(MaxHeapToStackSize))
return true;
} else if (isCallocLikeFn(&I, TLI)) {
bool Overflow = false;
if (auto *Num = dyn_cast<ConstantInt>(I.getOperand(0)))
if (auto *Size = dyn_cast<ConstantInt>(I.getOperand(1)))
if (!(Size->getValue().umul_ov(Num->getValue(), Overflow))
.sle(MaxHeapToStackSize))
if (!Overflow)
return true;
} else {
if (BadMallocCalls.count(&I))
return true;
bool IsMalloc = isMallocLikeFn(&I, TLI);
bool IsCalloc = !IsMalloc && isCallocLikeFn(&I, TLI);
if (!IsMalloc && !IsCalloc) {
BadMallocCalls.insert(&I);
return true;
}
if (BadMallocCalls.count(&I))
return true;
if (IsMalloc) {
if (auto *Size = dyn_cast<ConstantInt>(I.getOperand(0)))
if (Size->getValue().sle(MaxHeapToStackSize))
if (UsesCheck(I)) {
MallocCalls.insert(&I);
return true;
}
} else if (IsCalloc) {
bool Overflow = false;
if (auto *Num = dyn_cast<ConstantInt>(I.getOperand(0)))
if (auto *Size = dyn_cast<ConstantInt>(I.getOperand(1)))
if ((Size->getValue().umul_ov(Num->getValue(), Overflow))
.sle(MaxHeapToStackSize))
if (!Overflow && UsesCheck(I)) {
MallocCalls.insert(&I);
return true;
}
}
if (UsesCheck(I))
MallocCalls.insert(&I);
else
BadMallocCalls.insert(&I);
BadMallocCalls.insert(&I);
return true;
};
test/Transforms/FunctionAttrs/heap_to_stack.ll
+5
View File
@@ -316,3 +316,8 @@ define void @test14() {
; CHECK: tail call void @free(i8* noalias %1)
ret void
}
define void @test15(i64 %S) {
%1 = tail call noalias i8* @malloc(i64 %S)
ret void
}