xref: /aosp_15_r20/external/compiler-rt/lib/asan/asan_poisoning.cc (revision 7c3d14c8b49c529e04be81a3ce6f5cc23712e4c6)
1*7c3d14c8STreehugger Robot //===-- asan_poisoning.cc -------------------------------------------------===//
2*7c3d14c8STreehugger Robot //
3*7c3d14c8STreehugger Robot //                     The LLVM Compiler Infrastructure
4*7c3d14c8STreehugger Robot //
5*7c3d14c8STreehugger Robot // This file is distributed under the University of Illinois Open Source
6*7c3d14c8STreehugger Robot // License. See LICENSE.TXT for details.
7*7c3d14c8STreehugger Robot //
8*7c3d14c8STreehugger Robot //===----------------------------------------------------------------------===//
9*7c3d14c8STreehugger Robot //
10*7c3d14c8STreehugger Robot // This file is a part of AddressSanitizer, an address sanity checker.
11*7c3d14c8STreehugger Robot //
12*7c3d14c8STreehugger Robot // Shadow memory poisoning by ASan RTL and by user application.
13*7c3d14c8STreehugger Robot //===----------------------------------------------------------------------===//
14*7c3d14c8STreehugger Robot 
15*7c3d14c8STreehugger Robot #include "asan_poisoning.h"
16*7c3d14c8STreehugger Robot #include "asan_report.h"
17*7c3d14c8STreehugger Robot #include "asan_stack.h"
18*7c3d14c8STreehugger Robot #include "sanitizer_common/sanitizer_atomic.h"
19*7c3d14c8STreehugger Robot #include "sanitizer_common/sanitizer_libc.h"
20*7c3d14c8STreehugger Robot #include "sanitizer_common/sanitizer_flags.h"
21*7c3d14c8STreehugger Robot 
22*7c3d14c8STreehugger Robot namespace __asan {
23*7c3d14c8STreehugger Robot 
24*7c3d14c8STreehugger Robot static atomic_uint8_t can_poison_memory;
25*7c3d14c8STreehugger Robot 
SetCanPoisonMemory(bool value)26*7c3d14c8STreehugger Robot void SetCanPoisonMemory(bool value) {
27*7c3d14c8STreehugger Robot   atomic_store(&can_poison_memory, value, memory_order_release);
28*7c3d14c8STreehugger Robot }
29*7c3d14c8STreehugger Robot 
CanPoisonMemory()30*7c3d14c8STreehugger Robot bool CanPoisonMemory() {
31*7c3d14c8STreehugger Robot   return atomic_load(&can_poison_memory, memory_order_acquire);
32*7c3d14c8STreehugger Robot }
33*7c3d14c8STreehugger Robot 
PoisonShadow(uptr addr,uptr size,u8 value)34*7c3d14c8STreehugger Robot void PoisonShadow(uptr addr, uptr size, u8 value) {
35*7c3d14c8STreehugger Robot   if (!CanPoisonMemory()) return;
36*7c3d14c8STreehugger Robot   CHECK(AddrIsAlignedByGranularity(addr));
37*7c3d14c8STreehugger Robot   CHECK(AddrIsInMem(addr));
38*7c3d14c8STreehugger Robot   CHECK(AddrIsAlignedByGranularity(addr + size));
39*7c3d14c8STreehugger Robot   CHECK(AddrIsInMem(addr + size - SHADOW_GRANULARITY));
40*7c3d14c8STreehugger Robot   CHECK(REAL(memset));
41*7c3d14c8STreehugger Robot   FastPoisonShadow(addr, size, value);
42*7c3d14c8STreehugger Robot }
43*7c3d14c8STreehugger Robot 
PoisonShadowPartialRightRedzone(uptr addr,uptr size,uptr redzone_size,u8 value)44*7c3d14c8STreehugger Robot void PoisonShadowPartialRightRedzone(uptr addr,
45*7c3d14c8STreehugger Robot                                      uptr size,
46*7c3d14c8STreehugger Robot                                      uptr redzone_size,
47*7c3d14c8STreehugger Robot                                      u8 value) {
48*7c3d14c8STreehugger Robot   if (!CanPoisonMemory()) return;
49*7c3d14c8STreehugger Robot   CHECK(AddrIsAlignedByGranularity(addr));
50*7c3d14c8STreehugger Robot   CHECK(AddrIsInMem(addr));
51*7c3d14c8STreehugger Robot   FastPoisonShadowPartialRightRedzone(addr, size, redzone_size, value);
52*7c3d14c8STreehugger Robot }
53*7c3d14c8STreehugger Robot 
54*7c3d14c8STreehugger Robot struct ShadowSegmentEndpoint {
55*7c3d14c8STreehugger Robot   u8 *chunk;
56*7c3d14c8STreehugger Robot   s8 offset;  // in [0, SHADOW_GRANULARITY)
57*7c3d14c8STreehugger Robot   s8 value;  // = *chunk;
58*7c3d14c8STreehugger Robot 
ShadowSegmentEndpoint__asan::ShadowSegmentEndpoint59*7c3d14c8STreehugger Robot   explicit ShadowSegmentEndpoint(uptr address) {
60*7c3d14c8STreehugger Robot     chunk = (u8*)MemToShadow(address);
61*7c3d14c8STreehugger Robot     offset = address & (SHADOW_GRANULARITY - 1);
62*7c3d14c8STreehugger Robot     value = *chunk;
63*7c3d14c8STreehugger Robot   }
64*7c3d14c8STreehugger Robot };
65*7c3d14c8STreehugger Robot 
FlushUnneededASanShadowMemory(uptr p,uptr size)66*7c3d14c8STreehugger Robot void FlushUnneededASanShadowMemory(uptr p, uptr size) {
67*7c3d14c8STreehugger Robot     // Since asan's mapping is compacting, the shadow chunk may be
68*7c3d14c8STreehugger Robot     // not page-aligned, so we only flush the page-aligned portion.
69*7c3d14c8STreehugger Robot     uptr page_size = GetPageSizeCached();
70*7c3d14c8STreehugger Robot     uptr shadow_beg = RoundUpTo(MemToShadow(p), page_size);
71*7c3d14c8STreehugger Robot     uptr shadow_end = RoundDownTo(MemToShadow(p + size), page_size);
72*7c3d14c8STreehugger Robot     FlushUnneededShadowMemory(shadow_beg, shadow_end - shadow_beg);
73*7c3d14c8STreehugger Robot }
74*7c3d14c8STreehugger Robot 
AsanPoisonOrUnpoisonIntraObjectRedzone(uptr ptr,uptr size,bool poison)75*7c3d14c8STreehugger Robot void AsanPoisonOrUnpoisonIntraObjectRedzone(uptr ptr, uptr size, bool poison) {
76*7c3d14c8STreehugger Robot   uptr end = ptr + size;
77*7c3d14c8STreehugger Robot   if (Verbosity()) {
78*7c3d14c8STreehugger Robot     Printf("__asan_%spoison_intra_object_redzone [%p,%p) %zd\n",
79*7c3d14c8STreehugger Robot            poison ? "" : "un", ptr, end, size);
80*7c3d14c8STreehugger Robot     if (Verbosity() >= 2)
81*7c3d14c8STreehugger Robot       PRINT_CURRENT_STACK();
82*7c3d14c8STreehugger Robot   }
83*7c3d14c8STreehugger Robot   CHECK(size);
84*7c3d14c8STreehugger Robot   CHECK_LE(size, 4096);
85*7c3d14c8STreehugger Robot   CHECK(IsAligned(end, SHADOW_GRANULARITY));
86*7c3d14c8STreehugger Robot   if (!IsAligned(ptr, SHADOW_GRANULARITY)) {
87*7c3d14c8STreehugger Robot     *(u8 *)MemToShadow(ptr) =
88*7c3d14c8STreehugger Robot         poison ? static_cast<u8>(ptr % SHADOW_GRANULARITY) : 0;
89*7c3d14c8STreehugger Robot     ptr |= SHADOW_GRANULARITY - 1;
90*7c3d14c8STreehugger Robot     ptr++;
91*7c3d14c8STreehugger Robot   }
92*7c3d14c8STreehugger Robot   for (; ptr < end; ptr += SHADOW_GRANULARITY)
93*7c3d14c8STreehugger Robot     *(u8*)MemToShadow(ptr) = poison ? kAsanIntraObjectRedzone : 0;
94*7c3d14c8STreehugger Robot }
95*7c3d14c8STreehugger Robot 
96*7c3d14c8STreehugger Robot }  // namespace __asan
97*7c3d14c8STreehugger Robot 
98*7c3d14c8STreehugger Robot // ---------------------- Interface ---------------- {{{1
99*7c3d14c8STreehugger Robot using namespace __asan;  // NOLINT
100*7c3d14c8STreehugger Robot 
101*7c3d14c8STreehugger Robot // Current implementation of __asan_(un)poison_memory_region doesn't check
102*7c3d14c8STreehugger Robot // that user program (un)poisons the memory it owns. It poisons memory
103*7c3d14c8STreehugger Robot // conservatively, and unpoisons progressively to make sure asan shadow
104*7c3d14c8STreehugger Robot // mapping invariant is preserved (see detailed mapping description here:
105*7c3d14c8STreehugger Robot // https://github.com/google/sanitizers/wiki/AddressSanitizerAlgorithm).
106*7c3d14c8STreehugger Robot //
107*7c3d14c8STreehugger Robot // * if user asks to poison region [left, right), the program poisons
108*7c3d14c8STreehugger Robot // at least [left, AlignDown(right)).
109*7c3d14c8STreehugger Robot // * if user asks to unpoison region [left, right), the program unpoisons
110*7c3d14c8STreehugger Robot // at most [AlignDown(left), right).
__asan_poison_memory_region(void const volatile * addr,uptr size)111*7c3d14c8STreehugger Robot void __asan_poison_memory_region(void const volatile *addr, uptr size) {
112*7c3d14c8STreehugger Robot   if (!flags()->allow_user_poisoning || size == 0) return;
113*7c3d14c8STreehugger Robot   uptr beg_addr = (uptr)addr;
114*7c3d14c8STreehugger Robot   uptr end_addr = beg_addr + size;
115*7c3d14c8STreehugger Robot   VPrintf(3, "Trying to poison memory region [%p, %p)\n", (void *)beg_addr,
116*7c3d14c8STreehugger Robot           (void *)end_addr);
117*7c3d14c8STreehugger Robot   ShadowSegmentEndpoint beg(beg_addr);
118*7c3d14c8STreehugger Robot   ShadowSegmentEndpoint end(end_addr);
119*7c3d14c8STreehugger Robot   if (beg.chunk == end.chunk) {
120*7c3d14c8STreehugger Robot     CHECK(beg.offset < end.offset);
121*7c3d14c8STreehugger Robot     s8 value = beg.value;
122*7c3d14c8STreehugger Robot     CHECK(value == end.value);
123*7c3d14c8STreehugger Robot     // We can only poison memory if the byte in end.offset is unaddressable.
124*7c3d14c8STreehugger Robot     // No need to re-poison memory if it is poisoned already.
125*7c3d14c8STreehugger Robot     if (value > 0 && value <= end.offset) {
126*7c3d14c8STreehugger Robot       if (beg.offset > 0) {
127*7c3d14c8STreehugger Robot         *beg.chunk = Min(value, beg.offset);
128*7c3d14c8STreehugger Robot       } else {
129*7c3d14c8STreehugger Robot         *beg.chunk = kAsanUserPoisonedMemoryMagic;
130*7c3d14c8STreehugger Robot       }
131*7c3d14c8STreehugger Robot     }
132*7c3d14c8STreehugger Robot     return;
133*7c3d14c8STreehugger Robot   }
134*7c3d14c8STreehugger Robot   CHECK(beg.chunk < end.chunk);
135*7c3d14c8STreehugger Robot   if (beg.offset > 0) {
136*7c3d14c8STreehugger Robot     // Mark bytes from beg.offset as unaddressable.
137*7c3d14c8STreehugger Robot     if (beg.value == 0) {
138*7c3d14c8STreehugger Robot       *beg.chunk = beg.offset;
139*7c3d14c8STreehugger Robot     } else {
140*7c3d14c8STreehugger Robot       *beg.chunk = Min(beg.value, beg.offset);
141*7c3d14c8STreehugger Robot     }
142*7c3d14c8STreehugger Robot     beg.chunk++;
143*7c3d14c8STreehugger Robot   }
144*7c3d14c8STreehugger Robot   REAL(memset)(beg.chunk, kAsanUserPoisonedMemoryMagic, end.chunk - beg.chunk);
145*7c3d14c8STreehugger Robot   // Poison if byte in end.offset is unaddressable.
146*7c3d14c8STreehugger Robot   if (end.value > 0 && end.value <= end.offset) {
147*7c3d14c8STreehugger Robot     *end.chunk = kAsanUserPoisonedMemoryMagic;
148*7c3d14c8STreehugger Robot   }
149*7c3d14c8STreehugger Robot }
150*7c3d14c8STreehugger Robot 
__asan_unpoison_memory_region(void const volatile * addr,uptr size)151*7c3d14c8STreehugger Robot void __asan_unpoison_memory_region(void const volatile *addr, uptr size) {
152*7c3d14c8STreehugger Robot   if (!flags()->allow_user_poisoning || size == 0) return;
153*7c3d14c8STreehugger Robot   uptr beg_addr = (uptr)addr;
154*7c3d14c8STreehugger Robot   uptr end_addr = beg_addr + size;
155*7c3d14c8STreehugger Robot   VPrintf(3, "Trying to unpoison memory region [%p, %p)\n", (void *)beg_addr,
156*7c3d14c8STreehugger Robot           (void *)end_addr);
157*7c3d14c8STreehugger Robot   ShadowSegmentEndpoint beg(beg_addr);
158*7c3d14c8STreehugger Robot   ShadowSegmentEndpoint end(end_addr);
159*7c3d14c8STreehugger Robot   if (beg.chunk == end.chunk) {
160*7c3d14c8STreehugger Robot     CHECK(beg.offset < end.offset);
161*7c3d14c8STreehugger Robot     s8 value = beg.value;
162*7c3d14c8STreehugger Robot     CHECK(value == end.value);
163*7c3d14c8STreehugger Robot     // We unpoison memory bytes up to enbytes up to end.offset if it is not
164*7c3d14c8STreehugger Robot     // unpoisoned already.
165*7c3d14c8STreehugger Robot     if (value != 0) {
166*7c3d14c8STreehugger Robot       *beg.chunk = Max(value, end.offset);
167*7c3d14c8STreehugger Robot     }
168*7c3d14c8STreehugger Robot     return;
169*7c3d14c8STreehugger Robot   }
170*7c3d14c8STreehugger Robot   CHECK(beg.chunk < end.chunk);
171*7c3d14c8STreehugger Robot   if (beg.offset > 0) {
172*7c3d14c8STreehugger Robot     *beg.chunk = 0;
173*7c3d14c8STreehugger Robot     beg.chunk++;
174*7c3d14c8STreehugger Robot   }
175*7c3d14c8STreehugger Robot   REAL(memset)(beg.chunk, 0, end.chunk - beg.chunk);
176*7c3d14c8STreehugger Robot   if (end.offset > 0 && end.value != 0) {
177*7c3d14c8STreehugger Robot     *end.chunk = Max(end.value, end.offset);
178*7c3d14c8STreehugger Robot   }
179*7c3d14c8STreehugger Robot }
180*7c3d14c8STreehugger Robot 
__asan_address_is_poisoned(void const volatile * addr)181*7c3d14c8STreehugger Robot int __asan_address_is_poisoned(void const volatile *addr) {
182*7c3d14c8STreehugger Robot   return __asan::AddressIsPoisoned((uptr)addr);
183*7c3d14c8STreehugger Robot }
184*7c3d14c8STreehugger Robot 
__asan_region_is_poisoned(uptr beg,uptr size)185*7c3d14c8STreehugger Robot uptr __asan_region_is_poisoned(uptr beg, uptr size) {
186*7c3d14c8STreehugger Robot   if (!size) return 0;
187*7c3d14c8STreehugger Robot   uptr end = beg + size;
188*7c3d14c8STreehugger Robot   if (!AddrIsInMem(beg)) return beg;
189*7c3d14c8STreehugger Robot   if (!AddrIsInMem(end)) return end;
190*7c3d14c8STreehugger Robot   CHECK_LT(beg, end);
191*7c3d14c8STreehugger Robot   uptr aligned_b = RoundUpTo(beg, SHADOW_GRANULARITY);
192*7c3d14c8STreehugger Robot   uptr aligned_e = RoundDownTo(end, SHADOW_GRANULARITY);
193*7c3d14c8STreehugger Robot   uptr shadow_beg = MemToShadow(aligned_b);
194*7c3d14c8STreehugger Robot   uptr shadow_end = MemToShadow(aligned_e);
195*7c3d14c8STreehugger Robot   // First check the first and the last application bytes,
196*7c3d14c8STreehugger Robot   // then check the SHADOW_GRANULARITY-aligned region by calling
197*7c3d14c8STreehugger Robot   // mem_is_zero on the corresponding shadow.
198*7c3d14c8STreehugger Robot   if (!__asan::AddressIsPoisoned(beg) &&
199*7c3d14c8STreehugger Robot       !__asan::AddressIsPoisoned(end - 1) &&
200*7c3d14c8STreehugger Robot       (shadow_end <= shadow_beg ||
201*7c3d14c8STreehugger Robot        __sanitizer::mem_is_zero((const char *)shadow_beg,
202*7c3d14c8STreehugger Robot                                 shadow_end - shadow_beg)))
203*7c3d14c8STreehugger Robot     return 0;
204*7c3d14c8STreehugger Robot   // The fast check failed, so we have a poisoned byte somewhere.
205*7c3d14c8STreehugger Robot   // Find it slowly.
206*7c3d14c8STreehugger Robot   for (; beg < end; beg++)
207*7c3d14c8STreehugger Robot     if (__asan::AddressIsPoisoned(beg))
208*7c3d14c8STreehugger Robot       return beg;
209*7c3d14c8STreehugger Robot   UNREACHABLE("mem_is_zero returned false, but poisoned byte was not found");
210*7c3d14c8STreehugger Robot   return 0;
211*7c3d14c8STreehugger Robot }
212*7c3d14c8STreehugger Robot 
213*7c3d14c8STreehugger Robot #define CHECK_SMALL_REGION(p, size, isWrite)                  \
214*7c3d14c8STreehugger Robot   do {                                                        \
215*7c3d14c8STreehugger Robot     uptr __p = reinterpret_cast<uptr>(p);                     \
216*7c3d14c8STreehugger Robot     uptr __size = size;                                       \
217*7c3d14c8STreehugger Robot     if (UNLIKELY(__asan::AddressIsPoisoned(__p) ||            \
218*7c3d14c8STreehugger Robot         __asan::AddressIsPoisoned(__p + __size - 1))) {       \
219*7c3d14c8STreehugger Robot       GET_CURRENT_PC_BP_SP;                                   \
220*7c3d14c8STreehugger Robot       uptr __bad = __asan_region_is_poisoned(__p, __size);    \
221*7c3d14c8STreehugger Robot       __asan_report_error(pc, bp, sp, __bad, isWrite, __size, 0);\
222*7c3d14c8STreehugger Robot     }                                                         \
223*7c3d14c8STreehugger Robot   } while (false);                                            \
224*7c3d14c8STreehugger Robot 
225*7c3d14c8STreehugger Robot 
226*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_load16(const uu16 * p)227*7c3d14c8STreehugger Robot u16 __sanitizer_unaligned_load16(const uu16 *p) {
228*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), false);
229*7c3d14c8STreehugger Robot   return *p;
230*7c3d14c8STreehugger Robot }
231*7c3d14c8STreehugger Robot 
232*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_load32(const uu32 * p)233*7c3d14c8STreehugger Robot u32 __sanitizer_unaligned_load32(const uu32 *p) {
234*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), false);
235*7c3d14c8STreehugger Robot   return *p;
236*7c3d14c8STreehugger Robot }
237*7c3d14c8STreehugger Robot 
238*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_load64(const uu64 * p)239*7c3d14c8STreehugger Robot u64 __sanitizer_unaligned_load64(const uu64 *p) {
240*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), false);
241*7c3d14c8STreehugger Robot   return *p;
242*7c3d14c8STreehugger Robot }
243*7c3d14c8STreehugger Robot 
244*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_store16(uu16 * p,u16 x)245*7c3d14c8STreehugger Robot void __sanitizer_unaligned_store16(uu16 *p, u16 x) {
246*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), true);
247*7c3d14c8STreehugger Robot   *p = x;
248*7c3d14c8STreehugger Robot }
249*7c3d14c8STreehugger Robot 
250*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_store32(uu32 * p,u32 x)251*7c3d14c8STreehugger Robot void __sanitizer_unaligned_store32(uu32 *p, u32 x) {
252*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), true);
253*7c3d14c8STreehugger Robot   *p = x;
254*7c3d14c8STreehugger Robot }
255*7c3d14c8STreehugger Robot 
256*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__sanitizer_unaligned_store64(uu64 * p,u64 x)257*7c3d14c8STreehugger Robot void __sanitizer_unaligned_store64(uu64 *p, u64 x) {
258*7c3d14c8STreehugger Robot   CHECK_SMALL_REGION(p, sizeof(*p), true);
259*7c3d14c8STreehugger Robot   *p = x;
260*7c3d14c8STreehugger Robot }
261*7c3d14c8STreehugger Robot 
262*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__asan_poison_cxx_array_cookie(uptr p)263*7c3d14c8STreehugger Robot void __asan_poison_cxx_array_cookie(uptr p) {
264*7c3d14c8STreehugger Robot   if (SANITIZER_WORDSIZE != 64) return;
265*7c3d14c8STreehugger Robot   if (!flags()->poison_array_cookie) return;
266*7c3d14c8STreehugger Robot   uptr s = MEM_TO_SHADOW(p);
267*7c3d14c8STreehugger Robot   *reinterpret_cast<u8*>(s) = kAsanArrayCookieMagic;
268*7c3d14c8STreehugger Robot }
269*7c3d14c8STreehugger Robot 
270*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__asan_load_cxx_array_cookie(uptr * p)271*7c3d14c8STreehugger Robot uptr __asan_load_cxx_array_cookie(uptr *p) {
272*7c3d14c8STreehugger Robot   if (SANITIZER_WORDSIZE != 64) return *p;
273*7c3d14c8STreehugger Robot   if (!flags()->poison_array_cookie) return *p;
274*7c3d14c8STreehugger Robot   uptr s = MEM_TO_SHADOW(reinterpret_cast<uptr>(p));
275*7c3d14c8STreehugger Robot   u8 sval = *reinterpret_cast<u8*>(s);
276*7c3d14c8STreehugger Robot   if (sval == kAsanArrayCookieMagic) return *p;
277*7c3d14c8STreehugger Robot   // If sval is not kAsanArrayCookieMagic it can only be freed memory,
278*7c3d14c8STreehugger Robot   // which means that we are going to get double-free. So, return 0 to avoid
279*7c3d14c8STreehugger Robot   // infinite loop of destructors. We don't want to report a double-free here
280*7c3d14c8STreehugger Robot   // though, so print a warning just in case.
281*7c3d14c8STreehugger Robot   // CHECK_EQ(sval, kAsanHeapFreeMagic);
282*7c3d14c8STreehugger Robot   if (sval == kAsanHeapFreeMagic) {
283*7c3d14c8STreehugger Robot     Report("AddressSanitizer: loaded array cookie from free-d memory; "
284*7c3d14c8STreehugger Robot            "expect a double-free report\n");
285*7c3d14c8STreehugger Robot     return 0;
286*7c3d14c8STreehugger Robot   }
287*7c3d14c8STreehugger Robot   // The cookie may remain unpoisoned if e.g. it comes from a custom
288*7c3d14c8STreehugger Robot   // operator new defined inside a class.
289*7c3d14c8STreehugger Robot   return *p;
290*7c3d14c8STreehugger Robot }
291*7c3d14c8STreehugger Robot 
292*7c3d14c8STreehugger Robot // This is a simplified version of __asan_(un)poison_memory_region, which
293*7c3d14c8STreehugger Robot // assumes that left border of region to be poisoned is properly aligned.
PoisonAlignedStackMemory(uptr addr,uptr size,bool do_poison)294*7c3d14c8STreehugger Robot static void PoisonAlignedStackMemory(uptr addr, uptr size, bool do_poison) {
295*7c3d14c8STreehugger Robot   if (size == 0) return;
296*7c3d14c8STreehugger Robot   uptr aligned_size = size & ~(SHADOW_GRANULARITY - 1);
297*7c3d14c8STreehugger Robot   PoisonShadow(addr, aligned_size,
298*7c3d14c8STreehugger Robot                do_poison ? kAsanStackUseAfterScopeMagic : 0);
299*7c3d14c8STreehugger Robot   if (size == aligned_size)
300*7c3d14c8STreehugger Robot     return;
301*7c3d14c8STreehugger Robot   s8 end_offset = (s8)(size - aligned_size);
302*7c3d14c8STreehugger Robot   s8* shadow_end = (s8*)MemToShadow(addr + aligned_size);
303*7c3d14c8STreehugger Robot   s8 end_value = *shadow_end;
304*7c3d14c8STreehugger Robot   if (do_poison) {
305*7c3d14c8STreehugger Robot     // If possible, mark all the bytes mapping to last shadow byte as
306*7c3d14c8STreehugger Robot     // unaddressable.
307*7c3d14c8STreehugger Robot     if (end_value > 0 && end_value <= end_offset)
308*7c3d14c8STreehugger Robot       *shadow_end = (s8)kAsanStackUseAfterScopeMagic;
309*7c3d14c8STreehugger Robot   } else {
310*7c3d14c8STreehugger Robot     // If necessary, mark few first bytes mapping to last shadow byte
311*7c3d14c8STreehugger Robot     // as addressable
312*7c3d14c8STreehugger Robot     if (end_value != 0)
313*7c3d14c8STreehugger Robot       *shadow_end = Max(end_value, end_offset);
314*7c3d14c8STreehugger Robot   }
315*7c3d14c8STreehugger Robot }
316*7c3d14c8STreehugger Robot 
__asan_poison_stack_memory(uptr addr,uptr size)317*7c3d14c8STreehugger Robot void __asan_poison_stack_memory(uptr addr, uptr size) {
318*7c3d14c8STreehugger Robot   VReport(1, "poisoning: %p %zx\n", (void *)addr, size);
319*7c3d14c8STreehugger Robot   PoisonAlignedStackMemory(addr, size, true);
320*7c3d14c8STreehugger Robot }
321*7c3d14c8STreehugger Robot 
__asan_unpoison_stack_memory(uptr addr,uptr size)322*7c3d14c8STreehugger Robot void __asan_unpoison_stack_memory(uptr addr, uptr size) {
323*7c3d14c8STreehugger Robot   VReport(1, "unpoisoning: %p %zx\n", (void *)addr, size);
324*7c3d14c8STreehugger Robot   PoisonAlignedStackMemory(addr, size, false);
325*7c3d14c8STreehugger Robot }
326*7c3d14c8STreehugger Robot 
__sanitizer_annotate_contiguous_container(const void * beg_p,const void * end_p,const void * old_mid_p,const void * new_mid_p)327*7c3d14c8STreehugger Robot void __sanitizer_annotate_contiguous_container(const void *beg_p,
328*7c3d14c8STreehugger Robot                                                const void *end_p,
329*7c3d14c8STreehugger Robot                                                const void *old_mid_p,
330*7c3d14c8STreehugger Robot                                                const void *new_mid_p) {
331*7c3d14c8STreehugger Robot   if (!flags()->detect_container_overflow) return;
332*7c3d14c8STreehugger Robot   VPrintf(2, "contiguous_container: %p %p %p %p\n", beg_p, end_p, old_mid_p,
333*7c3d14c8STreehugger Robot           new_mid_p);
334*7c3d14c8STreehugger Robot   uptr beg = reinterpret_cast<uptr>(beg_p);
335*7c3d14c8STreehugger Robot   uptr end = reinterpret_cast<uptr>(end_p);
336*7c3d14c8STreehugger Robot   uptr old_mid = reinterpret_cast<uptr>(old_mid_p);
337*7c3d14c8STreehugger Robot   uptr new_mid = reinterpret_cast<uptr>(new_mid_p);
338*7c3d14c8STreehugger Robot   uptr granularity = SHADOW_GRANULARITY;
339*7c3d14c8STreehugger Robot   if (!(beg <= old_mid && beg <= new_mid && old_mid <= end && new_mid <= end &&
340*7c3d14c8STreehugger Robot         IsAligned(beg, granularity))) {
341*7c3d14c8STreehugger Robot     GET_STACK_TRACE_FATAL_HERE;
342*7c3d14c8STreehugger Robot     ReportBadParamsToAnnotateContiguousContainer(beg, end, old_mid, new_mid,
343*7c3d14c8STreehugger Robot                                                  &stack);
344*7c3d14c8STreehugger Robot   }
345*7c3d14c8STreehugger Robot   CHECK_LE(end - beg,
346*7c3d14c8STreehugger Robot            FIRST_32_SECOND_64(1UL << 30, 1ULL << 34)); // Sanity check.
347*7c3d14c8STreehugger Robot 
348*7c3d14c8STreehugger Robot   uptr a = RoundDownTo(Min(old_mid, new_mid), granularity);
349*7c3d14c8STreehugger Robot   uptr c = RoundUpTo(Max(old_mid, new_mid), granularity);
350*7c3d14c8STreehugger Robot   uptr d1 = RoundDownTo(old_mid, granularity);
351*7c3d14c8STreehugger Robot   // uptr d2 = RoundUpTo(old_mid, granularity);
352*7c3d14c8STreehugger Robot   // Currently we should be in this state:
353*7c3d14c8STreehugger Robot   // [a, d1) is good, [d2, c) is bad, [d1, d2) is partially good.
354*7c3d14c8STreehugger Robot   // Make a quick sanity check that we are indeed in this state.
355*7c3d14c8STreehugger Robot   //
356*7c3d14c8STreehugger Robot   // FIXME: Two of these three checks are disabled until we fix
357*7c3d14c8STreehugger Robot   // https://github.com/google/sanitizers/issues/258.
358*7c3d14c8STreehugger Robot   // if (d1 != d2)
359*7c3d14c8STreehugger Robot   //  CHECK_EQ(*(u8*)MemToShadow(d1), old_mid - d1);
360*7c3d14c8STreehugger Robot   if (a + granularity <= d1)
361*7c3d14c8STreehugger Robot     CHECK_EQ(*(u8*)MemToShadow(a), 0);
362*7c3d14c8STreehugger Robot   // if (d2 + granularity <= c && c <= end)
363*7c3d14c8STreehugger Robot   //   CHECK_EQ(*(u8 *)MemToShadow(c - granularity),
364*7c3d14c8STreehugger Robot   //            kAsanContiguousContainerOOBMagic);
365*7c3d14c8STreehugger Robot 
366*7c3d14c8STreehugger Robot   uptr b1 = RoundDownTo(new_mid, granularity);
367*7c3d14c8STreehugger Robot   uptr b2 = RoundUpTo(new_mid, granularity);
368*7c3d14c8STreehugger Robot   // New state:
369*7c3d14c8STreehugger Robot   // [a, b1) is good, [b2, c) is bad, [b1, b2) is partially good.
370*7c3d14c8STreehugger Robot   PoisonShadow(a, b1 - a, 0);
371*7c3d14c8STreehugger Robot   PoisonShadow(b2, c - b2, kAsanContiguousContainerOOBMagic);
372*7c3d14c8STreehugger Robot   if (b1 != b2) {
373*7c3d14c8STreehugger Robot     CHECK_EQ(b2 - b1, granularity);
374*7c3d14c8STreehugger Robot     *(u8*)MemToShadow(b1) = static_cast<u8>(new_mid - b1);
375*7c3d14c8STreehugger Robot   }
376*7c3d14c8STreehugger Robot }
377*7c3d14c8STreehugger Robot 
__sanitizer_contiguous_container_find_bad_address(const void * beg_p,const void * mid_p,const void * end_p)378*7c3d14c8STreehugger Robot const void *__sanitizer_contiguous_container_find_bad_address(
379*7c3d14c8STreehugger Robot     const void *beg_p, const void *mid_p, const void *end_p) {
380*7c3d14c8STreehugger Robot   if (!flags()->detect_container_overflow)
381*7c3d14c8STreehugger Robot     return nullptr;
382*7c3d14c8STreehugger Robot   uptr beg = reinterpret_cast<uptr>(beg_p);
383*7c3d14c8STreehugger Robot   uptr end = reinterpret_cast<uptr>(end_p);
384*7c3d14c8STreehugger Robot   uptr mid = reinterpret_cast<uptr>(mid_p);
385*7c3d14c8STreehugger Robot   CHECK_LE(beg, mid);
386*7c3d14c8STreehugger Robot   CHECK_LE(mid, end);
387*7c3d14c8STreehugger Robot   // Check some bytes starting from beg, some bytes around mid, and some bytes
388*7c3d14c8STreehugger Robot   // ending with end.
389*7c3d14c8STreehugger Robot   uptr kMaxRangeToCheck = 32;
390*7c3d14c8STreehugger Robot   uptr r1_beg = beg;
391*7c3d14c8STreehugger Robot   uptr r1_end = Min(end + kMaxRangeToCheck, mid);
392*7c3d14c8STreehugger Robot   uptr r2_beg = Max(beg, mid - kMaxRangeToCheck);
393*7c3d14c8STreehugger Robot   uptr r2_end = Min(end, mid + kMaxRangeToCheck);
394*7c3d14c8STreehugger Robot   uptr r3_beg = Max(end - kMaxRangeToCheck, mid);
395*7c3d14c8STreehugger Robot   uptr r3_end = end;
396*7c3d14c8STreehugger Robot   for (uptr i = r1_beg; i < r1_end; i++)
397*7c3d14c8STreehugger Robot     if (AddressIsPoisoned(i))
398*7c3d14c8STreehugger Robot       return reinterpret_cast<const void *>(i);
399*7c3d14c8STreehugger Robot   for (uptr i = r2_beg; i < mid; i++)
400*7c3d14c8STreehugger Robot     if (AddressIsPoisoned(i))
401*7c3d14c8STreehugger Robot       return reinterpret_cast<const void *>(i);
402*7c3d14c8STreehugger Robot   for (uptr i = mid; i < r2_end; i++)
403*7c3d14c8STreehugger Robot     if (!AddressIsPoisoned(i))
404*7c3d14c8STreehugger Robot       return reinterpret_cast<const void *>(i);
405*7c3d14c8STreehugger Robot   for (uptr i = r3_beg; i < r3_end; i++)
406*7c3d14c8STreehugger Robot     if (!AddressIsPoisoned(i))
407*7c3d14c8STreehugger Robot       return reinterpret_cast<const void *>(i);
408*7c3d14c8STreehugger Robot   return nullptr;
409*7c3d14c8STreehugger Robot }
410*7c3d14c8STreehugger Robot 
__sanitizer_verify_contiguous_container(const void * beg_p,const void * mid_p,const void * end_p)411*7c3d14c8STreehugger Robot int __sanitizer_verify_contiguous_container(const void *beg_p,
412*7c3d14c8STreehugger Robot                                             const void *mid_p,
413*7c3d14c8STreehugger Robot                                             const void *end_p) {
414*7c3d14c8STreehugger Robot   return __sanitizer_contiguous_container_find_bad_address(beg_p, mid_p,
415*7c3d14c8STreehugger Robot                                                            end_p) == nullptr;
416*7c3d14c8STreehugger Robot }
417*7c3d14c8STreehugger Robot 
418*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__asan_poison_intra_object_redzone(uptr ptr,uptr size)419*7c3d14c8STreehugger Robot void __asan_poison_intra_object_redzone(uptr ptr, uptr size) {
420*7c3d14c8STreehugger Robot   AsanPoisonOrUnpoisonIntraObjectRedzone(ptr, size, true);
421*7c3d14c8STreehugger Robot }
422*7c3d14c8STreehugger Robot 
423*7c3d14c8STreehugger Robot extern "C" SANITIZER_INTERFACE_ATTRIBUTE
__asan_unpoison_intra_object_redzone(uptr ptr,uptr size)424*7c3d14c8STreehugger Robot void __asan_unpoison_intra_object_redzone(uptr ptr, uptr size) {
425*7c3d14c8STreehugger Robot   AsanPoisonOrUnpoisonIntraObjectRedzone(ptr, size, false);
426*7c3d14c8STreehugger Robot }
427*7c3d14c8STreehugger Robot 
428*7c3d14c8STreehugger Robot // --- Implementation of LSan-specific functions --- {{{1
429*7c3d14c8STreehugger Robot namespace __lsan {
WordIsPoisoned(uptr addr)430*7c3d14c8STreehugger Robot bool WordIsPoisoned(uptr addr) {
431*7c3d14c8STreehugger Robot   return (__asan_region_is_poisoned(addr, sizeof(uptr)) != 0);
432*7c3d14c8STreehugger Robot }
433*7c3d14c8STreehugger Robot }
434*7c3d14c8STreehugger Robot 
435