blob: 15847a79ae49101c2cbc6b6a2e1f587b3d2bc0b0 [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 Samsonov734aab42013-04-05 07:30:29 +000021#include "sanitizer_mutex.h"
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +000022
23namespace __sanitizer {
Kostya Serebryanyb4c2c5c2013-02-06 12:36:49 +000024struct StackTrace;
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +000025
Alexey Samsonovee072902012-06-06 09:26:25 +000026// Constants.
Kostya Serebryany734f1eb2012-11-21 12:38:58 +000027const uptr kWordSize = SANITIZER_WORDSIZE / 8;
Alexey Samsonovee072902012-06-06 09:26:25 +000028const uptr kWordSizeInBits = 8 * kWordSize;
Kostya Serebryanydf198db2012-11-24 05:03:11 +000029
Kostya Serebryany46de5802012-11-20 07:00:42 +000030#if defined(__powerpc__) || defined(__powerpc64__)
Kostya Serebryany46de5802012-11-20 07:00:42 +000031const uptr kCacheLineSize = 128;
Alexey Samsonov40e51282012-06-15 07:29:14 +000032#else
Kostya Serebryany46de5802012-11-20 07:00:42 +000033const uptr kCacheLineSize = 64;
Alexey Samsonov40e51282012-06-15 07:29:14 +000034#endif
Alexey Samsonovee072902012-06-06 09:26:25 +000035
Kostya Serebryanybda64b42013-01-31 14:11:21 +000036extern const char *SanitizerToolName; // Can be changed by the tool.
Alexander Potapenko845b5752013-03-15 14:37:21 +000037extern uptr SanitizerVerbosity;
Kostya Serebryanybda64b42013-01-31 14:11:21 +000038
Kostya Serebryanyf22c6972012-11-23 15:38:49 +000039uptr GetPageSize();
40uptr GetPageSizeCached();
41uptr GetMmapGranularity();
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000042// Threads
Alexey Samsonovee072902012-06-06 09:26:25 +000043int GetPid();
Dmitry Vyukov56faa552012-10-02 12:58:14 +000044uptr GetTid();
Alexey Samsonov70afb912012-06-15 06:37:34 +000045uptr GetThreadSelf();
Alexey Samsonovcf4d3a02012-06-07 07:32:00 +000046void GetThreadStackTopAndBottom(bool at_initialization, uptr *stack_top,
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000047 uptr *stack_bottom);
Alexey Samsonov40d5b772012-06-06 16:15:07 +000048
49// Memory management
50void *MmapOrDie(uptr size, const char *mem_type);
Alexey Samsonovee072902012-06-06 09:26:25 +000051void UnmapOrDie(void *addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000052void *MmapFixedNoReserve(uptr fixed_addr, uptr size);
Kostya Serebryany98066282012-12-13 05:36:00 +000053void *MmapFixedOrDie(uptr fixed_addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000054void *Mprotect(uptr fixed_addr, uptr size);
Kostya Serebryany1e3d3872012-12-06 06:10:31 +000055// Map aligned chunk of address space; size and alignment are powers of two.
56void *MmapAlignedOrDie(uptr size, uptr alignment, const char *mem_type);
Alexey Samsonov40e51282012-06-15 07:29:14 +000057// Used to check if we can map shadow memory to a fixed location.
58bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
Kostya Serebryany6f604b52012-12-27 07:37:24 +000059void FlushUnneededShadowMemory(uptr addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000060
61// Internal allocator
Alexey Samsonov3a6ddb82012-06-07 08:52:56 +000062void *InternalAlloc(uptr size);
Dmitry Vyukovc598de92012-06-25 15:09:24 +000063void InternalFree(void *p);
Alexey Samsonovee072902012-06-06 09:26:25 +000064
Alexey Samsonove6704ee2012-08-21 08:13:37 +000065// InternalScopedBuffer can be used instead of large stack arrays to
66// keep frame size low.
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000067// FIXME: use InternalAlloc instead of MmapOrDie once
68// InternalAlloc is made libc-free.
Alexey Samsonove6704ee2012-08-21 08:13:37 +000069template<typename T>
70class InternalScopedBuffer {
71 public:
72 explicit InternalScopedBuffer(uptr cnt) {
73 cnt_ = cnt;
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000074 ptr_ = (T*)MmapOrDie(cnt * sizeof(T), "InternalScopedBuffer");
Alexey Samsonove6704ee2012-08-21 08:13:37 +000075 }
76 ~InternalScopedBuffer() {
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000077 UnmapOrDie(ptr_, cnt_ * sizeof(T));
Alexey Samsonove6704ee2012-08-21 08:13:37 +000078 }
79 T &operator[](uptr i) { return ptr_[i]; }
80 T *data() { return ptr_; }
81 uptr size() { return cnt_ * sizeof(T); }
82
83 private:
84 T *ptr_;
85 uptr cnt_;
86 // Disallow evil constructors.
87 InternalScopedBuffer(const InternalScopedBuffer&);
88 void operator=(const InternalScopedBuffer&);
89};
90
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000091// Simple low-level (mmap-based) allocator for internal use. Doesn't have
92// constructor, so all instances of LowLevelAllocator should be
93// linker initialized.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000094class LowLevelAllocator {
95 public:
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000096 // Requires an external lock.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000097 void *Allocate(uptr size);
98 private:
99 char *allocated_end_;
100 char *allocated_current_;
101};
102typedef void (*LowLevelAllocateCallback)(uptr ptr, uptr size);
103// Allows to register tool-specific callbacks for LowLevelAllocator.
104// Passing NULL removes the callback.
105void SetLowLevelAllocateCallback(LowLevelAllocateCallback callback);
106
Alexey Samsonovc70d1082012-06-14 14:42:58 +0000107// IO
Alexey Samsonov4b1f1032012-06-07 07:13:46 +0000108void RawWrite(const char *buffer);
Alexey Samsonov58358892012-11-02 15:18:34 +0000109bool PrintsToTty();
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000110void Printf(const char *format, ...);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000111void Report(const char *format, ...);
Kostya Serebryanybb6f1652012-08-28 11:34:40 +0000112void SetPrintfAndReportCallback(void (*callback)(const char *));
Alexey Samsonov734aab42013-04-05 07:30:29 +0000113// Can be used to prevent mixing error reports from different sanitizers.
114extern StaticSpinMutex CommonSanitizerReportMutex;
Alexey Samsonov51ae9832012-06-06 13:11:29 +0000115
Alexey Samsonov39313b72013-02-01 15:58:46 +0000116fd_t OpenFile(const char *filename, bool write);
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +0000117// Opens the file 'file_name" and reads up to 'max_len' bytes.
118// The resulting buffer is mmaped and stored in '*buff'.
119// The size of the mmaped region is stored in '*buff_size',
120// Returns the number of read bytes or 0 if file can not be opened.
121uptr ReadFileToBuffer(const char *file_name, char **buff,
122 uptr *buff_size, uptr max_len);
Alexey Samsonov961276a2012-07-03 08:24:14 +0000123// Maps given file to virtual memory, and returns pointer to it
124// (or NULL if the mapping failes). Stores the size of mmaped region
125// in '*buff_size'.
126void *MapFileToMemory(const char *file_name, uptr *buff_size);
127
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000128// OS
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000129void DisableCoreDumper();
130void DumpProcessMap();
Alexey Samsonovae9b18b2012-11-09 14:45:30 +0000131bool FileExists(const char *filename);
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000132const char *GetEnv(const char *name);
133const char *GetPwd();
Alexey Samsonov9211bd32013-02-18 07:17:12 +0000134u32 GetUid();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000135void ReExec();
136bool StackSizeIsUnlimited();
137void SetStackSizeLimitInBytes(uptr limit);
Alexander Potapenko1746f552012-12-10 13:10:40 +0000138void PrepareForSandboxing();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000139
Evgeniy Stepanov5697b582013-03-13 08:19:53 +0000140void InitTlsSize();
141uptr GetTlsSize();
142
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000143// Other
Alexey Samsonov70afb912012-06-15 06:37:34 +0000144void SleepForSeconds(int seconds);
Alexey Samsonov58a3c582012-06-18 08:44:30 +0000145void SleepForMillis(int millis);
Dmitry Vyukov78693732013-03-21 06:24:31 +0000146u64 NanoTime();
Alexey Samsonov70afb912012-06-15 06:37:34 +0000147int Atexit(void (*function)(void));
Alexey Samsonove4a88982012-06-15 07:00:31 +0000148void SortArray(uptr *array, uptr size);
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000149
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000150// Exit
151void NORETURN Abort();
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000152void NORETURN Die();
153void NORETURN SANITIZER_INTERFACE_ATTRIBUTE
154CheckFailed(const char *file, int line, const char *cond, u64 v1, u64 v2);
155
Kostya Serebryany35f9e5e2012-12-07 11:27:24 +0000156// Set the name of the current thread to 'name', return true on succees.
157// The name may be truncated to a system-dependent limit.
158bool SanitizerSetThreadName(const char *name);
159// Get the name of the current thread (no more than max_len bytes),
160// return true on succees. name should have space for at least max_len+1 bytes.
161bool SanitizerGetThreadName(char *name, int max_len);
162
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000163// Specific tools may override behavior of "Die" and "CheckFailed" functions
164// to do tool-specific job.
165void SetDieCallback(void (*callback)(void));
166typedef void (*CheckFailedCallbackType)(const char *, int, const char *,
167 u64, u64);
168void SetCheckFailedCallback(CheckFailedCallbackType callback);
169
Kostya Serebryanyb4c2c5c2013-02-06 12:36:49 +0000170// Construct a one-line string like
171// SanitizerToolName: error_type file:line function
172// and call __sanitizer_report_error_summary on it.
173void ReportErrorSummary(const char *error_type, const char *file,
174 int line, const char *function);
175
Alexey Samsonove4a88982012-06-15 07:00:31 +0000176// Math
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000177#if SANITIZER_WINDOWS && !defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000178extern "C" {
179unsigned char _BitScanForward(unsigned long *index, unsigned long mask); // NOLINT
180unsigned char _BitScanReverse(unsigned long *index, unsigned long mask); // NOLINT
181#if defined(_WIN64)
182unsigned char _BitScanForward64(unsigned long *index, unsigned __int64 mask); // NOLINT
183unsigned char _BitScanReverse64(unsigned long *index, unsigned __int64 mask); // NOLINT
184#endif
185}
186#endif
187
188INLINE uptr MostSignificantSetBitIndex(uptr x) {
Kostya Serebryany459df6f2013-02-26 12:59:06 +0000189 CHECK_NE(x, 0U);
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000190 unsigned long up; // NOLINT
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000191#if !SANITIZER_WINDOWS || defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000192 up = SANITIZER_WORDSIZE - 1 - __builtin_clzl(x);
193#elif defined(_WIN64)
194 _BitScanReverse64(&up, x);
195#else
196 _BitScanReverse(&up, x);
197#endif
198 return up;
199}
200
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000201INLINE bool IsPowerOfTwo(uptr x) {
Alexey Samsonovee072902012-06-06 09:26:25 +0000202 return (x & (x - 1)) == 0;
203}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000204
205INLINE uptr RoundUpToPowerOfTwo(uptr size) {
206 CHECK(size);
207 if (IsPowerOfTwo(size)) return size;
208
209 uptr up = MostSignificantSetBitIndex(size);
210 CHECK(size < (1ULL << (up + 1)));
211 CHECK(size > (1ULL << up));
212 return 1UL << (up + 1);
213}
214
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000215INLINE uptr RoundUpTo(uptr size, uptr boundary) {
Alexey Samsonove4a88982012-06-15 07:00:31 +0000216 CHECK(IsPowerOfTwo(boundary));
Alexey Samsonovee072902012-06-06 09:26:25 +0000217 return (size + boundary - 1) & ~(boundary - 1);
218}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000219
Kostya Serebryany7dfb1682012-12-14 12:15:09 +0000220INLINE uptr RoundDownTo(uptr x, uptr boundary) {
221 return x & ~(boundary - 1);
222}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000223
Kostya Serebryany90a59fa2012-12-11 14:41:31 +0000224INLINE bool IsAligned(uptr a, uptr alignment) {
225 return (a & (alignment - 1)) == 0;
226}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000227
228INLINE uptr Log2(uptr x) {
229 CHECK(IsPowerOfTwo(x));
Evgeniy Stepanov0af67232013-03-19 14:33:38 +0000230#if !SANITIZER_WINDOWS || defined(__clang__)
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000231 return __builtin_ctzl(x);
232#elif defined(_WIN64)
233 unsigned long ret; // NOLINT
234 _BitScanForward64(&ret, x);
235 return ret;
236#else
237 unsigned long ret; // NOLINT
238 _BitScanForward(&ret, x);
239 return ret;
240#endif
241}
242
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000243// Don't use std::min, std::max or std::swap, to minimize dependency
244// on libstdc++.
Alexey Samsonove4a88982012-06-15 07:00:31 +0000245template<class T> T Min(T a, T b) { return a < b ? a : b; }
246template<class T> T Max(T a, T b) { return a > b ? a : b; }
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000247template<class T> void Swap(T& a, T& b) {
248 T tmp = a;
249 a = b;
250 b = tmp;
251}
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000252
Alexey Samsonov156958d2012-06-15 13:09:52 +0000253// Char handling
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000254INLINE bool IsSpace(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000255 return (c == ' ') || (c == '\n') || (c == '\t') ||
256 (c == '\f') || (c == '\r') || (c == '\v');
257}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000258INLINE bool IsDigit(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000259 return (c >= '0') && (c <= '9');
260}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000261INLINE int ToLower(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000262 return (c >= 'A' && c <= 'Z') ? (c + 'a' - 'A') : c;
263}
264
Kostya Serebryany734f1eb2012-11-21 12:38:58 +0000265#if SANITIZER_WORDSIZE == 64
Kostya Serebryanyc0bbfbf2012-06-06 16:33:46 +0000266# define FIRST_32_SECOND_64(a, b) (b)
267#else
268# define FIRST_32_SECOND_64(a, b) (a)
269#endif
270
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000271// A low-level vector based on mmap. May incur a significant memory overhead for
272// small vectors.
273// WARNING: The current implementation supports only POD types.
274template<typename T>
275class InternalVector {
276 public:
277 explicit InternalVector(uptr initial_capacity) {
278 CHECK_GT(initial_capacity, 0);
279 capacity_ = initial_capacity;
280 size_ = 0;
281 data_ = (T *)MmapOrDie(capacity_ * sizeof(T), "InternalVector");
282 }
283 ~InternalVector() {
284 UnmapOrDie(data_, capacity_ * sizeof(T));
285 }
286 T &operator[](uptr i) {
Alexey Samsonov703a9872013-03-29 08:03:01 +0000287 CHECK_LT(i, size_);
Alexey Samsonovcfe56d42013-03-28 15:37:11 +0000288 return data_[i];
289 }
290 const T &operator[](uptr i) const {
Alexey Samsonov703a9872013-03-29 08:03:01 +0000291 CHECK_LT(i, size_);
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000292 return data_[i];
293 }
294 void push_back(const T &element) {
295 CHECK_LE(size_, capacity_);
296 if (size_ == capacity_) {
297 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
298 Resize(new_capacity);
299 }
300 data_[size_++] = element;
301 }
Alexey Samsonov434dde92013-03-05 11:58:25 +0000302 T &back() {
303 CHECK_GT(size_, 0);
304 return data_[size_ - 1];
305 }
306 void pop_back() {
307 CHECK_GT(size_, 0);
308 size_--;
309 }
Alexey Samsonovcfe56d42013-03-28 15:37:11 +0000310 uptr size() const {
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000311 return size_;
312 }
Alexander Potapenko401bed02013-04-01 13:55:34 +0000313 const T *data() const {
314 return data_;
315 }
316 uptr capacity() const {
317 return capacity_;
318 }
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000319
320 private:
321 void Resize(uptr new_capacity) {
322 CHECK_GT(new_capacity, 0);
323 CHECK_LE(size_, new_capacity);
324 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
325 "InternalVector");
326 internal_memcpy(new_data, data_, size_ * sizeof(T));
327 T *old_data = data_;
328 data_ = new_data;
329 UnmapOrDie(old_data, capacity_ * sizeof(T));
330 capacity_ = new_capacity;
331 }
332 // Disallow evil constructors.
333 InternalVector(const InternalVector&);
334 void operator=(const InternalVector&);
335
336 T *data_;
337 uptr capacity_;
338 uptr size_;
339};
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000340} // namespace __sanitizer
341
342#endif // SANITIZER_COMMON_H