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
|
//===-- iterate.cpp ---------------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "gwp_asan/tests/harness.h"
#include <algorithm>
#include <set>
#include <vector>
TEST_F(CustomGuardedPoolAllocator, Iterate) {
InitNumSlots(7);
std::vector<std::pair<void *, size_t>> Allocated;
auto alloc = [&](size_t size) {
Allocated.push_back({GPA.allocate(size), size});
};
void *Ptr = GPA.allocate(5);
alloc(2);
alloc(1);
alloc(100);
GPA.deallocate(Ptr);
alloc(42);
std::sort(Allocated.begin(), Allocated.end());
GPA.disable();
void *Base = Allocated[0].first;
size_t Size = reinterpret_cast<size_t>(Allocated.back().first) -
reinterpret_cast<size_t>(Base) + 1;
std::vector<std::pair<void *, size_t>> Found;
GPA.iterate(
Base, Size,
[](uintptr_t Addr, size_t Size, void *Arg) {
reinterpret_cast<std::vector<std::pair<void *, size_t>> *>(Arg)
->push_back({(void *)Addr, Size});
},
reinterpret_cast<void *>(&Found));
GPA.enable();
std::sort(Found.begin(), Found.end());
EXPECT_EQ(Allocated, Found);
// Now without the last allocation.
GPA.disable();
Size = reinterpret_cast<size_t>(Allocated.back().first) -
reinterpret_cast<size_t>(Base); // Allocated.back() is out of range.
Found.clear();
GPA.iterate(
Base, Size,
[](uintptr_t Addr, size_t Size, void *Arg) {
reinterpret_cast<std::vector<std::pair<void *, size_t>> *>(Arg)
->push_back({(void *)Addr, Size});
},
reinterpret_cast<void *>(&Found));
GPA.enable();
// We should have found every allocation but the last.
// Remove it and compare the rest.
std::sort(Found.begin(), Found.end());
GPA.deallocate(Allocated.back().first);
Allocated.pop_back();
EXPECT_EQ(Allocated, Found);
for (auto PS : Allocated)
GPA.deallocate(PS.first);
}
|
