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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/*
* Copyright (C) 2017-2020 Intel Corporation
*
* SPDX-License-Identifier: MIT
*
*/
#include "opencl/source/event/async_events_handler.h"
#include "shared/source/helpers/timestamp_packet.h"
#include "shared/source/os_interface/os_thread.h"
#include "opencl/source/event/event.h"
#include <iterator>
namespace NEO {
AsyncEventsHandler::AsyncEventsHandler() {
allowAsyncProcess = false;
registerList.reserve(64);
list.reserve(64);
pendingList.reserve(64);
}
AsyncEventsHandler::~AsyncEventsHandler() {
closeThread();
}
void AsyncEventsHandler::registerEvent(Event *event) {
std::unique_lock<std::mutex> lock(asyncMtx);
//Create on first use
openThread();
event->incRefInternal();
registerList.push_back(event);
asyncCond.notify_one();
}
Event *AsyncEventsHandler::processList() {
uint32_t lowestTaskCount = CompletionStamp::notReady;
Event *sleepCandidate = nullptr;
pendingList.clear();
for (auto event : list) {
event->updateExecutionStatus();
if (event->peekHasCallbacks() || (event->isExternallySynchronized() && (event->peekExecutionStatus() > CL_COMPLETE))) {
pendingList.push_back(event);
if (event->peekTaskCount() < lowestTaskCount) {
sleepCandidate = event;
lowestTaskCount = event->peekTaskCount();
}
} else {
event->decRefInternal();
}
}
list.swap(pendingList);
return sleepCandidate;
}
void *AsyncEventsHandler::asyncProcess(void *arg) {
auto self = reinterpret_cast<AsyncEventsHandler *>(arg);
std::unique_lock<std::mutex> lock(self->asyncMtx, std::defer_lock);
Event *sleepCandidate = nullptr;
while (true) {
lock.lock();
self->transferRegisterList();
if (!self->allowAsyncProcess) {
self->processList();
self->releaseEvents();
break;
}
if (self->list.empty()) {
self->asyncCond.wait(lock);
}
lock.unlock();
sleepCandidate = self->processList();
if (sleepCandidate) {
sleepCandidate->wait(true, true);
}
std::this_thread::yield();
}
return nullptr;
}
void AsyncEventsHandler::closeThread() {
std::unique_lock<std::mutex> lock(asyncMtx);
if (allowAsyncProcess) {
allowAsyncProcess = false;
asyncCond.notify_one();
lock.unlock();
thread.get()->join();
thread.reset(nullptr);
}
}
void AsyncEventsHandler::openThread() {
if (!thread.get()) {
DEBUG_BREAK_IF(allowAsyncProcess);
allowAsyncProcess = true;
thread = Thread::create(asyncProcess, reinterpret_cast<void *>(this));
}
}
void AsyncEventsHandler::transferRegisterList() {
std::move(registerList.begin(), registerList.end(), std::back_inserter(list));
registerList.clear();
}
void AsyncEventsHandler::releaseEvents() {
for (auto event : list) {
event->decRefInternal();
}
list.clear();
UNRECOVERABLE_IF(!registerList.empty()) // transferred before release
}
} // namespace NEO
|
