提交 98c3afee 作者: Juan Batiz-Benet 提交者: Brian Tiger Chow

clean up channel use

上级 b77a785c
...@@ -9,50 +9,66 @@ import ( ...@@ -9,50 +9,66 @@ import (
// ChanQueue makes any PeerQueue synchronizable through channels. // ChanQueue makes any PeerQueue synchronizable through channels.
type ChanQueue struct { type ChanQueue struct {
Queue PeerQueue Queue PeerQueue
EnqChan chan *peer.Peer EnqChan chan<- *peer.Peer
DeqChan chan *peer.Peer DeqChan <-chan *peer.Peer
} }
// NewChanQueue creates a ChanQueue by wrapping pq. // NewChanQueue creates a ChanQueue by wrapping pq.
func NewChanQueue(ctx context.Context, pq PeerQueue) *ChanQueue { func NewChanQueue(ctx context.Context, pq PeerQueue) *ChanQueue {
cq := &ChanQueue{ cq := &ChanQueue{Queue: pq}
Queue: pq, cq.process(ctx)
EnqChan: make(chan *peer.Peer, 10),
DeqChan: make(chan *peer.Peer, 10),
}
go cq.process(ctx)
return cq return cq
} }
func (cq *ChanQueue) process(ctx context.Context) { func (cq *ChanQueue) process(ctx context.Context) {
var next *peer.Peer
for { // construct the channels here to be able to use them bidirectionally
enqChan := make(chan *peer.Peer, 10)
deqChan := make(chan *peer.Peer, 10)
if cq.Queue.Len() == 0 { cq.EnqChan = enqChan
select { cq.DeqChan = deqChan
case next = <-cq.EnqChan:
case <-ctx.Done(): go func() {
close(cq.DeqChan) defer close(deqChan)
return
var next *peer.Peer
var item *peer.Peer
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()
} }
} else { select {
next = cq.Queue.Dequeue() case item, more = <-enqChan:
} if !more {
return
}
select { cq.Queue.Enqueue(item)
case item := <-cq.EnqChan: cq.Queue.Enqueue(next)
cq.Queue.Enqueue(item) next = nil
cq.Queue.Enqueue(next)
next = nil
case cq.DeqChan <- next: case deqChan <- next:
next = nil next = nil
case <-ctx.Done(): case <-ctx.Done():
close(cq.DeqChan) return
return }
} }
}
}()
} }
Markdown 格式
0%
您添加了 0 到此讨论。请谨慎行事。
请先完成此评论的编辑!
注册 或者 后发表评论