summaryrefslogtreecommitdiffstats
path: root/src/network/kernel/qtldurl.cpp
blob: 2823a3157d1607f25a446b3ec5a2dc79fa0af90e (plain)
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
/****************************************************************************
**
** 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$
**
****************************************************************************/

#include <qglobal.h>

#include <QtNetwork/private/qtnetworkglobal_p.h>

#if QT_CONFIG(topleveldomain)

#include "qplatformdefs.h"
#include "qurl.h"
#include "private/qurltlds_p.h"
#include "private/qtldurl_p.h"
#include "QtCore/qstring.h"
#include "QtCore/qvector.h"

QT_BEGIN_NAMESPACE

enum TLDMatchType {
    ExactMatch,
    SuffixMatch,
    ExceptionMatch,
};

// Scan the auto-generated table of TLDs for an entry. For more details
// see comments in file:  util/corelib/qurl-generateTLDs/main.cpp
static bool containsTLDEntry(QStringView entry, TLDMatchType match)
{
    const QStringView matchSymbols[] = {
        u"",
        u"*",
        u"!",
    };
    const auto symbol = matchSymbols[match];
    const int index = qt_hash(entry, qt_hash(symbol)) % tldCount;

    // select the right chunk from the big table
    short chunk = 0;
    uint chunkIndex = tldIndices[index], offset = 0;

    // The offset in the big string, of the group that our entry hashes into.
    const auto tldGroupOffset = tldIndices[index];

    // It should always be inside all chunks' total size.
    Q_ASSERT(tldGroupOffset < tldChunks[tldChunkCount - 1]);
    // All offsets are stored in non-decreasing order.
    // This check is within bounds as tldIndices has length tldCount+1.
    Q_ASSERT(tldGroupOffset <= tldIndices[index + 1]);
    // The last extra entry in tldIndices
    // should be equal to the total of all chunks' lengths.
    static_assert(tldIndices[tldCount] == tldChunks[tldChunkCount - 1]);

    // Find which chunk contains the tldGroupOffset
    while (tldGroupOffset >= tldChunks[chunk]) {
        chunkIndex -= tldChunks[chunk];
        offset += tldChunks[chunk];
        chunk++;

        // We can not go above the number of chunks we have, since all our
        // indices are less than the total chunks' size (see asserts above).
        Q_ASSERT(chunk < tldChunkCount);
    }

    // check all the entries from the given offset
    while (chunkIndex < tldIndices[index+1] - offset) {
        const auto utf8 = tldData[chunk] + chunkIndex;
        if ((symbol.isEmpty() || QLatin1Char(*utf8) == symbol) && entry == QString::fromUtf8(utf8 + symbol.size()))
            return true;
        chunkIndex += qstrlen(utf8) + 1; // +1 for the ending \0
    }
    return false;
}

/*!
    \internal

    Return true if \a domain is a top-level-domain per Qt's copy of the Mozilla public suffix list.

    The \a domain must be in lower-case format (as per QString::toLower()).
*/

Q_NETWORK_EXPORT bool qIsEffectiveTLD(QStringView domain)
{
    // for domain 'foo.bar.com':
    // 1. return if TLD table contains 'foo.bar.com'
    // 2. else if table contains '*.bar.com',
    // 3. test that table does not contain '!foo.bar.com'

    if (containsTLDEntry(domain, ExactMatch)) // 1
        return true;

    const auto dot = domain.indexOf(QLatin1Char('.'));
    if (dot < 0) // Actual TLD: may be effective if the subject of a wildcard rule:
        return containsTLDEntry(QString(QLatin1Char('.') + domain), SuffixMatch);
    if (containsTLDEntry(domain.mid(dot), SuffixMatch))   // 2
        return !containsTLDEntry(domain, ExceptionMatch); // 3
    return false;
}

QT_END_NAMESPACE

#endif