34fdc329fc
This is the third implementation attempt. This time, rather than broadcasting PeerAdd/Join requests to the whole cluster, we use the consensus log to broadcast new peers joining. This makes it easier to recover from errors and to know who exactly is member of a cluster and who is not. The consensus is, after all, meant to agree on things, and the list of cluster peers is something everyone has to agree on. Raft itself uses a special log operation to maintain the peer set. The tests are almost unchanged from the previous attempts so it should be the same, except it doesn't seem possible to bootstrap a bunch of nodes at the same time using different bootstrap nodes. It works when using the same. I'm not sure this worked before either, but the code is simpler than recursively contacting peers, and scales better for larger clusters. Nodes have to be careful about joining clusters while keeping the state from a different cluster (disjoint logs). This may cause problems with Raft. License: MIT Signed-off-by: Hector Sanjuan <hector@protocol.ai>
62 lines
1.4 KiB
Go
62 lines
1.4 KiB
Go
package ipfscluster
|
|
|
|
import (
|
|
"sync"
|
|
|
|
cid "github.com/ipfs/go-cid"
|
|
)
|
|
|
|
// MapState is a very simple database to store the state of the system
|
|
// using a Go map. It is thread safe. It implements the State interface.
|
|
type MapState struct {
|
|
pinMux sync.RWMutex
|
|
PinMap map[string]struct{}
|
|
peerMux sync.RWMutex
|
|
PeerMap map[string]string
|
|
}
|
|
|
|
// NewMapState initializes the internal map and returns a new MapState object.
|
|
func NewMapState() *MapState {
|
|
return &MapState{
|
|
PinMap: make(map[string]struct{}),
|
|
PeerMap: make(map[string]string),
|
|
}
|
|
}
|
|
|
|
// AddPin adds a Cid to the internal map.
|
|
func (st *MapState) AddPin(c *cid.Cid) error {
|
|
st.pinMux.Lock()
|
|
defer st.pinMux.Unlock()
|
|
var a struct{}
|
|
st.PinMap[c.String()] = a
|
|
return nil
|
|
}
|
|
|
|
// RmPin removes a Cid from the internal map.
|
|
func (st *MapState) RmPin(c *cid.Cid) error {
|
|
st.pinMux.Lock()
|
|
defer st.pinMux.Unlock()
|
|
delete(st.PinMap, c.String())
|
|
return nil
|
|
}
|
|
|
|
// HasPin returns true if the Cid belongs to the State.
|
|
func (st *MapState) HasPin(c *cid.Cid) bool {
|
|
st.pinMux.RLock()
|
|
defer st.pinMux.RUnlock()
|
|
_, ok := st.PinMap[c.String()]
|
|
return ok
|
|
}
|
|
|
|
// ListPins provides a list of Cids in the State.
|
|
func (st *MapState) ListPins() []*cid.Cid {
|
|
st.pinMux.RLock()
|
|
defer st.pinMux.RUnlock()
|
|
cids := make([]*cid.Cid, 0, len(st.PinMap))
|
|
for k := range st.PinMap {
|
|
c, _ := cid.Decode(k)
|
|
cids = append(cids, c)
|
|
}
|
|
return cids
|
|
}
|