Debian Codegraph @

Source/Reasoner/Kernel/Process/Dependency/CNonDeterministicDependencyTrackPoint.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 "CNonDeterministicDependencyTrackPoint.h"
22 #include "CBranchTreeNode.h"
23
24
25 namespace Konclude {
26
27 namespace Reasoner {
28
29 namespace Kernel {
30
31 namespace Process {
32
33 namespace Dependency {
34
35
36 CNonDeterministicDependencyTrackPoint::CNonDeterministicDependencyTrackPoint(CDependencyNode* depNode) : CDependencyTrackPoint(depNode),CLinkerBase<CNonDeterministicDependencyTrackPoint*,CNonDeterministicDependencyTrackPoint>(this) {
37 mBranchNode = nullptr;
38 mClashes = nullptr;
39 mClashedIrelevant = false;
40 mInvolvedIndiLinker = nullptr;
41 }
42
43
44 CNonDeterministicDependencyTrackPoint* CNonDeterministicDependencyTrackPoint::initBranch(CBranchTreeNode* branchNode) {
45 mBranchNode = branchNode;
46 addMaximumBranchingTagCandidate(mBranchNode->getBranchingLevel());
47 return this;
48 }
49
50
51 CClashedDependencyDescriptor* CNonDeterministicDependencyTrackPoint::getClashes() {
52 return mClashes;
53 }
54
55 CNonDeterministicDependencyTrackPoint* CNonDeterministicDependencyTrackPoint::addClashes(CClashedDependencyDescriptor* clashes, bool setClashed) {
56 if (clashes) {
57 mClashes = clashes->append(mClashes);
58 mClashedIrelevant |= setClashed;
59 }
60 return this;
61 }
62
63 CNonDeterministicDependencyTrackPoint* CNonDeterministicDependencyTrackPoint::setClashes(CClashedDependencyDescriptor* clashes, bool setClashed) {
64 mClashes = clashes;
65 mClashedIrelevant |= setClashed;
66 return this;
67 }
68
69 CBranchTreeNode* CNonDeterministicDependencyTrackPoint::getBranchNode() {
70 return mBranchNode;
71 }
72
73 bool CNonDeterministicDependencyTrackPoint::isClashedOrIrelevantBranch() {
74 return mClashedIrelevant;
75 }
76
77
78 CNonDeterministicDependencyTrackPoint* CNonDeterministicDependencyTrackPoint::setClashedOrIrelevantBranch(bool clashedOrIrelevant) {
79 mClashedIrelevant = clashedOrIrelevant;
80 return this;
81 }
82
83
84 CXLinker<cint64>* CNonDeterministicDependencyTrackPoint::getInvolvedIndividualIdsLinker() {
85 return mInvolvedIndiLinker;
86 }
87
88
89 CNonDeterministicDependencyTrackPoint* CNonDeterministicDependencyTrackPoint::setInvolvedIndividualIdsLinker(CXLinker<cint64>* linker) {
90 mInvolvedIndiLinker = linker;
91 return this;
92 }
93
94
95
96 }; // end namespace Dependency
97
98 }; // end namespace Process
99
100 }; // end namespace Kernel
101
102 }; // end namespace Reasoner
103
104 }; // end namespace Konclude