forked from SagerNet/sing-tun
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathstack_go_wheel.go
More file actions
192 lines (179 loc) · 4.16 KB
/
Copy pathstack_go_wheel.go
File metadata and controls
192 lines (179 loc) · 4.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
package tun
import (
"math"
"time"
)
const (
goWheelTick = int64(time.Millisecond)
goWheelLevel0Slots = 128
goWheelLevel1Slots = 64
goWheelLevel1Ticks = goWheelLevel0Slots
goWheelRotationTicks = goWheelLevel1Slots * goWheelLevel1Ticks
)
const (
goWheelLevel0 uint8 = iota
goWheelLevel1
goWheelOverflow
)
type goWheelNode struct {
prev *goWheelNode
next *goWheelNode
slot **goWheelNode
deadline int64
level uint8
expire func(now int64)
}
type goWheel struct {
level0 [goWheelLevel0Slots]*goWheelNode
level1 [goWheelLevel1Slots]*goWheelNode
overflow *goWheelNode
currentTick int64
overflowMin int64
scheduled int
level0Count int
level1Count int
}
func (w *goWheel) schedule(node *goWheelNode, deadline int64) {
if node.slot != nil {
w.unlink(node)
} else {
w.scheduled++
}
node.deadline = deadline
w.file(node)
}
func (w *goWheel) cancel(node *goWheelNode) {
if node.slot == nil {
return
}
w.unlink(node)
w.scheduled--
}
func (w *goWheel) file(node *goWheelNode) {
tick := max((node.deadline+goWheelTick-1)/goWheelTick, w.currentTick+1)
var slot **goWheelNode
if tick-w.currentTick < goWheelLevel0Slots {
slot = &w.level0[tick%goWheelLevel0Slots]
node.level = goWheelLevel0
w.level0Count++
} else if tick/goWheelLevel1Ticks-w.currentTick/goWheelLevel1Ticks < goWheelLevel1Slots {
slot = &w.level1[(tick/goWheelLevel1Ticks)%goWheelLevel1Slots]
node.level = goWheelLevel1
w.level1Count++
} else {
slot = &w.overflow
node.level = goWheelOverflow
if w.overflow == nil || tick < w.overflowMin {
w.overflowMin = tick
}
}
node.prev = nil
node.next = *slot
if node.next != nil {
node.next.prev = node
}
*slot = node
node.slot = slot
}
func (w *goWheel) unlink(node *goWheelNode) {
if node.prev != nil {
node.prev.next = node.next
} else {
*node.slot = node.next
}
if node.next != nil {
node.next.prev = node.prev
}
node.prev = nil
node.next = nil
node.slot = nil
switch node.level {
case goWheelLevel0:
w.level0Count--
case goWheelLevel1:
w.level1Count--
}
}
func (w *goWheel) advance(now int64) {
targetTick := now / goWheelTick
for w.currentTick < targetTick {
if w.scheduled == 0 {
w.currentTick = targetTick
return
}
if w.level0Count == 0 {
boundary := (w.currentTick/goWheelLevel1Ticks + 1) * goWheelLevel1Ticks
if w.level1Count == 0 {
boundary = (w.currentTick/goWheelRotationTicks + 1) * goWheelRotationTicks
}
if boundary > targetTick {
w.currentTick = targetTick
return
}
w.currentTick = boundary
} else {
w.currentTick++
}
if w.currentTick%goWheelLevel1Ticks == 0 {
if w.currentTick%goWheelRotationTicks == 0 {
w.refile(&w.overflow)
}
w.refile(&w.level1[(w.currentTick/goWheelLevel1Ticks)%goWheelLevel1Slots])
}
w.fireSlot(&w.level0[w.currentTick%goWheelLevel0Slots], now)
}
}
func (w *goWheel) refile(slot **goWheelNode) {
chain := *slot
*slot = nil
for chain != nil {
node := chain
chain = chain.next
node.prev = nil
node.next = nil
node.slot = nil
if node.level == goWheelLevel1 {
w.level1Count--
}
w.file(node)
}
}
func (w *goWheel) fireSlot(slot **goWheelNode, now int64) {
for *slot != nil {
node := *slot
w.unlink(node)
w.scheduled--
node.expire(now)
}
}
func (w *goWheel) nextDeadline() (int64, bool) {
if w.scheduled == 0 {
return 0, false
}
deadline := int64(math.MaxInt64)
if w.level0Count > 0 {
for offset := int64(1); offset < goWheelLevel0Slots; offset++ {
tick := w.currentTick + offset
if w.level0[tick%goWheelLevel0Slots] != nil {
deadline = tick * goWheelTick
break
}
}
}
if w.level1Count > 0 {
level1Index := w.currentTick / goWheelLevel1Ticks
for offset := int64(1); offset < goWheelLevel1Slots; offset++ {
index := level1Index + offset
if w.level1[index%goWheelLevel1Slots] != nil {
deadline = min(deadline, index*goWheelLevel1Ticks*goWheelTick)
break
}
}
}
if w.overflow != nil {
rotation := (w.currentTick/goWheelRotationTicks + 1) * goWheelRotationTicks
landing := (w.overflowMin / goWheelRotationTicks) * goWheelRotationTicks
deadline = min(deadline, max(rotation, landing)*goWheelTick)
}
return deadline, true
}