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
|
// Copyright 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.
#include "sync/syncable/syncable_util.h"
#include "base/base64.h"
#include "base/location.h"
#include "base/logging.h"
#include "base/sha1.h"
#include "sync/syncable/directory.h"
#include "sync/syncable/entry.h"
#include "sync/syncable/mutable_entry.h"
#include "sync/syncable/syncable_id.h"
#include "sync/syncable/syncable_write_transaction.h"
namespace syncer {
namespace syncable {
// Returns the number of unsynced entries.
int GetUnsyncedEntries(BaseTransaction* trans,
std::vector<int64> *handles) {
trans->directory()->GetUnsyncedMetaHandles(trans, handles);
DVLOG_IF(1, !handles->empty()) << "Have " << handles->size()
<< " unsynced items.";
return handles->size();
}
bool IsLegalNewParent(BaseTransaction* trans, const Id& entry_id,
const Id& new_parent_id) {
if (entry_id.IsRoot())
return false;
// we have to ensure that the entry is not an ancestor of the new parent.
Id ancestor_id = new_parent_id;
while (!ancestor_id.IsRoot()) {
if (entry_id == ancestor_id)
return false;
Entry new_parent(trans, GET_BY_ID, ancestor_id);
if (!SyncAssert(new_parent.good(),
FROM_HERE,
"Invalid new parent",
trans))
return false;
ancestor_id = new_parent.GetParentId();
}
return true;
}
void ChangeEntryIDAndUpdateChildren(
BaseWriteTransaction* trans,
ModelNeutralMutableEntry* entry,
const Id& new_id) {
Id old_id = entry->GetId();
if (!entry->PutId(new_id)) {
Entry old_entry(trans, GET_BY_ID, new_id);
CHECK(old_entry.good());
LOG(FATAL) << "Attempt to change ID to " << new_id
<< " conflicts with existing entry.\n\n"
<< *entry << "\n\n" << old_entry;
}
if (entry->GetIsDir()) {
// Get all child entries of the old id.
Directory::Metahandles children;
trans->directory()->GetChildHandlesById(trans, old_id, &children);
Directory::Metahandles::iterator i = children.begin();
while (i != children.end()) {
ModelNeutralMutableEntry child_entry(trans, GET_BY_HANDLE, *i++);
CHECK(child_entry.good());
// Use the unchecked setter here to avoid touching the child's
// UNIQUE_POSITION field. In this case, UNIQUE_POSITION among the
// children will be valid after the loop, since we update all the children
// at once.
child_entry.PutParentIdPropertyOnly(new_id);
}
}
}
// Function to handle runtime failures on syncable code. Rather than crashing,
// if the |condition| is false the following will happen:
// 1. Sets unrecoverable error on transaction.
// 2. Returns false.
bool SyncAssert(bool condition,
const tracked_objects::Location& location,
const char* msg,
BaseTransaction* trans) {
if (!condition) {
trans->OnUnrecoverableError(location, msg);
return false;
}
return true;
}
std::string GenerateSyncableHash(
ModelType model_type, const std::string& client_tag) {
// Blank PB with just the field in it has termination symbol,
// handy for delimiter.
sync_pb::EntitySpecifics serialized_type;
AddDefaultFieldValue(model_type, &serialized_type);
std::string hash_input;
serialized_type.AppendToString(&hash_input);
hash_input.append(client_tag);
std::string encode_output;
base::Base64Encode(base::SHA1HashString(hash_input), &encode_output);
return encode_output;
}
std::string GenerateSyncableBookmarkHash(
const std::string& originator_cache_guid,
const std::string& originator_client_item_id) {
return syncable::GenerateSyncableHash(
BOOKMARKS, originator_cache_guid + originator_client_item_id);
}
} // namespace syncable
} // namespace syncer
|
