1 #include "event_mgr.hxx"
3 void SGEventMgr::add(SGCallback* cb,
4 double interval, double delay,
5 bool repeat, bool simtime)
7 // Clamp the delay value to 1 usec, so that user code can use
8 // "zero" as a synonym for "next frame".
9 if(delay <= 0) delay = 0.000001;
11 SGTimer* t = new SGTimer;
12 t->interval = interval;
18 SGTimerQueue* q = simtime ? &_simQueue : &_rtQueue;
28 SGTimerQueue* q = simtime ? &mgr->_simQueue : &mgr->_rtQueue;
29 q->insert(this, interval);
36 void SGEventMgr::update(double delta_time_sec)
38 _rtQueue.update(delta_time_sec);
39 if(!_freezeProp || _freezeProp->getBoolValue() == false)
40 _simQueue.update(delta_time_sec);
43 ////////////////////////////////////////////////////////////////////////
45 // This is the priority queue implementation:
46 ////////////////////////////////////////////////////////////////////////
48 SGTimerQueue::SGTimerQueue(int size)
53 while(size > _tableSize)
54 _tableSize = ((_tableSize + 1)<<1) - 1;
56 _table = new HeapEntry[_tableSize];
57 for(int i=0; i<_tableSize; i++) {
64 SGTimerQueue::~SGTimerQueue()
66 for(int i=0; i<_numEntries; i++) {
67 delete _table[i].timer;
76 void SGTimerQueue::update(double deltaSecs)
79 while(_numEntries && nextTime() <= _now) {
80 SGTimer* t = remove();
85 void SGTimerQueue::insert(SGTimer* timer, double time)
87 if(_numEntries >= _tableSize)
91 _table[_numEntries-1].pri = -(_now + time);
92 _table[_numEntries-1].timer = timer;
94 siftUp(_numEntries-1);
97 SGTimer* SGTimerQueue::remove(SGTimer* t)
100 for(entry=0; entry<_numEntries; entry++)
101 if(_table[entry].timer == t)
103 if(entry == _numEntries)
106 // Swap in the last item in the table, and sift down
107 swap(entry, _numEntries-1);
114 SGTimer* SGTimerQueue::remove()
116 if(_numEntries == 0) {
118 } else if(_numEntries == 1) {
120 return _table[0].timer;
123 SGTimer *result = _table[0].timer;
124 _table[0] = _table[_numEntries - 1];
130 void SGTimerQueue::siftDown(int n)
132 // While we have children bigger than us, swap us with the biggest
134 while(lchild(n) < _numEntries) {
135 int bigc = lchild(n);
136 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
138 if(pri(bigc) <= pri(n))
145 void SGTimerQueue::siftUp(int n)
147 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
154 void SGTimerQueue::growArray()
156 _tableSize = ((_tableSize+1)<<1) - 1;
157 HeapEntry *newTable = new HeapEntry[_tableSize];
158 for(int i=0; i<_numEntries; i++) {
159 newTable[i].pri = _table[i].pri;
160 newTable[i].timer = _table[i].timer;