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
|
//===--- DiverseStack.cpp - Out-of-line code for the heterogeneous stack --===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
//
// This file implements the small amount of code for the heterogeneous
// stack and list classes.
//
//===----------------------------------------------------------------------===//
#include "swift/Basic/Assertions.h"
#include "swift/Basic/DiverseList.h"
#include "swift/Basic/DiverseStack.h"
using namespace swift;
void DiverseStackBase::pushNewStorageSlow(std::size_t needed) {
bool wasInline = isAllocatedInline();
std::size_t capacity = End - Allocated;
std::size_t requiredCapacity = capacity + needed;
do {
capacity = 2 * capacity + 16;
} while (capacity < requiredCapacity);
assert(capacity % 16 == 0 && "not allocating multiple of alignment");
char *oldAllocation = Allocated;
char *oldBegin = Begin;
std::size_t oldSize = (std::size_t) (End - oldBegin);
Allocated = new char[capacity];
End = Allocated + capacity;
Begin = End - oldSize;
std::memcpy(Begin, oldBegin, oldSize);
Begin -= needed;
if (!wasInline) delete[] oldAllocation;
}
char *DiverseListBase::addNewStorageSlow(std::size_t needed) {
bool wasInline = isAllocatedInline();
std::size_t capacity = EndOfAllocation - Begin;
std::size_t requiredCapacity = capacity + needed;
do {
capacity = 2 * capacity + 16;
} while (capacity < requiredCapacity);
assert(capacity % 16 == 0 && "not allocating multiple of alignment");
char *oldBegin = Begin;
char *oldEnd = End;
std::size_t oldSize = (std::size_t) (oldEnd - oldBegin);
Begin = new char[capacity];
EndOfAllocation = Begin + capacity;
End = Begin + oldSize + needed;
std::memcpy(Begin, oldBegin, oldSize);
if (!wasInline) delete[] oldBegin;
return Begin + oldSize;
}
|
