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
198
199
200
201
202
203
204
205
206
207
|
/*
SPDX-FileCopyrightText: 2008 David Nolden <david.nolden.kdevelop@art-master.de>
SPDX-License-Identifier: LGPL-2.0-only
*/
#include "uses.h"
#include "declarationid.h"
#include "duchainpointer.h"
#include "serialization/itemrepository.h"
#include "topducontext.h"
namespace KDevelop {
DEFINE_LIST_MEMBER_HASH(UsesItem, uses, IndexedTopDUContext)
class UsesItem
{
public:
UsesItem()
{
initializeAppendedLists();
}
UsesItem(const UsesItem& rhs, bool dynamic = true) : declaration(rhs.declaration)
{
initializeAppendedLists(dynamic);
copyListsFrom(rhs);
}
~UsesItem()
{
freeAppendedLists();
}
UsesItem& operator=(const UsesItem& rhs) = delete;
unsigned int hash() const
{
//We only compare the declaration. This allows us implementing a map, although the item-repository
//originally represents a set.
return declaration.hash();
}
unsigned int itemSize() const
{
return dynamicSize();
}
uint classSize() const
{
return sizeof(UsesItem);
}
DeclarationId declaration;
START_APPENDED_LISTS(UsesItem);
APPENDED_LIST_FIRST(UsesItem, IndexedTopDUContext, uses);
END_APPENDED_LISTS(UsesItem, uses);
};
class UsesRequestItem
{
public:
UsesRequestItem(const UsesItem& item) : m_item(item)
{
}
enum {
AverageSize = 30 //This should be the approximate average size of an Item
};
unsigned int hash() const
{
return m_item.hash();
}
uint itemSize() const
{
return m_item.itemSize();
}
void createItem(UsesItem* item) const
{
new (item) UsesItem(m_item, false);
}
static void destroy(UsesItem* item, KDevelop::AbstractItemRepository&)
{
item->~UsesItem();
}
static bool persistent(const UsesItem* /*item*/)
{
return true;
}
bool equals(const UsesItem* item) const
{
return m_item.declaration == item->declaration;
}
const UsesItem& m_item;
};
// Maps declaration-ids to Uses
using UsesRepo = ItemRepository<UsesItem, UsesRequestItem>;
template<>
class ItemRepositoryFor<Uses>
{
friend struct LockedItemRepository;
static UsesRepo& repo()
{
static QMutex mutex;
static UsesRepo repo { QStringLiteral("Use Map"), &mutex };
return repo;
}
};
Uses::Uses()
{
LockedItemRepository::initialize<Uses>();
}
void Uses::addUse(const DeclarationId& id, const IndexedTopDUContext& use)
{
UsesItem item;
item.declaration = id;
item.usesList().append(use);
UsesRequestItem request(item);
LockedItemRepository::write<Uses>([&](UsesRepo& repo) {
uint index = repo.findIndex(item);
if (index) {
// Check whether the item is already in the mapped list, else copy the list into the new created item
const UsesItem* oldItem = repo.itemFromIndex(index);
for (unsigned int a = 0; a < oldItem->usesSize(); ++a) {
if (oldItem->uses()[a] == use)
return; // Already there
item.usesList().append(oldItem->uses()[a]);
}
repo.deleteItem(index);
}
// This inserts the changed item
repo.index(request);
});
}
void Uses::removeUse(const DeclarationId& id, const IndexedTopDUContext& use)
{
UsesItem item;
item.declaration = id;
UsesRequestItem request(item);
LockedItemRepository::write<Uses>([&](UsesRepo& repo) {
uint index = repo.findIndex(item);
if (index) {
// Check whether the item is already in the mapped list, else copy the list into the new created item
const UsesItem* oldItem = repo.itemFromIndex(index);
for (unsigned int a = 0; a < oldItem->usesSize(); ++a)
if (!(oldItem->uses()[a] == use))
item.usesList().append(oldItem->uses()[a]);
repo.deleteItem(index);
Q_ASSERT(repo.findIndex(item) == 0);
// This inserts the changed item
if (item.usesSize() != 0)
repo.index(request);
}
});
}
bool Uses::hasUses(const DeclarationId& id) const
{
UsesItem item;
item.declaration = id;
return LockedItemRepository::read<Uses>([&item](const UsesRepo& repo) {
return static_cast<bool>(repo.findIndex(item));
});
}
KDevVarLengthArray<IndexedTopDUContext> Uses::uses(const DeclarationId& id) const
{
KDevVarLengthArray<IndexedTopDUContext> ret;
UsesItem item;
item.declaration = id;
UsesRequestItem request(item);
LockedItemRepository::read<Uses>([&](const UsesRepo& repo) {
uint index = repo.findIndex(item);
if (index) {
const UsesItem* repositoryItem = repo.itemFromIndex(index);
FOREACH_FUNCTION(const IndexedTopDUContext& decl, repositoryItem->uses)
ret.append(decl);
}
});
return ret;
}
}
|
