-
Notifications
You must be signed in to change notification settings - Fork 1
/
scheduler.go
202 lines (178 loc) · 4.3 KB
/
scheduler.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
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
193
194
195
196
197
198
199
200
201
202
/*
* Copyright (c) 2017. Harrison Zhu <wcg6121@gmail.com>
* This file is part of djob <https://github.com/HZ89/djob>.
*
* djob is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* djob is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with djob. If not, see <http://www.gnu.org/licenses/>.
*/
package scheduler
import (
"errors"
"sort"
"time"
pb "github.com/HZ89/djob/message"
)
type analyzer interface {
Next(time.Time) time.Time
}
type jobEvent struct {
event string
job *pb.Job
}
type entry struct {
Job *pb.Job
Next time.Time
Perv time.Time
Analyzer analyzer
}
type Scheduler struct {
addEntry chan *entry
deleteEntry chan string
RunJobCh chan *pb.Job
stopCh chan struct{}
running bool
entries []*entry
nameToIndex map[string]int
}
type byTime []*entry
func (b byTime) Len() int { return len(b) }
func (b byTime) Swap(i, j int) { b[i], b[j] = b[j], b[i] }
func (b byTime) Less(i, j int) bool {
if b[i].Next.IsZero() {
return false
}
if b[j].Next.IsZero() {
return false
}
return b[i].Next.Before(b[j].Next)
}
func newEntery(job *pb.Job) (*entry, error) {
analyzer, err := Prepare(job.Schedule)
if err != nil {
return nil, err
}
return &entry{
Job: job,
Analyzer: analyzer,
}, nil
}
func New(runjobCh chan *pb.Job) *Scheduler {
return &Scheduler{
addEntry: make(chan *entry),
deleteEntry: make(chan string),
RunJobCh: runjobCh,
stopCh: make(chan struct{}),
entries: nil,
nameToIndex: make(map[string]int),
running: false,
}
}
func (s *Scheduler) deleteEntryByName(name string) error {
i, exists := s.nameToIndex[name]
if exists {
if i < len(s.entries) && s.entries[i].Job.Name == name {
// delete i
copy(s.entries[i:], s.entries[i+1:])
s.entries[len(s.entries)-1] = nil
s.entries = s.entries[:len(s.entries)-1]
}
delete(s.nameToIndex, name)
return nil
}
return errors.New("con't find job")
}
/*
TODO: 重写runJob,添加一个backend interface,包含异步任务执行方法,同步任务执行方法和任务执行结果查询方法
TODO: 添加 基于任务执行结果的调度
*/
func (s *Scheduler) runJob(job *pb.Job) {
s.RunJobCh <- job
}
// main running loop
func (s *Scheduler) run() {
now := time.Now().Local()
for _, e := range s.entries {
e.Next = e.Analyzer.Next(now)
}
for {
// sort by time
sort.Sort(byTime(s.entries))
for i, e := range s.entries {
s.nameToIndex[e.Job.Name] = i
}
var movement time.Time
// If there are no repeatable jobs, wait 10 years
if len(s.entries) == 0 || s.entries[0].Next.IsZero() {
movement = now.AddDate(10, 0, 0)
} else {
movement = s.entries[0].Next
}
select {
case now = <-time.After(movement.Sub(now)):
for _, e := range s.entries {
if e.Next != movement {
break
}
go s.runJob(e.Job)
e.Perv = e.Next
// get the next execution time point
e.Next = e.Analyzer.Next(movement)
if e.Next.IsZero() {
// delete non-repeatable job
s.deleteEntryByName(e.Job.Name)
}
}
continue
case e := <-s.addEntry:
s.deleteEntryByName(e.Job.Name)
s.entries = append(s.entries, e)
case name := <-s.deleteEntry:
s.deleteEntryByName(name)
case <-s.stopCh:
return
}
now = time.Now().Local()
}
}
func (s *Scheduler) Stop() {
s.stopCh <- struct{}{}
s.running = false
}
func (s *Scheduler) Start() {
s.running = true
go s.run()
}
func (s *Scheduler) AddJob(job *pb.Job) error {
now := time.Now().Local()
e, err := newEntery(job)
if err != nil {
return err
}
e.Next = e.Analyzer.Next(now)
s.addEntry <- e
return nil
}
func (s *Scheduler) DeleteJob(job *pb.Job) {
s.deleteEntry <- job.Name
}
func (s *Scheduler) JobCount() int {
return len(s.entries)
}
func (s *Scheduler) JobExist(job *pb.Job) bool {
for _, e := range s.entries {
if e.Job.Name == job.Name && e.Job.Region == job.Region {
return true
}
}
return false
}