/tmp/bitcoin/src/netaddress.cpp
Line | Count | Source |
1 | | // Copyright (c) 2009-2010 Satoshi Nakamoto |
2 | | // Copyright (c) 2009-present The Bitcoin Core developers |
3 | | // Distributed under the MIT software license, see the accompanying |
4 | | // file COPYING or http://www.opensource.org/licenses/mit-license.php. |
5 | | |
6 | | #include <netaddress.h> |
7 | | |
8 | | #include <crypto/common.h> |
9 | | #include <crypto/sha3.h> |
10 | | #include <hash.h> |
11 | | #include <prevector.h> |
12 | | #include <tinyformat.h> |
13 | | #include <util/strencodings.h> |
14 | | #include <util/string.h> |
15 | | |
16 | | #include <algorithm> |
17 | | #include <array> |
18 | | #include <cstdint> |
19 | | #include <ios> |
20 | | #include <iterator> |
21 | | #include <string_view> |
22 | | #include <tuple> |
23 | | |
24 | | using util::ContainsNoNUL; |
25 | | using util::HasPrefix; |
26 | | |
27 | | CNetAddr::BIP155Network CNetAddr::GetBIP155Network() const |
28 | 100k | { |
29 | 100k | switch (m_net) { |
30 | 99.7k | case NET_IPV4: |
31 | 99.7k | return BIP155Network::IPV4; |
32 | 158 | case NET_IPV6: |
33 | 158 | return BIP155Network::IPV6; |
34 | 139 | case NET_ONION: |
35 | 139 | return BIP155Network::TORV3; |
36 | 117 | case NET_I2P: |
37 | 117 | return BIP155Network::I2P; |
38 | 128 | case NET_CJDNS: |
39 | 128 | return BIP155Network::CJDNS; |
40 | 0 | case NET_INTERNAL: // should have been handled before calling this function |
41 | 0 | case NET_UNROUTABLE: // m_net is never and should not be set to NET_UNROUTABLE |
42 | 0 | case NET_MAX: // m_net is never and should not be set to NET_MAX |
43 | 0 | assert(false); |
44 | 100k | } // no default case, so the compiler can warn about missing cases |
45 | | |
46 | 100k | assert(false); |
47 | 0 | } |
48 | | |
49 | | bool CNetAddr::SetNetFromBIP155Network(uint8_t possible_bip155_net, size_t address_size) |
50 | 41.9k | { |
51 | 41.9k | switch (possible_bip155_net) { |
52 | 41.5k | case BIP155Network::IPV4: |
53 | 41.5k | if (address_size == ADDR_IPV4_SIZE) { |
54 | 41.5k | m_net = NET_IPV4; |
55 | 41.5k | return true; |
56 | 41.5k | } |
57 | 1 | throw std::ios_base::failure( |
58 | 1 | strprintf("BIP155 IPv4 address with length %u (should be %u)", address_size, |
59 | 1 | ADDR_IPV4_SIZE)); |
60 | 61 | case BIP155Network::IPV6: |
61 | 61 | if (address_size == ADDR_IPV6_SIZE) { |
62 | 60 | m_net = NET_IPV6; |
63 | 60 | return true; |
64 | 60 | } |
65 | 1 | throw std::ios_base::failure( |
66 | 1 | strprintf("BIP155 IPv6 address with length %u (should be %u)", address_size, |
67 | 1 | ADDR_IPV6_SIZE)); |
68 | 145 | case BIP155Network::TORV3: |
69 | 145 | if (address_size == ADDR_TORV3_SIZE) { |
70 | 144 | m_net = NET_ONION; |
71 | 144 | return true; |
72 | 144 | } |
73 | 1 | throw std::ios_base::failure( |
74 | 1 | strprintf("BIP155 TORv3 address with length %u (should be %u)", address_size, |
75 | 1 | ADDR_TORV3_SIZE)); |
76 | 140 | case BIP155Network::I2P: |
77 | 140 | if (address_size == ADDR_I2P_SIZE) { |
78 | 139 | m_net = NET_I2P; |
79 | 139 | return true; |
80 | 139 | } |
81 | 1 | throw std::ios_base::failure( |
82 | 1 | strprintf("BIP155 I2P address with length %u (should be %u)", address_size, |
83 | 1 | ADDR_I2P_SIZE)); |
84 | 43 | case BIP155Network::CJDNS: |
85 | 43 | if (address_size == ADDR_CJDNS_SIZE) { |
86 | 42 | m_net = NET_CJDNS; |
87 | 42 | return true; |
88 | 42 | } |
89 | 1 | throw std::ios_base::failure( |
90 | 1 | strprintf("BIP155 CJDNS address with length %u (should be %u)", address_size, |
91 | 1 | ADDR_CJDNS_SIZE)); |
92 | 41.9k | } |
93 | | |
94 | | // Don't throw on addresses with unknown network ids (maybe from the future). |
95 | | // Instead silently drop them and have the unserialization code consume |
96 | | // subsequent ones which may be known to us. |
97 | 4 | return false; |
98 | 41.9k | } |
99 | | |
100 | | /** |
101 | | * Construct an unspecified IPv6 network address (::/128). |
102 | | * |
103 | | * @note This address is considered invalid by CNetAddr::IsValid() |
104 | | */ |
105 | 1.79M | CNetAddr::CNetAddr() = default; |
106 | | |
107 | | void CNetAddr::SetIP(const CNetAddr& ipIn) |
108 | 3 | { |
109 | | // Size check. |
110 | 3 | switch (ipIn.m_net) { |
111 | 2 | case NET_IPV4: |
112 | 2 | assert(ipIn.m_addr.size() == ADDR_IPV4_SIZE); |
113 | 2 | break; |
114 | 2 | case NET_IPV6: |
115 | 1 | assert(ipIn.m_addr.size() == ADDR_IPV6_SIZE); |
116 | 1 | break; |
117 | 1 | case NET_ONION: |
118 | 0 | assert(ipIn.m_addr.size() == ADDR_TORV3_SIZE); |
119 | 0 | break; |
120 | 0 | case NET_I2P: |
121 | 0 | assert(ipIn.m_addr.size() == ADDR_I2P_SIZE); |
122 | 0 | break; |
123 | 0 | case NET_CJDNS: |
124 | 0 | assert(ipIn.m_addr.size() == ADDR_CJDNS_SIZE); |
125 | 0 | break; |
126 | 0 | case NET_INTERNAL: |
127 | 0 | assert(ipIn.m_addr.size() == ADDR_INTERNAL_SIZE); |
128 | 0 | break; |
129 | 0 | case NET_UNROUTABLE: |
130 | 0 | case NET_MAX: |
131 | 0 | assert(false); |
132 | 3 | } // no default case, so the compiler can warn about missing cases |
133 | | |
134 | 3 | m_net = ipIn.m_net; |
135 | 3 | m_addr = ipIn.m_addr; |
136 | 3 | } |
137 | | |
138 | | void CNetAddr::SetLegacyIPv6(std::span<const uint8_t> ipv6) |
139 | 9.89k | { |
140 | 9.89k | assert(ipv6.size() == ADDR_IPV6_SIZE); |
141 | | |
142 | 9.89k | size_t skip{0}; |
143 | | |
144 | 9.89k | if (HasPrefix(ipv6, IPV4_IN_IPV6_PREFIX)) { |
145 | | // IPv4-in-IPv6 |
146 | 6.65k | m_net = NET_IPV4; |
147 | 6.65k | skip = sizeof(IPV4_IN_IPV6_PREFIX); |
148 | 6.65k | } else if (HasPrefix(ipv6, TORV2_IN_IPV6_PREFIX)) { |
149 | | // TORv2-in-IPv6 (unsupported). Unserialize as !IsValid(), thus ignoring them. |
150 | | // Mimic a default-constructed CNetAddr object which is !IsValid() and thus |
151 | | // will not be gossiped, but continue reading next addresses from the stream. |
152 | 0 | m_net = NET_IPV6; |
153 | 0 | m_addr.assign(ADDR_IPV6_SIZE, 0x0); |
154 | 0 | return; |
155 | 3.23k | } else if (HasPrefix(ipv6, INTERNAL_IN_IPV6_PREFIX)) { |
156 | | // Internal-in-IPv6 |
157 | 1 | m_net = NET_INTERNAL; |
158 | 1 | skip = sizeof(INTERNAL_IN_IPV6_PREFIX); |
159 | 3.23k | } else { |
160 | | // IPv6 |
161 | 3.23k | m_net = NET_IPV6; |
162 | 3.23k | } |
163 | | |
164 | 9.89k | m_addr.assign(ipv6.begin() + skip, ipv6.end()); |
165 | 9.89k | } |
166 | | |
167 | | /** |
168 | | * Create an "internal" address that represents a name or FQDN. AddrMan uses |
169 | | * these fake addresses to keep track of which DNS seeds were used. |
170 | | * @returns Whether or not the operation was successful. |
171 | | * @see NET_INTERNAL, INTERNAL_IN_IPV6_PREFIX, CNetAddr::IsInternal(), CNetAddr::IsRFC4193() |
172 | | */ |
173 | | bool CNetAddr::SetInternal(const std::string &name) |
174 | 10 | { |
175 | 10 | if (name.empty()) { |
176 | 0 | return false; |
177 | 0 | } |
178 | 10 | m_net = NET_INTERNAL; |
179 | 10 | unsigned char hash[32] = {}; |
180 | 10 | CSHA256().Write((const unsigned char*)name.data(), name.size()).Finalize(hash); |
181 | 10 | m_addr.assign(hash, hash + ADDR_INTERNAL_SIZE); |
182 | 10 | return true; |
183 | 10 | } |
184 | | |
185 | | namespace torv3 { |
186 | | // https://gitlab.torproject.org/tpo/core/torspec/-/tree/main/spec/rend-spec |
187 | | static constexpr size_t CHECKSUM_LEN = 2; |
188 | | static const unsigned char VERSION[] = {3}; |
189 | | static constexpr size_t TOTAL_LEN = ADDR_TORV3_SIZE + CHECKSUM_LEN + sizeof(VERSION); |
190 | | |
191 | | static void Checksum(std::span<const uint8_t> addr_pubkey, uint8_t (&checksum)[CHECKSUM_LEN]) |
192 | 259 | { |
193 | | // TORv3 CHECKSUM = H(".onion checksum" | PUBKEY | VERSION)[:2] |
194 | 259 | static const unsigned char prefix[] = ".onion checksum"; |
195 | 259 | static constexpr size_t prefix_len = 15; |
196 | | |
197 | 259 | SHA3_256 hasher; |
198 | | |
199 | 259 | hasher.Write(std::span{prefix}.first(prefix_len)); |
200 | 259 | hasher.Write(addr_pubkey); |
201 | 259 | hasher.Write(VERSION); |
202 | | |
203 | 259 | uint8_t checksum_full[SHA3_256::OUTPUT_SIZE]; |
204 | | |
205 | 259 | hasher.Finalize(checksum_full); |
206 | | |
207 | 259 | memcpy(checksum, checksum_full, sizeof(checksum)); |
208 | 259 | } |
209 | | |
210 | | }; // namespace torv3 |
211 | | |
212 | | bool CNetAddr::SetSpecial(std::string_view addr) |
213 | 567k | { |
214 | 567k | if (!ContainsNoNUL(addr)) { |
215 | 2 | return false; |
216 | 2 | } |
217 | | |
218 | 567k | if (SetTor(addr)) { |
219 | 61 | return true; |
220 | 61 | } |
221 | | |
222 | 567k | if (SetI2P(addr)) { |
223 | 41 | return true; |
224 | 41 | } |
225 | | |
226 | 567k | return false; |
227 | 567k | } |
228 | | |
229 | | bool CNetAddr::SetTor(std::string_view addr) |
230 | 567k | { |
231 | 567k | if (!addr.ends_with(".onion")) return false; |
232 | 70 | addr.remove_suffix(6); |
233 | 70 | auto input = DecodeBase32(addr); |
234 | | |
235 | 70 | if (!input) { |
236 | 3 | return false; |
237 | 3 | } |
238 | | |
239 | 67 | if (input->size() == torv3::TOTAL_LEN) { |
240 | 63 | std::span<const uint8_t> input_pubkey{input->data(), ADDR_TORV3_SIZE}; |
241 | 63 | std::span<const uint8_t> input_checksum{input->data() + ADDR_TORV3_SIZE, torv3::CHECKSUM_LEN}; |
242 | 63 | std::span<const uint8_t> input_version{input->data() + ADDR_TORV3_SIZE + torv3::CHECKSUM_LEN, sizeof(torv3::VERSION)}; |
243 | | |
244 | 63 | if (!std::ranges::equal(input_version, torv3::VERSION)) { |
245 | 1 | return false; |
246 | 1 | } |
247 | | |
248 | 62 | uint8_t calculated_checksum[torv3::CHECKSUM_LEN]; |
249 | 62 | torv3::Checksum(input_pubkey, calculated_checksum); |
250 | | |
251 | 62 | if (!std::ranges::equal(input_checksum, calculated_checksum)) { |
252 | 1 | return false; |
253 | 1 | } |
254 | | |
255 | 61 | m_net = NET_ONION; |
256 | 61 | m_addr.assign(input_pubkey.begin(), input_pubkey.end()); |
257 | 61 | return true; |
258 | 62 | } |
259 | | |
260 | 4 | return false; |
261 | 67 | } |
262 | | |
263 | | bool CNetAddr::SetI2P(std::string_view addr) |
264 | 567k | { |
265 | | // I2P addresses that we support consist of 52 base32 characters + ".b32.i2p". |
266 | 567k | static constexpr size_t b32_len{52}; |
267 | 567k | static const char* suffix{".b32.i2p"}; |
268 | 567k | static constexpr size_t suffix_len{8}; |
269 | | |
270 | 567k | if (addr.size() != b32_len + suffix_len || ToLower(addr.substr(b32_len)) != suffix) { |
271 | 567k | return false; |
272 | 567k | } |
273 | | |
274 | | // Remove the ".b32.i2p" suffix and pad to a multiple of 8 chars, so DecodeBase32() |
275 | | // can decode it. |
276 | 42 | const std::string b32_padded{tfm::format("%s====", addr.substr(0, b32_len))}; |
277 | | |
278 | 42 | auto address_bytes = DecodeBase32(b32_padded); |
279 | | |
280 | 42 | if (!address_bytes || address_bytes->size() != ADDR_I2P_SIZE) { |
281 | 1 | return false; |
282 | 1 | } |
283 | | |
284 | 41 | m_net = NET_I2P; |
285 | 41 | m_addr.assign(address_bytes->begin(), address_bytes->end()); |
286 | | |
287 | 41 | return true; |
288 | 42 | } |
289 | | |
290 | | CNetAddr::CNetAddr(const struct in_addr& ipv4Addr) |
291 | 567k | { |
292 | 567k | m_net = NET_IPV4; |
293 | 567k | const uint8_t* ptr = reinterpret_cast<const uint8_t*>(&ipv4Addr); |
294 | 567k | m_addr.assign(ptr, ptr + ADDR_IPV4_SIZE); |
295 | 567k | } |
296 | | |
297 | | CNetAddr::CNetAddr(const struct in6_addr& ipv6Addr, const uint32_t scope) |
298 | 2.44k | { |
299 | 2.44k | SetLegacyIPv6({reinterpret_cast<const uint8_t*>(&ipv6Addr), sizeof(ipv6Addr)}); |
300 | 2.44k | m_scope_id = scope; |
301 | 2.44k | } |
302 | | |
303 | | bool CNetAddr::IsBindAny() const |
304 | 3.18k | { |
305 | 3.18k | if (!IsIPv4() && !IsIPv6()) { |
306 | 3 | return false; |
307 | 3 | } |
308 | 19.6k | return std::all_of(m_addr.begin(), m_addr.end(), [](uint8_t b) { return b == 0; }); |
309 | 3.18k | } |
310 | | |
311 | | bool CNetAddr::IsRFC1918() const |
312 | 1.00M | { |
313 | 1.00M | return IsIPv4() && ( |
314 | 998k | m_addr[0] == 10 || |
315 | 998k | (m_addr[0] == 192 && m_addr[1] == 168) || |
316 | 998k | (m_addr[0] == 172 && m_addr[1] >= 16 && m_addr[1] <= 31)); |
317 | 1.00M | } |
318 | | |
319 | | bool CNetAddr::IsRFC2544() const |
320 | 1.00M | { |
321 | 1.00M | return IsIPv4() && m_addr[0] == 198 && (m_addr[1] == 18 || m_addr[1] == 19); |
322 | 1.00M | } |
323 | | |
324 | | bool CNetAddr::IsRFC3927() const |
325 | 1.00M | { |
326 | 1.00M | return IsIPv4() && HasPrefix(m_addr, std::array<uint8_t, 2>{169, 254}); |
327 | 1.00M | } |
328 | | |
329 | | bool CNetAddr::IsRFC6598() const |
330 | 1.00M | { |
331 | 1.00M | return IsIPv4() && m_addr[0] == 100 && m_addr[1] >= 64 && m_addr[1] <= 127; |
332 | 1.00M | } |
333 | | |
334 | | bool CNetAddr::IsRFC5737() const |
335 | 1.00M | { |
336 | 1.00M | return IsIPv4() && (HasPrefix(m_addr, std::array<uint8_t, 3>{192, 0, 2}) || |
337 | 997k | HasPrefix(m_addr, std::array<uint8_t, 3>{198, 51, 100}) || |
338 | 997k | HasPrefix(m_addr, std::array<uint8_t, 3>{203, 0, 113})); |
339 | 1.00M | } |
340 | | |
341 | | bool CNetAddr::IsRFC3849() const |
342 | 1.41M | { |
343 | 1.41M | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 4>{0x20, 0x01, 0x0D, 0xB8}); |
344 | 1.41M | } |
345 | | |
346 | | bool CNetAddr::IsRFC3964() const |
347 | 1.76k | { |
348 | 1.76k | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 2>{0x20, 0x02}); |
349 | 1.76k | } |
350 | | |
351 | | bool CNetAddr::IsRFC6052() const |
352 | 1.76k | { |
353 | 1.76k | return IsIPv6() && |
354 | 1.76k | HasPrefix(m_addr, std::array<uint8_t, 12>{0x00, 0x64, 0xFF, 0x9B, 0x00, 0x00, |
355 | 895 | 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}); |
356 | 1.76k | } |
357 | | |
358 | | bool CNetAddr::IsRFC4380() const |
359 | 1.81k | { |
360 | 1.81k | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 4>{0x20, 0x01, 0x00, 0x00}); |
361 | 1.81k | } |
362 | | |
363 | | bool CNetAddr::IsRFC4862() const |
364 | 1.00M | { |
365 | 1.00M | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 8>{0xFE, 0x80, 0x00, 0x00, |
366 | 2.34k | 0x00, 0x00, 0x00, 0x00}); |
367 | 1.00M | } |
368 | | |
369 | | bool CNetAddr::IsRFC4193() const |
370 | 1.00M | { |
371 | 1.00M | return IsIPv6() && (m_addr[0] & 0xFE) == 0xFC; |
372 | 1.00M | } |
373 | | |
374 | | bool CNetAddr::IsRFC6145() const |
375 | 1.76k | { |
376 | 1.76k | return IsIPv6() && |
377 | 1.76k | HasPrefix(m_addr, std::array<uint8_t, 12>{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, |
378 | 896 | 0x00, 0x00, 0xFF, 0xFF, 0x00, 0x00}); |
379 | 1.76k | } |
380 | | |
381 | | bool CNetAddr::IsRFC4843() const |
382 | 1.00M | { |
383 | 1.00M | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 3>{0x20, 0x01, 0x00}) && |
384 | 1.00M | (m_addr[3] & 0xF0) == 0x10; |
385 | 1.00M | } |
386 | | |
387 | | bool CNetAddr::IsRFC7343() const |
388 | 1.00M | { |
389 | 1.00M | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 3>{0x20, 0x01, 0x00}) && |
390 | 1.00M | (m_addr[3] & 0xF0) == 0x20; |
391 | 1.00M | } |
392 | | |
393 | | bool CNetAddr::IsHeNet() const |
394 | 232 | { |
395 | 232 | return IsIPv6() && HasPrefix(m_addr, std::array<uint8_t, 4>{0x20, 0x01, 0x04, 0x70}); |
396 | 232 | } |
397 | | |
398 | | bool CNetAddr::IsLocal() const |
399 | 1.08M | { |
400 | | // IPv4 loopback (127.0.0.0/8 or 0.0.0.0/8) |
401 | 1.08M | if (IsIPv4() && (m_addr[0] == 127 || m_addr[0] == 0)) { |
402 | 46.6k | return true; |
403 | 46.6k | } |
404 | | |
405 | | // IPv6 loopback (::1/128) |
406 | 1.03M | static const unsigned char pchLocal[16] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}; |
407 | 1.03M | if (IsIPv6() && memcmp(m_addr.data(), pchLocal, sizeof(pchLocal)) == 0) { |
408 | 2 | return true; |
409 | 2 | } |
410 | | |
411 | 1.03M | return false; |
412 | 1.03M | } |
413 | | |
414 | | /** |
415 | | * @returns Whether or not this network address is a valid address that @a could |
416 | | * be used to refer to an actual host. |
417 | | * |
418 | | * @note A valid address may or may not be publicly routable on the global |
419 | | * internet. As in, the set of valid addresses is a superset of the set of |
420 | | * publicly routable addresses. |
421 | | * |
422 | | * @see CNetAddr::IsRoutable() |
423 | | */ |
424 | | bool CNetAddr::IsValid() const |
425 | 1.43M | { |
426 | | // unspecified IPv6 address (::/128) |
427 | 1.43M | unsigned char ipNone6[16] = {}; |
428 | 1.43M | if (IsIPv6() && memcmp(m_addr.data(), ipNone6, sizeof(ipNone6)) == 0) { |
429 | 24.9k | return false; |
430 | 24.9k | } |
431 | | |
432 | 1.41M | if (IsCJDNS() && !HasCJDNSPrefix()) { |
433 | 1 | return false; |
434 | 1 | } |
435 | | |
436 | | // documentation IPv6 address |
437 | 1.41M | if (IsRFC3849()) |
438 | 0 | return false; |
439 | | |
440 | 1.41M | if (IsInternal()) |
441 | 1 | return false; |
442 | | |
443 | 1.41M | if (IsIPv4()) { |
444 | 1.40M | const uint32_t addr = ReadBE32(m_addr.data()); |
445 | 1.40M | if (addr == INADDR_ANY || addr == INADDR_NONE) { |
446 | 1.17k | return false; |
447 | 1.17k | } |
448 | 1.40M | } |
449 | | |
450 | 1.41M | return true; |
451 | 1.41M | } |
452 | | |
453 | | /** |
454 | | * @returns Whether or not this network address is publicly routable on the |
455 | | * global internet. |
456 | | * |
457 | | * @note A routable address is always valid. As in, the set of routable addresses |
458 | | * is a subset of the set of valid addresses. |
459 | | * |
460 | | * @see CNetAddr::IsValid() |
461 | | */ |
462 | | bool CNetAddr::IsRoutable() const |
463 | 1.00M | { |
464 | 1.00M | return IsValid() && !(IsRFC1918() || IsRFC2544() || IsRFC3927() || IsRFC4862() || IsRFC6598() || IsRFC5737() || IsRFC4193() || IsRFC4843() || IsRFC7343() || IsLocal() || IsInternal()); |
465 | 1.00M | } |
466 | | |
467 | | /** |
468 | | * @returns Whether or not this is a dummy address that represents a name. |
469 | | * |
470 | | * @see CNetAddr::SetInternal(const std::string &) |
471 | | */ |
472 | | bool CNetAddr::IsInternal() const |
473 | 3.60M | { |
474 | 3.60M | return m_net == NET_INTERNAL; |
475 | 3.60M | } |
476 | | |
477 | | bool CNetAddr::IsAddrV1Compatible() const |
478 | 259k | { |
479 | 259k | switch (m_net) { |
480 | 258k | case NET_IPV4: |
481 | 259k | case NET_IPV6: |
482 | 259k | case NET_INTERNAL: |
483 | 259k | return true; |
484 | 230 | case NET_ONION: |
485 | 370 | case NET_I2P: |
486 | 484 | case NET_CJDNS: |
487 | 484 | return false; |
488 | 0 | case NET_UNROUTABLE: // m_net is never and should not be set to NET_UNROUTABLE |
489 | 0 | case NET_MAX: // m_net is never and should not be set to NET_MAX |
490 | 0 | assert(false); |
491 | 259k | } // no default case, so the compiler can warn about missing cases |
492 | | |
493 | 259k | assert(false); |
494 | 0 | } |
495 | | |
496 | | enum Network CNetAddr::GetNetwork() const |
497 | 137k | { |
498 | 137k | if (IsInternal()) |
499 | 1 | return NET_INTERNAL; |
500 | | |
501 | 137k | if (!IsRoutable()) |
502 | 1.30k | return NET_UNROUTABLE; |
503 | | |
504 | 135k | return m_net; |
505 | 137k | } |
506 | | |
507 | | static std::string IPv4ToString(std::span<const uint8_t> a) |
508 | 456k | { |
509 | 456k | return strprintf("%u.%u.%u.%u", a[0], a[1], a[2], a[3]); |
510 | 456k | } |
511 | | |
512 | | // Return an IPv6 address text representation with zero compression as described in RFC 5952 |
513 | | // ("A Recommendation for IPv6 Address Text Representation"). |
514 | | static std::string IPv6ToString(std::span<const uint8_t> a, uint32_t scope_id) |
515 | 2.28k | { |
516 | 2.28k | assert(a.size() == ADDR_IPV6_SIZE); |
517 | 2.28k | const std::array groups{ |
518 | 2.28k | ReadBE16(&a[0]), |
519 | 2.28k | ReadBE16(&a[2]), |
520 | 2.28k | ReadBE16(&a[4]), |
521 | 2.28k | ReadBE16(&a[6]), |
522 | 2.28k | ReadBE16(&a[8]), |
523 | 2.28k | ReadBE16(&a[10]), |
524 | 2.28k | ReadBE16(&a[12]), |
525 | 2.28k | ReadBE16(&a[14]), |
526 | 2.28k | }; |
527 | | |
528 | | // The zero compression implementation is inspired by Rust's std::net::Ipv6Addr, see |
529 | | // https://github.com/rust-lang/rust/blob/cc4103089f40a163f6d143f06359cba7043da29b/library/std/src/net/ip.rs#L1635-L1683 |
530 | 2.28k | struct ZeroSpan { |
531 | 2.28k | size_t start_index{0}; |
532 | 2.28k | size_t len{0}; |
533 | 2.28k | }; |
534 | | |
535 | | // Find longest sequence of consecutive all-zero fields. Use first zero sequence if two or more |
536 | | // zero sequences of equal length are found. |
537 | 2.28k | ZeroSpan longest, current; |
538 | 20.5k | for (size_t i{0}; i < groups.size(); ++i) { |
539 | 18.2k | if (groups[i] != 0) { |
540 | 2.28k | current = {i + 1, 0}; |
541 | 2.28k | continue; |
542 | 2.28k | } |
543 | 16.0k | current.len += 1; |
544 | 16.0k | if (current.len > longest.len) { |
545 | 15.9k | longest = current; |
546 | 15.9k | } |
547 | 16.0k | } |
548 | | |
549 | 2.28k | std::string r; |
550 | 2.28k | r.reserve(39); |
551 | 20.5k | for (size_t i{0}; i < groups.size(); ++i) { |
552 | | // Replace the longest sequence of consecutive all-zero fields with two colons ("::"). |
553 | 18.2k | if (longest.len >= 2 && i >= longest.start_index && i < longest.start_index + longest.len) { |
554 | 15.9k | if (i == longest.start_index) { |
555 | 2.20k | r += "::"; |
556 | 2.20k | } |
557 | 15.9k | continue; |
558 | 15.9k | } |
559 | 2.32k | r += strprintf("%s%x", ((!r.empty() && r.back() != ':') ? ":" : ""), groups[i]); |
560 | 2.32k | } |
561 | | |
562 | 2.28k | if (scope_id != 0) { |
563 | 1 | r += strprintf("%%%u", scope_id); |
564 | 1 | } |
565 | | |
566 | 2.28k | return r; |
567 | 2.28k | } |
568 | | |
569 | | std::string OnionToString(std::span<const uint8_t> addr) |
570 | 197 | { |
571 | 197 | uint8_t checksum[torv3::CHECKSUM_LEN]; |
572 | 197 | torv3::Checksum(addr, checksum); |
573 | | // TORv3 onion_address = base32(PUBKEY | CHECKSUM | VERSION) + ".onion" |
574 | 197 | prevector<torv3::TOTAL_LEN, uint8_t> address{addr.begin(), addr.end()}; |
575 | 197 | address.insert(address.end(), checksum, checksum + torv3::CHECKSUM_LEN); |
576 | 197 | address.insert(address.end(), torv3::VERSION, torv3::VERSION + sizeof(torv3::VERSION)); |
577 | 197 | return EncodeBase32(address) + ".onion"; |
578 | 197 | } |
579 | | |
580 | | std::string CNetAddr::ToStringAddr() const |
581 | 459k | { |
582 | 459k | switch (m_net) { |
583 | 456k | case NET_IPV4: |
584 | 456k | return IPv4ToString(m_addr); |
585 | 2.22k | case NET_IPV6: |
586 | 2.22k | return IPv6ToString(m_addr, m_scope_id); |
587 | 194 | case NET_ONION: |
588 | 194 | return OnionToString(m_addr); |
589 | 77 | case NET_I2P: |
590 | 77 | return EncodeBase32(m_addr, false /* don't pad with = */) + ".b32.i2p"; |
591 | 62 | case NET_CJDNS: |
592 | 62 | return IPv6ToString(m_addr, 0); |
593 | 2 | case NET_INTERNAL: |
594 | 2 | return EncodeBase32(m_addr) + ".internal"; |
595 | 0 | case NET_UNROUTABLE: // m_net is never and should not be set to NET_UNROUTABLE |
596 | 0 | case NET_MAX: // m_net is never and should not be set to NET_MAX |
597 | 0 | assert(false); |
598 | 459k | } // no default case, so the compiler can warn about missing cases |
599 | | |
600 | 459k | assert(false); |
601 | 0 | } |
602 | | |
603 | | bool operator==(const CNetAddr& a, const CNetAddr& b) |
604 | 220k | { |
605 | 220k | return a.m_net == b.m_net && a.m_addr == b.m_addr; |
606 | 220k | } |
607 | | |
608 | | bool operator<(const CNetAddr& a, const CNetAddr& b) |
609 | 14.4k | { |
610 | 14.4k | return std::tie(a.m_net, a.m_addr) < std::tie(b.m_net, b.m_addr); |
611 | 14.4k | } |
612 | | |
613 | | /** |
614 | | * Try to get our IPv4 address. |
615 | | * |
616 | | * @param[out] pipv4Addr The in_addr struct to which to copy. |
617 | | * |
618 | | * @returns Whether or not the operation was successful, in particular, whether |
619 | | * or not our address was an IPv4 address. |
620 | | * |
621 | | * @see CNetAddr::IsIPv4() |
622 | | */ |
623 | | bool CNetAddr::GetInAddr(struct in_addr* pipv4Addr) const |
624 | 1.64k | { |
625 | 1.64k | if (!IsIPv4()) |
626 | 0 | return false; |
627 | 1.64k | assert(sizeof(*pipv4Addr) == m_addr.size()); |
628 | 1.64k | memcpy(pipv4Addr, m_addr.data(), m_addr.size()); |
629 | 1.64k | return true; |
630 | 1.64k | } |
631 | | |
632 | | /** |
633 | | * Try to get our IPv6 (or CJDNS) address. |
634 | | * |
635 | | * @param[out] pipv6Addr The in6_addr struct to which to copy. |
636 | | * |
637 | | * @returns Whether or not the operation was successful, in particular, whether |
638 | | * or not our address was an IPv6 address. |
639 | | * |
640 | | * @see CNetAddr::IsIPv6() |
641 | | */ |
642 | | bool CNetAddr::GetIn6Addr(struct in6_addr* pipv6Addr) const |
643 | 30 | { |
644 | 30 | if (!IsIPv6() && !IsCJDNS()) { |
645 | 0 | return false; |
646 | 0 | } |
647 | 30 | assert(sizeof(*pipv6Addr) == m_addr.size()); |
648 | 30 | memcpy(pipv6Addr, m_addr.data(), m_addr.size()); |
649 | 30 | return true; |
650 | 30 | } |
651 | | |
652 | | bool CNetAddr::HasLinkedIPv4() const |
653 | 396k | { |
654 | 396k | return IsRoutable() && (IsIPv4() || IsRFC6145() || IsRFC6052() || IsRFC3964() || IsRFC4380()); |
655 | 396k | } |
656 | | |
657 | | uint32_t CNetAddr::GetLinkedIPv4() const |
658 | 83.7k | { |
659 | 83.7k | if (IsIPv4()) { |
660 | 83.7k | return ReadBE32(m_addr.data()); |
661 | 83.7k | } else if (IsRFC6052() || IsRFC6145()) { |
662 | | // mapped IPv4, SIIT translated IPv4: the IPv4 address is the last 4 bytes of the address |
663 | 2 | return ReadBE32(std::span{m_addr}.last(ADDR_IPV4_SIZE).data()); |
664 | 2 | } else if (IsRFC3964()) { |
665 | | // 6to4 tunneled IPv4: the IPv4 address is in bytes 2-6 |
666 | 1 | return ReadBE32(std::span{m_addr}.subspan(2, ADDR_IPV4_SIZE).data()); |
667 | 1 | } else if (IsRFC4380()) { |
668 | | // Teredo tunneled IPv4: the IPv4 address is in the last 4 bytes of the address, but bitflipped |
669 | 1 | return ~ReadBE32(std::span{m_addr}.last(ADDR_IPV4_SIZE).data()); |
670 | 1 | } |
671 | 83.7k | assert(false); |
672 | 0 | } |
673 | | |
674 | | Network CNetAddr::GetNetClass() const |
675 | 350k | { |
676 | | // Make sure that if we return NET_IPV6, then IsIPv6() is true. The callers expect that. |
677 | | |
678 | | // Check for "internal" first because such addresses are also !IsRoutable() |
679 | | // and we don't want to return NET_UNROUTABLE in that case. |
680 | 350k | if (IsInternal()) { |
681 | 2 | return NET_INTERNAL; |
682 | 2 | } |
683 | 350k | if (!IsRoutable()) { |
684 | 38.5k | return NET_UNROUTABLE; |
685 | 38.5k | } |
686 | 312k | if (HasLinkedIPv4()) { |
687 | 310k | return NET_IPV4; |
688 | 310k | } |
689 | 1.22k | return m_net; |
690 | 312k | } |
691 | | |
692 | | std::vector<unsigned char> CNetAddr::GetAddrBytes() const |
693 | 240k | { |
694 | 240k | if (IsAddrV1Compatible()) { |
695 | 239k | uint8_t serialized[V1_SERIALIZATION_SIZE]; |
696 | 239k | SerializeV1Array(serialized); |
697 | 239k | return {std::begin(serialized), std::end(serialized)}; |
698 | 239k | } |
699 | 478 | return std::vector<unsigned char>(m_addr.begin(), m_addr.end()); |
700 | 240k | } |
701 | | |
702 | | // private extensions to enum Network, only returned by GetExtNetwork, |
703 | | // and only used in GetReachabilityFrom |
704 | | static const int NET_TEREDO = NET_MAX; |
705 | | int static GetExtNetwork(const CNetAddr& addr) |
706 | 116 | { |
707 | 116 | if (addr.IsRFC4380()) |
708 | 11 | return NET_TEREDO; |
709 | 105 | return addr.GetNetwork(); |
710 | 116 | } |
711 | | |
712 | | /** Calculates a metric for how reachable (*this) is from a given partner */ |
713 | | int CNetAddr::GetReachabilityFrom(const CNetAddr& paddrPartner) const |
714 | 59 | { |
715 | 59 | enum Reachability { |
716 | 59 | REACH_UNREACHABLE, |
717 | 59 | REACH_DEFAULT, |
718 | 59 | REACH_TEREDO, |
719 | 59 | REACH_IPV6_WEAK, |
720 | 59 | REACH_IPV4, |
721 | 59 | REACH_IPV6_STRONG, |
722 | 59 | REACH_PRIVATE |
723 | 59 | }; |
724 | | |
725 | 59 | if (!IsRoutable() || IsInternal()) |
726 | 1 | return REACH_UNREACHABLE; |
727 | | |
728 | 58 | int ourNet = GetExtNetwork(*this); |
729 | 58 | int theirNet = GetExtNetwork(paddrPartner); |
730 | 58 | bool fTunnel = IsRFC3964() || IsRFC6052() || IsRFC6145(); |
731 | | |
732 | 58 | switch(theirNet) { |
733 | 6 | case NET_IPV4: |
734 | 6 | switch(ourNet) { |
735 | 4 | default: return REACH_DEFAULT; |
736 | 2 | case NET_IPV4: return REACH_IPV4; |
737 | 6 | } |
738 | 12 | case NET_IPV6: |
739 | 12 | switch(ourNet) { |
740 | 2 | default: return REACH_DEFAULT; |
741 | 2 | case NET_TEREDO: return REACH_TEREDO; |
742 | 4 | case NET_IPV4: return REACH_IPV4; |
743 | 4 | case NET_IPV6: return fTunnel ? REACH_IPV6_WEAK : REACH_IPV6_STRONG; // only prefer giving our IPv6 address if it's not tunnelled |
744 | 12 | } |
745 | 2 | case NET_ONION: |
746 | 2 | switch(ourNet) { |
747 | 0 | default: return REACH_DEFAULT; |
748 | 0 | case NET_IPV4: return REACH_IPV4; // Tor users can connect to IPv4 as well |
749 | 2 | case NET_ONION: return REACH_PRIVATE; |
750 | 2 | } |
751 | 2 | case NET_I2P: |
752 | 2 | switch (ourNet) { |
753 | 2 | case NET_I2P: return REACH_PRIVATE; |
754 | 0 | default: return REACH_DEFAULT; |
755 | 2 | } |
756 | 6 | case NET_CJDNS: |
757 | 6 | switch (ourNet) { |
758 | 1 | case NET_CJDNS: return REACH_PRIVATE; |
759 | 5 | default: return REACH_DEFAULT; |
760 | 6 | } |
761 | 6 | case NET_TEREDO: |
762 | 6 | switch(ourNet) { |
763 | 1 | default: return REACH_DEFAULT; |
764 | 1 | case NET_TEREDO: return REACH_TEREDO; |
765 | 2 | case NET_IPV6: return REACH_IPV6_WEAK; |
766 | 2 | case NET_IPV4: return REACH_IPV4; |
767 | 6 | } |
768 | 24 | case NET_UNROUTABLE: |
769 | 24 | default: |
770 | 24 | switch(ourNet) { |
771 | 0 | default: return REACH_DEFAULT; |
772 | 0 | case NET_TEREDO: return REACH_TEREDO; |
773 | 0 | case NET_IPV6: return REACH_IPV6_WEAK; |
774 | 24 | case NET_IPV4: return REACH_IPV4; |
775 | 0 | case NET_ONION: return REACH_PRIVATE; // either from Tor, or don't care about our address |
776 | 24 | } |
777 | 58 | } |
778 | 58 | } |
779 | | |
780 | 1.15M | CService::CService() : port(0) |
781 | 1.15M | { |
782 | 1.15M | } |
783 | | |
784 | 557k | CService::CService(const CNetAddr& cip, uint16_t portIn) : CNetAddr(cip), port(portIn) |
785 | 557k | { |
786 | 557k | } |
787 | | |
788 | 36 | CService::CService(const struct in_addr& ipv4Addr, uint16_t portIn) : CNetAddr(ipv4Addr), port(portIn) |
789 | 36 | { |
790 | 36 | } |
791 | | |
792 | 9 | CService::CService(const struct in6_addr& ipv6Addr, uint16_t portIn) : CNetAddr(ipv6Addr), port(portIn) |
793 | 9 | { |
794 | 9 | } |
795 | | |
796 | 2.62k | CService::CService(const struct sockaddr_in& addr) : CNetAddr(addr.sin_addr), port(ntohs(addr.sin_port)) |
797 | 2.62k | { |
798 | 2.62k | assert(addr.sin_family == AF_INET); |
799 | 2.62k | } |
800 | | |
801 | 12 | CService::CService(const struct sockaddr_in6 &addr) : CNetAddr(addr.sin6_addr, addr.sin6_scope_id), port(ntohs(addr.sin6_port)) |
802 | 12 | { |
803 | 12 | assert(addr.sin6_family == AF_INET6); |
804 | 12 | } |
805 | | |
806 | | bool CService::SetSockAddr(const struct sockaddr *paddr, socklen_t addrlen) |
807 | 2.64k | { |
808 | 2.64k | switch (paddr->sa_family) { |
809 | 2.62k | case AF_INET: |
810 | 2.62k | if (addrlen != sizeof(struct sockaddr_in)) return false; |
811 | 2.62k | *this = CService(*(const struct sockaddr_in*)paddr); |
812 | 2.62k | return true; |
813 | 12 | case AF_INET6: |
814 | 12 | if (addrlen != sizeof(struct sockaddr_in6)) return false; |
815 | 12 | *this = CService(*(const struct sockaddr_in6*)paddr); |
816 | 12 | return true; |
817 | 4 | default: |
818 | 4 | return false; |
819 | 2.64k | } |
820 | 2.64k | } |
821 | | |
822 | | sa_family_t CService::GetSAFamily() const |
823 | 1.62k | { |
824 | 1.62k | switch (m_net) { |
825 | 1.60k | case NET_IPV4: |
826 | 1.60k | return AF_INET; |
827 | 20 | case NET_IPV6: |
828 | 20 | case NET_CJDNS: |
829 | 20 | return AF_INET6; |
830 | 0 | default: |
831 | 0 | return AF_UNSPEC; |
832 | 1.62k | } |
833 | 1.62k | } |
834 | | |
835 | | uint16_t CService::GetPort() const |
836 | 31.3k | { |
837 | 31.3k | return port; |
838 | 31.3k | } |
839 | | |
840 | | bool operator==(const CService& a, const CService& b) |
841 | 171k | { |
842 | 171k | return static_cast<CNetAddr>(a) == static_cast<CNetAddr>(b) && a.port == b.port; |
843 | 171k | } |
844 | | |
845 | | bool operator<(const CService& a, const CService& b) |
846 | 14.1k | { |
847 | 14.1k | return static_cast<CNetAddr>(a) < static_cast<CNetAddr>(b) || (static_cast<CNetAddr>(a) == static_cast<CNetAddr>(b) && a.port < b.port); |
848 | 14.1k | } |
849 | | |
850 | | /** |
851 | | * Obtain the IPv4/6 socket address this represents. |
852 | | * |
853 | | * @param[out] paddr The obtained socket address. |
854 | | * @param[in,out] addrlen The size, in bytes, of the address structure pointed |
855 | | * to by paddr. The value that's pointed to by this |
856 | | * parameter might change after calling this function if |
857 | | * the size of the corresponding address structure |
858 | | * changed. |
859 | | * |
860 | | * @returns Whether or not the operation was successful. |
861 | | */ |
862 | | bool CService::GetSockAddr(struct sockaddr* paddr, socklen_t *addrlen) const |
863 | 1.65k | { |
864 | 1.65k | if (IsIPv4()) { |
865 | 1.62k | if (*addrlen < (socklen_t)sizeof(struct sockaddr_in)) |
866 | 0 | return false; |
867 | 1.62k | *addrlen = sizeof(struct sockaddr_in); |
868 | 1.62k | struct sockaddr_in *paddrin = (struct sockaddr_in*)paddr; |
869 | 1.62k | memset(paddrin, 0, *addrlen); |
870 | 1.62k | if (!GetInAddr(&paddrin->sin_addr)) |
871 | 0 | return false; |
872 | 1.62k | paddrin->sin_family = AF_INET; |
873 | 1.62k | paddrin->sin_port = htons(port); |
874 | 1.62k | return true; |
875 | 1.62k | } |
876 | 26 | if (IsIPv6() || IsCJDNS()) { |
877 | 26 | if (*addrlen < (socklen_t)sizeof(struct sockaddr_in6)) |
878 | 0 | return false; |
879 | 26 | *addrlen = sizeof(struct sockaddr_in6); |
880 | 26 | struct sockaddr_in6 *paddrin6 = (struct sockaddr_in6*)paddr; |
881 | 26 | memset(paddrin6, 0, *addrlen); |
882 | 26 | if (!GetIn6Addr(&paddrin6->sin6_addr)) |
883 | 0 | return false; |
884 | 26 | paddrin6->sin6_scope_id = m_scope_id; |
885 | 26 | paddrin6->sin6_family = AF_INET6; |
886 | 26 | paddrin6->sin6_port = htons(port); |
887 | 26 | return true; |
888 | 26 | } |
889 | 0 | return false; |
890 | 26 | } |
891 | | |
892 | | /** |
893 | | * @returns An identifier unique to this service's address and port number. |
894 | | */ |
895 | | std::vector<unsigned char> CService::GetKey() const |
896 | 198k | { |
897 | 198k | auto key = GetAddrBytes(); |
898 | 198k | key.push_back(port / 0x100); // most significant byte of our port |
899 | 198k | key.push_back(port & 0x0FF); // least significant byte of our port |
900 | 198k | return key; |
901 | 198k | } |
902 | | |
903 | | std::string CService::ToStringAddrPort() const |
904 | 398k | { |
905 | 398k | const auto port_str = strprintf("%u", port); |
906 | | |
907 | 398k | if (IsIPv4() || IsTor() || IsI2P() || IsInternal()) { |
908 | 397k | return ToStringAddr() + ":" + port_str; |
909 | 397k | } else { |
910 | 1.02k | return "[" + ToStringAddr() + "]:" + port_str; |
911 | 1.02k | } |
912 | 398k | } |
913 | | |
914 | | CSubNet::CSubNet(): |
915 | 3.00k | valid(false) |
916 | 3.00k | { |
917 | 3.00k | memset(netmask, 0, sizeof(netmask)); |
918 | 3.00k | } |
919 | | |
920 | 1.15k | CSubNet::CSubNet(const CNetAddr& addr, uint8_t mask) : CSubNet() |
921 | 1.15k | { |
922 | 1.15k | valid = (addr.IsIPv4() && mask <= ADDR_IPV4_SIZE * 8) || |
923 | 1.15k | (addr.IsIPv6() && mask <= ADDR_IPV6_SIZE * 8); |
924 | 1.15k | if (!valid) { |
925 | 6 | return; |
926 | 6 | } |
927 | | |
928 | 1.15k | assert(mask <= sizeof(netmask) * 8); |
929 | | |
930 | 1.15k | network = addr; |
931 | | |
932 | 1.15k | uint8_t n = mask; |
933 | 5.94k | for (size_t i = 0; i < network.m_addr.size(); ++i) { |
934 | 4.78k | const uint8_t bits = n < 8 ? n : 8; |
935 | 4.78k | netmask[i] = (uint8_t)((uint8_t)0xFF << (8 - bits)); // Set first bits. |
936 | 4.78k | network.m_addr[i] &= netmask[i]; // Normalize network according to netmask. |
937 | 4.78k | n -= bits; |
938 | 4.78k | } |
939 | 1.15k | } |
940 | | |
941 | | /** |
942 | | * @returns The number of 1-bits in the prefix of the specified subnet mask. If |
943 | | * the specified subnet mask is not a valid one, -1. |
944 | | */ |
945 | | static inline int NetmaskBits(uint8_t x) |
946 | 19.4k | { |
947 | 19.4k | switch(x) { |
948 | 108 | case 0x00: return 0; |
949 | 8 | case 0x80: return 1; |
950 | 8 | case 0xc0: return 2; |
951 | 22 | case 0xe0: return 3; |
952 | 8 | case 0xf0: return 4; |
953 | 8 | case 0xf8: return 5; |
954 | 11 | case 0xfc: return 6; |
955 | 9 | case 0xfe: return 7; |
956 | 19.2k | case 0xff: return 8; |
957 | 2 | default: return -1; |
958 | 19.4k | } |
959 | 19.4k | } |
960 | | |
961 | 50 | CSubNet::CSubNet(const CNetAddr& addr, const CNetAddr& mask) : CSubNet() |
962 | 50 | { |
963 | 50 | valid = (addr.IsIPv4() || addr.IsIPv6()) && addr.m_net == mask.m_net; |
964 | 50 | if (!valid) { |
965 | 3 | return; |
966 | 3 | } |
967 | | // Check if `mask` contains 1-bits after 0-bits (which is an invalid netmask). |
968 | 47 | bool zeros_found = false; |
969 | 238 | for (auto b : mask.m_addr) { |
970 | 238 | const int num_bits = NetmaskBits(b); |
971 | 238 | if (num_bits == -1 || (zeros_found && num_bits != 0)) { |
972 | 4 | valid = false; |
973 | 4 | return; |
974 | 4 | } |
975 | 234 | if (num_bits < 8) { |
976 | 138 | zeros_found = true; |
977 | 138 | } |
978 | 234 | } |
979 | | |
980 | 47 | assert(mask.m_addr.size() <= sizeof(netmask)); |
981 | | |
982 | 43 | memcpy(netmask, mask.m_addr.data(), mask.m_addr.size()); |
983 | | |
984 | 43 | network = addr; |
985 | | |
986 | | // Normalize network according to netmask |
987 | 263 | for (size_t x = 0; x < network.m_addr.size(); ++x) { |
988 | 220 | network.m_addr[x] &= netmask[x]; |
989 | 220 | } |
990 | 43 | } |
991 | | |
992 | 1.31k | CSubNet::CSubNet(const CNetAddr& addr) : CSubNet() |
993 | 1.31k | { |
994 | 1.31k | switch (addr.m_net) { |
995 | 193 | case NET_IPV4: |
996 | 1.29k | case NET_IPV6: |
997 | 1.29k | valid = true; |
998 | 1.29k | assert(addr.m_addr.size() <= sizeof(netmask)); |
999 | 1.29k | memset(netmask, 0xFF, addr.m_addr.size()); |
1000 | 1.29k | break; |
1001 | 15 | case NET_ONION: |
1002 | 15 | case NET_I2P: |
1003 | 15 | case NET_CJDNS: |
1004 | 15 | valid = true; |
1005 | 15 | break; |
1006 | 0 | case NET_INTERNAL: |
1007 | 0 | case NET_UNROUTABLE: |
1008 | 0 | case NET_MAX: |
1009 | 0 | return; |
1010 | 1.31k | } |
1011 | | |
1012 | 1.31k | network = addr; |
1013 | 1.31k | } |
1014 | | |
1015 | | /** |
1016 | | * @returns True if this subnet is valid, the specified address is valid, and |
1017 | | * the specified address belongs in this subnet. |
1018 | | */ |
1019 | | bool CSubNet::Match(const CNetAddr &addr) const |
1020 | 171k | { |
1021 | 171k | if (!valid || !addr.IsValid() || network.m_net != addr.m_net) |
1022 | 33 | return false; |
1023 | | |
1024 | 171k | switch (network.m_net) { |
1025 | 171k | case NET_IPV4: |
1026 | 171k | case NET_IPV6: |
1027 | 171k | break; |
1028 | 3 | case NET_ONION: |
1029 | 3 | case NET_I2P: |
1030 | 3 | case NET_CJDNS: |
1031 | 3 | case NET_INTERNAL: |
1032 | 3 | return addr == network; |
1033 | 0 | case NET_UNROUTABLE: |
1034 | 0 | case NET_MAX: |
1035 | 0 | return false; |
1036 | 171k | } |
1037 | | |
1038 | 171k | assert(network.m_addr.size() == addr.m_addr.size()); |
1039 | 857k | for (size_t x = 0; x < addr.m_addr.size(); ++x) { |
1040 | 686k | if ((addr.m_addr[x] & netmask[x]) != network.m_addr[x]) { |
1041 | 25 | return false; |
1042 | 25 | } |
1043 | 686k | } |
1044 | 171k | return true; |
1045 | 171k | } |
1046 | | |
1047 | | std::string CSubNet::ToString() const |
1048 | 2.37k | { |
1049 | 2.37k | std::string suffix; |
1050 | | |
1051 | 2.37k | switch (network.m_net) { |
1052 | 1.23k | case NET_IPV4: |
1053 | 2.35k | case NET_IPV6: { |
1054 | 2.35k | assert(network.m_addr.size() <= sizeof(netmask)); |
1055 | | |
1056 | 2.35k | uint8_t cidr = 0; |
1057 | | |
1058 | 21.5k | for (size_t i = 0; i < network.m_addr.size(); ++i) { |
1059 | 20.4k | if (netmask[i] == 0x00) { |
1060 | 1.17k | break; |
1061 | 1.17k | } |
1062 | 19.2k | cidr += NetmaskBits(netmask[i]); |
1063 | 19.2k | } |
1064 | | |
1065 | 2.35k | suffix = strprintf("/%u", cidr); |
1066 | 2.35k | break; |
1067 | 2.35k | } |
1068 | 25 | case NET_ONION: |
1069 | 25 | case NET_I2P: |
1070 | 25 | case NET_CJDNS: |
1071 | 25 | case NET_INTERNAL: |
1072 | 25 | case NET_UNROUTABLE: |
1073 | 25 | case NET_MAX: |
1074 | 25 | break; |
1075 | 2.37k | } |
1076 | | |
1077 | 2.37k | return network.ToStringAddr() + suffix; |
1078 | 2.37k | } |
1079 | | |
1080 | | bool CSubNet::IsValid() const |
1081 | 682 | { |
1082 | 682 | return valid; |
1083 | 682 | } |
1084 | | |
1085 | | bool operator==(const CSubNet& a, const CSubNet& b) |
1086 | 2 | { |
1087 | 2 | return a.valid == b.valid && a.network == b.network && !memcmp(a.netmask, b.netmask, 16); |
1088 | 2 | } |
1089 | | |
1090 | | bool operator<(const CSubNet& a, const CSubNet& b) |
1091 | 188 | { |
1092 | 188 | return (a.network < b.network || (a.network == b.network && memcmp(a.netmask, b.netmask, 16) < 0)); |
1093 | 188 | } |