blob: fb44949c5fa28f87e5d2bd0276914bebcc931363 [file] [log] [blame]
Kostya Serebryany4ad375f2012-05-10 13:48:04 +00001//===-- tsan_rtl_thread.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
14#include "tsan_rtl.h"
15#include "tsan_mman.h"
16#include "tsan_placement_new.h"
17#include "tsan_platform.h"
18#include "tsan_report.h"
19#include "tsan_sync.h"
20
21namespace __tsan {
22
23const int kThreadQuarantineSize = 100;
24
25static void MaybeReportThreadLeak(ThreadContext *tctx) {
26 if (tctx->detached)
27 return;
28 if (tctx->status != ThreadStatusCreated
29 && tctx->status != ThreadStatusRunning
30 && tctx->status != ThreadStatusFinished)
31 return;
32 ScopedReport rep(ReportTypeThreadLeak);
33 rep.AddThread(tctx);
34 OutputReport(rep);
35}
36
37void ThreadFinalize(ThreadState *thr) {
38 CHECK_GT(thr->in_rtl, 0);
39 if (!flags()->report_thread_leaks)
40 return;
41 Context *ctx = CTX();
42 Lock l(&ctx->thread_mtx);
Kostya Serebryany07c48052012-05-11 14:42:24 +000043 for (unsigned i = 0; i < kMaxTid; i++) {
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000044 ThreadContext *tctx = ctx->threads[i];
45 if (tctx == 0)
46 continue;
47 MaybeReportThreadLeak(tctx);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000048 }
49}
50
51static void ThreadDead(ThreadState *thr, ThreadContext *tctx) {
52 Context *ctx = CTX();
53 CHECK_GT(thr->in_rtl, 0);
54 CHECK(tctx->status == ThreadStatusRunning
55 || tctx->status == ThreadStatusFinished);
56 DPrintf("#%d: ThreadDead uid=%lu\n", thr->tid, tctx->user_id);
57 tctx->status = ThreadStatusDead;
58 tctx->user_id = 0;
59 tctx->sync.Reset();
60
61 // Put to dead list.
62 tctx->dead_next = 0;
63 if (ctx->dead_list_size == 0)
64 ctx->dead_list_head = tctx;
65 else
66 ctx->dead_list_tail->dead_next = tctx;
67 ctx->dead_list_tail = tctx;
68 ctx->dead_list_size++;
69}
70
71int ThreadCreate(ThreadState *thr, uptr pc, uptr uid, bool detached) {
72 CHECK_GT(thr->in_rtl, 0);
73 Context *ctx = CTX();
74 Lock l(&ctx->thread_mtx);
75 StatInc(thr, StatThreadCreate);
76 int tid = -1;
77 ThreadContext *tctx = 0;
78 if (ctx->dead_list_size > kThreadQuarantineSize
79 || ctx->thread_seq >= kMaxTid) {
80 if (ctx->dead_list_size == 0) {
81 Printf("ThreadSanitizer: %d thread limit exceeded. Dying.\n", kMaxTid);
82 Die();
83 }
84 StatInc(thr, StatThreadReuse);
85 tctx = ctx->dead_list_head;
86 ctx->dead_list_head = tctx->dead_next;
87 ctx->dead_list_size--;
88 if (ctx->dead_list_size == 0) {
89 CHECK_EQ(tctx->dead_next, 0);
90 ctx->dead_list_head = 0;
91 }
92 CHECK_EQ(tctx->status, ThreadStatusDead);
93 tctx->status = ThreadStatusInvalid;
94 tctx->reuse_count++;
95 tid = tctx->tid;
96 // The point to reclain dead_info.
97 // delete tctx->dead_info;
98 } else {
99 StatInc(thr, StatThreadMaxTid);
100 tid = ctx->thread_seq++;
101 void *mem = internal_alloc(MBlockThreadContex, sizeof(ThreadContext));
102 tctx = new(mem) ThreadContext(tid);
103 ctx->threads[tid] = tctx;
104 }
105 CHECK_NE(tctx, 0);
106 CHECK_GE(tid, 0);
107 CHECK_LT(tid, kMaxTid);
108 DPrintf("#%d: ThreadCreate tid=%d uid=%lu\n", thr->tid, tid, uid);
109 CHECK_EQ(tctx->status, ThreadStatusInvalid);
110 ctx->alive_threads++;
111 if (ctx->max_alive_threads < ctx->alive_threads) {
112 ctx->max_alive_threads++;
113 CHECK_EQ(ctx->max_alive_threads, ctx->alive_threads);
114 StatInc(thr, StatThreadMaxAlive);
115 }
116 tctx->status = ThreadStatusCreated;
117 tctx->thr = 0;
118 tctx->user_id = uid;
119 tctx->unique_id = ctx->unique_thread_seq++;
120 tctx->detached = detached;
121 if (tid) {
122 thr->fast_state.IncrementEpoch();
123 // Can't increment epoch w/o writing to the trace as well.
124 TraceAddEvent(thr, thr->fast_state.epoch(), EventTypeMop, 0);
125 thr->clock.set(thr->tid, thr->fast_state.epoch());
126 thr->fast_synch_epoch = thr->fast_state.epoch();
127 thr->clock.release(&tctx->sync);
128 StatInc(thr, StatSyncRelease);
129
130 tctx->creation_stack.ObtainCurrent(thr, pc);
131 }
132 return tid;
133}
134
135void ThreadStart(ThreadState *thr, int tid) {
136 CHECK_GT(thr->in_rtl, 0);
137 uptr stk_addr = 0;
138 uptr stk_size = 0;
139 uptr tls_addr = 0;
140 uptr tls_size = 0;
141 GetThreadStackAndTls(&stk_addr, &stk_size, &tls_addr, &tls_size);
142
143 MemoryResetRange(thr, /*pc=*/ 1, stk_addr, stk_size);
144
145 // Check that the thr object is in tls;
146 const uptr thr_beg = (uptr)thr;
147 const uptr thr_end = (uptr)thr + sizeof(*thr);
148 CHECK_GE(thr_beg, tls_addr);
149 CHECK_LE(thr_beg, tls_addr + tls_size);
150 CHECK_GE(thr_end, tls_addr);
151 CHECK_LE(thr_end, tls_addr + tls_size);
152 // Since the thr object is huge, skip it.
153 MemoryResetRange(thr, /*pc=*/ 2, tls_addr, thr_beg - tls_addr);
154 MemoryResetRange(thr, /*pc=*/ 2, thr_end, tls_addr + tls_size - thr_end);
155
156 Lock l(&CTX()->thread_mtx);
157 ThreadContext *tctx = CTX()->threads[tid];
158 CHECK_NE(tctx, 0);
159 CHECK_EQ(tctx->status, ThreadStatusCreated);
160 tctx->status = ThreadStatusRunning;
161 tctx->epoch0 = tctx->epoch1 + 1;
162 tctx->epoch1 = (u64)-1;
163 new(thr) ThreadState(CTX(), tid, tctx->epoch0, stk_addr, stk_size,
164 tls_addr, tls_size);
165 tctx->thr = thr;
166 thr->fast_synch_epoch = tctx->epoch0;
167 thr->clock.set(tid, tctx->epoch0);
168 thr->clock.acquire(&tctx->sync);
169 StatInc(thr, StatSyncAcquire);
170 DPrintf("#%d: ThreadStart epoch=%llu stk_addr=%lx stk_size=%lx "
171 "tls_addr=%lx tls_size=%lx\n",
172 tid, tctx->epoch0, stk_addr, stk_size, tls_addr, tls_size);
173}
174
175void ThreadFinish(ThreadState *thr) {
176 CHECK_GT(thr->in_rtl, 0);
177 StatInc(thr, StatThreadFinish);
178 // FIXME: Treat it as write.
179 if (thr->stk_addr && thr->stk_size)
180 MemoryResetRange(thr, /*pc=*/ 3, thr->stk_addr, thr->stk_size);
181 if (thr->tls_addr && thr->tls_size) {
182 const uptr thr_beg = (uptr)thr;
183 const uptr thr_end = (uptr)thr + sizeof(*thr);
184 // Since the thr object is huge, skip it.
185 MemoryResetRange(thr, /*pc=*/ 4, thr->tls_addr, thr_beg - thr->tls_addr);
186 MemoryResetRange(thr, /*pc=*/ 5,
187 thr_end, thr->tls_addr + thr->tls_size - thr_end);
188 }
189 Context *ctx = CTX();
190 Lock l(&ctx->thread_mtx);
191 ThreadContext *tctx = ctx->threads[thr->tid];
192 CHECK_NE(tctx, 0);
193 CHECK_EQ(tctx->status, ThreadStatusRunning);
194 CHECK_GT(ctx->alive_threads, 0);
195 ctx->alive_threads--;
196 if (tctx->detached) {
197 ThreadDead(thr, tctx);
198 } else {
199 thr->fast_state.IncrementEpoch();
200 // Can't increment epoch w/o writing to the trace as well.
201 TraceAddEvent(thr, thr->fast_state.epoch(), EventTypeMop, 0);
202 thr->clock.set(thr->tid, thr->fast_state.epoch());
203 thr->fast_synch_epoch = thr->fast_state.epoch();
204 thr->clock.release(&tctx->sync);
205 StatInc(thr, StatSyncRelease);
206 tctx->status = ThreadStatusFinished;
207 }
208
209 // Save from info about the thread.
210 // If dead_info will become dynamically allocated again,
211 // it is the point to allocate it.
212 // tctx->dead_info = new ThreadDeadInfo;
213 internal_memcpy(&tctx->dead_info.trace.events[0],
214 &thr->trace.events[0], sizeof(thr->trace.events));
215 for (int i = 0; i < kTraceParts; i++) {
216 tctx->dead_info.trace.headers[i].stack0.CopyFrom(
217 thr->trace.headers[i].stack0);
218 }
219 tctx->epoch1 = thr->clock.get(tctx->tid);
220
221 thr->~ThreadState();
222 StatAggregate(ctx->stat, thr->stat);
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000223 tctx->thr = 0;
224}
225
226int ThreadTid(ThreadState *thr, uptr pc, uptr uid) {
227 CHECK_GT(thr->in_rtl, 0);
228 DPrintf("#%d: ThreadTid uid=%lu\n", thr->tid, uid);
229 Lock l(&CTX()->thread_mtx);
Kostya Serebryany07c48052012-05-11 14:42:24 +0000230 for (unsigned tid = 0; tid < kMaxTid; tid++) {
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000231 if (CTX()->threads[tid] != 0
232 && CTX()->threads[tid]->user_id == uid
233 && CTX()->threads[tid]->status != ThreadStatusInvalid)
234 return tid;
235 }
236 return -1;
237}
238
239void ThreadJoin(ThreadState *thr, uptr pc, int tid) {
240 CHECK_GT(thr->in_rtl, 0);
241 CHECK_GT(tid, 0);
242 CHECK_LT(tid, kMaxTid);
243 DPrintf("#%d: ThreadJoin tid=%d\n", thr->tid, tid);
244 Context *ctx = CTX();
245 Lock l(&ctx->thread_mtx);
246 ThreadContext *tctx = ctx->threads[tid];
247 if (tctx->status == ThreadStatusInvalid) {
248 Printf("ThreadSanitizer: join of non-existent thread\n");
249 return;
250 }
251 CHECK_EQ(tctx->detached, false);
252 CHECK_EQ(tctx->status, ThreadStatusFinished);
253 thr->clock.acquire(&tctx->sync);
254 StatInc(thr, StatSyncAcquire);
255 ThreadDead(thr, tctx);
256}
257
258void ThreadDetach(ThreadState *thr, uptr pc, int tid) {
259 CHECK_GT(thr->in_rtl, 0);
260 CHECK_GT(tid, 0);
261 CHECK_LT(tid, kMaxTid);
262 Context *ctx = CTX();
263 Lock l(&ctx->thread_mtx);
264 ThreadContext *tctx = ctx->threads[tid];
265 if (tctx->status == ThreadStatusInvalid) {
266 Printf("ThreadSanitizer: detach of non-existent thread\n");
267 return;
268 }
269 if (tctx->status == ThreadStatusFinished) {
270 ThreadDead(thr, tctx);
271 } else {
272 tctx->detached = true;
273 }
274}
275
276void MemoryAccessRange(ThreadState *thr, uptr pc, uptr addr,
277 uptr size, bool is_write) {
278 if (size == 0)
279 return;
280
281 u64 *shadow_mem = (u64*)MemToShadow(addr);
282 DPrintf2("#%d: MemoryAccessRange: @%p %p size=%d is_write=%d\n",
283 thr->tid, (void*)pc, (void*)addr,
284 (int)size, is_write);
285
286#if TSAN_DEBUG
287 if (!IsAppMem(addr)) {
288 Printf("Access to non app mem %lx\n", addr);
289 DCHECK(IsAppMem(addr));
290 }
291 if (!IsAppMem(addr + size - 1)) {
292 Printf("Access to non app mem %lx\n", addr + size - 1);
293 DCHECK(IsAppMem(addr + size - 1));
294 }
295 if (!IsShadowMem((uptr)shadow_mem)) {
296 Printf("Bad shadow addr %p (%lx)\n", shadow_mem, addr);
297 DCHECK(IsShadowMem((uptr)shadow_mem));
298 }
299 if (!IsShadowMem((uptr)(shadow_mem + size * kShadowCnt / 8 - 1))) {
300 Printf("Bad shadow addr %p (%lx)\n",
301 shadow_mem + size * kShadowCnt / 8 - 1, addr + size - 1);
302 DCHECK(IsShadowMem((uptr)(shadow_mem + size * kShadowCnt / 8 - 1)));
303 }
304#endif
305
306 StatInc(thr, StatMopRange);
307
308 FastState fast_state = thr->fast_state;
309 if (fast_state.GetIgnoreBit())
310 return;
311
312 fast_state.IncrementEpoch();
313 thr->fast_state = fast_state;
314 TraceAddEvent(thr, fast_state.epoch(), EventTypeMop, pc);
315
316 bool unaligned = (addr % kShadowCell) != 0;
317
318 // Handle unaligned beginning, if any.
319 for (; addr % kShadowCell && size; addr++, size--) {
320 int const kAccessSizeLog = 0;
321 Shadow cur(fast_state);
322 cur.SetWrite(is_write);
323 cur.SetAddr0AndSizeLog(addr & (kShadowCell - 1), kAccessSizeLog);
324 MemoryAccessImpl(thr, addr, kAccessSizeLog, is_write, fast_state,
325 shadow_mem, cur);
326 }
327 if (unaligned)
328 shadow_mem += kShadowCnt;
329 // Handle middle part, if any.
330 for (; size >= kShadowCell; addr += kShadowCell, size -= kShadowCell) {
331 int const kAccessSizeLog = 3;
332 Shadow cur(fast_state);
333 cur.SetWrite(is_write);
334 cur.SetAddr0AndSizeLog(0, kAccessSizeLog);
335 MemoryAccessImpl(thr, addr, kAccessSizeLog, is_write, fast_state,
336 shadow_mem, cur);
337 shadow_mem += kShadowCnt;
338 }
339 // Handle ending, if any.
340 for (; size; addr++, size--) {
341 int const kAccessSizeLog = 0;
342 Shadow cur(fast_state);
343 cur.SetWrite(is_write);
344 cur.SetAddr0AndSizeLog(addr & (kShadowCell - 1), kAccessSizeLog);
345 MemoryAccessImpl(thr, addr, kAccessSizeLog, is_write, fast_state,
346 shadow_mem, cur);
347 }
348}
349
350void MemoryRead1Byte(ThreadState *thr, uptr pc, uptr addr) {
351 MemoryAccess(thr, pc, addr, 0, 0);
352}
353
354void MemoryWrite1Byte(ThreadState *thr, uptr pc, uptr addr) {
355 MemoryAccess(thr, pc, addr, 0, 1);
356}
357
358void MemoryRead8Byte(ThreadState *thr, uptr pc, uptr addr) {
359 MemoryAccess(thr, pc, addr, 3, 0);
360}
361
362void MemoryWrite8Byte(ThreadState *thr, uptr pc, uptr addr) {
363 MemoryAccess(thr, pc, addr, 3, 1);
364}
365} // namespace __tsan