-
Notifications
You must be signed in to change notification settings - Fork 267
/
task.go
378 lines (319 loc) · 8.53 KB
/
task.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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
/*
* Copyright 2020 The Dragonfly 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.
*/
//go:generate mockgen -destination ./mocks/task_mock.go -package mocks d7y.io/dragonfly/v2/scheduler/supervisor TaskManager
package supervisor
import (
"sync"
"time"
"go.uber.org/atomic"
logger "d7y.io/dragonfly/v2/internal/dflog"
"d7y.io/dragonfly/v2/pkg/container/list"
gc "d7y.io/dragonfly/v2/pkg/gc"
"d7y.io/dragonfly/v2/pkg/rpc/base"
"d7y.io/dragonfly/v2/scheduler/config"
)
const (
TaskGCID = "task"
TinyFileSize = 128
)
type TaskManager interface {
// Add task
Add(*Task)
// Get task
Get(string) (*Task, bool)
// Delete task
Delete(string)
// Get or add task
GetOrAdd(*Task) (*Task, bool)
}
type taskManager struct {
// peerManager is peer manager
peerManager PeerManager
// taskTTL is task TTL
taskTTL time.Duration
// taskTTI is task TTI
taskTTI time.Duration
// tasks is task map
tasks *sync.Map
}
func NewTaskManager(cfg *config.GCConfig, gcManager gc.GC, peerManager PeerManager) (TaskManager, error) {
m := &taskManager{
peerManager: peerManager,
taskTTL: cfg.TaskTTL,
taskTTI: cfg.TaskTTI,
tasks: &sync.Map{},
}
if err := gcManager.Add(gc.Task{
ID: TaskGCID,
Interval: cfg.PeerGCInterval,
Timeout: cfg.PeerGCInterval,
Runner: m,
}); err != nil {
return nil, err
}
return m, nil
}
func (m *taskManager) Delete(id string) {
m.tasks.Delete(id)
}
func (m *taskManager) Add(task *Task) {
m.tasks.Store(task.ID, task)
}
func (m *taskManager) Get(id string) (*Task, bool) {
task, ok := m.tasks.Load(id)
if !ok {
return nil, false
}
return task.(*Task), ok
}
func (m *taskManager) GetOrAdd(t *Task) (*Task, bool) {
task, ok := m.tasks.LoadOrStore(t.ID, t)
return task.(*Task), ok
}
func (m *taskManager) RunGC() error {
m.tasks.Range(func(key, value interface{}) bool {
taskID := key.(string)
task := value.(*Task)
elapsed := time.Since(task.lastAccessAt.Load())
if elapsed > m.taskTTI && task.IsSuccess() {
task.Log().Info("elapsed larger than taskTTI, task status become zombie")
task.SetStatus(TaskStatusZombie)
}
if task.GetPeers().Len() == 0 {
task.Log().Info("peers is empty, task status become waiting")
task.SetStatus(TaskStatusWaiting)
}
if elapsed > m.taskTTL {
// TODO lock
peers := m.peerManager.GetPeersByTask(taskID)
for _, peer := range peers {
task.Log().Infof("delete peer %s because task is time to leave", peer.ID)
m.peerManager.Delete(peer.ID)
}
task.Log().Info("delete task because elapsed larger than task TTL")
m.Delete(taskID)
}
return true
})
return nil
}
type TaskStatus uint8
func (status TaskStatus) String() string {
switch status {
case TaskStatusWaiting:
return "Waiting"
case TaskStatusRunning:
return "Running"
case TaskStatusSeeding:
return "Seeding"
case TaskStatusSuccess:
return "Success"
case TaskStatusZombie:
return "Zombie"
case TaskStatusFail:
return "Fail"
default:
return "unknown"
}
}
const (
TaskStatusWaiting TaskStatus = iota
TaskStatusRunning
TaskStatusSeeding
TaskStatusSuccess
TaskStatusZombie
TaskStatusFail
)
type Task struct {
// ID is task id
ID string
// URL is task download url
URL string
// URLMeta is task download url meta
URLMeta *base.UrlMeta
// DirectPiece is tiny piece data
DirectPiece []byte
// ContentLength is task total content length
ContentLength atomic.Int64
// CreateAt is peer create time
CreateAt *atomic.Time
// LastTriggerAt is peer last trigger time
LastTriggerAt *atomic.Time
// lastAccessAt is peer last access time
lastAccessAt *atomic.Time
// status is task status and type is TaskStatus
status atomic.Value
// peers is peer sorted unique list
peers list.SortedUniqueList
// BackToSourceWeight is back-to-source peer weight
BackToSourceWeight atomic.Int32
// backToSourcePeers is back-to-source peers list
backToSourcePeers []string
// pieces is piece map
pieces *sync.Map
// TotalPieceCount is total piece count
TotalPieceCount atomic.Int32
// task logger
logger *logger.SugaredLoggerOnWith
// task lock
lock sync.RWMutex
}
func NewTask(id, url string, meta *base.UrlMeta) *Task {
now := time.Now()
task := &Task{
ID: id,
URL: url,
URLMeta: meta,
CreateAt: atomic.NewTime(now),
LastTriggerAt: atomic.NewTime(now),
lastAccessAt: atomic.NewTime(now),
backToSourcePeers: []string{},
pieces: &sync.Map{},
peers: list.NewSortedUniqueList(),
logger: logger.WithTaskID(id),
}
task.status.Store(TaskStatusWaiting)
return task
}
func (task *Task) SetStatus(status TaskStatus) {
task.status.Store(status)
}
func (task *Task) GetStatus() TaskStatus {
return task.status.Load().(TaskStatus)
}
// IsSuccess determines that whether cdn status is success.
func (task *Task) IsSuccess() bool {
return task.GetStatus() == TaskStatusSuccess
}
// CanSchedule determines whether task can be scheduled
// only task status is seeding or success can be scheduled
func (task *Task) CanSchedule() bool {
return task.GetStatus() == TaskStatusSeeding || task.GetStatus() == TaskStatusSuccess
}
// IsWaiting determines whether task is waiting
func (task *Task) IsWaiting() bool {
return task.GetStatus() == TaskStatusWaiting
}
// IsHealth determines whether task is health
func (task *Task) IsHealth() bool {
return task.GetStatus() == TaskStatusRunning || task.GetStatus() == TaskStatusSeeding || task.GetStatus() == TaskStatusSuccess
}
// IsFail determines whether task is fail
func (task *Task) IsFail() bool {
return task.GetStatus() == TaskStatusFail
}
func (task *Task) Touch() {
task.lastAccessAt.Store(time.Now())
}
func (task *Task) UpdateSuccess(pieceCount int32, contentLength int64) {
task.lock.Lock()
defer task.lock.Unlock()
if task.GetStatus() != TaskStatusSuccess {
task.SetStatus(TaskStatusSuccess)
task.TotalPieceCount.Store(pieceCount)
task.ContentLength.Store(contentLength)
}
}
func (task *Task) AddPeer(peer *Peer) {
task.peers.Insert(peer)
}
func (task *Task) UpdatePeer(peer *Peer) {
task.peers.Insert(peer)
}
func (task *Task) DeletePeer(peer *Peer) {
task.peers.Remove(peer)
}
func (task *Task) GetPeers() list.SortedUniqueList {
return task.peers
}
func (task *Task) GetPiece(n int32) (*base.PieceInfo, bool) {
piece, ok := task.pieces.Load(n)
if !ok {
return nil, false
}
return piece.(*base.PieceInfo), ok
}
func (task *Task) GetOrAddPiece(p *base.PieceInfo) (*base.PieceInfo, bool) {
piece, ok := task.pieces.LoadOrStore(p.PieceNum, p)
return piece.(*base.PieceInfo), ok
}
func (task *Task) CanBackToSource() bool {
return task.BackToSourceWeight.Load() > 0
}
func (task *Task) ContainsBackToSourcePeer(peerID string) bool {
task.lock.RLock()
defer task.lock.RUnlock()
for _, backToSourcePeer := range task.backToSourcePeers {
if backToSourcePeer == peerID {
return true
}
}
return false
}
func (task *Task) AddBackToSourcePeer(peerID string) {
if ok := task.ContainsBackToSourcePeer(peerID); ok {
return
}
if task.BackToSourceWeight.Load() <= 0 {
return
}
task.lock.Lock()
defer task.lock.Unlock()
task.backToSourcePeers = append(task.backToSourcePeers, peerID)
task.BackToSourceWeight.Dec()
}
func (task *Task) GetBackToSourcePeers() []string {
task.lock.RLock()
defer task.lock.RUnlock()
return task.backToSourcePeers
}
func (task *Task) Pick(limit int, pickFn func(peer *Peer) bool) []*Peer {
var peers []*Peer
task.GetPeers().Range(func(item list.Item) bool {
if len(peers) >= limit {
return false
}
peer, ok := item.(*Peer)
if !ok {
return true
}
if pickFn(peer) {
peers = append(peers, peer)
}
return true
})
return peers
}
func (task *Task) PickReverse(limit int, pickFn func(peer *Peer) bool) []*Peer {
var peers []*Peer
task.GetPeers().ReverseRange(func(item list.Item) bool {
if len(peers) >= limit {
return false
}
peer, ok := item.(*Peer)
if !ok {
return true
}
if pickFn(peer) {
peers = append(peers, peer)
}
return true
})
return peers
}
func (task *Task) Log() *logger.SugaredLoggerOnWith {
return task.logger
}