1 /* Icinga 2 | (c) 2012 Icinga GmbH | GPLv2+ */
2
3 #include "icinga/service.hpp"
4 #include "icinga/dependency.hpp"
5 #include "base/logger.hpp"
6
7 using namespace icinga;
8
AddDependency(const Dependency::Ptr & dep)9 void Checkable::AddDependency(const Dependency::Ptr& dep)
10 {
11 std::unique_lock<std::mutex> lock(m_DependencyMutex);
12 m_Dependencies.insert(dep);
13 }
14
RemoveDependency(const Dependency::Ptr & dep)15 void Checkable::RemoveDependency(const Dependency::Ptr& dep)
16 {
17 std::unique_lock<std::mutex> lock(m_DependencyMutex);
18 m_Dependencies.erase(dep);
19 }
20
GetDependencies() const21 std::vector<Dependency::Ptr> Checkable::GetDependencies() const
22 {
23 std::unique_lock<std::mutex> lock(m_DependencyMutex);
24 return std::vector<Dependency::Ptr>(m_Dependencies.begin(), m_Dependencies.end());
25 }
26
AddReverseDependency(const Dependency::Ptr & dep)27 void Checkable::AddReverseDependency(const Dependency::Ptr& dep)
28 {
29 std::unique_lock<std::mutex> lock(m_DependencyMutex);
30 m_ReverseDependencies.insert(dep);
31 }
32
RemoveReverseDependency(const Dependency::Ptr & dep)33 void Checkable::RemoveReverseDependency(const Dependency::Ptr& dep)
34 {
35 std::unique_lock<std::mutex> lock(m_DependencyMutex);
36 m_ReverseDependencies.erase(dep);
37 }
38
GetReverseDependencies() const39 std::vector<Dependency::Ptr> Checkable::GetReverseDependencies() const
40 {
41 std::unique_lock<std::mutex> lock(m_DependencyMutex);
42 return std::vector<Dependency::Ptr>(m_ReverseDependencies.begin(), m_ReverseDependencies.end());
43 }
44
IsReachable(DependencyType dt,Dependency::Ptr * failedDependency,int rstack) const45 bool Checkable::IsReachable(DependencyType dt, Dependency::Ptr *failedDependency, int rstack) const
46 {
47 /* Anything greater than 256 causes recursion bus errors. */
48 int limit = 256;
49
50 if (rstack > limit) {
51 Log(LogWarning, "Checkable")
52 << "Too many nested dependencies (>" << limit << ") for checkable '" << GetName() << "': Dependency failed.";
53
54 return false;
55 }
56
57 for (const Checkable::Ptr& checkable : GetParents()) {
58 if (!checkable->IsReachable(dt, failedDependency, rstack + 1))
59 return false;
60 }
61
62 /* implicit dependency on host if this is a service */
63 const auto *service = dynamic_cast<const Service *>(this);
64 if (service && (dt == DependencyState || dt == DependencyNotification)) {
65 Host::Ptr host = service->GetHost();
66
67 if (host && host->GetState() != HostUp && host->GetStateType() == StateTypeHard) {
68 if (failedDependency)
69 *failedDependency = nullptr;
70
71 return false;
72 }
73 }
74
75 auto deps = GetDependencies();
76
77 int countDeps = deps.size();
78 int countFailed = 0;
79
80 for (const Dependency::Ptr& dep : deps) {
81 if (!dep->IsAvailable(dt)) {
82 countFailed++;
83
84 if (failedDependency)
85 *failedDependency = dep;
86 }
87 }
88
89 /* If there are dependencies, and all of them failed, mark as unreachable. */
90 if (countDeps > 0 && countFailed == countDeps) {
91 Log(LogDebug, "Checkable")
92 << "All dependencies have failed for checkable '" << GetName() << "': Marking as unreachable.";
93
94 return false;
95 }
96 if (failedDependency)
97 *failedDependency = nullptr;
98
99 return true;
100 }
101
GetParents() const102 std::set<Checkable::Ptr> Checkable::GetParents() const
103 {
104 std::set<Checkable::Ptr> parents;
105
106 for (const Dependency::Ptr& dep : GetDependencies()) {
107 Checkable::Ptr parent = dep->GetParent();
108
109 if (parent && parent.get() != this)
110 parents.insert(parent);
111 }
112
113 return parents;
114 }
115
GetChildren() const116 std::set<Checkable::Ptr> Checkable::GetChildren() const
117 {
118 std::set<Checkable::Ptr> parents;
119
120 for (const Dependency::Ptr& dep : GetReverseDependencies()) {
121 Checkable::Ptr service = dep->GetChild();
122
123 if (service && service.get() != this)
124 parents.insert(service);
125 }
126
127 return parents;
128 }
129
GetAllChildren() const130 std::set<Checkable::Ptr> Checkable::GetAllChildren() const
131 {
132 std::set<Checkable::Ptr> children = GetChildren();
133
134 GetAllChildrenInternal(children, 0);
135
136 return children;
137 }
138
GetAllChildrenInternal(std::set<Checkable::Ptr> & children,int level) const139 void Checkable::GetAllChildrenInternal(std::set<Checkable::Ptr>& children, int level) const
140 {
141 if (level > 32)
142 return;
143
144 std::set<Checkable::Ptr> localChildren;
145
146 for (const Checkable::Ptr& checkable : children) {
147 std::set<Checkable::Ptr> cChildren = checkable->GetChildren();
148
149 if (!cChildren.empty()) {
150 GetAllChildrenInternal(cChildren, level + 1);
151 localChildren.insert(cChildren.begin(), cChildren.end());
152 }
153
154 localChildren.insert(checkable);
155 }
156
157 children.insert(localChildren.begin(), localChildren.end());
158 }
159