1 | /****************************************************************************
|
---|
2 | **
|
---|
3 | ** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
---|
4 | ** All rights reserved.
|
---|
5 | ** Contact: Nokia Corporation ([email protected])
|
---|
6 | **
|
---|
7 | ** This file is part of the QtCore module of the Qt Toolkit.
|
---|
8 | **
|
---|
9 | ** $QT_BEGIN_LICENSE:LGPL$
|
---|
10 | ** Commercial Usage
|
---|
11 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
---|
12 | ** accordance with the Qt Commercial License Agreement provided with the
|
---|
13 | ** Software or, alternatively, in accordance with the terms contained in
|
---|
14 | ** a written agreement between you and Nokia.
|
---|
15 | **
|
---|
16 | ** GNU Lesser General Public License Usage
|
---|
17 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
---|
18 | ** General Public License version 2.1 as published by the Free Software
|
---|
19 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
---|
20 | ** packaging of this file. Please review the following information to
|
---|
21 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
---|
22 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
---|
23 | **
|
---|
24 | ** In addition, as a special exception, Nokia gives you certain additional
|
---|
25 | ** rights. These rights are described in the Nokia Qt LGPL Exception
|
---|
26 | ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
---|
27 | **
|
---|
28 | ** GNU General Public License Usage
|
---|
29 | ** Alternatively, this file may be used under the terms of the GNU
|
---|
30 | ** General Public License version 3.0 as published by the Free Software
|
---|
31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
---|
32 | ** packaging of this file. Please review the following information to
|
---|
33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
---|
34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
---|
35 | **
|
---|
36 | ** If you have questions regarding the use of this file, please contact
|
---|
37 | ** Nokia at [email protected].
|
---|
38 | ** $QT_END_LICENSE$
|
---|
39 | **
|
---|
40 | ****************************************************************************/
|
---|
41 |
|
---|
42 | #include "qabstracteventdispatcher.h"
|
---|
43 | #include "qabstracteventdispatcher_p.h"
|
---|
44 |
|
---|
45 | #include "qthread.h"
|
---|
46 | #include <private/qthread_p.h>
|
---|
47 | #include <private/qcoreapplication_p.h>
|
---|
48 |
|
---|
49 | QT_BEGIN_NAMESPACE
|
---|
50 |
|
---|
51 | // we allow for 2^24 = 8^8 = 16777216 simultaneously running timers
|
---|
52 | enum { NumberOfBuckets = 8, FirstBucketSize = 8 };
|
---|
53 |
|
---|
54 | static const int BucketSize[NumberOfBuckets] =
|
---|
55 | { 8, 64, 512, 4096, 32768, 262144, 2097152, 16777216 - 2396744 };
|
---|
56 | static const int BucketOffset[NumberOfBuckets] =
|
---|
57 | { 0, 8, 72, 584, 4680, 37448, 299592, 2396744 };
|
---|
58 |
|
---|
59 | static int FirstBucket[FirstBucketSize] = { 1, 2, 3, 4, 5, 6, 7, 8 };
|
---|
60 | static QBasicAtomicPointer<int> timerIds[NumberOfBuckets] =
|
---|
61 | { Q_BASIC_ATOMIC_INITIALIZER(FirstBucket),
|
---|
62 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
63 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
64 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
65 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
66 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
67 | Q_BASIC_ATOMIC_INITIALIZER(0),
|
---|
68 | Q_BASIC_ATOMIC_INITIALIZER(0) };
|
---|
69 |
|
---|
70 | static void timerIdsDestructorFunction()
|
---|
71 | {
|
---|
72 | // start at one, the first bucket is pre-allocated
|
---|
73 | for (int i = 1; i < NumberOfBuckets; ++i)
|
---|
74 | delete [] static_cast<int *>(timerIds[i]);
|
---|
75 | }
|
---|
76 | Q_DESTRUCTOR_FUNCTION(timerIdsDestructorFunction)
|
---|
77 |
|
---|
78 | static QBasicAtomicInt nextFreeTimerId = Q_BASIC_ATOMIC_INITIALIZER(1);
|
---|
79 |
|
---|
80 | static const int TimerIdMask = 0x00ffffff;
|
---|
81 | static const int TimerSerialMask = ~TimerIdMask & ~0x80000000;
|
---|
82 | static const int TimerSerialCounter = TimerIdMask + 1;
|
---|
83 |
|
---|
84 | // avoid the ABA-problem by using 7 of the top 8 bits of the timerId as a serial number
|
---|
85 | static inline int prepareNewValueWithSerialNumber(int oldId, int newId)
|
---|
86 | {
|
---|
87 | return (newId & TimerIdMask) | ((oldId + TimerSerialCounter) & TimerSerialMask);
|
---|
88 | }
|
---|
89 |
|
---|
90 | static inline int bucketOffset(int timerId)
|
---|
91 | {
|
---|
92 | for (int i = 0; i < NumberOfBuckets; ++i) {
|
---|
93 | if (timerId < BucketSize[i])
|
---|
94 | return i;
|
---|
95 | timerId -= BucketSize[i];
|
---|
96 | }
|
---|
97 | qFatal("QAbstractEventDispatcher: INTERNAL ERROR, timer ID %d is too large", timerId);
|
---|
98 | return -1;
|
---|
99 | }
|
---|
100 |
|
---|
101 | static inline int bucketIndex(int bucket, int timerId)
|
---|
102 | {
|
---|
103 | return timerId - BucketOffset[bucket];
|
---|
104 | }
|
---|
105 |
|
---|
106 | static inline int *allocateBucket(int bucket)
|
---|
107 | {
|
---|
108 | // allocate a new bucket
|
---|
109 | const int size = BucketSize[bucket];
|
---|
110 | const int offset = BucketOffset[bucket];
|
---|
111 | int *b = new int[size];
|
---|
112 | for (int i = 0; i != size; ++i)
|
---|
113 | b[i] = offset + i + 1;
|
---|
|
---|