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
|
/*
* Copyright (C) 2014-2020 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "URLDecomposition.h"
#include "wtf/text/StringToIntegerConversion.h"
namespace WebCore {
String URLDecomposition::origin() const
{
return fullURL().hostAndPort();
}
String URLDecomposition::protocol() const
{
auto fullURL = this->fullURL();
if (WTF::protocolIsJavaScript(fullURL.string()))
return "javascript:"_s;
return makeString(fullURL.protocol(), ':');
}
void URLDecomposition::setProtocol(StringView value)
{
URL copy = fullURL();
copy.setProtocol(value);
setFullURL(copy);
}
String URLDecomposition::username() const
{
return fullURL().encodedUser().toString();
}
void URLDecomposition::setUsername(StringView user)
{
auto fullURL = this->fullURL();
if (fullURL.host().isEmpty() || fullURL.cannotBeABaseURL() || fullURL.protocolIs("file"_s))
return;
fullURL.setUser(user);
setFullURL(fullURL);
}
String URLDecomposition::password() const
{
return fullURL().encodedPassword().toString();
}
void URLDecomposition::setPassword(StringView password)
{
auto fullURL = this->fullURL();
if (fullURL.host().isEmpty() || fullURL.cannotBeABaseURL() || fullURL.protocolIs("file"_s))
return;
fullURL.setPassword(password);
setFullURL(fullURL);
}
String URLDecomposition::host() const
{
return fullURL().hostAndPort();
}
static unsigned countASCIIDigits(StringView string)
{
unsigned length = string.length();
for (unsigned count = 0; count < length; ++count) {
if (!isASCIIDigit(string[count]))
return count;
}
return length;
}
void URLDecomposition::setHost(StringView value)
{
auto fullURL = this->fullURL();
if (value.isEmpty() && !fullURL.protocolIs("file"_s) && fullURL.hasSpecialScheme())
return;
size_t separator = value.reverseFind(':');
if (!separator)
return;
if (fullURL.cannotBeABaseURL() || !fullURL.canSetHostOrPort())
return;
// No port if no colon or rightmost colon is within the IPv6 section.
size_t ipv6Separator = value.reverseFind(']');
if (separator == notFound || (ipv6Separator != notFound && ipv6Separator > separator))
fullURL.setHost(value);
else {
// Multiple colons are acceptable only in case of IPv6.
if (value.find(':') != separator && ipv6Separator == notFound)
return;
unsigned portLength = countASCIIDigits(value.substring(separator + 1));
if (!portLength) {
fullURL.setHost(value.substring(0, separator));
} else {
auto portNumber = parseInteger<uint16_t>(value.substring(separator + 1, portLength));
if (portNumber && WTF::isDefaultPortForProtocol(*portNumber, fullURL.protocol()))
fullURL.setHostAndPort(value.substring(0, separator));
else
fullURL.setHostAndPort(value.substring(0, separator + 1 + portLength));
}
}
if (fullURL.isValid())
setFullURL(fullURL);
}
String URLDecomposition::hostname() const
{
return fullURL().host().toString();
}
static StringView removeAllLeadingSolidusCharacters(StringView string)
{
unsigned i;
unsigned length = string.length();
for (i = 0; i < length; ++i) {
if (string[i] != '/')
break;
}
return string.substring(i);
}
void URLDecomposition::setHostname(StringView value)
{
auto fullURL = this->fullURL();
auto host = removeAllLeadingSolidusCharacters(value);
if (host.isEmpty() && !fullURL.protocolIs("file"_s) && fullURL.hasSpecialScheme())
return;
if (fullURL.cannotBeABaseURL() || !fullURL.canSetHostOrPort())
return;
fullURL.setHost(host);
if (fullURL.isValid())
setFullURL(fullURL);
}
String URLDecomposition::port() const
{
auto port = fullURL().port();
if (!port)
return emptyString();
return String::number(*port);
}
// Outer optional is whether we could parse at all. Inner optional is "no port specified".
static std::optional<std::optional<uint16_t>> parsePort(StringView string, StringView protocol)
{
// https://url.spec.whatwg.org/#port-state with state override given.
uint32_t port { 0 };
bool foundDigit = false;
for (size_t i = 0; i < string.length(); ++i) {
auto c = string[i];
// https://infra.spec.whatwg.org/#ascii-tab-or-newline
if (c == 0x0009 || c == 0x000A || c == 0x000D)
continue;
if (isASCIIDigit(c)) {
port = port * 10 + c - '0';
foundDigit = true;
if (port > std::numeric_limits<uint16_t>::max())
return std::nullopt;
continue;
}
if (!foundDigit)
return std::nullopt;
break;
}
if (!foundDigit || WTF::isDefaultPortForProtocol(static_cast<uint16_t>(port), protocol))
return std::optional<uint16_t> { std::nullopt };
return { { static_cast<uint16_t>(port) } };
}
void URLDecomposition::setPort(StringView value)
{
auto fullURL = this->fullURL();
if (fullURL.host().isEmpty() || fullURL.cannotBeABaseURL() || fullURL.protocolIs("file"_s) || !fullURL.canSetHostOrPort())
return;
auto port = parsePort(value, fullURL.protocol());
if (!port)
return;
fullURL.setPort(*port);
setFullURL(fullURL);
}
String URLDecomposition::pathname() const
{
return fullURL().path().toString();
}
void URLDecomposition::setPathname(StringView value)
{
auto fullURL = this->fullURL();
if (fullURL.cannotBeABaseURL() || !fullURL.canSetPathname())
return;
fullURL.setPath(value);
setFullURL(fullURL);
}
String URLDecomposition::search() const
{
auto fullURL = this->fullURL();
return fullURL.query().isEmpty() ? emptyString() : fullURL.queryWithLeadingQuestionMark().toString();
}
void URLDecomposition::setSearch(const String& value)
{
auto fullURL = this->fullURL();
if (value.isEmpty()) {
// If the given value is the empty string, set url's query to null.
fullURL.setQuery({});
} else {
String newSearch = value;
// Make sure that '#' in the query does not leak to the hash.
fullURL.setQuery(makeStringByReplacingAll(value, '#', "%23"_s));
}
setFullURL(fullURL);
}
String URLDecomposition::hash() const
{
auto fullURL = this->fullURL();
return fullURL.fragmentIdentifier().isEmpty() ? emptyString() : fullURL.fragmentIdentifierWithLeadingNumberSign().toString();
}
void URLDecomposition::setHash(StringView value)
{
auto fullURL = this->fullURL();
if (value.isEmpty())
fullURL.removeFragmentIdentifier();
else
fullURL.setFragmentIdentifier(value.startsWith('#') ? value.substring(1) : value);
setFullURL(fullURL);
}
}
|
