fix time changed for ended timers
[enigma2.git] / timer.py
1 import bisect
2 import time
3 from enigma import *
4
5 class TimerEntry:
6         StateWaiting  = 0
7         StatePrepared = 1
8         StateRunning  = 2
9         StateEnded    = 3
10         
11         def __init__(self, begin, end):
12                 self.begin = begin
13                 self.prepare_time = 20
14                 self.end = end
15                 self.state = 0
16                 self.resetRepeated()
17                 self.backoff = 0
18                 
19                 self.disabled = False
20                 
21         def resetRepeated(self):
22                 self.repeated = int(0)
23
24         def setRepeated(self, day):
25                 self.repeated |= (2 ** day)
26                 print "Repeated: " + str(self.repeated)
27                 
28         def isRunning(self):
29                 return self.state == self.StateRunning
30                 
31         # update self.begin and self.end according to the self.repeated-flags
32         def processRepeated(self):
33                 print "ProcessRepeated"
34                 print time.strftime("%c", time.localtime(self.begin))
35                 print time.strftime("%c", time.localtime(self.end))
36                 if (self.repeated != 0):
37                         now = int(time.time()) + 1
38                         
39                         day = []
40                         flags = self.repeated
41                         for x in range(0, 7):
42                                 if (flags & 1 == 1):
43                                         day.append(0)
44                                         print "Day: " + str(x)
45                                 else:
46                                         day.append(1)
47                                 flags = flags >> 1
48
49                         print time.strftime("%c", time.localtime(now))
50                         print time.strftime("%c", time.localtime(self.begin))
51                         print time.strftime("%c", time.localtime(self.end))
52                         print str(time.localtime(self.begin).tm_wday)
53                         while ((day[time.localtime(self.begin).tm_wday] != 0) or ((day[time.localtime(self.begin).tm_wday] == 0) and self.end < now)):
54                                 print time.strftime("%c", time.localtime(self.begin))
55                                 print time.strftime("%c", time.localtime(self.end))
56                                 self.begin += 86400
57                                 self.end += 86400
58                         
59                         self.timeChanged()
60                         
61
62         def __lt__(self, o):
63                 return self.getNextActivation() < o.getNextActivation()
64         
65         # must be overridden
66         def activate(self):
67                 pass
68                 
69         # can be overridden
70         def timeChanged(self):
71                 pass
72
73         # check if a timer entry must be skipped
74         def shouldSkip(self):
75                 return self.end <= time.time() and self.state == TimerEntry.StateWaiting
76
77         def abort(self):
78                 self.end = time.time()
79                 
80                 # in case timer has not yet started, but gets aborted (so it's preparing),
81                 # set begin to now.
82                 if self.begin > self.end:
83                         self.begin = self.end
84         
85         # must be overridden!
86         def getNextActivation():
87                 pass
88
89 class Timer:
90         # the time between "polls". We do this because
91         # we want to account for time jumps etc.
92         # of course if they occur <100s before starting,
93         # it's not good. thus, you have to repoll when
94         # you change the time.
95         #
96         # this is just in case. We don't want the timer 
97         # hanging. we use this "edge-triggered-polling-scheme"
98         # anyway, so why don't make it a bit more fool-proof?
99         MaxWaitTime = 100
100
101         def __init__(self):
102                 self.timer_list = [ ]
103                 self.processed_timers = [ ]
104                 
105                 self.timer = eTimer()
106                 self.timer.timeout.get().append(self.calcNextActivation)
107                 self.lastActivation = time.time()
108                 
109                 self.calcNextActivation()
110                 self.on_state_change = [ ]
111         
112         def stateChanged(self, entry):
113                 for f in self.on_state_change:
114                         f(entry)
115                         
116         def cleanup(self):
117                 self.processed_timers = [entry for entry in self.processed_timers if entry.disabled]
118         
119         def addTimerEntry(self, entry, noRecalc=0):
120                 entry.processRepeated()
121
122                 # when the timer has not yet started, and is already passed,
123                 # don't go trough waiting/running/end-states, but sort it
124                 # right into the processedTimers.
125                 if entry.shouldSkip() or entry.state == TimerEntry.StateEnded or (entry.state == TimerEntry.StateWaiting and entry.disabled):
126                         print "already passed, skipping"
127                         bisect.insort(self.processed_timers, entry)
128                         entry.state = TimerEntry.StateEnded
129                 else:
130                         bisect.insort(self.timer_list, entry)
131                         if not noRecalc:
132                                 self.calcNextActivation()
133         
134         def setNextActivation(self, when):
135                 delay = int((when - time.time()) * 1000)
136                 print "[timer.py] next activation: %d (in %d ms)" % (when, delay)
137                 
138                 self.timer.start(delay, 1)
139                 self.next = when
140
141         def calcNextActivation(self):
142                 if self.lastActivation > time.time():
143                         print "[timer.py] timewarp - re-evaluating all processed timers."
144                         tl = self.processed_timers
145                         self.processed_timers = [ ]
146                         for x in tl:
147                                 # simulate a "waiting" state to give them a chance to re-occure
148                                 x.resetState()
149                                 self.addTimerEntry(x, noRecalc=1)
150                 
151                 self.processActivation()
152                 self.lastActivation = time.time()
153         
154                 min = int(time.time()) + self.MaxWaitTime
155                 
156                 # calculate next activation point
157                 if len(self.timer_list):
158                         w = self.timer_list[0].getNextActivation()
159                         if w < min:
160                                 min = w
161                 
162                 self.setNextActivation(min)
163         
164         def timeChanged(self, timer):
165                 timer.timeChanged()
166                 if timer.state == TimerEntry.StateEnded:
167                         self.processed_timers.remove(timer)
168                 else:
169                         self.timer_list.remove(timer)
170
171                 self.addTimerEntry(timer)
172         
173         def doActivate(self, w):
174                 self.timer_list.remove(w)
175                 
176                 # when activating a timer which has already passed,
177                 # simply abort the timer. don't run trough all the stages.
178                 if w.shouldSkip():
179                         w.state = TimerEntry.StateEnded
180                 else:
181                         # when active returns true, this means "accepted".
182                         # otherwise, the current state is kept.
183                         # the timer entry itself will fix up the delay then.
184                         if w.activate():
185                                 w.state += 1
186
187                 # did this timer reached the last state?
188                 if w.state < TimerEntry.StateEnded:
189                         # no, sort it into active list
190                         bisect.insort(self.timer_list, w)
191                 else:
192                         # yes. Process repeated, and re-add.
193                         if w.repeated:
194                                 w.processRepeated()
195                                 w.state = TimerEntry.StateWaiting
196                                 self.addTimerEntry(w)
197                         else:
198                                 bisect.insort(self.processed_timers, w)
199                 
200                 self.stateChanged(w)
201
202         def processActivation(self):
203                 print "It's now ", time.strftime("%c", time.localtime(time.time()))
204                 t = int(time.time()) + 1
205                 
206                 # we keep on processing the first entry until it goes into the future.
207                 while len(self.timer_list) and self.timer_list[0].getNextActivation() < t:
208                         self.doActivate(self.timer_list[0])