mirror of
https://github.com/zrepl/zrepl.git
synced 2024-12-01 12:55:21 +01:00
2b6f3ece6b
Would add offset by 1 sec (possibly to avoid being scheduled just a little bit too early). Turns out this leads to delays for jobs with interval < 2s :)
159 lines
3.1 KiB
Go
159 lines
3.1 KiB
Go
package jobrun
|
|
|
|
import (
|
|
"fmt"
|
|
"time"
|
|
)
|
|
|
|
type Logger interface {
|
|
Printf(format string, v ...interface{})
|
|
}
|
|
|
|
type jobLogger struct {
|
|
MainLog Logger
|
|
JobName string
|
|
}
|
|
|
|
func (l jobLogger) Printf(format string, v ...interface{}) {
|
|
l.MainLog.Printf(fmt.Sprintf("job[%s]: %s", l.JobName, format), v...)
|
|
}
|
|
|
|
type Job struct {
|
|
Name string
|
|
RunFunc func(log Logger) (err error)
|
|
LastStart time.Time
|
|
LastError error
|
|
DueAt time.Time
|
|
RepeatStrategy RepeatStrategy
|
|
}
|
|
|
|
type JobRunResult struct {
|
|
Start time.Time
|
|
Finish time.Time
|
|
Error error
|
|
}
|
|
|
|
func (r JobRunResult) RunTime() time.Duration { return r.Finish.Sub(r.Start) }
|
|
|
|
type RepeatStrategy interface {
|
|
ShouldReschedule(lastResult JobRunResult) (nextDue time.Time, reschedule bool)
|
|
}
|
|
|
|
type JobRunner struct {
|
|
logger Logger
|
|
notificationChan chan Job
|
|
newJobChan chan Job
|
|
finishedJobChan chan Job
|
|
scheduleTimer <-chan time.Time
|
|
pending map[string]Job
|
|
running map[string]Job
|
|
}
|
|
|
|
func NewJobRunner(logger Logger) *JobRunner {
|
|
return &JobRunner{
|
|
logger: logger,
|
|
notificationChan: make(chan Job),
|
|
newJobChan: make(chan Job),
|
|
finishedJobChan: make(chan Job),
|
|
pending: make(map[string]Job),
|
|
running: make(map[string]Job),
|
|
}
|
|
}
|
|
|
|
func (r *JobRunner) AddJobChan() chan<- Job {
|
|
return r.newJobChan
|
|
}
|
|
|
|
func (r *JobRunner) AddJob(j Job) {
|
|
r.newJobChan <- j
|
|
}
|
|
|
|
func (r *JobRunner) NotificationChan() <-chan Job {
|
|
return r.notificationChan
|
|
}
|
|
|
|
func (r *JobRunner) Start() {
|
|
|
|
loop:
|
|
select {
|
|
|
|
case newJob := <-r.newJobChan:
|
|
|
|
_, jobPending := r.pending[newJob.Name]
|
|
_, jobRunning := r.running[newJob.Name]
|
|
|
|
if jobPending || jobRunning {
|
|
panic("job already in runner")
|
|
}
|
|
|
|
r.pending[newJob.Name] = newJob
|
|
|
|
case finishedJob := <-r.finishedJobChan:
|
|
|
|
delete(r.running, finishedJob.Name)
|
|
|
|
res := JobRunResult{
|
|
Start: finishedJob.LastStart,
|
|
Finish: time.Now(),
|
|
Error: finishedJob.LastError,
|
|
}
|
|
|
|
r.logger.Printf("[%s] finished after %s\n", finishedJob.Name, res.RunTime())
|
|
|
|
dueTime, resched := finishedJob.RepeatStrategy.ShouldReschedule(res)
|
|
if resched {
|
|
r.logger.Printf("[%s] rescheduling to %s", finishedJob.Name, dueTime)
|
|
finishedJob.DueAt = dueTime
|
|
r.pending[finishedJob.Name] = finishedJob
|
|
}
|
|
|
|
case <-r.scheduleTimer:
|
|
}
|
|
|
|
if len(r.pending) == 0 && len(r.running) == 0 {
|
|
return
|
|
}
|
|
|
|
// Find jobs to run
|
|
var now time.Time
|
|
var jobPending bool
|
|
|
|
now = time.Now()
|
|
jobPending = false
|
|
|
|
nextJobDue := now.Add(time.Minute) // max(pending.Interval)
|
|
|
|
for jobName, job := range r.pending {
|
|
|
|
if job.DueAt.After(now) {
|
|
if job.DueAt.Before(nextJobDue) {
|
|
nextJobDue = job.DueAt
|
|
}
|
|
jobPending = true
|
|
continue
|
|
}
|
|
// This job is due, run it
|
|
|
|
delete(r.pending, jobName)
|
|
r.running[jobName] = job
|
|
job.LastStart = now
|
|
|
|
go func(job Job) {
|
|
jobLog := jobLogger{r.logger, job.Name}
|
|
if err := job.RunFunc(jobLog); err != nil {
|
|
job.LastError = err
|
|
r.notificationChan <- job
|
|
}
|
|
r.finishedJobChan <- job
|
|
}(job)
|
|
|
|
}
|
|
|
|
if jobPending || len(r.running) > 0 {
|
|
r.logger.Printf("waiting until %v\n", nextJobDue)
|
|
r.scheduleTimer = time.After(nextJobDue.Sub(now))
|
|
goto loop
|
|
}
|
|
|
|
}
|