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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
|
/****************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtNetwork 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 "qhstsstore_p.h"
#include "qhsts_p.h"
#include "QtCore/private/qipaddress_p.h"
#include "QtCore/qvector.h"
#include "QtCore/qlist.h"
QT_BEGIN_NAMESPACE
static bool is_valid_domain_name(const QString &host)
{
if (!host.size())
return false;
// RFC6797 8.1.1
// If the substring matching the host production from the Request-URI
// (of the message to which the host responded) syntactically matches
//the IP-literal or IPv4address productions from Section 3.2.2 of
//[RFC3986], then the UA MUST NOT note this host as a Known HSTS Host.
using namespace QIPAddressUtils;
IPv4Address ipv4Addr = {};
if (parseIp4(ipv4Addr, host.constBegin(), host.constEnd()))
return false;
IPv6Address ipv6Addr = {};
// Unlike parseIp4, parseIp6 returns nullptr if it managed to parse IPv6
// address successfully.
if (!parseIp6(ipv6Addr, host.constBegin(), host.constEnd()))
return false;
// TODO: for now we do not test IPvFuture address, it must be addressed
// by introducing parseIpFuture (actually, there is an implementation
// in QUrl that can be adopted/modified/moved to QIPAddressUtils).
return true;
}
void QHstsCache::updateFromHeaders(const QList<QPair<QByteArray, QByteArray>> &headers,
const QUrl &url)
{
if (!url.isValid())
return;
QHstsHeaderParser parser;
if (parser.parse(headers)) {
updateKnownHost(url.host(), parser.expirationDate(), parser.includeSubDomains());
if (hstsStore)
hstsStore->synchronize();
}
}
void QHstsCache::updateFromPolicies(const QVector<QHstsPolicy> &policies)
{
for (const auto &policy : policies)
updateKnownHost(policy.host(), policy.expiry(), policy.includesSubDomains());
if (hstsStore && policies.size()) {
// These policies are coming either from store or from QNAM's setter
// function. As a result we can notice expired or new policies, time
// to sync ...
hstsStore->synchronize();
}
}
void QHstsCache::updateKnownHost(const QUrl &url, const QDateTime &expires,
bool includeSubDomains)
{
if (!url.isValid())
return;
updateKnownHost(url.host(), expires, includeSubDomains);
if (hstsStore)
hstsStore->synchronize();
}
void QHstsCache::updateKnownHost(const QString &host, const QDateTime &expires,
bool includeSubDomains)
{
if (!is_valid_domain_name(host))
return;
// HSTS is a per-host policy, regardless of protocol, port or any of the other
// details in an URL; so we only want the host part. QUrl::host handles
// IDNA 2003 (RFC3490) for us, as required by HSTS (RFC6797, section 10).
const HostName hostName(host);
const auto pos = knownHosts.find(hostName);
QHstsPolicy::PolicyFlags flags;
if (includeSubDomains)
flags = QHstsPolicy::IncludeSubDomains;
const QHstsPolicy newPolicy(expires, flags, hostName.name);
if (pos == knownHosts.end()) {
// A new, previously unknown host.
if (newPolicy.isExpired()) {
// Nothing to do at all - we did not know this host previously,
// we do not have to - since its policy expired.
return;
}
knownHosts.insert(pos, {hostName, newPolicy});
if (hstsStore)
hstsStore->addToObserved(newPolicy);
return;
}
if (newPolicy.isExpired())
knownHosts.erase(pos);
else if (pos->second != newPolicy)
pos->second = std::move(newPolicy);
else
return;
if (hstsStore)
hstsStore->addToObserved(newPolicy);
}
bool QHstsCache::isKnownHost(const QUrl &url) const
{
if (!url.isValid() || !is_valid_domain_name(url.host()))
return false;
/*
RFC6797, 8.2. Known HSTS Host Domain Name Matching
* Superdomain Match
If a label-for-label match between an entire Known HSTS Host's
domain name and a right-hand portion of the given domain name
is found, then this Known HSTS Host's domain name is a
superdomain match for the given domain name. There could be
multiple superdomain matches for a given domain name.
* Congruent Match
If a label-for-label match between a Known HSTS Host's domain
name and the given domain name is found -- i.e., there are no
further labels to compare -- then the given domain name
congruently matches this Known HSTS Host.
We start from the congruent match, and then chop labels and dots and
proceed with superdomain match. While RFC6797 recommends to start from
superdomain, the result is the same - some valid policy will make a host
known.
*/
bool superDomainMatch = false;
const QString hostNameAsString(url.host());
HostName nameToTest(static_cast<QStringRef>(&hostNameAsString));
while (nameToTest.fragment.size()) {
auto const pos = knownHosts.find(nameToTest);
if (pos != knownHosts.end()) {
if (pos->second.isExpired()) {
knownHosts.erase(pos);
if (hstsStore) {
// Inform our store that this policy has expired.
hstsStore->addToObserved(pos->second);
}
} else if (!superDomainMatch || pos->second.includesSubDomains()) {
return true;
}
}
const int dot = nameToTest.fragment.indexOf(QLatin1Char('.'));
if (dot == -1)
break;
nameToTest.fragment = nameToTest.fragment.mid(dot + 1);
superDomainMatch = true;
}
return false;
}
void QHstsCache::clear()
{
knownHosts.clear();
}
QVector<QHstsPolicy> QHstsCache::policies() const
{
QVector<QHstsPolicy> values;
values.reserve(int(knownHosts.size()));
for (const auto &host : knownHosts)
values << host.second;
return values;
}
void QHstsCache::setStore(QHstsStore *store)
{
// Caller retains ownership of store, which must outlive this cache.
if (store != hstsStore) {
hstsStore = store;
if (!hstsStore)
return;
// First we augment our store with the policies we already know about
// (and thus the cached policy takes priority over whatever policy we
// had in the store for the same host, if any).
if (knownHosts.size()) {
const QVector<QHstsPolicy> observed(policies());
for (const auto &policy : observed)
hstsStore->addToObserved(policy);
hstsStore->synchronize();
}
// Now we update the cache with anything we have not observed yet, but
// the store knows about (well, it can happen we synchronize again as a
// result if some policies managed to expire or if we add a new one
// from the store to cache):
const QVector<QHstsPolicy> restored(store->readPolicies());
updateFromPolicies(restored);
}
}
// The parser is quite simple: 'nextToken' knowns exactly what kind of tokens
// are valid and it will return false if something else was found; then
// we immediately stop parsing. 'parseDirective' knows how these tokens can
// be combined into a valid directive and if some weird combination of
// valid tokens is found - we immediately stop.
// And finally we call parseDirective again and again until some error found or
// we have no more bytes in the header.
// The following isXXX functions are based on RFC2616, 2.2 Basic Rules.
static bool isCHAR(int c)
{
// CHAR = <any US-ASCII character (octets 0 - 127)>
return c >= 0 && c <= 127;
}
static bool isCTL(int c)
{
// CTL = <any US-ASCII control character
// (octets 0 - 31) and DEL (127)>
return (c >= 0 && c <= 31) || c == 127;
}
static bool isLWS(int c)
{
// LWS = [CRLF] 1*( SP | HT )
//
// CRLF = CR LF
// CR = <US-ASCII CR, carriage return (13)>
// LF = <US-ASCII LF, linefeed (10)>
// SP = <US-ASCII SP, space (32)>
// HT = <US-ASCII HT, horizontal-tab (9)>
//
// CRLF is handled by the time we parse a header (they were replaced with
// spaces). We only have to deal with remaining SP|HT
return c == ' ' || c == '\t';
}
static bool isTEXT(char c)
{
// TEXT = <any OCTET except CTLs,
// but including LWS>
return !isCTL(c) || isLWS(c);
}
static bool isSeparator(char c)
{
// separators = "(" | ")" | "<" | ">" | "@"
// | "," | ";" | ":" | "\" | <">
// | "/" | "[" | "]" | "?" | "="
// | "{" | "}" | SP | HT
static const char separators[] = "()<>@,;:\\\"/[]?={}";
static const char *end = separators + sizeof separators - 1;
return isLWS(c) || std::find(separators, end, c) != end;
}
static QByteArray unescapeMaxAge(const QByteArray &value)
{
if (value.size() < 2 || value[0] != '"')
return value;
Q_ASSERT(value[value.size() - 1] == '"');
return value.mid(1, value.size() - 2);
}
static bool isTOKEN(char c)
{
// token = 1*<any CHAR except CTLs or separators>
return isCHAR(c) && !isCTL(c) && !isSeparator(c);
}
/*
RFC6797, 6.1 Strict-Transport-Security HTTP Response Header Field.
Syntax:
Strict-Tranposrt-Security = "Strict-Transport-Security" ":"
[ directive ] *( ";" [ directive ] )
directive = directive-name [ "=" directive-value ]
directive-name = token
directive-value = token | quoted-string
RFC 2616, 2.2 Basic Rules.
token = 1*<any CHAR except CTLs or separators>
quoted-string = ( <"> *(qdtext | quoted-pair ) <"> )
qdtext = <any TEXT except <">>
quoted-pair = "\" CHAR
*/
bool QHstsHeaderParser::parse(const QList<QPair<QByteArray, QByteArray>> &headers)
{
for (const auto &h : headers) {
// We use '==' since header name was already 'trimmed' for us:
if (h.first == "Strict-Transport-Security") {
header = h.second;
// RFC6797, 8.1:
//
// The UA MUST ignore any STS header fields not conforming to the
// grammar specified in Section 6.1 ("Strict-Transport-Security HTTP
// Response Header Field").
//
// If a UA receives more than one STS header field in an HTTP
// response message over secure transport, then the UA MUST process
// only the first such header field.
//
// We read this as: ignore all invalid headers and take the first valid:
if (parseSTSHeader() && maxAgeFound) {
expiry = QDateTime::currentDateTimeUtc().addSecs(maxAge);
return true;
}
}
}
// In case it was set by a syntactically correct header (but without
// REQUIRED max-age directive):
subDomainsFound = false;
return false;
}
bool QHstsHeaderParser::parseSTSHeader()
{
expiry = QDateTime();
maxAgeFound = false;
subDomainsFound = false;
maxAge = 0;
tokenPos = 0;
token.clear();
while (tokenPos < header.size()) {
if (!parseDirective())
return false;
if (token.size() && token != ";") {
// After a directive we can only have a ";" or no more tokens.
// Invalid syntax.
return false;
}
}
return true;
}
bool QHstsHeaderParser::parseDirective()
{
// RFC 6797, 6.1:
//
// directive = directive-name [ "=" directive-value ]
// directive-name = token
// directive-value = token | quoted-string
// RFC 2616, 2.2:
//
// token = 1*<any CHAR except CTLs or separators>
if (!nextToken())
return false;
if (!token.size()) // No more data, but no error.
return true;
if (token == ";") // That's a weird grammar, but that's what it is.
return true;
if (!isTOKEN(token[0])) // Not a valid directive-name.
return false;
const QByteArray directiveName = token;
// 2. Try to read "=" or ";".
if (!nextToken())
return false;
QByteArray directiveValue;
if (token == ";") // No directive-value
return processDirective(directiveName, directiveValue);
if (token == "=") {
// We expect a directive-value now:
if (!nextToken() || !token.size())
return false;
directiveValue = token;
} else if (token.size()) {
// Invalid syntax:
return false;
}
if (!processDirective(directiveName, directiveValue))
return false;
// Read either ";", or 'end of header', or some invalid token.
return nextToken();
}
bool QHstsHeaderParser::processDirective(const QByteArray &name, const QByteArray &value)
{
Q_ASSERT(name.size());
// RFC6797 6.1/3 Directive names are case-insensitive
const auto lcName = name.toLower();
if (lcName == "max-age") {
// RFC 6797, 6.1.1
// The syntax of the max-age directive's REQUIRED value (after
// quoted-string unescaping, if necessary) is defined as:
//
// max-age-value = delta-seconds
if (maxAgeFound) {
// RFC 6797, 6.1/2:
// All directives MUST appear only once in an STS header field.
return false;
}
const QByteArray unescapedValue = unescapeMaxAge(value);
if (!unescapedValue.size())
return false;
bool ok = false;
const qint64 age = unescapedValue.toLongLong(&ok);
if (!ok || age < 0)
return false;
maxAge = age;
maxAgeFound = true;
} else if (lcName == "includesubdomains") {
// RFC 6797, 6.1.2. The includeSubDomains Directive.
// The OPTIONAL "includeSubDomains" directive is a valueless directive.
if (subDomainsFound) {
// RFC 6797, 6.1/2:
// All directives MUST appear only once in an STS header field.
return false;
}
subDomainsFound = true;
} // else we do nothing, skip unknown directives (RFC 6797, 6.1/5)
return true;
}
bool QHstsHeaderParser::nextToken()
{
// Returns true if we found a valid token or we have no more data (token is
// empty then).
token.clear();
// Fortunately enough, by this point qhttpnetworkreply already got rid of
// [CRLF] parts, but we can have 1*(SP|HT) yet.
while (tokenPos < header.size() && isLWS(header[tokenPos]))
++tokenPos;
if (tokenPos == header.size())
return true;
const char ch = header[tokenPos];
if (ch == ';' || ch == '=') {
token.append(ch);
++tokenPos;
return true;
}
// RFC 2616, 2.2.
//
// quoted-string = ( <"> *(qdtext | quoted-pair ) <"> )
// qdtext = <any TEXT except <">>
if (ch == '"') {
int last = tokenPos + 1;
while (last < header.size()) {
if (header[last] == '"') {
// The end of a quoted-string.
break;
} else if (header[last] == '\\') {
// quoted-pair = "\" CHAR
if (last + 1 < header.size() && isCHAR(header[last + 1]))
last += 2;
else
return false;
} else {
if (!isTEXT(header[last]))
return false;
++last;
}
}
if (last >= header.size()) // no closing '"':
return false;
token = header.mid(tokenPos, last - tokenPos + 1);
tokenPos = last + 1;
return true;
}
// RFC 2616, 2.2:
//
// token = 1*<any CHAR except CTLs or separators>
if (!isTOKEN(ch))
return false;
int last = tokenPos + 1;
while (last < header.size() && isTOKEN(header[last]))
++last;
token = header.mid(tokenPos, last - tokenPos);
tokenPos = last;
return true;
}
QT_END_NAMESPACE
|