-
Notifications
You must be signed in to change notification settings - Fork 795
/
qps_limiter.go
152 lines (134 loc) · 3.54 KB
/
qps_limiter.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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
/*
* Copyright 2021 CloudWeGo Authors
*
* 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 limiter
import (
"context"
"sync/atomic"
"time"
)
var fixedWindowTime = time.Second
// qpsLimiter implements the RateLimiter interface.
type qpsLimiter struct {
limit int32
tokens int32
interval time.Duration
once int32
ticker *time.Ticker
tickerDone chan bool
}
// NewQPSLimiter creates qpsLimiter.
func NewQPSLimiter(interval time.Duration, limit int) RateLimiter {
once := calcOnce(interval, limit)
l := &qpsLimiter{
limit: int32(limit),
interval: interval,
tokens: once,
once: once,
}
go l.startTicker(interval)
return l
}
// UpdateLimit update limitation of QPS. It is **not** concurrent-safe.
func (l *qpsLimiter) UpdateLimit(limit int) {
once := calcOnce(l.interval, limit)
atomic.StoreInt32(&l.limit, int32(limit))
atomic.StoreInt32(&l.once, once)
l.resetTokens(once)
}
// UpdateQPSLimit update the interval and limit. It is **not** concurrent-safe.
func (l *qpsLimiter) UpdateQPSLimit(interval time.Duration, limit int) {
once := calcOnce(interval, limit)
atomic.StoreInt32(&l.limit, int32(limit))
atomic.StoreInt32(&l.once, once)
l.resetTokens(once)
if interval != l.interval {
l.interval = interval
l.stopTicker()
go l.startTicker(interval)
}
}
// Acquire one token.
func (l *qpsLimiter) Acquire(ctx context.Context) bool {
if atomic.LoadInt32(&l.limit) <= 0 {
return true
}
if atomic.LoadInt32(&l.tokens) <= 0 {
return false
}
return atomic.AddInt32(&l.tokens, -1) >= 0
}
// Status returns the current status.
func (l *qpsLimiter) Status(ctx context.Context) (max, cur int, interval time.Duration) {
max = int(atomic.LoadInt32(&l.limit))
cur = int(atomic.LoadInt32(&l.tokens))
interval = l.interval
return
}
func (l *qpsLimiter) startTicker(interval time.Duration) {
l.ticker = time.NewTicker(interval)
defer l.ticker.Stop()
l.tickerDone = make(chan bool, 1)
tc := l.ticker.C
td := l.tickerDone
// ticker and tickerDone can be reset, cannot use l.ticker or l.tickerDone directly
for {
select {
case <-tc:
l.updateToken()
case <-td:
return
}
}
}
func (l *qpsLimiter) stopTicker() {
if l.tickerDone == nil {
return
}
select {
case l.tickerDone <- true:
default:
}
}
// Some deviation is allowed here to gain better performance.
func (l *qpsLimiter) updateToken() {
if atomic.LoadInt32(&l.limit) < atomic.LoadInt32(&l.tokens) {
return
}
once := atomic.LoadInt32(&l.once)
delta := atomic.LoadInt32(&l.limit) - atomic.LoadInt32(&l.tokens)
if delta > once || delta < 0 {
delta = once
}
newTokens := atomic.AddInt32(&l.tokens, delta)
if newTokens < once {
atomic.StoreInt32(&l.tokens, once)
}
}
func calcOnce(interval time.Duration, limit int) int32 {
if interval > time.Second {
interval = time.Second
}
once := int32(float64(limit) / (fixedWindowTime.Seconds() / interval.Seconds()))
if once < 0 {
once = 0
}
return once
}
func (l *qpsLimiter) resetTokens(once int32) {
if atomic.LoadInt32(&l.tokens) > once {
atomic.StoreInt32(&l.tokens, once)
}
}