-
Notifications
You must be signed in to change notification settings - Fork 107
/
sink_endpoint.go
85 lines (70 loc) · 2.4 KB
/
sink_endpoint.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
* Copyright 2014-2015 Jason Woods.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package endpoint
import (
"time"
"github.com/driskell/log-courier/lc-lib/payload"
)
// CanQueue returns true if there are active endpoints ready to receive events
func (s *Sink) CanQueue() bool {
return s.readyList.Len() > 0
}
// QueuePayload locates the best endpoint to send the events to, and attempts to
// queue the events on that endpoint.
// Returns the best endpoint and any error that occurred sending the events.
func (s *Sink) QueuePayload(payload *payload.Payload) (*Endpoint, error) {
// Single endpoint?
if s.readyList.Len() == 1 {
endpoint := s.readyList.Front().Value.(*Endpoint)
return endpoint, endpoint.queuePayload(payload)
}
// Locate best
entry := s.readyList.Front()
if entry == nil {
return nil, nil
}
events := time.Duration(payload.Size())
bestEndpoint := entry.Value.(*Endpoint)
bestEDT := bestEndpoint.EstDelTime().Add(bestEndpoint.AverageLatency() * events)
for ; entry != nil; entry = entry.Next() {
endpoint := entry.Value.(*Endpoint)
// Warming endpoints have received their first payload and should not receive
// any more
if endpoint.IsWarming() {
continue
}
endpointEDT := endpoint.EstDelTime().Add(endpoint.AverageLatency() * events)
if endpointEDT.Before(bestEDT) {
// If we continuously skip endpoints on every queue, they will never
// recalculate their latency - so artificially drop it each time we skip
// it so it eventually gets to send something and recalculate its latency
bestEndpoint.ReduceLatency()
bestEndpoint = endpoint
bestEDT = endpointEDT
} else {
endpoint.ReduceLatency()
}
}
return bestEndpoint, bestEndpoint.queuePayload(payload)
}
// ForceFailure forces an endpoint to fail
func (s *Sink) ForceFailure(endpoint *Endpoint) {
if endpoint.IsFailed() {
return
}
s.moveFailed(endpoint, nil)
endpoint.forceFailure()
}