Kostya Serebryany | 4ad375f | 2012-05-10 13:48:04 +0000 | [diff] [blame] | 1 | //===-- tsan_mman.cc --------------------------------------------*- C++ -*-===// |
| 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 file is a part of ThreadSanitizer (TSan), a race detector. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | #include "tsan_mman.h" |
| 14 | #include "tsan_allocator.h" |
| 15 | #include "tsan_rtl.h" |
| 16 | #include "tsan_report.h" |
| 17 | #include "tsan_flags.h" |
| 18 | |
| 19 | namespace __tsan { |
| 20 | |
| 21 | static void SignalUnsafeCall(ThreadState *thr, uptr pc) { |
| 22 | if (!thr->in_signal_handler || !flags()->report_signal_unsafe) |
| 23 | return; |
| 24 | StackTrace stack; |
| 25 | stack.ObtainCurrent(thr, pc); |
| 26 | ScopedReport rep(ReportTypeSignalUnsafe); |
| 27 | rep.AddStack(&stack); |
Dmitry Vyukov | 665ce2a | 2012-05-14 15:28:03 +0000 | [diff] [blame^] | 28 | OutputReport(rep, rep.GetReport()->stacks[0]); |
Kostya Serebryany | 4ad375f | 2012-05-10 13:48:04 +0000 | [diff] [blame] | 29 | } |
| 30 | |
| 31 | void *user_alloc(ThreadState *thr, uptr pc, uptr sz) { |
| 32 | CHECK_GT(thr->in_rtl, 0); |
| 33 | MBlock *b = (MBlock*)Alloc(sz + sizeof(MBlock)); |
| 34 | b->size = sz; |
| 35 | void *p = b + 1; |
| 36 | if (CTX() && CTX()->initialized) { |
| 37 | MemoryResetRange(thr, pc, (uptr)p, sz); |
| 38 | } |
| 39 | DPrintf("#%d: alloc(%lu) = %p\n", thr->tid, sz, p); |
| 40 | SignalUnsafeCall(thr, pc); |
| 41 | return p; |
| 42 | } |
| 43 | |
| 44 | void user_free(ThreadState *thr, uptr pc, void *p) { |
| 45 | CHECK_GT(thr->in_rtl, 0); |
| 46 | CHECK_NE(p, (void*)0); |
| 47 | DPrintf("#%d: free(%p)\n", thr->tid, p); |
| 48 | MBlock *b = user_mblock(thr, p); |
| 49 | p = b + 1; |
| 50 | if (CTX() && CTX()->initialized && thr->in_rtl == 1) { |
| 51 | MemoryRangeFreed(thr, pc, (uptr)p, b->size); |
| 52 | } |
| 53 | Free(b); |
| 54 | SignalUnsafeCall(thr, pc); |
| 55 | } |
| 56 | |
| 57 | void *user_realloc(ThreadState *thr, uptr pc, void *p, uptr sz) { |
| 58 | CHECK_GT(thr->in_rtl, 0); |
| 59 | void *p2 = 0; |
| 60 | // FIXME: Handle "shrinking" more efficiently, |
| 61 | // it seems that some software actually does this. |
| 62 | if (sz) { |
| 63 | p2 = user_alloc(thr, pc, sz); |
| 64 | if (p) { |
| 65 | MBlock *b = user_mblock(thr, p); |
| 66 | internal_memcpy(p2, p, min(b->size, sz)); |
| 67 | } |
| 68 | } |
| 69 | if (p) { |
| 70 | user_free(thr, pc, p); |
| 71 | } |
| 72 | return p2; |
| 73 | } |
| 74 | |
| 75 | void *user_alloc_aligned(ThreadState *thr, uptr pc, uptr sz, uptr align) { |
| 76 | CHECK_GT(thr->in_rtl, 0); |
| 77 | void *p = user_alloc(thr, pc, sz + align); |
| 78 | void *pa = RoundUp(p, align); |
| 79 | DCHECK_LE((uptr)pa + sz, (uptr)p + sz + align); |
| 80 | return pa; |
| 81 | } |
| 82 | |
| 83 | MBlock *user_mblock(ThreadState *thr, void *p) { |
| 84 | CHECK_GT(thr->in_rtl, 0); |
| 85 | CHECK_NE(p, (void*)0); |
| 86 | MBlock *b = (MBlock*)AllocBlock(p); |
| 87 | // FIXME: Output a warning, it's a user error. |
| 88 | if (p < (char*)(b + 1) || p > (char*)(b + 1) + b->size) { |
| 89 | Printf("user_mblock p=%p b=%p size=%lu beg=%p end=%p\n", |
| 90 | p, b, b->size, (char*)(b + 1), (char*)(b + 1) + b->size); |
| 91 | CHECK_GE(p, (char*)(b + 1)); |
| 92 | CHECK_LE(p, (char*)(b + 1) + b->size); |
| 93 | } |
| 94 | return b; |
| 95 | } |
| 96 | |
| 97 | #if TSAN_DEBUG |
| 98 | struct InternalMBlock { |
| 99 | static u32 const kMagic = 0xBCEBC041; |
| 100 | u32 magic; |
| 101 | u32 typ; |
| 102 | u64 sz; |
| 103 | }; |
| 104 | #endif |
| 105 | |
| 106 | void *internal_alloc(MBlockType typ, uptr sz) { |
| 107 | ThreadState *thr = cur_thread(); |
| 108 | CHECK_GT(thr->in_rtl, 0); |
| 109 | #if TSAN_DEBUG |
| 110 | InternalMBlock *b = (InternalMBlock*)Alloc(sizeof(InternalMBlock) + sz); |
| 111 | b->magic = InternalMBlock::kMagic; |
| 112 | b->typ = typ; |
| 113 | b->sz = sz; |
| 114 | thr->int_alloc_cnt[typ] += 1; |
| 115 | thr->int_alloc_siz[typ] += sz; |
| 116 | void *p = b + 1; |
| 117 | return p; |
| 118 | #else |
| 119 | return Alloc(sz); |
| 120 | #endif |
| 121 | } |
| 122 | |
| 123 | void internal_free(void *p) { |
| 124 | ThreadState *thr = cur_thread(); |
| 125 | CHECK_GT(thr->in_rtl, 0); |
| 126 | #if TSAN_DEBUG |
| 127 | InternalMBlock *b = (InternalMBlock*)p - 1; |
| 128 | CHECK_EQ(b->magic, InternalMBlock::kMagic); |
| 129 | thr->int_alloc_cnt[b->typ] -= 1; |
| 130 | thr->int_alloc_siz[b->typ] -= b->sz; |
| 131 | Free(b); |
| 132 | #else |
| 133 | Free(p); |
| 134 | #endif |
| 135 | } |
| 136 | |
| 137 | } // namespace __tsan |