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
|
/*
* 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
|
