blob: 0e9371fa23e6af86fd023b66a92c965ccd344a54 [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();
Alexey Samsonov70afb912012-06-15 06:37:34 +000037uptr GetThreadSelf();
Alexey Samsonovcf4d3a02012-06-07 07:32:00 +000038void GetThreadStackTopAndBottom(bool at_initialization, uptr *stack_top,
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000039 uptr *stack_bottom);
Alexey Samsonov40d5b772012-06-06 16:15:07 +000040
41// Memory management
42void *MmapOrDie(uptr size, const char *mem_type);
Alexey Samsonovee072902012-06-06 09:26:25 +000043void UnmapOrDie(void *addr, uptr size);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000044void *MmapFixedNoReserve(uptr fixed_addr, uptr size);
45void *Mprotect(uptr fixed_addr, uptr size);
Alexey Samsonov40e51282012-06-15 07:29:14 +000046// Used to check if we can map shadow memory to a fixed location.
47bool MemoryRangeIsAvailable(uptr range_start, uptr range_end);
Alexey Samsonovc70d1082012-06-14 14:42:58 +000048
49// Internal allocator
Alexey Samsonov3a6ddb82012-06-07 08:52:56 +000050void *InternalAlloc(uptr size);
Dmitry Vyukovc598de92012-06-25 15:09:24 +000051void InternalFree(void *p);
52// Given the pointer p into a valid allocated block,
53// returns a pointer to the beginning of the block.
54void *InternalAllocBlock(void *p);
Alexey Samsonovee072902012-06-06 09:26:25 +000055
Alexey Samsonove6704ee2012-08-21 08:13:37 +000056// InternalScopedBuffer can be used instead of large stack arrays to
57// keep frame size low.
58template<typename T>
59class InternalScopedBuffer {
60 public:
61 explicit InternalScopedBuffer(uptr cnt) {
62 cnt_ = cnt;
63 ptr_ = (T*)InternalAlloc(cnt * sizeof(T));
64 }
65 ~InternalScopedBuffer() {
66 InternalFree(ptr_);
67 }
Alexey Samsonov75e5fc32012-08-22 07:25:52 +000068 operator T*() { return ptr_; }
Alexey Samsonove6704ee2012-08-21 08:13:37 +000069 T &operator[](uptr i) { return ptr_[i]; }
70 T *data() { return ptr_; }
71 uptr size() { return cnt_ * sizeof(T); }
72
73 private:
74 T *ptr_;
75 uptr cnt_;
76 // Disallow evil constructors.
77 InternalScopedBuffer(const InternalScopedBuffer&);
78 void operator=(const InternalScopedBuffer&);
79};
80
Alexey Samsonovc70d1082012-06-14 14:42:58 +000081// IO
Alexey Samsonov4b1f1032012-06-07 07:13:46 +000082void RawWrite(const char *buffer);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +000083void Printf(const char *format, ...);
Alexey Samsonovd323f4e2012-06-06 13:58:39 +000084void Report(const char *format, ...);
Alexey Samsonov51ae9832012-06-06 13:11:29 +000085
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +000086// Opens the file 'file_name" and reads up to 'max_len' bytes.
87// The resulting buffer is mmaped and stored in '*buff'.
88// The size of the mmaped region is stored in '*buff_size',
89// Returns the number of read bytes or 0 if file can not be opened.
90uptr ReadFileToBuffer(const char *file_name, char **buff,
91 uptr *buff_size, uptr max_len);
Alexey Samsonov961276a2012-07-03 08:24:14 +000092// Maps given file to virtual memory, and returns pointer to it
93// (or NULL if the mapping failes). Stores the size of mmaped region
94// in '*buff_size'.
95void *MapFileToMemory(const char *file_name, uptr *buff_size);
96
Alexey Samsonov0c53a382012-06-14 14:07:21 +000097const char *GetEnv(const char *name);
Alexey Samsonov58a3c582012-06-18 08:44:30 +000098const char *GetPwd();
Alexey Samsonovfe44fbd2012-06-07 05:38:26 +000099
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000100// Other
101void DisableCoreDumper();
102void DumpProcessMap();
Alexey Samsonov70afb912012-06-15 06:37:34 +0000103void SleepForSeconds(int seconds);
Alexey Samsonov58a3c582012-06-18 08:44:30 +0000104void SleepForMillis(int millis);
Alexey Samsonov70afb912012-06-15 06:37:34 +0000105void NORETURN Exit(int exitcode);
106void NORETURN Abort();
107int Atexit(void (*function)(void));
Alexey Samsonove4a88982012-06-15 07:00:31 +0000108void SortArray(uptr *array, uptr size);
Alexey Samsonovae1e1712012-06-15 06:08:19 +0000109
Alexey Samsonove4a88982012-06-15 07:00:31 +0000110// Math
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000111INLINE bool IsPowerOfTwo(uptr x) {
Alexey Samsonovee072902012-06-06 09:26:25 +0000112 return (x & (x - 1)) == 0;
113}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000114INLINE uptr RoundUpTo(uptr size, uptr boundary) {
Alexey Samsonove4a88982012-06-15 07:00:31 +0000115 CHECK(IsPowerOfTwo(boundary));
Alexey Samsonovee072902012-06-06 09:26:25 +0000116 return (size + boundary - 1) & ~(boundary - 1);
117}
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000118// Don't use std::min, std::max or std::swap, to minimize dependency
119// on libstdc++.
Alexey Samsonove4a88982012-06-15 07:00:31 +0000120template<class T> T Min(T a, T b) { return a < b ? a : b; }
121template<class T> T Max(T a, T b) { return a > b ? a : b; }
Alexey Samsonovd77fbba2012-07-16 11:27:17 +0000122template<class T> void Swap(T& a, T& b) {
123 T tmp = a;
124 a = b;
125 b = tmp;
126}
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000127
Alexey Samsonov156958d2012-06-15 13:09:52 +0000128// Char handling
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000129INLINE bool IsSpace(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000130 return (c == ' ') || (c == '\n') || (c == '\t') ||
131 (c == '\f') || (c == '\r') || (c == '\v');
132}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000133INLINE bool IsDigit(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000134 return (c >= '0') && (c <= '9');
135}
Dmitry Vyukov03d32ec2012-07-05 16:18:28 +0000136INLINE int ToLower(int c) {
Alexey Samsonov156958d2012-06-15 13:09:52 +0000137 return (c >= 'A' && c <= 'Z') ? (c + 'a' - 'A') : c;
138}
139
Kostya Serebryanyc0bbfbf2012-06-06 16:33:46 +0000140#if __WORDSIZE == 64
141# define FIRST_32_SECOND_64(a, b) (b)
142#else
143# define FIRST_32_SECOND_64(a, b) (a)
144#endif
145
Alexey Samsonovbc3a7e32012-06-06 06:47:26 +0000146} // namespace __sanitizer
147
148#endif // SANITIZER_COMMON_H