1 | /**************************************************************************** |
2 | ** |
3 | ** Copyright (C) 2016 The Qt Company Ltd. |
4 | ** Contact: https://www.qt.io/licensing/ |
5 | ** |
6 | ** This file is part of the QtQml module of the Qt Toolkit. |
7 | ** |
8 | ** $QT_BEGIN_LICENSE:LGPL$ |
9 | ** Commercial License Usage |
10 | ** Licensees holding valid commercial Qt licenses may use this file in |
11 | ** accordance with the commercial license agreement provided with the |
12 | ** Software or, alternatively, in accordance with the terms contained in |
13 | ** a written agreement between you and The Qt Company. For licensing terms |
14 | ** and conditions see https://www.qt.io/terms-conditions. For further |
15 | ** information use the contact form at https://www.qt.io/contact-us. |
16 | ** |
17 | ** GNU Lesser General Public License Usage |
18 | ** Alternatively, this file may be used under the terms of the GNU Lesser |
19 | ** General Public License version 3 as published by the Free Software |
20 | ** Foundation and appearing in the file LICENSE.LGPL3 included in the |
21 | ** packaging of this file. Please review the following information to |
22 | ** ensure the GNU Lesser General Public License version 3 requirements |
23 | ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. |
24 | ** |
25 | ** GNU General Public License Usage |
26 | ** Alternatively, this file may be used under the terms of the GNU |
27 | ** General Public License version 2.0 or (at your option) the GNU General |
28 | ** Public license version 3 or any later version approved by the KDE Free |
29 | ** Qt Foundation. The licenses are as published by the Free Software |
30 | ** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3 |
31 | ** included in the packaging of this file. Please review the following |
32 | ** information to ensure the GNU General Public License requirements will |
33 | ** be met: https://www.gnu.org/licenses/gpl-2.0.html and |
34 | ** https://www.gnu.org/licenses/gpl-3.0.html. |
35 | ** |
36 | ** $QT_END_LICENSE$ |
37 | ** |
38 | ****************************************************************************/ |
39 | |
40 | #ifndef QQMLJSFIXEDPOOLARRAY_P_H |
41 | #define QQMLJSFIXEDPOOLARRAY_P_H |
42 | |
43 | // |
44 | // W A R N I N G |
45 | // ------------- |
46 | // |
47 | // This file is not part of the Qt API. It exists purely as an |
48 | // implementation detail. This header file may change from version to |
49 | // version without notice, or even be removed. |
50 | // |
51 | // We mean it. |
52 | // |
53 | |
54 | #include <QtCore/qglobal.h> |
55 | #include <private/qqmljsmemorypool_p.h> |
56 | |
57 | QT_BEGIN_NAMESPACE |
58 | |
59 | namespace QQmlJS { |
60 | |
61 | template <typename T> |
62 | class FixedPoolArray |
63 | { |
64 | T *data; |
65 | int count = 0; |
66 | |
67 | public: |
68 | FixedPoolArray() |
69 | : data(nullptr) |
70 | {} |
71 | |
72 | FixedPoolArray(MemoryPool *pool, int size) |
73 | { allocate(pool, size); } |
74 | |
75 | void allocate(MemoryPool *pool, int size) |
76 | { |
77 | count = size; |
78 | data = reinterpret_cast<T*>(pool->allocate(size: count * sizeof(T))); |
79 | } |
80 | |
81 | void allocate(MemoryPool *pool, const QVector<T> &vector) |
82 | { |
83 | count = vector.count(); |
84 | data = reinterpret_cast<T*>(pool->allocate(size: count * sizeof(T))); |
85 | |
86 | if (QTypeInfo<T>::isComplex) { |
87 | for (int i = 0; i < count; ++i) |
88 | new (data + i) T(vector.at(i)); |
89 | } else if (count) { |
90 | memcpy(data, static_cast<const void*>(vector.constData()), count * sizeof(T)); |
91 | } |
92 | } |
93 | |
94 | template <typename Container> |
95 | void allocate(MemoryPool *pool, const Container &container) |
96 | { |
97 | count = container.count(); |
98 | data = reinterpret_cast<T*>(pool->allocate(size: count * sizeof(T))); |
99 | typename Container::ConstIterator it = container.constBegin(); |
100 | for (int i = 0; i < count; ++i) |
101 | new (data + i) T(*it++); |
102 | } |
103 | |
104 | int size() const |
105 | { return count; } |
106 | |
107 | const T &at(int index) const { |
108 | Q_ASSERT(index >= 0 && index < count); |
109 | return data[index]; |
110 | } |
111 | |
112 | T &at(int index) { |
113 | Q_ASSERT(index >= 0 && index < count); |
114 | return data[index]; |
115 | } |
116 | |
117 | T &operator[](int index) { |
118 | return at(index); |
119 | } |
120 | |
121 | |
122 | int indexOf(const T &value) const { |
123 | for (int i = 0; i < count; ++i) |
124 | if (data[i] == value) |
125 | return i; |
126 | return -1; |
127 | } |
128 | |
129 | const T *begin() const { return data; } |
130 | const T *end() const { return data + count; } |
131 | |
132 | T *begin() { return data; } |
133 | T *end() { return data + count; } |
134 | }; |
135 | |
136 | } // namespace QQmlJS |
137 | |
138 | QT_END_NAMESPACE |
139 | |
140 | #endif // QQMLJSFIXEDPOOLARRAY_P_H |
141 | |