-
Notifications
You must be signed in to change notification settings - Fork 13
Expand file tree
/
Copy pathworker_pool.go
More file actions
133 lines (105 loc) · 2.77 KB
/
Copy pathworker_pool.go
File metadata and controls
133 lines (105 loc) · 2.77 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
package varmq
import (
"context"
"time"
"github.com/goptics/varmq/internal/linkedlist"
"github.com/goptics/varmq/internal/pool"
)
func (w *worker[T, JobType]) TunePool(concurrency int) error {
if !w.IsActive() {
return w.getStatusError()
}
oldConcurrency := w.concurrency.Load()
safeConcurrency := withSafeConcurrency(concurrency)
if oldConcurrency == safeConcurrency {
return ErrSameConcurrency
}
w.concurrency.Store(safeConcurrency)
if safeConcurrency > oldConcurrency {
w.notifyToPullNextJobs()
return nil
}
if w.Configs.idleWorkerExpiryDuration != 0 {
return nil
}
shrinkPoolSize, minIdleWorkers := oldConcurrency-safeConcurrency, w.numMinIdleWorkers()
for shrinkPoolSize > 0 && w.pool.Len() != minIdleWorkers {
if node := w.pool.PopBack(); node != nil {
w.pool.Remove(node)
node.Value.Stop()
w.pool.Cache.Put(node)
shrinkPoolSize--
} else {
break
}
}
return nil
}
func (w *worker[T, JobType]) numMinIdleWorkers() int {
percentage := w.Configs.minIdleWorkerRatio
concurrency := w.concurrency.Load()
return int(max((concurrency*uint32(percentage))/100, 1))
}
func (w *worker[T, JobType]) goRemoveIdleWorkers() {
interval := w.Configs.idleWorkerExpiryDuration
if interval == 0 {
return
}
ticker := time.NewTicker(interval)
go func(ctx context.Context) {
for {
select {
case <-ctx.Done():
ticker.Stop()
return
case <-ticker.C:
targetIdleWorkers := w.numMinIdleWorkers()
if w.pool.Len() <= targetIdleWorkers {
continue
}
nodes := w.pool.NodeSlice()
for _, node := range nodes[targetIdleWorkers:] {
if node.Value.GetLastUsed().Add(interval).Before(time.Now()) &&
!(node.Next() == nil && node.Prev() == nil) {
w.pool.Remove(node)
node.Value.Stop()
w.pool.Cache.Put(node)
}
}
}
}
}(w.ctx)
}
func (w *worker[T, JobType]) removeAllWorkers() {
for _, node := range w.pool.NodeSlice() {
w.pool.Remove(node)
node.Value.Stop()
w.pool.Cache.Put(node)
}
}
func (w *worker[T, JobType]) initPoolNode() *linkedlist.Node[pool.Node[JobType]] {
node := w.pool.Cache.Get().(*linkedlist.Node[pool.Node[JobType]])
go node.Value.Serve(func(j JobType) {
w.workerFunc(j)
j.changeStatus(finished)
if err := j.Close(); err != nil {
w.sendError(err)
}
w.metrics.incCompleted()
w.freePoolNode(node)
w.releaseProcessingSlot()
})
return node
}
func (w *worker[T, JobType]) freePoolNode(node *linkedlist.Node[pool.Node[JobType]]) {
enabledIdleWorkersRemover := w.Configs.idleWorkerExpiryDuration > 0
if enabledIdleWorkersRemover {
node.Value.UpdateLastUsed()
}
if w.queues.Len() >= w.NumConcurrency() || enabledIdleWorkersRemover || w.pool.Len() < w.numMinIdleWorkers() {
w.pool.PushNode(node)
return
}
node.Value.Stop()
w.pool.Cache.Put(node)
}