forked from pydio/cells
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree-patch-filters.go
355 lines (321 loc) · 11.1 KB
/
tree-patch-filters.go
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
347
348
349
350
351
352
353
354
355
/*
* Copyright (c) 2019. Abstrium SAS <team (at) pydio.com>
* This file is part of Pydio Cells.
*
* Pydio Cells is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Pydio Cells 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 Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with Pydio Cells. If not, see <http://www.gnu.org/licenses/>.
*
* The latest code can be found at <https://pydio.com>.
*/
package merger
import (
"context"
"time"
"github.com/gobwas/glob"
"github.com/pydio/cells/common/log"
"go.uber.org/zap"
"github.com/pborman/uuid"
"github.com/pydio/cells/common/proto/tree"
"github.com/pydio/cells/common/sync/model"
)
func (t *TreePatch) Filter(ctx context.Context, ignores ...glob.Glob) {
n := time.Now()
defer func() {
log.Logger(ctx).Info("Filtering TreePatch took", zap.Duration("time", time.Now().Sub(n)), t.zapSource(), t.zapTarget())
}()
track := func(s string, t time.Time) time.Time {
log.Logger(ctx).Debug(s, zap.Duration("time", time.Now().Sub(t)))
return time.Now()
}
// FILTER CREATES : tries to detect fast create/delete operations and remove unnecessary creates
t.filterCreateFiles(ctx)
n = track("filter:CreateFiles", n)
t.filterCreateFolders(ctx)
n = track("filter:CreateFolders", n)
// FILTER MOVES : tries to match Creates / Deletes operation that are in fact Moves
var cachedTarget model.PathSyncSource
if len(t.deletes) > 20 {
// Build a fake patch from the deletes to easily detect top level modified branches
temp := &TreePatch{
AbstractPatch: AbstractPatch{uuid: uuid.New(), source: t.Source(), target: t.Target()},
TreeNode: *NewTree(),
}
for _, d := range t.deletes {
c := d.Clone()
if c.GetNode() == nil {
c.SetNode(&tree.Node{Path: c.GetRefPath()})
}
temp.QueueOperation(c)
}
// if Target implements CachedBranchProvider, try to load these branches from the target at once
// to avoid multiple calls to LoadNode()
if cache, ok := temp.CachedBranchFromEndpoint(ctx, t.Target()); ok {
cachedTarget = cache
n = track("filter:loaded branch from target in memory", n)
}
}
t.detectFolderMoves(ctx, cachedTarget)
n = track("filter:DetectFolderMoves", n)
t.detectFileMoves(ctx, cachedTarget)
n = track("filter:DetectFileMoves", n)
// ENQUEUE REMAINING operations to patch
t.enqueueRemaining(ctx)
n = track("filter:EnqueueRemaining", n)
// RESCAN CREATED FOLDERS if the Endpoint declares this as necessary
t.rescanFoldersIfRequired(ctx, ignores...)
n = track("filter:RescanFoldersIfRequired", n)
// FINALLY PRUNE unecessary operations (like all deleted elements that are below a deleted folder)
t.prune(ctx)
track("filter:Prune", n)
}
func (t *TreePatch) filterCreateFiles(ctx context.Context) {
checksumProvider, isCsProvider := t.Source().(model.ChecksumProvider)
for _, createEvent := range t.createFiles {
node, err := createEvent.NodeFromSource(ctx)
if err != nil {
delete(t.createFiles, createEvent.GetRefPath())
if _, exists := t.deletes[createEvent.GetRefPath()]; exists {
delete(t.deletes, createEvent.GetRefPath())
}
continue
}
if node.Uuid == "" && !model.IsFolderHiddenFile(node.Path) {
t.refreshUUIDs[createEvent.GetRefPath()] = createEvent
}
if model.NodeRequiresChecksum(node) && isCsProvider {
checksumProvider.ComputeChecksum(node)
}
}
}
func (t *TreePatch) filterCreateFolders(ctx context.Context) {
var existingFolders map[string][]*tree.Node
var refresher model.UuidFoldersRefresher
var ok bool
if refresher, ok = t.Source().(model.UuidFoldersRefresher); ok && len(t.createFolders) > 0 {
if c, e := refresher.ExistingFolders(ctx); e == nil {
existingFolders = c
}
}
for _, createOp := range t.createFolders {
if _, err := createOp.NodeFromSource(ctx); err != nil {
delete(t.createFolders, createOp.GetRefPath())
if _, exists := t.deletes[createOp.GetRefPath()]; exists {
delete(t.deletes, createOp.GetRefPath())
}
continue
}
if refresher != nil && existingFolders != nil {
if _, ok := existingFolders[createOp.GetNode().Uuid]; ok {
// There is a duplicate - update Uuid
refreshNode := createOp.GetNode().Clone()
refreshNode.Uuid = uuid.New()
if newNode, err := refresher.UpdateFolderUuid(ctx, refreshNode); err == nil {
createOp.SetNode(newNode)
}
}
}
}
}
func (t *TreePatch) detectFileMoves(ctx context.Context, cachedTarget model.PathSyncSource) {
movesByEtag := make(map[string][]*Move)
for _, deleteOp := range t.deletes {
if dbNode, found := deleteOp.NodeInTarget(ctx, cachedTarget); found {
deleteOp.SetNode(dbNode)
if dbNode.IsLeaf() {
var found bool
// Look by UUID first
for _, opCreate := range t.createFiles {
if opCreate.GetNode() != nil && opCreate.GetNode().Uuid != "" && opCreate.GetNode().Uuid == dbNode.Uuid {
// Now remove from delete/create
delete(t.deletes, deleteOp.GetRefPath())
delete(t.createFiles, opCreate.GetRefPath())
// Enqueue Update if Etag differ
if opCreate.GetNode().Etag != "" && opCreate.GetNode().Etag != dbNode.Etag {
updateOp := deleteOp.Clone(OpUpdateFile)
updateOp.AttachToPatch(t)
t.QueueOperation(updateOp)
}
// Enqueue in moves if path differ
if opCreate.GetNode().Path != dbNode.Path {
log.Logger(ctx).Debug("Existing leaf node with uuid and different path: safe move to ", opCreate.GetNode().ZapPath())
opCreate.SetNode(dbNode)
opCreate.UpdateType(OpMoveFile)
opCreate.AttachToPatch(t)
t.QueueOperation(opCreate)
}
found = true
break
}
}
// Look by Etag
if !found {
for _, createOp := range t.createFiles {
if createOp.GetNode() != nil && createOp.GetNode().Etag == dbNode.Etag {
log.Logger(ctx).Debug("Existing leaf node with same ETag: enqueuing possible move", createOp.GetNode().ZapPath())
move := &Move{
deleteOp: deleteOp,
createOp: createOp,
dbNode: dbNode,
}
movesByEtag[dbNode.Etag] = append(movesByEtag[dbNode.Etag], move)
}
}
}
}
} else {
_, createFileExists := t.createFiles[deleteOp.GetRefPath()]
_, createFolderExists := t.createFolders[deleteOp.GetRefPath()]
if createFileExists || createFolderExists {
// There was a create & remove in the same patch, on a non indexed node.
// We are not sure of the order, Stat the file.
existNode, _ := deleteOp.NodeFromSource(ctx)
if existNode == nil {
// File does not exist finally, ignore totally
if createFileExists {
delete(t.createFiles, deleteOp.GetRefPath())
}
if createFolderExists {
delete(t.createFolders, deleteOp.GetRefPath())
}
}
}
// Remove from delete anyway : node is not in the index
delete(t.deletes, deleteOp.GetRefPath())
}
}
var moves []*Move
for _, etagMoves := range movesByEtag {
if len(etagMoves) > 1 {
moves = append(moves, sortClosestMoves(etagMoves)...)
} else {
moves = append(moves, etagMoves...)
}
}
for _, move := range moves {
log.Logger(ctx).Debug("Picked closest move", zap.Object("move", move))
// Remove from deletes/creates
delete(t.deletes, move.deleteOp.GetRefPath())
delete(t.createFiles, move.createOp.GetRefPath())
// Enqueue in move if Paths differ
if move.createOp.GetNode().Path != move.dbNode.Path {
move.createOp.SetNode(move.dbNode)
move.createOp.UpdateType(OpMoveFile)
t.QueueOperation(move.createOp)
}
}
}
func (t *TreePatch) detectFolderMoves(ctx context.Context, cachedTarget model.PathSyncSource) {
sorted := t.sortedKeys(t.deletes)
//target, ok := model.AsPathSyncTarget(t.Target())
for _, k := range sorted {
deleteOp, still := t.deletes[k]
if !still {
// May have been deleted during the process
continue
}
//localPath := deleteOp.GetRefPath()
dbNode, found := deleteOp.NodeInTarget(ctx, cachedTarget)
/*
if deleteOp.GetNode() != nil {
// If deleteEvent has node, it is already loaded from a snapshot,
// no need to reload from target
dbNode = deleteOp.GetNode()
} else if ok {
dbNode, _ = target.LoadNode(deleteOp.CreateContext(ctx), localPath)
log.Logger(ctx).Debug("Looking for node in index", zap.Any("path", localPath), zap.Any("dbNode", dbNode))
}
*/
if !found || dbNode.IsLeaf() {
continue
}
for _, opCreate := range t.createFolders {
log.Logger(ctx).Debug("Checking if DeleteFolder is inside CreateFolder by comparing Uuids: ", opCreate.GetNode().Zap(), dbNode.Zap())
if opCreate.GetNode().Uuid == dbNode.Uuid {
log.Logger(ctx).Debug("Existing folder with hash: this is a move", zap.String("etag", dbNode.Uuid), zap.String("path", dbNode.Path))
opCreate.SetNode(dbNode)
opCreate.UpdateType(OpMoveFolder)
t.QueueOperation(opCreate)
delete(t.deletes, deleteOp.GetRefPath())
delete(t.createFolders, opCreate.GetRefPath())
break
}
}
}
}
func (t *TreePatch) enqueueRemaining(ctx context.Context) {
for _, c := range t.createFolders {
t.QueueOperation(c)
}
for _, c := range t.createFiles {
t.QueueOperation(c)
}
for _, c := range t.deletes {
t.QueueOperation(c)
}
}
func (t *TreePatch) rescanFoldersIfRequired(ctx context.Context, ignores ...glob.Glob) {
if t.options.NoRescan || !t.Source().GetEndpointInfo().RequiresFoldersRescan {
return
}
var newFolders bool
var newFiles bool
t.WalkToFirstOperations(OpCreateFolder, func(op Operation) {
if op.IsScanEvent() {
return
}
log.Logger(ctx).Info("Rescanning folder to be sure...", zap.String("patch", t.Target().GetEndpointInfo().URI), zap.String("path", op.GetRefPath()))
// Rescan folder content, events below may not have been detected
var visit = func(path string, node *tree.Node, err error) {
if err != nil {
log.Logger(ctx).Error("Error while rescanning folder ", zap.Error(err))
return
}
if !model.IsIgnoredFile(path, ignores...) {
scanEvent := model.NodeToEventInfo(ctx, path, node, model.EventCreate)
opType := OpCreateFolder
if node.IsLeaf() {
newFiles = true
opType = OpCreateFile
} else {
newFolders = true
}
t.Enqueue(NewOperation(opType, scanEvent, node))
}
return
}
t.Source().Walk(visit, op.GetRefPath(), true)
log.Logger(ctx).Info("Finished rescanning folder")
})
// Re-perform filters on new resources
if newFolders {
t.filterCreateFolders(ctx)
}
if newFiles {
t.filterCreateFiles(ctx)
}
if newFolders || newFiles {
t.enqueueRemaining(ctx)
}
}
func (t *TreePatch) prune(ctx context.Context) {
t.Walk(func(n *TreeNode) (prune bool) {
if n.PruneIdentityPathOperation() {
log.Logger(ctx).Debug("Pruning node operation as it will result to identiy", zap.Any("n", n))
}
if n.PathOperation != nil && n.PathOperation.Type() == OpDelete && !n.IsLeaf() {
log.Logger(ctx).Debug("Delete folder found, remove all branch underneath!", n.ZapPath())
prune = true
}
return
})
}