blob: 323b0667e2ffcafe6840e98260daed9620e3edc1 [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"
20
21namespace __sanitizer {
22
Alexey Samsonovee072902012-06-06 09:26:25 +000023// Constants.
24const uptr kWordSize = __WORDSIZE / 8;
25const uptr kWordSizeInBits = 8 * kWordSize;
26const uptr kPageSizeBits = 12;
27const uptr kPageSize = 1UL << kPageSizeBits;
Kostya Serebryany5b014152012-06-22 13:00:50 +000028const uptr kCacheLineSize = 64;
Alexey Samsonov40e51282012-06-15 07:29:14 +000029#ifndef _WIN32
30const uptr kMmapGranularity = kPageSize;
31#else
32const uptr kMmapGranularity = 1UL << 16;
33#endif
Alexey Samsonovee072902012-06-06 09:26:25 +000034
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000035// Threads
Alexey Samsonovee072902012-06-06 09:26:25 +000036int GetPid();
Dmitry Vyukov56faa552012-10-02 12:58:14 +000037uptr GetTid();
Alexey Samsonov70afb912012-06-15 06:37:34 +000038uptr GetThreadSelf();
Alexey Samsonovcf4d3a02012-06-07 07:32:00 +000039void GetThreadStackTopAndBottom(bool at_initialization, uptr *stack_top,
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000040 uptr *stack_bottom);
Alexey Samsonov40d5b772012-06-06 16:15:07 +000041
42// Memory management
43void *MmapOrDie(uptr size, const char *mem_type);
Alexey Samsonovee072902012-06-06 09:26:25 +000044void UnmapOrDie(void *addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000045void *MmapFixedNoReserve(uptr fixed_addr, uptr size);
46void *Mprotect(uptr fixed_addr, uptr size);
Alexey Samsonov40e51282012-06-15 07:29:14 +000047// Used to check if we can map shadow memory to a fixed location.
48bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000049
50// Internal allocator
Alexey Samsonov3a6ddb82012-06-07 08:52:56 +000051void *InternalAlloc(uptr size);
Dmitry Vyukovc598de92012-06-25 15:09:24 +000052void InternalFree(void *p);
53// Given the pointer p into a valid allocated block,
54// returns a pointer to the beginning of the block.
55void *InternalAllocBlock(void *p);
Alexey Samsonovee072902012-06-06 09:26:25 +000056
Alexey Samsonove6704ee2012-08-21 08:13:37 +000057// InternalScopedBuffer can be used instead of large stack arrays to
58// keep frame size low.
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000059// FIXME: use InternalAlloc instead of MmapOrDie once
60// InternalAlloc is made libc-free.
Alexey Samsonove6704ee2012-08-21 08:13:37 +000061template<typename T>
62class InternalScopedBuffer {
63 public:
64 explicit InternalScopedBuffer(uptr cnt) {
65 cnt_ = cnt;
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000066 ptr_ = (T*)MmapOrDie(cnt * sizeof(T), "InternalScopedBuffer");
Alexey Samsonove6704ee2012-08-21 08:13:37 +000067 }
68 ~InternalScopedBuffer() {
Kostya Serebryanyd0d96bf2012-08-29 08:40:36 +000069 UnmapOrDie(ptr_, cnt_ * sizeof(T));
Alexey Samsonove6704ee2012-08-21 08:13:37 +000070 }
71 T &operator[](uptr i) { return ptr_[i]; }
72 T *data() { return ptr_; }
73 uptr size() { return cnt_ * sizeof(T); }
74
75 private:
76 T *ptr_;
77 uptr cnt_;
78 // Disallow evil constructors.
79 InternalScopedBuffer(const InternalScopedBuffer&);
80 void operator=(const InternalScopedBuffer&);
81};
82
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000083// Simple low-level (mmap-based) allocator for internal use. Doesn't have
84// constructor, so all instances of LowLevelAllocator should be
85// linker initialized.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000086class LowLevelAllocator {
87 public:
Alexey Samsonovd1d1a812012-08-27 14:51:36 +000088 // Requires an external lock.
Alexey Samsonovdc8d1f12012-08-27 09:30:58 +000089 void *Allocate(uptr size);
90 private:
91 char *allocated_end_;
92 char *allocated_current_;
93};
94typedef void (*LowLevelAllocateCallback)(uptr ptr, uptr size);
95// Allows to register tool-specific callbacks for LowLevelAllocator.
96// Passing NULL removes the callback.
97void SetLowLevelAllocateCallback(LowLevelAllocateCallback callback);
98
Alexey Samsonovc70d1082012-06-14 14:42:58 +000099// IO
Alexey Samsonov4b1f1032012-06-07 07:13:46 +0000100void RawWrite(const char *buffer);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000101void Printf(const char *format, ...);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +0000102void Report(const char *format, ...);
Kostya Serebryanybb6f1652012-08-28 11:34:40 +0000103void SetPrintfAndReportCallback(void (*callback)(const char *));
Alexey Samsonov51ae9832012-06-06 13:11:29 +0000104
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +0000105// Opens the file 'file_name" and reads up to 'max_len' bytes.
106// The resulting buffer is mmaped and stored in '*buff'.
107// The size of the mmaped region is stored in '*buff_size',
108// Returns the number of read bytes or 0 if file can not be opened.
109uptr ReadFileToBuffer(const char *file_name, char **buff,
110 uptr *buff_size, uptr max_len);
Alexey Samsonov961276a2012-07-03 08:24:14 +0000111// Maps given file to virtual memory, and returns pointer to it
112// (or NULL if the mapping failes). Stores the size of mmaped region
113// in '*buff_size'.
114void *MapFileToMemory(const char *file_name, uptr *buff_size);
115
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000116// OS
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000117void DisableCoreDumper();
118void DumpProcessMap();
Alexey Samsonov97ca3062012-09-17 09:12:39 +0000119const char *GetEnv(const char *name);
120const char *GetPwd();
121void ReExec();
122bool StackSizeIsUnlimited();
123void SetStackSizeLimitInBytes(uptr limit);
124
125// Other
Alexey Samsonov70afb912012-06-15 06:37:34 +0000126void SleepForSeconds(int seconds);
Alexey Samsonov58a3c582012-06-18 08:44:30 +0000127void SleepForMillis(int millis);
Alexey Samsonov70afb912012-06-15 06:37:34 +0000128int Atexit(void (*function)(void));
Alexey Samsonove4a88982012-06-15 07:00:31 +0000129void SortArray(uptr *array, uptr size);
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000130
Alexey Samsonov5c6b93b2012-09-11 09:44:48 +0000131// Exit
132void NORETURN Abort();
133void NORETURN Exit(int exitcode);
134void NORETURN Die();
135void NORETURN SANITIZER_INTERFACE_ATTRIBUTE
136CheckFailed(const char *file, int line, const char *cond, u64 v1, u64 v2);
137
138// Specific tools may override behavior of "Die" and "CheckFailed" functions
139// to do tool-specific job.
140void SetDieCallback(void (*callback)(void));
141typedef void (*CheckFailedCallbackType)(const char *, int, const char *,
142 u64, u64);
143void SetCheckFailedCallback(CheckFailedCallbackType callback);
144
Alexey Samsonove4a88982012-06-15 07:00:31 +0000145// Math
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000146INLINE bool IsPowerOfTwo(uptr x) {
Alexey Samsonovee072902012-06-06 09:26:25 +0000147 return (x & (x - 1)) == 0;
148}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000149INLINE uptr RoundUpTo(uptr size, uptr boundary) {
Alexey Samsonove4a88982012-06-15 07:00:31 +0000150 CHECK(IsPowerOfTwo(boundary));
Alexey Samsonovee072902012-06-06 09:26:25 +0000151 return (size + boundary - 1) & ~(boundary - 1);
152}
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000153// Don't use std::min, std::max or std::swap, to minimize dependency
154// on libstdc++.
Alexey Samsonove4a88982012-06-15 07:00:31 +0000155template<class T> T Min(T a, T b) { return a < b ? a : b; }
156template<class T> T Max(T a, T b) { return a > b ? a : b; }
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000157template<class T> void Swap(T& a, T& b) {
158 T tmp = a;
159 a = b;
160 b = tmp;
161}
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000162
Alexey Samsonov156958d2012-06-15 13:09:52 +0000163// Char handling
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000164INLINE bool IsSpace(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000165 return (c == ' ') || (c == '\n') || (c == '\t') ||
166 (c == '\f') || (c == '\r') || (c == '\v');
167}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000168INLINE bool IsDigit(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000169 return (c >= '0') && (c <= '9');
170}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000171INLINE int ToLower(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000172 return (c >= 'A' && c <= 'Z') ? (c + 'a' - 'A') : c;
173}
174
Kostya Serebryanyc0bbfbf2012-06-06 16:33:46 +0000175#if __WORDSIZE == 64
176# define FIRST_32_SECOND_64(a, b) (b)
177#else
178# define FIRST_32_SECOND_64(a, b) (a)
179#endif
180
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000181} // namespace __sanitizer
182
183#endif // SANITIZER_COMMON_H