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
|
/*
* Copyright (C) 2013, 2014, 2015 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 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* 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. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CReuseCompletionGraphCacheSlotItem.h"
namespace Konclude {
namespace Reasoner {
namespace Kernel {
namespace Cache {
CReuseCompletionGraphCacheSlotItem::CReuseCompletionGraphCacheSlotItem(CMemoryPool* memoryPool) : CLinkerBase<CReuseCompletionGraphCacheSlotItem*,CReuseCompletionGraphCacheSlotItem>(this),CMemoryPoolContainer(memoryPool) {
mReaderUsing = false;
mEntryHash = nullptr;
mEntyCount = 0;
}
bool CReuseCompletionGraphCacheSlotItem::incReader() {
if (mReaderSharingCount.ref()) {
mReaderUsing = true;
}
return true;
}
bool CReuseCompletionGraphCacheSlotItem::incReader(cint64 incCount) {
for (cint64 i = 0; i < incCount; ++i) {
incReader();
}
return mReaderUsing;
}
bool CReuseCompletionGraphCacheSlotItem::decReader() {
if (!mReaderSharingCount.deref()) {
mReaderUsing = false;
}
return mReaderUsing;
}
bool CReuseCompletionGraphCacheSlotItem::hasCacheReaders() {
return mReaderUsing;
}
CReuseCompletionGraphCacheSlotItem* CReuseCompletionGraphCacheSlotItem::setEntryHash(CReuseCompletionGraphCompatibilityEntryHash* hash) {
mEntryHash = hash;
return this;
}
CReuseCompletionGraphCompatibilityEntryHash* CReuseCompletionGraphCacheSlotItem::getEntryHash() {
return mEntryHash;
}
cint64 CReuseCompletionGraphCacheSlotItem::getEntryCount() {
return mEntyCount;
}
CReuseCompletionGraphCacheSlotItem* CReuseCompletionGraphCacheSlotItem::setEntryCount(cint64 entryCount) {
mEntyCount = entryCount;
return this;
}
}; // end namespace Cache
}; // end namespace Kernel
}; // end namespace Reasoner
}; // end namespace Konclude
|
