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
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/base/ip_address_number.h"
#include <limits.h>
#include "base/logging.h"
#include "base/strings/string_number_conversions.h"
#include "base/strings/string_piece.h"
#include "base/strings/string_split.h"
#include "base/strings/string_util.h"
#include "base/strings/stringprintf.h"
#include "url/gurl.h"
#include "url/url_canon_ip.h"
namespace net {
namespace {
bool IPNumberPrefixCheck(const IPAddressNumber& ip_number,
const unsigned char* ip_prefix,
size_t prefix_length_in_bits) {
// Compare all the bytes that fall entirely within the prefix.
int num_entire_bytes_in_prefix = prefix_length_in_bits / 8;
for (int i = 0; i < num_entire_bytes_in_prefix; ++i) {
if (ip_number[i] != ip_prefix[i])
return false;
}
// In case the prefix was not a multiple of 8, there will be 1 byte
// which is only partially masked.
int remaining_bits = prefix_length_in_bits % 8;
if (remaining_bits != 0) {
unsigned char mask = 0xFF << (8 - remaining_bits);
int i = num_entire_bytes_in_prefix;
if ((ip_number[i] & mask) != (ip_prefix[i] & mask))
return false;
}
return true;
}
} // namespace
// Don't compare IPv4 and IPv6 addresses (they have different range
// reservations). Keep separate reservation arrays for each IP type, and
// consolidate adjacent reserved ranges within a reservation array when
// possible.
// Sources for info:
// www.iana.org/assignments/ipv4-address-space/ipv4-address-space.xhtml
// www.iana.org/assignments/ipv6-address-space/ipv6-address-space.xhtml
// They're formatted here with the prefix as the last element. For example:
// 10.0.0.0/8 becomes 10,0,0,0,8 and fec0::/10 becomes 0xfe,0xc0,0,0,0...,10.
bool IsIPAddressReserved(const IPAddressNumber& host_addr) {
static const unsigned char kReservedIPv4[][5] = {
{ 0,0,0,0,8 }, { 10,0,0,0,8 }, { 100,64,0,0,10 }, { 127,0,0,0,8 },
{ 169,254,0,0,16 }, { 172,16,0,0,12 }, { 192,0,2,0,24 },
{ 192,88,99,0,24 }, { 192,168,0,0,16 }, { 198,18,0,0,15 },
{ 198,51,100,0,24 }, { 203,0,113,0,24 }, { 224,0,0,0,3 }
};
static const unsigned char kReservedIPv6[][17] = {
{ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8 },
{ 0x40,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2 },
{ 0x80,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2 },
{ 0xc0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3 },
{ 0xe0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4 },
{ 0xf0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5 },
{ 0xf8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6 },
{ 0xfc,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7 },
{ 0xfe,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9 },
{ 0xfe,0x80,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10 },
{ 0xfe,0xc0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10 },
};
size_t array_size = 0;
const unsigned char* array = NULL;
switch (host_addr.size()) {
case kIPv4AddressSize:
array_size = arraysize(kReservedIPv4);
array = kReservedIPv4[0];
break;
case kIPv6AddressSize:
array_size = arraysize(kReservedIPv6);
array = kReservedIPv6[0];
break;
}
if (!array)
return false;
size_t width = host_addr.size() + 1;
for (size_t i = 0; i < array_size; ++i, array += width) {
if (IPNumberPrefixCheck(host_addr, array, array[width-1]))
return true;
}
return false;
}
std::string IPAddressToString(const uint8_t* address, size_t address_len) {
std::string str;
url::StdStringCanonOutput output(&str);
if (address_len == kIPv4AddressSize) {
url::AppendIPv4Address(address, &output);
} else if (address_len == kIPv6AddressSize) {
url::AppendIPv6Address(address, &output);
}
output.Complete();
return str;
}
std::string IPAddressToStringWithPort(const uint8_t* address,
size_t address_len,
uint16_t port) {
std::string address_str = IPAddressToString(address, address_len);
if (address_str.empty())
return address_str;
if (address_len == kIPv6AddressSize) {
// Need to bracket IPv6 addresses since they contain colons.
return base::StringPrintf("[%s]:%d", address_str.c_str(), port);
}
return base::StringPrintf("%s:%d", address_str.c_str(), port);
}
std::string IPAddressToString(const IPAddressNumber& addr) {
return IPAddressToString(addr.data(), addr.size());
}
std::string IPAddressToStringWithPort(const IPAddressNumber& addr,
uint16_t port) {
return IPAddressToStringWithPort(addr.data(), addr.size(), port);
}
std::string IPAddressToPackedString(const IPAddressNumber& addr) {
return std::string(reinterpret_cast<const char*>(addr.data()), addr.size());
}
bool ParseIPLiteralToNumber(const base::StringPiece& ip_literal,
IPAddressNumber* ip_number) {
// |ip_literal| could be either a IPv4 or an IPv6 literal. If it contains
// a colon however, it must be an IPv6 address.
if (ip_literal.find(':') != base::StringPiece::npos) {
// GURL expects IPv6 hostnames to be surrounded with brackets.
std::string host_brackets = "[";
ip_literal.AppendToString(&host_brackets);
host_brackets.push_back(']');
url::Component host_comp(0, host_brackets.size());
// Try parsing the hostname as an IPv6 literal.
ip_number->resize(16); // 128 bits.
return url::IPv6AddressToNumber(host_brackets.data(), host_comp,
&(*ip_number)[0]);
}
// Otherwise the string is an IPv4 address.
ip_number->resize(4); // 32 bits.
url::Component host_comp(0, ip_literal.size());
int num_components;
url::CanonHostInfo::Family family = url::IPv4AddressToNumber(
ip_literal.data(), host_comp, &(*ip_number)[0], &num_components);
return family == url::CanonHostInfo::IPV4;
}
namespace {
const unsigned char kIPv4MappedPrefix[] =
{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xFF, 0xFF };
}
IPAddressNumber ConvertIPv4NumberToIPv6Number(
const IPAddressNumber& ipv4_number) {
DCHECK(ipv4_number.size() == 4);
// IPv4-mapped addresses are formed by:
// <80 bits of zeros> + <16 bits of ones> + <32-bit IPv4 address>.
IPAddressNumber ipv6_number;
ipv6_number.reserve(16);
ipv6_number.insert(ipv6_number.end(),
kIPv4MappedPrefix,
kIPv4MappedPrefix + arraysize(kIPv4MappedPrefix));
ipv6_number.insert(ipv6_number.end(), ipv4_number.begin(), ipv4_number.end());
return ipv6_number;
}
bool IsIPv4Mapped(const IPAddressNumber& address) {
if (address.size() != kIPv6AddressSize)
return false;
return std::equal(address.begin(),
address.begin() + arraysize(kIPv4MappedPrefix),
kIPv4MappedPrefix);
}
IPAddressNumber ConvertIPv4MappedToIPv4(const IPAddressNumber& address) {
DCHECK(IsIPv4Mapped(address));
return IPAddressNumber(address.begin() + arraysize(kIPv4MappedPrefix),
address.end());
}
bool IPNumberMatchesPrefix(const IPAddressNumber& ip_number,
const IPAddressNumber& ip_prefix,
size_t prefix_length_in_bits) {
// Both the input IP address and the prefix IP address should be
// either IPv4 or IPv6.
DCHECK(ip_number.size() == 4 || ip_number.size() == 16);
DCHECK(ip_prefix.size() == 4 || ip_prefix.size() == 16);
DCHECK_LE(prefix_length_in_bits, ip_prefix.size() * 8);
// In case we have an IPv6 / IPv4 mismatch, convert the IPv4 addresses to
// IPv6 addresses in order to do the comparison.
if (ip_number.size() != ip_prefix.size()) {
if (ip_number.size() == 4) {
return IPNumberMatchesPrefix(ConvertIPv4NumberToIPv6Number(ip_number),
ip_prefix, prefix_length_in_bits);
}
return IPNumberMatchesPrefix(ip_number,
ConvertIPv4NumberToIPv6Number(ip_prefix),
96 + prefix_length_in_bits);
}
return IPNumberPrefixCheck(ip_number, &ip_prefix[0], prefix_length_in_bits);
}
unsigned CommonPrefixLength(const IPAddressNumber& a1,
const IPAddressNumber& a2) {
DCHECK_EQ(a1.size(), a2.size());
for (size_t i = 0; i < a1.size(); ++i) {
unsigned diff = a1[i] ^ a2[i];
if (!diff)
continue;
for (unsigned j = 0; j < CHAR_BIT; ++j) {
if (diff & (1 << (CHAR_BIT - 1)))
return i * CHAR_BIT + j;
diff <<= 1;
}
NOTREACHED();
}
return a1.size() * CHAR_BIT;
}
unsigned MaskPrefixLength(const IPAddressNumber& mask) {
IPAddressNumber all_ones(mask.size(), 0xFF);
return CommonPrefixLength(mask, all_ones);
}
} // namespace net
|