Katana_mirror/katie
1
0
Fork 0
mirror of https://bitbucket.org/smil3y/katie.git synced 2025-02-24 19:02:59 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

do not randomize socket order

Browse source 
Signed-off-by: Ivailo Monev <xakepa10@laimg.moc>
This commit is contained in:
Ivailo Monev 2019-05-07 03:48:56 +00:00
parent 77f7a17253
commit bc7e7e1161
1 changed files with 2 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
src/core/kernel/qeventdispatcher_unix.cpp
View file

@ -60,8 +60,6 @@
QT_BEGIN_NAMESPACE QT_BEGIN_NAMESPACE
Q_CORE_EXPORT bool qt_disable_lowpriority_timers=false;
/***************************************************************************** /*****************************************************************************
UNIX signal handling UNIX signal handling
*****************************************************************************/ *****************************************************************************/
@ -485,7 +483,7 @@ QList<QPair<int, int> > QTimerInfoList::registeredTimers(QObject *object) const
*/ */
int QTimerInfoList::activateTimers() int QTimerInfoList::activateTimers()
{ {
if (qt_disable_lowpriority_timers || isEmpty()) if (isEmpty())
return 0; // nothing to do return 0; // nothing to do
int n_act = 0, maxCount = 0; int n_act = 0, maxCount = 0;
@ -777,19 +775,8 @@ void QEventDispatcherUNIX::setSocketNotifierPending(QSocketNotifier *notifier)
if (!sn) // not found if (!sn) // not found
return; 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)) { if (! FD_ISSET(sn->fd, sn->queue)) {
if (d->sn_pending_list.isEmpty()) {
d->sn_pending_list.append(sn); d->sn_pending_list.append(sn);
} else {
d->sn_pending_list.insert((qrand() & 0xff) %
(d->sn_pending_list.size()+1), sn);
}
FD_SET(sn->fd, sn->queue); FD_SET(sn->fd, sn->queue);
} }
} }