| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 1 | //===-- SafeStack.cpp - Safe Stack Insertion ------------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This pass splits the stack into the safe stack (kept as-is for LLVM backend) |
| 11 | // and the unsafe stack (explicitly allocated and managed through the runtime |
| 12 | // support library). |
| 13 | // |
| 14 | // http://clang.llvm.org/docs/SafeStack.html |
| 15 | // |
| 16 | //===----------------------------------------------------------------------===// |
| 17 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 18 | #include "llvm/ADT/Statistic.h" |
| 19 | #include "llvm/ADT/Triple.h" |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 20 | #include "llvm/Analysis/ScalarEvolution.h" |
| 21 | #include "llvm/Analysis/ScalarEvolutionExpressions.h" |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 22 | #include "llvm/CodeGen/Passes.h" |
| Benjamin Kramer | 390c33c | 2016-01-27 16:53:42 +0000 | [diff] [blame] | 23 | #include "llvm/CodeGen/Passes.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 24 | #include "llvm/IR/Constants.h" |
| Benjamin Kramer | 390c33c | 2016-01-27 16:53:42 +0000 | [diff] [blame] | 25 | #include "llvm/IR/DIBuilder.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 26 | #include "llvm/IR/DataLayout.h" |
| 27 | #include "llvm/IR/DerivedTypes.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 28 | #include "llvm/IR/Function.h" |
| Benjamin Kramer | 390c33c | 2016-01-27 16:53:42 +0000 | [diff] [blame] | 29 | #include "llvm/IR/IRBuilder.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 30 | #include "llvm/IR/InstIterator.h" |
| 31 | #include "llvm/IR/Instructions.h" |
| 32 | #include "llvm/IR/IntrinsicInst.h" |
| 33 | #include "llvm/IR/Intrinsics.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 34 | #include "llvm/IR/Module.h" |
| 35 | #include "llvm/Pass.h" |
| 36 | #include "llvm/Support/CommandLine.h" |
| 37 | #include "llvm/Support/Debug.h" |
| 38 | #include "llvm/Support/Format.h" |
| 39 | #include "llvm/Support/MathExtras.h" |
| 40 | #include "llvm/Support/raw_os_ostream.h" |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 41 | #include "llvm/Target/TargetLowering.h" |
| 42 | #include "llvm/Target/TargetSubtargetInfo.h" |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 43 | #include "llvm/Transforms/Utils/Local.h" |
| 44 | #include "llvm/Transforms/Utils/ModuleUtils.h" |
| 45 | |
| 46 | using namespace llvm; |
| 47 | |
| 48 | #define DEBUG_TYPE "safestack" |
| 49 | |
| Evgeniy Stepanov | 8827f2d | 2015-12-22 00:13:11 +0000 | [diff] [blame] | 50 | enum UnsafeStackPtrStorageVal { ThreadLocalUSP, SingleThreadUSP }; |
| 51 | |
| 52 | static cl::opt<UnsafeStackPtrStorageVal> USPStorage("safe-stack-usp-storage", |
| 53 | cl::Hidden, cl::init(ThreadLocalUSP), |
| 54 | cl::desc("Type of storage for the unsafe stack pointer"), |
| 55 | cl::values(clEnumValN(ThreadLocalUSP, "thread-local", |
| 56 | "Thread-local storage"), |
| 57 | clEnumValN(SingleThreadUSP, "single-thread", |
| 58 | "Non-thread-local storage"), |
| 59 | clEnumValEnd)); |
| 60 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 61 | namespace llvm { |
| 62 | |
| 63 | STATISTIC(NumFunctions, "Total number of functions"); |
| 64 | STATISTIC(NumUnsafeStackFunctions, "Number of functions with unsafe stack"); |
| 65 | STATISTIC(NumUnsafeStackRestorePointsFunctions, |
| 66 | "Number of functions that use setjmp or exceptions"); |
| 67 | |
| 68 | STATISTIC(NumAllocas, "Total number of allocas"); |
| 69 | STATISTIC(NumUnsafeStaticAllocas, "Number of unsafe static allocas"); |
| 70 | STATISTIC(NumUnsafeDynamicAllocas, "Number of unsafe dynamic allocas"); |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 71 | STATISTIC(NumUnsafeByValArguments, "Number of unsafe byval arguments"); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 72 | STATISTIC(NumUnsafeStackRestorePoints, "Number of setjmps and landingpads"); |
| 73 | |
| 74 | } // namespace llvm |
| 75 | |
| 76 | namespace { |
| 77 | |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 78 | /// Rewrite an SCEV expression for a memory access address to an expression that |
| 79 | /// represents offset from the given alloca. |
| 80 | /// |
| 81 | /// The implementation simply replaces all mentions of the alloca with zero. |
| 82 | class AllocaOffsetRewriter : public SCEVRewriteVisitor<AllocaOffsetRewriter> { |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 83 | const Value *AllocaPtr; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 84 | |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 85 | public: |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 86 | AllocaOffsetRewriter(ScalarEvolution &SE, const Value *AllocaPtr) |
| 87 | : SCEVRewriteVisitor(SE), AllocaPtr(AllocaPtr) {} |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 88 | |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 89 | const SCEV *visitUnknown(const SCEVUnknown *Expr) { |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 90 | if (Expr->getValue() == AllocaPtr) |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 91 | return SE.getZero(Expr->getType()); |
| 92 | return Expr; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 93 | } |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 94 | }; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 95 | |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 96 | /// The SafeStack pass splits the stack of each function into the safe |
| 97 | /// stack, which is only accessed through memory safe dereferences (as |
| 98 | /// determined statically), and the unsafe stack, which contains all |
| 99 | /// local variables that are accessed in ways that we can't prove to |
| 100 | /// be safe. |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 101 | class SafeStack : public FunctionPass { |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 102 | const TargetMachine *TM; |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 103 | const TargetLoweringBase *TL; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 104 | const DataLayout *DL; |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 105 | ScalarEvolution *SE; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 106 | |
| 107 | Type *StackPtrTy; |
| 108 | Type *IntPtrTy; |
| 109 | Type *Int32Ty; |
| 110 | Type *Int8Ty; |
| 111 | |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 112 | Value *UnsafeStackPtr = nullptr; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 113 | |
| 114 | /// Unsafe stack alignment. Each stack frame must ensure that the stack is |
| 115 | /// aligned to this value. We need to re-align the unsafe stack if the |
| 116 | /// alignment of any object on the stack exceeds this value. |
| 117 | /// |
| 118 | /// 16 seems like a reasonable upper bound on the alignment of objects that we |
| 119 | /// might expect to appear on the stack on most common targets. |
| 120 | enum { StackAlignment = 16 }; |
| 121 | |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 122 | /// \brief Build a value representing a pointer to the unsafe stack pointer. |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 123 | Value *getOrCreateUnsafeStackPtr(IRBuilder<> &IRB, Function &F); |
| 124 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 125 | /// \brief Find all static allocas, dynamic allocas, return instructions and |
| 126 | /// stack restore points (exception unwind blocks and setjmp calls) in the |
| 127 | /// given function and append them to the respective vectors. |
| 128 | void findInsts(Function &F, SmallVectorImpl<AllocaInst *> &StaticAllocas, |
| 129 | SmallVectorImpl<AllocaInst *> &DynamicAllocas, |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 130 | SmallVectorImpl<Argument *> &ByValArguments, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 131 | SmallVectorImpl<ReturnInst *> &Returns, |
| 132 | SmallVectorImpl<Instruction *> &StackRestorePoints); |
| 133 | |
| Evgeniy Stepanov | a4ac3f4 | 2015-12-01 00:06:13 +0000 | [diff] [blame] | 134 | /// \brief Calculate the allocation size of a given alloca. Returns 0 if the |
| 135 | /// size can not be statically determined. |
| 136 | uint64_t getStaticAllocaAllocationSize(const AllocaInst* AI); |
| 137 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 138 | /// \brief Allocate space for all static allocas in \p StaticAllocas, |
| 139 | /// replace allocas with pointers into the unsafe stack and generate code to |
| 140 | /// restore the stack pointer before all return instructions in \p Returns. |
| 141 | /// |
| 142 | /// \returns A pointer to the top of the unsafe stack after all unsafe static |
| 143 | /// allocas are allocated. |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 144 | Value *moveStaticAllocasToUnsafeStack(IRBuilder<> &IRB, Function &F, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 145 | ArrayRef<AllocaInst *> StaticAllocas, |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 146 | ArrayRef<Argument *> ByValArguments, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 147 | ArrayRef<ReturnInst *> Returns); |
| 148 | |
| 149 | /// \brief Generate code to restore the stack after all stack restore points |
| 150 | /// in \p StackRestorePoints. |
| 151 | /// |
| 152 | /// \returns A local variable in which to maintain the dynamic top of the |
| 153 | /// unsafe stack if needed. |
| 154 | AllocaInst * |
| Evgeniy Stepanov | 8685daf | 2015-09-24 01:23:51 +0000 | [diff] [blame] | 155 | createStackRestorePoints(IRBuilder<> &IRB, Function &F, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 156 | ArrayRef<Instruction *> StackRestorePoints, |
| 157 | Value *StaticTop, bool NeedDynamicTop); |
| 158 | |
| 159 | /// \brief Replace all allocas in \p DynamicAllocas with code to allocate |
| 160 | /// space dynamically on the unsafe stack and store the dynamic unsafe stack |
| 161 | /// top to \p DynamicTop if non-null. |
| 162 | void moveDynamicAllocasToUnsafeStack(Function &F, Value *UnsafeStackPtr, |
| 163 | AllocaInst *DynamicTop, |
| 164 | ArrayRef<AllocaInst *> DynamicAllocas); |
| 165 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 166 | bool IsSafeStackAlloca(const Value *AllocaPtr, uint64_t AllocaSize); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 167 | |
| 168 | bool IsMemIntrinsicSafe(const MemIntrinsic *MI, const Use &U, |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 169 | const Value *AllocaPtr, uint64_t AllocaSize); |
| 170 | bool IsAccessSafe(Value *Addr, uint64_t Size, const Value *AllocaPtr, |
| 171 | uint64_t AllocaSize); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 172 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 173 | public: |
| 174 | static char ID; // Pass identification, replacement for typeid. |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 175 | SafeStack(const TargetMachine *TM) |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 176 | : FunctionPass(ID), TM(TM), TL(nullptr), DL(nullptr) { |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 177 | initializeSafeStackPass(*PassRegistry::getPassRegistry()); |
| 178 | } |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 179 | SafeStack() : SafeStack(nullptr) {} |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 180 | |
| Hans Wennborg | aa15bff | 2015-09-10 16:49:58 +0000 | [diff] [blame] | 181 | void getAnalysisUsage(AnalysisUsage &AU) const override { |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 182 | AU.addRequired<ScalarEvolutionWrapperPass>(); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 183 | } |
| 184 | |
| Hans Wennborg | aa15bff | 2015-09-10 16:49:58 +0000 | [diff] [blame] | 185 | bool doInitialization(Module &M) override { |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 186 | DL = &M.getDataLayout(); |
| 187 | |
| 188 | StackPtrTy = Type::getInt8PtrTy(M.getContext()); |
| 189 | IntPtrTy = DL->getIntPtrType(M.getContext()); |
| 190 | Int32Ty = Type::getInt32Ty(M.getContext()); |
| 191 | Int8Ty = Type::getInt8Ty(M.getContext()); |
| 192 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 193 | return false; |
| 194 | } |
| 195 | |
| Hans Wennborg | aa15bff | 2015-09-10 16:49:58 +0000 | [diff] [blame] | 196 | bool runOnFunction(Function &F) override; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 197 | }; // class SafeStack |
| 198 | |
| Evgeniy Stepanov | a4ac3f4 | 2015-12-01 00:06:13 +0000 | [diff] [blame] | 199 | uint64_t SafeStack::getStaticAllocaAllocationSize(const AllocaInst* AI) { |
| 200 | uint64_t Size = DL->getTypeAllocSize(AI->getAllocatedType()); |
| 201 | if (AI->isArrayAllocation()) { |
| 202 | auto C = dyn_cast<ConstantInt>(AI->getArraySize()); |
| 203 | if (!C) |
| 204 | return 0; |
| 205 | Size *= C->getZExtValue(); |
| 206 | } |
| 207 | return Size; |
| 208 | } |
| 209 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 210 | bool SafeStack::IsAccessSafe(Value *Addr, uint64_t AccessSize, |
| 211 | const Value *AllocaPtr, uint64_t AllocaSize) { |
| 212 | AllocaOffsetRewriter Rewriter(*SE, AllocaPtr); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 213 | const SCEV *Expr = Rewriter.visit(SE->getSCEV(Addr)); |
| 214 | |
| 215 | uint64_t BitWidth = SE->getTypeSizeInBits(Expr->getType()); |
| 216 | ConstantRange AccessStartRange = SE->getUnsignedRange(Expr); |
| 217 | ConstantRange SizeRange = |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 218 | ConstantRange(APInt(BitWidth, 0), APInt(BitWidth, AccessSize)); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 219 | ConstantRange AccessRange = AccessStartRange.add(SizeRange); |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 220 | ConstantRange AllocaRange = |
| 221 | ConstantRange(APInt(BitWidth, 0), APInt(BitWidth, AllocaSize)); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 222 | bool Safe = AllocaRange.contains(AccessRange); |
| 223 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 224 | DEBUG(dbgs() << "[SafeStack] " |
| 225 | << (isa<AllocaInst>(AllocaPtr) ? "Alloca " : "ByValArgument ") |
| 226 | << *AllocaPtr << "\n" |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 227 | << " Access " << *Addr << "\n" |
| 228 | << " SCEV " << *Expr |
| 229 | << " U: " << SE->getUnsignedRange(Expr) |
| 230 | << ", S: " << SE->getSignedRange(Expr) << "\n" |
| 231 | << " Range " << AccessRange << "\n" |
| 232 | << " AllocaRange " << AllocaRange << "\n" |
| 233 | << " " << (Safe ? "safe" : "unsafe") << "\n"); |
| 234 | |
| 235 | return Safe; |
| 236 | } |
| 237 | |
| 238 | bool SafeStack::IsMemIntrinsicSafe(const MemIntrinsic *MI, const Use &U, |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 239 | const Value *AllocaPtr, |
| 240 | uint64_t AllocaSize) { |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 241 | // All MemIntrinsics have destination address in Arg0 and size in Arg2. |
| 242 | if (MI->getRawDest() != U) return true; |
| 243 | const auto *Len = dyn_cast<ConstantInt>(MI->getLength()); |
| 244 | // Non-constant size => unsafe. FIXME: try SCEV getRange. |
| 245 | if (!Len) return false; |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 246 | return IsAccessSafe(U, Len->getZExtValue(), AllocaPtr, AllocaSize); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 247 | } |
| 248 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 249 | /// Check whether a given allocation must be put on the safe |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 250 | /// stack or not. The function analyzes all uses of AI and checks whether it is |
| 251 | /// only accessed in a memory safe way (as decided statically). |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 252 | bool SafeStack::IsSafeStackAlloca(const Value *AllocaPtr, uint64_t AllocaSize) { |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 253 | // Go through all uses of this alloca and check whether all accesses to the |
| 254 | // allocated object are statically known to be memory safe and, hence, the |
| 255 | // object can be placed on the safe stack. |
| 256 | SmallPtrSet<const Value *, 16> Visited; |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 257 | SmallVector<const Value *, 8> WorkList; |
| 258 | WorkList.push_back(AllocaPtr); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 259 | |
| 260 | // A DFS search through all uses of the alloca in bitcasts/PHI/GEPs/etc. |
| 261 | while (!WorkList.empty()) { |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 262 | const Value *V = WorkList.pop_back_val(); |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 263 | for (const Use &UI : V->uses()) { |
| 264 | auto I = cast<const Instruction>(UI.getUser()); |
| 265 | assert(V == UI.get()); |
| 266 | |
| 267 | switch (I->getOpcode()) { |
| 268 | case Instruction::Load: { |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 269 | if (!IsAccessSafe(UI, DL->getTypeStoreSize(I->getType()), AllocaPtr, |
| 270 | AllocaSize)) |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 271 | return false; |
| 272 | break; |
| 273 | } |
| 274 | case Instruction::VAArg: |
| 275 | // "va-arg" from a pointer is safe. |
| 276 | break; |
| 277 | case Instruction::Store: { |
| 278 | if (V == I->getOperand(0)) { |
| 279 | // Stored the pointer - conservatively assume it may be unsafe. |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 280 | DEBUG(dbgs() << "[SafeStack] Unsafe alloca: " << *AllocaPtr |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 281 | << "\n store of address: " << *I << "\n"); |
| 282 | return false; |
| 283 | } |
| 284 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 285 | if (!IsAccessSafe(UI, DL->getTypeStoreSize(I->getOperand(0)->getType()), |
| 286 | AllocaPtr, AllocaSize)) |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 287 | return false; |
| 288 | break; |
| 289 | } |
| 290 | case Instruction::Ret: { |
| 291 | // Information leak. |
| 292 | return false; |
| 293 | } |
| 294 | |
| 295 | case Instruction::Call: |
| 296 | case Instruction::Invoke: { |
| 297 | ImmutableCallSite CS(I); |
| 298 | |
| 299 | if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) { |
| 300 | if (II->getIntrinsicID() == Intrinsic::lifetime_start || |
| 301 | II->getIntrinsicID() == Intrinsic::lifetime_end) |
| 302 | continue; |
| 303 | } |
| 304 | |
| 305 | if (const MemIntrinsic *MI = dyn_cast<MemIntrinsic>(I)) { |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 306 | if (!IsMemIntrinsicSafe(MI, UI, AllocaPtr, AllocaSize)) { |
| 307 | DEBUG(dbgs() << "[SafeStack] Unsafe alloca: " << *AllocaPtr |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 308 | << "\n unsafe memintrinsic: " << *I |
| 309 | << "\n"); |
| 310 | return false; |
| 311 | } |
| 312 | continue; |
| 313 | } |
| 314 | |
| 315 | // LLVM 'nocapture' attribute is only set for arguments whose address |
| 316 | // is not stored, passed around, or used in any other non-trivial way. |
| 317 | // We assume that passing a pointer to an object as a 'nocapture |
| 318 | // readnone' argument is safe. |
| 319 | // FIXME: a more precise solution would require an interprocedural |
| 320 | // analysis here, which would look at all uses of an argument inside |
| 321 | // the function being called. |
| 322 | ImmutableCallSite::arg_iterator B = CS.arg_begin(), E = CS.arg_end(); |
| 323 | for (ImmutableCallSite::arg_iterator A = B; A != E; ++A) |
| 324 | if (A->get() == V) |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 325 | if (!(CS.doesNotCapture(A - B) && (CS.doesNotAccessMemory(A - B) || |
| 326 | CS.doesNotAccessMemory()))) { |
| 327 | DEBUG(dbgs() << "[SafeStack] Unsafe alloca: " << *AllocaPtr |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 328 | << "\n unsafe call: " << *I << "\n"); |
| 329 | return false; |
| 330 | } |
| 331 | continue; |
| 332 | } |
| 333 | |
| 334 | default: |
| 335 | if (Visited.insert(I).second) |
| 336 | WorkList.push_back(cast<const Instruction>(I)); |
| 337 | } |
| 338 | } |
| 339 | } |
| 340 | |
| 341 | // All uses of the alloca are safe, we can place it on the safe stack. |
| 342 | return true; |
| 343 | } |
| 344 | |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 345 | Value *SafeStack::getOrCreateUnsafeStackPtr(IRBuilder<> &IRB, Function &F) { |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 346 | // Check if there is a target-specific location for the unsafe stack pointer. |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 347 | if (TL) |
| 348 | if (Value *V = TL->getSafeStackPointerLocation(IRB)) |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 349 | return V; |
| 350 | |
| 351 | // Otherwise, assume the target links with compiler-rt, which provides a |
| 352 | // thread-local variable with a magic name. |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 353 | Module &M = *F.getParent(); |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 354 | const char *UnsafeStackPtrVar = "__safestack_unsafe_stack_ptr"; |
| 355 | auto UnsafeStackPtr = |
| 356 | dyn_cast_or_null<GlobalVariable>(M.getNamedValue(UnsafeStackPtrVar)); |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 357 | |
| Evgeniy Stepanov | 8827f2d | 2015-12-22 00:13:11 +0000 | [diff] [blame] | 358 | bool UseTLS = USPStorage == ThreadLocalUSP; |
| 359 | |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 360 | if (!UnsafeStackPtr) { |
| Evgeniy Stepanov | 8827f2d | 2015-12-22 00:13:11 +0000 | [diff] [blame] | 361 | auto TLSModel = UseTLS ? |
| 362 | GlobalValue::InitialExecTLSModel : |
| 363 | GlobalValue::NotThreadLocal; |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 364 | // The global variable is not defined yet, define it ourselves. |
| 365 | // We use the initial-exec TLS model because we do not support the |
| 366 | // variable living anywhere other than in the main executable. |
| 367 | UnsafeStackPtr = new GlobalVariable( |
| Eugene Zelenko | ffec81c | 2015-11-04 22:32:32 +0000 | [diff] [blame] | 368 | M, StackPtrTy, false, GlobalValue::ExternalLinkage, nullptr, |
| Evgeniy Stepanov | 8827f2d | 2015-12-22 00:13:11 +0000 | [diff] [blame] | 369 | UnsafeStackPtrVar, nullptr, TLSModel); |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 370 | } else { |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 371 | // The variable exists, check its type and attributes. |
| 372 | if (UnsafeStackPtr->getValueType() != StackPtrTy) |
| 373 | report_fatal_error(Twine(UnsafeStackPtrVar) + " must have void* type"); |
| Evgeniy Stepanov | 8827f2d | 2015-12-22 00:13:11 +0000 | [diff] [blame] | 374 | if (UseTLS != UnsafeStackPtr->isThreadLocal()) |
| 375 | report_fatal_error(Twine(UnsafeStackPtrVar) + " must " + |
| 376 | (UseTLS ? "" : "not ") + "be thread-local"); |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 377 | } |
| Evgeniy Stepanov | d1aad26 | 2015-10-26 18:28:25 +0000 | [diff] [blame] | 378 | return UnsafeStackPtr; |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 379 | } |
| 380 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 381 | void SafeStack::findInsts(Function &F, |
| 382 | SmallVectorImpl<AllocaInst *> &StaticAllocas, |
| 383 | SmallVectorImpl<AllocaInst *> &DynamicAllocas, |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 384 | SmallVectorImpl<Argument *> &ByValArguments, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 385 | SmallVectorImpl<ReturnInst *> &Returns, |
| 386 | SmallVectorImpl<Instruction *> &StackRestorePoints) { |
| Nico Rieck | 7819951 | 2015-08-06 19:10:45 +0000 | [diff] [blame] | 387 | for (Instruction &I : instructions(&F)) { |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 388 | if (auto AI = dyn_cast<AllocaInst>(&I)) { |
| 389 | ++NumAllocas; |
| 390 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 391 | uint64_t Size = getStaticAllocaAllocationSize(AI); |
| 392 | if (IsSafeStackAlloca(AI, Size)) |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 393 | continue; |
| 394 | |
| 395 | if (AI->isStaticAlloca()) { |
| 396 | ++NumUnsafeStaticAllocas; |
| 397 | StaticAllocas.push_back(AI); |
| 398 | } else { |
| 399 | ++NumUnsafeDynamicAllocas; |
| 400 | DynamicAllocas.push_back(AI); |
| 401 | } |
| 402 | } else if (auto RI = dyn_cast<ReturnInst>(&I)) { |
| 403 | Returns.push_back(RI); |
| 404 | } else if (auto CI = dyn_cast<CallInst>(&I)) { |
| 405 | // setjmps require stack restore. |
| 406 | if (CI->getCalledFunction() && CI->canReturnTwice()) |
| 407 | StackRestorePoints.push_back(CI); |
| 408 | } else if (auto LP = dyn_cast<LandingPadInst>(&I)) { |
| 409 | // Exception landing pads require stack restore. |
| 410 | StackRestorePoints.push_back(LP); |
| 411 | } else if (auto II = dyn_cast<IntrinsicInst>(&I)) { |
| 412 | if (II->getIntrinsicID() == Intrinsic::gcroot) |
| 413 | llvm::report_fatal_error( |
| 414 | "gcroot intrinsic not compatible with safestack attribute"); |
| 415 | } |
| 416 | } |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 417 | for (Argument &Arg : F.args()) { |
| 418 | if (!Arg.hasByValAttr()) |
| 419 | continue; |
| 420 | uint64_t Size = |
| 421 | DL->getTypeStoreSize(Arg.getType()->getPointerElementType()); |
| 422 | if (IsSafeStackAlloca(&Arg, Size)) |
| 423 | continue; |
| 424 | |
| 425 | ++NumUnsafeByValArguments; |
| 426 | ByValArguments.push_back(&Arg); |
| 427 | } |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 428 | } |
| 429 | |
| 430 | AllocaInst * |
| Evgeniy Stepanov | 8685daf | 2015-09-24 01:23:51 +0000 | [diff] [blame] | 431 | SafeStack::createStackRestorePoints(IRBuilder<> &IRB, Function &F, |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 432 | ArrayRef<Instruction *> StackRestorePoints, |
| 433 | Value *StaticTop, bool NeedDynamicTop) { |
| 434 | if (StackRestorePoints.empty()) |
| 435 | return nullptr; |
| 436 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 437 | // We need the current value of the shadow stack pointer to restore |
| 438 | // after longjmp or exception catching. |
| 439 | |
| 440 | // FIXME: On some platforms this could be handled by the longjmp/exception |
| 441 | // runtime itself. |
| 442 | |
| 443 | AllocaInst *DynamicTop = nullptr; |
| 444 | if (NeedDynamicTop) |
| 445 | // If we also have dynamic alloca's, the stack pointer value changes |
| 446 | // throughout the function. For now we store it in an alloca. |
| 447 | DynamicTop = IRB.CreateAlloca(StackPtrTy, /*ArraySize=*/nullptr, |
| 448 | "unsafe_stack_dynamic_ptr"); |
| 449 | |
| 450 | if (!StaticTop) |
| 451 | // We need the original unsafe stack pointer value, even if there are |
| 452 | // no unsafe static allocas. |
| 453 | StaticTop = IRB.CreateLoad(UnsafeStackPtr, false, "unsafe_stack_ptr"); |
| 454 | |
| 455 | if (NeedDynamicTop) |
| 456 | IRB.CreateStore(StaticTop, DynamicTop); |
| 457 | |
| 458 | // Restore current stack pointer after longjmp/exception catch. |
| 459 | for (Instruction *I : StackRestorePoints) { |
| 460 | ++NumUnsafeStackRestorePoints; |
| 461 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 462 | IRB.SetInsertPoint(I->getNextNode()); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 463 | Value *CurrentTop = DynamicTop ? IRB.CreateLoad(DynamicTop) : StaticTop; |
| 464 | IRB.CreateStore(CurrentTop, UnsafeStackPtr); |
| 465 | } |
| 466 | |
| 467 | return DynamicTop; |
| 468 | } |
| 469 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 470 | Value *SafeStack::moveStaticAllocasToUnsafeStack( |
| 471 | IRBuilder<> &IRB, Function &F, ArrayRef<AllocaInst *> StaticAllocas, |
| 472 | ArrayRef<Argument *> ByValArguments, ArrayRef<ReturnInst *> Returns) { |
| 473 | if (StaticAllocas.empty() && ByValArguments.empty()) |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 474 | return nullptr; |
| 475 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 476 | DIBuilder DIB(*F.getParent()); |
| 477 | |
| 478 | // We explicitly compute and set the unsafe stack layout for all unsafe |
| 479 | // static alloca instructions. We save the unsafe "base pointer" in the |
| 480 | // prologue into a local variable and restore it in the epilogue. |
| 481 | |
| 482 | // Load the current stack pointer (we'll also use it as a base pointer). |
| 483 | // FIXME: use a dedicated register for it ? |
| 484 | Instruction *BasePointer = |
| 485 | IRB.CreateLoad(UnsafeStackPtr, false, "unsafe_stack_ptr"); |
| 486 | assert(BasePointer->getType() == StackPtrTy); |
| 487 | |
| 488 | for (ReturnInst *RI : Returns) { |
| 489 | IRB.SetInsertPoint(RI); |
| 490 | IRB.CreateStore(BasePointer, UnsafeStackPtr); |
| 491 | } |
| 492 | |
| 493 | // Compute maximum alignment among static objects on the unsafe stack. |
| 494 | unsigned MaxAlignment = 0; |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 495 | for (Argument *Arg : ByValArguments) { |
| 496 | Type *Ty = Arg->getType()->getPointerElementType(); |
| 497 | unsigned Align = std::max((unsigned)DL->getPrefTypeAlignment(Ty), |
| 498 | Arg->getParamAlignment()); |
| 499 | if (Align > MaxAlignment) |
| 500 | MaxAlignment = Align; |
| 501 | } |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 502 | for (AllocaInst *AI : StaticAllocas) { |
| 503 | Type *Ty = AI->getAllocatedType(); |
| 504 | unsigned Align = |
| 505 | std::max((unsigned)DL->getPrefTypeAlignment(Ty), AI->getAlignment()); |
| 506 | if (Align > MaxAlignment) |
| 507 | MaxAlignment = Align; |
| 508 | } |
| 509 | |
| 510 | if (MaxAlignment > StackAlignment) { |
| 511 | // Re-align the base pointer according to the max requested alignment. |
| 512 | assert(isPowerOf2_32(MaxAlignment)); |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 513 | IRB.SetInsertPoint(BasePointer->getNextNode()); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 514 | BasePointer = cast<Instruction>(IRB.CreateIntToPtr( |
| 515 | IRB.CreateAnd(IRB.CreatePtrToInt(BasePointer, IntPtrTy), |
| 516 | ConstantInt::get(IntPtrTy, ~uint64_t(MaxAlignment - 1))), |
| 517 | StackPtrTy)); |
| 518 | } |
| 519 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 520 | int64_t StaticOffset = 0; // Current stack top. |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 521 | IRB.SetInsertPoint(BasePointer->getNextNode()); |
| 522 | |
| 523 | for (Argument *Arg : ByValArguments) { |
| 524 | Type *Ty = Arg->getType()->getPointerElementType(); |
| 525 | |
| 526 | uint64_t Size = DL->getTypeStoreSize(Ty); |
| 527 | if (Size == 0) |
| 528 | Size = 1; // Don't create zero-sized stack objects. |
| 529 | |
| 530 | // Ensure the object is properly aligned. |
| 531 | unsigned Align = std::max((unsigned)DL->getPrefTypeAlignment(Ty), |
| 532 | Arg->getParamAlignment()); |
| 533 | |
| 534 | // Add alignment. |
| 535 | // NOTE: we ensure that BasePointer itself is aligned to >= Align. |
| 536 | StaticOffset += Size; |
| Rui Ueyama | da00f2f | 2016-01-14 21:06:47 +0000 | [diff] [blame] | 537 | StaticOffset = alignTo(StaticOffset, Align); |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 538 | |
| 539 | Value *Off = IRB.CreateGEP(BasePointer, // BasePointer is i8* |
| 540 | ConstantInt::get(Int32Ty, -StaticOffset)); |
| 541 | Value *NewArg = IRB.CreateBitCast(Off, Arg->getType(), |
| 542 | Arg->getName() + ".unsafe-byval"); |
| 543 | |
| 544 | // Replace alloc with the new location. |
| 545 | replaceDbgDeclare(Arg, BasePointer, BasePointer->getNextNode(), DIB, |
| 546 | /*Deref=*/true, -StaticOffset); |
| 547 | Arg->replaceAllUsesWith(NewArg); |
| 548 | IRB.SetInsertPoint(cast<Instruction>(NewArg)->getNextNode()); |
| 549 | IRB.CreateMemCpy(Off, Arg, Size, Arg->getParamAlignment()); |
| 550 | } |
| 551 | |
| 552 | // Allocate space for every unsafe static AllocaInst on the unsafe stack. |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 553 | for (AllocaInst *AI : StaticAllocas) { |
| 554 | IRB.SetInsertPoint(AI); |
| 555 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 556 | Type *Ty = AI->getAllocatedType(); |
| Evgeniy Stepanov | a4ac3f4 | 2015-12-01 00:06:13 +0000 | [diff] [blame] | 557 | uint64_t Size = getStaticAllocaAllocationSize(AI); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 558 | if (Size == 0) |
| 559 | Size = 1; // Don't create zero-sized stack objects. |
| 560 | |
| 561 | // Ensure the object is properly aligned. |
| 562 | unsigned Align = |
| 563 | std::max((unsigned)DL->getPrefTypeAlignment(Ty), AI->getAlignment()); |
| 564 | |
| 565 | // Add alignment. |
| 566 | // NOTE: we ensure that BasePointer itself is aligned to >= Align. |
| 567 | StaticOffset += Size; |
| Rui Ueyama | da00f2f | 2016-01-14 21:06:47 +0000 | [diff] [blame] | 568 | StaticOffset = alignTo(StaticOffset, Align); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 569 | |
| 570 | Value *Off = IRB.CreateGEP(BasePointer, // BasePointer is i8* |
| 571 | ConstantInt::get(Int32Ty, -StaticOffset)); |
| 572 | Value *NewAI = IRB.CreateBitCast(Off, AI->getType(), AI->getName()); |
| 573 | if (AI->hasName() && isa<Instruction>(NewAI)) |
| 574 | cast<Instruction>(NewAI)->takeName(AI); |
| 575 | |
| 576 | // Replace alloc with the new location. |
| Evgeniy Stepanov | f608111 | 2015-09-30 19:55:43 +0000 | [diff] [blame] | 577 | replaceDbgDeclareForAlloca(AI, BasePointer, DIB, /*Deref=*/true, -StaticOffset); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 578 | AI->replaceAllUsesWith(NewAI); |
| 579 | AI->eraseFromParent(); |
| 580 | } |
| 581 | |
| 582 | // Re-align BasePointer so that our callees would see it aligned as |
| 583 | // expected. |
| 584 | // FIXME: no need to update BasePointer in leaf functions. |
| Rui Ueyama | da00f2f | 2016-01-14 21:06:47 +0000 | [diff] [blame] | 585 | StaticOffset = alignTo(StaticOffset, StackAlignment); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 586 | |
| 587 | // Update shadow stack pointer in the function epilogue. |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 588 | IRB.SetInsertPoint(BasePointer->getNextNode()); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 589 | |
| 590 | Value *StaticTop = |
| 591 | IRB.CreateGEP(BasePointer, ConstantInt::get(Int32Ty, -StaticOffset), |
| 592 | "unsafe_stack_static_top"); |
| 593 | IRB.CreateStore(StaticTop, UnsafeStackPtr); |
| 594 | return StaticTop; |
| 595 | } |
| 596 | |
| 597 | void SafeStack::moveDynamicAllocasToUnsafeStack( |
| 598 | Function &F, Value *UnsafeStackPtr, AllocaInst *DynamicTop, |
| 599 | ArrayRef<AllocaInst *> DynamicAllocas) { |
| 600 | DIBuilder DIB(*F.getParent()); |
| 601 | |
| 602 | for (AllocaInst *AI : DynamicAllocas) { |
| 603 | IRBuilder<> IRB(AI); |
| 604 | |
| 605 | // Compute the new SP value (after AI). |
| 606 | Value *ArraySize = AI->getArraySize(); |
| 607 | if (ArraySize->getType() != IntPtrTy) |
| 608 | ArraySize = IRB.CreateIntCast(ArraySize, IntPtrTy, false); |
| 609 | |
| 610 | Type *Ty = AI->getAllocatedType(); |
| 611 | uint64_t TySize = DL->getTypeAllocSize(Ty); |
| 612 | Value *Size = IRB.CreateMul(ArraySize, ConstantInt::get(IntPtrTy, TySize)); |
| 613 | |
| 614 | Value *SP = IRB.CreatePtrToInt(IRB.CreateLoad(UnsafeStackPtr), IntPtrTy); |
| 615 | SP = IRB.CreateSub(SP, Size); |
| 616 | |
| 617 | // Align the SP value to satisfy the AllocaInst, type and stack alignments. |
| 618 | unsigned Align = std::max( |
| 619 | std::max((unsigned)DL->getPrefTypeAlignment(Ty), AI->getAlignment()), |
| 620 | (unsigned)StackAlignment); |
| 621 | |
| 622 | assert(isPowerOf2_32(Align)); |
| 623 | Value *NewTop = IRB.CreateIntToPtr( |
| 624 | IRB.CreateAnd(SP, ConstantInt::get(IntPtrTy, ~uint64_t(Align - 1))), |
| 625 | StackPtrTy); |
| 626 | |
| 627 | // Save the stack pointer. |
| 628 | IRB.CreateStore(NewTop, UnsafeStackPtr); |
| 629 | if (DynamicTop) |
| 630 | IRB.CreateStore(NewTop, DynamicTop); |
| 631 | |
| Evgeniy Stepanov | 9842d61 | 2015-11-25 22:52:30 +0000 | [diff] [blame] | 632 | Value *NewAI = IRB.CreatePointerCast(NewTop, AI->getType()); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 633 | if (AI->hasName() && isa<Instruction>(NewAI)) |
| 634 | NewAI->takeName(AI); |
| 635 | |
| 636 | replaceDbgDeclareForAlloca(AI, NewAI, DIB, /*Deref=*/true); |
| 637 | AI->replaceAllUsesWith(NewAI); |
| 638 | AI->eraseFromParent(); |
| 639 | } |
| 640 | |
| 641 | if (!DynamicAllocas.empty()) { |
| 642 | // Now go through the instructions again, replacing stacksave/stackrestore. |
| 643 | for (inst_iterator It = inst_begin(&F), Ie = inst_end(&F); It != Ie;) { |
| 644 | Instruction *I = &*(It++); |
| 645 | auto II = dyn_cast<IntrinsicInst>(I); |
| 646 | if (!II) |
| 647 | continue; |
| 648 | |
| 649 | if (II->getIntrinsicID() == Intrinsic::stacksave) { |
| 650 | IRBuilder<> IRB(II); |
| 651 | Instruction *LI = IRB.CreateLoad(UnsafeStackPtr); |
| 652 | LI->takeName(II); |
| 653 | II->replaceAllUsesWith(LI); |
| 654 | II->eraseFromParent(); |
| 655 | } else if (II->getIntrinsicID() == Intrinsic::stackrestore) { |
| 656 | IRBuilder<> IRB(II); |
| 657 | Instruction *SI = IRB.CreateStore(II->getArgOperand(0), UnsafeStackPtr); |
| 658 | SI->takeName(II); |
| 659 | assert(II->use_empty()); |
| 660 | II->eraseFromParent(); |
| 661 | } |
| 662 | } |
| 663 | } |
| 664 | } |
| 665 | |
| 666 | bool SafeStack::runOnFunction(Function &F) { |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 667 | DEBUG(dbgs() << "[SafeStack] Function: " << F.getName() << "\n"); |
| 668 | |
| 669 | if (!F.hasFnAttribute(Attribute::SafeStack)) { |
| 670 | DEBUG(dbgs() << "[SafeStack] safestack is not requested" |
| 671 | " for this function\n"); |
| 672 | return false; |
| 673 | } |
| 674 | |
| 675 | if (F.isDeclaration()) { |
| 676 | DEBUG(dbgs() << "[SafeStack] function definition" |
| 677 | " is not available\n"); |
| 678 | return false; |
| 679 | } |
| 680 | |
| Evgeniy Stepanov | 447bbdb | 2015-11-13 21:21:42 +0000 | [diff] [blame] | 681 | TL = TM ? TM->getSubtargetImpl(F)->getTargetLowering() : nullptr; |
| 682 | SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 683 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 684 | { |
| 685 | // Make sure the regular stack protector won't run on this function |
| 686 | // (safestack attribute takes precedence). |
| 687 | AttrBuilder B; |
| 688 | B.addAttribute(Attribute::StackProtect) |
| 689 | .addAttribute(Attribute::StackProtectReq) |
| 690 | .addAttribute(Attribute::StackProtectStrong); |
| 691 | F.removeAttributes( |
| 692 | AttributeSet::FunctionIndex, |
| 693 | AttributeSet::get(F.getContext(), AttributeSet::FunctionIndex, B)); |
| 694 | } |
| 695 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 696 | ++NumFunctions; |
| 697 | |
| 698 | SmallVector<AllocaInst *, 16> StaticAllocas; |
| 699 | SmallVector<AllocaInst *, 4> DynamicAllocas; |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 700 | SmallVector<Argument *, 4> ByValArguments; |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 701 | SmallVector<ReturnInst *, 4> Returns; |
| 702 | |
| 703 | // Collect all points where stack gets unwound and needs to be restored |
| 704 | // This is only necessary because the runtime (setjmp and unwind code) is |
| 705 | // not aware of the unsafe stack and won't unwind/restore it prorerly. |
| 706 | // To work around this problem without changing the runtime, we insert |
| 707 | // instrumentation to restore the unsafe stack pointer when necessary. |
| 708 | SmallVector<Instruction *, 4> StackRestorePoints; |
| 709 | |
| 710 | // Find all static and dynamic alloca instructions that must be moved to the |
| 711 | // unsafe stack, all return instructions and stack restore points. |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 712 | findInsts(F, StaticAllocas, DynamicAllocas, ByValArguments, Returns, |
| 713 | StackRestorePoints); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 714 | |
| 715 | if (StaticAllocas.empty() && DynamicAllocas.empty() && |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 716 | ByValArguments.empty() && StackRestorePoints.empty()) |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 717 | return false; // Nothing to do in this function. |
| 718 | |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 719 | if (!StaticAllocas.empty() || !DynamicAllocas.empty() || |
| 720 | !ByValArguments.empty()) |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 721 | ++NumUnsafeStackFunctions; // This function has the unsafe stack. |
| 722 | |
| 723 | if (!StackRestorePoints.empty()) |
| 724 | ++NumUnsafeStackRestorePointsFunctions; |
| 725 | |
| Duncan P. N. Exon Smith | e82c286 | 2015-10-13 17:39:10 +0000 | [diff] [blame] | 726 | IRBuilder<> IRB(&F.front(), F.begin()->getFirstInsertionPt()); |
| Evgeniy Stepanov | 9addbc9 | 2015-10-15 21:26:49 +0000 | [diff] [blame] | 727 | UnsafeStackPtr = getOrCreateUnsafeStackPtr(IRB, F); |
| Peter Collingbourne | de26a91 | 2015-06-22 20:26:54 +0000 | [diff] [blame] | 728 | |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 729 | // The top of the unsafe stack after all unsafe static allocas are allocated. |
| Evgeniy Stepanov | 42f3b12 | 2015-12-01 00:40:05 +0000 | [diff] [blame] | 730 | Value *StaticTop = moveStaticAllocasToUnsafeStack(IRB, F, StaticAllocas, |
| 731 | ByValArguments, Returns); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 732 | |
| 733 | // Safe stack object that stores the current unsafe stack top. It is updated |
| 734 | // as unsafe dynamic (non-constant-sized) allocas are allocated and freed. |
| 735 | // This is only needed if we need to restore stack pointer after longjmp |
| 736 | // or exceptions, and we have dynamic allocations. |
| 737 | // FIXME: a better alternative might be to store the unsafe stack pointer |
| 738 | // before setjmp / invoke instructions. |
| 739 | AllocaInst *DynamicTop = createStackRestorePoints( |
| Evgeniy Stepanov | 8685daf | 2015-09-24 01:23:51 +0000 | [diff] [blame] | 740 | IRB, F, StackRestorePoints, StaticTop, !DynamicAllocas.empty()); |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 741 | |
| 742 | // Handle dynamic allocas. |
| 743 | moveDynamicAllocasToUnsafeStack(F, UnsafeStackPtr, DynamicTop, |
| 744 | DynamicAllocas); |
| 745 | |
| 746 | DEBUG(dbgs() << "[SafeStack] safestack applied\n"); |
| 747 | return true; |
| 748 | } |
| 749 | |
| Hans Wennborg | 083ca9b | 2015-10-06 23:24:35 +0000 | [diff] [blame] | 750 | } // anonymous namespace |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 751 | |
| 752 | char SafeStack::ID = 0; |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 753 | INITIALIZE_TM_PASS_BEGIN(SafeStack, "safe-stack", |
| 754 | "Safe Stack instrumentation pass", false, false) |
| 755 | INITIALIZE_TM_PASS_END(SafeStack, "safe-stack", |
| 756 | "Safe Stack instrumentation pass", false, false) |
| Peter Collingbourne | 82437bf | 2015-06-15 21:07:11 +0000 | [diff] [blame] | 757 | |
| Evgeniy Stepanov | a2002b0 | 2015-09-23 18:07:56 +0000 | [diff] [blame] | 758 | FunctionPass *llvm::createSafeStackPass(const llvm::TargetMachine *TM) { |
| 759 | return new SafeStack(TM); |
| 760 | } |