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
|
/*
* Copyright (C) 2016 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "XLargeMap.h"
#include <utility>
namespace bmalloc {
XLargeRange XLargeMap::remove(size_t alignment, size_t size)
{
size_t alignmentMask = alignment - 1;
XLargeRange* candidate = m_free.end();
for (XLargeRange* it = m_free.begin(); it != m_free.end(); ++it) {
if (it->size() < size)
continue;
if (candidate != m_free.end() && candidate->begin() < it->begin())
continue;
if (test(it->begin(), alignmentMask)) {
char* aligned = roundUpToMultipleOf(alignment, it->begin());
if (aligned < it->begin()) // Check for overflow.
continue;
char* alignedEnd = aligned + size;
if (alignedEnd < aligned) // Check for overflow.
continue;
if (alignedEnd > it->end())
continue;
}
candidate = it;
}
if (candidate == m_free.end())
return XLargeRange();
return m_free.pop(candidate);
}
void XLargeMap::add(const XLargeRange& range)
{
XLargeRange merged = range;
for (size_t i = 0; i < m_free.size(); ++i) {
if (!canMerge(merged, m_free[i]))
continue;
merged = merge(merged, m_free.pop(i--));
}
m_free.push(merged);
}
} // namespace bmalloc
|