1 #include "event_mgr.hxx"
3 #include <simgear/math/SGMath.hxx>
5 void SGEventMgr::add(SGCallback* cb,
6 double interval, double delay,
7 bool repeat, bool simtime)
9 // Clamp the delay value to 1 usec, so that user code can use
10 // "zero" as a synonym for "next frame".
11 if(delay <= 0) delay = 0.000001;
13 SGTimer* t = new SGTimer;
14 t->interval = interval;
20 SGTimerQueue* q = simtime ? &_simQueue : &_rtQueue;
30 SGTimerQueue* q = simtime ? &mgr->_simQueue : &mgr->_rtQueue;
31 q->insert(this, interval);
38 void SGEventMgr::update(double delta_time_sec)
40 _simQueue.update(delta_time_sec);
42 double rt = _rtProp ? _rtProp->getDoubleValue() : 0;
46 ////////////////////////////////////////////////////////////////////////
48 // This is the priority queue implementation:
49 ////////////////////////////////////////////////////////////////////////
51 SGTimerQueue::SGTimerQueue(int size)
56 while(size > _tableSize)
57 _tableSize = ((_tableSize + 1)<<1) - 1;
59 _table = new HeapEntry[_tableSize];
60 for(int i=0; i<_tableSize; i++) {
67 SGTimerQueue::~SGTimerQueue()
69 for(int i=0; i<_numEntries; i++) {
70 delete _table[i].timer;
79 void SGTimerQueue::update(double deltaSecs)
82 while(_numEntries && nextTime() <= _now) {
83 SGTimer* t = remove();
88 void SGTimerQueue::insert(SGTimer* timer, double time)
90 if(_numEntries >= _tableSize)
94 _table[_numEntries-1].pri = -(_now + time);
95 _table[_numEntries-1].timer = timer;
97 siftUp(_numEntries-1);
100 SGTimer* SGTimerQueue::remove(SGTimer* t)
103 for(entry=0; entry<_numEntries; entry++)
104 if(_table[entry].timer == t)
106 if(entry == _numEntries)
109 // Swap in the last item in the table, and sift down
110 swap(entry, _numEntries-1);
117 SGTimer* SGTimerQueue::remove()
119 if(_numEntries == 0) {
121 } else if(_numEntries == 1) {
123 return _table[0].timer;
126 SGTimer *result = _table[0].timer;
127 _table[0] = _table[_numEntries - 1];
133 void SGTimerQueue::siftDown(int n)
135 // While we have children bigger than us, swap us with the biggest
137 while(lchild(n) < _numEntries) {
138 int bigc = lchild(n);
139 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
141 if(pri(bigc) <= pri(n))
148 void SGTimerQueue::siftUp(int n)
150 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
157 void SGTimerQueue::growArray()
159 _tableSize = ((_tableSize+1)<<1) - 1;
160 HeapEntry *newTable = new HeapEntry[_tableSize];
161 for(int i=0; i<_numEntries; i++) {
162 newTable[i].pri = _table[i].pri;
163 newTable[i].timer = _table[i].timer;