-
Notifications
You must be signed in to change notification settings - Fork 1
/
goroutine.go
150 lines (130 loc) · 3.04 KB
/
goroutine.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
package scheduler
import (
"fmt"
"runtime"
"sync"
"sync/atomic"
"time"
)
// Goroutine is a concurrent scheduler. Schedule methods dispatch tasks
// asynchronously, running them concurrently with previously scheduled tasks.
// It is safe to call the Goroutine scheduling methods from multiple
// concurrently running goroutines. Nested tasks dispatched inside e.g.
// ScheduleRecursive by calling the function again() will be added to a
// serial queue and run in the order they were dispatched in.
var Goroutine = ConcurrentScheduler(&goroutine{})
// cancel
type cancel chan struct{}
func (c cancel) Cancel() {
close(c)
}
// goroutine
type goroutine struct {
sync.Mutex
concurrent sync.WaitGroup
active int32
}
func (s *goroutine) Now() time.Time {
return time.Now()
}
func (s *goroutine) Since(t time.Time) time.Duration {
return s.Now().Sub(t)
}
func (s *goroutine) Schedule(task func()) Runner {
cancel := make(cancel)
atomic.AddInt32(&s.active, 1)
s.concurrent.Add(1)
go func() {
defer atomic.AddInt32(&s.active, -1)
defer s.concurrent.Done()
select {
case <-cancel:
// cancel
default:
task()
}
}()
return cancel
}
func (s *goroutine) ScheduleRecursive(task func(again func())) Runner {
runner := make(chan Runner, 1)
atomic.AddInt32(&s.active, 1)
s.concurrent.Add(1)
go func() {
defer atomic.AddInt32(&s.active, -1)
defer s.concurrent.Done()
serial := New()
runner <- serial.ScheduleRecursive(task)
serial.Wait()
}()
return <-runner
}
func (s *goroutine) ScheduleLoop(from int, task func(index int, again func(next int))) Runner {
runner := make(chan Runner, 1)
atomic.AddInt32(&s.active, 1)
s.concurrent.Add(1)
go func() {
defer atomic.AddInt32(&s.active, -1)
defer s.concurrent.Done()
serial := New()
runner <- serial.ScheduleLoop(from, task)
serial.Wait()
}()
return <-runner
}
func (s *goroutine) ScheduleFuture(due time.Duration, task func()) Runner {
cancel := make(cancel)
atomic.AddInt32(&s.active, 1)
s.concurrent.Add(1)
go func() {
defer atomic.AddInt32(&s.active, -1)
defer s.concurrent.Done()
if due > 0 {
due := time.NewTimer(due)
select {
case <-cancel:
due.Stop()
case <-due.C:
task()
}
} else {
select {
case <-cancel:
// cancel
default:
task()
}
}
}()
return cancel
}
func (s *goroutine) ScheduleFutureRecursive(due time.Duration, task func(again func(time.Duration))) Runner {
runner := make(chan Runner, 1)
atomic.AddInt32(&s.active, 1)
s.concurrent.Add(1)
go func() {
defer atomic.AddInt32(&s.active, -1)
defer s.concurrent.Done()
serial := New()
runner <- serial.ScheduleFutureRecursive(due, task)
serial.Wait()
}()
return <-runner
}
func (s *goroutine) Wait() {
s.concurrent.Wait()
}
func (s *goroutine) Gosched() {
runtime.Gosched()
}
func (s *goroutine) IsConcurrent() bool {
return true
}
func (s *goroutine) Count() int {
return int(atomic.LoadInt32(&s.active))
}
func (s *goroutine) String() string {
return fmt.Sprintf("Goroutine{ tasks = %d }", atomic.LoadInt32(&s.active))
}
func (s *goroutine) Concurrent() {
}