-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAllocation.cpp
111 lines (66 loc) · 1.46 KB
/
Allocation.cpp
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
// Allocation.cpp
// Implements the Allocation class representing a single entry in the heap allocation tree
#include "Globals.h"
#include "Allocation.h"
Allocation::Allocation():
m_AllocationSize(0),
m_Type(atUnknown)
{
}
Allocation::Allocation(AllocationWeakPtr a_Parent):
m_Parent(a_Parent),
m_AllocationSize(0),
m_Type(atUnknown)
{
}
AllocationPtr Allocation::addChild()
{
auto res = std::make_shared<Allocation>(shared_from_this());
m_Children.push_back(res);
return res;
}
AllocationPtr Allocation::getParent()
{
return m_Parent.lock();
}
void Allocation::sortBySize()
{
// Sort the immediate children:
std::sort(m_Children.begin(), m_Children.end(), [](AllocationPtr & a_First, AllocationPtr & a_Second)
{
return (a_First->m_AllocationSize > a_Second->m_AllocationSize);
}
);
// Recursively sort grandchildren:
for (auto & a: m_Children)
{
a->sortBySize();
}
}
AllocationPtr Allocation::findCodeLocationChild(CodeLocation * a_CodeLocation)
{
for (const auto & ch: m_Children)
{
if (ch->getCodeLocation().get() == a_CodeLocation)
{
return ch;
}
}
return nullptr;
}
AllocationPtr Allocation::recursiveFindCodeLocationChild(CodeLocation * a_CodeLocation)
{
if (m_CodeLocation.get() == a_CodeLocation)
{
return shared_from_this();
}
for (const auto & ch: m_Children)
{
auto res = ch->recursiveFindCodeLocationChild(a_CodeLocation);
if (res != nullptr)
{
return res;
}
}
return nullptr;
}