1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
|
/****************************************************************************
**
** Implementation of QEventLoop class
**
** Copyright (C) 2000-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the kernel module of the Qt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free Qt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at sales@trolltech.com.
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.QPL
** included in the packaging of this file. Licensees holding valid Qt
** Commercial licenses may use this file in accordance with the Qt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#include "qeventloop_p.h" // includes qplatformdefs.h
#include "qeventloop.h"
#include "qapplication.h"
#include "qbitarray.h"
#include <stdlib.h>
#include <sys/types.h>
/*****************************************************************************
Timer handling; UNIX has no application timer support so we'll have to
make our own from scratch.
NOTE: These functions are for internal use. QObject::startTimer() and
QObject::killTimer() are for public use.
The QTimer class provides a high-level interface which translates
timer events into signals.
qStartTimer( interval, obj )
Starts a timer which will run until it is killed with qKillTimer()
Arguments:
int interval timer interval in milliseconds
QObject *obj where to send the timer event
Returns:
int timer identifier, or zero if not successful
qKillTimer( timerId )
Stops a timer specified by a timer identifier.
Arguments:
int timerId timer identifier
Returns:
bool TRUE if successful
qKillTimer( obj )
Stops all timers that are sent to the specified object.
Arguments:
QObject *obj object receiving timer events
Returns:
bool TRUE if successful
*****************************************************************************/
//
// Internal data structure for timers
//
struct TimerInfo { // internal timer info
int id; // - timer identifier
timeval interval; // - timer interval
timeval timeout; // - when to sent event
QObject *obj; // - object to receive event
};
typedef QPtrList<TimerInfo> TimerList; // list of TimerInfo structs
static QBitArray *timerBitVec; // timer bit vector
static TimerList *timerList = 0; // timer list
static void initTimers();
void cleanupTimers();
static timeval watchtime; // watch if time is turned back
timeval *qt_wait_timer();
timeval *qt_wait_timer_max = 0;
//
// Internal operator functions for timevals
//
static inline bool operator<( const timeval &t1, const timeval &t2 )
{
return t1.tv_sec < t2.tv_sec ||
(t1.tv_sec == t2.tv_sec && t1.tv_usec < t2.tv_usec);
}
static inline bool operator==( const timeval &t1, const timeval &t2 )
{
return t1.tv_sec == t2.tv_sec && t1.tv_usec == t2.tv_usec;
}
static inline timeval &operator+=( timeval &t1, const timeval &t2 )
{
t1.tv_sec += t2.tv_sec;
if ( (t1.tv_usec += t2.tv_usec) >= 1000000 ) {
t1.tv_sec++;
t1.tv_usec -= 1000000;
}
return t1;
}
static inline timeval operator+( const timeval &t1, const timeval &t2 )
{
timeval tmp;
tmp.tv_sec = t1.tv_sec + t2.tv_sec;
if ( (tmp.tv_usec = t1.tv_usec + t2.tv_usec) >= 1000000 ) {
tmp.tv_sec++;
tmp.tv_usec -= 1000000;
}
return tmp;
}
static inline timeval operator-( const timeval &t1, const timeval &t2 )
{
timeval tmp;
tmp.tv_sec = t1.tv_sec - t2.tv_sec;
if ( (tmp.tv_usec = t1.tv_usec - t2.tv_usec) < 0 ) {
tmp.tv_sec--;
tmp.tv_usec += 1000000;
}
return tmp;
}
//
// Internal functions for manipulating timer data structures.
// The timerBitVec array is used for keeping track of timer identifiers.
//
static int allocTimerId() // find avail timer identifier
{
int i = timerBitVec->size()-1;
while ( i >= 0 && (*timerBitVec)[i] )
i--;
if ( i < 0 ) {
i = timerBitVec->size();
timerBitVec->resize( 4 * i );
for( int j=timerBitVec->size()-1; j > i; j-- )
timerBitVec->clearBit( j );
}
timerBitVec->setBit( i );
return i+1;
}
static void insertTimer( const TimerInfo *ti ) // insert timer info into list
{
TimerInfo *t = timerList->first();
int index = 0;
#if defined(QT_DEBUG)
int dangerCount = 0;
#endif
while ( t && t->timeout < ti->timeout ) { // list is sorted by timeout
#if defined(QT_DEBUG)
if ( t->obj == ti->obj )
dangerCount++;
#endif
t = timerList->next();
index++;
}
timerList->insert( index, ti ); // inserts sorted
#if defined(QT_DEBUG)
if ( dangerCount > 16 )
qDebug( "QObject: %d timers now exist for object %s::%s",
dangerCount, ti->obj->className(), ti->obj->name() );
#endif
}
static inline void getTime( timeval &t ) // get time of day
{
gettimeofday( &t, 0 );
while ( t.tv_usec >= 1000000 ) { // NTP-related fix
t.tv_usec -= 1000000;
t.tv_sec++;
}
while ( t.tv_usec < 0 ) {
if ( t.tv_sec > 0 ) {
t.tv_usec += 1000000;
t.tv_sec--;
} else {
t.tv_usec = 0;
break;
}
}
}
static void repairTimer( const timeval &time ) // repair broken timer
{
timeval diff = watchtime - time;
register TimerInfo *t = timerList->first();
while ( t ) { // repair all timers
t->timeout = t->timeout - diff;
t = timerList->next();
}
}
//
// Timer activation functions (called from the event loop)
//
/*
Returns the time to wait for the next timer, or null if no timers are
waiting.
The result is bounded to qt_wait_timer_max if this exists.
*/
timeval *qt_wait_timer()
{
static timeval tm;
bool first = TRUE;
timeval currentTime;
if ( timerList && timerList->count() ) { // there are waiting timers
getTime( currentTime );
if ( first ) {
if ( currentTime < watchtime ) // clock was turned back
repairTimer( currentTime );
first = FALSE;
watchtime = currentTime;
}
TimerInfo *t = timerList->first(); // first waiting timer
if ( currentTime < t->timeout ) { // time to wait
tm = t->timeout - currentTime;
} else {
tm.tv_sec = 0; // no time to wait
tm.tv_usec = 0;
}
if ( qt_wait_timer_max && *qt_wait_timer_max < tm )
tm = *qt_wait_timer_max;
return &tm;
}
if ( qt_wait_timer_max ) {
tm = *qt_wait_timer_max;
return &tm;
}
return 0; // no timers
}
// Timer initialization
static void initTimers() // initialize timers
{
timerBitVec = new QBitArray( 128 );
Q_CHECK_PTR( timerBitVec );
int i = timerBitVec->size();
while( i-- > 0 )
timerBitVec->clearBit( i );
timerList = new TimerList;
Q_CHECK_PTR( timerList );
timerList->setAutoDelete( TRUE );
gettimeofday( &watchtime, 0 );
}
// Timer cleanup
void cleanupTimers()
{
delete timerList;
timerList = 0;
delete timerBitVec;
timerBitVec = 0;
}
// Main timer functions for starting and killing timers
int qStartTimer( int interval, QObject *obj )
{
if ( !timerList ) // initialize timer data
initTimers();
int id = allocTimerId(); // get free timer id
if ( id <= 0 ||
id > (int)timerBitVec->size() || !obj )// cannot create timer
return 0;
timerBitVec->setBit( id-1 ); // set timer active
TimerInfo *t = new TimerInfo; // create timer
Q_CHECK_PTR( t );
t->id = id;
t->interval.tv_sec = interval/1000;
t->interval.tv_usec = (interval%1000)*1000;
timeval currentTime;
getTime( currentTime );
t->timeout = currentTime + t->interval;
t->obj = obj;
insertTimer( t ); // put timer in list
return id;
}
bool qKillTimer( int id )
{
register TimerInfo *t;
if ( !timerList || id <= 0 ||
id > (int)timerBitVec->size() || !timerBitVec->testBit( id-1 ) )
return FALSE; // not init'd or invalid timer
t = timerList->first();
while ( t && t->id != id ) // find timer info in list
t = timerList->next();
if ( t ) { // id found
timerBitVec->clearBit( id-1 ); // set timer inactive
return timerList->remove();
}
else // id not found
return FALSE;
}
bool qKillTimer( QObject *obj )
{
register TimerInfo *t;
if ( !timerList ) // not initialized
return FALSE;
t = timerList->first();
while ( t ) { // check all timers
if ( t->obj == obj ) { // object found
timerBitVec->clearBit( t->id-1 );
timerList->remove();
t = timerList->current();
} else {
t = timerList->next();
}
}
return TRUE;
}
/*****************************************************************************
Socket notifier type
*****************************************************************************/
QSockNotType::QSockNotType()
: list( 0 )
{
FD_ZERO( &select_fds );
FD_ZERO( &enabled_fds );
FD_ZERO( &pending_fds );
}
QSockNotType::~QSockNotType()
{
if ( list )
delete list;
list = 0;
}
/*****************************************************************************
QEventLoop implementations for UNIX
*****************************************************************************/
void QEventLoop::registerSocketNotifier( QSocketNotifier *notifier )
{
int sockfd = notifier->socket();
int type = notifier->type();
if ( sockfd < 0 || sockfd >= FD_SETSIZE || type < 0 || type > 2 || notifier == 0 ) {
#if defined(QT_CHECK_RANGE)
qWarning( "QSocketNotifier: Internal error" );
#endif
return;
}
QPtrList<QSockNot> *list = d->sn_vec[type].list;
fd_set *fds = &d->sn_vec[type].enabled_fds;
QSockNot *sn;
if ( ! list ) {
// create new list, the QSockNotType destructor will delete it for us
list = new QPtrList<QSockNot>;
Q_CHECK_PTR( list );
list->setAutoDelete( TRUE );
d->sn_vec[type].list = list;
}
sn = new QSockNot;
Q_CHECK_PTR( sn );
sn->obj = notifier;
sn->fd = sockfd;
sn->queue = &d->sn_vec[type].pending_fds;
if ( list->isEmpty() ) {
list->insert( 0, sn );
} else { // sort list by fd, decreasing
QSockNot *p = list->first();
while ( p && p->fd > sockfd )
p = list->next();
#if defined(QT_CHECK_STATE)
if ( p && p->fd == sockfd ) {
static const char *t[] = { "read", "write", "exception" };
qWarning( "QSocketNotifier: Multiple socket notifiers for "
"same socket %d and type %s", sockfd, t[type] );
}
#endif
if ( p )
list->insert( list->at(), sn );
else
list->append( sn );
}
FD_SET( sockfd, fds );
d->sn_highest = QMAX( d->sn_highest, sockfd );
}
void QEventLoop::unregisterSocketNotifier( QSocketNotifier *notifier )
{
int sockfd = notifier->socket();
int type = notifier->type();
if ( sockfd < 0 || type < 0 || type > 2 || notifier == 0 ) {
#if defined(QT_CHECK_RANGE)
qWarning( "QSocketNotifier: Internal error" );
#endif
return;
}
QPtrList<QSockNot> *list = d->sn_vec[type].list;
fd_set *fds = &d->sn_vec[type].enabled_fds;
QSockNot *sn;
if ( ! list )
return;
sn = list->first();
while ( sn && !(sn->obj == notifier && sn->fd == sockfd) )
sn = list->next();
if ( !sn ) // not found
return;
FD_CLR( sockfd, fds ); // clear fd bit
FD_CLR( sockfd, sn->queue );
d->sn_pending_list.removeRef( sn ); // remove from activation list
list->remove(); // remove notifier found above
if ( d->sn_highest == sockfd ) { // find highest fd
d->sn_highest = -1;
for ( int i=0; i<3; i++ ) {
if ( d->sn_vec[i].list && ! d->sn_vec[i].list->isEmpty() )
d->sn_highest = QMAX( d->sn_highest, // list is fd-sorted
d->sn_vec[i].list->getFirst()->fd );
}
}
}
void QEventLoop::setSocketNotifierPending( QSocketNotifier *notifier )
{
int sockfd = notifier->socket();
int type = notifier->type();
if ( sockfd < 0 || type < 0 || type > 2 || notifier == 0 ) {
#if defined(QT_CHECK_RANGE)
qWarning( "QSocketNotifier: Internal error" );
#endif
return;
}
QPtrList<QSockNot> *list = d->sn_vec[type].list;
QSockNot *sn;
if ( ! list )
return;
sn = list->first();
while ( sn && !(sn->obj == notifier && sn->fd == sockfd) )
sn = list->next();
if ( ! sn ) { // not found
return;
}
// We choose a random activation order to be more fair under high load.
// If a constant order is used and a peer early in the list can
// saturate the IO, it might grab our attention completely.
// Also, if we're using a straight list, the callback routines may
// delete other entries from the list before those other entries are
// processed.
if ( ! FD_ISSET( sn->fd, sn->queue ) ) {
d->sn_pending_list.insert( (rand() & 0xff) %
(d->sn_pending_list.count()+1), sn );
FD_SET( sn->fd, sn->queue );
}
}
void QEventLoop::wakeUp()
{
/*
Apparently, there is not consistency among different operating
systems on how to use FIONREAD.
FreeBSD, Linux and Solaris all expect the 3rd argument to
ioctl() to be an int, which is normally 32-bit even on 64-bit
machines.
IRIX, on the other hand, expects a size_t, which is 64-bit on
64-bit machines.
So, the solution is to use size_t initialized to zero to make
sure all bits are set to zero, preventing underflow with the
FreeBSD/Linux/Solaris ioctls.
*/
size_t nbytes = 0;
char c = 0;
if ( ::ioctl( d->thread_pipe[0], FIONREAD, (char*)&nbytes ) >= 0 && nbytes == 0 ) {
::write( d->thread_pipe[1], &c, 1 );
}
}
int QEventLoop::timeToWait() const
{
timeval *tm = qt_wait_timer();
if ( ! tm ) // no active timers
return -1;
return (tm->tv_sec*1000) + (tm->tv_usec/1000);
}
int QEventLoop::activateTimers()
{
if ( !timerList || !timerList->count() ) // no timers
return 0;
bool first = TRUE;
timeval currentTime;
int n_act = 0, maxCount = timerList->count();
TimerInfo *begin = 0;
register TimerInfo *t;
for ( ;; ) {
if ( ! maxCount-- )
break;
getTime( currentTime ); // get current time
if ( first ) {
if ( currentTime < watchtime ) // clock was turned back
repairTimer( currentTime );
first = FALSE;
watchtime = currentTime;
}
t = timerList->first();
if ( !t || currentTime < t->timeout ) // no timer has expired
break;
if ( ! begin ) {
begin = t;
} else if ( begin == t ) {
// avoid sending the same timer multiple times
break;
} else if ( t->interval < begin->interval || t->interval == begin->interval ) {
begin = t;
}
timerList->take(); // unlink from list
t->timeout += t->interval;
if ( t->timeout < currentTime )
t->timeout = currentTime + t->interval;
insertTimer( t ); // relink timer
if ( t->interval.tv_usec > 0 || t->interval.tv_sec > 0 )
n_act++;
QTimerEvent e( t->id );
QApplication::sendEvent( t->obj, &e ); // send event
if ( timerList->findRef( begin ) == -1 )
begin = 0;
}
return n_act;
}
int QEventLoop::activateSocketNotifiers()
{
if ( d->sn_pending_list.isEmpty() )
return 0;
// activate entries
int n_act = 0;
QEvent event( QEvent::SockAct );
QPtrListIterator<QSockNot> it( d->sn_pending_list );
QSockNot *sn;
while ( (sn=it.current()) ) {
++it;
d->sn_pending_list.removeRef( sn );
if ( FD_ISSET(sn->fd, sn->queue) ) {
FD_CLR( sn->fd, sn->queue );
QApplication::sendEvent( sn->obj, &event );
n_act++;
}
}
return n_act;
}
|