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()
46 SGEventMgr::~SGEventMgr()
51 void SGEventMgr::unbind()
57 void SGEventMgr::shutdown()
63 void SGEventMgr::update(double delta_time_sec)
65 _simQueue.update(delta_time_sec);
67 double rt = _rtProp ? _rtProp->getDoubleValue() : 0;
71 void SGEventMgr::removeTask(const std::string& name)
73 SGTimer* t = _simQueue.findByName(name);
76 } else if ((t = _rtQueue.findByName(name))) {
79 SG_LOG(SG_GENERAL, SG_WARN, "removeTask: no task found with name:" << name);
83 // mark as not repeating so that the SGTimerQueue::update()
91 ////////////////////////////////////////////////////////////////////////
93 // This is the priority queue implementation:
94 ////////////////////////////////////////////////////////////////////////
96 SGTimerQueue::SGTimerQueue(int size)
101 while(size > _tableSize)
102 _tableSize = ((_tableSize + 1)<<1) - 1;
104 _table = new HeapEntry[_tableSize];
105 for(int i=0; i<_tableSize; i++) {
112 SGTimerQueue::~SGTimerQueue()
118 void SGTimerQueue::clear()
121 for(int i=0; i<_numEntries; i++) {
122 delete _table[i].timer;
127 // clear entire table to empty
128 for(int i=0; i<_tableSize; i++) {
134 void SGTimerQueue::update(double deltaSecs)
137 while(_numEntries && nextTime() <= _now) {
138 SGTimer* t = remove();
140 insert(t, t->interval);
141 // warning: this is not thread safe
142 // but the entire timer queue isn't either
151 void SGTimerQueue::insert(SGTimer* timer, double time)
153 if(_numEntries >= _tableSize)
157 _table[_numEntries-1].pri = -(_now + time);
158 _table[_numEntries-1].timer = timer;
160 siftUp(_numEntries-1);
163 SGTimer* SGTimerQueue::remove(SGTimer* t)
166 for(entry=0; entry<_numEntries; entry++)
167 if(_table[entry].timer == t)
169 if(entry == _numEntries)
172 // Swap in the last item in the table, and sift down
173 swap(entry, _numEntries-1);
180 SGTimer* SGTimerQueue::remove()
182 if(_numEntries == 0) {
184 } else if(_numEntries == 1) {
186 return _table[0].timer;
189 SGTimer *result = _table[0].timer;
190 _table[0] = _table[_numEntries - 1];
196 void SGTimerQueue::siftDown(int n)
198 // While we have children bigger than us, swap us with the biggest
200 while(lchild(n) < _numEntries) {
201 int bigc = lchild(n);
202 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
204 if(pri(bigc) <= pri(n))
211 void SGTimerQueue::siftUp(int n)
213 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
220 void SGTimerQueue::growArray()
222 _tableSize = ((_tableSize+1)<<1) - 1;
223 HeapEntry *newTable = new HeapEntry[_tableSize];
224 for(int i=0; i<_numEntries; i++) {
225 newTable[i].pri = _table[i].pri;
226 newTable[i].timer = _table[i].timer;
232 SGTimer* SGTimerQueue::findByName(const std::string& name) const
234 for (int i=0; i < _numEntries; ++i) {
235 if (_table[i].timer->name == name) {
236 return _table[i].timer;