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
72
73
74
|
/*
* Copyright (C) 2018-2020 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "opencl/source/mem_obj/map_operations_handler.h"
#include "shared/source/helpers/ptr_math.h"
using namespace NEO;
size_t MapOperationsHandler::size() const {
std::lock_guard<std::mutex> lock(mtx);
return mappedPointers.size();
}
bool MapOperationsHandler::add(void *ptr, size_t ptrLength, cl_map_flags &mapFlags, MemObjSizeArray &size, MemObjOffsetArray &offset, uint32_t mipLevel) {
std::lock_guard<std::mutex> lock(mtx);
MapInfo mapInfo(ptr, ptrLength, size, offset, mipLevel);
mapInfo.readOnly = (mapFlags == CL_MAP_READ);
if (isOverlapping(mapInfo)) {
return false;
}
mappedPointers.push_back(mapInfo);
return true;
}
bool MapOperationsHandler::isOverlapping(MapInfo &inputMapInfo) {
if (inputMapInfo.readOnly) {
return false;
}
auto inputStartPtr = inputMapInfo.ptr;
auto inputEndPtr = ptrOffset(inputStartPtr, inputMapInfo.ptrLength);
for (auto &mapInfo : mappedPointers) {
auto mappedStartPtr = mapInfo.ptr;
auto mappedEndPtr = ptrOffset(mappedStartPtr, mapInfo.ptrLength);
// Requested ptr starts before or inside existing ptr range and overlapping end
if (inputStartPtr < mappedEndPtr && inputEndPtr >= mappedStartPtr) {
return true;
}
}
return false;
}
bool MapOperationsHandler::find(void *mappedPtr, MapInfo &outMapInfo) {
std::lock_guard<std::mutex> lock(mtx);
for (auto &mapInfo : mappedPointers) {
if (mapInfo.ptr == mappedPtr) {
outMapInfo = mapInfo;
return true;
}
}
return false;
}
void MapOperationsHandler::remove(void *mappedPtr) {
std::lock_guard<std::mutex> lock(mtx);
auto endIter = mappedPointers.end();
for (auto it = mappedPointers.begin(); it != endIter; it++) {
if (it->ptr == mappedPtr) {
std::iter_swap(it, mappedPointers.end() - 1);
mappedPointers.pop_back();
break;
}
}
}
|
