mirror of
https://github.com/cgrates/cgrates.git
synced 2026-02-20 14:48:43 +05:00
102 lines
2.6 KiB
Go
102 lines
2.6 KiB
Go
/*
|
|
Rating system designed to be used in VoIP Carriers World
|
|
Copyright (C) 2013 ITsysCOM
|
|
|
|
This program 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.
|
|
|
|
This program 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 this program. If not, see <http://www.gnu.org/licenses/>
|
|
*/
|
|
|
|
package scheduler
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/cgrates/cgrates/rater"
|
|
"sort"
|
|
"time"
|
|
)
|
|
|
|
type Scheduler struct {
|
|
queue rater.ActionTimingPriotityList
|
|
timer *time.Timer
|
|
restartLoop chan bool
|
|
}
|
|
|
|
func NewScheduler() *Scheduler {
|
|
return &Scheduler{restartLoop: make(chan bool)}
|
|
}
|
|
|
|
func (s *Scheduler) Loop() {
|
|
for {
|
|
for len(s.queue) == 0 { //hang here if empty
|
|
<-s.restartLoop
|
|
}
|
|
a0 := s.queue[0]
|
|
now := time.Now()
|
|
if a0.GetNextStartTime().Equal(now) || a0.GetNextStartTime().Before(now) {
|
|
rater.Logger.Debug(fmt.Sprintf("%v - %v", a0.Tag, a0.Timing))
|
|
go a0.Execute()
|
|
s.queue = append(s.queue, a0)
|
|
s.queue = s.queue[1:]
|
|
sort.Sort(s.queue)
|
|
} else {
|
|
d := a0.GetNextStartTime().Sub(now)
|
|
rater.Logger.Info(fmt.Sprintf("Timer set to wait for %v", d))
|
|
s.timer = time.NewTimer(d)
|
|
select {
|
|
case <-s.timer.C:
|
|
// timer has expired
|
|
rater.Logger.Info(fmt.Sprintf("Time for action on %v", s.queue[0]))
|
|
case <-s.restartLoop:
|
|
// nothing to do, just continue the loop
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func (s *Scheduler) LoadActionTimings(storage rater.DataStorage) {
|
|
actionTimings, err := storage.GetAllActionTimings()
|
|
if err != nil {
|
|
rater.Logger.Warning(fmt.Sprintf("Cannot get action timings: %v", err))
|
|
}
|
|
// recreate the queue
|
|
s.queue = rater.ActionTimingPriotityList{}
|
|
for key, ats := range actionTimings {
|
|
toBeSaved := false
|
|
isAsap := false
|
|
newAts := make([]*rater.ActionTiming, 0)
|
|
for _, at := range ats {
|
|
isAsap = at.CheckForASAP()
|
|
toBeSaved = toBeSaved || isAsap
|
|
if at.IsOneTimeRun() {
|
|
rater.Logger.Info(fmt.Sprintf("Time for one time action on %v", key))
|
|
go at.Execute()
|
|
// do not append it to the newAts list to be saved
|
|
} else {
|
|
s.queue = append(s.queue, at)
|
|
newAts = append(newAts, at)
|
|
}
|
|
}
|
|
if toBeSaved {
|
|
storage.SetActionTimings(key, newAts)
|
|
}
|
|
}
|
|
sort.Sort(s.queue)
|
|
}
|
|
|
|
func (s *Scheduler) Restart() {
|
|
s.restartLoop <- true
|
|
if s.timer != nil {
|
|
s.timer.Stop()
|
|
}
|
|
}
|