[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
// RUN: %clang_scudo %s -o %t
|
|
|
|
// RUN: %run %t valid 2>&1
|
|
|
|
// RUN: not %run %t invalid 2>&1 | FileCheck %s
|
|
|
|
|
|
|
|
// Tests that the various aligned allocation functions work as intended. Also
|
|
|
|
// tests for the condition where the alignment is not a power of 2.
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <malloc.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
2016-12-15 00:38:11 +08:00
|
|
|
// Reduce the size of the quarantine, or the test can run out of aligned memory
|
|
|
|
// on 32-bit for the larger alignments.
|
|
|
|
extern "C" const char *__scudo_default_options() {
|
|
|
|
return "QuarantineSizeMb=1";
|
|
|
|
}
|
|
|
|
|
2016-06-08 04:09:49 +08:00
|
|
|
// Sometimes the headers may not have this...
|
2016-06-08 07:49:11 +08:00
|
|
|
extern "C" void *aligned_alloc (size_t alignment, size_t size);
|
2016-06-08 04:09:49 +08:00
|
|
|
|
[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
2016-10-01 03:57:21 +08:00
|
|
|
void *p = nullptr;
|
[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
size_t alignment = 1U << 12;
|
2016-10-01 03:57:21 +08:00
|
|
|
size_t size = 1U << 12;
|
[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
|
|
|
|
assert(argc == 2);
|
2016-10-01 03:57:21 +08:00
|
|
|
|
[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
if (!strcmp(argv[1], "valid")) {
|
|
|
|
posix_memalign(&p, alignment, size);
|
|
|
|
if (!p)
|
|
|
|
return 1;
|
|
|
|
free(p);
|
|
|
|
p = aligned_alloc(alignment, size);
|
|
|
|
if (!p)
|
|
|
|
return 1;
|
|
|
|
free(p);
|
2016-10-01 03:57:21 +08:00
|
|
|
// Tests various combinations of alignment and sizes
|
2016-12-15 00:38:11 +08:00
|
|
|
for (int i = (sizeof(void *) == 4) ? 3 : 4; i < 19; i++) {
|
2016-10-01 03:57:21 +08:00
|
|
|
alignment = 1U << i;
|
|
|
|
for (int j = 1; j < 33; j++) {
|
|
|
|
size = 0x800 * j;
|
|
|
|
for (int k = 0; k < 3; k++) {
|
2016-12-15 00:38:11 +08:00
|
|
|
p = memalign(alignment, size - (2 * sizeof(void *) * k));
|
2016-10-01 03:57:21 +08:00
|
|
|
if (!p)
|
|
|
|
return 1;
|
|
|
|
free(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2016-12-15 00:38:11 +08:00
|
|
|
// For larger alignment, reduce the number of allocations to avoid running
|
|
|
|
// out of potential addresses (on 32-bit).
|
|
|
|
for (int i = 19; i <= 24; i++) {
|
|
|
|
for (int k = 0; k < 3; k++) {
|
|
|
|
p = memalign(alignment, 0x1000 - (2 * sizeof(void *) * k));
|
|
|
|
if (!p)
|
|
|
|
return 1;
|
|
|
|
free(p);
|
|
|
|
}
|
|
|
|
}
|
[sanitizer] Initial implementation of a Hardened Allocator
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
2016-06-07 09:20:26 +08:00
|
|
|
}
|
|
|
|
if (!strcmp(argv[1], "invalid")) {
|
|
|
|
p = memalign(alignment - 1, size);
|
|
|
|
free(p);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-10-27 00:16:58 +08:00
|
|
|
// CHECK: ERROR: alignment is not a power of 2
|