mirror of https://github.com/minio/minio.git
119 lines
2.2 KiB
Go
119 lines
2.2 KiB
Go
|
// Copyright (c) 2012, Sean Treadway, SoundCloud Ltd.
|
||
|
// Use of this source code is governed by a BSD-style
|
||
|
// license that can be found in the LICENSE file.
|
||
|
// Source code and contact info at http://github.com/streadway/amqp
|
||
|
|
||
|
package amqp
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
"os"
|
||
|
"sync"
|
||
|
"sync/atomic"
|
||
|
)
|
||
|
|
||
|
var consumerSeq uint64
|
||
|
|
||
|
func uniqueConsumerTag() string {
|
||
|
return fmt.Sprintf("ctag-%s-%d", os.Args[0], atomic.AddUint64(&consumerSeq, 1))
|
||
|
}
|
||
|
|
||
|
type consumerBuffers map[string]chan *Delivery
|
||
|
|
||
|
// Concurrent type that manages the consumerTag ->
|
||
|
// ingress consumerBuffer mapping
|
||
|
type consumers struct {
|
||
|
sync.Mutex
|
||
|
chans consumerBuffers
|
||
|
}
|
||
|
|
||
|
func makeConsumers() *consumers {
|
||
|
return &consumers{chans: make(consumerBuffers)}
|
||
|
}
|
||
|
|
||
|
func bufferDeliveries(in chan *Delivery, out chan Delivery) {
|
||
|
var queue []*Delivery
|
||
|
var queueIn = in
|
||
|
|
||
|
for delivery := range in {
|
||
|
select {
|
||
|
case out <- *delivery:
|
||
|
// delivered immediately while the consumer chan can receive
|
||
|
default:
|
||
|
queue = append(queue, delivery)
|
||
|
}
|
||
|
|
||
|
for len(queue) > 0 {
|
||
|
select {
|
||
|
case out <- *queue[0]:
|
||
|
queue = queue[1:]
|
||
|
case delivery, open := <-queueIn:
|
||
|
if open {
|
||
|
queue = append(queue, delivery)
|
||
|
} else {
|
||
|
// stop receiving to drain the queue
|
||
|
queueIn = nil
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
close(out)
|
||
|
}
|
||
|
|
||
|
// On key conflict, close the previous channel.
|
||
|
func (me *consumers) add(tag string, consumer chan Delivery) {
|
||
|
me.Lock()
|
||
|
defer me.Unlock()
|
||
|
|
||
|
if prev, found := me.chans[tag]; found {
|
||
|
close(prev)
|
||
|
}
|
||
|
|
||
|
in := make(chan *Delivery)
|
||
|
go bufferDeliveries(in, consumer)
|
||
|
|
||
|
me.chans[tag] = in
|
||
|
}
|
||
|
|
||
|
func (me *consumers) close(tag string) (found bool) {
|
||
|
me.Lock()
|
||
|
defer me.Unlock()
|
||
|
|
||
|
ch, found := me.chans[tag]
|
||
|
|
||
|
if found {
|
||
|
delete(me.chans, tag)
|
||
|
close(ch)
|
||
|
}
|
||
|
|
||
|
return found
|
||
|
}
|
||
|
|
||
|
func (me *consumers) closeAll() {
|
||
|
me.Lock()
|
||
|
defer me.Unlock()
|
||
|
|
||
|
for _, ch := range me.chans {
|
||
|
close(ch)
|
||
|
}
|
||
|
|
||
|
me.chans = make(consumerBuffers)
|
||
|
}
|
||
|
|
||
|
// Sends a delivery to a the consumer identified by `tag`.
|
||
|
// If unbuffered channels are used for Consume this method
|
||
|
// could block all deliveries until the consumer
|
||
|
// receives on the other end of the channel.
|
||
|
func (me *consumers) send(tag string, msg *Delivery) bool {
|
||
|
me.Lock()
|
||
|
defer me.Unlock()
|
||
|
|
||
|
buffer, found := me.chans[tag]
|
||
|
if found {
|
||
|
buffer <- msg
|
||
|
}
|
||
|
|
||
|
return found
|
||
|
}
|