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
195
196
197
|
/* This file is part of KDevelop
Copyright 2007 David Nolden <david.nolden@kdevelop.org>
Copyright 2009 Lior Mualem <lior.m.kde@gmail.com>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License version 2 as published by the Free Software Foundation.
This library 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. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "classdeclaration.h"
#include "identifier.h"
#include <language/duchain/declaration.h>
#include <language/duchain/appendedlist.h>
#include <language/duchain/duchainregister.h>
#include "types/structuretype.h"
#include <debug.h>
namespace KDevelop {
DEFINE_LIST_MEMBER_HASH(ClassDeclarationData, baseClasses, BaseClassInstance)
ClassDeclaration::ClassDeclaration(const KDevelop::RangeInRevision& range, DUContext* context)
: ClassMemberDeclaration(*new ClassDeclarationData, range)
{
d_func_dynamic()->setClassId(this);
setContext(context);
}
ClassDeclaration::ClassDeclaration(ClassDeclarationData& data, const KDevelop::RangeInRevision& range,
DUContext* context)
: ClassMemberDeclaration(data, range)
{
setContext(context);
}
ClassDeclaration::ClassDeclaration(ClassDeclarationData& data)
: ClassMemberDeclaration(data)
{
}
REGISTER_DUCHAIN_ITEM(ClassDeclaration);
void ClassDeclaration::clearBaseClasses()
{
d_func_dynamic()->baseClassesList().clear();
}
uint ClassDeclaration::baseClassesSize() const
{
return d_func()->baseClassesSize();
}
const BaseClassInstance* ClassDeclaration::baseClasses() const
{
return d_func()->baseClasses();
}
void ClassDeclaration::addBaseClass(const BaseClassInstance& klass)
{
d_func_dynamic()->baseClassesList().append(klass);
}
void ClassDeclaration::replaceBaseClass(uint n, const BaseClassInstance& klass)
{
Q_ASSERT(n <= d_func()->baseClassesSize());
d_func_dynamic()->baseClassesList()[n] = klass;
}
ClassDeclaration::~ClassDeclaration()
{
}
ClassDeclaration::ClassDeclaration(const ClassDeclaration& rhs)
: ClassMemberDeclaration(*new ClassDeclarationData(*rhs.d_func()))
{
d_func_dynamic()->setClassId(this);
}
Declaration* ClassDeclaration::clonePrivate() const
{
return new ClassDeclaration(*this);
}
namespace {
bool isPublicBaseClassInternal(const ClassDeclaration* self, ClassDeclaration* base,
const KDevelop::TopDUContext* topContext,
int* baseConversionLevels, int depth, QSet<const ClassDeclaration*>* checked)
{
if (checked) {
if (checked->contains(self))
return false;
checked->insert(self);
} else if (depth > 3) {
//Too much depth, to prevent endless recursion, we control the recursion using the 'checked' set
QSet<const ClassDeclaration*> checkedSet;
return isPublicBaseClassInternal(self, base, topContext, baseConversionLevels, depth, &checkedSet);
}
if (baseConversionLevels)
*baseConversionLevels = 0;
if (self->indexedType() == base->indexedType())
return true;
FOREACH_FUNCTION(const BaseClassInstance &b, self->baseClasses)
{
if (baseConversionLevels)
++(*baseConversionLevels);
//qCDebug(LANGUAGE) << "public base of" << c->toString() << "is" << b.baseClass->toString();
if (b.access != KDevelop::Declaration::Private) {
int nextBaseConversion = 0;
if (StructureType::Ptr c = b.baseClass.type<StructureType>()) {
auto* decl = dynamic_cast<ClassDeclaration*>(c->declaration(topContext));
if (decl &&
isPublicBaseClassInternal(decl, base, topContext, &nextBaseConversion, depth + 1, checked)) {
if (baseConversionLevels)
*baseConversionLevels += nextBaseConversion;
return true;
}
}
}
if (baseConversionLevels)
--(*baseConversionLevels);
}
return false;
}
}
bool ClassDeclaration::isPublicBaseClass(ClassDeclaration* base, const KDevelop::TopDUContext* topContext,
int* baseConversionLevels) const
{
return isPublicBaseClassInternal(this, base, topContext, baseConversionLevels, 0, nullptr);
}
QString ClassDeclaration::toString() const
{
QString ret;
switch (classModifier()) {
case ClassDeclarationData::None:
//nothing
break;
case ClassDeclarationData::Abstract:
ret += QLatin1String("abstract ");
break;
case ClassDeclarationData::Final:
ret += QLatin1String("final ");
break;
}
switch (classType()) {
case ClassDeclarationData::Class:
ret += QLatin1String("class ");
break;
case ClassDeclarationData::Interface:
ret += QLatin1String("interface ");
break;
case ClassDeclarationData::Trait:
ret += QLatin1String("trait ");
break;
case ClassDeclarationData::Union:
ret += QLatin1String("union ");
break;
case ClassDeclarationData::Struct:
ret += QLatin1String("struct ");
break;
}
return ret + identifier().toString();
}
ClassDeclarationData::ClassType ClassDeclaration::classType() const
{
return d_func()->m_classType;
}
void ClassDeclaration::setClassType(ClassDeclarationData::ClassType type)
{
d_func_dynamic()->m_classType = type;
}
ClassDeclarationData::ClassModifier ClassDeclaration::classModifier() const
{
return d_func()->m_classModifier;
}
void ClassDeclaration::setClassModifier(ClassDeclarationData::ClassModifier modifier)
{
d_func_dynamic()->m_classModifier = modifier;
}
}
|
