blob: afa5763fdd3ddb4ccd8ccf2829d93af1a2b53d4f [file] [log] [blame]
Kostya Serebryany4ad375f2012-05-10 13:48:04 +00001//===-- 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
19namespace __tsan {
20
21static 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 Vyukov665ce2a2012-05-14 15:28:03 +000028 OutputReport(rep, rep.GetReport()->stacks[0]);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000029}
30
31void *user_alloc(ThreadState *thr, uptr pc, uptr sz) {
32 CHECK_GT(thr->in_rtl, 0);
Dmitry Vyukovf64046c2012-05-18 09:41:52 +000033 if (sz + sizeof(MBlock) < sz)
34 return 0;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000035 MBlock *b = (MBlock*)Alloc(sz + sizeof(MBlock));
Dmitry Vyukov9d2229f2012-05-21 06:46:27 +000036 if (b == 0)
37 return 0;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000038 b->size = sz;
39 void *p = b + 1;
40 if (CTX() && CTX()->initialized) {
41 MemoryResetRange(thr, pc, (uptr)p, sz);
42 }
43 DPrintf("#%d: alloc(%lu) = %p\n", thr->tid, sz, p);
44 SignalUnsafeCall(thr, pc);
45 return p;
46}
47
48void user_free(ThreadState *thr, uptr pc, void *p) {
49 CHECK_GT(thr->in_rtl, 0);
50 CHECK_NE(p, (void*)0);
51 DPrintf("#%d: free(%p)\n", thr->tid, p);
52 MBlock *b = user_mblock(thr, p);
53 p = b + 1;
54 if (CTX() && CTX()->initialized && thr->in_rtl == 1) {
55 MemoryRangeFreed(thr, pc, (uptr)p, b->size);
56 }
57 Free(b);
58 SignalUnsafeCall(thr, pc);
59}
60
61void *user_realloc(ThreadState *thr, uptr pc, void *p, uptr sz) {
62 CHECK_GT(thr->in_rtl, 0);
63 void *p2 = 0;
64 // FIXME: Handle "shrinking" more efficiently,
65 // it seems that some software actually does this.
66 if (sz) {
67 p2 = user_alloc(thr, pc, sz);
Dmitry Vyukov9d2229f2012-05-21 06:46:27 +000068 if (p2 == 0)
69 return 0;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000070 if (p) {
71 MBlock *b = user_mblock(thr, p);
72 internal_memcpy(p2, p, min(b->size, sz));
73 }
74 }
75 if (p) {
76 user_free(thr, pc, p);
77 }
78 return p2;
79}
80
81void *user_alloc_aligned(ThreadState *thr, uptr pc, uptr sz, uptr align) {
82 CHECK_GT(thr->in_rtl, 0);
83 void *p = user_alloc(thr, pc, sz + align);
84 void *pa = RoundUp(p, align);
85 DCHECK_LE((uptr)pa + sz, (uptr)p + sz + align);
86 return pa;
87}
88
89MBlock *user_mblock(ThreadState *thr, void *p) {
90 CHECK_GT(thr->in_rtl, 0);
91 CHECK_NE(p, (void*)0);
92 MBlock *b = (MBlock*)AllocBlock(p);
93 // FIXME: Output a warning, it's a user error.
94 if (p < (char*)(b + 1) || p > (char*)(b + 1) + b->size) {
95 Printf("user_mblock p=%p b=%p size=%lu beg=%p end=%p\n",
96 p, b, b->size, (char*)(b + 1), (char*)(b + 1) + b->size);
97 CHECK_GE(p, (char*)(b + 1));
98 CHECK_LE(p, (char*)(b + 1) + b->size);
99 }
100 return b;
101}
102
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000103void *internal_alloc(MBlockType typ, uptr sz) {
104 ThreadState *thr = cur_thread();
105 CHECK_GT(thr->in_rtl, 0);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000106 return Alloc(sz);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000107}
108
109void internal_free(void *p) {
110 ThreadState *thr = cur_thread();
111 CHECK_GT(thr->in_rtl, 0);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000112 Free(p);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000113}
114
115} // namespace __tsan