blob: ce04919b13e42b80157cc5afa907a3b3197d3022 [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.
36
Kostya Serebryanyf22c6972012-11-23 15:38:49 +000037uptr GetPageSize();
38uptr GetPageSizeCached();
39uptr GetMmapGranularity();
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000040// Threads
Alexey Samsonovee072902012-06-06 09:26:25 +000041int GetPid();
Dmitry Vyukov56faa552012-10-02 12:58:14 +000042uptr GetTid();
Alexey Samsonov70afb912012-06-15 06:37:34 +000043uptr GetThreadSelf();
Alexey Samsonovcf4d3a02012-06-07 07:32:00 +000044void GetThreadStackTopAndBottom(bool at_initialization, uptr *stack_top,
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000045 uptr *stack_bottom);
Alexey Samsonov40d5b772012-06-06 16:15:07 +000046
47// Memory management
48void *MmapOrDie(uptr size, const char *mem_type);
Alexey Samsonovee072902012-06-06 09:26:25 +000049void UnmapOrDie(void *addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000050void *MmapFixedNoReserve(uptr fixed_addr, uptr size);
Kostya Serebryany98066282012-12-13 05:36:00 +000051void *MmapFixedOrDie(uptr fixed_addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000052void *Mprotect(uptr fixed_addr, uptr size);
Kostya Serebryany1e3d3872012-12-06 06:10:31 +000053// Map aligned chunk of address space; size and alignment are powers of two.
54void *MmapAlignedOrDie(uptr size, uptr alignment, const char *mem_type);
Alexey Samsonov40e51282012-06-15 07:29:14 +000055// Used to check if we can map shadow memory to a fixed location.
56bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
Kostya Serebryany6f604b52012-12-27 07:37:24 +000057void FlushUnneededShadowMemory(uptr addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000058
59// Internal allocator
Alexey Samsonov3a6ddb82012-06-07 08:52:56 +000060void *InternalAlloc(uptr size);
Dmitry Vyukovc598de92012-06-25 15:09:24 +000061void InternalFree(void *p);
Alexey Samsonovee072902012-06-06 09:26:25 +000062
Alexey Samsonove6704ee2012-08-21 08:13:37 +000063// InternalScopedBuffer can be used instead of large stack arrays to
64// keep frame size low.
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000065// FIXME: use InternalAlloc instead of MmapOrDie once
66// InternalAlloc is made libc-free.
Alexey Samsonove6704ee2012-08-21 08:13:37 +000067template<typename T>
68class InternalScopedBuffer {
69 public:
70 explicit InternalScopedBuffer(uptr cnt) {
71 cnt_ = cnt;
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000072 ptr_ = (T*)MmapOrDie(cnt * sizeof(T), "InternalScopedBuffer");
Alexey Samsonove6704ee2012-08-21 08:13:37 +000073 }
74 ~InternalScopedBuffer() {
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000075 UnmapOrDie(ptr_, cnt_ * sizeof(T));
Alexey Samsonove6704ee2012-08-21 08:13:37 +000076 }
77 T &operator[](uptr i) { return ptr_[i]; }
78 T *data() { return ptr_; }
79 uptr size() { return cnt_ * sizeof(T); }
80
81 private:
82 T *ptr_;
83 uptr cnt_;
84 // Disallow evil constructors.
85 InternalScopedBuffer(const InternalScopedBuffer&);
86 void operator=(const InternalScopedBuffer&);
87};
88
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000089// Simple low-level (mmap-based) allocator for internal use. Doesn't have
90// constructor, so all instances of LowLevelAllocator should be
91// linker initialized.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000092class LowLevelAllocator {
93 public:
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000094 // Requires an external lock.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000095 void *Allocate(uptr size);
96 private:
97 char *allocated_end_;
98 char *allocated_current_;
99};
100typedef void (*LowLevelAllocateCallback)(uptr ptr, uptr size);
101// Allows to register tool-specific callbacks for LowLevelAllocator.
102// Passing NULL removes the callback.
103void SetLowLevelAllocateCallback(LowLevelAllocateCallback callback);
104
Alexey Samsonovc70d1082012-06-14 14:42:58 +0000105// IO
Alexey Samsonov4b1f1032012-06-07 07:13:46 +0000106void RawWrite(const char *buffer);
Alexey Samsonov58358892012-11-02 15:18:34 +0000107bool PrintsToTty();
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000108void Printf(const char *format, ...);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000109void Report(const char *format, ...);
Kostya Serebryanybb6f1652012-08-28 11:34:40 +0000110void SetPrintfAndReportCallback(void (*callback)(const char *));
Alexey Samsonov51ae9832012-06-06 13:11:29 +0000111
Alexey Samsonov39313b72013-02-01 15:58:46 +0000112fd_t OpenFile(const char *filename, bool write);
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +0000113// Opens the file 'file_name" and reads up to 'max_len' bytes.
114// The resulting buffer is mmaped and stored in '*buff'.
115// The size of the mmaped region is stored in '*buff_size',
116// Returns the number of read bytes or 0 if file can not be opened.
117uptr ReadFileToBuffer(const char *file_name, char **buff,
118 uptr *buff_size, uptr max_len);
Alexey Samsonov961276a2012-07-03 08:24:14 +0000119// Maps given file to virtual memory, and returns pointer to it
120// (or NULL if the mapping failes). Stores the size of mmaped region
121// in '*buff_size'.
122void *MapFileToMemory(const char *file_name, uptr *buff_size);
123
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000124// OS
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000125void DisableCoreDumper();
126void DumpProcessMap();
Alexey Samsonovae9b18b2012-11-09 14:45:30 +0000127bool FileExists(const char *filename);
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000128const char *GetEnv(const char *name);
129const char *GetPwd();
Alexey Samsonov9211bd32013-02-18 07:17:12 +0000130u32 GetUid();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000131void ReExec();
132bool StackSizeIsUnlimited();
133void SetStackSizeLimitInBytes(uptr limit);
Alexander Potapenko1746f552012-12-10 13:10:40 +0000134void PrepareForSandboxing();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000135
136// Other
Alexey Samsonov70afb912012-06-15 06:37:34 +0000137void SleepForSeconds(int seconds);
Alexey Samsonov58a3c582012-06-18 08:44:30 +0000138void SleepForMillis(int millis);
Alexey Samsonov70afb912012-06-15 06:37:34 +0000139int Atexit(void (*function)(void));
Alexey Samsonove4a88982012-06-15 07:00:31 +0000140void SortArray(uptr *array, uptr size);
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000141
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000142// Exit
143void NORETURN Abort();
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000144void NORETURN Die();
145void NORETURN SANITIZER_INTERFACE_ATTRIBUTE
146CheckFailed(const char *file, int line, const char *cond, u64 v1, u64 v2);
147
Kostya Serebryany35f9e5e2012-12-07 11:27:24 +0000148// Set the name of the current thread to 'name', return true on succees.
149// The name may be truncated to a system-dependent limit.
150bool SanitizerSetThreadName(const char *name);
151// Get the name of the current thread (no more than max_len bytes),
152// return true on succees. name should have space for at least max_len+1 bytes.
153bool SanitizerGetThreadName(char *name, int max_len);
154
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000155// Specific tools may override behavior of "Die" and "CheckFailed" functions
156// to do tool-specific job.
157void SetDieCallback(void (*callback)(void));
158typedef void (*CheckFailedCallbackType)(const char *, int, const char *,
159 u64, u64);
160void SetCheckFailedCallback(CheckFailedCallbackType callback);
161
Kostya Serebryanyb4c2c5c2013-02-06 12:36:49 +0000162// Construct a one-line string like
163// SanitizerToolName: error_type file:line function
164// and call __sanitizer_report_error_summary on it.
165void ReportErrorSummary(const char *error_type, const char *file,
166 int line, const char *function);
167
Alexey Samsonove4a88982012-06-15 07:00:31 +0000168// Math
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000169#if defined(_WIN32) && !defined(__clang__)
170extern "C" {
171unsigned char _BitScanForward(unsigned long *index, unsigned long mask); // NOLINT
172unsigned char _BitScanReverse(unsigned long *index, unsigned long mask); // NOLINT
173#if defined(_WIN64)
174unsigned char _BitScanForward64(unsigned long *index, unsigned __int64 mask); // NOLINT
175unsigned char _BitScanReverse64(unsigned long *index, unsigned __int64 mask); // NOLINT
176#endif
177}
178#endif
179
180INLINE uptr MostSignificantSetBitIndex(uptr x) {
Kostya Serebryany459df6f2013-02-26 12:59:06 +0000181 CHECK_NE(x, 0U);
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000182 unsigned long up; // NOLINT
183#if !defined(_WIN32) || defined(__clang__)
184 up = SANITIZER_WORDSIZE - 1 - __builtin_clzl(x);
185#elif defined(_WIN64)
186 _BitScanReverse64(&up, x);
187#else
188 _BitScanReverse(&up, x);
189#endif
190 return up;
191}
192
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000193INLINE bool IsPowerOfTwo(uptr x) {
Alexey Samsonovee072902012-06-06 09:26:25 +0000194 return (x & (x - 1)) == 0;
195}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000196
197INLINE uptr RoundUpToPowerOfTwo(uptr size) {
198 CHECK(size);
199 if (IsPowerOfTwo(size)) return size;
200
201 uptr up = MostSignificantSetBitIndex(size);
202 CHECK(size < (1ULL << (up + 1)));
203 CHECK(size > (1ULL << up));
204 return 1UL << (up + 1);
205}
206
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000207INLINE uptr RoundUpTo(uptr size, uptr boundary) {
Alexey Samsonove4a88982012-06-15 07:00:31 +0000208 CHECK(IsPowerOfTwo(boundary));
Alexey Samsonovee072902012-06-06 09:26:25 +0000209 return (size + boundary - 1) & ~(boundary - 1);
210}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000211
Kostya Serebryany7dfb1682012-12-14 12:15:09 +0000212INLINE uptr RoundDownTo(uptr x, uptr boundary) {
213 return x & ~(boundary - 1);
214}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000215
Kostya Serebryany90a59fa2012-12-11 14:41:31 +0000216INLINE bool IsAligned(uptr a, uptr alignment) {
217 return (a & (alignment - 1)) == 0;
218}
Timur Iskhodzhanov659bca52013-02-08 11:45:04 +0000219
220INLINE uptr Log2(uptr x) {
221 CHECK(IsPowerOfTwo(x));
222#if !defined(_WIN32) || defined(__clang__)
223 return __builtin_ctzl(x);
224#elif defined(_WIN64)
225 unsigned long ret; // NOLINT
226 _BitScanForward64(&ret, x);
227 return ret;
228#else
229 unsigned long ret; // NOLINT
230 _BitScanForward(&ret, x);
231 return ret;
232#endif
233}
234
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000235// Don't use std::min, std::max or std::swap, to minimize dependency
236// on libstdc++.
Alexey Samsonove4a88982012-06-15 07:00:31 +0000237template<class T> T Min(T a, T b) { return a < b ? a : b; }
238template<class T> T Max(T a, T b) { return a > b ? a : b; }
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000239template<class T> void Swap(T& a, T& b) {
240 T tmp = a;
241 a = b;
242 b = tmp;
243}
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000244
Alexey Samsonov156958d2012-06-15 13:09:52 +0000245// Char handling
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000246INLINE bool IsSpace(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000247 return (c == ' ') || (c == '\n') || (c == '\t') ||
248 (c == '\f') || (c == '\r') || (c == '\v');
249}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000250INLINE bool IsDigit(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000251 return (c >= '0') && (c <= '9');
252}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000253INLINE int ToLower(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000254 return (c >= 'A' && c <= 'Z') ? (c + 'a' - 'A') : c;
255}
256
Kostya Serebryany734f1eb2012-11-21 12:38:58 +0000257#if SANITIZER_WORDSIZE == 64
Kostya Serebryanyc0bbfbf2012-06-06 16:33:46 +0000258# define FIRST_32_SECOND_64(a, b) (b)
259#else
260# define FIRST_32_SECOND_64(a, b) (a)
261#endif
262
Kostya Serebryanya8cfb902013-02-26 13:30:27 +0000263// A low-level vector based on mmap. May incur a significant memory overhead for
264// small vectors.
265// WARNING: The current implementation supports only POD types.
266template<typename T>
267class InternalVector {
268 public:
269 explicit InternalVector(uptr initial_capacity) {
270 CHECK_GT(initial_capacity, 0);
271 capacity_ = initial_capacity;
272 size_ = 0;
273 data_ = (T *)MmapOrDie(capacity_ * sizeof(T), "InternalVector");
274 }
275 ~InternalVector() {
276 UnmapOrDie(data_, capacity_ * sizeof(T));
277 }
278 T &operator[](uptr i) {
279 CHECK_LT(i, size_);
280 return data_[i];
281 }
282 void push_back(const T &element) {
283 CHECK_LE(size_, capacity_);
284 if (size_ == capacity_) {
285 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
286 Resize(new_capacity);
287 }
288 data_[size_++] = element;
289 }
290 uptr size() {
291 return size_;
292 }
293
294 private:
295 void Resize(uptr new_capacity) {
296 CHECK_GT(new_capacity, 0);
297 CHECK_LE(size_, new_capacity);
298 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
299 "InternalVector");
300 internal_memcpy(new_data, data_, size_ * sizeof(T));
301 T *old_data = data_;
302 data_ = new_data;
303 UnmapOrDie(old_data, capacity_ * sizeof(T));
304 capacity_ = new_capacity;
305 }
306 // Disallow evil constructors.
307 InternalVector(const InternalVector&);
308 void operator=(const InternalVector&);
309
310 T *data_;
311 uptr capacity_;
312 uptr size_;
313};
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000314} // namespace __sanitizer
315
316#endif // SANITIZER_COMMON_H