Merge commit 681c2ee4dfbf from llvm-project (by Justin King):

asan: refactor interceptor allocation/deallocation functions (#145087)

  Do some refactoring to allocation/deallocation interceptors. Expose
  explicit per-alloc_type functions and stop accepting explicit AllocType.
  This ensures we do not accidentally mix.

  NOTE: This change rejects attempts to call `operator new(<some_size>,
  static_cast<std::align_val_t>(0))`.

  For https://github.com/llvm/llvm-project/issues/144435

  Signed-off-by: Justin King <[email protected]>

This a prerequisite for adding sanitizer interceptors for free_sized(3)
and free_aligned_sized(3).

PR:		298943
MFC after:	1 week
This commit is contained in:
Dimitry Andric committed 2026-10-11 00:44:17 +02:00
1 parent 0008561567
commit 6b0f64133c
7 files changed
+161 -60

No files matched your search

@@ -1007,13 +1007,8 @@ void PrintInternalAllocatorStats() {
instance.PrintStats();
}
void asan_free(void *ptr, BufferedStackTrace *stack, AllocType alloc_type) {
instance.Deallocate(ptr, 0, 0, stack, alloc_type);
}
void asan_delete(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack, AllocType alloc_type) {
instance.Deallocate(ptr, size, alignment, stack, alloc_type);
void asan_free(void *ptr, BufferedStackTrace *stack) {
instance.Deallocate(ptr, 0, 0, stack, FROM_MALLOC);
}
void *asan_malloc(uptr size, BufferedStackTrace *stack) {
@@ -1068,8 +1063,7 @@ void *asan_pvalloc(uptr size, BufferedStackTrace *stack) {
instance.Allocate(size, PageSize, stack, FROM_MALLOC, true));
}
void *asan_memalign(uptr alignment, uptr size, BufferedStackTrace *stack,
AllocType alloc_type) {
void *asan_memalign(uptr alignment, uptr size, BufferedStackTrace *stack) {
if (UNLIKELY(!IsPowerOfTwo(alignment))) {
errno = errno_EINVAL;
if (AllocatorMayReturnNull())
@@ -1077,7 +1071,7 @@ void *asan_memalign(uptr alignment, uptr size, BufferedStackTrace *stack,
ReportInvalidAllocationAlignment(alignment, stack);
}
return SetErrnoOnNull(
instance.Allocate(size, alignment, stack, alloc_type, true));
instance.Allocate(size, alignment, stack, FROM_MALLOC, true));
}
void *asan_aligned_alloc(uptr alignment, uptr size, BufferedStackTrace *stack) {
@@ -1117,6 +1111,99 @@ uptr asan_malloc_usable_size(const void *ptr, uptr pc, uptr bp) {
return usable_size;
}
namespace {
void *asan_new(uptr size, BufferedStackTrace *stack, bool array) {
return SetErrnoOnNull(
instance.Allocate(size, 0, stack, array ? FROM_NEW_BR : FROM_NEW, true));
}
void *asan_new_aligned(uptr size, uptr alignment, BufferedStackTrace *stack,
bool array) {
if (UNLIKELY(alignment == 0 || !IsPowerOfTwo(alignment))) {
errno = errno_EINVAL;
if (AllocatorMayReturnNull())
return nullptr;
ReportInvalidAllocationAlignment(alignment, stack);
}
return SetErrnoOnNull(instance.Allocate(
size, alignment, stack, array ? FROM_NEW_BR : FROM_NEW, true));
}
void asan_delete(void *ptr, BufferedStackTrace *stack, bool array) {
instance.Deallocate(ptr, 0, 0, stack, array ? FROM_NEW_BR : FROM_NEW);
}
void asan_delete_aligned(void *ptr, uptr alignment, BufferedStackTrace *stack,
bool array) {
instance.Deallocate(ptr, 0, alignment, stack, array ? FROM_NEW_BR : FROM_NEW);
}
void asan_delete_sized(void *ptr, uptr size, BufferedStackTrace *stack,
bool array) {
instance.Deallocate(ptr, size, 0, stack, array ? FROM_NEW_BR : FROM_NEW);
}
void asan_delete_sized_aligned(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack, bool array) {
instance.Deallocate(ptr, size, alignment, stack,
array ? FROM_NEW_BR : FROM_NEW);
}
} // namespace
void *asan_new(uptr size, BufferedStackTrace *stack) {
return asan_new(size, stack, /*array=*/false);
}
void *asan_new_aligned(uptr size, uptr alignment, BufferedStackTrace *stack) {
return asan_new_aligned(size, alignment, stack, /*array=*/false);
}
void *asan_new_array(uptr size, BufferedStackTrace *stack) {
return asan_new(size, stack, /*array=*/true);
}
void *asan_new_array_aligned(uptr size, uptr alignment,
BufferedStackTrace *stack) {
return asan_new_aligned(size, alignment, stack, /*array=*/true);
}
void asan_delete(void *ptr, BufferedStackTrace *stack) {
asan_delete(ptr, stack, /*array=*/false);
}
void asan_delete_aligned(void *ptr, uptr alignment, BufferedStackTrace *stack) {
asan_delete_aligned(ptr, alignment, stack, /*array=*/false);
}
void asan_delete_sized(void *ptr, uptr size, BufferedStackTrace *stack) {
asan_delete_sized(ptr, size, stack, /*array=*/false);
}
void asan_delete_sized_aligned(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack) {
asan_delete_sized_aligned(ptr, size, alignment, stack, /*array=*/false);
}
void asan_delete_array(void *ptr, BufferedStackTrace *stack) {
asan_delete(ptr, stack, /*array=*/true);
}
void asan_delete_array_aligned(void *ptr, uptr alignment,
BufferedStackTrace *stack) {
asan_delete_aligned(ptr, alignment, stack, /*array=*/true);
}
void asan_delete_array_sized(void *ptr, uptr size, BufferedStackTrace *stack) {
asan_delete_sized(ptr, size, stack, /*array=*/true);
}
void asan_delete_array_sized_aligned(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack) {
asan_delete_sized_aligned(ptr, size, alignment, stack, /*array=*/true);
}
uptr asan_mz_size(const void *ptr) {
return instance.AllocationSize(reinterpret_cast<uptr>(ptr));
}
@@ -270,11 +270,8 @@ struct AsanThreadLocalMallocStorage {
AsanThreadLocalMallocStorage() {}
};
void *asan_memalign(uptr alignment, uptr size, BufferedStackTrace *stack,
AllocType alloc_type);
void asan_free(void *ptr, BufferedStackTrace *stack, AllocType alloc_type);
void asan_delete(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack, AllocType alloc_type);
void *asan_memalign(uptr alignment, uptr size, BufferedStackTrace *stack);
void asan_free(void *ptr, BufferedStackTrace *stack);
void *asan_malloc(uptr size, BufferedStackTrace *stack);
void *asan_calloc(uptr nmemb, uptr size, BufferedStackTrace *stack);
@@ -289,6 +286,23 @@ int asan_posix_memalign(void **memptr, uptr alignment, uptr size,
BufferedStackTrace *stack);
uptr asan_malloc_usable_size(const void *ptr, uptr pc, uptr bp);
void *asan_new(uptr size, BufferedStackTrace *stack);
void *asan_new_aligned(uptr size, uptr alignment, BufferedStackTrace *stack);
void *asan_new_array(uptr size, BufferedStackTrace *stack);
void *asan_new_array_aligned(uptr size, uptr alignment,
BufferedStackTrace *stack);
void asan_delete(void *ptr, BufferedStackTrace *stack);
void asan_delete_aligned(void *ptr, uptr alignment, BufferedStackTrace *stack);
void asan_delete_sized(void *ptr, uptr size, BufferedStackTrace *stack);
void asan_delete_sized_aligned(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack);
void asan_delete_array(void *ptr, BufferedStackTrace *stack);
void asan_delete_array_aligned(void *ptr, uptr alignment,
BufferedStackTrace *stack);
void asan_delete_array_sized(void *ptr, uptr size, BufferedStackTrace *stack);
void asan_delete_array_sized_aligned(void *ptr, uptr size, uptr alignment,
BufferedStackTrace *stack);
uptr asan_mz_size(const void *ptr);
void asan_mz_force_lock();
void asan_mz_force_unlock();
@@ -176,7 +176,7 @@ void asan_dispatch_call_block_and_release(void *block) {
asan_register_worker_thread(context->parent_tid, &stack);
// Call the original dispatcher for the block.
context->func(context->block);
asan_free(context, &stack, FROM_MALLOC);
asan_free(context, &stack);
}
} // namespace __asan
@@ -49,7 +49,7 @@ INTERCEPTOR(void, free, void *ptr) {
if (DlsymAlloc::PointerIsMine(ptr))
return DlsymAlloc::Free(ptr);
GET_STACK_TRACE_FREE;
asan_free(ptr, &stack, FROM_MALLOC);
asan_free(ptr, &stack);
}
#if SANITIZER_INTERCEPT_CFREE
@@ -57,7 +57,7 @@ INTERCEPTOR(void, cfree, void *ptr) {
if (DlsymAlloc::PointerIsMine(ptr))
return DlsymAlloc::Free(ptr);
GET_STACK_TRACE_FREE;
asan_free(ptr, &stack, FROM_MALLOC);
asan_free(ptr, &stack);
}
#endif // SANITIZER_INTERCEPT_CFREE
@@ -93,12 +93,12 @@ INTERCEPTOR(void*, reallocarray, void *ptr, uptr nmemb, uptr size) {
#if SANITIZER_INTERCEPT_MEMALIGN
INTERCEPTOR(void*, memalign, uptr boundary, uptr size) {
GET_STACK_TRACE_MALLOC;
return asan_memalign(boundary, size, &stack, FROM_MALLOC);
return asan_memalign(boundary, size, &stack);
}
INTERCEPTOR(void*, __libc_memalign, uptr boundary, uptr size) {
GET_STACK_TRACE_MALLOC;
return asan_memalign(boundary, size, &stack, FROM_MALLOC);
return asan_memalign(boundary, size, &stack);
}
#endif // SANITIZER_INTERCEPT_MEMALIGN
@@ -31,7 +31,7 @@ using namespace __asan;
# define COMMON_MALLOC_FORCE_UNLOCK() asan_mz_force_unlock()
# define COMMON_MALLOC_MEMALIGN(alignment, size) \
GET_STACK_TRACE_MALLOC; \
void *p = asan_memalign(alignment, size, &stack, FROM_MALLOC)
void *p = asan_memalign(alignment, size, &stack)
# define COMMON_MALLOC_MALLOC(size) \
GET_STACK_TRACE_MALLOC; \
void *p = asan_malloc(size, &stack)
@@ -46,10 +46,10 @@ using namespace __asan;
int res = asan_posix_memalign(memptr, alignment, size, &stack);
# define COMMON_MALLOC_VALLOC(size) \
GET_STACK_TRACE_MALLOC; \
void *p = asan_memalign(GetPageSizeCached(), size, &stack, FROM_MALLOC);
void *p = asan_memalign(GetPageSizeCached(), size, &stack);
# define COMMON_MALLOC_FREE(ptr) \
GET_STACK_TRACE_FREE; \
asan_free(ptr, &stack, FROM_MALLOC);
asan_free(ptr, &stack);
# define COMMON_MALLOC_SIZE(ptr) uptr size = asan_mz_size(ptr);
# define COMMON_MALLOC_FILL_STATS(zone, stats) \
AsanMallocStats malloc_stats; \
@@ -69,7 +69,7 @@ __declspec(noinline) size_t _msize_base(void *ptr) { return _msize(ptr); }
__declspec(noinline) void free(void *ptr) {
GET_STACK_TRACE_FREE;
return asan_free(ptr, &stack, FROM_MALLOC);
return asan_free(ptr, &stack);
}
__declspec(noinline) void _free_dbg(void *ptr, int) { free(ptr); }
@@ -252,7 +252,7 @@ INTERCEPTOR_WINAPI(BOOL, HeapFree, HANDLE hHeap, DWORD dwFlags, LPVOID lpMem) {
CHECK((HEAP_FREE_UNSUPPORTED_FLAGS & dwFlags) != 0 && "unsupported flags");
}
GET_STACK_TRACE_FREE;
asan_free(lpMem, &stack, FROM_MALLOC);
asan_free(lpMem, &stack);
return true;
}
@@ -306,7 +306,7 @@ void *SharedReAlloc(ReAllocFunction reallocFunc, SizeFunction heapSizeFunc,
if (replacement_alloc) {
size_t old_size = heapSizeFunc(hHeap, dwFlags, lpMem);
if (old_size == ((size_t)0) - 1) {
asan_free(replacement_alloc, &stack, FROM_MALLOC);
asan_free(replacement_alloc, &stack);
return nullptr;
}
REAL(memcpy)(replacement_alloc, lpMem, old_size);
@@ -331,7 +331,7 @@ void *SharedReAlloc(ReAllocFunction reallocFunc, SizeFunction heapSizeFunc,
old_usable_size = asan_malloc_usable_size(lpMem, pc, bp);
REAL(memcpy)(replacement_alloc, lpMem,
Min<size_t>(dwBytes, old_usable_size));
asan_free(lpMem, &stack, FROM_MALLOC);
asan_free(lpMem, &stack);
}
return replacement_alloc;
}
@@ -429,7 +429,7 @@ INTERCEPTOR_WINAPI(BOOL, RtlFreeHeap, HANDLE HeapHandle, DWORD Flags,
return REAL(RtlFreeHeap)(HeapHandle, Flags, BaseAddress);
}
GET_STACK_TRACE_FREE;
asan_free(BaseAddress, &stack, FROM_MALLOC);
asan_free(BaseAddress, &stack);
return true;
}
@@ -60,42 +60,42 @@ enum class align_val_t: size_t {};
// TODO(alekseyshl): throw std::bad_alloc instead of dying on OOM.
// For local pool allocation, align to SHADOW_GRANULARITY to match asan
// allocator behavior.
#define OPERATOR_NEW_BODY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_memalign(0, size, &stack, FROM_NEW); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
#define OPERATOR_NEW_BODY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_new(size, &stack); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return res
#define OPERATOR_NEW_BODY_NOTHROW \
GET_STACK_TRACE_MALLOC; \
return asan_memalign(0, size, &stack, FROM_NEW)
#define OPERATOR_NEW_BODY_ARRAY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_memalign(0, size, &stack, FROM_NEW_BR); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return asan_new(size, &stack)
#define OPERATOR_NEW_BODY_ARRAY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_new_array(size, &stack); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return res
#define OPERATOR_NEW_BODY_ARRAY_NOTHROW \
GET_STACK_TRACE_MALLOC; \
return asan_memalign(0, size, &stack, FROM_NEW_BR)
#define OPERATOR_NEW_BODY_ALIGN \
GET_STACK_TRACE_MALLOC; \
void *res = asan_memalign((uptr)align, size, &stack, FROM_NEW); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return asan_new_array(size, &stack)
#define OPERATOR_NEW_BODY_ALIGN \
GET_STACK_TRACE_MALLOC; \
void *res = asan_new_aligned(size, static_cast<uptr>(align), &stack); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return res
#define OPERATOR_NEW_BODY_ALIGN_NOTHROW \
GET_STACK_TRACE_MALLOC; \
return asan_memalign((uptr)align, size, &stack, FROM_NEW)
#define OPERATOR_NEW_BODY_ALIGN_ARRAY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_memalign((uptr)align, size, &stack, FROM_NEW_BR); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return asan_new_aligned(size, static_cast<uptr>(align), &stack)
#define OPERATOR_NEW_BODY_ALIGN_ARRAY \
GET_STACK_TRACE_MALLOC; \
void *res = asan_new_array_aligned(size, static_cast<uptr>(align), &stack); \
if (UNLIKELY(!res)) \
ReportOutOfMemory(size, &stack); \
return res
#define OPERATOR_NEW_BODY_ALIGN_ARRAY_NOTHROW \
GET_STACK_TRACE_MALLOC; \
return asan_memalign((uptr)align, size, &stack, FROM_NEW_BR)
return asan_new_array_aligned(size, static_cast<uptr>(align), &stack)
// On OS X it's not enough to just provide our own 'operator new' and
// 'operator delete' implementations, because they're going to be in the
@@ -149,28 +149,28 @@ INTERCEPTOR(void *, _ZnamRKSt9nothrow_t, size_t size, std::nothrow_t const&) {
#define OPERATOR_DELETE_BODY \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, 0, 0, &stack, FROM_NEW)
asan_delete(ptr, &stack)
#define OPERATOR_DELETE_BODY_ARRAY \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, 0, 0, &stack, FROM_NEW_BR)
asan_delete_array(ptr, &stack)
#define OPERATOR_DELETE_BODY_ALIGN \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, 0, static_cast<uptr>(align), &stack, FROM_NEW)
asan_delete_aligned(ptr, static_cast<uptr>(align), &stack)
#define OPERATOR_DELETE_BODY_ALIGN_ARRAY \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, 0, static_cast<uptr>(align), &stack, FROM_NEW_BR)
asan_delete_array_aligned(ptr, static_cast<uptr>(align), &stack)
#define OPERATOR_DELETE_BODY_SIZE \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, size, 0, &stack, FROM_NEW)
asan_delete_sized(ptr, size, &stack)
#define OPERATOR_DELETE_BODY_SIZE_ARRAY \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, size, 0, &stack, FROM_NEW_BR)
asan_delete_array_sized(ptr, size, &stack)
#define OPERATOR_DELETE_BODY_SIZE_ALIGN \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, size, static_cast<uptr>(align), &stack, FROM_NEW)
asan_delete_sized_aligned(ptr, size, static_cast<uptr>(align), &stack)
#define OPERATOR_DELETE_BODY_SIZE_ALIGN_ARRAY \
GET_STACK_TRACE_FREE; \
asan_delete(ptr, size, static_cast<uptr>(align), &stack, FROM_NEW_BR)
asan_delete_array_sized_aligned(ptr, size, static_cast<uptr>(align), &stack)
#if !SANITIZER_APPLE
CXX_OPERATOR_ATTRIBUTE