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
|
/*
* Copyright 2014 Kevin Funk <kfunk@kde.org>
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of
* the License or (at your option) version 3 or any later version
* accepted by the membership of KDE e.V. (or its successor approved
* by the membership of KDE e.V.), which shall act as a proxy
* defined in Section 14 of version 3 of the license.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "macrodefinition.h"
#include <language/duchain/appendedlist.h>
#include <language/duchain/declarationdata.h>
using namespace KDevelop;
DEFINE_LIST_MEMBER_HASH(MacroDefinitionData, parameters, IndexedString)
class MacroDefinitionData : public DeclarationData
{
public:
MacroDefinitionData()
: isFunctionLike(false)
{
initializeAppendedLists();
}
MacroDefinitionData(const MacroDefinitionData& rhs)
: DeclarationData(rhs)
, definition(rhs.definition)
, isFunctionLike(rhs.isFunctionLike)
{
initializeAppendedLists();
copyListsFrom(rhs);
}
~MacroDefinitionData()
{
freeAppendedLists();
}
IndexedString definition;
bool isFunctionLike : 1;
START_APPENDED_LISTS_BASE(MacroDefinitionData, DeclarationData);
APPENDED_LIST_FIRST(MacroDefinitionData, IndexedString, parameters);
END_APPENDED_LISTS(MacroDefinitionData, parameters);
};
MacroDefinition::MacroDefinition(const MacroDefinition& rhs)
: Declaration(*new MacroDefinitionData(*rhs.d_func()))
{
}
MacroDefinition::MacroDefinition(MacroDefinitionData& data)
: Declaration(data)
{
}
MacroDefinition::MacroDefinition(const RangeInRevision& range, DUContext* context )
: Declaration(*new MacroDefinitionData, range)
{
d_func_dynamic()->setClassId(this);
setKind(Declaration::Macro);
if(context)
setContext(context);
}
MacroDefinition::~MacroDefinition()
{
}
IndexedString MacroDefinition::definition() const
{
return d_func()->definition;
}
void MacroDefinition::setDefinition(const IndexedString& definition)
{
d_func_dynamic()->definition = definition;
}
bool MacroDefinition::isFunctionLike() const
{
return d_func()->isFunctionLike;
}
void MacroDefinition::setFunctionLike(bool isFunctionLike)
{
d_func_dynamic()->isFunctionLike = isFunctionLike;
}
const IndexedString* MacroDefinition::parameters() const
{
return d_func()->parameters();
}
unsigned int MacroDefinition::parametersSize() const
{
return d_func()->parametersSize();
}
void MacroDefinition::addParameter(const IndexedString& str)
{
d_func_dynamic()->parametersList().append(str);
}
void MacroDefinition::clearParameters()
{
d_func_dynamic()->parametersList().clear();
}
QString MacroDefinition::toString() const
{
return i18n("Macro %1", identifier().toString());
}
DUCHAIN_DEFINE_TYPE(MacroDefinition)
|
