-
Notifications
You must be signed in to change notification settings - Fork 40
/
queue.go
253 lines (230 loc) · 6.19 KB
/
queue.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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
package gfsptqueue
import (
"net/http"
"sort"
"sync"
"time"
"github.com/bnb-chain/greenfield-storage-provider/base/types/gfsperrors"
coretask "github.com/bnb-chain/greenfield-storage-provider/core/task"
"github.com/bnb-chain/greenfield-storage-provider/core/taskqueue"
"github.com/bnb-chain/greenfield-storage-provider/pkg/log"
"github.com/bnb-chain/greenfield-storage-provider/pkg/metrics"
"github.com/bnb-chain/greenfield-storage-provider/util/maps"
)
const (
TaskQueue = "TaskQueue"
)
var (
ErrTaskRepeated = gfsperrors.Register(TaskQueue, http.StatusBadRequest, 970001, "request repeated")
ErrTaskQueueExceed = gfsperrors.Register(TaskQueue, http.StatusBadRequest, 970002, "request exceed limit")
)
var _ taskqueue.TQueue = &GfSpTQueue{}
var _ taskqueue.TQueueOnStrategy = &GfSpTQueue{}
type GfSpTQueue struct {
name string
current int64
tasks map[coretask.TKey]coretask.Task
cap int
mux sync.RWMutex
gcFunc func(task2 coretask.Task) bool
filterFunc func(task2 coretask.Task) bool
}
func NewGfSpTQueue(name string, cap int) taskqueue.TQueueOnStrategy {
return &GfSpTQueue{
name: name,
cap: cap,
tasks: make(map[coretask.TKey]coretask.Task),
}
}
// Len returns the length of queue.
func (t *GfSpTQueue) Len() int {
t.mux.RLock()
defer t.mux.RUnlock()
return len(t.tasks)
}
// Cap returns the capacity of queue.
func (t *GfSpTQueue) Cap() int {
return t.cap
}
// Has returns an indicator whether the task in queue.
func (t *GfSpTQueue) Has(key coretask.TKey) bool {
t.mux.Lock()
startTime := time.Now()
defer func() {
t.mux.Unlock()
metrics.QueueTime.WithLabelValues(t.name + "-has").Observe(time.Since(startTime).Seconds())
}()
return t.has(key)
}
// Top returns the top task in the queue, if the queue empty, returns nil.
func (t *GfSpTQueue) Top() coretask.Task {
t.mux.Lock()
startTime := time.Now()
defer func() {
t.mux.Unlock()
metrics.QueueTime.WithLabelValues(t.name + "-top").Observe(time.Since(startTime).Seconds())
}()
return t.top()
}
// Pop pops and returns the top task in queue, if the queue empty, returns nil.
func (t *GfSpTQueue) Pop() coretask.Task {
t.mux.Lock()
startTime := time.Now()
defer func() {
t.mux.Unlock()
metrics.QueueTime.WithLabelValues(t.name + "-pop").Observe(time.Since(startTime).Seconds())
}()
task := t.top()
if task != nil {
t.delete(task)
}
return task
}
// PopByKey pops the task by the task key, if the task does not exist , returns nil.
func (t *GfSpTQueue) PopByKey(key coretask.TKey) coretask.Task {
t.mux.Lock()
startTime := time.Now()
defer func() {
t.mux.Unlock()
metrics.QueueTime.WithLabelValues(t.name + "-pop_by_key").Observe(time.Since(startTime).Seconds())
}()
if !t.has(key) {
return nil
}
task, ok := t.tasks[key]
if !ok {
return nil
}
t.delete(task)
return task
}
// Push pushes the task in queue tail, if the queue len greater the capacity, returns error.
func (t *GfSpTQueue) Push(task coretask.Task) error {
t.mux.Lock()
startTime := time.Now()
defer func() {
t.mux.Unlock()
metrics.QueueTime.WithLabelValues(t.name + "-push").Observe(time.Since(startTime).Seconds())
}()
if t.has(task.Key()) {
return ErrTaskRepeated
}
if t.exceed() {
if t.gcFunc == nil {
log.Warnw("queue exceed", "queue", t.name, "cap", t.cap, "len", len(t.tasks))
return ErrTaskQueueExceed
}
clear := false
keys := maps.SortKeys(t.tasks)
for _, key := range keys {
if t.gcFunc(t.tasks[key]) {
t.delete(t.tasks[key])
clear = true
// only retire one task
break
}
}
if !clear {
log.Warnw("queue exceed", "queue", t.name, "cap", t.cap, "len", len(t.tasks))
return ErrTaskQueueExceed
}
}
t.add(task)
return nil
}
func (t *GfSpTQueue) exceed() bool {
return len(t.tasks) >= t.cap
}
func (t *GfSpTQueue) add(task coretask.Task) {
defer func() {
metrics.QueueSizeGauge.WithLabelValues(t.name).Set(float64(len(t.tasks)))
metrics.QueueCapGauge.WithLabelValues(t.name).Set(float64(t.cap))
}()
if task == nil || t.has(task.Key()) {
return
}
t.tasks[task.Key()] = task
}
func (t *GfSpTQueue) delete(task coretask.Task) {
if task == nil || !t.has(task.Key()) {
return
}
defer func() {
metrics.QueueSizeGauge.WithLabelValues(t.name).Set(float64(len(t.tasks)))
metrics.QueueCapGauge.WithLabelValues(t.name).Set(float64(t.cap))
metrics.TaskInQueueTime.WithLabelValues(t.name).Observe(
time.Since(time.Unix(task.GetCreateTime(), 0)).Seconds())
}()
delete(t.tasks, task.Key())
}
func (t *GfSpTQueue) has(key coretask.TKey) bool {
task, ok := t.tasks[key]
if ok && t.gcFunc != nil {
if t.gcFunc(task) {
delete(t.tasks, task.Key())
return false
}
}
return ok
}
func (t *GfSpTQueue) top() coretask.Task {
if len(t.tasks) == 0 {
return nil
}
var backupTasks []coretask.Task
var gcTasks []coretask.Task
defer func() {
for _, task := range gcTasks {
delete(t.tasks, task.Key())
}
}()
for _, task := range t.tasks {
if t.gcFunc != nil {
if t.gcFunc(task) {
gcTasks = append(gcTasks, task)
continue
}
}
if t.filterFunc != nil {
if !t.filterFunc(task) {
continue
}
}
backupTasks = append(backupTasks, task)
}
if len(backupTasks) == 0 {
return nil
}
sort.Slice(backupTasks, func(i, j int) bool {
return backupTasks[i].GetCreateTime() < backupTasks[j].GetCreateTime()
})
index := sort.Search(len(backupTasks), func(i int) bool { return backupTasks[i].GetCreateTime() > t.current })
if index == len(backupTasks) {
index = 0
}
if backupTasks[index] != nil {
t.current = backupTasks[index].GetCreateTime()
}
return backupTasks[index]
}
// SetFilterTaskStrategy sets the callback func to filter task for popping or topping.
func (t *GfSpTQueue) SetFilterTaskStrategy(filter func(coretask.Task) bool) {
t.mux.Lock()
defer t.mux.Unlock()
t.filterFunc = filter
}
// SetRetireTaskStrategy sets the callback func to retire task, when the queue is full, it will be
// called to retire tasks.
func (t *GfSpTQueue) SetRetireTaskStrategy(retire func(coretask.Task) bool) {
t.mux.Lock()
defer t.mux.Unlock()
t.gcFunc = retire
}
// ScanTask scans all tasks, and call the func one by one task.
func (t *GfSpTQueue) ScanTask(scan func(coretask.Task)) {
t.mux.RLock()
defer t.mux.RUnlock()
for _, task := range t.tasks {
scan(task)
}
}