Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1 | //===-- MemorySanitizer.cpp - detector of uninitialized reads -------------===// |
| 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 | /// \file |
| 10 | /// This file is a part of MemorySanitizer, a detector of uninitialized |
| 11 | /// reads. |
| 12 | /// |
| 13 | /// Status: early prototype. |
| 14 | /// |
| 15 | /// The algorithm of the tool is similar to Memcheck |
| 16 | /// (http://goo.gl/QKbem). We associate a few shadow bits with every |
| 17 | /// byte of the application memory, poison the shadow of the malloc-ed |
| 18 | /// or alloca-ed memory, load the shadow bits on every memory read, |
| 19 | /// propagate the shadow bits through some of the arithmetic |
| 20 | /// instruction (including MOV), store the shadow bits on every memory |
| 21 | /// write, report a bug on some other instructions (e.g. JMP) if the |
| 22 | /// associated shadow is poisoned. |
| 23 | /// |
| 24 | /// But there are differences too. The first and the major one: |
| 25 | /// compiler instrumentation instead of binary instrumentation. This |
| 26 | /// gives us much better register allocation, possible compiler |
| 27 | /// optimizations and a fast start-up. But this brings the major issue |
| 28 | /// as well: msan needs to see all program events, including system |
| 29 | /// calls and reads/writes in system libraries, so we either need to |
| 30 | /// compile *everything* with msan or use a binary translation |
| 31 | /// component (e.g. DynamoRIO) to instrument pre-built libraries. |
| 32 | /// Another difference from Memcheck is that we use 8 shadow bits per |
| 33 | /// byte of application memory and use a direct shadow mapping. This |
| 34 | /// greatly simplifies the instrumentation code and avoids races on |
| 35 | /// shadow updates (Memcheck is single-threaded so races are not a |
| 36 | /// concern there. Memcheck uses 2 shadow bits per byte with a slow |
| 37 | /// path storage that uses 8 bits per byte). |
| 38 | /// |
| 39 | /// The default value of shadow is 0, which means "clean" (not poisoned). |
| 40 | /// |
| 41 | /// Every module initializer should call __msan_init to ensure that the |
| 42 | /// shadow memory is ready. On error, __msan_warning is called. Since |
| 43 | /// parameters and return values may be passed via registers, we have a |
| 44 | /// specialized thread-local shadow for return values |
| 45 | /// (__msan_retval_tls) and parameters (__msan_param_tls). |
| 46 | //===----------------------------------------------------------------------===// |
| 47 | |
| 48 | #define DEBUG_TYPE "msan" |
| 49 | |
Chandler Carruth | ed0881b | 2012-12-03 16:50:05 +0000 | [diff] [blame] | 50 | #include "llvm/Transforms/Instrumentation.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 51 | #include "BlackList.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 52 | #include "llvm/ADT/DepthFirstIterator.h" |
| 53 | #include "llvm/ADT/SmallString.h" |
| 54 | #include "llvm/ADT/SmallVector.h" |
| 55 | #include "llvm/ADT/ValueMap.h" |
Chandler Carruth | ed0881b | 2012-12-03 16:50:05 +0000 | [diff] [blame] | 56 | #include "llvm/DataLayout.h" |
| 57 | #include "llvm/Function.h" |
| 58 | #include "llvm/IRBuilder.h" |
| 59 | #include "llvm/InlineAsm.h" |
| 60 | #include "llvm/InstVisitor.h" |
| 61 | #include "llvm/IntrinsicInst.h" |
| 62 | #include "llvm/LLVMContext.h" |
| 63 | #include "llvm/MDBuilder.h" |
| 64 | #include "llvm/Module.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 65 | #include "llvm/Support/CommandLine.h" |
| 66 | #include "llvm/Support/Compiler.h" |
| 67 | #include "llvm/Support/Debug.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 68 | #include "llvm/Support/raw_ostream.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 69 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
| 70 | #include "llvm/Transforms/Utils/ModuleUtils.h" |
Chandler Carruth | ed0881b | 2012-12-03 16:50:05 +0000 | [diff] [blame] | 71 | #include "llvm/Type.h" |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 72 | |
| 73 | using namespace llvm; |
| 74 | |
| 75 | static const uint64_t kShadowMask32 = 1ULL << 31; |
| 76 | static const uint64_t kShadowMask64 = 1ULL << 46; |
| 77 | static const uint64_t kOriginOffset32 = 1ULL << 30; |
| 78 | static const uint64_t kOriginOffset64 = 1ULL << 45; |
| 79 | |
| 80 | // This is an important flag that makes the reports much more |
| 81 | // informative at the cost of greater slowdown. Not fully implemented |
| 82 | // yet. |
| 83 | // FIXME: this should be a top-level clang flag, e.g. |
| 84 | // -fmemory-sanitizer-full. |
| 85 | static cl::opt<bool> ClTrackOrigins("msan-track-origins", |
| 86 | cl::desc("Track origins (allocation sites) of poisoned memory"), |
| 87 | cl::Hidden, cl::init(false)); |
| 88 | static cl::opt<bool> ClKeepGoing("msan-keep-going", |
| 89 | cl::desc("keep going after reporting a UMR"), |
| 90 | cl::Hidden, cl::init(false)); |
| 91 | static cl::opt<bool> ClPoisonStack("msan-poison-stack", |
| 92 | cl::desc("poison uninitialized stack variables"), |
| 93 | cl::Hidden, cl::init(true)); |
| 94 | static cl::opt<bool> ClPoisonStackWithCall("msan-poison-stack-with-call", |
| 95 | cl::desc("poison uninitialized stack variables with a call"), |
| 96 | cl::Hidden, cl::init(false)); |
| 97 | static cl::opt<int> ClPoisonStackPattern("msan-poison-stack-pattern", |
| 98 | cl::desc("poison uninitialized stack variables with the given patter"), |
| 99 | cl::Hidden, cl::init(0xff)); |
| 100 | |
| 101 | static cl::opt<bool> ClHandleICmp("msan-handle-icmp", |
| 102 | cl::desc("propagate shadow through ICmpEQ and ICmpNE"), |
| 103 | cl::Hidden, cl::init(true)); |
| 104 | |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 105 | static cl::opt<bool> ClStoreCleanOrigin("msan-store-clean-origin", |
| 106 | cl::desc("store origin for clean (fully initialized) values"), |
| 107 | cl::Hidden, cl::init(false)); |
| 108 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 109 | // This flag controls whether we check the shadow of the address |
| 110 | // operand of load or store. Such bugs are very rare, since load from |
| 111 | // a garbage address typically results in SEGV, but still happen |
| 112 | // (e.g. only lower bits of address are garbage, or the access happens |
| 113 | // early at program startup where malloc-ed memory is more likely to |
| 114 | // be zeroed. As of 2012-08-28 this flag adds 20% slowdown. |
| 115 | static cl::opt<bool> ClCheckAccessAddress("msan-check-access-address", |
| 116 | cl::desc("report accesses through a pointer which has poisoned shadow"), |
| 117 | cl::Hidden, cl::init(true)); |
| 118 | |
| 119 | static cl::opt<bool> ClDumpStrictInstructions("msan-dump-strict-instructions", |
| 120 | cl::desc("print out instructions with default strict semantics"), |
| 121 | cl::Hidden, cl::init(false)); |
| 122 | |
| 123 | static cl::opt<std::string> ClBlackListFile("msan-blacklist", |
| 124 | cl::desc("File containing the list of functions where MemorySanitizer " |
| 125 | "should not report bugs"), cl::Hidden); |
| 126 | |
| 127 | namespace { |
| 128 | |
| 129 | /// \brief An instrumentation pass implementing detection of uninitialized |
| 130 | /// reads. |
| 131 | /// |
| 132 | /// MemorySanitizer: instrument the code in module to find |
| 133 | /// uninitialized reads. |
| 134 | class MemorySanitizer : public FunctionPass { |
| 135 | public: |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 136 | MemorySanitizer() : FunctionPass(ID), TD(0), WarningFn(0) { } |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 137 | const char *getPassName() const { return "MemorySanitizer"; } |
| 138 | bool runOnFunction(Function &F); |
| 139 | bool doInitialization(Module &M); |
| 140 | static char ID; // Pass identification, replacement for typeid. |
| 141 | |
| 142 | private: |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 143 | void initializeCallbacks(Module &M); |
| 144 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 145 | DataLayout *TD; |
| 146 | LLVMContext *C; |
| 147 | Type *IntptrTy; |
| 148 | Type *OriginTy; |
| 149 | /// \brief Thread-local shadow storage for function parameters. |
| 150 | GlobalVariable *ParamTLS; |
| 151 | /// \brief Thread-local origin storage for function parameters. |
| 152 | GlobalVariable *ParamOriginTLS; |
| 153 | /// \brief Thread-local shadow storage for function return value. |
| 154 | GlobalVariable *RetvalTLS; |
| 155 | /// \brief Thread-local origin storage for function return value. |
| 156 | GlobalVariable *RetvalOriginTLS; |
| 157 | /// \brief Thread-local shadow storage for in-register va_arg function |
| 158 | /// parameters (x86_64-specific). |
| 159 | GlobalVariable *VAArgTLS; |
| 160 | /// \brief Thread-local shadow storage for va_arg overflow area |
| 161 | /// (x86_64-specific). |
| 162 | GlobalVariable *VAArgOverflowSizeTLS; |
| 163 | /// \brief Thread-local space used to pass origin value to the UMR reporting |
| 164 | /// function. |
| 165 | GlobalVariable *OriginTLS; |
| 166 | |
| 167 | /// \brief The run-time callback to print a warning. |
| 168 | Value *WarningFn; |
| 169 | /// \brief Run-time helper that copies origin info for a memory range. |
| 170 | Value *MsanCopyOriginFn; |
| 171 | /// \brief Run-time helper that generates a new origin value for a stack |
| 172 | /// allocation. |
| 173 | Value *MsanSetAllocaOriginFn; |
| 174 | /// \brief Run-time helper that poisons stack on function entry. |
| 175 | Value *MsanPoisonStackFn; |
Evgeniy Stepanov | 62b5db9 | 2012-11-29 12:49:04 +0000 | [diff] [blame] | 176 | /// \brief MSan runtime replacements for memmove, memcpy and memset. |
| 177 | Value *MemmoveFn, *MemcpyFn, *MemsetFn; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 178 | |
| 179 | /// \brief Address mask used in application-to-shadow address calculation. |
| 180 | /// ShadowAddr is computed as ApplicationAddr & ~ShadowMask. |
| 181 | uint64_t ShadowMask; |
| 182 | /// \brief Offset of the origin shadow from the "normal" shadow. |
| 183 | /// OriginAddr is computed as (ShadowAddr + OriginOffset) & ~3ULL |
| 184 | uint64_t OriginOffset; |
| 185 | /// \brief Branch weights for error reporting. |
| 186 | MDNode *ColdCallWeights; |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 187 | /// \brief Branch weights for origin store. |
| 188 | MDNode *OriginStoreWeights; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 189 | /// \brief The blacklist. |
| 190 | OwningPtr<BlackList> BL; |
Evgeniy Stepanov | 1d2da65 | 2012-11-29 12:30:18 +0000 | [diff] [blame] | 191 | /// \brief An empty volatile inline asm that prevents callback merge. |
| 192 | InlineAsm *EmptyAsm; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 193 | |
Evgeniy Stepanov | da0072b | 2012-11-29 13:12:03 +0000 | [diff] [blame] | 194 | friend struct MemorySanitizerVisitor; |
| 195 | friend struct VarArgAMD64Helper; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 196 | }; |
| 197 | } // namespace |
| 198 | |
| 199 | char MemorySanitizer::ID = 0; |
| 200 | INITIALIZE_PASS(MemorySanitizer, "msan", |
| 201 | "MemorySanitizer: detects uninitialized reads.", |
| 202 | false, false) |
| 203 | |
| 204 | FunctionPass *llvm::createMemorySanitizerPass() { |
| 205 | return new MemorySanitizer(); |
| 206 | } |
| 207 | |
| 208 | /// \brief Create a non-const global initialized with the given string. |
| 209 | /// |
| 210 | /// Creates a writable global for Str so that we can pass it to the |
| 211 | /// run-time lib. Runtime uses first 4 bytes of the string to store the |
| 212 | /// frame ID, so the string needs to be mutable. |
| 213 | static GlobalVariable *createPrivateNonConstGlobalForString(Module &M, |
| 214 | StringRef Str) { |
| 215 | Constant *StrConst = ConstantDataArray::getString(M.getContext(), Str); |
| 216 | return new GlobalVariable(M, StrConst->getType(), /*isConstant=*/false, |
| 217 | GlobalValue::PrivateLinkage, StrConst, ""); |
| 218 | } |
| 219 | |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 220 | |
| 221 | /// \brief Insert extern declaration of runtime-provided functions and globals. |
| 222 | void MemorySanitizer::initializeCallbacks(Module &M) { |
| 223 | // Only do this once. |
| 224 | if (WarningFn) |
| 225 | return; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 226 | |
| 227 | IRBuilder<> IRB(*C); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 228 | // Create the callback. |
| 229 | // FIXME: this function should have "Cold" calling conv, |
| 230 | // which is not yet implemented. |
| 231 | StringRef WarningFnName = ClKeepGoing ? "__msan_warning" |
| 232 | : "__msan_warning_noreturn"; |
| 233 | WarningFn = M.getOrInsertFunction(WarningFnName, IRB.getVoidTy(), NULL); |
| 234 | |
| 235 | MsanCopyOriginFn = M.getOrInsertFunction( |
| 236 | "__msan_copy_origin", IRB.getVoidTy(), IRB.getInt8PtrTy(), |
| 237 | IRB.getInt8PtrTy(), IntptrTy, NULL); |
| 238 | MsanSetAllocaOriginFn = M.getOrInsertFunction( |
| 239 | "__msan_set_alloca_origin", IRB.getVoidTy(), IRB.getInt8PtrTy(), IntptrTy, |
| 240 | IRB.getInt8PtrTy(), NULL); |
| 241 | MsanPoisonStackFn = M.getOrInsertFunction( |
| 242 | "__msan_poison_stack", IRB.getVoidTy(), IRB.getInt8PtrTy(), IntptrTy, NULL); |
| 243 | MemmoveFn = M.getOrInsertFunction( |
Evgeniy Stepanov | 62b5db9 | 2012-11-29 12:49:04 +0000 | [diff] [blame] | 244 | "__msan_memmove", IRB.getInt8PtrTy(), IRB.getInt8PtrTy(), IRB.getInt8PtrTy(), |
| 245 | IntptrTy, NULL); |
| 246 | MemcpyFn = M.getOrInsertFunction( |
| 247 | "__msan_memcpy", IRB.getInt8PtrTy(), IRB.getInt8PtrTy(), IRB.getInt8PtrTy(), |
| 248 | IntptrTy, NULL); |
| 249 | MemsetFn = M.getOrInsertFunction( |
| 250 | "__msan_memset", IRB.getInt8PtrTy(), IRB.getInt8PtrTy(), IRB.getInt32Ty(), |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 251 | IntptrTy, NULL); |
| 252 | |
| 253 | // Create globals. |
| 254 | RetvalTLS = new GlobalVariable( |
| 255 | M, ArrayType::get(IRB.getInt64Ty(), 8), false, |
| 256 | GlobalVariable::ExternalLinkage, 0, "__msan_retval_tls", 0, |
| 257 | GlobalVariable::GeneralDynamicTLSModel); |
| 258 | RetvalOriginTLS = new GlobalVariable( |
| 259 | M, OriginTy, false, GlobalVariable::ExternalLinkage, 0, |
| 260 | "__msan_retval_origin_tls", 0, GlobalVariable::GeneralDynamicTLSModel); |
| 261 | |
| 262 | ParamTLS = new GlobalVariable( |
| 263 | M, ArrayType::get(IRB.getInt64Ty(), 1000), false, |
| 264 | GlobalVariable::ExternalLinkage, 0, "__msan_param_tls", 0, |
| 265 | GlobalVariable::GeneralDynamicTLSModel); |
| 266 | ParamOriginTLS = new GlobalVariable( |
| 267 | M, ArrayType::get(OriginTy, 1000), false, GlobalVariable::ExternalLinkage, |
| 268 | 0, "__msan_param_origin_tls", 0, GlobalVariable::GeneralDynamicTLSModel); |
| 269 | |
| 270 | VAArgTLS = new GlobalVariable( |
| 271 | M, ArrayType::get(IRB.getInt64Ty(), 1000), false, |
| 272 | GlobalVariable::ExternalLinkage, 0, "__msan_va_arg_tls", 0, |
| 273 | GlobalVariable::GeneralDynamicTLSModel); |
| 274 | VAArgOverflowSizeTLS = new GlobalVariable( |
| 275 | M, IRB.getInt64Ty(), false, GlobalVariable::ExternalLinkage, 0, |
| 276 | "__msan_va_arg_overflow_size_tls", 0, |
| 277 | GlobalVariable::GeneralDynamicTLSModel); |
| 278 | OriginTLS = new GlobalVariable( |
| 279 | M, IRB.getInt32Ty(), false, GlobalVariable::ExternalLinkage, 0, |
| 280 | "__msan_origin_tls", 0, GlobalVariable::GeneralDynamicTLSModel); |
Evgeniy Stepanov | 1d2da65 | 2012-11-29 12:30:18 +0000 | [diff] [blame] | 281 | |
| 282 | // We insert an empty inline asm after __msan_report* to avoid callback merge. |
| 283 | EmptyAsm = InlineAsm::get(FunctionType::get(IRB.getVoidTy(), false), |
| 284 | StringRef(""), StringRef(""), |
| 285 | /*hasSideEffects=*/true); |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 286 | } |
| 287 | |
| 288 | /// \brief Module-level initialization. |
| 289 | /// |
| 290 | /// inserts a call to __msan_init to the module's constructor list. |
| 291 | bool MemorySanitizer::doInitialization(Module &M) { |
| 292 | TD = getAnalysisIfAvailable<DataLayout>(); |
| 293 | if (!TD) |
| 294 | return false; |
| 295 | BL.reset(new BlackList(ClBlackListFile)); |
| 296 | C = &(M.getContext()); |
| 297 | unsigned PtrSize = TD->getPointerSizeInBits(/* AddressSpace */0); |
| 298 | switch (PtrSize) { |
| 299 | case 64: |
| 300 | ShadowMask = kShadowMask64; |
| 301 | OriginOffset = kOriginOffset64; |
| 302 | break; |
| 303 | case 32: |
| 304 | ShadowMask = kShadowMask32; |
| 305 | OriginOffset = kOriginOffset32; |
| 306 | break; |
| 307 | default: |
| 308 | report_fatal_error("unsupported pointer size"); |
| 309 | break; |
| 310 | } |
| 311 | |
| 312 | IRBuilder<> IRB(*C); |
| 313 | IntptrTy = IRB.getIntPtrTy(TD); |
| 314 | OriginTy = IRB.getInt32Ty(); |
| 315 | |
| 316 | ColdCallWeights = MDBuilder(*C).createBranchWeights(1, 1000); |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 317 | OriginStoreWeights = MDBuilder(*C).createBranchWeights(1, 1000); |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 318 | |
| 319 | // Insert a call to __msan_init/__msan_track_origins into the module's CTORs. |
| 320 | appendToGlobalCtors(M, cast<Function>(M.getOrInsertFunction( |
| 321 | "__msan_init", IRB.getVoidTy(), NULL)), 0); |
| 322 | |
| 323 | new GlobalVariable(M, IRB.getInt32Ty(), true, GlobalValue::WeakODRLinkage, |
| 324 | IRB.getInt32(ClTrackOrigins), "__msan_track_origins"); |
| 325 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 326 | return true; |
| 327 | } |
| 328 | |
| 329 | namespace { |
| 330 | |
| 331 | /// \brief A helper class that handles instrumentation of VarArg |
| 332 | /// functions on a particular platform. |
| 333 | /// |
| 334 | /// Implementations are expected to insert the instrumentation |
| 335 | /// necessary to propagate argument shadow through VarArg function |
| 336 | /// calls. Visit* methods are called during an InstVisitor pass over |
| 337 | /// the function, and should avoid creating new basic blocks. A new |
| 338 | /// instance of this class is created for each instrumented function. |
| 339 | struct VarArgHelper { |
| 340 | /// \brief Visit a CallSite. |
| 341 | virtual void visitCallSite(CallSite &CS, IRBuilder<> &IRB) = 0; |
| 342 | |
| 343 | /// \brief Visit a va_start call. |
| 344 | virtual void visitVAStartInst(VAStartInst &I) = 0; |
| 345 | |
| 346 | /// \brief Visit a va_copy call. |
| 347 | virtual void visitVACopyInst(VACopyInst &I) = 0; |
| 348 | |
| 349 | /// \brief Finalize function instrumentation. |
| 350 | /// |
| 351 | /// This method is called after visiting all interesting (see above) |
| 352 | /// instructions in a function. |
| 353 | virtual void finalizeInstrumentation() = 0; |
Evgeniy Stepanov | da0072b | 2012-11-29 13:12:03 +0000 | [diff] [blame] | 354 | |
| 355 | virtual ~VarArgHelper() {} |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 356 | }; |
| 357 | |
| 358 | struct MemorySanitizerVisitor; |
| 359 | |
| 360 | VarArgHelper* |
| 361 | CreateVarArgHelper(Function &Func, MemorySanitizer &Msan, |
| 362 | MemorySanitizerVisitor &Visitor); |
| 363 | |
| 364 | /// This class does all the work for a given function. Store and Load |
| 365 | /// instructions store and load corresponding shadow and origin |
| 366 | /// values. Most instructions propagate shadow from arguments to their |
| 367 | /// return values. Certain instructions (most importantly, BranchInst) |
| 368 | /// test their argument shadow and print reports (with a runtime call) if it's |
| 369 | /// non-zero. |
| 370 | struct MemorySanitizerVisitor : public InstVisitor<MemorySanitizerVisitor> { |
| 371 | Function &F; |
| 372 | MemorySanitizer &MS; |
| 373 | SmallVector<PHINode *, 16> ShadowPHINodes, OriginPHINodes; |
| 374 | ValueMap<Value*, Value*> ShadowMap, OriginMap; |
| 375 | bool InsertChecks; |
| 376 | OwningPtr<VarArgHelper> VAHelper; |
| 377 | |
| 378 | // An unfortunate workaround for asymmetric lowering of va_arg stuff. |
| 379 | // See a comment in visitCallSite for more details. |
| 380 | static const unsigned AMD64GpEndOffset = 48; // AMD64 ABI Draft 0.99.6 p3.5.7 |
| 381 | static const unsigned AMD64FpEndOffset = 176; |
| 382 | |
| 383 | struct ShadowOriginAndInsertPoint { |
| 384 | Instruction *Shadow; |
| 385 | Instruction *Origin; |
| 386 | Instruction *OrigIns; |
| 387 | ShadowOriginAndInsertPoint(Instruction *S, Instruction *O, Instruction *I) |
| 388 | : Shadow(S), Origin(O), OrigIns(I) { } |
| 389 | ShadowOriginAndInsertPoint() : Shadow(0), Origin(0), OrigIns(0) { } |
| 390 | }; |
| 391 | SmallVector<ShadowOriginAndInsertPoint, 16> InstrumentationList; |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 392 | SmallVector<Instruction*, 16> StoreList; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 393 | |
| 394 | MemorySanitizerVisitor(Function &F, MemorySanitizer &MS) |
| 395 | : F(F), MS(MS), VAHelper(CreateVarArgHelper(F, MS, *this)) { |
| 396 | InsertChecks = !MS.BL->isIn(F); |
| 397 | DEBUG(if (!InsertChecks) |
| 398 | dbgs() << "MemorySanitizer is not inserting checks into '" |
| 399 | << F.getName() << "'\n"); |
| 400 | } |
| 401 | |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 402 | void materializeStores() { |
| 403 | for (size_t i = 0, n = StoreList.size(); i < n; i++) { |
| 404 | StoreInst& I = *dyn_cast<StoreInst>(StoreList[i]); |
| 405 | |
| 406 | IRBuilder<> IRB(&I); |
| 407 | Value *Val = I.getValueOperand(); |
| 408 | Value *Addr = I.getPointerOperand(); |
| 409 | Value *Shadow = getShadow(Val); |
| 410 | Value *ShadowPtr = getShadowPtr(Addr, Shadow->getType(), IRB); |
| 411 | |
| 412 | StoreInst *NewSI = IRB.CreateAlignedStore(Shadow, ShadowPtr, I.getAlignment()); |
| 413 | DEBUG(dbgs() << " STORE: " << *NewSI << "\n"); |
| 414 | // If the store is volatile, add a check. |
| 415 | if (I.isVolatile()) |
| 416 | insertCheck(Val, &I); |
| 417 | if (ClCheckAccessAddress) |
| 418 | insertCheck(Addr, &I); |
| 419 | |
| 420 | if (ClTrackOrigins) { |
| 421 | if (ClStoreCleanOrigin || isa<StructType>(Shadow->getType())) { |
| 422 | IRB.CreateAlignedStore(getOrigin(Val), getOriginPtr(Addr, IRB), I.getAlignment()); |
| 423 | } else { |
| 424 | Value *ConvertedShadow = convertToShadowTyNoVec(Shadow, IRB); |
| 425 | |
| 426 | Constant *Cst = dyn_cast_or_null<Constant>(ConvertedShadow); |
| 427 | // TODO(eugenis): handle non-zero constant shadow by inserting an |
| 428 | // unconditional check (can not simply fail compilation as this could |
| 429 | // be in the dead code). |
| 430 | if (Cst) |
| 431 | continue; |
| 432 | |
| 433 | Value *Cmp = IRB.CreateICmpNE(ConvertedShadow, |
| 434 | getCleanShadow(ConvertedShadow), "_mscmp"); |
| 435 | Instruction *CheckTerm = |
| 436 | SplitBlockAndInsertIfThen(cast<Instruction>(Cmp), false, MS.OriginStoreWeights); |
| 437 | IRBuilder<> IRBNewBlock(CheckTerm); |
| 438 | IRBNewBlock.CreateAlignedStore(getOrigin(Val), |
| 439 | getOriginPtr(Addr, IRBNewBlock), I.getAlignment()); |
| 440 | } |
| 441 | } |
| 442 | } |
| 443 | } |
| 444 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 445 | void materializeChecks() { |
| 446 | for (size_t i = 0, n = InstrumentationList.size(); i < n; i++) { |
| 447 | Instruction *Shadow = InstrumentationList[i].Shadow; |
| 448 | Instruction *OrigIns = InstrumentationList[i].OrigIns; |
| 449 | IRBuilder<> IRB(OrigIns); |
| 450 | DEBUG(dbgs() << " SHAD0 : " << *Shadow << "\n"); |
| 451 | Value *ConvertedShadow = convertToShadowTyNoVec(Shadow, IRB); |
| 452 | DEBUG(dbgs() << " SHAD1 : " << *ConvertedShadow << "\n"); |
| 453 | Value *Cmp = IRB.CreateICmpNE(ConvertedShadow, |
| 454 | getCleanShadow(ConvertedShadow), "_mscmp"); |
| 455 | Instruction *CheckTerm = |
| 456 | SplitBlockAndInsertIfThen(cast<Instruction>(Cmp), |
| 457 | /* Unreachable */ !ClKeepGoing, |
| 458 | MS.ColdCallWeights); |
| 459 | |
| 460 | IRB.SetInsertPoint(CheckTerm); |
| 461 | if (ClTrackOrigins) { |
| 462 | Instruction *Origin = InstrumentationList[i].Origin; |
| 463 | IRB.CreateStore(Origin ? (Value*)Origin : (Value*)IRB.getInt32(0), |
| 464 | MS.OriginTLS); |
| 465 | } |
| 466 | CallInst *Call = IRB.CreateCall(MS.WarningFn); |
| 467 | Call->setDebugLoc(OrigIns->getDebugLoc()); |
Evgeniy Stepanov | 1d2da65 | 2012-11-29 12:30:18 +0000 | [diff] [blame] | 468 | IRB.CreateCall(MS.EmptyAsm); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 469 | DEBUG(dbgs() << " CHECK: " << *Cmp << "\n"); |
| 470 | } |
| 471 | DEBUG(dbgs() << "DONE:\n" << F); |
| 472 | } |
| 473 | |
| 474 | /// \brief Add MemorySanitizer instrumentation to a function. |
| 475 | bool runOnFunction() { |
Evgeniy Stepanov | 94b257d | 2012-12-05 13:14:33 +0000 | [diff] [blame] | 476 | MS.initializeCallbacks(*F.getParent()); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 477 | if (!MS.TD) return false; |
| 478 | // Iterate all BBs in depth-first order and create shadow instructions |
| 479 | // for all instructions (where applicable). |
| 480 | // For PHI nodes we create dummy shadow PHIs which will be finalized later. |
| 481 | for (df_iterator<BasicBlock*> DI = df_begin(&F.getEntryBlock()), |
| 482 | DE = df_end(&F.getEntryBlock()); DI != DE; ++DI) { |
| 483 | BasicBlock *BB = *DI; |
| 484 | visit(*BB); |
| 485 | } |
| 486 | |
| 487 | // Finalize PHI nodes. |
| 488 | for (size_t i = 0, n = ShadowPHINodes.size(); i < n; i++) { |
| 489 | PHINode *PN = ShadowPHINodes[i]; |
| 490 | PHINode *PNS = cast<PHINode>(getShadow(PN)); |
| 491 | PHINode *PNO = ClTrackOrigins ? cast<PHINode>(getOrigin(PN)) : 0; |
| 492 | size_t NumValues = PN->getNumIncomingValues(); |
| 493 | for (size_t v = 0; v < NumValues; v++) { |
| 494 | PNS->addIncoming(getShadow(PN, v), PN->getIncomingBlock(v)); |
| 495 | if (PNO) |
| 496 | PNO->addIncoming(getOrigin(PN, v), PN->getIncomingBlock(v)); |
| 497 | } |
| 498 | } |
| 499 | |
| 500 | VAHelper->finalizeInstrumentation(); |
| 501 | |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 502 | // Delayed instrumentation of StoreInst. |
Evgeniy Stepanov | 47ac9ba | 2012-12-06 11:58:59 +0000 | [diff] [blame^] | 503 | // This may add new checks to be inserted later. |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 504 | materializeStores(); |
| 505 | |
| 506 | // Insert shadow value checks. |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 507 | materializeChecks(); |
| 508 | |
| 509 | return true; |
| 510 | } |
| 511 | |
| 512 | /// \brief Compute the shadow type that corresponds to a given Value. |
| 513 | Type *getShadowTy(Value *V) { |
| 514 | return getShadowTy(V->getType()); |
| 515 | } |
| 516 | |
| 517 | /// \brief Compute the shadow type that corresponds to a given Type. |
| 518 | Type *getShadowTy(Type *OrigTy) { |
| 519 | if (!OrigTy->isSized()) { |
| 520 | return 0; |
| 521 | } |
| 522 | // For integer type, shadow is the same as the original type. |
| 523 | // This may return weird-sized types like i1. |
| 524 | if (IntegerType *IT = dyn_cast<IntegerType>(OrigTy)) |
| 525 | return IT; |
| 526 | if (VectorType *VT = dyn_cast<VectorType>(OrigTy)) |
| 527 | return VectorType::getInteger(VT); |
| 528 | if (StructType *ST = dyn_cast<StructType>(OrigTy)) { |
| 529 | SmallVector<Type*, 4> Elements; |
| 530 | for (unsigned i = 0, n = ST->getNumElements(); i < n; i++) |
| 531 | Elements.push_back(getShadowTy(ST->getElementType(i))); |
| 532 | StructType *Res = StructType::get(*MS.C, Elements, ST->isPacked()); |
| 533 | DEBUG(dbgs() << "getShadowTy: " << *ST << " ===> " << *Res << "\n"); |
| 534 | return Res; |
| 535 | } |
| 536 | uint32_t TypeSize = MS.TD->getTypeStoreSizeInBits(OrigTy); |
| 537 | return IntegerType::get(*MS.C, TypeSize); |
| 538 | } |
| 539 | |
| 540 | /// \brief Flatten a vector type. |
| 541 | Type *getShadowTyNoVec(Type *ty) { |
| 542 | if (VectorType *vt = dyn_cast<VectorType>(ty)) |
| 543 | return IntegerType::get(*MS.C, vt->getBitWidth()); |
| 544 | return ty; |
| 545 | } |
| 546 | |
| 547 | /// \brief Convert a shadow value to it's flattened variant. |
| 548 | Value *convertToShadowTyNoVec(Value *V, IRBuilder<> &IRB) { |
| 549 | Type *Ty = V->getType(); |
| 550 | Type *NoVecTy = getShadowTyNoVec(Ty); |
| 551 | if (Ty == NoVecTy) return V; |
| 552 | return IRB.CreateBitCast(V, NoVecTy); |
| 553 | } |
| 554 | |
| 555 | /// \brief Compute the shadow address that corresponds to a given application |
| 556 | /// address. |
| 557 | /// |
| 558 | /// Shadow = Addr & ~ShadowMask. |
| 559 | Value *getShadowPtr(Value *Addr, Type *ShadowTy, |
| 560 | IRBuilder<> &IRB) { |
| 561 | Value *ShadowLong = |
| 562 | IRB.CreateAnd(IRB.CreatePointerCast(Addr, MS.IntptrTy), |
| 563 | ConstantInt::get(MS.IntptrTy, ~MS.ShadowMask)); |
| 564 | return IRB.CreateIntToPtr(ShadowLong, PointerType::get(ShadowTy, 0)); |
| 565 | } |
| 566 | |
| 567 | /// \brief Compute the origin address that corresponds to a given application |
| 568 | /// address. |
| 569 | /// |
| 570 | /// OriginAddr = (ShadowAddr + OriginOffset) & ~3ULL |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 571 | Value *getOriginPtr(Value *Addr, IRBuilder<> &IRB) { |
| 572 | Value *ShadowLong = |
| 573 | IRB.CreateAnd(IRB.CreatePointerCast(Addr, MS.IntptrTy), |
Evgeniy Stepanov | 62ba611 | 2012-11-29 13:43:05 +0000 | [diff] [blame] | 574 | ConstantInt::get(MS.IntptrTy, ~MS.ShadowMask)); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 575 | Value *Add = |
| 576 | IRB.CreateAdd(ShadowLong, |
| 577 | ConstantInt::get(MS.IntptrTy, MS.OriginOffset)); |
Evgeniy Stepanov | 62ba611 | 2012-11-29 13:43:05 +0000 | [diff] [blame] | 578 | Value *SecondAnd = |
| 579 | IRB.CreateAnd(Add, ConstantInt::get(MS.IntptrTy, ~3ULL)); |
| 580 | return IRB.CreateIntToPtr(SecondAnd, PointerType::get(IRB.getInt32Ty(), 0)); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 581 | } |
| 582 | |
| 583 | /// \brief Compute the shadow address for a given function argument. |
| 584 | /// |
| 585 | /// Shadow = ParamTLS+ArgOffset. |
| 586 | Value *getShadowPtrForArgument(Value *A, IRBuilder<> &IRB, |
| 587 | int ArgOffset) { |
| 588 | Value *Base = IRB.CreatePointerCast(MS.ParamTLS, MS.IntptrTy); |
| 589 | Base = IRB.CreateAdd(Base, ConstantInt::get(MS.IntptrTy, ArgOffset)); |
| 590 | return IRB.CreateIntToPtr(Base, PointerType::get(getShadowTy(A), 0), |
| 591 | "_msarg"); |
| 592 | } |
| 593 | |
| 594 | /// \brief Compute the origin address for a given function argument. |
| 595 | Value *getOriginPtrForArgument(Value *A, IRBuilder<> &IRB, |
| 596 | int ArgOffset) { |
| 597 | if (!ClTrackOrigins) return 0; |
| 598 | Value *Base = IRB.CreatePointerCast(MS.ParamOriginTLS, MS.IntptrTy); |
| 599 | Base = IRB.CreateAdd(Base, ConstantInt::get(MS.IntptrTy, ArgOffset)); |
| 600 | return IRB.CreateIntToPtr(Base, PointerType::get(MS.OriginTy, 0), |
| 601 | "_msarg_o"); |
| 602 | } |
| 603 | |
| 604 | /// \brief Compute the shadow address for a retval. |
| 605 | Value *getShadowPtrForRetval(Value *A, IRBuilder<> &IRB) { |
| 606 | Value *Base = IRB.CreatePointerCast(MS.RetvalTLS, MS.IntptrTy); |
| 607 | return IRB.CreateIntToPtr(Base, PointerType::get(getShadowTy(A), 0), |
| 608 | "_msret"); |
| 609 | } |
| 610 | |
| 611 | /// \brief Compute the origin address for a retval. |
| 612 | Value *getOriginPtrForRetval(IRBuilder<> &IRB) { |
| 613 | // We keep a single origin for the entire retval. Might be too optimistic. |
| 614 | return MS.RetvalOriginTLS; |
| 615 | } |
| 616 | |
| 617 | /// \brief Set SV to be the shadow value for V. |
| 618 | void setShadow(Value *V, Value *SV) { |
| 619 | assert(!ShadowMap.count(V) && "Values may only have one shadow"); |
| 620 | ShadowMap[V] = SV; |
| 621 | } |
| 622 | |
| 623 | /// \brief Set Origin to be the origin value for V. |
| 624 | void setOrigin(Value *V, Value *Origin) { |
| 625 | if (!ClTrackOrigins) return; |
| 626 | assert(!OriginMap.count(V) && "Values may only have one origin"); |
| 627 | DEBUG(dbgs() << "ORIGIN: " << *V << " ==> " << *Origin << "\n"); |
| 628 | OriginMap[V] = Origin; |
| 629 | } |
| 630 | |
| 631 | /// \brief Create a clean shadow value for a given value. |
| 632 | /// |
| 633 | /// Clean shadow (all zeroes) means all bits of the value are defined |
| 634 | /// (initialized). |
| 635 | Value *getCleanShadow(Value *V) { |
| 636 | Type *ShadowTy = getShadowTy(V); |
| 637 | if (!ShadowTy) |
| 638 | return 0; |
| 639 | return Constant::getNullValue(ShadowTy); |
| 640 | } |
| 641 | |
| 642 | /// \brief Create a dirty shadow of a given shadow type. |
| 643 | Constant *getPoisonedShadow(Type *ShadowTy) { |
| 644 | assert(ShadowTy); |
| 645 | if (isa<IntegerType>(ShadowTy) || isa<VectorType>(ShadowTy)) |
| 646 | return Constant::getAllOnesValue(ShadowTy); |
| 647 | StructType *ST = cast<StructType>(ShadowTy); |
| 648 | SmallVector<Constant *, 4> Vals; |
| 649 | for (unsigned i = 0, n = ST->getNumElements(); i < n; i++) |
| 650 | Vals.push_back(getPoisonedShadow(ST->getElementType(i))); |
| 651 | return ConstantStruct::get(ST, Vals); |
| 652 | } |
| 653 | |
| 654 | /// \brief Create a clean (zero) origin. |
| 655 | Value *getCleanOrigin() { |
| 656 | return Constant::getNullValue(MS.OriginTy); |
| 657 | } |
| 658 | |
| 659 | /// \brief Get the shadow value for a given Value. |
| 660 | /// |
| 661 | /// This function either returns the value set earlier with setShadow, |
| 662 | /// or extracts if from ParamTLS (for function arguments). |
| 663 | Value *getShadow(Value *V) { |
| 664 | if (Instruction *I = dyn_cast<Instruction>(V)) { |
| 665 | // For instructions the shadow is already stored in the map. |
| 666 | Value *Shadow = ShadowMap[V]; |
| 667 | if (!Shadow) { |
| 668 | DEBUG(dbgs() << "No shadow: " << *V << "\n" << *(I->getParent())); |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 669 | (void)I; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 670 | assert(Shadow && "No shadow for a value"); |
| 671 | } |
| 672 | return Shadow; |
| 673 | } |
| 674 | if (UndefValue *U = dyn_cast<UndefValue>(V)) { |
| 675 | Value *AllOnes = getPoisonedShadow(getShadowTy(V)); |
| 676 | DEBUG(dbgs() << "Undef: " << *U << " ==> " << *AllOnes << "\n"); |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 677 | (void)U; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 678 | return AllOnes; |
| 679 | } |
| 680 | if (Argument *A = dyn_cast<Argument>(V)) { |
| 681 | // For arguments we compute the shadow on demand and store it in the map. |
| 682 | Value **ShadowPtr = &ShadowMap[V]; |
| 683 | if (*ShadowPtr) |
| 684 | return *ShadowPtr; |
| 685 | Function *F = A->getParent(); |
| 686 | IRBuilder<> EntryIRB(F->getEntryBlock().getFirstNonPHI()); |
| 687 | unsigned ArgOffset = 0; |
| 688 | for (Function::arg_iterator AI = F->arg_begin(), AE = F->arg_end(); |
| 689 | AI != AE; ++AI) { |
| 690 | if (!AI->getType()->isSized()) { |
| 691 | DEBUG(dbgs() << "Arg is not sized\n"); |
| 692 | continue; |
| 693 | } |
| 694 | unsigned Size = AI->hasByValAttr() |
| 695 | ? MS.TD->getTypeAllocSize(AI->getType()->getPointerElementType()) |
| 696 | : MS.TD->getTypeAllocSize(AI->getType()); |
| 697 | if (A == AI) { |
| 698 | Value *Base = getShadowPtrForArgument(AI, EntryIRB, ArgOffset); |
| 699 | if (AI->hasByValAttr()) { |
| 700 | // ByVal pointer itself has clean shadow. We copy the actual |
| 701 | // argument shadow to the underlying memory. |
| 702 | Value *Cpy = EntryIRB.CreateMemCpy( |
| 703 | getShadowPtr(V, EntryIRB.getInt8Ty(), EntryIRB), |
| 704 | Base, Size, AI->getParamAlignment()); |
| 705 | DEBUG(dbgs() << " ByValCpy: " << *Cpy << "\n"); |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 706 | (void)Cpy; |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 707 | *ShadowPtr = getCleanShadow(V); |
| 708 | } else { |
| 709 | *ShadowPtr = EntryIRB.CreateLoad(Base); |
| 710 | } |
| 711 | DEBUG(dbgs() << " ARG: " << *AI << " ==> " << |
| 712 | **ShadowPtr << "\n"); |
| 713 | if (ClTrackOrigins) { |
| 714 | Value* OriginPtr = getOriginPtrForArgument(AI, EntryIRB, ArgOffset); |
| 715 | setOrigin(A, EntryIRB.CreateLoad(OriginPtr)); |
| 716 | } |
| 717 | } |
| 718 | ArgOffset += DataLayout::RoundUpAlignment(Size, 8); |
| 719 | } |
| 720 | assert(*ShadowPtr && "Could not find shadow for an argument"); |
| 721 | return *ShadowPtr; |
| 722 | } |
| 723 | // For everything else the shadow is zero. |
| 724 | return getCleanShadow(V); |
| 725 | } |
| 726 | |
| 727 | /// \brief Get the shadow for i-th argument of the instruction I. |
| 728 | Value *getShadow(Instruction *I, int i) { |
| 729 | return getShadow(I->getOperand(i)); |
| 730 | } |
| 731 | |
| 732 | /// \brief Get the origin for a value. |
| 733 | Value *getOrigin(Value *V) { |
| 734 | if (!ClTrackOrigins) return 0; |
| 735 | if (isa<Instruction>(V) || isa<Argument>(V)) { |
| 736 | Value *Origin = OriginMap[V]; |
| 737 | if (!Origin) { |
| 738 | DEBUG(dbgs() << "NO ORIGIN: " << *V << "\n"); |
| 739 | Origin = getCleanOrigin(); |
| 740 | } |
| 741 | return Origin; |
| 742 | } |
| 743 | return getCleanOrigin(); |
| 744 | } |
| 745 | |
| 746 | /// \brief Get the origin for i-th argument of the instruction I. |
| 747 | Value *getOrigin(Instruction *I, int i) { |
| 748 | return getOrigin(I->getOperand(i)); |
| 749 | } |
| 750 | |
| 751 | /// \brief Remember the place where a shadow check should be inserted. |
| 752 | /// |
| 753 | /// This location will be later instrumented with a check that will print a |
| 754 | /// UMR warning in runtime if the value is not fully defined. |
| 755 | void insertCheck(Value *Val, Instruction *OrigIns) { |
| 756 | assert(Val); |
| 757 | if (!InsertChecks) return; |
| 758 | Instruction *Shadow = dyn_cast_or_null<Instruction>(getShadow(Val)); |
| 759 | if (!Shadow) return; |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 760 | #ifndef NDEBUG |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 761 | Type *ShadowTy = Shadow->getType(); |
| 762 | assert((isa<IntegerType>(ShadowTy) || isa<VectorType>(ShadowTy)) && |
| 763 | "Can only insert checks for integer and vector shadow types"); |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 764 | #endif |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 765 | Instruction *Origin = dyn_cast_or_null<Instruction>(getOrigin(Val)); |
| 766 | InstrumentationList.push_back( |
| 767 | ShadowOriginAndInsertPoint(Shadow, Origin, OrigIns)); |
| 768 | } |
| 769 | |
| 770 | //------------------- Visitors. |
| 771 | |
| 772 | /// \brief Instrument LoadInst |
| 773 | /// |
| 774 | /// Loads the corresponding shadow and (optionally) origin. |
| 775 | /// Optionally, checks that the load address is fully defined. |
| 776 | void visitLoadInst(LoadInst &I) { |
Matt Beaumont-Gay | c76536f | 2012-11-29 18:15:49 +0000 | [diff] [blame] | 777 | assert(I.getType()->isSized() && "Load type must have size"); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 778 | IRBuilder<> IRB(&I); |
| 779 | Type *ShadowTy = getShadowTy(&I); |
| 780 | Value *Addr = I.getPointerOperand(); |
| 781 | Value *ShadowPtr = getShadowPtr(Addr, ShadowTy, IRB); |
Evgeniy Stepanov | eeb8b7c | 2012-11-29 14:05:53 +0000 | [diff] [blame] | 782 | setShadow(&I, IRB.CreateAlignedLoad(ShadowPtr, I.getAlignment(), "_msld")); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 783 | |
| 784 | if (ClCheckAccessAddress) |
| 785 | insertCheck(I.getPointerOperand(), &I); |
| 786 | |
| 787 | if (ClTrackOrigins) |
Evgeniy Stepanov | eeb8b7c | 2012-11-29 14:05:53 +0000 | [diff] [blame] | 788 | setOrigin(&I, IRB.CreateAlignedLoad(getOriginPtr(Addr, IRB), I.getAlignment())); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 789 | } |
| 790 | |
| 791 | /// \brief Instrument StoreInst |
| 792 | /// |
| 793 | /// Stores the corresponding shadow and (optionally) origin. |
| 794 | /// Optionally, checks that the store address is fully defined. |
| 795 | /// Volatile stores check that the value being stored is fully defined. |
| 796 | void visitStoreInst(StoreInst &I) { |
Evgeniy Stepanov | 4f220d9 | 2012-12-06 11:41:03 +0000 | [diff] [blame] | 797 | StoreList.push_back(&I); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 798 | } |
| 799 | |
Evgeniy Stepanov | 30484fc | 2012-11-29 15:22:06 +0000 | [diff] [blame] | 800 | // Vector manipulation. |
| 801 | void visitExtractElementInst(ExtractElementInst &I) { |
| 802 | insertCheck(I.getOperand(1), &I); |
| 803 | IRBuilder<> IRB(&I); |
| 804 | setShadow(&I, IRB.CreateExtractElement(getShadow(&I, 0), I.getOperand(1), |
| 805 | "_msprop")); |
| 806 | setOrigin(&I, getOrigin(&I, 0)); |
| 807 | } |
| 808 | |
| 809 | void visitInsertElementInst(InsertElementInst &I) { |
| 810 | insertCheck(I.getOperand(2), &I); |
| 811 | IRBuilder<> IRB(&I); |
| 812 | setShadow(&I, IRB.CreateInsertElement(getShadow(&I, 0), getShadow(&I, 1), |
| 813 | I.getOperand(2), "_msprop")); |
| 814 | setOriginForNaryOp(I); |
| 815 | } |
| 816 | |
| 817 | void visitShuffleVectorInst(ShuffleVectorInst &I) { |
| 818 | insertCheck(I.getOperand(2), &I); |
| 819 | IRBuilder<> IRB(&I); |
| 820 | setShadow(&I, IRB.CreateShuffleVector(getShadow(&I, 0), getShadow(&I, 1), |
| 821 | I.getOperand(2), "_msprop")); |
| 822 | setOriginForNaryOp(I); |
| 823 | } |
| 824 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 825 | // Casts. |
| 826 | void visitSExtInst(SExtInst &I) { |
| 827 | IRBuilder<> IRB(&I); |
| 828 | setShadow(&I, IRB.CreateSExt(getShadow(&I, 0), I.getType(), "_msprop")); |
| 829 | setOrigin(&I, getOrigin(&I, 0)); |
| 830 | } |
| 831 | |
| 832 | void visitZExtInst(ZExtInst &I) { |
| 833 | IRBuilder<> IRB(&I); |
| 834 | setShadow(&I, IRB.CreateZExt(getShadow(&I, 0), I.getType(), "_msprop")); |
| 835 | setOrigin(&I, getOrigin(&I, 0)); |
| 836 | } |
| 837 | |
| 838 | void visitTruncInst(TruncInst &I) { |
| 839 | IRBuilder<> IRB(&I); |
| 840 | setShadow(&I, IRB.CreateTrunc(getShadow(&I, 0), I.getType(), "_msprop")); |
| 841 | setOrigin(&I, getOrigin(&I, 0)); |
| 842 | } |
| 843 | |
| 844 | void visitBitCastInst(BitCastInst &I) { |
| 845 | IRBuilder<> IRB(&I); |
| 846 | setShadow(&I, IRB.CreateBitCast(getShadow(&I, 0), getShadowTy(&I))); |
| 847 | setOrigin(&I, getOrigin(&I, 0)); |
| 848 | } |
| 849 | |
| 850 | void visitPtrToIntInst(PtrToIntInst &I) { |
| 851 | IRBuilder<> IRB(&I); |
| 852 | setShadow(&I, IRB.CreateIntCast(getShadow(&I, 0), getShadowTy(&I), false, |
| 853 | "_msprop_ptrtoint")); |
| 854 | setOrigin(&I, getOrigin(&I, 0)); |
| 855 | } |
| 856 | |
| 857 | void visitIntToPtrInst(IntToPtrInst &I) { |
| 858 | IRBuilder<> IRB(&I); |
| 859 | setShadow(&I, IRB.CreateIntCast(getShadow(&I, 0), getShadowTy(&I), false, |
| 860 | "_msprop_inttoptr")); |
| 861 | setOrigin(&I, getOrigin(&I, 0)); |
| 862 | } |
| 863 | |
| 864 | void visitFPToSIInst(CastInst& I) { handleShadowOr(I); } |
| 865 | void visitFPToUIInst(CastInst& I) { handleShadowOr(I); } |
| 866 | void visitSIToFPInst(CastInst& I) { handleShadowOr(I); } |
| 867 | void visitUIToFPInst(CastInst& I) { handleShadowOr(I); } |
| 868 | void visitFPExtInst(CastInst& I) { handleShadowOr(I); } |
| 869 | void visitFPTruncInst(CastInst& I) { handleShadowOr(I); } |
| 870 | |
| 871 | /// \brief Propagate shadow for bitwise AND. |
| 872 | /// |
| 873 | /// This code is exact, i.e. if, for example, a bit in the left argument |
| 874 | /// is defined and 0, then neither the value not definedness of the |
| 875 | /// corresponding bit in B don't affect the resulting shadow. |
| 876 | void visitAnd(BinaryOperator &I) { |
| 877 | IRBuilder<> IRB(&I); |
| 878 | // "And" of 0 and a poisoned value results in unpoisoned value. |
| 879 | // 1&1 => 1; 0&1 => 0; p&1 => p; |
| 880 | // 1&0 => 0; 0&0 => 0; p&0 => 0; |
| 881 | // 1&p => p; 0&p => 0; p&p => p; |
| 882 | // S = (S1 & S2) | (V1 & S2) | (S1 & V2) |
| 883 | Value *S1 = getShadow(&I, 0); |
| 884 | Value *S2 = getShadow(&I, 1); |
| 885 | Value *V1 = I.getOperand(0); |
| 886 | Value *V2 = I.getOperand(1); |
| 887 | if (V1->getType() != S1->getType()) { |
| 888 | V1 = IRB.CreateIntCast(V1, S1->getType(), false); |
| 889 | V2 = IRB.CreateIntCast(V2, S2->getType(), false); |
| 890 | } |
| 891 | Value *S1S2 = IRB.CreateAnd(S1, S2); |
| 892 | Value *V1S2 = IRB.CreateAnd(V1, S2); |
| 893 | Value *S1V2 = IRB.CreateAnd(S1, V2); |
| 894 | setShadow(&I, IRB.CreateOr(S1S2, IRB.CreateOr(V1S2, S1V2))); |
| 895 | setOriginForNaryOp(I); |
| 896 | } |
| 897 | |
| 898 | void visitOr(BinaryOperator &I) { |
| 899 | IRBuilder<> IRB(&I); |
| 900 | // "Or" of 1 and a poisoned value results in unpoisoned value. |
| 901 | // 1|1 => 1; 0|1 => 1; p|1 => 1; |
| 902 | // 1|0 => 1; 0|0 => 0; p|0 => p; |
| 903 | // 1|p => 1; 0|p => p; p|p => p; |
| 904 | // S = (S1 & S2) | (~V1 & S2) | (S1 & ~V2) |
| 905 | Value *S1 = getShadow(&I, 0); |
| 906 | Value *S2 = getShadow(&I, 1); |
| 907 | Value *V1 = IRB.CreateNot(I.getOperand(0)); |
| 908 | Value *V2 = IRB.CreateNot(I.getOperand(1)); |
| 909 | if (V1->getType() != S1->getType()) { |
| 910 | V1 = IRB.CreateIntCast(V1, S1->getType(), false); |
| 911 | V2 = IRB.CreateIntCast(V2, S2->getType(), false); |
| 912 | } |
| 913 | Value *S1S2 = IRB.CreateAnd(S1, S2); |
| 914 | Value *V1S2 = IRB.CreateAnd(V1, S2); |
| 915 | Value *S1V2 = IRB.CreateAnd(S1, V2); |
| 916 | setShadow(&I, IRB.CreateOr(S1S2, IRB.CreateOr(V1S2, S1V2))); |
| 917 | setOriginForNaryOp(I); |
| 918 | } |
| 919 | |
| 920 | /// \brief Propagate origin for an instruction. |
| 921 | /// |
| 922 | /// This is a general case of origin propagation. For an Nary operation, |
| 923 | /// is set to the origin of an argument that is not entirely initialized. |
Evgeniy Stepanov | f433cec | 2012-11-29 14:44:00 +0000 | [diff] [blame] | 924 | /// If there is more than one such arguments, the rightmost of them is picked. |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 925 | /// It does not matter which one is picked if all arguments are initialized. |
| 926 | void setOriginForNaryOp(Instruction &I) { |
| 927 | if (!ClTrackOrigins) return; |
| 928 | IRBuilder<> IRB(&I); |
| 929 | Value *Origin = getOrigin(&I, 0); |
| 930 | for (unsigned Op = 1, n = I.getNumOperands(); Op < n; ++Op) { |
Evgeniy Stepanov | f433cec | 2012-11-29 14:44:00 +0000 | [diff] [blame] | 931 | Value *S = convertToShadowTyNoVec(getShadow(&I, Op), IRB); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 932 | Origin = IRB.CreateSelect(IRB.CreateICmpNE(S, getCleanShadow(S)), |
Evgeniy Stepanov | f433cec | 2012-11-29 14:44:00 +0000 | [diff] [blame] | 933 | getOrigin(&I, Op), Origin); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 934 | } |
| 935 | setOrigin(&I, Origin); |
| 936 | } |
| 937 | |
| 938 | /// \brief Propagate shadow for a binary operation. |
| 939 | /// |
| 940 | /// Shadow = Shadow0 | Shadow1, all 3 must have the same type. |
| 941 | /// Bitwise OR is selected as an operation that will never lose even a bit of |
| 942 | /// poison. |
| 943 | void handleShadowOrBinary(Instruction &I) { |
| 944 | IRBuilder<> IRB(&I); |
| 945 | Value *Shadow0 = getShadow(&I, 0); |
| 946 | Value *Shadow1 = getShadow(&I, 1); |
| 947 | setShadow(&I, IRB.CreateOr(Shadow0, Shadow1, "_msprop")); |
| 948 | setOriginForNaryOp(I); |
| 949 | } |
| 950 | |
| 951 | /// \brief Propagate shadow for arbitrary operation. |
| 952 | /// |
| 953 | /// This is a general case of shadow propagation, used in all cases where we |
| 954 | /// don't know and/or care about what the operation actually does. |
| 955 | /// It converts all input shadow values to a common type (extending or |
| 956 | /// truncating as necessary), and bitwise OR's them. |
| 957 | /// |
| 958 | /// This is much cheaper than inserting checks (i.e. requiring inputs to be |
| 959 | /// fully initialized), and less prone to false positives. |
| 960 | // FIXME: is the casting actually correct? |
| 961 | // FIXME: merge this with handleShadowOrBinary. |
| 962 | void handleShadowOr(Instruction &I) { |
| 963 | IRBuilder<> IRB(&I); |
| 964 | Value *Shadow = getShadow(&I, 0); |
| 965 | for (unsigned Op = 1, n = I.getNumOperands(); Op < n; ++Op) |
| 966 | Shadow = IRB.CreateOr( |
| 967 | Shadow, IRB.CreateIntCast(getShadow(&I, Op), Shadow->getType(), false), |
| 968 | "_msprop"); |
| 969 | Shadow = IRB.CreateIntCast(Shadow, getShadowTy(&I), false); |
| 970 | setShadow(&I, Shadow); |
| 971 | setOriginForNaryOp(I); |
| 972 | } |
| 973 | |
| 974 | void visitFAdd(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 975 | void visitFSub(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 976 | void visitFMul(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 977 | void visitAdd(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 978 | void visitSub(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 979 | void visitXor(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 980 | void visitMul(BinaryOperator &I) { handleShadowOrBinary(I); } |
| 981 | |
| 982 | void handleDiv(Instruction &I) { |
| 983 | IRBuilder<> IRB(&I); |
| 984 | // Strict on the second argument. |
| 985 | insertCheck(I.getOperand(1), &I); |
| 986 | setShadow(&I, getShadow(&I, 0)); |
| 987 | setOrigin(&I, getOrigin(&I, 0)); |
| 988 | } |
| 989 | |
| 990 | void visitUDiv(BinaryOperator &I) { handleDiv(I); } |
| 991 | void visitSDiv(BinaryOperator &I) { handleDiv(I); } |
| 992 | void visitFDiv(BinaryOperator &I) { handleDiv(I); } |
| 993 | void visitURem(BinaryOperator &I) { handleDiv(I); } |
| 994 | void visitSRem(BinaryOperator &I) { handleDiv(I); } |
| 995 | void visitFRem(BinaryOperator &I) { handleDiv(I); } |
| 996 | |
| 997 | /// \brief Instrument == and != comparisons. |
| 998 | /// |
| 999 | /// Sometimes the comparison result is known even if some of the bits of the |
| 1000 | /// arguments are not. |
| 1001 | void handleEqualityComparison(ICmpInst &I) { |
| 1002 | IRBuilder<> IRB(&I); |
| 1003 | Value *A = I.getOperand(0); |
| 1004 | Value *B = I.getOperand(1); |
| 1005 | Value *Sa = getShadow(A); |
| 1006 | Value *Sb = getShadow(B); |
| 1007 | if (A->getType()->isPointerTy()) |
| 1008 | A = IRB.CreatePointerCast(A, MS.IntptrTy); |
| 1009 | if (B->getType()->isPointerTy()) |
| 1010 | B = IRB.CreatePointerCast(B, MS.IntptrTy); |
| 1011 | // A == B <==> (C = A^B) == 0 |
| 1012 | // A != B <==> (C = A^B) != 0 |
| 1013 | // Sc = Sa | Sb |
| 1014 | Value *C = IRB.CreateXor(A, B); |
| 1015 | Value *Sc = IRB.CreateOr(Sa, Sb); |
| 1016 | // Now dealing with i = (C == 0) comparison (or C != 0, does not matter now) |
| 1017 | // Result is defined if one of the following is true |
| 1018 | // * there is a defined 1 bit in C |
| 1019 | // * C is fully defined |
| 1020 | // Si = !(C & ~Sc) && Sc |
| 1021 | Value *Zero = Constant::getNullValue(Sc->getType()); |
| 1022 | Value *MinusOne = Constant::getAllOnesValue(Sc->getType()); |
| 1023 | Value *Si = |
| 1024 | IRB.CreateAnd(IRB.CreateICmpNE(Sc, Zero), |
| 1025 | IRB.CreateICmpEQ( |
| 1026 | IRB.CreateAnd(IRB.CreateXor(Sc, MinusOne), C), Zero)); |
| 1027 | Si->setName("_msprop_icmp"); |
| 1028 | setShadow(&I, Si); |
| 1029 | setOriginForNaryOp(I); |
| 1030 | } |
| 1031 | |
Evgeniy Stepanov | 857d9d2 | 2012-11-29 14:25:47 +0000 | [diff] [blame] | 1032 | /// \brief Instrument signed relational comparisons. |
| 1033 | /// |
| 1034 | /// Handle (x<0) and (x>=0) comparisons (essentially, sign bit tests) by |
| 1035 | /// propagating the highest bit of the shadow. Everything else is delegated |
| 1036 | /// to handleShadowOr(). |
| 1037 | void handleSignedRelationalComparison(ICmpInst &I) { |
| 1038 | Constant *constOp0 = dyn_cast<Constant>(I.getOperand(0)); |
| 1039 | Constant *constOp1 = dyn_cast<Constant>(I.getOperand(1)); |
| 1040 | Value* op = NULL; |
| 1041 | CmpInst::Predicate pre = I.getPredicate(); |
| 1042 | if (constOp0 && constOp0->isNullValue() && |
| 1043 | (pre == CmpInst::ICMP_SGT || pre == CmpInst::ICMP_SLE)) { |
| 1044 | op = I.getOperand(1); |
| 1045 | } else if (constOp1 && constOp1->isNullValue() && |
| 1046 | (pre == CmpInst::ICMP_SLT || pre == CmpInst::ICMP_SGE)) { |
| 1047 | op = I.getOperand(0); |
| 1048 | } |
| 1049 | if (op) { |
| 1050 | IRBuilder<> IRB(&I); |
| 1051 | Value* Shadow = |
| 1052 | IRB.CreateICmpSLT(getShadow(op), getCleanShadow(op), "_msprop_icmpslt"); |
| 1053 | setShadow(&I, Shadow); |
| 1054 | setOrigin(&I, getOrigin(op)); |
| 1055 | } else { |
| 1056 | handleShadowOr(I); |
| 1057 | } |
| 1058 | } |
| 1059 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1060 | void visitICmpInst(ICmpInst &I) { |
| 1061 | if (ClHandleICmp && I.isEquality()) |
| 1062 | handleEqualityComparison(I); |
Evgeniy Stepanov | 857d9d2 | 2012-11-29 14:25:47 +0000 | [diff] [blame] | 1063 | else if (ClHandleICmp && I.isSigned() && I.isRelational()) |
| 1064 | handleSignedRelationalComparison(I); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1065 | else |
| 1066 | handleShadowOr(I); |
| 1067 | } |
| 1068 | |
| 1069 | void visitFCmpInst(FCmpInst &I) { |
| 1070 | handleShadowOr(I); |
| 1071 | } |
| 1072 | |
| 1073 | void handleShift(BinaryOperator &I) { |
| 1074 | IRBuilder<> IRB(&I); |
| 1075 | // If any of the S2 bits are poisoned, the whole thing is poisoned. |
| 1076 | // Otherwise perform the same shift on S1. |
| 1077 | Value *S1 = getShadow(&I, 0); |
| 1078 | Value *S2 = getShadow(&I, 1); |
| 1079 | Value *S2Conv = IRB.CreateSExt(IRB.CreateICmpNE(S2, getCleanShadow(S2)), |
| 1080 | S2->getType()); |
| 1081 | Value *V2 = I.getOperand(1); |
| 1082 | Value *Shift = IRB.CreateBinOp(I.getOpcode(), S1, V2); |
| 1083 | setShadow(&I, IRB.CreateOr(Shift, S2Conv)); |
| 1084 | setOriginForNaryOp(I); |
| 1085 | } |
| 1086 | |
| 1087 | void visitShl(BinaryOperator &I) { handleShift(I); } |
| 1088 | void visitAShr(BinaryOperator &I) { handleShift(I); } |
| 1089 | void visitLShr(BinaryOperator &I) { handleShift(I); } |
| 1090 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1091 | /// \brief Instrument llvm.memmove |
| 1092 | /// |
| 1093 | /// At this point we don't know if llvm.memmove will be inlined or not. |
| 1094 | /// If we don't instrument it and it gets inlined, |
| 1095 | /// our interceptor will not kick in and we will lose the memmove. |
| 1096 | /// If we instrument the call here, but it does not get inlined, |
| 1097 | /// we will memove the shadow twice: which is bad in case |
| 1098 | /// of overlapping regions. So, we simply lower the intrinsic to a call. |
| 1099 | /// |
Evgeniy Stepanov | 62b5db9 | 2012-11-29 12:49:04 +0000 | [diff] [blame] | 1100 | /// Similar situation exists for memcpy and memset. |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1101 | void visitMemMoveInst(MemMoveInst &I) { |
| 1102 | IRBuilder<> IRB(&I); |
| 1103 | IRB.CreateCall3( |
| 1104 | MS.MemmoveFn, |
| 1105 | IRB.CreatePointerCast(I.getArgOperand(0), IRB.getInt8PtrTy()), |
| 1106 | IRB.CreatePointerCast(I.getArgOperand(1), IRB.getInt8PtrTy()), |
| 1107 | IRB.CreateIntCast(I.getArgOperand(2), MS.IntptrTy, false)); |
| 1108 | I.eraseFromParent(); |
| 1109 | } |
| 1110 | |
Evgeniy Stepanov | 62b5db9 | 2012-11-29 12:49:04 +0000 | [diff] [blame] | 1111 | // Similar to memmove: avoid copying shadow twice. |
| 1112 | // This is somewhat unfortunate as it may slowdown small constant memcpys. |
| 1113 | // FIXME: consider doing manual inline for small constant sizes and proper |
| 1114 | // alignment. |
| 1115 | void visitMemCpyInst(MemCpyInst &I) { |
| 1116 | IRBuilder<> IRB(&I); |
| 1117 | IRB.CreateCall3( |
| 1118 | MS.MemcpyFn, |
| 1119 | IRB.CreatePointerCast(I.getArgOperand(0), IRB.getInt8PtrTy()), |
| 1120 | IRB.CreatePointerCast(I.getArgOperand(1), IRB.getInt8PtrTy()), |
| 1121 | IRB.CreateIntCast(I.getArgOperand(2), MS.IntptrTy, false)); |
| 1122 | I.eraseFromParent(); |
| 1123 | } |
| 1124 | |
| 1125 | // Same as memcpy. |
| 1126 | void visitMemSetInst(MemSetInst &I) { |
| 1127 | IRBuilder<> IRB(&I); |
| 1128 | IRB.CreateCall3( |
| 1129 | MS.MemsetFn, |
| 1130 | IRB.CreatePointerCast(I.getArgOperand(0), IRB.getInt8PtrTy()), |
| 1131 | IRB.CreateIntCast(I.getArgOperand(1), IRB.getInt32Ty(), false), |
| 1132 | IRB.CreateIntCast(I.getArgOperand(2), MS.IntptrTy, false)); |
| 1133 | I.eraseFromParent(); |
| 1134 | } |
| 1135 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1136 | void visitVAStartInst(VAStartInst &I) { |
| 1137 | VAHelper->visitVAStartInst(I); |
| 1138 | } |
| 1139 | |
| 1140 | void visitVACopyInst(VACopyInst &I) { |
| 1141 | VAHelper->visitVACopyInst(I); |
| 1142 | } |
| 1143 | |
Evgeniy Stepanov | 8b51bab | 2012-12-05 14:39:55 +0000 | [diff] [blame] | 1144 | void handleBswap(IntrinsicInst &I) { |
| 1145 | IRBuilder<> IRB(&I); |
| 1146 | Value *Op = I.getArgOperand(0); |
| 1147 | Type *OpType = Op->getType(); |
| 1148 | Function *BswapFunc = Intrinsic::getDeclaration( |
| 1149 | F.getParent(), Intrinsic::bswap, ArrayRef<Type*>(&OpType, 1)); |
| 1150 | setShadow(&I, IRB.CreateCall(BswapFunc, getShadow(Op))); |
| 1151 | setOrigin(&I, getOrigin(Op)); |
| 1152 | } |
| 1153 | |
| 1154 | void visitIntrinsicInst(IntrinsicInst &I) { |
| 1155 | switch (I.getIntrinsicID()) { |
| 1156 | case llvm::Intrinsic::bswap: |
| 1157 | handleBswap(I); break; |
| 1158 | default: |
| 1159 | visitInstruction(I); break; |
| 1160 | } |
| 1161 | } |
| 1162 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1163 | void visitCallSite(CallSite CS) { |
| 1164 | Instruction &I = *CS.getInstruction(); |
| 1165 | assert((CS.isCall() || CS.isInvoke()) && "Unknown type of CallSite"); |
| 1166 | if (CS.isCall()) { |
Evgeniy Stepanov | 7ad7e83 | 2012-11-29 14:32:03 +0000 | [diff] [blame] | 1167 | CallInst *Call = cast<CallInst>(&I); |
| 1168 | |
| 1169 | // For inline asm, do the usual thing: check argument shadow and mark all |
| 1170 | // outputs as clean. Note that any side effects of the inline asm that are |
| 1171 | // not immediately visible in its constraints are not handled. |
| 1172 | if (Call->isInlineAsm()) { |
| 1173 | visitInstruction(I); |
| 1174 | return; |
| 1175 | } |
| 1176 | |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1177 | // Allow only tail calls with the same types, otherwise |
| 1178 | // we may have a false positive: shadow for a non-void RetVal |
| 1179 | // will get propagated to a void RetVal. |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1180 | if (Call->isTailCall() && Call->getType() != Call->getParent()->getType()) |
| 1181 | Call->setTailCall(false); |
Evgeniy Stepanov | 8b51bab | 2012-12-05 14:39:55 +0000 | [diff] [blame] | 1182 | |
| 1183 | assert(!isa<IntrinsicInst>(&I) && "intrinsics are handled elsewhere"); |
Evgeniy Stepanov | d4bd7b7 | 2012-11-29 09:57:20 +0000 | [diff] [blame] | 1184 | } |
| 1185 | IRBuilder<> IRB(&I); |
| 1186 | unsigned ArgOffset = 0; |
| 1187 | DEBUG(dbgs() << " CallSite: " << I << "\n"); |
| 1188 | for (CallSite::arg_iterator ArgIt = CS.arg_begin(), End = CS.arg_end(); |
| 1189 | ArgIt != End; ++ArgIt) { |
| 1190 | Value *A = *ArgIt; |
| 1191 | unsigned i = ArgIt - CS.arg_begin(); |
| 1192 | if (!A->getType()->isSized()) { |
| 1193 | DEBUG(dbgs() << "Arg " << i << " is not sized: " << I << "\n"); |
| 1194 | continue; |
| 1195 | } |
| 1196 | unsigned Size = 0; |
| 1197 | Value *Store = 0; |
| 1198 | // Compute the Shadow for arg even if it is ByVal, because |
| 1199 | // in that case getShadow() will copy the actual arg shadow to |
| 1200 | // __msan_param_tls. |
| 1201 | Value *ArgShadow = getShadow(A); |
| 1202 | Value *ArgShadowBase = getShadowPtrForArgument(A, IRB, ArgOffset); |
| 1203 | DEBUG(dbgs() << " Arg#" << i << ": " << *A << |
| 1204 | " Shadow: " << *ArgShadow << "\n"); |
| 1205 | if (CS.paramHasAttr(i + 1, Attributes::ByVal)) { |
| 1206 | assert(A->getType()->isPointerTy() && |
| 1207 | "ByVal argument is not a pointer!"); |
| 1208 | Size = MS.TD->getTypeAllocSize(A->getType()->getPointerElementType()); |
| 1209 | unsigned Alignment = CS.getParamAlignment(i + 1); |
| 1210 | Store = IRB.CreateMemCpy(ArgShadowBase, |
| 1211 | getShadowPtr(A, Type::getInt8Ty(*MS.C), IRB), |
| 1212 | Size, Alignment); |
| 1213 | } else { |
| 1214 | Size = MS.TD->getTypeAllocSize(A->getType()); |
| 1215 | Store = IRB.CreateStore(ArgShadow, ArgShadowBase); |
| 1216 | } |
| 1217 | if (ClTrackOrigins) |
| 1218 | IRB.CreateStore(getOrigin(A), |
| 1219 | getOriginPtrForArgument(A, IRB, ArgOffset)); |
| 1220 | assert(Size != 0 && Store != 0); |
| 1221 | DEBUG(dbgs() << " Param:" << *Store << "\n"); |
| 1222 | ArgOffset += DataLayout::RoundUpAlignment(Size, 8); |
| 1223 | } |
| 1224 | DEBUG(dbgs() << " done with call args\n"); |
| 1225 | |
| 1226 | FunctionType *FT = |
| 1227 | cast<FunctionType>(CS.getCalledValue()->getType()-> getContainedType(0)); |
| 1228 | if (FT->isVarArg()) { |
| 1229 | VAHelper->visitCallSite(CS, IRB); |
| 1230 | } |
| 1231 | |
| 1232 | // Now, get the shadow for the RetVal. |
| 1233 | if (!I.getType()->isSized()) return; |
| 1234 | IRBuilder<> IRBBefore(&I); |
| 1235 | // Untill we have full dynamic coverage, make sure the retval shadow is 0. |
| 1236 | Value *Base = getShadowPtrForRetval(&I, IRBBefore); |
| 1237 | IRBBefore.CreateStore(getCleanShadow(&I), Base); |
| 1238 | Instruction *NextInsn = 0; |
| 1239 | if (CS.isCall()) { |
| 1240 | NextInsn = I.getNextNode(); |
| 1241 | } else { |
| 1242 | BasicBlock *NormalDest = cast<InvokeInst>(&I)->getNormalDest(); |
| 1243 | if (!NormalDest->getSinglePredecessor()) { |
| 1244 | // FIXME: this case is tricky, so we are just conservative here. |
| 1245 | // Perhaps we need to split the edge between this BB and NormalDest, |
| 1246 | // but a naive attempt to use SplitEdge leads to a crash. |
| 1247 | setShadow(&I, getCleanShadow(&I)); |
| 1248 | setOrigin(&I, getCleanOrigin()); |
| 1249 | return; |
| 1250 | } |
| 1251 | NextInsn = NormalDest->getFirstInsertionPt(); |
| 1252 | assert(NextInsn && |
| 1253 | "Could not find insertion point for retval shadow load"); |
| 1254 | } |
| 1255 | IRBuilder<> IRBAfter(NextInsn); |
| 1256 | setShadow(&I, IRBAfter.CreateLoad(getShadowPtrForRetval(&I, IRBAfter), |
| 1257 | "_msret")); |
| 1258 | if (ClTrackOrigins) |
| 1259 | setOrigin(&I, IRBAfter.CreateLoad(getOriginPtrForRetval(IRBAfter))); |
| 1260 | } |
| 1261 | |
| 1262 | void visitReturnInst(ReturnInst &I) { |
| 1263 | IRBuilder<> IRB(&I); |
| 1264 | if (Value *RetVal = I.getReturnValue()) { |
| 1265 | // Set the shadow for the RetVal. |
| 1266 | Value *Shadow = getShadow(RetVal); |
| 1267 | Value *ShadowPtr = getShadowPtrForRetval(RetVal, IRB); |
| 1268 | DEBUG(dbgs() << "Return: " << *Shadow << "\n" << *ShadowPtr << "\n"); |
| 1269 | IRB.CreateStore(Shadow, ShadowPtr); |
| 1270 | if (ClTrackOrigins) |
| 1271 | IRB.CreateStore(getOrigin(RetVal), getOriginPtrForRetval(IRB)); |
| 1272 | } |
| 1273 | } |
| 1274 | |
| 1275 | void visitPHINode(PHINode &I) { |
| 1276 | IRBuilder<> IRB(&I); |
| 1277 | ShadowPHINodes.push_back(&I); |
| 1278 | setShadow(&I, IRB.CreatePHI(getShadowTy(&I), I.getNumIncomingValues(), |
| 1279 | "_msphi_s")); |
| 1280 | if (ClTrackOrigins) |
| 1281 | setOrigin(&I, IRB.CreatePHI(MS.OriginTy, I.getNumIncomingValues(), |
| 1282 | "_msphi_o")); |
| 1283 | } |
| 1284 | |
| 1285 | void visitAllocaInst(AllocaInst &I) { |
| 1286 | setShadow(&I, getCleanShadow(&I)); |
| 1287 | if (!ClPoisonStack) return; |
| 1288 | IRBuilder<> IRB(I.getNextNode()); |
| 1289 | uint64_t Size = MS.TD->getTypeAllocSize(I.getAllocatedType()); |
| 1290 | if (ClPoisonStackWithCall) { |
| 1291 | IRB.CreateCall2(MS.MsanPoisonStackFn, |
| 1292 | IRB.CreatePointerCast(&I, IRB.getInt8PtrTy()), |
| 1293 | ConstantInt::get(MS.IntptrTy, Size)); |
| 1294 | } else { |
| 1295 | Value *ShadowBase = getShadowPtr(&I, Type::getInt8PtrTy(*MS.C), IRB); |
| 1296 | IRB.CreateMemSet(ShadowBase, IRB.getInt8(ClPoisonStackPattern), |
| 1297 | Size, I.getAlignment()); |
| 1298 | } |
| 1299 | |
| 1300 | if (ClTrackOrigins) { |
| 1301 | setOrigin(&I, getCleanOrigin()); |
| 1302 | SmallString<2048> StackDescriptionStorage; |
| 1303 | raw_svector_ostream StackDescription(StackDescriptionStorage); |
| 1304 | // We create a string with a description of the stack allocation and |
| 1305 | // pass it into __msan_set_alloca_origin. |
| 1306 | // It will be printed by the run-time if stack-originated UMR is found. |
| 1307 | // The first 4 bytes of the string are set to '----' and will be replaced |
| 1308 | // by __msan_va_arg_overflow_size_tls at the first call. |
| 1309 | StackDescription << "----" << I.getName() << "@" << F.getName(); |
| 1310 | Value *Descr = |
| 1311 | createPrivateNonConstGlobalForString(*F.getParent(), |
| 1312 | StackDescription.str()); |
| 1313 | IRB.CreateCall3(MS.MsanSetAllocaOriginFn, |
| 1314 | IRB.CreatePointerCast(&I, IRB.getInt8PtrTy()), |
| 1315 | ConstantInt::get(MS.IntptrTy, Size), |
| 1316 | IRB.CreatePointerCast(Descr, IRB.getInt8PtrTy())); |
| 1317 | } |
| 1318 | } |
| 1319 | |
| 1320 | void visitSelectInst(SelectInst& I) { |
| 1321 | IRBuilder<> IRB(&I); |
| 1322 | setShadow(&I, IRB.CreateSelect(I.getCondition(), |
| 1323 | getShadow(I.getTrueValue()), getShadow(I.getFalseValue()), |
| 1324 | "_msprop")); |
| 1325 | if (ClTrackOrigins) |
| 1326 | setOrigin(&I, IRB.CreateSelect(I.getCondition(), |
| 1327 | getOrigin(I.getTrueValue()), getOrigin(I.getFalseValue()))); |
| 1328 | } |
| 1329 | |
| 1330 | void visitLandingPadInst(LandingPadInst &I) { |
| 1331 | // Do nothing. |
| 1332 | // See http://code.google.com/p/memory-sanitizer/issues/detail?id=1 |
| 1333 | setShadow(&I, getCleanShadow(&I)); |
| 1334 | setOrigin(&I, getCleanOrigin()); |
| 1335 | } |
| 1336 | |
| 1337 | void visitGetElementPtrInst(GetElementPtrInst &I) { |
| 1338 | handleShadowOr(I); |
| 1339 | } |
| 1340 | |
| 1341 | void visitExtractValueInst(ExtractValueInst &I) { |
| 1342 | IRBuilder<> IRB(&I); |
| 1343 | Value *Agg = I.getAggregateOperand(); |
| 1344 | DEBUG(dbgs() << "ExtractValue: " << I << "\n"); |
| 1345 | Value *AggShadow = getShadow(Agg); |
| 1346 | DEBUG(dbgs() << " AggShadow: " << *AggShadow << "\n"); |
| 1347 | Value *ResShadow = IRB.CreateExtractValue(AggShadow, I.getIndices()); |
| 1348 | DEBUG(dbgs() << " ResShadow: " << *ResShadow << "\n"); |
| 1349 | setShadow(&I, ResShadow); |
| 1350 | setOrigin(&I, getCleanOrigin()); |
| 1351 | } |
| 1352 | |
| 1353 | void visitInsertValueInst(InsertValueInst &I) { |
| 1354 | IRBuilder<> IRB(&I); |
| 1355 | DEBUG(dbgs() << "InsertValue: " << I << "\n"); |
| 1356 | Value *AggShadow = getShadow(I.getAggregateOperand()); |
| 1357 | Value *InsShadow = getShadow(I.getInsertedValueOperand()); |
| 1358 | DEBUG(dbgs() << " AggShadow: " << *AggShadow << "\n"); |
| 1359 | DEBUG(dbgs() << " InsShadow: " << *InsShadow << "\n"); |
| 1360 | Value *Res = IRB.CreateInsertValue(AggShadow, InsShadow, I.getIndices()); |
| 1361 | DEBUG(dbgs() << " Res: " << *Res << "\n"); |
| 1362 | setShadow(&I, Res); |
| 1363 | setOrigin(&I, getCleanOrigin()); |
| 1364 | } |
| 1365 | |
| 1366 | void dumpInst(Instruction &I) { |
| 1367 | if (CallInst *CI = dyn_cast<CallInst>(&I)) { |
| 1368 | errs() << "ZZZ call " << CI->getCalledFunction()->getName() << "\n"; |
| 1369 | } else { |
| 1370 | errs() << "ZZZ " << I.getOpcodeName() << "\n"; |
| 1371 | } |
| 1372 | errs() << "QQQ " << I << "\n"; |
| 1373 | } |
| 1374 | |
| 1375 | void visitResumeInst(ResumeInst &I) { |
| 1376 | DEBUG(dbgs() << "Resume: " << I << "\n"); |
| 1377 | // Nothing to do here. |
| 1378 | } |
| 1379 | |
| 1380 | void visitInstruction(Instruction &I) { |
| 1381 | // Everything else: stop propagating and check for poisoned shadow. |
| 1382 | if (ClDumpStrictInstructions) |
| 1383 | dumpInst(I); |
| 1384 | DEBUG(dbgs() << "DEFAULT: " << I << "\n"); |
| 1385 | for (size_t i = 0, n = I.getNumOperands(); i < n; i++) |
| 1386 | insertCheck(I.getOperand(i), &I); |
| 1387 | setShadow(&I, getCleanShadow(&I)); |
| 1388 | setOrigin(&I, getCleanOrigin()); |
| 1389 | } |
| 1390 | }; |
| 1391 | |
| 1392 | /// \brief AMD64-specific implementation of VarArgHelper. |
| 1393 | struct VarArgAMD64Helper : public VarArgHelper { |
| 1394 | // An unfortunate workaround for asymmetric lowering of va_arg stuff. |
| 1395 | // See a comment in visitCallSite for more details. |
| 1396 | static const unsigned AMD64GpEndOffset = 48; // AMD64 ABI Draft 0.99.6 p3.5.7 |
| 1397 | static const unsigned AMD64FpEndOffset = 176; |
| 1398 | |
| 1399 | Function &F; |
| 1400 | MemorySanitizer &MS; |
| 1401 | MemorySanitizerVisitor &MSV; |
| 1402 | Value *VAArgTLSCopy; |
| 1403 | Value *VAArgOverflowSize; |
| 1404 | |
| 1405 | SmallVector<CallInst*, 16> VAStartInstrumentationList; |
| 1406 | |
| 1407 | VarArgAMD64Helper(Function &F, MemorySanitizer &MS, |
| 1408 | MemorySanitizerVisitor &MSV) |
| 1409 | : F(F), MS(MS), MSV(MSV), VAArgTLSCopy(0), VAArgOverflowSize(0) { } |
| 1410 | |
| 1411 | enum ArgKind { AK_GeneralPurpose, AK_FloatingPoint, AK_Memory }; |
| 1412 | |
| 1413 | ArgKind classifyArgument(Value* arg) { |
| 1414 | // A very rough approximation of X86_64 argument classification rules. |
| 1415 | Type *T = arg->getType(); |
| 1416 | if (T->isFPOrFPVectorTy() || T->isX86_MMXTy()) |
| 1417 | return AK_FloatingPoint; |
| 1418 | if (T->isIntegerTy() && T->getPrimitiveSizeInBits() <= 64) |
| 1419 | return AK_GeneralPurpose; |
| 1420 | if (T->isPointerTy()) |
| 1421 | return AK_GeneralPurpose; |
| 1422 | return AK_Memory; |
| 1423 | } |
| 1424 | |
| 1425 | // For VarArg functions, store the argument shadow in an ABI-specific format |
| 1426 | // that corresponds to va_list layout. |
| 1427 | // We do this because Clang lowers va_arg in the frontend, and this pass |
| 1428 | // only sees the low level code that deals with va_list internals. |
| 1429 | // A much easier alternative (provided that Clang emits va_arg instructions) |
| 1430 | // would have been to associate each live instance of va_list with a copy of |
| 1431 | // MSanParamTLS, and extract shadow on va_arg() call in the argument list |
| 1432 | // order. |
| 1433 | void visitCallSite(CallSite &CS, IRBuilder<> &IRB) { |
| 1434 | unsigned GpOffset = 0; |
| 1435 | unsigned FpOffset = AMD64GpEndOffset; |
| 1436 | unsigned OverflowOffset = AMD64FpEndOffset; |
| 1437 | for (CallSite::arg_iterator ArgIt = CS.arg_begin(), End = CS.arg_end(); |
| 1438 | ArgIt != End; ++ArgIt) { |
| 1439 | Value *A = *ArgIt; |
| 1440 | ArgKind AK = classifyArgument(A); |
| 1441 | if (AK == AK_GeneralPurpose && GpOffset >= AMD64GpEndOffset) |
| 1442 | AK = AK_Memory; |
| 1443 | if (AK == AK_FloatingPoint && FpOffset >= AMD64FpEndOffset) |
| 1444 | AK = AK_Memory; |
| 1445 | Value *Base; |
| 1446 | switch (AK) { |
| 1447 | case AK_GeneralPurpose: |
| 1448 | Base = getShadowPtrForVAArgument(A, IRB, GpOffset); |
| 1449 | GpOffset += 8; |
| 1450 | break; |
| 1451 | case AK_FloatingPoint: |
| 1452 | Base = getShadowPtrForVAArgument(A, IRB, FpOffset); |
| 1453 | FpOffset += 16; |
| 1454 | break; |
| 1455 | case AK_Memory: |
| 1456 | uint64_t ArgSize = MS.TD->getTypeAllocSize(A->getType()); |
| 1457 | Base = getShadowPtrForVAArgument(A, IRB, OverflowOffset); |
| 1458 | OverflowOffset += DataLayout::RoundUpAlignment(ArgSize, 8); |
| 1459 | } |
| 1460 | IRB.CreateStore(MSV.getShadow(A), Base); |
| 1461 | } |
| 1462 | Constant *OverflowSize = |
| 1463 | ConstantInt::get(IRB.getInt64Ty(), OverflowOffset - AMD64FpEndOffset); |
| 1464 | IRB.CreateStore(OverflowSize, MS.VAArgOverflowSizeTLS); |
| 1465 | } |
| 1466 | |
| 1467 | /// \brief Compute the shadow address for a given va_arg. |
| 1468 | Value *getShadowPtrForVAArgument(Value *A, IRBuilder<> &IRB, |
| 1469 | int ArgOffset) { |
| 1470 | Value *Base = IRB.CreatePointerCast(MS.VAArgTLS, MS.IntptrTy); |
| 1471 | Base = IRB.CreateAdd(Base, ConstantInt::get(MS.IntptrTy, ArgOffset)); |
| 1472 | return IRB.CreateIntToPtr(Base, PointerType::get(MSV.getShadowTy(A), 0), |
| 1473 | "_msarg"); |
| 1474 | } |
| 1475 | |
| 1476 | void visitVAStartInst(VAStartInst &I) { |
| 1477 | IRBuilder<> IRB(&I); |
| 1478 | VAStartInstrumentationList.push_back(&I); |
| 1479 | Value *VAListTag = I.getArgOperand(0); |
| 1480 | Value *ShadowPtr = MSV.getShadowPtr(VAListTag, IRB.getInt8Ty(), IRB); |
| 1481 | |
| 1482 | // Unpoison the whole __va_list_tag. |
| 1483 | // FIXME: magic ABI constants. |
| 1484 | IRB.CreateMemSet(ShadowPtr, Constant::getNullValue(IRB.getInt8Ty()), |
| 1485 | /* size */24, /* alignment */16, false); |
| 1486 | } |
| 1487 | |
| 1488 | void visitVACopyInst(VACopyInst &I) { |
| 1489 | IRBuilder<> IRB(&I); |
| 1490 | Value *VAListTag = I.getArgOperand(0); |
| 1491 | Value *ShadowPtr = MSV.getShadowPtr(VAListTag, IRB.getInt8Ty(), IRB); |
| 1492 | |
| 1493 | // Unpoison the whole __va_list_tag. |
| 1494 | // FIXME: magic ABI constants. |
| 1495 | IRB.CreateMemSet(ShadowPtr, Constant::getNullValue(IRB.getInt8Ty()), |
| 1496 | /* size */ 24, /* alignment */ 16, false); |
| 1497 | } |
| 1498 | |
| 1499 | void finalizeInstrumentation() { |
| 1500 | assert(!VAArgOverflowSize && !VAArgTLSCopy && |
| 1501 | "finalizeInstrumentation called twice"); |
| 1502 | if (!VAStartInstrumentationList.empty()) { |
| 1503 | // If there is a va_start in this function, make a backup copy of |
| 1504 | // va_arg_tls somewhere in the function entry block. |
| 1505 | IRBuilder<> IRB(F.getEntryBlock().getFirstNonPHI()); |
| 1506 | VAArgOverflowSize = IRB.CreateLoad(MS.VAArgOverflowSizeTLS); |
| 1507 | Value *CopySize = |
| 1508 | IRB.CreateAdd(ConstantInt::get(MS.IntptrTy, AMD64FpEndOffset), |
| 1509 | VAArgOverflowSize); |
| 1510 | VAArgTLSCopy = IRB.CreateAlloca(Type::getInt8Ty(*MS.C), CopySize); |
| 1511 | IRB.CreateMemCpy(VAArgTLSCopy, MS.VAArgTLS, CopySize, 8); |
| 1512 | } |
| 1513 | |
| 1514 | // Instrument va_start. |
| 1515 | // Copy va_list shadow from the backup copy of the TLS contents. |
| 1516 | for (size_t i = 0, n = VAStartInstrumentationList.size(); i < n; i++) { |
| 1517 | CallInst *OrigInst = VAStartInstrumentationList[i]; |
| 1518 | IRBuilder<> IRB(OrigInst->getNextNode()); |
| 1519 | Value *VAListTag = OrigInst->getArgOperand(0); |
| 1520 | |
| 1521 | Value *RegSaveAreaPtrPtr = |
| 1522 | IRB.CreateIntToPtr( |
| 1523 | IRB.CreateAdd(IRB.CreatePtrToInt(VAListTag, MS.IntptrTy), |
| 1524 | ConstantInt::get(MS.IntptrTy, 16)), |
| 1525 | Type::getInt64PtrTy(*MS.C)); |
| 1526 | Value *RegSaveAreaPtr = IRB.CreateLoad(RegSaveAreaPtrPtr); |
| 1527 | Value *RegSaveAreaShadowPtr = |
| 1528 | MSV.getShadowPtr(RegSaveAreaPtr, IRB.getInt8Ty(), IRB); |
| 1529 | IRB.CreateMemCpy(RegSaveAreaShadowPtr, VAArgTLSCopy, |
| 1530 | AMD64FpEndOffset, 16); |
| 1531 | |
| 1532 | Value *OverflowArgAreaPtrPtr = |
| 1533 | IRB.CreateIntToPtr( |
| 1534 | IRB.CreateAdd(IRB.CreatePtrToInt(VAListTag, MS.IntptrTy), |
| 1535 | ConstantInt::get(MS.IntptrTy, 8)), |
| 1536 | Type::getInt64PtrTy(*MS.C)); |
| 1537 | Value *OverflowArgAreaPtr = IRB.CreateLoad(OverflowArgAreaPtrPtr); |
| 1538 | Value *OverflowArgAreaShadowPtr = |
| 1539 | MSV.getShadowPtr(OverflowArgAreaPtr, IRB.getInt8Ty(), IRB); |
| 1540 | Value *SrcPtr = |
| 1541 | getShadowPtrForVAArgument(VAArgTLSCopy, IRB, AMD64FpEndOffset); |
| 1542 | IRB.CreateMemCpy(OverflowArgAreaShadowPtr, SrcPtr, VAArgOverflowSize, 16); |
| 1543 | } |
| 1544 | } |
| 1545 | }; |
| 1546 | |
| 1547 | VarArgHelper* CreateVarArgHelper(Function &Func, MemorySanitizer &Msan, |
| 1548 | MemorySanitizerVisitor &Visitor) { |
| 1549 | return new VarArgAMD64Helper(Func, Msan, Visitor); |
| 1550 | } |
| 1551 | |
| 1552 | } // namespace |
| 1553 | |
| 1554 | bool MemorySanitizer::runOnFunction(Function &F) { |
| 1555 | MemorySanitizerVisitor Visitor(F, *this); |
| 1556 | |
| 1557 | // Clear out readonly/readnone attributes. |
| 1558 | AttrBuilder B; |
| 1559 | B.addAttribute(Attributes::ReadOnly) |
| 1560 | .addAttribute(Attributes::ReadNone); |
| 1561 | F.removeAttribute(AttrListPtr::FunctionIndex, |
| 1562 | Attributes::get(F.getContext(), B)); |
| 1563 | |
| 1564 | return Visitor.runOnFunction(); |
| 1565 | } |