blob: 52862bc36549dc4b28fdbf05433973ed2d2b4de5 [file] [log] [blame]
Kostya Serebryany4ad375f2012-05-10 13:48:04 +00001//===-- tsan_defs.h ---------------------------------------------*- 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#ifndef TSAN_DEFS_H
15#define TSAN_DEFS_H
16
Alexey Samsonov5bbf8292012-06-05 14:25:27 +000017#include "sanitizer_common/sanitizer_internal_defs.h"
Alexey Samsonov91e1a7e2012-06-07 11:54:08 +000018#include "sanitizer_common/sanitizer_libc.h"
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000019#include "tsan_stat.h"
20
21#ifndef TSAN_DEBUG
22#define TSAN_DEBUG 0
23#endif // TSAN_DEBUG
24
Alexey Samsonovef2e2cf2012-06-05 13:50:57 +000025namespace __tsan {
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000026
Dmitry Vyukovf6985e32012-05-22 14:34:43 +000027const int kTidBits = 13;
Kostya Serebryany07c48052012-05-11 14:42:24 +000028const unsigned kMaxTid = 1 << kTidBits;
Dmitry Vyukovfee5b7d2012-05-17 14:17:51 +000029const unsigned kMaxTidInClock = kMaxTid * 2; // This includes msb 'freed' bit.
Dmitry Vyukov302cebb2012-05-22 18:07:45 +000030const int kClkBits = 43;
Dmitry Vyukov5bfac972012-07-16 16:44:47 +000031#ifndef TSAN_GO
Dmitry Vyukov23ecb4a2012-09-06 16:11:30 +000032const int kShadowStackSize = 4 * 1024;
Dmitry Vyukovc87e7282012-09-06 15:18:14 +000033const int kTraceStackSize = 256;
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +000034#endif
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000035
36#ifdef TSAN_SHADOW_COUNT
37# if TSAN_SHADOW_COUNT == 2 \
38 || TSAN_SHADOW_COUNT == 4 || TSAN_SHADOW_COUNT == 8
Dmitry Vyukov1d4120b2012-11-06 13:21:06 +000039const uptr kShadowCnt = TSAN_SHADOW_COUNT;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000040# else
41# error "TSAN_SHADOW_COUNT must be one of 2,4,8"
42# endif
43#else
44// Count of shadow values in a shadow cell.
Dmitry Vyukov1d4120b2012-11-06 13:21:06 +000045const uptr kShadowCnt = 8;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000046#endif
47
48// That many user bytes are mapped onto a single shadow cell.
Dmitry Vyukov1d4120b2012-11-06 13:21:06 +000049const uptr kShadowCell = 8;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000050
51// Size of a single shadow value (u64).
Dmitry Vyukov1d4120b2012-11-06 13:21:06 +000052const uptr kShadowSize = 8;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000053
Dmitry Vyukovc0157122012-11-06 16:00:16 +000054// Shadow memory is kShadowMultiplier times larger than user memory.
55const uptr kShadowMultiplier = kShadowSize * kShadowCnt / kShadowCell;
56
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000057#if defined(TSAN_COLLECT_STATS) && TSAN_COLLECT_STATS
58const bool kCollectStats = true;
59#else
60const bool kCollectStats = false;
61#endif
62
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000063// The following "build consistency" machinery ensures that all source files
64// are built in the same configuration. Inconsistent builds lead to
65// hard to debug crashes.
66#if TSAN_DEBUG
67void build_consistency_debug();
68#else
69void build_consistency_release();
70#endif
71
72#if TSAN_COLLECT_STATS
73void build_consistency_stats();
74#else
75void build_consistency_nostats();
76#endif
77
78#if TSAN_SHADOW_COUNT == 1
79void build_consistency_shadow1();
80#elif TSAN_SHADOW_COUNT == 2
81void build_consistency_shadow2();
82#elif TSAN_SHADOW_COUNT == 4
83void build_consistency_shadow4();
84#else
85void build_consistency_shadow8();
86#endif
87
88static inline void USED build_consistency() {
89#if TSAN_DEBUG
Dmitry Vyukov30c32a82012-05-24 14:50:33 +000090 build_consistency_debug();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000091#else
Dmitry Vyukov30c32a82012-05-24 14:50:33 +000092 build_consistency_release();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000093#endif
94#if TSAN_COLLECT_STATS
Dmitry Vyukov30c32a82012-05-24 14:50:33 +000095 build_consistency_stats();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000096#else
Dmitry Vyukov30c32a82012-05-24 14:50:33 +000097 build_consistency_nostats();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +000098#endif
99#if TSAN_SHADOW_COUNT == 1
Dmitry Vyukov30c32a82012-05-24 14:50:33 +0000100 build_consistency_shadow1();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000101#elif TSAN_SHADOW_COUNT == 2
Dmitry Vyukov30c32a82012-05-24 14:50:33 +0000102 build_consistency_shadow2();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000103#elif TSAN_SHADOW_COUNT == 4
Dmitry Vyukov30c32a82012-05-24 14:50:33 +0000104 build_consistency_shadow4();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000105#else
Dmitry Vyukov30c32a82012-05-24 14:50:33 +0000106 build_consistency_shadow8();
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000107#endif
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000108}
109
110template<typename T>
111T min(T a, T b) {
112 return a < b ? a : b;
113}
114
115template<typename T>
116T max(T a, T b) {
117 return a > b ? a : b;
118}
119
120template<typename T>
121T RoundUp(T p, int align) {
122 DCHECK_EQ(align & (align - 1), 0);
123 return (T)(((u64)p + align - 1) & ~(align - 1));
124}
125
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000126struct MD5Hash {
127 u64 hash[2];
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000128 bool operator==(const MD5Hash &other) const;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000129};
130
131MD5Hash md5_hash(const void *data, uptr size);
132
133struct ThreadState;
134struct ThreadContext;
135struct Context;
136struct ReportStack;
137class ReportDesc;
138class RegionAlloc;
139class StackTrace;
Dmitry Vyukov954fc8c2012-08-15 15:35:15 +0000140struct MBlock;
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000141
142} // namespace __tsan
143
Kostya Serebryany4ad375f2012-05-10 13:48:04 +0000144#endif // TSAN_DEFS_H