72 lines
2.6 KiB
C++
72 lines
2.6 KiB
C++
/*
|
|
* Copyright (C) 2018-2021 Intel Corporation
|
|
*
|
|
* SPDX-License-Identifier: MIT
|
|
*
|
|
*/
|
|
|
|
namespace NEO {
|
|
|
|
template <>
|
|
inline uintptr_t PageTable<void, 0, 9>::map(uintptr_t vm, size_t size, uint64_t entryBits, uint32_t memoryBank) {
|
|
return 0;
|
|
}
|
|
|
|
template <>
|
|
inline size_t PageTable<void, 0, 9>::getBits() {
|
|
return 9;
|
|
}
|
|
|
|
template <>
|
|
inline void PageTable<void, 0, 9>::pageWalk(uintptr_t vm, size_t size, size_t offset, uint64_t entryBits, PageWalker &pageWalker, uint32_t memoryBank) {
|
|
}
|
|
|
|
template <class T, uint32_t level, uint32_t bits>
|
|
inline uintptr_t PageTable<T, level, bits>::map(uintptr_t vm, size_t size, uint64_t entryBits, uint32_t memoryBank) {
|
|
const size_t shift = T::getBits() + 12;
|
|
const uintptr_t mask = static_cast<uintptr_t>(maxNBitValue(bits));
|
|
size_t indexStart = (vm >> shift) & mask;
|
|
size_t indexEnd = ((vm + size - 1) >> shift) & mask;
|
|
uintptr_t res = -1;
|
|
uintptr_t vmMask = (uintptr_t(-1) >> (sizeof(void *) * 8 - shift - bits));
|
|
auto maskedVm = vm & vmMask;
|
|
|
|
for (size_t index = indexStart; index <= indexEnd; index++) {
|
|
uintptr_t vmStart = (uintptr_t(1) << shift) * index;
|
|
vmStart = std::max(vmStart, maskedVm);
|
|
uintptr_t vmEnd = (uintptr_t(1) << shift) * (index + 1) - 1;
|
|
vmEnd = std::min(vmEnd, maskedVm + size - 1);
|
|
|
|
if (entries[index] == nullptr) {
|
|
entries[index] = new T(allocator);
|
|
}
|
|
res = std::min((entries[index])->map(vmStart, vmEnd - vmStart + 1, entryBits, memoryBank), res);
|
|
}
|
|
return res;
|
|
}
|
|
|
|
template <class T, uint32_t level, uint32_t bits>
|
|
inline void PageTable<T, level, bits>::pageWalk(uintptr_t vm, size_t size, size_t offset, uint64_t entryBits, PageWalker &pageWalker, uint32_t memoryBank) {
|
|
const size_t shift = T::getBits() + 12;
|
|
const uintptr_t mask = static_cast<uintptr_t>(maxNBitValue(bits));
|
|
size_t indexStart = (vm >> shift) & mask;
|
|
size_t indexEnd = ((vm + size - 1) >> shift) & mask;
|
|
uintptr_t vmMask = (uintptr_t(-1) >> (sizeof(void *) * 8 - shift - bits));
|
|
auto maskedVm = vm & vmMask;
|
|
|
|
for (size_t index = indexStart; index <= indexEnd; index++) {
|
|
uintptr_t vmStart = (uintptr_t(1) << shift) * index;
|
|
vmStart = std::max(vmStart, maskedVm);
|
|
uintptr_t vmEnd = (uintptr_t(1) << shift) * (index + 1) - 1;
|
|
vmEnd = std::min(vmEnd, maskedVm + size - 1);
|
|
|
|
if (entries[index] == nullptr) {
|
|
entries[index] = new T(allocator);
|
|
}
|
|
entries[index]->pageWalk(vmStart, vmEnd - vmStart + 1, offset, entryBits, pageWalker, memoryBank);
|
|
|
|
offset += (vmEnd - vmStart + 1);
|
|
}
|
|
}
|
|
} // namespace NEO
|