compute-runtime/shared/source/memory_manager/alignment_selector.cpp

62 lines
2.3 KiB
C++

/*
* Copyright (C) 2021 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "alignment_selector.h"
#include "shared/source/helpers/aligned_memory.h"
#include "shared/source/helpers/debug_helpers.h"
#include <algorithm>
#include <cstring>
namespace NEO {
bool operator==(const AlignmentSelector::CandidateAlignment &lhs, const AlignmentSelector::CandidateAlignment &rhs) {
return std::tie(lhs.alignment, lhs.applyForSmallerSize, lhs.heap, lhs.maxMemoryWastage) ==
std::tie(rhs.alignment, rhs.applyForSmallerSize, rhs.heap, rhs.maxMemoryWastage);
}
void AlignmentSelector::addCandidateAlignment(size_t alignment, bool applyForSmallerSize, float maxMemoryWastage) {
this->addCandidateAlignment(alignment, applyForSmallerSize, maxMemoryWastage, HeapIndex::TOTAL_HEAPS);
}
void AlignmentSelector::addCandidateAlignment(size_t alignment, bool applyForSmallerSize, float maxMemoryWastage, HeapIndex heap) {
UNRECOVERABLE_IF(alignment == 0);
UNRECOVERABLE_IF((alignment & (alignment - 1)) != 0); // must be power of 2
CandidateAlignment candidateAlignment{};
candidateAlignment.alignment = alignment;
candidateAlignment.applyForSmallerSize = applyForSmallerSize;
candidateAlignment.maxMemoryWastage = maxMemoryWastage;
candidateAlignment.heap = heap;
this->candidateAlignments.push_back(std::move(candidateAlignment));
const auto comparator = [](const CandidateAlignment &left, const CandidateAlignment &right) {
return left.alignment > right.alignment;
};
std::sort(this->candidateAlignments.begin(), this->candidateAlignments.end(), comparator);
}
AlignmentSelector::CandidateAlignment AlignmentSelector::selectAlignment(size_t size) const {
for (const CandidateAlignment &candidateAlignment : this->candidateAlignments) {
if (!candidateAlignment.applyForSmallerSize && size < candidateAlignment.alignment) {
continue;
}
const size_t alignedSize = alignUp(size, candidateAlignment.alignment);
const size_t wastedMemory = alignedSize - size;
const size_t maxWastedMemory = static_cast<size_t>(alignedSize * candidateAlignment.maxMemoryWastage);
if (wastedMemory > maxWastedMemory) {
continue;
}
return candidateAlignment;
}
UNRECOVERABLE_IF(true);
}
} // namespace NEO