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
|
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the MIT license.
// See the LICENSE file in the project root for more information.
#include <stdint.h>
#include <windows.h>
#include "debugmacros.h"
#include "iallocator.h"
#include "gcinfoarraylist.h"
#include "safemath.h"
inline size_t roundUp(size_t size, size_t alignment)
{
// `alignment` must be a power of two
assert(alignment != 0);
assert((alignment & (alignment - 1)) == 0);
return (size + (alignment - 1)) & ~(alignment - 1);
}
GcInfoArrayListBase::GcInfoArrayListBase(IAllocator* allocator)
: m_allocator(allocator),
m_firstChunk(nullptr),
m_lastChunk(nullptr),
m_lastChunkCount(0),
m_lastChunkCapacity(0),
m_itemCount(0)
{
assert(m_allocator != nullptr);
}
GcInfoArrayListBase::~GcInfoArrayListBase()
{
for (ChunkBase* list = m_firstChunk, *chunk; list != nullptr; list = chunk)
{
chunk = list->m_next;
m_allocator->Free(list);
}
}
void GcInfoArrayListBase::AppendNewChunk(size_t firstChunkCapacity, size_t elementSize, size_t chunkAlignment)
{
size_t chunkCapacity = (m_firstChunk == nullptr) ? firstChunkCapacity : (m_lastChunkCapacity * GrowthFactor);
S_SIZE_T chunkSize = S_SIZE_T(roundUp(sizeof(ChunkBase), chunkAlignment)) + (S_SIZE_T(elementSize) * S_SIZE_T(chunkCapacity));
assert(!chunkSize.IsOverflow());
ChunkBase* chunk = reinterpret_cast<ChunkBase*>(m_allocator->Alloc(chunkSize.Value()));
chunk->m_next = nullptr;
if (m_lastChunk != nullptr)
{
assert(m_firstChunk != nullptr);
m_lastChunk->m_next = chunk;
}
else
{
assert(m_lastChunk == nullptr);
m_firstChunk = chunk;
}
m_lastChunk = chunk;
m_lastChunkCount = 0;
m_lastChunkCapacity = chunkCapacity;
}
GcInfoArrayListBase::IteratorBase::IteratorBase(GcInfoArrayListBase* list, size_t firstChunkCapacity)
: m_list(list)
{
assert(m_list != nullptr);
// Note: if the list is empty, m_list->firstChunk == nullptr == m_list->lastChunk and m_lastChunkCount == 0.
// In that case, the next two lines will set m_currentChunk to nullptr and m_currentChunkCount to 0.
m_currentChunk = m_list->m_firstChunk;
m_currentChunkCount = (m_currentChunk == m_list->m_lastChunk) ? m_list->m_lastChunkCount : firstChunkCapacity;
}
GcInfoArrayListBase::ChunkBase* GcInfoArrayListBase::IteratorBase::GetNextChunk(size_t& elementCount)
{
if (m_currentChunk == nullptr)
{
elementCount = 0;
return nullptr;
}
ChunkBase* chunk = m_currentChunk;
elementCount = m_currentChunkCount;
m_currentChunk = m_currentChunk->m_next;
if (m_currentChunk == nullptr)
{
m_currentChunkCount = 0;
}
else if (m_currentChunk == m_list->m_lastChunk)
{
m_currentChunkCount = m_list->m_lastChunkCount;
}
else
{
m_currentChunkCount *= GrowthFactor;
}
return chunk;
}
|
