1 //=-- lsan_common.cpp -----------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This file is a part of LeakSanitizer. 10 // Implementation of common leak checking functionality. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #include "lsan_common.h" 15 16 #include "sanitizer_common/sanitizer_common.h" 17 #include "sanitizer_common/sanitizer_flag_parser.h" 18 #include "sanitizer_common/sanitizer_flags.h" 19 #include "sanitizer_common/sanitizer_placement_new.h" 20 #include "sanitizer_common/sanitizer_procmaps.h" 21 #include "sanitizer_common/sanitizer_report_decorator.h" 22 #include "sanitizer_common/sanitizer_stackdepot.h" 23 #include "sanitizer_common/sanitizer_stacktrace.h" 24 #include "sanitizer_common/sanitizer_suppressions.h" 25 #include "sanitizer_common/sanitizer_thread_registry.h" 26 #include "sanitizer_common/sanitizer_tls_get_addr.h" 27 28 #if CAN_SANITIZE_LEAKS 29 namespace __lsan { 30 31 // This mutex is used to prevent races between DoLeakCheck and IgnoreObject, and 32 // also to protect the global list of root regions. 33 Mutex global_mutex; 34 35 Flags lsan_flags; 36 37 38 void DisableCounterUnderflow() { 39 if (common_flags()->detect_leaks) { 40 Report("Unmatched call to __lsan_enable().\n"); 41 Die(); 42 } 43 } 44 45 void Flags::SetDefaults() { 46 #define LSAN_FLAG(Type, Name, DefaultValue, Description) Name = DefaultValue; 47 #include "lsan_flags.inc" 48 #undef LSAN_FLAG 49 } 50 51 void RegisterLsanFlags(FlagParser *parser, Flags *f) { 52 #define LSAN_FLAG(Type, Name, DefaultValue, Description) \ 53 RegisterFlag(parser, #Name, Description, &f->Name); 54 #include "lsan_flags.inc" 55 #undef LSAN_FLAG 56 } 57 58 #define LOG_POINTERS(...) \ 59 do { \ 60 if (flags()->log_pointers) Report(__VA_ARGS__); \ 61 } while (0) 62 63 #define LOG_THREADS(...) \ 64 do { \ 65 if (flags()->log_threads) Report(__VA_ARGS__); \ 66 } while (0) 67 68 class LeakSuppressionContext { 69 bool parsed = false; 70 SuppressionContext context; 71 bool suppressed_stacks_sorted = true; 72 InternalMmapVector<u32> suppressed_stacks; 73 74 Suppression *GetSuppressionForAddr(uptr addr); 75 void LazyInit(); 76 77 public: 78 LeakSuppressionContext(const char *supprression_types[], 79 int suppression_types_num) 80 : context(supprression_types, suppression_types_num) {} 81 82 Suppression *GetSuppressionForStack(u32 stack_trace_id, 83 const StackTrace &stack); 84 85 const InternalMmapVector<u32> &GetSortedSuppressedStacks() { 86 if (!suppressed_stacks_sorted) { 87 suppressed_stacks_sorted = true; 88 SortAndDedup(suppressed_stacks); 89 } 90 return suppressed_stacks; 91 } 92 void PrintMatchedSuppressions(); 93 }; 94 95 ALIGNED(64) static char suppression_placeholder[sizeof(LeakSuppressionContext)]; 96 static LeakSuppressionContext *suppression_ctx = nullptr; 97 static const char kSuppressionLeak[] = "leak"; 98 static const char *kSuppressionTypes[] = { kSuppressionLeak }; 99 static const char kStdSuppressions[] = 100 #if SANITIZER_SUPPRESS_LEAK_ON_PTHREAD_EXIT 101 // For more details refer to the SANITIZER_SUPPRESS_LEAK_ON_PTHREAD_EXIT 102 // definition. 103 "leak:*pthread_exit*\n" 104 #endif // SANITIZER_SUPPRESS_LEAK_ON_PTHREAD_EXIT 105 #if SANITIZER_MAC 106 // For Darwin and os_log/os_trace: https://reviews.llvm.org/D35173 107 "leak:*_os_trace*\n" 108 #endif 109 // TLS leak in some glibc versions, described in 110 // https://sourceware.org/bugzilla/show_bug.cgi?id=12650. 111 "leak:*tls_get_addr*\n"; 112 113 void InitializeSuppressions() { 114 CHECK_EQ(nullptr, suppression_ctx); 115 suppression_ctx = new (suppression_placeholder) 116 LeakSuppressionContext(kSuppressionTypes, ARRAY_SIZE(kSuppressionTypes)); 117 } 118 119 void LeakSuppressionContext::LazyInit() { 120 if (!parsed) { 121 parsed = true; 122 context.ParseFromFile(flags()->suppressions); 123 if (&__lsan_default_suppressions) 124 context.Parse(__lsan_default_suppressions()); 125 context.Parse(kStdSuppressions); 126 } 127 } 128 129 static LeakSuppressionContext *GetSuppressionContext() { 130 CHECK(suppression_ctx); 131 return suppression_ctx; 132 } 133 134 static InternalMmapVector<RootRegion> *root_regions; 135 136 InternalMmapVector<RootRegion> const *GetRootRegions() { return root_regions; } 137 138 void InitializeRootRegions() { 139 CHECK(!root_regions); 140 ALIGNED(64) static char placeholder[sizeof(InternalMmapVector<RootRegion>)]; 141 root_regions = new (placeholder) InternalMmapVector<RootRegion>(); 142 } 143 144 void InitCommonLsan() { 145 InitializeRootRegions(); 146 if (common_flags()->detect_leaks) { 147 // Initialization which can fail or print warnings should only be done if 148 // LSan is actually enabled. 149 InitializeSuppressions(); 150 InitializePlatformSpecificModules(); 151 } 152 } 153 154 class Decorator: public __sanitizer::SanitizerCommonDecorator { 155 public: 156 Decorator() : SanitizerCommonDecorator() { } 157 const char *Error() { return Red(); } 158 const char *Leak() { return Blue(); } 159 }; 160 161 static inline bool CanBeAHeapPointer(uptr p) { 162 // Since our heap is located in mmap-ed memory, we can assume a sensible lower 163 // bound on heap addresses. 164 const uptr kMinAddress = 4 * 4096; 165 if (p < kMinAddress) return false; 166 #if defined(__x86_64__) 167 // Accept only canonical form user-space addresses. 168 return ((p >> 47) == 0); 169 #elif defined(__mips64) 170 return ((p >> 40) == 0); 171 #elif defined(__aarch64__) 172 unsigned runtimeVMA = 173 (MostSignificantSetBitIndex(GET_CURRENT_FRAME()) + 1); 174 return ((p >> runtimeVMA) == 0); 175 #else 176 return true; 177 #endif 178 } 179 180 // Scans the memory range, looking for byte patterns that point into allocator 181 // chunks. Marks those chunks with |tag| and adds them to |frontier|. 182 // There are two usage modes for this function: finding reachable chunks 183 // (|tag| = kReachable) and finding indirectly leaked chunks 184 // (|tag| = kIndirectlyLeaked). In the second case, there's no flood fill, 185 // so |frontier| = 0. 186 void ScanRangeForPointers(uptr begin, uptr end, 187 Frontier *frontier, 188 const char *region_type, ChunkTag tag) { 189 CHECK(tag == kReachable || tag == kIndirectlyLeaked); 190 const uptr alignment = flags()->pointer_alignment(); 191 LOG_POINTERS("Scanning %s range %p-%p.\n", region_type, (void *)begin, 192 (void *)end); 193 uptr pp = begin; 194 if (pp % alignment) 195 pp = pp + alignment - pp % alignment; 196 for (; pp + sizeof(void *) <= end; pp += alignment) { 197 void *p = *reinterpret_cast<void **>(pp); 198 if (!CanBeAHeapPointer(reinterpret_cast<uptr>(p))) continue; 199 uptr chunk = PointsIntoChunk(p); 200 if (!chunk) continue; 201 // Pointers to self don't count. This matters when tag == kIndirectlyLeaked. 202 if (chunk == begin) continue; 203 LsanMetadata m(chunk); 204 if (m.tag() == kReachable || m.tag() == kIgnored) continue; 205 206 // Do this check relatively late so we can log only the interesting cases. 207 if (!flags()->use_poisoned && WordIsPoisoned(pp)) { 208 LOG_POINTERS( 209 "%p is poisoned: ignoring %p pointing into chunk %p-%p of size " 210 "%zu.\n", 211 (void *)pp, p, (void *)chunk, (void *)(chunk + m.requested_size()), 212 m.requested_size()); 213 continue; 214 } 215 216 m.set_tag(tag); 217 LOG_POINTERS("%p: found %p pointing into chunk %p-%p of size %zu.\n", 218 (void *)pp, p, (void *)chunk, 219 (void *)(chunk + m.requested_size()), m.requested_size()); 220 if (frontier) 221 frontier->push_back(chunk); 222 } 223 } 224 225 // Scans a global range for pointers 226 void ScanGlobalRange(uptr begin, uptr end, Frontier *frontier) { 227 uptr allocator_begin = 0, allocator_end = 0; 228 GetAllocatorGlobalRange(&allocator_begin, &allocator_end); 229 if (begin <= allocator_begin && allocator_begin < end) { 230 CHECK_LE(allocator_begin, allocator_end); 231 CHECK_LE(allocator_end, end); 232 if (begin < allocator_begin) 233 ScanRangeForPointers(begin, allocator_begin, frontier, "GLOBAL", 234 kReachable); 235 if (allocator_end < end) 236 ScanRangeForPointers(allocator_end, end, frontier, "GLOBAL", kReachable); 237 } else { 238 ScanRangeForPointers(begin, end, frontier, "GLOBAL", kReachable); 239 } 240 } 241 242 void ForEachExtraStackRangeCb(uptr begin, uptr end, void* arg) { 243 Frontier *frontier = reinterpret_cast<Frontier *>(arg); 244 ScanRangeForPointers(begin, end, frontier, "FAKE STACK", kReachable); 245 } 246 247 #if SANITIZER_FUCHSIA 248 249 // Fuchsia handles all threads together with its own callback. 250 static void ProcessThreads(SuspendedThreadsList const &, Frontier *) {} 251 252 #else 253 254 #if SANITIZER_ANDROID 255 // FIXME: Move this out into *libcdep.cpp 256 extern "C" SANITIZER_WEAK_ATTRIBUTE void __libc_iterate_dynamic_tls( 257 pid_t, void (*cb)(void *, void *, uptr, void *), void *); 258 #endif 259 260 static void ProcessThreadRegistry(Frontier *frontier) { 261 InternalMmapVector<uptr> ptrs; 262 GetThreadRegistryLocked()->RunCallbackForEachThreadLocked( 263 GetAdditionalThreadContextPtrs, &ptrs); 264 265 for (uptr i = 0; i < ptrs.size(); ++i) { 266 void *ptr = reinterpret_cast<void *>(ptrs[i]); 267 uptr chunk = PointsIntoChunk(ptr); 268 if (!chunk) 269 continue; 270 LsanMetadata m(chunk); 271 if (!m.allocated()) 272 continue; 273 274 // Mark as reachable and add to frontier. 275 LOG_POINTERS("Treating pointer %p from ThreadContext as reachable\n", ptr); 276 m.set_tag(kReachable); 277 frontier->push_back(chunk); 278 } 279 } 280 281 // Scans thread data (stacks and TLS) for heap pointers. 282 static void ProcessThreads(SuspendedThreadsList const &suspended_threads, 283 Frontier *frontier) { 284 InternalMmapVector<uptr> registers; 285 for (uptr i = 0; i < suspended_threads.ThreadCount(); i++) { 286 tid_t os_id = static_cast<tid_t>(suspended_threads.GetThreadID(i)); 287 LOG_THREADS("Processing thread %llu.\n", os_id); 288 uptr stack_begin, stack_end, tls_begin, tls_end, cache_begin, cache_end; 289 DTLS *dtls; 290 bool thread_found = GetThreadRangesLocked(os_id, &stack_begin, &stack_end, 291 &tls_begin, &tls_end, 292 &cache_begin, &cache_end, &dtls); 293 if (!thread_found) { 294 // If a thread can't be found in the thread registry, it's probably in the 295 // process of destruction. Log this event and move on. 296 LOG_THREADS("Thread %llu not found in registry.\n", os_id); 297 continue; 298 } 299 uptr sp; 300 PtraceRegistersStatus have_registers = 301 suspended_threads.GetRegistersAndSP(i, ®isters, &sp); 302 if (have_registers != REGISTERS_AVAILABLE) { 303 Report("Unable to get registers from thread %llu.\n", os_id); 304 // If unable to get SP, consider the entire stack to be reachable unless 305 // GetRegistersAndSP failed with ESRCH. 306 if (have_registers == REGISTERS_UNAVAILABLE_FATAL) continue; 307 sp = stack_begin; 308 } 309 310 if (flags()->use_registers && have_registers) { 311 uptr registers_begin = reinterpret_cast<uptr>(registers.data()); 312 uptr registers_end = 313 reinterpret_cast<uptr>(registers.data() + registers.size()); 314 ScanRangeForPointers(registers_begin, registers_end, frontier, 315 "REGISTERS", kReachable); 316 } 317 318 if (flags()->use_stacks) { 319 LOG_THREADS("Stack at %p-%p (SP = %p).\n", (void *)stack_begin, 320 (void *)stack_end, (void *)sp); 321 if (sp < stack_begin || sp >= stack_end) { 322 // SP is outside the recorded stack range (e.g. the thread is running a 323 // signal handler on alternate stack, or swapcontext was used). 324 // Again, consider the entire stack range to be reachable. 325 LOG_THREADS("WARNING: stack pointer not in stack range.\n"); 326 uptr page_size = GetPageSizeCached(); 327 int skipped = 0; 328 while (stack_begin < stack_end && 329 !IsAccessibleMemoryRange(stack_begin, 1)) { 330 skipped++; 331 stack_begin += page_size; 332 } 333 LOG_THREADS("Skipped %d guard page(s) to obtain stack %p-%p.\n", 334 skipped, (void *)stack_begin, (void *)stack_end); 335 } else { 336 // Shrink the stack range to ignore out-of-scope values. 337 stack_begin = sp; 338 } 339 ScanRangeForPointers(stack_begin, stack_end, frontier, "STACK", 340 kReachable); 341 ForEachExtraStackRange(os_id, ForEachExtraStackRangeCb, frontier); 342 } 343 344 if (flags()->use_tls) { 345 if (tls_begin) { 346 LOG_THREADS("TLS at %p-%p.\n", (void *)tls_begin, (void *)tls_end); 347 // If the tls and cache ranges don't overlap, scan full tls range, 348 // otherwise, only scan the non-overlapping portions 349 if (cache_begin == cache_end || tls_end < cache_begin || 350 tls_begin > cache_end) { 351 ScanRangeForPointers(tls_begin, tls_end, frontier, "TLS", kReachable); 352 } else { 353 if (tls_begin < cache_begin) 354 ScanRangeForPointers(tls_begin, cache_begin, frontier, "TLS", 355 kReachable); 356 if (tls_end > cache_end) 357 ScanRangeForPointers(cache_end, tls_end, frontier, "TLS", 358 kReachable); 359 } 360 } 361 #if SANITIZER_ANDROID 362 auto *cb = +[](void *dtls_begin, void *dtls_end, uptr /*dso_idd*/, 363 void *arg) -> void { 364 ScanRangeForPointers(reinterpret_cast<uptr>(dtls_begin), 365 reinterpret_cast<uptr>(dtls_end), 366 reinterpret_cast<Frontier *>(arg), "DTLS", 367 kReachable); 368 }; 369 370 // FIXME: There might be a race-condition here (and in Bionic) if the 371 // thread is suspended in the middle of updating its DTLS. IOWs, we 372 // could scan already freed memory. (probably fine for now) 373 __libc_iterate_dynamic_tls(os_id, cb, frontier); 374 #else 375 if (dtls && !DTLSInDestruction(dtls)) { 376 ForEachDVT(dtls, [&](const DTLS::DTV &dtv, int id) { 377 uptr dtls_beg = dtv.beg; 378 uptr dtls_end = dtls_beg + dtv.size; 379 if (dtls_beg < dtls_end) { 380 LOG_THREADS("DTLS %d at %p-%p.\n", id, (void *)dtls_beg, 381 (void *)dtls_end); 382 ScanRangeForPointers(dtls_beg, dtls_end, frontier, "DTLS", 383 kReachable); 384 } 385 }); 386 } else { 387 // We are handling a thread with DTLS under destruction. Log about 388 // this and continue. 389 LOG_THREADS("Thread %llu has DTLS under destruction.\n", os_id); 390 } 391 #endif 392 } 393 } 394 395 // Add pointers reachable from ThreadContexts 396 ProcessThreadRegistry(frontier); 397 } 398 399 #endif // SANITIZER_FUCHSIA 400 401 void ScanRootRegion(Frontier *frontier, const RootRegion &root_region, 402 uptr region_begin, uptr region_end, bool is_readable) { 403 uptr intersection_begin = Max(root_region.begin, region_begin); 404 uptr intersection_end = Min(region_end, root_region.begin + root_region.size); 405 if (intersection_begin >= intersection_end) return; 406 LOG_POINTERS("Root region %p-%p intersects with mapped region %p-%p (%s)\n", 407 (void *)root_region.begin, 408 (void *)(root_region.begin + root_region.size), 409 (void *)region_begin, (void *)region_end, 410 is_readable ? "readable" : "unreadable"); 411 if (is_readable) 412 ScanRangeForPointers(intersection_begin, intersection_end, frontier, "ROOT", 413 kReachable); 414 } 415 416 static void ProcessRootRegion(Frontier *frontier, 417 const RootRegion &root_region) { 418 MemoryMappingLayout proc_maps(/*cache_enabled*/ true); 419 MemoryMappedSegment segment; 420 while (proc_maps.Next(&segment)) { 421 ScanRootRegion(frontier, root_region, segment.start, segment.end, 422 segment.IsReadable()); 423 } 424 } 425 426 // Scans root regions for heap pointers. 427 static void ProcessRootRegions(Frontier *frontier) { 428 if (!flags()->use_root_regions) return; 429 CHECK(root_regions); 430 for (uptr i = 0; i < root_regions->size(); i++) { 431 ProcessRootRegion(frontier, (*root_regions)[i]); 432 } 433 } 434 435 static void FloodFillTag(Frontier *frontier, ChunkTag tag) { 436 while (frontier->size()) { 437 uptr next_chunk = frontier->back(); 438 frontier->pop_back(); 439 LsanMetadata m(next_chunk); 440 ScanRangeForPointers(next_chunk, next_chunk + m.requested_size(), frontier, 441 "HEAP", tag); 442 } 443 } 444 445 // ForEachChunk callback. If the chunk is marked as leaked, marks all chunks 446 // which are reachable from it as indirectly leaked. 447 static void MarkIndirectlyLeakedCb(uptr chunk, void *arg) { 448 chunk = GetUserBegin(chunk); 449 LsanMetadata m(chunk); 450 if (m.allocated() && m.tag() != kReachable) { 451 ScanRangeForPointers(chunk, chunk + m.requested_size(), 452 /* frontier */ nullptr, "HEAP", kIndirectlyLeaked); 453 } 454 } 455 456 static void IgnoredSuppressedCb(uptr chunk, void *arg) { 457 CHECK(arg); 458 chunk = GetUserBegin(chunk); 459 LsanMetadata m(chunk); 460 if (!m.allocated() || m.tag() == kIgnored) 461 return; 462 463 const InternalMmapVector<u32> &suppressed = 464 *static_cast<const InternalMmapVector<u32> *>(arg); 465 uptr idx = InternalLowerBound(suppressed, m.stack_trace_id()); 466 if (idx >= suppressed.size() || m.stack_trace_id() != suppressed[idx]) 467 return; 468 469 LOG_POINTERS("Suppressed: chunk %p-%p of size %zu.\n", (void *)chunk, 470 (void *)(chunk + m.requested_size()), m.requested_size()); 471 m.set_tag(kIgnored); 472 } 473 474 // ForEachChunk callback. If chunk is marked as ignored, adds its address to 475 // frontier. 476 static void CollectIgnoredCb(uptr chunk, void *arg) { 477 CHECK(arg); 478 chunk = GetUserBegin(chunk); 479 LsanMetadata m(chunk); 480 if (m.allocated() && m.tag() == kIgnored) { 481 LOG_POINTERS("Ignored: chunk %p-%p of size %zu.\n", (void *)chunk, 482 (void *)(chunk + m.requested_size()), m.requested_size()); 483 reinterpret_cast<Frontier *>(arg)->push_back(chunk); 484 } 485 } 486 487 static uptr GetCallerPC(const StackTrace &stack) { 488 // The top frame is our malloc/calloc/etc. The next frame is the caller. 489 if (stack.size >= 2) 490 return stack.trace[1]; 491 return 0; 492 } 493 494 struct InvalidPCParam { 495 Frontier *frontier; 496 bool skip_linker_allocations; 497 }; 498 499 // ForEachChunk callback. If the caller pc is invalid or is within the linker, 500 // mark as reachable. Called by ProcessPlatformSpecificAllocations. 501 static void MarkInvalidPCCb(uptr chunk, void *arg) { 502 CHECK(arg); 503 InvalidPCParam *param = reinterpret_cast<InvalidPCParam *>(arg); 504 chunk = GetUserBegin(chunk); 505 LsanMetadata m(chunk); 506 if (m.allocated() && m.tag() != kReachable && m.tag() != kIgnored) { 507 u32 stack_id = m.stack_trace_id(); 508 uptr caller_pc = 0; 509 if (stack_id > 0) 510 caller_pc = GetCallerPC(StackDepotGet(stack_id)); 511 // If caller_pc is unknown, this chunk may be allocated in a coroutine. Mark 512 // it as reachable, as we can't properly report its allocation stack anyway. 513 if (caller_pc == 0 || (param->skip_linker_allocations && 514 GetLinker()->containsAddress(caller_pc))) { 515 m.set_tag(kReachable); 516 param->frontier->push_back(chunk); 517 } 518 } 519 } 520 521 // On Linux, treats all chunks allocated from ld-linux.so as reachable, which 522 // covers dynamically allocated TLS blocks, internal dynamic loader's loaded 523 // modules accounting etc. 524 // Dynamic TLS blocks contain the TLS variables of dynamically loaded modules. 525 // They are allocated with a __libc_memalign() call in allocate_and_init() 526 // (elf/dl-tls.c). Glibc won't tell us the address ranges occupied by those 527 // blocks, but we can make sure they come from our own allocator by intercepting 528 // __libc_memalign(). On top of that, there is no easy way to reach them. Their 529 // addresses are stored in a dynamically allocated array (the DTV) which is 530 // referenced from the static TLS. Unfortunately, we can't just rely on the DTV 531 // being reachable from the static TLS, and the dynamic TLS being reachable from 532 // the DTV. This is because the initial DTV is allocated before our interception 533 // mechanism kicks in, and thus we don't recognize it as allocated memory. We 534 // can't special-case it either, since we don't know its size. 535 // Our solution is to include in the root set all allocations made from 536 // ld-linux.so (which is where allocate_and_init() is implemented). This is 537 // guaranteed to include all dynamic TLS blocks (and possibly other allocations 538 // which we don't care about). 539 // On all other platforms, this simply checks to ensure that the caller pc is 540 // valid before reporting chunks as leaked. 541 static void ProcessPC(Frontier *frontier) { 542 InvalidPCParam arg; 543 arg.frontier = frontier; 544 arg.skip_linker_allocations = 545 flags()->use_tls && flags()->use_ld_allocations && GetLinker() != nullptr; 546 ForEachChunk(MarkInvalidPCCb, &arg); 547 } 548 549 // Sets the appropriate tag on each chunk. 550 static void ClassifyAllChunks(SuspendedThreadsList const &suspended_threads, 551 Frontier *frontier) { 552 const InternalMmapVector<u32> &suppressed_stacks = 553 GetSuppressionContext()->GetSortedSuppressedStacks(); 554 if (!suppressed_stacks.empty()) { 555 ForEachChunk(IgnoredSuppressedCb, 556 const_cast<InternalMmapVector<u32> *>(&suppressed_stacks)); 557 } 558 ForEachChunk(CollectIgnoredCb, frontier); 559 ProcessGlobalRegions(frontier); 560 ProcessThreads(suspended_threads, frontier); 561 ProcessRootRegions(frontier); 562 FloodFillTag(frontier, kReachable); 563 564 CHECK_EQ(0, frontier->size()); 565 ProcessPC(frontier); 566 567 // The check here is relatively expensive, so we do this in a separate flood 568 // fill. That way we can skip the check for chunks that are reachable 569 // otherwise. 570 LOG_POINTERS("Processing platform-specific allocations.\n"); 571 ProcessPlatformSpecificAllocations(frontier); 572 FloodFillTag(frontier, kReachable); 573 574 // Iterate over leaked chunks and mark those that are reachable from other 575 // leaked chunks. 576 LOG_POINTERS("Scanning leaked chunks.\n"); 577 ForEachChunk(MarkIndirectlyLeakedCb, nullptr); 578 } 579 580 // ForEachChunk callback. Resets the tags to pre-leak-check state. 581 static void ResetTagsCb(uptr chunk, void *arg) { 582 (void)arg; 583 chunk = GetUserBegin(chunk); 584 LsanMetadata m(chunk); 585 if (m.allocated() && m.tag() != kIgnored) 586 m.set_tag(kDirectlyLeaked); 587 } 588 589 // ForEachChunk callback. Aggregates information about unreachable chunks into 590 // a LeakReport. 591 static void CollectLeaksCb(uptr chunk, void *arg) { 592 CHECK(arg); 593 LeakReport *leak_report = reinterpret_cast<LeakReport *>(arg); 594 chunk = GetUserBegin(chunk); 595 LsanMetadata m(chunk); 596 if (!m.allocated()) return; 597 if (m.tag() == kDirectlyLeaked || m.tag() == kIndirectlyLeaked) { 598 leak_report->AddLeakedChunk(chunk, m.stack_trace_id(), m.requested_size(), 599 m.tag()); 600 } 601 } 602 603 void LeakSuppressionContext::PrintMatchedSuppressions() { 604 InternalMmapVector<Suppression *> matched; 605 context.GetMatched(&matched); 606 if (!matched.size()) 607 return; 608 const char *line = "-----------------------------------------------------"; 609 Printf("%s\n", line); 610 Printf("Suppressions used:\n"); 611 Printf(" count bytes template\n"); 612 for (uptr i = 0; i < matched.size(); i++) { 613 Printf("%7zu %10zu %s\n", 614 static_cast<uptr>(atomic_load_relaxed(&matched[i]->hit_count)), 615 matched[i]->weight, matched[i]->templ); 616 } 617 Printf("%s\n\n", line); 618 } 619 620 static void ReportIfNotSuspended(ThreadContextBase *tctx, void *arg) { 621 const InternalMmapVector<tid_t> &suspended_threads = 622 *(const InternalMmapVector<tid_t> *)arg; 623 if (tctx->status == ThreadStatusRunning) { 624 uptr i = InternalLowerBound(suspended_threads, tctx->os_id); 625 if (i >= suspended_threads.size() || suspended_threads[i] != tctx->os_id) 626 Report( 627 "Running thread %llu was not suspended. False leaks are possible.\n", 628 tctx->os_id); 629 } 630 } 631 632 #if SANITIZER_FUCHSIA 633 634 // Fuchsia provides a libc interface that guarantees all threads are 635 // covered, and SuspendedThreadList is never really used. 636 static void ReportUnsuspendedThreads(const SuspendedThreadsList &) {} 637 638 #else // !SANITIZER_FUCHSIA 639 640 static void ReportUnsuspendedThreads( 641 const SuspendedThreadsList &suspended_threads) { 642 InternalMmapVector<tid_t> threads(suspended_threads.ThreadCount()); 643 for (uptr i = 0; i < suspended_threads.ThreadCount(); ++i) 644 threads[i] = suspended_threads.GetThreadID(i); 645 646 Sort(threads.data(), threads.size()); 647 648 GetThreadRegistryLocked()->RunCallbackForEachThreadLocked( 649 &ReportIfNotSuspended, &threads); 650 } 651 652 #endif // !SANITIZER_FUCHSIA 653 654 static void CheckForLeaksCallback(const SuspendedThreadsList &suspended_threads, 655 void *arg) { 656 CheckForLeaksParam *param = reinterpret_cast<CheckForLeaksParam *>(arg); 657 CHECK(param); 658 CHECK(!param->success); 659 ReportUnsuspendedThreads(suspended_threads); 660 ClassifyAllChunks(suspended_threads, ¶m->frontier); 661 ForEachChunk(CollectLeaksCb, ¶m->leak_report); 662 // Clean up for subsequent leak checks. This assumes we did not overwrite any 663 // kIgnored tags. 664 ForEachChunk(ResetTagsCb, nullptr); 665 param->success = true; 666 } 667 668 static bool PrintResults(LeakReport &report) { 669 uptr unsuppressed_count = report.UnsuppressedLeakCount(); 670 if (unsuppressed_count) { 671 Decorator d; 672 Printf( 673 "\n" 674 "=================================================================" 675 "\n"); 676 Printf("%s", d.Error()); 677 Report("ERROR: LeakSanitizer: detected memory leaks\n"); 678 Printf("%s", d.Default()); 679 report.ReportTopLeaks(flags()->max_leaks); 680 } 681 if (common_flags()->print_suppressions) 682 GetSuppressionContext()->PrintMatchedSuppressions(); 683 if (unsuppressed_count > 0) { 684 report.PrintSummary(); 685 return true; 686 } 687 return false; 688 } 689 690 static bool CheckForLeaks() { 691 if (&__lsan_is_turned_off && __lsan_is_turned_off()) 692 return false; 693 // Inside LockStuffAndStopTheWorld we can't run symbolizer, so we can't match 694 // suppressions. However if a stack id was previously suppressed, it should be 695 // suppressed in future checks as well. 696 for (int i = 0;; ++i) { 697 EnsureMainThreadIDIsCorrect(); 698 CheckForLeaksParam param; 699 LockStuffAndStopTheWorld(CheckForLeaksCallback, ¶m); 700 if (!param.success) { 701 Report("LeakSanitizer has encountered a fatal error.\n"); 702 Report( 703 "HINT: For debugging, try setting environment variable " 704 "LSAN_OPTIONS=verbosity=1:log_threads=1\n"); 705 Report( 706 "HINT: LeakSanitizer does not work under ptrace (strace, gdb, " 707 "etc)\n"); 708 Die(); 709 } 710 // No new suppressions stacks, so rerun will not help and we can report. 711 if (!param.leak_report.ApplySuppressions()) 712 return PrintResults(param.leak_report); 713 714 // No indirect leaks to report, so we are done here. 715 if (!param.leak_report.IndirectUnsuppressedLeakCount()) 716 return PrintResults(param.leak_report); 717 718 if (i >= 8) { 719 Report("WARNING: LeakSanitizer gave up on indirect leaks suppression.\n"); 720 return PrintResults(param.leak_report); 721 } 722 723 // We found a new previously unseen suppressed call stack. Rerun to make 724 // sure it does not hold indirect leaks. 725 VReport(1, "Rerun with %zu suppressed stacks.", 726 GetSuppressionContext()->GetSortedSuppressedStacks().size()); 727 } 728 } 729 730 static bool has_reported_leaks = false; 731 bool HasReportedLeaks() { return has_reported_leaks; } 732 733 void DoLeakCheck() { 734 Lock l(&global_mutex); 735 static bool already_done; 736 if (already_done) return; 737 already_done = true; 738 has_reported_leaks = CheckForLeaks(); 739 if (has_reported_leaks) HandleLeaks(); 740 } 741 742 static int DoRecoverableLeakCheck() { 743 Lock l(&global_mutex); 744 bool have_leaks = CheckForLeaks(); 745 return have_leaks ? 1 : 0; 746 } 747 748 void DoRecoverableLeakCheckVoid() { DoRecoverableLeakCheck(); } 749 750 Suppression *LeakSuppressionContext::GetSuppressionForAddr(uptr addr) { 751 Suppression *s = nullptr; 752 753 // Suppress by module name. 754 if (const char *module_name = 755 Symbolizer::GetOrInit()->GetModuleNameForPc(addr)) 756 if (context.Match(module_name, kSuppressionLeak, &s)) 757 return s; 758 759 // Suppress by file or function name. 760 SymbolizedStack *frames = Symbolizer::GetOrInit()->SymbolizePC(addr); 761 for (SymbolizedStack *cur = frames; cur; cur = cur->next) { 762 if (context.Match(cur->info.function, kSuppressionLeak, &s) || 763 context.Match(cur->info.file, kSuppressionLeak, &s)) { 764 break; 765 } 766 } 767 frames->ClearAll(); 768 return s; 769 } 770 771 Suppression *LeakSuppressionContext::GetSuppressionForStack( 772 u32 stack_trace_id, const StackTrace &stack) { 773 LazyInit(); 774 for (uptr i = 0; i < stack.size; i++) { 775 Suppression *s = GetSuppressionForAddr( 776 StackTrace::GetPreviousInstructionPc(stack.trace[i])); 777 if (s) { 778 suppressed_stacks_sorted = false; 779 suppressed_stacks.push_back(stack_trace_id); 780 return s; 781 } 782 } 783 return nullptr; 784 } 785 786 ///// LeakReport implementation. ///// 787 788 // A hard limit on the number of distinct leaks, to avoid quadratic complexity 789 // in LeakReport::AddLeakedChunk(). We don't expect to ever see this many leaks 790 // in real-world applications. 791 // FIXME: Get rid of this limit by changing the implementation of LeakReport to 792 // use a hash table. 793 const uptr kMaxLeaksConsidered = 5000; 794 795 void LeakReport::AddLeakedChunk(uptr chunk, u32 stack_trace_id, 796 uptr leaked_size, ChunkTag tag) { 797 CHECK(tag == kDirectlyLeaked || tag == kIndirectlyLeaked); 798 799 if (u32 resolution = flags()->resolution) { 800 StackTrace stack = StackDepotGet(stack_trace_id); 801 stack.size = Min(stack.size, resolution); 802 stack_trace_id = StackDepotPut(stack); 803 } 804 805 bool is_directly_leaked = (tag == kDirectlyLeaked); 806 uptr i; 807 for (i = 0; i < leaks_.size(); i++) { 808 if (leaks_[i].stack_trace_id == stack_trace_id && 809 leaks_[i].is_directly_leaked == is_directly_leaked) { 810 leaks_[i].hit_count++; 811 leaks_[i].total_size += leaked_size; 812 break; 813 } 814 } 815 if (i == leaks_.size()) { 816 if (leaks_.size() == kMaxLeaksConsidered) return; 817 Leak leak = { next_id_++, /* hit_count */ 1, leaked_size, stack_trace_id, 818 is_directly_leaked, /* is_suppressed */ false }; 819 leaks_.push_back(leak); 820 } 821 if (flags()->report_objects) { 822 LeakedObject obj = {leaks_[i].id, chunk, leaked_size}; 823 leaked_objects_.push_back(obj); 824 } 825 } 826 827 static bool LeakComparator(const Leak &leak1, const Leak &leak2) { 828 if (leak1.is_directly_leaked == leak2.is_directly_leaked) 829 return leak1.total_size > leak2.total_size; 830 else 831 return leak1.is_directly_leaked; 832 } 833 834 void LeakReport::ReportTopLeaks(uptr num_leaks_to_report) { 835 CHECK(leaks_.size() <= kMaxLeaksConsidered); 836 Printf("\n"); 837 if (leaks_.size() == kMaxLeaksConsidered) 838 Printf("Too many leaks! Only the first %zu leaks encountered will be " 839 "reported.\n", 840 kMaxLeaksConsidered); 841 842 uptr unsuppressed_count = UnsuppressedLeakCount(); 843 if (num_leaks_to_report > 0 && num_leaks_to_report < unsuppressed_count) 844 Printf("The %zu top leak(s):\n", num_leaks_to_report); 845 Sort(leaks_.data(), leaks_.size(), &LeakComparator); 846 uptr leaks_reported = 0; 847 for (uptr i = 0; i < leaks_.size(); i++) { 848 if (leaks_[i].is_suppressed) continue; 849 PrintReportForLeak(i); 850 leaks_reported++; 851 if (leaks_reported == num_leaks_to_report) break; 852 } 853 if (leaks_reported < unsuppressed_count) { 854 uptr remaining = unsuppressed_count - leaks_reported; 855 Printf("Omitting %zu more leak(s).\n", remaining); 856 } 857 } 858 859 void LeakReport::PrintReportForLeak(uptr index) { 860 Decorator d; 861 Printf("%s", d.Leak()); 862 Printf("%s leak of %zu byte(s) in %zu object(s) allocated from:\n", 863 leaks_[index].is_directly_leaked ? "Direct" : "Indirect", 864 leaks_[index].total_size, leaks_[index].hit_count); 865 Printf("%s", d.Default()); 866 867 CHECK(leaks_[index].stack_trace_id); 868 StackDepotGet(leaks_[index].stack_trace_id).Print(); 869 870 if (flags()->report_objects) { 871 Printf("Objects leaked above:\n"); 872 PrintLeakedObjectsForLeak(index); 873 Printf("\n"); 874 } 875 } 876 877 void LeakReport::PrintLeakedObjectsForLeak(uptr index) { 878 u32 leak_id = leaks_[index].id; 879 for (uptr j = 0; j < leaked_objects_.size(); j++) { 880 if (leaked_objects_[j].leak_id == leak_id) 881 Printf("%p (%zu bytes)\n", (void *)leaked_objects_[j].addr, 882 leaked_objects_[j].size); 883 } 884 } 885 886 void LeakReport::PrintSummary() { 887 CHECK(leaks_.size() <= kMaxLeaksConsidered); 888 uptr bytes = 0, allocations = 0; 889 for (uptr i = 0; i < leaks_.size(); i++) { 890 if (leaks_[i].is_suppressed) continue; 891 bytes += leaks_[i].total_size; 892 allocations += leaks_[i].hit_count; 893 } 894 InternalScopedString summary; 895 summary.append("%zu byte(s) leaked in %zu allocation(s).", bytes, 896 allocations); 897 ReportErrorSummary(summary.data()); 898 } 899 900 uptr LeakReport::ApplySuppressions() { 901 LeakSuppressionContext *suppressions = GetSuppressionContext(); 902 uptr new_suppressions = false; 903 for (uptr i = 0; i < leaks_.size(); i++) { 904 Suppression *s = suppressions->GetSuppressionForStack( 905 leaks_[i].stack_trace_id, StackDepotGet(leaks_[i].stack_trace_id)); 906 if (s) { 907 s->weight += leaks_[i].total_size; 908 atomic_store_relaxed(&s->hit_count, atomic_load_relaxed(&s->hit_count) + 909 leaks_[i].hit_count); 910 leaks_[i].is_suppressed = true; 911 ++new_suppressions; 912 } 913 } 914 return new_suppressions; 915 } 916 917 uptr LeakReport::UnsuppressedLeakCount() { 918 uptr result = 0; 919 for (uptr i = 0; i < leaks_.size(); i++) 920 if (!leaks_[i].is_suppressed) result++; 921 return result; 922 } 923 924 uptr LeakReport::IndirectUnsuppressedLeakCount() { 925 uptr result = 0; 926 for (uptr i = 0; i < leaks_.size(); i++) 927 if (!leaks_[i].is_suppressed && !leaks_[i].is_directly_leaked) 928 result++; 929 return result; 930 } 931 932 } // namespace __lsan 933 #else // CAN_SANITIZE_LEAKS 934 namespace __lsan { 935 void InitCommonLsan() { } 936 void DoLeakCheck() { } 937 void DoRecoverableLeakCheckVoid() { } 938 void DisableInThisThread() { } 939 void EnableInThisThread() { } 940 } 941 #endif // CAN_SANITIZE_LEAKS 942 943 using namespace __lsan; 944 945 extern "C" { 946 SANITIZER_INTERFACE_ATTRIBUTE 947 void __lsan_ignore_object(const void *p) { 948 #if CAN_SANITIZE_LEAKS 949 if (!common_flags()->detect_leaks) 950 return; 951 // Cannot use PointsIntoChunk or LsanMetadata here, since the allocator is not 952 // locked. 953 Lock l(&global_mutex); 954 IgnoreObjectResult res = IgnoreObjectLocked(p); 955 if (res == kIgnoreObjectInvalid) 956 VReport(1, "__lsan_ignore_object(): no heap object found at %p", p); 957 if (res == kIgnoreObjectAlreadyIgnored) 958 VReport(1, "__lsan_ignore_object(): " 959 "heap object at %p is already being ignored\n", p); 960 if (res == kIgnoreObjectSuccess) 961 VReport(1, "__lsan_ignore_object(): ignoring heap object at %p\n", p); 962 #endif // CAN_SANITIZE_LEAKS 963 } 964 965 SANITIZER_INTERFACE_ATTRIBUTE 966 void __lsan_register_root_region(const void *begin, uptr size) { 967 #if CAN_SANITIZE_LEAKS 968 Lock l(&global_mutex); 969 CHECK(root_regions); 970 RootRegion region = {reinterpret_cast<uptr>(begin), size}; 971 root_regions->push_back(region); 972 VReport(1, "Registered root region at %p of size %zu\n", begin, size); 973 #endif // CAN_SANITIZE_LEAKS 974 } 975 976 SANITIZER_INTERFACE_ATTRIBUTE 977 void __lsan_unregister_root_region(const void *begin, uptr size) { 978 #if CAN_SANITIZE_LEAKS 979 Lock l(&global_mutex); 980 CHECK(root_regions); 981 bool removed = false; 982 for (uptr i = 0; i < root_regions->size(); i++) { 983 RootRegion region = (*root_regions)[i]; 984 if (region.begin == reinterpret_cast<uptr>(begin) && region.size == size) { 985 removed = true; 986 uptr last_index = root_regions->size() - 1; 987 (*root_regions)[i] = (*root_regions)[last_index]; 988 root_regions->pop_back(); 989 VReport(1, "Unregistered root region at %p of size %zu\n", begin, size); 990 break; 991 } 992 } 993 if (!removed) { 994 Report( 995 "__lsan_unregister_root_region(): region at %p of size %zu has not " 996 "been registered.\n", 997 begin, size); 998 Die(); 999 } 1000 #endif // CAN_SANITIZE_LEAKS 1001 } 1002 1003 SANITIZER_INTERFACE_ATTRIBUTE 1004 void __lsan_disable() { 1005 #if CAN_SANITIZE_LEAKS 1006 __lsan::DisableInThisThread(); 1007 #endif 1008 } 1009 1010 SANITIZER_INTERFACE_ATTRIBUTE 1011 void __lsan_enable() { 1012 #if CAN_SANITIZE_LEAKS 1013 __lsan::EnableInThisThread(); 1014 #endif 1015 } 1016 1017 SANITIZER_INTERFACE_ATTRIBUTE 1018 void __lsan_do_leak_check() { 1019 #if CAN_SANITIZE_LEAKS 1020 if (common_flags()->detect_leaks) 1021 __lsan::DoLeakCheck(); 1022 #endif // CAN_SANITIZE_LEAKS 1023 } 1024 1025 SANITIZER_INTERFACE_ATTRIBUTE 1026 int __lsan_do_recoverable_leak_check() { 1027 #if CAN_SANITIZE_LEAKS 1028 if (common_flags()->detect_leaks) 1029 return __lsan::DoRecoverableLeakCheck(); 1030 #endif // CAN_SANITIZE_LEAKS 1031 return 0; 1032 } 1033 1034 SANITIZER_INTERFACE_WEAK_DEF(const char *, __lsan_default_options, void) { 1035 return ""; 1036 } 1037 1038 #if !SANITIZER_SUPPORTS_WEAK_HOOKS 1039 SANITIZER_INTERFACE_ATTRIBUTE SANITIZER_WEAK_ATTRIBUTE 1040 int __lsan_is_turned_off() { 1041 return 0; 1042 } 1043 1044 SANITIZER_INTERFACE_ATTRIBUTE SANITIZER_WEAK_ATTRIBUTE 1045 const char *__lsan_default_suppressions() { 1046 return ""; 1047 } 1048 #endif 1049 } // extern "C" 1050