mirror of
https://github.com/ipfs/kubo.git
synced 2026-02-22 02:47:48 +08:00
this is a major refactor of the entire codebase it changes the monolithic peer.Peer into using a peer.ID and a peer.Peerstore. Other changes: - removed handshake3. - testutil vastly simplified peer - secio bugfix + debugging logs - testutil: RandKeyPair - backpressure bugfix: w.o.w. - peer: added hex enc/dec - peer: added a PeerInfo struct PeerInfo is a small struct used to pass around a peer with a set of addresses and keys. This is not meant to be a complete view of the system, but rather to model updates to the peerstore. It is used by things like the routing system. - updated peer/queue + peerset - latency metrics - testutil: use crand for PeerID gen RandPeerID generates random "valid" peer IDs. it does not NEED to generate keys because it is as if we lost the key right away. fine to read some randomness and hash it. to generate proper keys and an ID, use: sk, pk, _ := testutil.RandKeyPair() id, _ := peer.IDFromPublicKey(pk) Also added RandPeerIDFatal helper - removed old spipe - updated seccat - core: cleanup initIdentity - removed old getFromPeerList
75 lines
1.2 KiB
Go
75 lines
1.2 KiB
Go
package queue
|
|
|
|
import (
|
|
context "github.com/jbenet/go-ipfs/Godeps/_workspace/src/code.google.com/p/go.net/context"
|
|
|
|
peer "github.com/jbenet/go-ipfs/peer"
|
|
)
|
|
|
|
// ChanQueue makes any PeerQueue synchronizable through channels.
|
|
type ChanQueue struct {
|
|
Queue PeerQueue
|
|
EnqChan chan<- peer.ID
|
|
DeqChan <-chan peer.ID
|
|
}
|
|
|
|
// NewChanQueue creates a ChanQueue by wrapping pq.
|
|
func NewChanQueue(ctx context.Context, pq PeerQueue) *ChanQueue {
|
|
cq := &ChanQueue{Queue: pq}
|
|
cq.process(ctx)
|
|
return cq
|
|
}
|
|
|
|
func (cq *ChanQueue) process(ctx context.Context) {
|
|
|
|
// construct the channels here to be able to use them bidirectionally
|
|
enqChan := make(chan peer.ID)
|
|
deqChan := make(chan peer.ID)
|
|
|
|
cq.EnqChan = enqChan
|
|
cq.DeqChan = deqChan
|
|
|
|
go func() {
|
|
defer close(deqChan)
|
|
|
|
var next peer.ID
|
|
var item peer.ID
|
|
var more bool
|
|
|
|
for {
|
|
if cq.Queue.Len() == 0 {
|
|
select {
|
|
case next, more = <-enqChan:
|
|
if !more {
|
|
return
|
|
}
|
|
|
|
case <-ctx.Done():
|
|
return
|
|
}
|
|
|
|
} else {
|
|
next = cq.Queue.Dequeue()
|
|
}
|
|
|
|
select {
|
|
case item, more = <-enqChan:
|
|
if !more {
|
|
return
|
|
}
|
|
|
|
cq.Queue.Enqueue(item)
|
|
cq.Queue.Enqueue(next)
|
|
next = ""
|
|
|
|
case deqChan <- next:
|
|
next = ""
|
|
|
|
case <-ctx.Done():
|
|
return
|
|
}
|
|
}
|
|
|
|
}()
|
|
}
|