-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathgoroutine.go
More file actions
131 lines (116 loc) · 2.35 KB
/
goroutine.go
File metadata and controls
131 lines (116 loc) · 2.35 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
package scheduler
import (
"fmt"
"runtime"
"sync"
"sync/atomic"
"time"
)
type goroutine struct {
concurrent sync.WaitGroup
active atomic.Int32
}
func (s *goroutine) Concurrent() {
}
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)
s.active.Add(1)
s.concurrent.Add(1)
go func() {
defer s.active.Add(-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)
s.active.Add(1)
s.concurrent.Add(1)
go func() {
defer s.active.Add(-1)
defer s.concurrent.Done()
serial := &trampoline{}
runner <- serial.ScheduleRecursive(task)
serial.Run()
}()
return <-runner
}
func (s *goroutine) ScheduleLoop(from int, task func(index int, again func(next int))) Runner {
runner := make(chan Runner, 1)
s.active.Add(1)
s.concurrent.Add(1)
go func() {
defer s.active.Add(-1)
defer s.concurrent.Done()
serial := &trampoline{}
runner <- serial.ScheduleLoop(from, task)
serial.Run()
}()
return <-runner
}
func (s *goroutine) ScheduleFuture(due time.Duration, task func()) Runner {
cancel := make(cancel)
s.active.Add(1)
s.concurrent.Add(1)
go func() {
defer s.active.Add(-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)
s.active.Add(1)
s.concurrent.Add(1)
go func() {
defer s.active.Add(-1)
defer s.concurrent.Done()
serial := &trampoline{}
runner <- serial.ScheduleFutureRecursive(due, task)
serial.Run()
}()
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(s.active.Load())
}
func (s *goroutine) String() string {
return fmt.Sprintf("Goroutine{ tasks = %d }", s.active.Load())
}