/
ancestors.go
113 lines (106 loc) · 3.53 KB
/
ancestors.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
/*
* Copyright (c) 2019-2021. 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 views
import (
"context"
"fmt"
"io"
"path"
"strings"
"google.golang.org/grpc/status"
"github.com/pydio/cells/common/proto/tree"
)
// BuildAncestorsList uses ListNodes with "Ancestors" flag to build the list of parent nodes.
// It uses an internal short-lived cache to throttle calls to the TreeService
func BuildAncestorsList(ctx context.Context, treeClient tree.NodeProviderClient, node *tree.Node) (parentUuids []*tree.Node, err error) {
/*
sT := time.Now()
defer func() {
fmt.Println("--- End BuildAncestorsList for "+node.GetPath(), time.Now().Sub(sT))
}()
*/
dirPath := path.Dir(node.GetPath())
if node.GetPath() != "" {
if cached, has := ancestorsParentsCache.Get(dirPath); has {
if parents, ok := cached.([]*tree.Node); ok {
// Lookup First node
if cachedNode, h := ancestorsNodesCache.Get(node.GetPath()); h {
parentUuids = append(parentUuids, cachedNode.(*tree.Node))
} else {
r, er := treeClient.ReadNode(ctx, &tree.ReadNodeRequest{Node: node})
if er != nil {
return parentUuids, er
}
ancestorsNodesCache.SetDefault(node.GetPath(), r.GetNode())
parentUuids = append(parentUuids, r.GetNode())
}
parentUuids = append(parentUuids, parents...)
return parentUuids, nil
}
}
}
ancestorStream, lErr := treeClient.ListNodes(ctx, &tree.ListNodesRequest{
Node: node,
Ancestors: true,
})
if lErr != nil {
return parentUuids, lErr
}
defer ancestorStream.Close()
for {
parent, e := ancestorStream.Recv()
if e != nil {
if e == io.EOF || e == io.ErrUnexpectedEOF {
break
} else {
if s, o := status.FromError(e); o {
return nil, fmt.Errorf(s.Message())
}
return nil, e
}
}
if parent == nil {
continue
}
parentUuids = append(parentUuids, parent.Node)
}
if dirPath != "" && parentUuids != nil && len(parentUuids) > 1 {
cNode := parentUuids[0]
pNodes := parentUuids[1:]
ancestorsNodesCache.SetDefault(node.GetPath(), cNode)
ancestorsParentsCache.SetDefault(dirPath, pNodes)
}
return parentUuids, err
}
// BuildAncestorsListOrParent builds ancestors list when the node does not exists yet, by trying to find all existing parents.
func BuildAncestorsListOrParent(ctx context.Context, treeClient tree.NodeProviderClient, node *tree.Node) (parentUuids []*tree.Node, err error) {
parents, err := BuildAncestorsList(ctx, treeClient, node)
nodePathParts := strings.Split(node.Path, "/")
if err != nil && len(nodePathParts) > 1 {
// Try to list parent node right
parentNode := &tree.Node{}
parentNode.Path = strings.Join(nodePathParts[0:len(nodePathParts)-1], "/")
parents, err = BuildAncestorsListOrParent(ctx, treeClient, parentNode)
if err != nil {
return parents, err
}
}
return parents, nil
}