2020-06-19 12:09:58 +08:00
|
|
|
package bounded_tree
|
|
|
|
|
|
|
|
import (
|
2020-06-27 01:00:48 +08:00
|
|
|
"sync"
|
|
|
|
|
2020-06-19 12:09:58 +08:00
|
|
|
"github.com/chrislusf/seaweedfs/weed/glog"
|
|
|
|
"github.com/chrislusf/seaweedfs/weed/util"
|
|
|
|
)
|
|
|
|
|
|
|
|
type Node struct {
|
|
|
|
Parent *Node
|
|
|
|
Name string
|
|
|
|
Children map[string]*Node
|
|
|
|
}
|
|
|
|
|
|
|
|
type BoundedTree struct {
|
|
|
|
root *Node
|
2020-08-24 06:48:02 +08:00
|
|
|
sync.RWMutex
|
2020-06-19 12:09:58 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
func NewBoundedTree() *BoundedTree {
|
|
|
|
return &BoundedTree{
|
|
|
|
root: &Node{
|
|
|
|
Name: "/",
|
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
type VisitNodeFunc func(path util.FullPath) (childDirectories []string, err error)
|
|
|
|
|
|
|
|
// If the path is not visited, call the visitFn for each level of directory
|
|
|
|
// No action if the directory has been visited before or does not exist.
|
|
|
|
// A leaf node, which has no children, represents a directory not visited.
|
|
|
|
// A non-leaf node or a non-existing node represents a directory already visited, or does not need to visit.
|
|
|
|
func (t *BoundedTree) EnsureVisited(p util.FullPath, visitFn VisitNodeFunc) {
|
2020-06-27 01:00:48 +08:00
|
|
|
t.Lock()
|
|
|
|
defer t.Unlock()
|
2020-06-19 12:09:58 +08:00
|
|
|
|
|
|
|
if t.root == nil {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
components := p.Split()
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf("components %v %d\n", components, len(components))
|
2020-06-19 12:09:58 +08:00
|
|
|
if canDelete := t.ensureVisited(t.root, util.FullPath("/"), components, 0, visitFn); canDelete {
|
|
|
|
t.root = nil
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *BoundedTree) ensureVisited(n *Node, currentPath util.FullPath, components []string, i int, visitFn VisitNodeFunc) (canDeleteNode bool) {
|
|
|
|
|
2020-06-19 13:28:17 +08:00
|
|
|
// println("ensureVisited", currentPath, i)
|
2020-06-19 12:09:58 +08:00
|
|
|
|
|
|
|
if n == nil {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf("%s null\n", currentPath)
|
2020-06-19 12:09:58 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
if n.isVisited() {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf("%s visited %v\n", currentPath, n.Name)
|
2020-06-19 12:09:58 +08:00
|
|
|
} else {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf("ensure %v\n", currentPath)
|
2020-06-19 12:09:58 +08:00
|
|
|
|
|
|
|
children, err := visitFn(currentPath)
|
|
|
|
if err != nil {
|
|
|
|
glog.V(0).Infof("failed to visit %s: %v", currentPath, err)
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(children) == 0 {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" canDelete %v without children\n", currentPath)
|
2020-06-19 12:09:58 +08:00
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
n.Children = make(map[string]*Node)
|
|
|
|
for _, child := range children {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" add child %v %v\n", currentPath, child)
|
2020-06-19 12:09:58 +08:00
|
|
|
n.Children[child] = &Node{
|
|
|
|
Name: child,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if i >= len(components) {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" check child %v %v\n", currentPath, components[i])
|
2020-06-19 12:09:58 +08:00
|
|
|
|
|
|
|
toVisitNode, found := n.Children[components[i]]
|
|
|
|
if !found {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" did not find child %v %v\n", currentPath, components[i])
|
2020-06-19 12:09:58 +08:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" ensureVisited %v %v\n", currentPath, toVisitNode.Name)
|
2020-06-19 12:09:58 +08:00
|
|
|
|
|
|
|
if canDelete := t.ensureVisited(toVisitNode, currentPath.Child(components[i]), components, i+1, visitFn); canDelete {
|
|
|
|
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" delete %v %v\n", currentPath, components[i])
|
2020-06-19 12:09:58 +08:00
|
|
|
delete(n.Children, components[i])
|
|
|
|
|
|
|
|
if len(n.Children) == 0 {
|
2020-06-19 13:28:17 +08:00
|
|
|
// fmt.Printf(" canDelete %v\n", currentPath)
|
2020-06-19 12:09:58 +08:00
|
|
|
return true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
func (n *Node) isVisited() bool {
|
|
|
|
if n == nil {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
if len(n.Children) > 0 {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
func (n *Node) getChild(childName string) *Node {
|
|
|
|
if n == nil {
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
if len(n.Children) > 0 {
|
|
|
|
return n.Children[childName]
|
|
|
|
}
|
|
|
|
return nil
|
|
|
|
}
|
2020-06-19 13:28:17 +08:00
|
|
|
|
|
|
|
func (t *BoundedTree) HasVisited(p util.FullPath) bool {
|
|
|
|
|
2020-08-24 06:48:02 +08:00
|
|
|
t.RLock()
|
|
|
|
defer t.RUnlock()
|
|
|
|
|
2020-06-19 13:28:17 +08:00
|
|
|
if t.root == nil {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
components := p.Split()
|
2020-06-20 00:16:14 +08:00
|
|
|
// fmt.Printf("components %v %d\n", components, len(components))
|
2020-06-19 13:28:17 +08:00
|
|
|
return t.hasVisited(t.root, util.FullPath("/"), components, 0)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (t *BoundedTree) hasVisited(n *Node, currentPath util.FullPath, components []string, i int) bool {
|
|
|
|
|
|
|
|
if n == nil {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
if !n.isVisited() {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
2020-06-20 00:16:14 +08:00
|
|
|
// fmt.Printf(" hasVisited child %v %+v %d\n", currentPath, components, i)
|
2020-06-19 13:28:17 +08:00
|
|
|
|
2020-06-19 23:58:48 +08:00
|
|
|
if i >= len(components) {
|
2020-06-19 13:28:17 +08:00
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
2020-06-19 23:58:48 +08:00
|
|
|
toVisitNode, found := n.Children[components[i]]
|
|
|
|
if !found {
|
|
|
|
return true
|
2020-06-19 13:28:17 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return t.hasVisited(toVisitNode, currentPath.Child(components[i]), components, i+1)
|
|
|
|
|
|
|
|
}
|