-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtask.go
127 lines (104 loc) · 2.14 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
package hio
import (
"sync"
"sync/atomic"
"unsafe"
)
var (
taskPool = &sync.Pool{
New: func() interface{} {
return &Task{}
},
}
taskNodePool = &sync.Pool{
New: func() interface{} {
return &taskNode{}
},
}
)
type Task struct {
fn func(arg interface{}) error
arg interface{}
}
func (t *Task) Release() {
t.fn = nil
t.arg = nil
taskPool.Put(t)
}
type taskNode struct {
next unsafe.Pointer
task *Task
}
func (t *taskNode) Release() {
t.task = nil
t.next = unsafe.Pointer(nil)
taskNodePool.Put(t)
}
type taskQueue struct {
head unsafe.Pointer
tail unsafe.Pointer
}
func (t *taskQueue) Enqueue(task *Task) {
node := newTaskNode(task)
for {
tail := t.load(&t.tail)
next := t.load(&tail.next)
if tail == t.load(&t.tail) {
if next == nil {
if atomic.CompareAndSwapPointer(&tail.next, unsafe.Pointer(next), unsafe.Pointer(node)) {
atomic.CompareAndSwapPointer(&t.tail, unsafe.Pointer(tail), unsafe.Pointer(next))
break
}
} else {
atomic.CompareAndSwapPointer(&t.tail, unsafe.Pointer(tail), unsafe.Pointer(next))
}
}
}
}
func (t *taskQueue) Dequeue() (*Task, bool) {
var res *Task
for {
head := t.load(&t.head)
tail := t.load(&t.tail)
next := t.load(&head.next)
if head == t.load(&t.head) {
if head == tail {
if tail == nil {
return nil, false
} else {
atomic.CompareAndSwapPointer(&t.tail, unsafe.Pointer(tail), unsafe.Pointer(next))
}
} else {
res = next.task
if atomic.CompareAndSwapPointer(&t.head, unsafe.Pointer(head), unsafe.Pointer(next)) {
next.task = nil
head.Release()
break
}
}
}
}
return res, true
}
func (t *taskQueue) load(p *unsafe.Pointer) *taskNode {
return (*taskNode)(atomic.LoadPointer(p))
}
func newTaskQueue() *taskQueue {
q := &taskQueue{}
node := newTaskNode(nil)
q.head = unsafe.Pointer(node)
q.tail = q.head
return q
}
func NewTask(fn func(interface{}) error, arg interface{}) *Task {
t := taskPool.Get().(*Task)
t.fn = fn
t.arg = arg
return t
}
func newTaskNode(task *Task) *taskNode {
node := taskNodePool.Get().(*taskNode)
node.task = task
node.next = unsafe.Pointer(nil)
return node
}