seaweedfs/weed/util/bounded_tree/bounded_tree.go

180 lines
3.8 KiB
Go
Raw Normal View History

package bounded_tree
import (
"sync"
"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
sync.RWMutex
baseDir util.FullPath
}
func NewBoundedTree(baseDir util.FullPath) *BoundedTree {
return &BoundedTree{
root: &Node{
Name: "/",
},
baseDir: baseDir,
}
}
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.
2020-10-14 02:50:46 +00:00
func (t *BoundedTree) EnsureVisited(p util.FullPath, visitFn VisitNodeFunc) (visitErr error) {
t.Lock()
defer t.Unlock()
if t.root == nil {
return
}
2021-05-09 08:42:19 +00:00
components := p.Split()
2020-06-19 05:28:17 +00:00
// fmt.Printf("components %v %d\n", components, len(components))
2021-05-09 08:42:19 +00:00
canDelete, err := t.ensureVisited(t.root, util.FullPath("/"), components, 0, visitFn)
if err != nil {
return err
}
if canDelete {
t.root = nil
}
return nil
}
func (t *BoundedTree) ensureVisited(n *Node, currentPath util.FullPath, components []string, i int, visitFn VisitNodeFunc) (canDeleteNode bool, visitErr error) {
2020-06-19 05:28:17 +00:00
// println("ensureVisited", currentPath, i)
if n == nil {
2020-06-19 05:28:17 +00:00
// fmt.Printf("%s null\n", currentPath)
return
}
if n.isVisited() {
2020-06-19 05:28:17 +00:00
// fmt.Printf("%s visited %v\n", currentPath, n.Name)
} else {
2020-06-19 05:28:17 +00:00
// fmt.Printf("ensure %v\n", currentPath)
children, err := visitFn(currentPath)
if err != nil {
glog.V(0).Infof("failed to visit %s: %v", currentPath, err)
return false, err
}
if len(children) == 0 {
2020-06-19 05:28:17 +00:00
// fmt.Printf(" canDelete %v without children\n", currentPath)
return true, nil
}
n.Children = make(map[string]*Node)
for _, child := range children {
2020-06-19 05:28:17 +00:00
// fmt.Printf(" add child %v %v\n", currentPath, child)
n.Children[child] = &Node{
Name: child,
}
}
}
if i >= len(components) {
return
}
2020-06-19 05:28:17 +00:00
// fmt.Printf(" check child %v %v\n", currentPath, components[i])
toVisitNode, found := n.Children[components[i]]
if !found {
2020-06-19 05:28:17 +00:00
// fmt.Printf(" did not find child %v %v\n", currentPath, components[i])
return
}
2020-06-19 05:28:17 +00:00
// fmt.Printf(" ensureVisited %v %v\n", currentPath, toVisitNode.Name)
canDelete, childVisitErr := t.ensureVisited(toVisitNode, currentPath.Child(components[i]), components, i+1, visitFn)
if childVisitErr != nil {
return false, childVisitErr
}
if canDelete {
2020-06-19 05:28:17 +00:00
// fmt.Printf(" delete %v %v\n", currentPath, components[i])
delete(n.Children, components[i])
if len(n.Children) == 0 {
2020-06-19 05:28:17 +00:00
// fmt.Printf(" canDelete %v\n", currentPath)
return true, nil
}
}
return false, nil
}
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 05:28:17 +00:00
func (t *BoundedTree) HasVisited(p util.FullPath) bool {
t.RLock()
defer t.RUnlock()
2020-06-19 05:28:17 +00:00
if t.root == nil {
return true
}
components := p.Split()
2020-06-19 16:16:14 +00:00
// fmt.Printf("components %v %d\n", components, len(components))
2020-06-19 05:28:17 +00: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-19 16:16:14 +00:00
// fmt.Printf(" hasVisited child %v %+v %d\n", currentPath, components, i)
2020-06-19 05:28:17 +00:00
2020-06-19 15:58:48 +00:00
if i >= len(components) {
2020-06-19 05:28:17 +00:00
return true
}
2020-06-19 15:58:48 +00:00
toVisitNode, found := n.Children[components[i]]
if !found {
return true
2020-06-19 05:28:17 +00:00
}
return t.hasVisited(toVisitNode, currentPath.Child(components[i]), components, i+1)
}