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
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU (Lesser) General Public License for more details.
*
* You should have received a copy of the GNU (Lesser) General Public
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CEventLinkerQueue.h"
namespace Konclude {
namespace Concurrent {
CEventLinkerQueue::CEventLinkerQueue(CThreadActivator* threadActivator) {
mThreadActivator = threadActivator;
mDefaultEventChannel = new CSyncedEventChannel(this);
mReverseSortedChannelLinker = new CEventChannelLinker(mDefaultEventChannel);
mActivatorThreshold = 1;
mInexactEventSingnals = 0;
mThreadActivated = false;
}
CEventLinkerQueue::~CEventLinkerQueue() {
while (mReverseSortedChannelLinker) {
CEventChannelLinker* tmpDeleteChannel = mReverseSortedChannelLinker;
mReverseSortedChannelLinker = mReverseSortedChannelLinker->getNext();
delete tmpDeleteChannel->getData();
delete tmpDeleteChannel;
}
}
CSyncedEventChannel* CEventLinkerQueue::getDefaultSyncedEventChannel(double channelPriority) {
return mDefaultEventChannel;
}
CSyncedFreeEventChannel* CEventLinkerQueue::createSyncedFreeEventChannel(double channelPriority) {
mCreateChannelSyncMutex.lock();
CSyncedFreeEventChannel* tmpChannel = new CSyncedFreeEventChannel(this);
CEventChannelLinker* tmpChannelLinker = new CEventChannelLinker(tmpChannel);
mReverseSortedChannelLinker = mReverseSortedChannelLinker->insertSortedNextSorted(tmpChannelLinker);
mCreateChannelSyncMutex.unlock();
return tmpChannel;
}
CThreadActivator* CEventLinkerQueue::signalizeEvent() {
mInexactEventSingnals = mInexactEventSingnals+1;
if (mInexactEventSingnals >= mActivatorThreshold) {
if (true || !mThreadActivated) {
// may called multiple times
mThreadActivated = true;
if (mThreadActivator) {
mThreadActivator->signalizeEvent();
}
}
}
return this;
}
CEventLinker* CEventLinkerQueue::takeEvents(CEventLinker* addEventLinker, double minEventPriority) {
mThreadActivated = false;
mInexactEventSingnals = 0;
CEventChannelLinker* channelLinkerIt = mReverseSortedChannelLinker;
while (channelLinkerIt) {
CEventChannel *channel = channelLinkerIt->getData();
if (channel->getChannelPriority() >= minEventPriority) {
CEventLinkerChannel* linkerChannel = dynamic_cast<CEventLinkerChannel*>(channel);
if (linkerChannel) {
addEventLinker = linkerChannel->takeEvents(addEventLinker);
} else {
// take events step for step, currently not supported
}
}
channelLinkerIt = channelLinkerIt->getNext();
}
return addEventLinker;
}
bool CEventLinkerQueue::hasEvents(double minEventPriority) {
CEventChannelLinker* channelLinkerIt = mReverseSortedChannelLinker;
while (channelLinkerIt) {
CEventChannel *channel = channelLinkerIt->getData();
if (channel->getChannelPriority() >= minEventPriority && channel->hasEvents()) {
return true;
}
channelLinkerIt = channelLinkerIt->getNext();
}
return false;
}
}; // end namespace Concurrent
}; // end namespace Konclude
|
