priority_queue.go 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
  1. // Copyright 2016 CoreOS, Inc.
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package recipe
  15. import (
  16. "fmt"
  17. "github.com/coreos/etcd/storage/storagepb"
  18. )
  19. // PriorityQueue implements a multi-reader, multi-writer distributed queue.
  20. type PriorityQueue struct {
  21. client *EtcdClient
  22. key string
  23. }
  24. // NewPriorityQueue creates an etcd priority queue.
  25. func NewPriorityQueue(client *EtcdClient, key string) *PriorityQueue {
  26. return &PriorityQueue{client, key + "/"}
  27. }
  28. // Enqueue puts a value into a queue with a given priority.
  29. func (q *PriorityQueue) Enqueue(val string, pr uint16) error {
  30. prefix := fmt.Sprintf("%s%05d", q.key, pr)
  31. _, err := NewSequentialKV(q.client, prefix, val)
  32. return err
  33. }
  34. // Dequeue returns Enqueued()'d items in FIFO order. If the
  35. // queue is empty, Dequeue blocks until items are available.
  36. func (q *PriorityQueue) Dequeue() (string, error) {
  37. // TODO: fewer round trips by fetching more than one key
  38. resp, err := NewRange(q.client, q.key).FirstKey()
  39. if err != nil {
  40. return "", err
  41. }
  42. kv, err := q.client.claimFirstKey(resp.Kvs)
  43. if err != nil {
  44. return "", err
  45. } else if kv != nil {
  46. return string(kv.Value), nil
  47. } else if resp.More {
  48. // missed some items, retry to read in more
  49. return q.Dequeue()
  50. }
  51. // nothing to dequeue; wait on items
  52. ev, err := WaitPrefixEvents(
  53. q.client,
  54. q.key,
  55. resp.Header.Revision,
  56. []storagepb.Event_EventType{storagepb.PUT})
  57. if err != nil {
  58. return "", err
  59. }
  60. ok, err := q.client.deleteRevKey(string(ev.Kv.Key), ev.Kv.ModRevision)
  61. if err != nil {
  62. return "", err
  63. } else if !ok {
  64. return q.Dequeue()
  65. }
  66. return string(ev.Kv.Value), err
  67. }