blob: 5ffd6038c2ed9bd55851bdd7d648657ecbc0ea81 [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));
36 b->size = sz;
37 void *p = b + 1;
38 if (CTX() && CTX()->initialized) {
39 MemoryResetRange(thr, pc, (uptr)p, sz);
40 }
41 DPrintf("#%d: alloc(%lu) = %p\n", thr->tid, sz, p);
42 SignalUnsafeCall(thr, pc);
43 return p;
44}
45
46void user_free(ThreadState *thr, uptr pc, void *p) {
47 CHECK_GT(thr->in_rtl, 0);
48 CHECK_NE(p, (void*)0);
49 DPrintf("#%d: free(%p)\n", thr->tid, p);
50 MBlock *b = user_mblock(thr, p);
51 p = b + 1;
52 if (CTX() && CTX()->initialized && thr->in_rtl == 1) {
53 MemoryRangeFreed(thr, pc, (uptr)p, b->size);
54 }
55 Free(b);
56 SignalUnsafeCall(thr, pc);
57}
58
59void *user_realloc(ThreadState *thr, uptr pc, void *p, uptr sz) {
60 CHECK_GT(thr->in_rtl, 0);
61 void *p2 = 0;
62 // FIXME: Handle "shrinking" more efficiently,
63 // it seems that some software actually does this.
64 if (sz) {
65 p2 = user_alloc(thr, pc, sz);
66 if (p) {
67 MBlock *b = user_mblock(thr, p);
68 internal_memcpy(p2, p, min(b->size, sz));
69 }
70 }
71 if (p) {
72 user_free(thr, pc, p);
73 }
74 return p2;
75}
76
77void *user_alloc_aligned(ThreadState *thr, uptr pc, uptr sz, uptr align) {
78 CHECK_GT(thr->in_rtl, 0);
79 void *p = user_alloc(thr, pc, sz + align);
80 void *pa = RoundUp(p, align);
81 DCHECK_LE((uptr)pa + sz, (uptr)p + sz + align);
82 return pa;
83}
84
85MBlock *user_mblock(ThreadState *thr, void *p) {
86 CHECK_GT(thr->in_rtl, 0);
87 CHECK_NE(p, (void*)0);
88 MBlock *b = (MBlock*)AllocBlock(p);
89 // FIXME: Output a warning, it's a user error.
90 if (p < (char*)(b + 1) || p > (char*)(b + 1) + b->size) {
91 Printf("user_mblock p=%p b=%p size=%lu beg=%p end=%p\n",
92 p, b, b->size, (char*)(b + 1), (char*)(b + 1) + b->size);
93 CHECK_GE(p, (char*)(b + 1));
94 CHECK_LE(p, (char*)(b + 1) + b->size);
95 }
96 return b;
97}
98
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000099void *internal_alloc(MBlockType typ, uptr sz) {
100 ThreadState *thr = cur_thread();
101 CHECK_GT(thr->in_rtl, 0);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000102 return Alloc(sz);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000103}
104
105void internal_free(void *p) {
106 ThreadState *thr = cur_thread();
107 CHECK_GT(thr->in_rtl, 0);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000108 Free(p);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000109}
110
111} // namespace __tsan