forked from QuantumNous/new-api
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsystem_task.go
More file actions
524 lines (471 loc) · 16 KB
/
Copy pathsystem_task.go
File metadata and controls
524 lines (471 loc) · 16 KB
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
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
package service
import (
"context"
"errors"
"fmt"
"sync"
"time"
"github.com/QuantumNous/new-api/common"
"github.com/QuantumNous/new-api/logger"
"github.com/QuantumNous/new-api/model"
"github.com/bytedance/gopkg/util/gopool"
)
const (
// systemTaskRunnerIdleInterval is the fallback poll interval used to pick up
// tasks created on other nodes and mark expired leases failed.
systemTaskRunnerIdleInterval = 15 * time.Second
systemTaskLockTTL = 60 * time.Second
logCleanupBatchSize = 100
// systemTaskSchedulerInterval throttles how often the scheduler/stale-lock
// pass runs, independent of how often the runner wakes to claim tasks.
systemTaskSchedulerInterval = 15 * time.Second
systemTaskStaleLockInterval = 30 * time.Second
)
// SystemTaskHandler executes a claimed task of a specific type. Run owns the
// task lifecycle from claim to terminal state: it MUST call
// model.FinishSystemTask (succeeded/failed) before returning and MUST honor
// ctx cancellation, which the runner triggers if the per-type lock is lost.
type SystemTaskHandler interface {
Type() string
Run(ctx context.Context, task *model.SystemTask, runnerID string)
}
// ScheduledSystemTaskHandler is a SystemTaskHandler that the scheduler also
// creates periodically when enabled and the configured interval has elapsed
// since the last run.
type ScheduledSystemTaskHandler interface {
SystemTaskHandler
Enabled() bool
Interval() time.Duration
NewPayload() any
}
var (
systemTaskHandlersMu sync.RWMutex
systemTaskHandlers = map[string]SystemTaskHandler{}
)
// RegisterSystemTaskHandler registers a handler keyed by its Type(). It must be
// called before StartSystemTaskRunner (or any time, since the runner snapshots
// the registry every pass). Re-registering a type replaces the previous handler.
func RegisterSystemTaskHandler(h SystemTaskHandler) {
if h == nil {
return
}
systemTaskHandlersMu.Lock()
defer systemTaskHandlersMu.Unlock()
systemTaskHandlers[h.Type()] = h
}
func registeredSystemTaskHandlers() []SystemTaskHandler {
systemTaskHandlersMu.RLock()
defer systemTaskHandlersMu.RUnlock()
handlers := make([]SystemTaskHandler, 0, len(systemTaskHandlers))
for _, h := range systemTaskHandlers {
handlers = append(handlers, h)
}
return handlers
}
// logCleanupHandler wraps the existing on-demand log cleanup task as a
// registered (non-scheduled) handler. It is created via StartLogCleanupTask.
type logCleanupHandler struct{}
func (logCleanupHandler) Type() string { return model.SystemTaskTypeLogCleanup }
func (logCleanupHandler) Run(ctx context.Context, task *model.SystemTask, runnerID string) {
runLogCleanupTask(ctx, task, runnerID)
}
func init() {
RegisterSystemTaskHandler(logCleanupHandler{})
}
type LogCleanupPayload struct {
TargetTimestamp int64 `json:"target_timestamp"`
BatchSize int `json:"batch_size"`
}
type LogCleanupState struct {
Total int64 `json:"total"`
Processed int64 `json:"processed"`
Progress int `json:"progress"`
Remaining int64 `json:"remaining"`
}
type LogCleanupResult struct {
DeletedCount int64 `json:"deleted_count"`
}
var (
systemTaskRunnerOnce sync.Once
// systemTaskWakeup signals the runner to check for runnable tasks
// immediately instead of waiting for the idle poll. Buffered so a signal
// raised while the runner is busy is not lost and is handled on the next loop.
systemTaskWakeup = make(chan struct{}, 1)
)
// notifySystemTaskRunner wakes the runner without blocking. If a wakeup is
// already pending it is a no-op, which is fine since one pass drains all work.
func notifySystemTaskRunner() {
select {
case systemTaskWakeup <- struct{}{}:
default:
}
}
func StartSystemTaskRunner() {
systemTaskRunnerOnce.Do(func() {
if !common.IsMasterNode {
return
}
runnerID := fmt.Sprintf("%s-%s", common.NodeName, common.GetRandomString(8))
gopool.Go(func() {
logger.LogInfo(context.Background(), fmt.Sprintf("system task runner started: runner=%s idle_interval=%s", runnerID, systemTaskRunnerIdleInterval))
ticker := time.NewTicker(systemTaskRunnerIdleInterval)
defer ticker.Stop()
var lastScheduler time.Time
var lastStaleLockCleanup time.Time
runPass := func() {
// The scheduler/stale-lock pass is throttled independently of the
// claim pass: wakeups (e.g. a manual log cleanup) should claim
// immediately without re-running the scheduler every time.
now := time.Now()
if now.Sub(lastStaleLockCleanup) >= systemTaskStaleLockInterval {
lastStaleLockCleanup = now
if err := model.ExpireStaleSystemTaskLocks(common.GetTimestamp()); err != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task stale lock cleanup failed: %v", err))
}
}
if now.Sub(lastScheduler) >= systemTaskSchedulerInterval {
lastScheduler = now
runSystemTaskScheduler()
}
runSystemTaskClaimPass(runnerID)
}
runPass()
for {
select {
case <-ticker.C:
case <-systemTaskWakeup:
}
runPass()
}
})
})
}
func StartLogCleanupTask(targetTimestamp int64) (*model.SystemTask, error) {
if targetTimestamp <= 0 {
return nil, errors.New("target timestamp is required")
}
activeTask, err := model.GetActiveSystemTask(model.SystemTaskTypeLogCleanup)
if err != nil {
return nil, err
}
if activeTask != nil {
return activeTask, nil
}
payload := LogCleanupPayload{
TargetTimestamp: targetTimestamp,
BatchSize: logCleanupBatchSize,
}
state := LogCleanupState{}
task, err := model.CreateSystemTask(model.SystemTaskTypeLogCleanup, payload, state)
if err != nil {
activeTask, activeErr := model.GetActiveSystemTask(model.SystemTaskTypeLogCleanup)
if activeErr == nil && activeTask != nil {
return activeTask, nil
}
return nil, err
}
notifySystemTaskRunner()
return task, nil
}
// EnqueueSystemTask creates an on-demand task of the given type. The returned
// bool is true only when a new pending row was created; false means an active
// task of the same type already exists and was returned.
func EnqueueSystemTask(taskType string, payload any) (*model.SystemTask, bool, error) {
activeTask, err := model.GetActiveSystemTask(taskType)
if err != nil {
return nil, false, err
}
if activeTask != nil {
return activeTask, false, nil
}
task, err := model.CreateSystemTask(taskType, payload, nil)
if err != nil {
activeTask, activeErr := model.GetActiveSystemTask(taskType)
if activeErr == nil && activeTask != nil {
return activeTask, false, nil
}
return nil, false, err
}
notifySystemTaskRunner()
return task, true, nil
}
// runSystemTaskClaimPass tries to claim one pending task per registered type
// and dispatches each claimed task in its own goroutine so a long-running
// handler (e.g. channel test) never blocks another type (e.g. log cleanup).
func runSystemTaskClaimPass(runnerID string) {
handlers := registeredSystemTaskHandlers()
taskTypes := make([]string, 0, len(handlers))
for _, handler := range handlers {
taskTypes = append(taskTypes, handler.Type())
}
pendingTasks, err := model.FindEarliestPendingSystemTasks(taskTypes)
if err != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task runner query failed: %v", err))
return
}
for _, handler := range handlers {
task := pendingTasks[handler.Type()]
if task == nil {
continue
}
claimedTask, claimed, err := model.ClaimSystemTask(task.ID, handler.Type(), runnerID, systemTaskLockUntil())
if err != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task claim failed: %v", err))
continue
}
if !claimed {
continue
}
dispatchHandler := handler
dispatchTask := claimedTask
gopool.Go(func() {
runWithLeaseHeartbeat(dispatchTask, runnerID, func(ctx context.Context) {
dispatchHandler.Run(ctx, dispatchTask, runnerID)
})
})
}
}
// runSystemTaskScheduler creates a new task row for each enabled scheduled
// handler whose interval has elapsed since its last run and that has no active
// row. The task active_key unique index deduplicates concurrent creation while
// the per-type lock guarantees only one runner executes the task.
func runSystemTaskScheduler() {
now := common.GetTimestamp()
handlers := registeredSystemTaskHandlers()
scheduledHandlers := make([]ScheduledSystemTaskHandler, 0, len(handlers))
taskTypes := make([]string, 0, len(handlers))
for _, handler := range handlers {
scheduled, ok := handler.(ScheduledSystemTaskHandler)
if !ok || !scheduled.Enabled() {
continue
}
scheduledHandlers = append(scheduledHandlers, scheduled)
taskTypes = append(taskTypes, scheduled.Type())
}
latestTasks, err := model.GetLatestSystemTasks(taskTypes)
if err != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task scheduler query failed: %v", err))
return
}
for _, scheduled := range scheduledHandlers {
latest := latestTasks[scheduled.Type()]
if latest != nil {
if latest.Status == model.SystemTaskStatusPending || latest.Status == model.SystemTaskStatusRunning {
continue // an active row already exists
}
if now-latest.UpdatedAt < int64(scheduled.Interval().Seconds()) {
continue // not due yet
}
}
if _, err := model.CreateSystemTask(scheduled.Type(), scheduled.NewPayload(), nil); err != nil {
activeTask, activeErr := model.GetActiveSystemTask(scheduled.Type())
if activeErr == nil && activeTask != nil {
continue
}
if activeErr != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task scheduler active lookup failed: type=%s err=%v", scheduled.Type(), activeErr))
}
logger.LogWarn(context.Background(), fmt.Sprintf("system task scheduler create failed: type=%s err=%v", scheduled.Type(), err))
continue
}
}
}
// runWithLeaseHeartbeat renews the per-type lock on a background ticker while
// fn runs. The TTL is a crash-detection window, not a task time limit: an
// arbitrarily long handler stays alive as long as the heartbeat succeeds.
func runWithLeaseHeartbeat(task *model.SystemTask, runnerID string, fn func(ctx context.Context)) {
ctx, cancel := context.WithCancel(context.Background())
defer cancel()
interval := systemTaskLockTTL / 3
if interval <= 0 {
interval = systemTaskLockTTL
}
ticker := time.NewTicker(interval)
defer ticker.Stop()
done := make(chan struct{})
go func() {
for {
select {
case <-done:
return
case <-ticker.C:
if err := model.RenewSystemTaskLock(task.TaskID, runnerID, systemTaskLockUntil()); err != nil {
cancel()
return
}
}
}
}()
fn(ctx)
close(done)
}
func runLogCleanupTask(ctx context.Context, task *model.SystemTask, runnerID string) {
payload := LogCleanupPayload{}
if err := task.DecodePayload(&payload); err != nil {
failSystemTask(task, runnerID, err)
return
}
if payload.TargetTimestamp <= 0 {
failSystemTask(task, runnerID, errors.New("target timestamp is required"))
return
}
if payload.BatchSize <= 0 {
payload.BatchSize = logCleanupBatchSize
}
state := LogCleanupState{}
if err := task.DecodeState(&state); err != nil {
failSystemTask(task, runnerID, err)
return
}
for {
remaining, err := model.CountOldLog(ctx, payload.TargetTimestamp)
if err != nil {
failSystemTask(task, runnerID, err)
return
}
syncLogCleanupStateFromRemaining(&state, remaining)
if err := model.UpdateSystemTaskState(task.TaskID, runnerID, state); err != nil {
logSystemTaskLockError(ctx, task, err)
return
}
if state.Remaining == 0 {
break
}
// Track whether this pass deleted anything so a fresh recount that still
// reports remaining rows resumes immediately instead of waiting for the
// lock to expire. If a whole pass deletes nothing while rows remain, the
// rows cannot be removed and we fail instead of busy-looping.
progressed := false
for state.Remaining > 0 {
rowsAffected, err := model.DeleteOldLogBatch(ctx, payload.TargetTimestamp, payload.BatchSize)
if err != nil {
failSystemTask(task, runnerID, err)
return
}
if rowsAffected == 0 {
break
}
progressed = true
state.Processed += rowsAffected
if state.Total < state.Processed {
state.Total = state.Processed
}
if state.Remaining > rowsAffected {
state.Remaining -= rowsAffected
} else {
state.Remaining = 0
}
state.Progress = logCleanupProgress(state.Processed, state.Total)
if err := model.UpdateSystemTaskState(task.TaskID, runnerID, state); err != nil {
logSystemTaskLockError(ctx, task, err)
return
}
}
if !progressed {
failSystemTask(task, runnerID, errors.New("no log rows were deleted"))
return
}
}
state.Remaining = 0
state.Progress = 100
if state.Total < state.Processed {
state.Total = state.Processed
}
if err := model.UpdateSystemTaskState(task.TaskID, runnerID, state); err != nil {
logSystemTaskLockError(ctx, task, err)
return
}
result := LogCleanupResult{DeletedCount: state.Processed}
if err := model.FinishSystemTask(task.TaskID, runnerID, model.SystemTaskStatusSucceeded, result, ""); err != nil {
logSystemTaskLockError(ctx, task, err)
}
}
func syncLogCleanupStateFromRemaining(state *LogCleanupState, remaining int64) {
if state.Total <= 0 {
state.Total = remaining
state.Processed = 0
} else {
processedFromRemaining := state.Total - remaining
if processedFromRemaining > state.Processed {
state.Processed = processedFromRemaining
}
}
if state.Processed < 0 {
state.Processed = 0
}
state.Remaining = remaining
state.Progress = logCleanupProgress(state.Processed, state.Total)
}
func logCleanupProgress(processed int64, total int64) int {
if total <= 0 {
return 100
}
if processed <= 0 {
return 0
}
if processed >= total {
return 100
}
return int(processed * 100 / total)
}
func systemTaskLockUntil() int64 {
return common.GetTimestamp() + int64(systemTaskLockTTL.Seconds())
}
// SystemTaskProgress is the state shape used by handlers that report percentage
// progress (channel test, model update). The frontend reads the progress field
// (0-100) to render a per-task progress indicator.
type SystemTaskProgress struct {
Total int `json:"total"`
Processed int `json:"processed"`
Progress int `json:"progress"`
}
// NewSystemTaskProgressReporter returns a throttled progress callback bound to a
// running task. Handlers call it with (processed, total) as they iterate work;
// it persists a {processed,total,progress} state at most once every ~2s, always
// emitting the first update and the final 100%.
// Lock-loss errors are ignored: the lease heartbeat cancels the handler ctx on
// loss, so progress writes are best-effort and never abort the run themselves.
// The returned func is single-goroutine only (call it from the handler loop).
func NewSystemTaskProgressReporter(task *model.SystemTask, runnerID string) func(processed, total int) {
const minWriteInterval = 2 * time.Second
var (
lastWriteAt time.Time
lastProgress = -1
)
return func(processed, total int) {
progress := 100
if total > 0 {
progress = processed * 100 / total
}
if progress < 0 {
progress = 0
} else if progress > 100 {
progress = 100
}
if progress < 100 {
if progress == lastProgress {
return
}
if !lastWriteAt.IsZero() && time.Since(lastWriteAt) < minWriteInterval {
return
}
}
lastProgress = progress
lastWriteAt = time.Now()
state := SystemTaskProgress{Total: total, Processed: processed, Progress: progress}
_ = model.UpdateSystemTaskState(task.TaskID, runnerID, state)
}
}
func failSystemTask(task *model.SystemTask, runnerID string, err error) {
logger.LogWarn(context.Background(), fmt.Sprintf("system task %s failed: %v", task.TaskID, err))
if finishErr := model.FinishSystemTask(task.TaskID, runnerID, model.SystemTaskStatusFailed, nil, err.Error()); finishErr != nil {
logger.LogWarn(context.Background(), fmt.Sprintf("system task %s failed to save failure state: %v", task.TaskID, finishErr))
}
}
func logSystemTaskLockError(ctx context.Context, task *model.SystemTask, err error) {
if errors.Is(err, model.ErrSystemTaskLockLost) {
logger.LogWarn(ctx, fmt.Sprintf("system task %s lock lost", task.TaskID))
return
}
logger.LogWarn(ctx, fmt.Sprintf("system task %s update failed: %v", task.TaskID, err))
}