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
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef COMPONENTS_SYNC_ENGINE_IMPL_UPDATE_APPLICATOR_H_
#define COMPONENTS_SYNC_ENGINE_IMPL_UPDATE_APPLICATOR_H_
#include <stdint.h>
#include <set>
#include <vector>
#include "base/macros.h"
#include "components/sync/engine/model_safe_worker.h"
#include "components/sync/syncable/syncable_id.h"
namespace syncer {
class Cryptographer;
namespace syncable {
class WriteTransaction;
class Entry;
}
// An UpdateApplicator is used to iterate over a number of unapplied updates,
// applying them to the client using the given syncer cycle.
//
// UpdateApplicator might resemble an iterator, but it actually keeps retrying
// failed updates until no remaining updates can be successfully applied.
class UpdateApplicator {
public:
explicit UpdateApplicator(Cryptographer* cryptographer);
~UpdateApplicator();
// Attempt to apply the specified updates.
void AttemptApplications(syncable::WriteTransaction* trans,
const std::vector<int64_t>& handles);
int updates_applied() { return updates_applied_; }
int encryption_conflicts() { return encryption_conflicts_; }
int hierarchy_conflicts() { return hierarchy_conflicts_; }
const std::set<syncable::Id>& simple_conflict_ids() {
return simple_conflict_ids_;
}
private:
// If true, AttemptOneApplication will skip over |entry| and return true.
bool SkipUpdate(const syncable::Entry& entry);
// Used to decrypt sensitive sync nodes.
Cryptographer* cryptographer_;
int updates_applied_;
int encryption_conflicts_;
int hierarchy_conflicts_;
std::set<syncable::Id> simple_conflict_ids_;
DISALLOW_COPY_AND_ASSIGN(UpdateApplicator);
};
} // namespace syncer
#endif // COMPONENTS_SYNC_ENGINE_IMPL_UPDATE_APPLICATOR_H_
|
