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()
62 for(int i=0; i<_numEntries; i++) {
63 delete _table[i].timer;
72 void SGTimerQueue::update(double deltaSecs)
75 while(_numEntries && nextTime() <= _now) {
76 SGTimer* t = remove();
81 void SGTimerQueue::insert(SGTimer* timer, double time)
83 if(_numEntries >= _tableSize)
87 _table[_numEntries-1].pri = -(_now + time);
88 _table[_numEntries-1].timer = timer;
90 siftUp(_numEntries-1);
93 SGTimer* SGTimerQueue::remove(SGTimer* t)
96 for(entry=0; entry<_numEntries; entry++)
97 if(_table[entry].timer == t)
99 if(entry == _numEntries)
102 // Swap in the last item in the table, and sift down
103 swap(entry, _numEntries-1);
110 SGTimer* SGTimerQueue::remove()
112 if(_numEntries == 0) {
114 } else if(_numEntries == 1) {
116 return _table[0].timer;
119 SGTimer *result = _table[0].timer;
120 _table[0] = _table[_numEntries - 1];
126 void SGTimerQueue::siftDown(int n)
128 // While we have children bigger than us, swap us with the biggest
130 while(lchild(n) < _numEntries) {
131 int bigc = lchild(n);
132 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
134 if(pri(bigc) <= pri(n))
141 void SGTimerQueue::siftUp(int n)
143 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
150 void SGTimerQueue::growArray()
152 _tableSize = ((_tableSize+1)<<1) - 1;
153 HeapEntry *newTable = new HeapEntry[_tableSize];
154 for(int i=0; i<_numEntries; i++) {
155 newTable[i].pri = _table[i].pri;
156 newTable[i].timer = _table[i].timer;