1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
//===-- sanitizer_quarantine_test.cc --------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file is a part of ThreadSanitizer/AddressSanitizer runtime.
//
//===----------------------------------------------------------------------===//
#include "sanitizer_common/sanitizer_common.h"
#include "sanitizer_common/sanitizer_quarantine.h"
#include "gtest/gtest.h"
#include <stdlib.h>
namespace __sanitizer {
struct QuarantineCallback {
void Recycle(void *m) {}
void *Allocate(uptr size) {
return malloc(size);
}
void Deallocate(void *p) {
free(p);
}
};
typedef QuarantineCache<QuarantineCallback> Cache;
static void* kFakePtr = reinterpret_cast<void*>(0xFA83FA83);
static const size_t kBlockSize = 8;
static QuarantineCallback cb;
static void DeallocateCache(Cache *cache) {
while (QuarantineBatch *batch = cache->DequeueBatch())
cb.Deallocate(batch);
}
TEST(SanitizerCommon, QuarantineBatchMerge) {
// Verify the trivial case.
QuarantineBatch into;
into.init(kFakePtr, 4UL);
QuarantineBatch from;
from.init(kFakePtr, 8UL);
into.merge(&from);
ASSERT_EQ(into.count, 2UL);
ASSERT_EQ(into.batch[0], kFakePtr);
ASSERT_EQ(into.batch[1], kFakePtr);
ASSERT_EQ(into.size, 12UL + sizeof(QuarantineBatch));
ASSERT_EQ(into.quarantined_size(), 12UL);
ASSERT_EQ(from.count, 0UL);
ASSERT_EQ(from.size, sizeof(QuarantineBatch));
ASSERT_EQ(from.quarantined_size(), 0UL);
// Merge the batch to the limit.
for (uptr i = 2; i < QuarantineBatch::kSize; ++i)
from.push_back(kFakePtr, 8UL);
ASSERT_TRUE(into.count + from.count == QuarantineBatch::kSize);
ASSERT_TRUE(into.can_merge(&from));
into.merge(&from);
ASSERT_TRUE(into.count == QuarantineBatch::kSize);
// No more space, not even for one element.
from.init(kFakePtr, 8UL);
ASSERT_FALSE(into.can_merge(&from));
}
TEST(SanitizerCommon, QuarantineCacheMergeBatchesEmpty) {
Cache cache;
Cache to_deallocate;
cache.MergeBatches(&to_deallocate);
ASSERT_EQ(to_deallocate.Size(), 0UL);
ASSERT_EQ(to_deallocate.DequeueBatch(), nullptr);
}
TEST(SanitizerCommon, QuarantineCacheMergeBatchesOneBatch) {
Cache cache;
cache.Enqueue(cb, kFakePtr, kBlockSize);
ASSERT_EQ(kBlockSize + sizeof(QuarantineBatch), cache.Size());
Cache to_deallocate;
cache.MergeBatches(&to_deallocate);
// Nothing to merge, nothing to deallocate.
ASSERT_EQ(kBlockSize + sizeof(QuarantineBatch), cache.Size());
ASSERT_EQ(to_deallocate.Size(), 0UL);
ASSERT_EQ(to_deallocate.DequeueBatch(), nullptr);
DeallocateCache(&cache);
}
TEST(SanitizerCommon, QuarantineCacheMergeBatchesSmallBatches) {
// Make a cache with two batches small enough to merge.
Cache from;
from.Enqueue(cb, kFakePtr, kBlockSize);
Cache cache;
cache.Enqueue(cb, kFakePtr, kBlockSize);
cache.Transfer(&from);
ASSERT_EQ(kBlockSize * 2 + sizeof(QuarantineBatch) * 2, cache.Size());
Cache to_deallocate;
cache.MergeBatches(&to_deallocate);
// Batches merged, one batch to deallocate.
ASSERT_EQ(kBlockSize * 2 + sizeof(QuarantineBatch), cache.Size());
ASSERT_EQ(to_deallocate.Size(), sizeof(QuarantineBatch));
DeallocateCache(&cache);
DeallocateCache(&to_deallocate);
}
TEST(SanitizerCommon, QuarantineCacheMergeBatchesTooBigToMerge) {
const uptr kNumBlocks = QuarantineBatch::kSize - 1;
// Make a cache with two batches small enough to merge.
Cache from;
Cache cache;
for (uptr i = 0; i < kNumBlocks; ++i) {
from.Enqueue(cb, kFakePtr, kBlockSize);
cache.Enqueue(cb, kFakePtr, kBlockSize);
}
cache.Transfer(&from);
ASSERT_EQ(kBlockSize * kNumBlocks * 2 +
sizeof(QuarantineBatch) * 2, cache.Size());
Cache to_deallocate;
cache.MergeBatches(&to_deallocate);
// Batches cannot be merged.
ASSERT_EQ(kBlockSize * kNumBlocks * 2 +
sizeof(QuarantineBatch) * 2, cache.Size());
ASSERT_EQ(to_deallocate.Size(), 0UL);
DeallocateCache(&cache);
}
TEST(SanitizerCommon, QuarantineCacheMergeBatchesALotOfBatches) {
const uptr kNumBatchesAfterMerge = 3;
const uptr kNumBlocks = QuarantineBatch::kSize * kNumBatchesAfterMerge;
const uptr kNumBatchesBeforeMerge = kNumBlocks;
// Make a cache with many small batches.
Cache cache;
for (uptr i = 0; i < kNumBlocks; ++i) {
Cache from;
from.Enqueue(cb, kFakePtr, kBlockSize);
cache.Transfer(&from);
}
ASSERT_EQ(kBlockSize * kNumBlocks +
sizeof(QuarantineBatch) * kNumBatchesBeforeMerge, cache.Size());
Cache to_deallocate;
cache.MergeBatches(&to_deallocate);
// All blocks should fit into 3 batches.
ASSERT_EQ(kBlockSize * kNumBlocks +
sizeof(QuarantineBatch) * kNumBatchesAfterMerge, cache.Size());
ASSERT_EQ(to_deallocate.Size(),
sizeof(QuarantineBatch) *
(kNumBatchesBeforeMerge - kNumBatchesAfterMerge));
DeallocateCache(&cache);
DeallocateCache(&to_deallocate);
}
} // namespace __sanitizer
|
