1 #include "event_mgr.hxx"
3 void SGEventMgr::add(SGCallback* cb,
4 double interval, double delay,
5 bool repeat, bool simtime)
7 SGTimer* t = new SGTimer;
8 t->interval = interval;
14 SGTimerQueue* q = simtime ? &_simQueue : &_rtQueue;
24 SGTimerQueue* q = simtime ? &mgr->_simQueue : &mgr->_rtQueue;
25 q->insert(this, interval);
32 void SGEventMgr::update(double delta_time_sec)
34 _rtQueue.update(delta_time_sec);
35 if(!_freezeProp || _freezeProp->getBoolValue() == false)
36 _simQueue.update(delta_time_sec);
39 ////////////////////////////////////////////////////////////////////////
41 // This is the priority queue implementation:
42 ////////////////////////////////////////////////////////////////////////
44 SGTimerQueue::SGTimerQueue(int size)
49 while(size > _tableSize)
50 _tableSize = ((_tableSize + 1)<<1) - 1;
52 _table = new HeapEntry[_tableSize];
53 for(int i=0; i<_tableSize; i++) {
60 SGTimerQueue::~SGTimerQueue()
65 void SGTimerQueue::update(double deltaSecs)
68 while(_numEntries && nextTime() <= _now) {
69 SGTimer* t = remove();
74 void SGTimerQueue::insert(SGTimer* timer, double time)
76 if(_numEntries >= _tableSize)
80 _table[_numEntries-1].pri = -(_now + time);
81 _table[_numEntries-1].timer = timer;
83 siftUp(_numEntries-1);
86 SGTimer* SGTimerQueue::remove(SGTimer* t)
89 for(entry=0; entry<_numEntries; entry++)
90 if(_table[entry].timer == t)
92 if(entry == _numEntries)
95 // Swap in the last item in the table, and sift down
96 swap(entry, _numEntries-1);
103 SGTimer* SGTimerQueue::remove()
105 if(_numEntries == 0) {
107 } else if(_numEntries == 1) {
109 return _table[0].timer;
112 SGTimer *result = _table[0].timer;
113 _table[0] = _table[_numEntries - 1];
119 void SGTimerQueue::siftDown(int n)
121 // While we have children bigger than us, swap us with the biggest
123 while(lchild(n) < _numEntries) {
124 int bigc = lchild(n);
125 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
127 if(pri(bigc) <= pri(n))
134 void SGTimerQueue::siftUp(int n)
136 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
143 void SGTimerQueue::growArray()
145 _tableSize = ((_tableSize+1)<<1) - 1;
146 HeapEntry *newTable = new HeapEntry[_tableSize];
147 for(int i=0; i<_numEntries; i++) {
148 newTable[i].pri = _table[i].pri;
149 newTable[i].timer = _table[i].timer;