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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtCore module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QBYTEARRAYMATCHER_H
#define QBYTEARRAYMATCHER_H
#include <QtCore/qbytearray.h>
#include <limits>
QT_BEGIN_NAMESPACE
class QByteArrayMatcherPrivate;
class Q_CORE_EXPORT QByteArrayMatcher
{
public:
QByteArrayMatcher();
explicit QByteArrayMatcher(const QByteArray &pattern);
explicit QByteArrayMatcher(QByteArrayView pattern)
: QByteArrayMatcher(pattern.data(), pattern.size())
{}
explicit QByteArrayMatcher(const char *pattern, qsizetype length = -1);
QByteArrayMatcher(const QByteArrayMatcher &other);
~QByteArrayMatcher();
QByteArrayMatcher &operator=(const QByteArrayMatcher &other);
void setPattern(const QByteArray &pattern);
#if QT_CORE_REMOVED_SINCE(6, 3)
qsizetype indexIn(const QByteArray &ba, qsizetype from = 0) const;
#else
Q_WEAK_OVERLOAD
qsizetype indexIn(const QByteArray &ba, qsizetype from = 0) const
{ return indexIn(QByteArrayView{ba}, from); }
#endif
qsizetype indexIn(const char *str, qsizetype len, qsizetype from = 0) const;
qsizetype indexIn(QByteArrayView data, qsizetype from = 0) const;
inline QByteArray pattern() const
{
if (q_pattern.isNull())
return QByteArray(reinterpret_cast<const char*>(p.p), p.l);
return q_pattern;
}
private:
QByteArrayMatcherPrivate *d;
QByteArray q_pattern;
struct Data {
uchar q_skiptable[256];
const uchar *p;
qsizetype l;
};
union {
uint dummy[256];
Data p;
};
};
class QStaticByteArrayMatcherBase
{
alignas(16)
struct Skiptable {
uchar data[256];
} m_skiptable;
protected:
explicit constexpr QStaticByteArrayMatcherBase(const char *pattern, size_t n) noexcept
: m_skiptable(generate(pattern, n)) {}
// compiler-generated copy/more ctors/assignment operators are ok!
~QStaticByteArrayMatcherBase() = default;
#if QT_CORE_REMOVED_SINCE(6, 3) && QT_POINTER_SIZE != 4
Q_CORE_EXPORT int indexOfIn(const char *needle, uint nlen, const char *haystack, int hlen, int from) const noexcept;
#endif
Q_CORE_EXPORT qsizetype indexOfIn(const char *needle, size_t nlen,
const char *haystack, qsizetype hlen,
qsizetype from) const noexcept;
private:
static constexpr Skiptable generate(const char *pattern, size_t n) noexcept
{
const auto uchar_max = (std::numeric_limits<uchar>::max)();
uchar max = n > uchar_max ? uchar_max : uchar(n);
Skiptable table = {
// this verbose initialization code aims to avoid some opaque error messages
// even on powerful compilers such as GCC 5.3. Even though for GCC a loop
// format can be found that v5.3 groks, it's probably better to go with this
// for the time being:
{
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
max, max, max, max, max, max, max, max, max, max, max, max, max, max, max, max,
}
};
pattern += n - max;
while (max--)
table.data[uchar(*pattern++)] = max;
return table;
}
};
template <size_t N>
class QStaticByteArrayMatcher : QStaticByteArrayMatcherBase
{
char m_pattern[N];
// N includes the terminating '\0'!
static_assert(N > 2, "QStaticByteArrayMatcher makes no sense for finding a single-char pattern");
public:
explicit constexpr QStaticByteArrayMatcher(const char (&patternToMatch)[N]) noexcept
: QStaticByteArrayMatcherBase(patternToMatch, N - 1), m_pattern()
{
for (size_t i = 0; i < N; ++i)
m_pattern[i] = patternToMatch[i];
}
Q_WEAK_OVERLOAD
qsizetype indexIn(const QByteArray &haystack, qsizetype from = 0) const noexcept
{ return this->indexOfIn(m_pattern, N - 1, haystack.data(), haystack.size(), from); }
qsizetype indexIn(const char *haystack, qsizetype hlen, qsizetype from = 0) const noexcept
{ return this->indexOfIn(m_pattern, N - 1, haystack, hlen, from); }
qsizetype indexIn(QByteArrayView haystack, qsizetype from = 0) const noexcept
{ return this->indexOfIn(m_pattern, N - 1, haystack.data(), haystack.size(), from); }
QByteArray pattern() const { return QByteArray(m_pattern, qsizetype(N - 1)); }
};
template <size_t N>
constexpr QStaticByteArrayMatcher<N> qMakeStaticByteArrayMatcher(const char (&pattern)[N]) noexcept
{ return QStaticByteArrayMatcher<N>(pattern); }
QT_END_NAMESPACE
#endif // QBYTEARRAYMATCHER_H
|
