Debian Codegraph @

Source/Reasoner/Kernel/Cache/CBackendRepresentativeMemoryLabelCacheItemCardinalityData.cpp

raw
1 /*
2 * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
3 *
4 * This file is part of the reasoning system Konclude.
5 * For details and support, see <http://konclude.com/>.
6 *
7 * Konclude is free software: you can redistribute it and/or modify
8 * it under the terms of version 3 of the GNU Lesser General Public
9 * License (LGPLv3) as published by the Free Software Foundation.
10 *
11 * Konclude is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU (Lesser) General Public License for more details.
15 *
16 * You should have received a copy of the GNU (Lesser) General Public
17 * License along with Konclude. If not, see <http://www.gnu.org/licenses/>.
18 *
19 */
20
21 #include "CBackendRepresentativeMemoryLabelCacheItemCardinalityData.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Kernel {
29
30 namespace Cache {
31
32
33 CBackendRepresentativeMemoryLabelCacheItemCardinalityData::CBackendRepresentativeMemoryLabelCacheItemCardinalityData() {
34 mExistentialMaxUsedCardinality.store(0);
35 mMinimumRestrictingCardinality.store(0);
36 }
37
38 CBackendRepresentativeMemoryLabelCacheItemCardinalityData* CBackendRepresentativeMemoryLabelCacheItemCardinalityData::initCardinalityData(cint64 existentialMaxUsedCardinality, cint64 minimumRestrictingCardinality) {
39 mExistentialMaxUsedCardinality.store(existentialMaxUsedCardinality);
40 mMinimumRestrictingCardinality.store(minimumRestrictingCardinality);
41 return this;
42 }
43
44 cint64 CBackendRepresentativeMemoryLabelCacheItemCardinalityData::getExistentialMaxUsedCardinality() {
45 return mExistentialMaxUsedCardinality;
46 }
47
48 CBackendRepresentativeMemoryLabelCacheItemCardinalityData* CBackendRepresentativeMemoryLabelCacheItemCardinalityData::updateExistentialMaxUsedCardinality(cint64 existentialMaxUsedCardinality) {
49 while (mExistentialMaxUsedCardinality < existentialMaxUsedCardinality) {
50 cint64 currentValue = mExistentialMaxUsedCardinality;
51 mExistentialMaxUsedCardinality.testAndSetOrdered(currentValue, existentialMaxUsedCardinality);
52 }
53 return this;
54 }
55
56 cint64 CBackendRepresentativeMemoryLabelCacheItemCardinalityData::getMinimumRestrictingCardinality() {
57 return mMinimumRestrictingCardinality;
58 }
59
60 CBackendRepresentativeMemoryLabelCacheItemCardinalityData* CBackendRepresentativeMemoryLabelCacheItemCardinalityData::updateMinimumRestrictingCardinality(cint64 minimumRestrictingCardinality) {
61 while (mMinimumRestrictingCardinality < minimumRestrictingCardinality) {
62 cint64 currentValue = mMinimumRestrictingCardinality;
63 mMinimumRestrictingCardinality.testAndSetOrdered(currentValue, minimumRestrictingCardinality);
64 }
65 return this;
66 }
67
68 }; // end namespace Cache
69
70 }; // end namespace Kernel
71
72 }; // end namespace Reasoner
73
74 }; // end namespace Konclude