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
203
204
205
206
207
208
209
210
211
212
213
|
import bisect
import time
from enigma import *
class TimerEntry:
StateWaiting = 0
StatePrepared = 1
StateRunning = 2
StateEnded = 3
def __init__(self, begin, end):
self.begin = begin
self.prepare_time = 20
self.end = end
self.state = 0
self.resetRepeated()
self.backoff = 0
self.disabled = False
def resetRepeated(self):
self.repeated = int(0)
def setRepeated(self, day):
self.repeated |= (2 ** day)
print "Repeated: " + str(self.repeated)
def isRunning(self):
return self.state == self.StateRunning
# update self.begin and self.end according to the self.repeated-flags
def processRepeated(self):
print "ProcessRepeated"
print time.strftime("%c", time.localtime(self.begin))
print time.strftime("%c", time.localtime(self.end))
if (self.repeated != 0):
now = int(time.time()) + 1
day = []
flags = self.repeated
for x in range(0, 7):
if (flags & 1 == 1):
day.append(0)
print "Day: " + str(x)
else:
day.append(1)
flags = flags >> 1
print time.strftime("%c", time.localtime(now))
print time.strftime("%c", time.localtime(self.begin))
print time.strftime("%c", time.localtime(self.end))
print str(time.localtime(self.begin).tm_wday)
while ((day[time.localtime(self.begin).tm_wday] != 0) or ((day[time.localtime(self.begin).tm_wday] == 0) and self.end < now)):
print time.strftime("%c", time.localtime(self.begin))
print time.strftime("%c", time.localtime(self.end))
self.begin += 86400
self.end += 86400
self.timeChanged()
def __lt__(self, o):
return self.getNextActivation() < o.getNextActivation()
# must be overridden
def activate(self):
pass
# can be overridden
def timeChanged(self):
pass
# check if a timer entry must be skipped
def shouldSkip(self):
return self.end <= time.time() and self.state == TimerEntry.StateWaiting
def abort(self):
self.end = time.time()
# in case timer has not yet started, but gets aborted (so it's preparing),
# set begin to now.
if self.begin > self.end:
self.begin = self.end
# must be overridden!
def getNextActivation():
pass
class Timer:
# the time between "polls". We do this because
# we want to account for time jumps etc.
# of course if they occur <100s before starting,
# it's not good. thus, you have to repoll when
# you change the time.
#
# this is just in case. We don't want the timer
# hanging. we use this "edge-triggered-polling-scheme"
# anyway, so why don't make it a bit more fool-proof?
MaxWaitTime = 100
def __init__(self):
self.timer_list = [ ]
self.processed_timers = [ ]
self.timer = eTimer()
self.timer.timeout.get().append(self.calcNextActivation)
self.lastActivation = time.time()
self.calcNextActivation()
self.on_state_change = [ ]
def stateChanged(self, entry):
for f in self.on_state_change:
f(entry)
def getNextRecordingTime(self):
if len(self.timer_list) > 0:
return self.timer_list[0].begin
return -1
def cleanup(self):
self.processed_timers = [entry for entry in self.processed_timers if entry.disabled]
def addTimerEntry(self, entry, noRecalc=0):
entry.processRepeated()
# when the timer has not yet started, and is already passed,
# don't go trough waiting/running/end-states, but sort it
# right into the processedTimers.
if entry.shouldSkip() or entry.state == TimerEntry.StateEnded or (entry.state == TimerEntry.StateWaiting and entry.disabled):
print "already passed, skipping"
bisect.insort(self.processed_timers, entry)
entry.state = TimerEntry.StateEnded
else:
bisect.insort(self.timer_list, entry)
if not noRecalc:
self.calcNextActivation()
def setNextActivation(self, when):
delay = int((when - time.time()) * 1000)
print "[timer.py] next activation: %d (in %d ms)" % (when, delay)
self.timer.start(delay, 1)
self.next = when
def calcNextActivation(self):
if self.lastActivation > time.time():
print "[timer.py] timewarp - re-evaluating all processed timers."
tl = self.processed_timers
self.processed_timers = [ ]
for x in tl:
# simulate a "waiting" state to give them a chance to re-occure
x.resetState()
self.addTimerEntry(x, noRecalc=1)
self.processActivation()
self.lastActivation = time.time()
min = int(time.time()) + self.MaxWaitTime
# calculate next activation point
if len(self.timer_list):
w = self.timer_list[0].getNextActivation()
if w < min:
min = w
self.setNextActivation(min)
def timeChanged(self, timer):
timer.timeChanged()
if timer.state == TimerEntry.StateEnded:
self.processed_timers.remove(timer)
else:
self.timer_list.remove(timer)
self.addTimerEntry(timer)
def doActivate(self, w):
self.timer_list.remove(w)
# when activating a timer which has already passed,
# simply abort the timer. don't run trough all the stages.
if w.shouldSkip():
w.state = TimerEntry.StateEnded
else:
# when active returns true, this means "accepted".
# otherwise, the current state is kept.
# the timer entry itself will fix up the delay then.
if w.activate():
w.state += 1
# did this timer reached the last state?
if w.state < TimerEntry.StateEnded:
# no, sort it into active list
bisect.insort(self.timer_list, w)
else:
# yes. Process repeated, and re-add.
if w.repeated:
w.processRepeated()
w.state = TimerEntry.StateWaiting
self.addTimerEntry(w)
else:
bisect.insort(self.processed_timers, w)
self.stateChanged(w)
def processActivation(self):
print "It's now ", time.strftime("%c", time.localtime(time.time()))
t = int(time.time()) + 1
# we keep on processing the first entry until it goes into the future.
while len(self.timer_list) and self.timer_list[0].getNextActivation() < t:
self.doActivate(self.timer_list[0])
|
