lbry.go/dht/store.go

58 lines
1.1 KiB
Go
Raw Normal View History

2018-03-07 22:15:58 +01:00
package dht
2018-03-08 01:49:33 +01:00
import "sync"
2018-03-07 22:15:58 +01:00
type peer struct {
2018-03-09 22:43:30 +01:00
node Node
//<lastPublished>,
//<originallyPublished>
// <originalPublisherID>
2018-03-07 22:15:58 +01:00
}
type peerStore struct {
2018-04-04 17:43:27 +02:00
// map of blob hashes to (map of node IDs to bools)
hashes map[Bitmap]map[Bitmap]bool
2018-04-04 17:43:27 +02:00
// map of node IDs to peers
nodeInfo map[Bitmap]peer
lock sync.RWMutex
2018-03-07 22:15:58 +01:00
}
func newPeerStore() *peerStore {
return &peerStore{
hashes: make(map[Bitmap]map[Bitmap]bool),
nodeInfo: make(map[Bitmap]peer),
2018-03-07 22:15:58 +01:00
}
}
func (s *peerStore) Upsert(blobHash Bitmap, node Node) {
2018-03-07 22:15:58 +01:00
s.lock.Lock()
defer s.lock.Unlock()
2018-04-05 17:35:57 +02:00
if _, ok := s.hashes[blobHash]; !ok {
s.hashes[blobHash] = make(map[Bitmap]bool)
2018-03-07 22:15:58 +01:00
}
2018-04-05 17:35:57 +02:00
s.hashes[blobHash][node.id] = true
s.nodeInfo[node.id] = peer{node: node}
2018-03-07 22:15:58 +01:00
}
func (s *peerStore) Get(blobHash Bitmap) []Node {
2018-03-07 22:15:58 +01:00
s.lock.RLock()
defer s.lock.RUnlock()
2018-03-09 22:43:30 +01:00
var nodes []Node
2018-04-05 17:35:57 +02:00
if ids, ok := s.hashes[blobHash]; ok {
for id := range ids {
peer, ok := s.nodeInfo[id]
if !ok {
panic("node id in IDs list, but not in nodeInfo")
}
nodes = append(nodes, peer.node)
2018-03-07 22:15:58 +01:00
}
}
return nodes
}
2018-04-05 17:35:57 +02:00
func (s *peerStore) CountStoredHashes() int {
s.lock.RLock()
defer s.lock.RUnlock()
2018-04-05 17:35:57 +02:00
return len(s.hashes)
}