blob: 00a8c5ee1677146ecb7b6d257a63bf27b3738e5c [file] [log] [blame]
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +00001//===-- sanitizer_common.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 shared between AddressSanitizer and ThreadSanitizer
11// run-time libraries.
Alexey Samsonovee072902012-06-06 09:26:25 +000012// It declares common functions and classes that are used in both runtimes.
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +000013// Implementation of some functions are provided in sanitizer_common, while
14// others must be defined by run-time library itself.
15//===----------------------------------------------------------------------===//
16#ifndef SANITIZER_COMMON_H
17#define SANITIZER_COMMON_H
18
19#include "sanitizer_internal_defs.h"
Kostya Serebryanya8cfb902013-02-26 13:30:27 +000020#include "sanitizer_libc.h"
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +000021
22namespace __sanitizer {
Kostya Serebryanyb4c2c5c2013-02-06 12:36:49 +000023struct StackTrace;
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +000024
Alexey Samsonovee072902012-06-06 09:26:25 +000025// Constants.
Kostya Serebryany734f1eb2012-11-21 12:38:58 +000026const uptr kWordSize = SANITIZER_WORDSIZE / 8;
Alexey Samsonovee072902012-06-06 09:26:25 +000027const uptr kWordSizeInBits = 8 * kWordSize;
Kostya Serebryanydf198db2012-11-24 05:03:11 +000028
Kostya Serebryany46de5802012-11-20 07:00:42 +000029#if defined(__powerpc__) || defined(__powerpc64__)
Kostya Serebryany46de5802012-11-20 07:00:42 +000030const uptr kCacheLineSize = 128;
Alexey Samsonov40e51282012-06-15 07:29:14 +000031#else
Kostya Serebryany46de5802012-11-20 07:00:42 +000032const uptr kCacheLineSize = 64;
Alexey Samsonov40e51282012-06-15 07:29:14 +000033#endif
Alexey Samsonovee072902012-06-06 09:26:25 +000034
Kostya Serebryanybda64b42013-01-31 14:11:21 +000035extern const char *SanitizerToolName; // Can be changed by the tool.
Alexander Potapenko845b5752013-03-15 14:37:21 +000036extern uptr SanitizerVerbosity;
Kostya Serebryanybda64b42013-01-31 14:11:21 +000037
Kostya Serebryanyf22c6972012-11-23 15:38:49 +000038uptr GetPageSize();
39uptr GetPageSizeCached();
40uptr GetMmapGranularity();
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000041// Threads
Alexey Samsonovee072902012-06-06 09:26:25 +000042int GetPid();
Dmitry Vyukov56faa552012-10-02 12:58:14 +000043uptr GetTid();
Alexey Samsonov70afb912012-06-15 06:37:34 +000044uptr GetThreadSelf();
Alexey Samsonovcf4d3a02012-06-07 07:32:00 +000045void GetThreadStackTopAndBottom(bool at_initialization, uptr *stack_top,
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000046 uptr *stack_bottom);
Alexey Samsonov40d5b772012-06-06 16:15:07 +000047
48// Memory management
49void *MmapOrDie(uptr size, const char *mem_type);
Alexey Samsonovee072902012-06-06 09:26:25 +000050void UnmapOrDie(void *addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000051void *MmapFixedNoReserve(uptr fixed_addr, uptr size);
Kostya Serebryany98066282012-12-13 05:36:00 +000052void *MmapFixedOrDie(uptr fixed_addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000053void *Mprotect(uptr fixed_addr, uptr size);
Kostya Serebryany1e3d3872012-12-06 06:10:31 +000054// Map aligned chunk of address space; size and alignment are powers of two.
55void *MmapAlignedOrDie(uptr size, uptr alignment, const char *mem_type);
Alexey Samsonov40e51282012-06-15 07:29:14 +000056// Used to check if we can map shadow memory to a fixed location.
57bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
Kostya Serebryany6f604b52012-12-27 07:37:24 +000058void FlushUnneededShadowMemory(uptr addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000059
60// Internal allocator
Alexey Samsonov3a6ddb82012-06-07 08:52:56 +000061void *InternalAlloc(uptr size);
Dmitry Vyukovc598de92012-06-25 15:09:24 +000062void InternalFree(void *p);
Alexey Samsonovee072902012-06-06 09:26:25 +000063
Alexey Samsonove6704ee2012-08-21 08:13:37 +000064// InternalScopedBuffer can be used instead of large stack arrays to
65// keep frame size low.
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000066// FIXME: use InternalAlloc instead of MmapOrDie once
67// InternalAlloc is made libc-free.
Alexey Samsonove6704ee2012-08-21 08:13:37 +000068template<typename T>
69class InternalScopedBuffer {
70 public:
71 explicit InternalScopedBuffer(uptr cnt) {
72 cnt_ = cnt;
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000073 ptr_ = (T*)MmapOrDie(cnt * sizeof(T), "InternalScopedBuffer");
Alexey Samsonove6704ee2012-08-21 08:13:37 +000074 }
75 ~InternalScopedBuffer() {
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000076 UnmapOrDie(ptr_, cnt_ * sizeof(T));
Alexey Samsonove6704ee2012-08-21 08:13:37 +000077 }
78 T &operator[](uptr i) { return ptr_[i]; }
79 T *data() { return ptr_; }
80 uptr size() { return cnt_ * sizeof(T); }
81
82 private:
83 T *ptr_;
84 uptr cnt_;
85 // Disallow evil constructors.
86 InternalScopedBuffer(const InternalScopedBuffer&);
87 void operator=(const InternalScopedBuffer&);
88};
89
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000090// Simple low-level (mmap-based) allocator for internal use. Doesn't have
91// constructor, so all instances of LowLevelAllocator should be
92// linker initialized.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000093class LowLevelAllocator {
94 public:
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000095 // Requires an external lock.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000096 void *Allocate(uptr size);
97 private:
98 char *allocated_end_;
99 char *allocated_current_;
100};
101typedef void (*LowLevelAllocateCallback)(uptr ptr, uptr size);
102// Allows to register tool-specific callbacks for LowLevelAllocator.
103// Passing NULL removes the callback.
104void SetLowLevelAllocateCallback(LowLevelAllocateCallback callback);
105
Alexey Samsonovc70d1082012-06-14 14:42:58 +0000106// IO
Alexey Samsonov4b1f1032012-06-07 07:13:46 +0000107void RawWrite(const char *buffer);
Alexey Samsonov58358892012-11-02 15:18:34 +0000108bool PrintsToTty();
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000109void Printf(const char *format, ...);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000110void Report(const char *format, ...);
Kostya Serebryanybb6f1652012-08-28 11:34:40 +0000111void SetPrintfAndReportCallback(void (*callback)(const char *));
Alexey Samsonov51ae9832012-06-06 13:11:29 +0000112
Alexey Samsonov39313b72013-02-01 15:58:46 +0000113fd_t OpenFile(const char *filename, bool write);
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +0000114// Opens the file 'file_name" and reads up to 'max_len' bytes.
115// The resulting buffer is mmaped and stored in '*buff'.
116// The size of the mmaped region is stored in '*buff_size',
117// Returns the number of read bytes or 0 if file can not be opened.
118uptr ReadFileToBuffer(const char *file_name, char **buff,
119 uptr *buff_size, uptr max_len);
Alexey Samsonov961276a2012-07-03 08:24:14 +0000120// Maps given file to virtual memory, and returns pointer to it
121// (or NULL if the mapping failes). Stores the size of mmaped region
122// in '*buff_size'.
123void *MapFileToMemory(const char *file_name, uptr *buff_size);
124
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000125// OS
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000126void DisableCoreDumper();
127void DumpProcessMap();
Alexey Samsonovae9b18b2012-11-09 14:45:30 +0000128bool FileExists(const char *filename);
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000129const char *GetEnv(const char *name);
130const char *GetPwd();
Alexey Samsonov9211bd32013-02-18 07:17:12 +0000131u32 GetUid();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000132void ReExec();
133bool StackSizeIsUnlimited();
134void SetStackSizeLimitInBytes(uptr limit);
Alexander Potapenko1746f552012-12-10 13:10:40 +0000135void PrepareForSandboxing();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000136
Evgeniy Stepanov5697b582013-03-13 08:19:53 +0000137void InitTlsSize();
138uptr GetTlsSize();
139
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000140// Other
Alexey Samsonov70afb912012-06-15 06:37:34 +0000141void SleepForSeconds(int seconds);
Alexey Samsonov58a3c582012-06-18 08:44:30 +0000142void SleepForMillis(int millis);
Alexey Samsonov70afb912012-06-15 06:37:34 +0000143int Atexit(void (*function)(void));
Alexey Samsonove4a88982012-06-15 07:00:31 +0000144void SortArray(uptr *array, uptr size);
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000145
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000146// Exit
147void NORETURN Abort();
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000148void NORETURN Die();
149void NORETURN SANITIZER_INTERFACE_ATTRIBUTE
150CheckFailed(const char *file, int line, const char *cond, u64 v1, u64 v2);
151
Kostya Serebryany35f9e5e2012-12-07 11:27:24 +0000152// Set the name of the current thread to 'name', return true on succees.
153// The name may be truncated to a system-dependent limit.
154bool SanitizerSetThreadName(const char *name);
155// Get the name of the current thread (no more than max_len bytes),
156// return true on succees. name should have space for at least max_len+1 bytes.
157bool SanitizerGetThreadName(char *name, int max_len);
158
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000159// Specific tools may override behavior of "Die" and "CheckFailed" functions
160// to do tool-specific job.
161void SetDieCallback(void (*callback)(void));
162typedef void (*CheckFailedCallbackType)(const char *, int, const char *,
163 u64, u64);
164void SetCheckFailedCallback(CheckFailedCallbackType callback);
165
Kostya Serebryanyb4c2c5c2013-02-06 12:36:49 +0000166// Construct a one-line string like
167// SanitizerToolName: error_type file:line function
168// and call __sanitizer_report_error_summary on it.
169void ReportErrorSummary(const char *error_type, const char *file,
170 int line, const char *function);
171
Alexey Samsonove4a88982012-06-15 07:00:31 +0000172// Math
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000173#if SANITIZER_WINDOWS && !defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000174extern "C" {
175unsigned char _BitScanForward(unsigned long *index, unsigned long mask); // NOLINT
176unsigned char _BitScanReverse(unsigned long *index, unsigned long mask); // NOLINT
177#if defined(_WIN64)
178unsigned char _BitScanForward64(unsigned long *index, unsigned __int64 mask); // NOLINT
179unsigned char _BitScanReverse64(unsigned long *index, unsigned __int64 mask); // NOLINT
180#endif
181}
182#endif
183
184INLINE uptr MostSignificantSetBitIndex(uptr x) {
Kostya Serebryany459df6f2013-02-26 12:59:06 +0000185 CHECK_NE(x, 0U);
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000186 unsigned long up; // NOLINT
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000187#if !SANITIZER_WINDOWS || defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000188 up = SANITIZER_WORDSIZE - 1 - __builtin_clzl(x);
189#elif defined(_WIN64)
190 _BitScanReverse64(&up, x);
191#else
192 _BitScanReverse(&up, x);
193#endif
194 return up;
195}
196
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000197INLINE bool IsPowerOfTwo(uptr x) {
Alexey Samsonovee072902012-06-06 09:26:25 +0000198 return (x & (x - 1)) == 0;
199}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000200
201INLINE uptr RoundUpToPowerOfTwo(uptr size) {
202 CHECK(size);
203 if (IsPowerOfTwo(size)) return size;
204
205 uptr up = MostSignificantSetBitIndex(size);
206 CHECK(size < (1ULL << (up + 1)));
207 CHECK(size > (1ULL << up));
208 return 1UL << (up + 1);
209}
210
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000211INLINE uptr RoundUpTo(uptr size, uptr boundary) {
Alexey Samsonove4a88982012-06-15 07:00:31 +0000212 CHECK(IsPowerOfTwo(boundary));
Alexey Samsonovee072902012-06-06 09:26:25 +0000213 return (size + boundary - 1) & ~(boundary - 1);
214}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000215
Kostya Serebryany7dfb1682012-12-14 12:15:09 +0000216INLINE uptr RoundDownTo(uptr x, uptr boundary) {
217 return x & ~(boundary - 1);
218}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000219
Kostya Serebryany90a59fa2012-12-11 14:41:31 +0000220INLINE bool IsAligned(uptr a, uptr alignment) {
221 return (a & (alignment - 1)) == 0;
222}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000223
224INLINE uptr Log2(uptr x) {
225 CHECK(IsPowerOfTwo(x));
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000226#if !SANITIZER_WINDOWS || defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000227 return __builtin_ctzl(x);
228#elif defined(_WIN64)
229 unsigned long ret; // NOLINT
230 _BitScanForward64(&ret, x);
231 return ret;
232#else
233 unsigned long ret; // NOLINT
234 _BitScanForward(&ret, x);
235 return ret;
236#endif
237}
238
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000239// Don't use std::min, std::max or std::swap, to minimize dependency
240// on libstdc++.
Alexey Samsonove4a88982012-06-15 07:00:31 +0000241template<class T> T Min(T a, T b) { return a < b ? a : b; }
242template<class T> T Max(T a, T b) { return a > b ? a : b; }
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000243template<class T> void Swap(T& a, T& b) {
244 T tmp = a;
245 a = b;
246 b = tmp;
247}
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000248
Alexey Samsonov156958d2012-06-15 13:09:52 +0000249// Char handling
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000250INLINE bool IsSpace(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000251 return (c == ' ') || (c == '\n') || (c == '\t') ||
252 (c == '\f') || (c == '\r') || (c == '\v');
253}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000254INLINE bool IsDigit(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000255 return (c >= '0') && (c <= '9');
256}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000257INLINE int ToLower(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000258 return (c >= 'A' && c <= 'Z') ? (c + 'a' - 'A') : c;
259}
260
Kostya Serebryany734f1eb2012-11-21 12:38:58 +0000261#if SANITIZER_WORDSIZE == 64
Kostya Serebryanyc0bbfbf2012-06-06 16:33:46 +0000262# define FIRST_32_SECOND_64(a, b) (b)
263#else
264# define FIRST_32_SECOND_64(a, b) (a)
265#endif
266
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000267// A low-level vector based on mmap. May incur a significant memory overhead for
268// small vectors.
269// WARNING: The current implementation supports only POD types.
270template<typename T>
271class InternalVector {
272 public:
273 explicit InternalVector(uptr initial_capacity) {
274 CHECK_GT(initial_capacity, 0);
275 capacity_ = initial_capacity;
276 size_ = 0;
277 data_ = (T *)MmapOrDie(capacity_ * sizeof(T), "InternalVector");
278 }
279 ~InternalVector() {
280 UnmapOrDie(data_, capacity_ * sizeof(T));
281 }
282 T &operator[](uptr i) {
283 CHECK_LT(i, size_);
284 return data_[i];
285 }
286 void push_back(const T &element) {
287 CHECK_LE(size_, capacity_);
288 if (size_ == capacity_) {
289 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
290 Resize(new_capacity);
291 }
292 data_[size_++] = element;
293 }
Alexey Samsonov434dde92013-03-05 11:58:25 +0000294 T &back() {
295 CHECK_GT(size_, 0);
296 return data_[size_ - 1];
297 }
298 void pop_back() {
299 CHECK_GT(size_, 0);
300 size_--;
301 }
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000302 uptr size() {
303 return size_;
304 }
305
306 private:
307 void Resize(uptr new_capacity) {
308 CHECK_GT(new_capacity, 0);
309 CHECK_LE(size_, new_capacity);
310 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
311 "InternalVector");
312 internal_memcpy(new_data, data_, size_ * sizeof(T));
313 T *old_data = data_;
314 data_ = new_data;
315 UnmapOrDie(old_data, capacity_ * sizeof(T));
316 capacity_ = new_capacity;
317 }
318 // Disallow evil constructors.
319 InternalVector(const InternalVector&);
320 void operator=(const InternalVector&);
321
322 T *data_;
323 uptr capacity_;
324 uptr size_;
325};
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000326} // namespace __sanitizer
327
328#endif // SANITIZER_COMMON_H