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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
|
/*
* Copyright (C) 2014 Aaron Seigo <aseigo@kde.org>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 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 6 of version 3 of the license.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "pipeline.h"
#include <QByteArray>
#include <QStandardPaths>
#include <QVector>
#include <QUuid>
#include <QDebug>
#include "entity_generated.h"
#include "metadata_generated.h"
#include "createentity_generated.h"
#include "entitybuffer.h"
#include "async/src/async.h"
#include "log.h"
namespace Akonadi2
{
class Pipeline::Private
{
public:
Private(const QString &resourceName)
: storage(QStandardPaths::writableLocation(QStandardPaths::GenericDataLocation) + "/akonadi2/storage", resourceName, Storage::ReadWrite),
stepScheduled(false)
{
}
Storage storage;
QHash<QString, QVector<Preprocessor *> > nullPipeline;
QHash<QString, QVector<Preprocessor *> > newPipeline;
QHash<QString, QVector<Preprocessor *> > modifiedPipeline;
QHash<QString, QVector<Preprocessor *> > deletedPipeline;
QVector<PipelineState> activePipelines;
bool stepScheduled;
};
Pipeline::Pipeline(const QString &resourceName, QObject *parent)
: QObject(parent),
d(new Private(resourceName))
{
}
Pipeline::~Pipeline()
{
delete d;
}
void Pipeline::setPreprocessors(const QString &entityType, Type pipelineType, const QVector<Preprocessor *> &preprocessors)
{
switch (pipelineType) {
case NewPipeline:
d->newPipeline[entityType] = preprocessors;
break;
case ModifiedPipeline:
d->modifiedPipeline[entityType] = preprocessors;
break;
case DeletedPipeline:
d->deletedPipeline[entityType] = preprocessors;
break;
default:
break;
};
}
Storage &Pipeline::storage() const
{
return d->storage;
}
void Pipeline::null()
{
//TODO: is there really any need for the null pipeline? if so, it should be doing something ;)
// PipelineState state(this, NullPipeline, QByteArray(), d->nullPipeline);
// d->activePipelines << state;
// state.step();
}
KAsync::Job<void> Pipeline::newEntity(void const *command, size_t size)
{
Log() << "Pipeline: New Entity";
//TODO toRFC4122 would probably be more efficient, but results in non-printable keys.
const auto key = QUuid::createUuid().toString().toUtf8();
const qint64 newRevision = storage().maxRevision() + 1;
{
flatbuffers::Verifier verifyer(reinterpret_cast<const uint8_t *>(command), size);
if (!Akonadi2::Commands::VerifyCreateEntityBuffer(verifyer)) {
qWarning() << "invalid buffer, not a create entity buffer";
return KAsync::error<void>();
}
}
auto createEntity = Akonadi2::Commands::GetCreateEntity(command);
//TODO rename createEntitiy->domainType to bufferType
const QString entityType = QString::fromUtf8(reinterpret_cast<char const*>(createEntity->domainType()->Data()), createEntity->domainType()->size());
{
flatbuffers::Verifier verifyer(reinterpret_cast<const uint8_t *>(createEntity->delta()->Data()), createEntity->delta()->size());
if (!Akonadi2::VerifyEntityBuffer(verifyer)) {
qWarning() << "invalid buffer, not an entity buffer";
return KAsync::error<void>();
}
}
auto entity = Akonadi2::GetEntity(createEntity->delta()->Data());
//Add metadata buffer
flatbuffers::FlatBufferBuilder metadataFbb;
auto metadataBuilder = Akonadi2::MetadataBuilder(metadataFbb);
metadataBuilder.add_revision(newRevision);
metadataBuilder.add_processed(false);
auto metadataBuffer = metadataBuilder.Finish();
Akonadi2::FinishMetadataBuffer(metadataFbb, metadataBuffer);
//TODO we should reserve some space in metadata for in-place updates
flatbuffers::FlatBufferBuilder fbb;
EntityBuffer::assembleEntityBuffer(fbb, metadataFbb.GetBufferPointer(), metadataFbb.GetSize(), entity->resource()->Data(), entity->resource()->size(), entity->local()->Data(), entity->local()->size());
storage().write(key.data(), key.size(), fbb.GetBufferPointer(), fbb.GetSize());
storage().setMaxRevision(newRevision);
Log() << "Pipeline: wrote entity: "<< newRevision;
return KAsync::start<void>([this, key, entityType](KAsync::Future<void> &future) {
PipelineState state(this, NewPipeline, key, d->newPipeline[entityType], [&future]() {
future.setFinished();
});
d->activePipelines << state;
state.step();
});
}
void Pipeline::modifiedEntity(const QString &entityType, const QByteArray &key, void *data, size_t size)
{
PipelineState state(this, ModifiedPipeline, key, d->modifiedPipeline[entityType], [](){});
d->activePipelines << state;
state.step();
}
void Pipeline::deletedEntity(const QString &entityType, const QByteArray &key)
{
PipelineState state(this, DeletedPipeline, key, d->deletedPipeline[entityType], [](){});
d->activePipelines << state;
state.step();
}
void Pipeline::pipelineStepped(const PipelineState &state)
{
scheduleStep();
}
void Pipeline::scheduleStep()
{
if (!d->stepScheduled) {
d->stepScheduled = true;
QMetaObject::invokeMethod(this, "stepPipelines", Qt::QueuedConnection);
}
}
void Pipeline::stepPipelines()
{
d->stepScheduled = false;
for (PipelineState &state: d->activePipelines) {
if (state.isIdle()) {
state.step();
}
}
}
void Pipeline::pipelineCompleted(PipelineState state)
{
//TODO finalize the datastore, inform clients of the new rev
const int index = d->activePipelines.indexOf(state);
if (index > -1) {
d->activePipelines.remove(index);
}
state.callback();
if (state.type() != NullPipeline) {
//TODO what revision is finalized?
emit revisionUpdated();
}
scheduleStep();
if (d->activePipelines.isEmpty()) {
emit pipelinesDrained();
}
}
class PipelineState::Private : public QSharedData
{
public:
Private(Pipeline *p, Pipeline::Type t, const QByteArray &k, QVector<Preprocessor *> filters, const std::function<void()> &c)
: pipeline(p),
type(t),
key(k),
filterIt(filters),
idle(true),
callback(c)
{}
Private()
: pipeline(0),
filterIt(QVector<Preprocessor *>()),
idle(true)
{}
Pipeline *pipeline;
Pipeline::Type type;
QByteArray key;
QVectorIterator<Preprocessor *> filterIt;
bool idle;
std::function<void()> callback;
};
PipelineState::PipelineState()
: d(new Private())
{
}
PipelineState::PipelineState(Pipeline *pipeline, Pipeline::Type type, const QByteArray &key, const QVector<Preprocessor *> &filters, const std::function<void()> &callback)
: d(new Private(pipeline, type, key, filters, callback))
{
}
PipelineState::PipelineState(const PipelineState &other)
: d(other.d)
{
}
PipelineState::~PipelineState()
{
}
PipelineState &PipelineState::operator=(const PipelineState &rhs)
{
d = rhs.d;
return *this;
}
bool PipelineState::operator==(const PipelineState &rhs)
{
return d == rhs.d;
}
bool PipelineState::isIdle() const
{
return d->idle;
}
QByteArray PipelineState::key() const
{
return d->key;
}
Pipeline::Type PipelineState::type() const
{
return d->type;
}
void PipelineState::step()
{
if (!d->pipeline) {
Q_ASSERT(false);
return;
}
d->idle = false;
if (d->filterIt.hasNext()) {
//TODO skip step if already processed
//FIXME error handling if no result is found
auto preprocessor = d->filterIt.next();
d->pipeline->storage().scan(d->key, [this, preprocessor](void *keyValue, int keySize, void *dataValue, int dataSize) -> bool {
auto entity = Akonadi2::GetEntity(dataValue);
preprocessor->process(*this, *entity);
return false;
}, [this](const Akonadi2::Storage::Error &error) {
ErrorMsg() << "Failed to find value in pipeline: " << error.message;
d->pipeline->pipelineCompleted(*this);
});
} else {
//This object becomes invalid after this call
d->pipeline->pipelineCompleted(*this);
}
}
void PipelineState::processingCompleted(Preprocessor *filter)
{
//TODO record processing progress
if (d->pipeline && filter == d->filterIt.peekPrevious()) {
d->idle = true;
d->pipeline->pipelineStepped(*this);
}
}
void PipelineState::callback()
{
d->callback();
}
Preprocessor::Preprocessor()
: d(0)
{
}
Preprocessor::~Preprocessor()
{
}
void Preprocessor::process(const PipelineState &state, const Akonadi2::Entity &)
{
processingCompleted(state);
}
void Preprocessor::processingCompleted(PipelineState state)
{
state.processingCompleted(this);
}
QString Preprocessor::id() const
{
return QLatin1String("unknown processor");
}
} // namespace Akonadi2
|