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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <Eris/TypeInfo.h>
#include <Eris/Log.h>
#include <Eris/Exceptions.h>
#include <Atlas/Objects/Root.h>
#include <Atlas/Objects/Operation.h>
#include <Atlas/Objects/Entity.h>
#include <Atlas/Objects/objectFactory.h>
#include <cassert>
using Atlas::Objects::Root;
using namespace Atlas::Objects::Operation;
namespace Eris {
////////////////////////////////////////////////////////////////////////////////////////////////////////
TypeInfo::TypeInfo(const std::string &id, TypeService *ts) :
m_bound(false),
m_name(id),
m_atlasClassNo(0),
m_moveCount(0),
m_typeService(ts)
{
if (m_name == "root")
m_bound = true; // root node is always bound
}
TypeInfo::TypeInfo(const Root &atype, TypeService *ts) :
m_bound(false),
m_name(atype->getId()),
m_moveCount(0),
m_typeService(ts)
{
if (m_name == "root") m_bound = true; // root node is always bound
processTypeData(atype);
}
bool TypeInfo::isA(TypeInfoPtr tp)
{
if (!m_bound) warning() << "calling isA on unbound type " << m_name;
// uber fast short-circuit for type equality
if (tp == this) return true;
return m_ancestors.count(tp); // non-authorative if not bound
}
bool TypeInfo::hasUnresolvedChildren() const
{
return !m_unresolvedChildren.empty();
}
void TypeInfo::resolveChildren()
{
if (m_unresolvedChildren.empty()) {
error() << "Type " << m_name << " has no unresolved children";
return;
}
StringSet uchildren(m_unresolvedChildren);
for (StringSet::const_iterator it = uchildren.begin(); it != uchildren.end(); ++it) {
addChild(m_typeService->getTypeByName(*it));
}
assert(m_unresolvedChildren.empty());
}
#pragma mark -
void TypeInfo::processTypeData(const Root &atype)
{
if (atype->getId() != m_name) {
error() << "mis-targeted INFO operation for " << atype->getId() << " arrived at " << m_name;
return;
}
const StringList& parents(atype->getParents());
for (StringList::const_iterator P = parents.begin(); P != parents.end(); ++P)
addParent(m_typeService->getTypeByName(*P));
if (atype->hasAttr("children"))
{
const Atlas::Message::Element childElem(atype->getAttr("children"));
const Atlas::Message::ListType & children(childElem.asList());
for (Atlas::Message::ListType::const_iterator C = children.begin(); C != children.end(); ++C) {
TypeInfo* child = m_typeService->findTypeByName(C->asString());
// if the child was already known, don't add to unresolved
if (child && m_children.count(child)) continue;
m_unresolvedChildren.insert(C->asString());
}
}
validateBind();
}
bool TypeInfo::operator==(const TypeInfo &x) const
{
if (m_typeService != x.m_typeService)
warning() << "comparing TypeInfos from different type services, bad";
return (m_name == x.m_name);
}
bool TypeInfo::operator<(const TypeInfo &x) const
{
return m_name < x.m_name;
}
void TypeInfo::addParent(TypeInfoPtr tp)
{
if (m_parents.count(tp))
{
// it's critcial we bail fast here to avoid infitite mutual recursion with addChild
return;
}
if (m_ancestors.count(tp))
error() << "Adding " << tp->m_name << " as parent of " << m_name << ", but already marked as ancestor";
// update the gear
m_parents.insert(tp);
addAncestor(tp);
// note this will never recurse deep becuase of the fast exiting up top
tp->addChild(this);
}
void TypeInfo::addChild(TypeInfoPtr tp)
{
if (tp == this) {
error() << "Attempt to add " << getName() << " as a child if itself";
return;
}
if (tp->getName() == this->getName()) {
error() << "Attempt to add " << getName() << " as child to identical parent ";
return;
}
if (m_children.count(tp)) return;
m_unresolvedChildren.erase(tp->getName());
m_children.insert(tp);
// again this will not recurse due to the termination code
tp->addParent(this);
}
void TypeInfo::addAncestor(TypeInfoPtr tp)
{
// someone has reported getting into a loop here (i.e a circular inheritance
// graph). To try and catch that, I'm putting this assert in. If / when you
// hit it, get in touch with James.
assert(m_children.count(tp) == 0);
assert(m_ancestors.count(tp) == 0);
m_ancestors.insert(tp);
const TypeInfoSet& parentAncestors = tp->m_ancestors;
m_ancestors.insert(parentAncestors.begin(), parentAncestors.end());
// tell all our childen!
for (TypeInfoSet::iterator C=m_children.begin(); C!=m_children.end();++C) {
(*C)->addAncestor(tp);
}
}
void TypeInfo::validateBind()
{
if (m_bound) return;
// check all our parents
for (TypeInfoSet::iterator P=m_parents.begin(); P!=m_parents.end();++P) {
if (!(*P)->isBound()) return;
}
m_bound = true;
Bound.emit(this);
m_typeService->BoundType.emit(this);
for (TypeInfoSet::iterator C=m_children.begin(); C!=m_children.end();++C) {
(*C)->validateBind();
}
}
} // of namespace Eris
|
