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 _simQueue.update(delta_time_sec);
40 double rt = _rtProp ? _rtProp->getDoubleValue() : 0;
44 ////////////////////////////////////////////////////////////////////////
46 // This is the priority queue implementation:
47 ////////////////////////////////////////////////////////////////////////
49 SGTimerQueue::SGTimerQueue(int size)
54 while(size > _tableSize)
55 _tableSize = ((_tableSize + 1)<<1) - 1;
57 _table = new HeapEntry[_tableSize];
58 for(int i=0; i<_tableSize; i++) {
65 SGTimerQueue::~SGTimerQueue()
67 for(int i=0; i<_numEntries; i++) {
68 delete _table[i].timer;
77 void SGTimerQueue::update(double deltaSecs)
80 while(_numEntries && nextTime() <= _now) {
81 SGTimer* t = remove();
86 void SGTimerQueue::insert(SGTimer* timer, double time)
88 if(_numEntries >= _tableSize)
92 _table[_numEntries-1].pri = -(_now + time);
93 _table[_numEntries-1].timer = timer;
95 siftUp(_numEntries-1);
98 SGTimer* SGTimerQueue::remove(SGTimer* t)
101 for(entry=0; entry<_numEntries; entry++)
102 if(_table[entry].timer == t)
104 if(entry == _numEntries)
107 // Swap in the last item in the table, and sift down
108 swap(entry, _numEntries-1);
115 SGTimer* SGTimerQueue::remove()
117 if(_numEntries == 0) {
119 } else if(_numEntries == 1) {
121 return _table[0].timer;
124 SGTimer *result = _table[0].timer;
125 _table[0] = _table[_numEntries - 1];
131 void SGTimerQueue::siftDown(int n)
133 // While we have children bigger than us, swap us with the biggest
135 while(lchild(n) < _numEntries) {
136 int bigc = lchild(n);
137 if(rchild(n) < _numEntries && pri(rchild(n)) > pri(bigc))
139 if(pri(bigc) <= pri(n))
146 void SGTimerQueue::siftUp(int n)
148 while((n != 0) && (_table[n].pri > _table[parent(n)].pri)) {
155 void SGTimerQueue::growArray()
157 _tableSize = ((_tableSize+1)<<1) - 1;
158 HeapEntry *newTable = new HeapEntry[_tableSize];
159 for(int i=0; i<_numEntries; i++) {
160 newTable[i].pri = _table[i].pri;
161 newTable[i].timer = _table[i].timer;