1 files changed, 0 insertions, 272 deletions
diff --git a/go/topology/node.go b/go/topology/node.go
deleted file mode 100644
index 6a84b4b92..000000000
--- a/go/topology/node.go
+++ /dev/null
@@ -1,272 +0,0 @@
-package topology
-
-import (
-	"errors"
-	"math/rand"
-	"strings"
-	"sync"
-
-	"github.com/chrislusf/seaweedfs/go/glog"
-	"github.com/chrislusf/seaweedfs/go/storage"
-)
-
-type NodeId string
-type Node interface {
-	Id() NodeId
-	String() string
-	FreeSpace() int
-	ReserveOneVolume(r int) (*DataNode, error)
-	UpAdjustMaxVolumeCountDelta(maxVolumeCountDelta int)
-	UpAdjustVolumeCountDelta(volumeCountDelta int)
-	UpAdjustActiveVolumeCountDelta(activeVolumeCountDelta int)
-	UpAdjustMaxVolumeId(vid storage.VolumeId)
-
-	GetVolumeCount() int
-	GetActiveVolumeCount() int
-	GetMaxVolumeCount() int
-	GetMaxVolumeId() storage.VolumeId
-	SetParent(Node)
-	LinkChildNode(node Node)
-	UnlinkChildNode(nodeId NodeId)
-	CollectDeadNodeAndFullVolumes(freshThreshHold int64, volumeSizeLimit uint64)
-
-	IsDataNode() bool
-	IsRack() bool
-	IsDataCenter() bool
-	Children() []Node
-	Parent() Node
-
-	GetValue() interface{} //get reference to the topology,dc,rack,datanode
-}
-type NodeImpl struct {
-	id                NodeId
-	volumeCount       int
-	activeVolumeCount int
-	maxVolumeCount    int
-	parent            Node
-	sync.RWMutex      // lock children
-	children          map[NodeId]Node
-	maxVolumeId       storage.VolumeId
-
-	//for rack, data center, topology
-	nodeType string
-	value    interface{}
-}
-
-// the first node must satisfy filterFirstNodeFn(), the rest nodes must have one free slot
-func (n *NodeImpl) RandomlyPickNodes(numberOfNodes int, filterFirstNodeFn func(dn Node) error) (firstNode Node, restNodes []Node, err error) {
-	candidates := make([]Node, 0, len(n.children))
-	var errs []string
-	n.RLock()
-	for _, node := range n.children {
-		if err := filterFirstNodeFn(node); err == nil {
-			candidates = append(candidates, node)
-		} else {
-			errs = append(errs, string(node.Id())+":"+err.Error())
-		}
-	}
-	n.RUnlock()
-	if len(candidates) == 0 {
-		return nil, nil, errors.New("No matching data node found! \n" + strings.Join(errs, "\n"))
-	}
-	firstNode = candidates[rand.Intn(len(candidates))]
-	glog.V(2).Infoln(n.Id(), "picked main node:", firstNode.Id())
-
-	restNodes = make([]Node, numberOfNodes-1)
-	candidates = candidates[:0]
-	n.RLock()
-	for _, node := range n.children {
-		if node.Id() == firstNode.Id() {
-			continue
-		}
-		if node.FreeSpace() <= 0 {
-			continue
-		}
-		glog.V(2).Infoln("select rest node candidate:", node.Id())
-		candidates = append(candidates, node)
-	}
-	n.RUnlock()
-	glog.V(2).Infoln(n.Id(), "picking", numberOfNodes-1, "from rest", len(candidates), "node candidates")
-	ret := len(restNodes) == 0
-	for k, node := range candidates {
-		if k < len(restNodes) {
-			restNodes[k] = node
-			if k == len(restNodes)-1 {
-				ret = true
-			}
-		} else {
-			r := rand.Intn(k + 1)
-			if r < len(restNodes) {
-				restNodes[r] = node
-			}
-		}
-	}
-	if !ret {
-		glog.V(2).Infoln(n.Id(), "failed to pick", numberOfNodes-1, "from rest", len(candidates), "node candidates")
-		err = errors.New("Not enough data node found!")
-	}
-	return
-}
-
-func (n *NodeImpl) IsDataNode() bool {
-	return n.nodeType == "DataNode"
-}
-func (n *NodeImpl) IsRack() bool {
-	return n.nodeType == "Rack"
-}
-func (n *NodeImpl) IsDataCenter() bool {
-	return n.nodeType == "DataCenter"
-}
-func (n *NodeImpl) String() string {
-	if n.parent != nil {
-		return n.parent.String() + ":" + string(n.id)
-	}
-	return string(n.id)
-}
-func (n *NodeImpl) Id() NodeId {
-	return n.id
-}
-func (n *NodeImpl) FreeSpace() int {
-	return n.maxVolumeCount - n.volumeCount
-}
-func (n *NodeImpl) SetParent(node Node) {
-	n.parent = node
-}
-func (n *NodeImpl) Children() (ret []Node) {
-	n.RLock()
-	defer n.RUnlock()
-	for _, c := range n.children {
-		ret = append(ret, c)
-	}
-	return ret
-}
-func (n *NodeImpl) Parent() Node {
-	return n.parent
-}
-func (n *NodeImpl) GetValue() interface{} {
-	return n.value
-}
-func (n *NodeImpl) ReserveOneVolume(r int) (assignedNode *DataNode, err error) {
-	n.RLock()
-	defer n.RUnlock()
-	for _, node := range n.children {
-		freeSpace := node.FreeSpace()
-		// fmt.Println("r =", r, ", node =", node, ", freeSpace =", freeSpace)
-		if freeSpace <= 0 {
-			continue
-		}
-		if r >= freeSpace {
-			r -= freeSpace
-		} else {
-			if node.IsDataNode() && node.FreeSpace() > 0 {
-				// fmt.Println("vid =", vid, " assigned to node =", node, ", freeSpace =", node.FreeSpace())
-				return node.(*DataNode), nil
-			}
-			assignedNode, err = node.ReserveOneVolume(r)
-			if err != nil {
-				return
-			}
-		}
-	}
-	return
-}
-
-func (n *NodeImpl) UpAdjustMaxVolumeCountDelta(maxVolumeCountDelta int) { //can be negative
-	n.maxVolumeCount += maxVolumeCountDelta
-	if n.parent != nil {
-		n.parent.UpAdjustMaxVolumeCountDelta(maxVolumeCountDelta)
-	}
-}
-func (n *NodeImpl) UpAdjustVolumeCountDelta(volumeCountDelta int) { //can be negative
-	n.volumeCount += volumeCountDelta
-	if n.parent != nil {
-		n.parent.UpAdjustVolumeCountDelta(volumeCountDelta)
-	}
-}
-func (n *NodeImpl) UpAdjustActiveVolumeCountDelta(activeVolumeCountDelta int) { //can be negative
-	n.activeVolumeCount += activeVolumeCountDelta
-	if n.parent != nil {
-		n.parent.UpAdjustActiveVolumeCountDelta(activeVolumeCountDelta)
-	}
-}
-func (n *NodeImpl) UpAdjustMaxVolumeId(vid storage.VolumeId) { //can be negative
-	if n.maxVolumeId < vid {
-		n.maxVolumeId = vid
-		if n.parent != nil {
-			n.parent.UpAdjustMaxVolumeId(vid)
-		}
-	}
-}
-func (n *NodeImpl) GetMaxVolumeId() storage.VolumeId {
-	return n.maxVolumeId
-}
-func (n *NodeImpl) GetVolumeCount() int {
-	return n.volumeCount
-}
-func (n *NodeImpl) GetActiveVolumeCount() int {
-	return n.activeVolumeCount
-}
-func (n *NodeImpl) GetMaxVolumeCount() int {
-	return n.maxVolumeCount
-}
-
-func (n *NodeImpl) LinkChildNode(node Node) {
-	n.Lock()
-	defer n.Unlock()
-	if n.children[node.Id()] == nil {
-		n.children[node.Id()] = node
-		n.UpAdjustMaxVolumeCountDelta(node.GetMaxVolumeCount())
-		n.UpAdjustMaxVolumeId(node.GetMaxVolumeId())
-		n.UpAdjustVolumeCountDelta(node.GetVolumeCount())
-		n.UpAdjustActiveVolumeCountDelta(node.GetActiveVolumeCount())
-		node.SetParent(n)
-		glog.V(0).Infoln(n, "adds child", node.Id())
-	}
-}
-
-func (n *NodeImpl) UnlinkChildNode(nodeId NodeId) {
-	n.Lock()
-	defer n.Unlock()
-	node := n.children[nodeId]
-	if node != nil {
-		node.SetParent(nil)
-		delete(n.children, node.Id())
-		n.UpAdjustVolumeCountDelta(-node.GetVolumeCount())
-		n.UpAdjustActiveVolumeCountDelta(-node.GetActiveVolumeCount())
-		n.UpAdjustMaxVolumeCountDelta(-node.GetMaxVolumeCount())
-		glog.V(0).Infoln(n, "removes", node, "volumeCount =", n.activeVolumeCount)
-	}
-}
-
-func (n *NodeImpl) CollectDeadNodeAndFullVolumes(freshThreshHold int64, volumeSizeLimit uint64) {
-	if n.IsRack() {
-		for _, c := range n.Children() {
-			dn := c.(*DataNode) //can not cast n to DataNode
-			if dn.LastSeen < freshThreshHold {
-				if !dn.Dead {
-					dn.Dead = true
-					n.GetTopology().chanDeadDataNodes <- dn
-				}
-			}
-			for _, v := range dn.GetVolumes() {
-				if uint64(v.Size) >= volumeSizeLimit {
-					//fmt.Println("volume",v.Id,"size",v.Size,">",volumeSizeLimit)
-					n.GetTopology().chanFullVolumes <- v
-				}
-			}
-		}
-	} else {
-		for _, c := range n.Children() {
-			c.CollectDeadNodeAndFullVolumes(freshThreshHold, volumeSizeLimit)
-		}
-	}
-}
-
-func (n *NodeImpl) GetTopology() *Topology {
-	var p Node
-	p = n
-	for p.Parent() != nil {
-		p = p.Parent()
-	}
-	return p.GetValue().(*Topology)
-}