mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
1d961ba22d
Although I don't plan to bring over new assertions wholesale into the current qualification branch, it's entirely possible that various minor changes in main will use the new assertions; having this basic support in the release branch will simplify that. (This is why I'm adding the includes as a separate pass from rewriting the individual assertions)
72 lines
2.1 KiB
C++
72 lines
2.1 KiB
C++
//===--- 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;
|
|
}
|