topic.go 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. package server
  2. import (
  3. "math/rand"
  4. "sync"
  5. "time"
  6. "heckel.io/ntfy/log"
  7. )
  8. // topic represents a channel to which subscribers can subscribe, and publishers
  9. // can publish a message
  10. type topic struct {
  11. ID string
  12. subscribers map[int]*topicSubscriber
  13. lastVisitor *visitor
  14. lastVisitorExpires time.Time
  15. mu sync.Mutex
  16. }
  17. type topicSubscriber struct {
  18. subscriber subscriber
  19. visitor *visitor // User ID associated with this subscription, may be empty
  20. cancel func()
  21. }
  22. // subscriber is a function that is called for every new message on a topic
  23. type subscriber func(v *visitor, msg *message) error
  24. // newTopic creates a new topic
  25. func newTopic(id string) *topic {
  26. return &topic{
  27. ID: id,
  28. subscribers: make(map[int]*topicSubscriber),
  29. }
  30. }
  31. // Subscribe subscribes to this topic
  32. func (t *topic) Subscribe(s subscriber, visitor *visitor, cancel func()) int {
  33. t.mu.Lock()
  34. defer t.mu.Unlock()
  35. subscriberID := rand.Int()
  36. t.subscribers[subscriberID] = &topicSubscriber{
  37. visitor: visitor, // May be empty
  38. subscriber: s,
  39. cancel: cancel,
  40. }
  41. return subscriberID
  42. }
  43. func (t *topic) Stale() bool {
  44. return t.getBillee() == nil
  45. }
  46. func (t *topic) getBillee() *visitor {
  47. for _, this_subscriber := range t.subscribers {
  48. return this_subscriber.visitor
  49. }
  50. if t.lastVisitor != nil && t.lastVisitorExpires.After(time.Now()) {
  51. t.lastVisitor = nil
  52. }
  53. return t.lastVisitor
  54. }
  55. // Unsubscribe removes the subscription from the list of subscribers
  56. func (t *topic) Unsubscribe(id int) {
  57. t.mu.Lock()
  58. defer t.mu.Unlock()
  59. if len(t.subscribers) == 1 {
  60. t.lastVisitor = t.subscribers[id].visitor
  61. t.lastVisitorExpires = time.Now().Add(subscriberBilledValidity)
  62. }
  63. delete(t.subscribers, id)
  64. }
  65. // Publish asynchronously publishes to all subscribers
  66. func (t *topic) Publish(v *visitor, m *message) error {
  67. go func() {
  68. // We want to lock the topic as short as possible, so we make a shallow copy of the
  69. // subscribers map here. Actually sending out the messages then doesn't have to lock.
  70. subscribers := t.subscribersCopy()
  71. if len(subscribers) > 0 {
  72. logvm(v, m).Tag(tagPublish).Debug("Forwarding to %d subscriber(s)", len(subscribers))
  73. for _, s := range subscribers {
  74. // We call the subscriber functions in their own Go routines because they are blocking, and
  75. // we don't want individual slow subscribers to be able to block others.
  76. go func(s subscriber) {
  77. if err := s(v, m); err != nil {
  78. logvm(v, m).Tag(tagPublish).Err(err).Warn("Error forwarding to subscriber")
  79. }
  80. }(s.subscriber)
  81. }
  82. } else {
  83. logvm(v, m).Tag(tagPublish).Trace("No stream or WebSocket subscribers, not forwarding")
  84. }
  85. }()
  86. return nil
  87. }
  88. // SubscribersCount returns the number of subscribers to this topic
  89. func (t *topic) SubscribersCount() int {
  90. t.mu.Lock()
  91. defer t.mu.Unlock()
  92. return len(t.subscribers)
  93. }
  94. // CancelSubscribers calls the cancel function for all subscribers, forcing
  95. func (t *topic) CancelSubscribers(exceptUserID string) {
  96. t.mu.Lock()
  97. defer t.mu.Unlock()
  98. for _, s := range t.subscribers {
  99. if s.visitor.MaybeUserID() != exceptUserID {
  100. // TODO: Shouldn't this log the IP for anonymous visitors? It was s.userID before my change.
  101. log.Tag(tagSubscribe).Field("topic", t.ID).Debug("Canceling subscriber %s", s.visitor.MaybeUserID())
  102. s.cancel()
  103. }
  104. }
  105. }
  106. // subscribersCopy returns a shallow copy of the subscribers map
  107. func (t *topic) subscribersCopy() map[int]*topicSubscriber {
  108. t.mu.Lock()
  109. defer t.mu.Unlock()
  110. subscribers := make(map[int]*topicSubscriber)
  111. for k, sub := range t.subscribers {
  112. subscribers[k] = &topicSubscriber{
  113. visitor: sub.visitor,
  114. subscriber: sub.subscriber,
  115. cancel: sub.cancel,
  116. }
  117. }
  118. return subscribers
  119. }