2 # include <simgear_config.h>
5 #include "event_mgr.hxx"
7 #include <simgear/debug/logstream.hxx>
9 void SGEventMgr::add(const std::string& name, SGCallback* cb,
10 double interval, double delay,
11 bool repeat, bool simtime)
13 // Clamp the delay value to 1 usec, so that user code can use
14 // "zero" as a synonym for "next frame".
15 if(delay <= 0) delay = 1e-6;
16 if(interval <= 0) interval = 1e-6; // No timer endless loops please...
18 SGTimer* t = new SGTimer;
19 t->interval = interval;
25 SGTimerQueue* q = simtime ? &_simQueue : &_rtQueue;
41 SGEventMgr::SGEventMgr() :
47 SGEventMgr::~SGEventMgr()
52 void SGEventMgr::unbind()
58 void SGEventMgr::init()
61 // protected against duplicate calls here, in case
62 // init ever does something more complex in the future.
69 void SGEventMgr::shutdown()
77 void SGEventMgr::update(double delta_time_sec)
79 _simQueue.update(delta_time_sec);
81 double rt = _rtProp ? _rtProp->getDoubleValue() : 0;
85 void SGEventMgr::removeTask(const std::string& name)
87 // due to the ordering of the event-mgr in FG, tasks can be removed
88 // after we are shutdown (and hence, have all been cleared). Guard
89 // against this so we don't generate warnings below.
94 SGTimer* t = _simQueue.findByName(name);
97 } else if ((t = _rtQueue.findByName(name))) {
100 SG_LOG(SG_GENERAL, SG_WARN, "removeTask: no task found with name:" << name);
104 // mark as not repeating so that the SGTimerQueue::update()
112 ////////////////////////////////////////////////////////////////////////
114 // This is the priority queue implementation:
115 ////////////////////////////////////////////////////////////////////////
117 SGTimerQueue::SGTimerQueue(int size)
122 while(size > _tableSize)
123 _tableSize = ((_tableSize + 1)<<1) - 1;
125 _table = new HeapEntry[_tableSize];
126 for(int i=0; i<_tableSize; i++) {
133 SGTimerQueue::~SGTimerQueue()
139 void SGTimerQueue::clear()
142 for(int i=0; i<_numEntries; i++) {
143 delete _table[i].timer;
148 // clear entire table to empty
149 for(int i=0; i<_tableSize; i++) {
155 void SGTimerQueue::update(double deltaSecs)
158 while(_numEntries && nextTime() <= _now) {
159 SGTimer* t = remove();
161 insert(t, t->interval);
162 // warning: this is not thread safe
163 // but the entire timer queue isn't either
172 void SGTimerQueue::insert(SGTimer* timer, double time)
174 if(_numEntries >= _tableSize)
178 _table[_numEntries-1].pri = -(_now + time);
179 _table[_numEntries-1].timer = timer;
181 siftUp(_numEntries-1);
184 SGTimer* SGTimerQueue::remove(SGTimer* t)
187 for(entry=0; entry<_numEntries; entry++)
188 if(_table[entry].timer == t)
190 if(entry == _numEntries)
193 // Swap in the last item in the table, and sift down
194 swap(entry, _numEntries-1);
201 SGTimer* SGTimerQueue::remove()
203 if(_numEntries == 0) {
205 } else if(_numEntries == 1) {
207 return _table[0].timer;
210 SGTimer *result = _table[0].timer;
211 _table[0] = _table[_numEntries - 1];
217 void SGTimerQueue::siftDown(int n)
219 // While we have children bigger than us, swap us with the biggest
221 while(lchild(n) < _numEntries) {
222 int bigc = lchild(n);
223 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
225 if(pri(bigc) <= pri(n))
232 void SGTimerQueue::siftUp(int n)
234 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
241 void SGTimerQueue::growArray()
243 _tableSize = ((_tableSize+1)<<1) - 1;
244 HeapEntry *newTable = new HeapEntry[_tableSize];
245 for(int i=0; i<_numEntries; i++) {
246 newTable[i].pri = _table[i].pri;
247 newTable[i].timer = _table[i].timer;
253 SGTimer* SGTimerQueue::findByName(const std::string& name) const
255 for (int i=0; i < _numEntries; ++i) {
256 if (_table[i].timer->name == name) {
257 return _table[i].timer;