11 def __init__(self, begin, end):
13 self.prepare_time = 20
21 def resetRepeated(self):
22 self.repeated = int(0)
24 def setRepeated(self, day):
25 self.repeated |= (2 ** day)
26 print "Repeated: " + str(self.repeated)
29 return self.state == self.StateRunning
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
44 print "Day: " + str(x)
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))
63 return self.getNextActivation() < o.getNextActivation()
70 def timeChanged(self):
73 # check if a timer entry must be skipped
75 return self.end <= time.time() and self.state == TimerEntry.StateWaiting
78 self.end = time.time()
80 # in case timer has not yet started, but gets aborted (so it's preparing),
82 if self.begin > self.end:
86 def getNextActivation():
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.
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?
102 self.timer_list = [ ]
103 self.processed_timers = [ ]
105 self.timer = eTimer()
106 self.timer.timeout.get().append(self.calcNextActivation)
107 self.lastActivation = time.time()
109 self.calcNextActivation()
110 self.on_state_change = [ ]
112 def stateChanged(self, entry):
113 for f in self.on_state_change:
117 new_processed_timers = []
118 for x in self.processed_timers:
120 new_processed_timers.append(x)
121 self.processed_timers = new_processed_timers
123 def addTimerEntry(self, entry, noRecalc=0):
124 entry.processRepeated()
126 # when the timer has not yet started, and is already passed,
127 # don't go trough waiting/running/end-states, but sort it
128 # right into the processedTimers.
129 if entry.shouldSkip() or entry.state == TimerEntry.StateEnded or (entry.state == TimerEntry.StateWaiting and entry.disabled):
130 print "already passed, skipping"
131 bisect.insort(self.processed_timers, entry)
132 entry.state = TimerEntry.StateEnded
134 bisect.insort(self.timer_list, entry)
136 self.calcNextActivation()
138 def setNextActivation(self, when):
139 delay = int((when - time.time()) * 1000)
140 print "[timer.py] next activation: %d (in %d ms)" % (when, delay)
142 self.timer.start(delay, 1)
145 def calcNextActivation(self):
146 if self.lastActivation > time.time():
147 print "[timer.py] timewarp - re-evaluating all processed timers."
148 tl = self.processed_timers
149 self.processed_timers = [ ]
151 # simulate a "waiting" state to give them a chance to re-occure
153 self.addTimerEntry(x, noRecalc=1)
155 self.processActivation()
156 self.lastActivation = time.time()
158 min = int(time.time()) + self.MaxWaitTime
160 # calculate next activation point
161 if len(self.timer_list):
162 w = self.timer_list[0].getNextActivation()
166 self.setNextActivation(min)
168 def timeChanged(self, timer):
170 self.timer_list.remove(timer)
172 self.addTimerEntry(timer)
174 def doActivate(self, w):
175 self.timer_list.remove(w)
177 # when activating a timer which has already passed,
178 # simply abort the timer. don't run trough all the stages.
181 bisect.insort(self.processed_timers, w)
183 # when active returns true, this means "accepted".
184 # otherwise, the current state is kept.
185 # the timer entry itself will fix up the delay then.
189 # did this timer reached the last state?
190 if w.state < TimerEntry.StateEnded:
191 # no, sort it into active list
192 bisect.insort(self.timer_list, w)
194 # yes. Process repeated, and re-add.
197 w.state = TimerEntry.StateWaiting
198 self.addTimerEntry(w)
200 bisect.insort(self.processed_timers, w)
204 def processActivation(self):
205 print "It's now ", time.strftime("%c", time.localtime(time.time()))
206 t = int(time.time()) + 1
208 # we keep on processing the first entry until it goes into the future.
209 while len(self.timer_list) and self.timer_list[0].getNextActivation() < t:
210 self.doActivate(self.timer_list[0])