712fc9803a
Summary: This is an initial implementation of a Hardened Allocator based on Sanitizer Common's CombinedAllocator. It aims at mitigating heap based vulnerabilities by adding several features to the base allocator, while staying relatively fast. The following were implemented: - additional consistency checks on the allocation function parameters and on the heap chunks; - use of checksum protected chunk header, to detect corruption; - randomness to the allocator base; - delayed freelist (quarantine), to mitigate use after free and overall determinism. Additional mitigations are in the works. Reviewers: eugenis, aizatsky, pcc, krasin, vitalybuka, glider, dvyukov, kcc Subscribers: kubabrecka, filcab, llvm-commits Differential Revision: http://reviews.llvm.org/D20084 llvm-svn: 271968
28 lines
472 B
C++
28 lines
472 B
C++
// RUN: %clang_scudo %s -o %t
|
|
// RUN: %run %t 2>&1
|
|
|
|
// Tests that a regular workflow of allocation, memory fill and free works as
|
|
// intended. Also tests that a zero-sized allocation succeeds.
|
|
|
|
#include <malloc.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
void *p;
|
|
size_t size = 1U << 8;
|
|
|
|
p = malloc(size);
|
|
if (!p)
|
|
return 1;
|
|
memset(p, 'A', size);
|
|
free(p);
|
|
p = malloc(0);
|
|
if (!p)
|
|
return 1;
|
|
free(p);
|
|
|
|
return 0;
|
|
}
|