blob: f77657d2b80450ff70783c638d33a35b54caaa67 (
plain)
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
// 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 "stdafx.h"
#include "arraylist.h"
#include "utilcode.h"
#include "ex.h"
//
// ArrayList is a simple class which is used to contain a growable
// list of pointers, stored in chunks. Modification is by appending
// only currently. Access is by index (efficient if the number of
// elements stays small) and iteration (efficient in all cases).
//
// An important property of an ArrayList is that the list remains
// coherent while it is being modified (appended to). This means that readers
// never need to lock when accessing it. (Locking is necessary among multiple
// writers, however.)
//
void ArrayListBase::Clear()
{
CONTRACTL
{
NOTHROW;
FORBID_FAULT;
}
CONTRACTL_END
ArrayListBlock *block = m_firstBlock.m_next;
while (block != NULL)
{
ArrayListBlock *next = block->m_next;
delete [] block;
block = next;
}
m_firstBlock.m_next = 0;
m_count = 0;
}
PTR_VOID * ArrayListBase::GetPtr(DWORD index) const
{
STATIC_CONTRACT_NOTHROW;
STATIC_CONTRACT_FORBID_FAULT;
STATIC_CONTRACT_CANNOT_TAKE_LOCK;
SUPPORTS_DAC;
_ASSERTE(index < m_count);
ArrayListBlock *b = (ArrayListBlock*)&m_firstBlock;
while (index >= b->m_blockSize)
{
PREFIX_ASSUME(b->m_next != NULL);
index -= b->m_blockSize;
b = b->m_next;
}
return b->m_array + index;
}
#ifndef DACCESS_COMPILE
HRESULT ArrayListBase::Append(void *element)
{
CONTRACTL
{
NOTHROW;
INJECT_FAULT(return E_OUTOFMEMORY;);
}
CONTRACTL_END
ArrayListBlock *b = (ArrayListBlock*)&m_firstBlock;
DWORD count = m_count;
while (count >= b->m_blockSize)
{
count -= b->m_blockSize;
if (b->m_next == NULL)
{
_ASSERTE(count == 0);
DWORD nextSize = b->m_blockSize * 2;
ArrayListBlock *bNew = (ArrayListBlock *)
new (nothrow) BYTE [sizeof(ArrayListBlock) + nextSize * sizeof(void*)];
if (bNew == NULL)
return E_OUTOFMEMORY;
bNew->m_next = NULL;
bNew->m_blockSize = nextSize;
b->m_next = bNew;
}
b = b->m_next;
}
b->m_array[count] = element;
m_count++;
return S_OK;
}
#endif // #ifndef DACCESS_COMPILE
DWORD ArrayListBase::FindElement(DWORD start, PTR_VOID element) const
{
CONTRACTL
{
NOTHROW;
FORBID_FAULT;
}
CONTRACTL_END
DWORD index = start;
_ASSERTE(index <= m_count);
ArrayListBlock *b = (ArrayListBlock*)&m_firstBlock;
//
// Skip to the block containing start.
// index should be the index of start in the block.
//
while (b != NULL && index >= b->m_blockSize)
{
index -= b->m_blockSize;
b = b->m_next;
}
//
// Adjust start to be the index of the start of the block
//
start -= index;
//
// Compute max number of entries from the start of the block
//
DWORD max = m_count - start;
while (b != NULL)
{
//
// Compute end of search in this block - either end of the block
// or end of the array
//
DWORD blockMax;
if (max < b->m_blockSize)
blockMax = max;
else
blockMax = b->m_blockSize;
//
// Scan for element, until the end.
//
while (index < blockMax)
{
if (b->m_array[index] == element)
return start + index;
index++;
}
//
// Otherwise, increment block start index, decrement max count,
// reset index, and go to the next block (if any)
//
start += b->m_blockSize;
max -= b->m_blockSize;
index = 0;
b = b->m_next;
}
return (DWORD) NOT_FOUND;
}
BOOL ArrayListBase::Iterator::Next()
{
LIMITED_METHOD_DAC_CONTRACT;
++m_index;
if (m_index >= m_remaining)
return FALSE;
if (m_index >= m_block->m_blockSize)
{
m_remaining -= m_block->m_blockSize;
m_index -= m_block->m_blockSize;
m_total += m_block->m_blockSize;
m_block = m_block->m_next;
}
return TRUE;
}
#ifdef DACCESS_COMPILE
void
ArrayListBase::EnumMemoryRegions(CLRDataEnumMemoryFlags flags)
{
SUPPORTS_DAC;
// Assume that 'this' is enumerated, either explicitly
// or because this class is embedded in another.
PTR_ArrayListBlock block = m_firstBlock.m_next;
while (block.IsValid())
{
block.EnumMem();
block = block->m_next;
}
}
#endif // #ifdef DACCESS_COMPILE
|
