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
|
/*
* 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 "CEventLinkerChannel.h"
namespace Konclude {
namespace Concurrent {
CEventLinkerChannel::CEventLinkerChannel(CThreadActivator* threadActivator, double channelPriority) {
mThreadActivator = threadActivator;
mPostedEventLinker = nullptr;
mLastTakedPostEventLinker = nullptr;
mLastPostedEventLinker = nullptr;
mLastTakedDuplicatedPostEventLinker = nullptr;
acquiredLinkerCount = 0;
fetchedLinkerCount = 0;
postedLinkerCount = 0;
mChannelPriority = channelPriority;
}
CEventLinkerChannel::~CEventLinkerChannel() {
}
bool CEventLinkerChannel::checkPostEvent(CEvent* processingEvent) {
return processingEvent != mLastTakedPostEventLinker;
}
CEventChannel* CEventLinkerChannel::postEvent(CEvent* processingEvent) {
mLastPostedEventLinker = mPostedEventLinker;
CEventLinker* newEventPostLinker = processingEvent;
processingEvent->setEventChannelPriority(mChannelPriority);
//if (newEventPostLinker == mLastTakedPostEventLinker) {
// mLastTakedDuplicatedPostEventLinker = newEventPostLinker;
//}
if (mPostedEventLinker != newEventPostLinker) {
newEventPostLinker->initEventLinker(processingEvent,mPostedEventLinker);
mPostedEventLinker = newEventPostLinker;
} else {
// write access to mLastTakedPostEventLinker is safe only in this case
newEventPostLinker->initEventLinker(processingEvent,nullptr);
mPostedEventLinker = newEventPostLinker;
mLastTakedPostEventLinker = nullptr;
}
++postedLinkerCount;
mThreadActivator->signalizeEvent();
return this;
}
CEventLinker* CEventLinkerChannel::takeEvents(CEventLinker* addEventLinker) {
// reverse stored event order, take all events
CEventLinker* tmpEventPostLinker = mPostedEventLinker;
//bool duplicatedStopp = tmpEventPostLinker == mLastTakedDuplicatedPostEventLinker;
//mLastTakedDuplicatedPostEventLinker = nullptr;
CEventLinker* tmpNextLastPostEventLinker = tmpEventPostLinker;
CEventLinker* tmpAddEventLinker = nullptr;
while (tmpEventPostLinker && (tmpEventPostLinker != mLastTakedPostEventLinker /*|| duplicatedStopp*/)) {
//if (tmpEventPostLinker == mLastTakedPostEventLinker) {
// duplicatedStopp = false;
//}
tmpAddEventLinker = tmpEventPostLinker;
tmpEventPostLinker = tmpEventPostLinker->getNextEventLinker();
addEventLinker = tmpAddEventLinker->setNextEventLinker(addEventLinker);
++fetchedLinkerCount;
}
if (tmpNextLastPostEventLinker != mLastTakedPostEventLinker) {
mLastTakedPostEventLinker = tmpNextLastPostEventLinker;
}
return addEventLinker;
}
bool CEventLinkerChannel::hasEvents() {
return mLastTakedPostEventLinker != mPostedEventLinker;
}
double CEventLinkerChannel::getChannelPriority() {
return mChannelPriority;
}
}; // end namespace Concurrent
}; // end namespace Konclude
|
