]>
Commit | Line | Data |
---|---|---|
3b5f4af2 MT |
1 | /* |
2 | libloc - A library to determine the location of someone on the Internet | |
3 | ||
4 | Copyright (C) 2017 IPFire Development Team <info@ipfire.org> | |
5 | ||
6 | This library is free software; you can redistribute it and/or | |
7 | modify it under the terms of the GNU Lesser General Public | |
8 | License as published by the Free Software Foundation; either | |
9 | version 2.1 of the License, or (at your option) any later version. | |
10 | ||
11 | This library is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | Lesser General Public License for more details. | |
15 | */ | |
16 | ||
17 | #include <arpa/inet.h> | |
18 | #include <assert.h> | |
19 | #include <errno.h> | |
71ff3e69 | 20 | #include <stdio.h> |
3b5f4af2 MT |
21 | #include <stdlib.h> |
22 | #include <string.h> | |
23 | ||
42f3ccd7 MT |
24 | #ifdef HAVE_ENDIAN_H |
25 | # include <endian.h> | |
26 | #endif | |
27 | ||
3b5f4af2 | 28 | #include <loc/libloc.h> |
42f3ccd7 | 29 | #include <loc/compat.h> |
57146963 | 30 | #include <loc/country.h> |
3b5f4af2 | 31 | #include <loc/network.h> |
e0b9ff5f | 32 | #include <loc/network-list.h> |
9fc7f001 | 33 | #include <loc/private.h> |
3b5f4af2 MT |
34 | |
35 | struct loc_network { | |
36 | struct loc_ctx* ctx; | |
37 | int refcount; | |
38 | ||
c3068be1 | 39 | int family; |
ce4f5752 | 40 | struct in6_addr first_address; |
b43edb61 | 41 | struct in6_addr last_address; |
3b5f4af2 MT |
42 | unsigned int prefix; |
43 | ||
44 | char country_code[3]; | |
71ff3e69 | 45 | uint32_t asn; |
a293f829 | 46 | enum loc_network_flags flags; |
3b5f4af2 MT |
47 | }; |
48 | ||
6183c0f2 MT |
49 | static int valid_prefix(struct in6_addr* address, unsigned int prefix) { |
50 | // The prefix cannot be larger than 128 bits | |
51 | if (prefix > 128) | |
52 | return 1; | |
53 | ||
54 | // And the prefix cannot be zero | |
55 | if (prefix == 0) | |
56 | return 1; | |
57 | ||
aa37232a MT |
58 | // For IPv4-mapped addresses the prefix has to be 96 or lager |
59 | if (IN6_IS_ADDR_V4MAPPED(address) && prefix <= 96) | |
60 | return 1; | |
61 | ||
6183c0f2 MT |
62 | return 0; |
63 | } | |
64 | ||
a82ce8bc MT |
65 | static struct in6_addr prefix_to_bitmask(unsigned int prefix) { |
66 | struct in6_addr bitmask; | |
67 | ||
68 | for (unsigned int i = 0; i < 16; i++) | |
69 | bitmask.s6_addr[i] = 0; | |
70 | ||
364a2a37 | 71 | for (int i = prefix, j = 0; i > 0; i -= 8, j++) { |
a82ce8bc MT |
72 | if (i >= 8) |
73 | bitmask.s6_addr[j] = 0xff; | |
74 | else | |
75 | bitmask.s6_addr[j] = 0xff << (8 - i); | |
76 | } | |
77 | ||
78 | return bitmask; | |
79 | } | |
80 | ||
b43edb61 | 81 | static struct in6_addr make_first_address(const struct in6_addr* address, const struct in6_addr* bitmask) { |
a82ce8bc | 82 | struct in6_addr a; |
a82ce8bc MT |
83 | |
84 | // Perform bitwise AND | |
85 | for (unsigned int i = 0; i < 4; i++) | |
b43edb61 | 86 | a.s6_addr32[i] = address->s6_addr32[i] & bitmask->s6_addr32[i]; |
a82ce8bc MT |
87 | |
88 | return a; | |
89 | } | |
90 | ||
b43edb61 | 91 | static struct in6_addr make_last_address(const struct in6_addr* address, const struct in6_addr* bitmask) { |
2a30e4de | 92 | struct in6_addr a; |
2a30e4de MT |
93 | |
94 | // Perform bitwise OR | |
95 | for (unsigned int i = 0; i < 4; i++) | |
b43edb61 | 96 | a.s6_addr32[i] = address->s6_addr32[i] | ~bitmask->s6_addr32[i]; |
2a30e4de MT |
97 | |
98 | return a; | |
99 | } | |
100 | ||
850e7516 MT |
101 | static struct in6_addr address_increment(const struct in6_addr* address) { |
102 | struct in6_addr a = *address; | |
103 | ||
104 | for (int octet = 15; octet >= 0; octet--) { | |
105 | if (a.s6_addr[octet] < 255) { | |
106 | a.s6_addr[octet]++; | |
107 | break; | |
108 | } else { | |
109 | a.s6_addr[octet] = 0; | |
110 | } | |
111 | } | |
112 | ||
113 | return a; | |
114 | } | |
115 | ||
3b5f4af2 | 116 | LOC_EXPORT int loc_network_new(struct loc_ctx* ctx, struct loc_network** network, |
10778041 | 117 | struct in6_addr* address, unsigned int prefix) { |
3b5f4af2 | 118 | // Address cannot be unspecified |
bca87342 | 119 | if (IN6_IS_ADDR_UNSPECIFIED(address)) { |
3b5f4af2 MT |
120 | DEBUG(ctx, "Start address is unspecified\n"); |
121 | return -EINVAL; | |
122 | } | |
123 | ||
124 | // Address cannot be loopback | |
bca87342 | 125 | if (IN6_IS_ADDR_LOOPBACK(address)) { |
3b5f4af2 MT |
126 | DEBUG(ctx, "Start address is loopback address\n"); |
127 | return -EINVAL; | |
128 | } | |
129 | ||
130 | // Address cannot be link-local | |
bca87342 | 131 | if (IN6_IS_ADDR_LINKLOCAL(address)) { |
3b5f4af2 MT |
132 | DEBUG(ctx, "Start address cannot be link-local\n"); |
133 | return -EINVAL; | |
134 | } | |
135 | ||
136 | // Address cannot be site-local | |
bca87342 | 137 | if (IN6_IS_ADDR_SITELOCAL(address)) { |
3b5f4af2 MT |
138 | DEBUG(ctx, "Start address cannot be site-local\n"); |
139 | return -EINVAL; | |
140 | } | |
141 | ||
6183c0f2 | 142 | // Validate the prefix |
10778041 | 143 | if (valid_prefix(address, prefix) != 0) { |
6183c0f2 MT |
144 | DEBUG(ctx, "Invalid prefix: %u\n", prefix); |
145 | return -EINVAL; | |
146 | } | |
147 | ||
3b5f4af2 MT |
148 | struct loc_network* n = calloc(1, sizeof(*n)); |
149 | if (!n) | |
150 | return -ENOMEM; | |
151 | ||
152 | n->ctx = loc_ref(ctx); | |
153 | n->refcount = 1; | |
154 | ||
b43edb61 | 155 | // Store the prefix |
3b5f4af2 MT |
156 | n->prefix = prefix; |
157 | ||
b43edb61 MT |
158 | // Convert the prefix into a bitmask |
159 | struct in6_addr bitmask = prefix_to_bitmask(n->prefix); | |
160 | ||
161 | // Store the first and last address in the network | |
162 | n->first_address = make_first_address(address, &bitmask); | |
163 | n->last_address = make_last_address(&n->first_address, &bitmask); | |
164 | ||
c3068be1 MT |
165 | // Set family |
166 | if (IN6_IS_ADDR_V4MAPPED(&n->first_address)) | |
167 | n->family = AF_INET; | |
168 | else | |
169 | n->family = AF_INET6; | |
170 | ||
3b5f4af2 MT |
171 | DEBUG(n->ctx, "Network allocated at %p\n", n); |
172 | *network = n; | |
173 | return 0; | |
174 | } | |
175 | ||
176 | LOC_EXPORT int loc_network_new_from_string(struct loc_ctx* ctx, struct loc_network** network, | |
177 | const char* address_string) { | |
ce4f5752 | 178 | struct in6_addr first_address; |
3b5f4af2 | 179 | char* prefix_string; |
26ab419b | 180 | unsigned int prefix = 128; |
13ad6e69 MT |
181 | int r = -EINVAL; |
182 | ||
183 | DEBUG(ctx, "Attempting to parse network %s\n", address_string); | |
3b5f4af2 MT |
184 | |
185 | // Make a copy of the string to work on it | |
186 | char* buffer = strdup(address_string); | |
187 | address_string = prefix_string = buffer; | |
188 | ||
189 | // Split address and prefix | |
190 | address_string = strsep(&prefix_string, "/"); | |
191 | ||
13ad6e69 MT |
192 | DEBUG(ctx, " Split into address = %s, prefix = %s\n", address_string, prefix_string); |
193 | ||
13ad6e69 MT |
194 | // Parse the address |
195 | r = loc_parse_address(ctx, address_string, &first_address); | |
196 | if (r) { | |
197 | DEBUG(ctx, "The address could not be parsed\n"); | |
198 | goto FAIL; | |
b61f14fc | 199 | } |
3b5f4af2 | 200 | |
26ab419b MT |
201 | // If a prefix was given, we will try to parse it |
202 | if (prefix_string) { | |
203 | // Convert prefix to integer | |
204 | prefix = strtol(prefix_string, NULL, 10); | |
205 | ||
206 | if (!prefix) { | |
207 | DEBUG(ctx, "The prefix was not parsable: %s\n", prefix_string); | |
208 | goto FAIL; | |
209 | } | |
210 | ||
211 | // Map the prefix to IPv6 if needed | |
212 | if (IN6_IS_ADDR_V4MAPPED(&first_address)) | |
213 | prefix += 96; | |
214 | } | |
13ad6e69 MT |
215 | |
216 | FAIL: | |
3b5f4af2 MT |
217 | // Free temporary buffer |
218 | free(buffer); | |
219 | ||
13ad6e69 MT |
220 | // Exit if the parsing was unsuccessful |
221 | if (r) | |
222 | return r; | |
223 | ||
13ad6e69 MT |
224 | // Create a new network |
225 | return loc_network_new(ctx, network, &first_address, prefix); | |
3b5f4af2 MT |
226 | } |
227 | ||
228 | LOC_EXPORT struct loc_network* loc_network_ref(struct loc_network* network) { | |
229 | network->refcount++; | |
230 | ||
231 | return network; | |
232 | } | |
233 | ||
234 | static void loc_network_free(struct loc_network* network) { | |
235 | DEBUG(network->ctx, "Releasing network at %p\n", network); | |
236 | ||
3b5f4af2 MT |
237 | loc_unref(network->ctx); |
238 | free(network); | |
239 | } | |
240 | ||
241 | LOC_EXPORT struct loc_network* loc_network_unref(struct loc_network* network) { | |
2a30e4de MT |
242 | if (!network) |
243 | return NULL; | |
244 | ||
3b5f4af2 MT |
245 | if (--network->refcount > 0) |
246 | return network; | |
247 | ||
248 | loc_network_free(network); | |
249 | return NULL; | |
250 | } | |
251 | ||
8fb874e9 MT |
252 | static int format_ipv6_address(const struct in6_addr* address, char* string, size_t length) { |
253 | const char* ret = inet_ntop(AF_INET6, address, string, length); | |
d3409788 MT |
254 | if (!ret) |
255 | return -1; | |
256 | ||
257 | return 0; | |
258 | } | |
259 | ||
8fb874e9 | 260 | static int format_ipv4_address(const struct in6_addr* address, char* string, size_t length) { |
d3409788 | 261 | struct in_addr ipv4_address; |
8fb874e9 | 262 | ipv4_address.s_addr = address->s6_addr32[3]; |
d3409788 MT |
263 | |
264 | const char* ret = inet_ntop(AF_INET, &ipv4_address, string, length); | |
265 | if (!ret) | |
266 | return -1; | |
267 | ||
268 | return 0; | |
269 | } | |
270 | ||
3b5f4af2 | 271 | LOC_EXPORT char* loc_network_str(struct loc_network* network) { |
d3409788 MT |
272 | int r; |
273 | const size_t length = INET6_ADDRSTRLEN + 4; | |
3b5f4af2 | 274 | |
d3409788 | 275 | char* string = malloc(length); |
3b5f4af2 MT |
276 | if (!string) |
277 | return NULL; | |
278 | ||
aa37232a MT |
279 | unsigned int prefix = network->prefix; |
280 | ||
c3068be1 | 281 | switch (network->family) { |
d3409788 | 282 | case AF_INET6: |
ce4f5752 | 283 | r = format_ipv6_address(&network->first_address, string, length); |
d3409788 | 284 | break; |
3b5f4af2 | 285 | |
d3409788 | 286 | case AF_INET: |
ce4f5752 | 287 | r = format_ipv4_address(&network->first_address, string, length); |
aa37232a | 288 | prefix -= 96; |
d3409788 MT |
289 | break; |
290 | ||
291 | default: | |
292 | r = -1; | |
293 | break; | |
294 | } | |
295 | ||
296 | if (r) { | |
297 | ERROR(network->ctx, "Could not convert network to string: %s\n", strerror(errno)); | |
3b5f4af2 | 298 | free(string); |
d3409788 | 299 | |
3b5f4af2 MT |
300 | return NULL; |
301 | } | |
302 | ||
303 | // Append prefix | |
aa37232a | 304 | sprintf(string + strlen(string), "/%u", prefix); |
3b5f4af2 MT |
305 | |
306 | return string; | |
307 | } | |
308 | ||
44e5ef71 | 309 | LOC_EXPORT int loc_network_address_family(struct loc_network* network) { |
c3068be1 | 310 | return network->family; |
44e5ef71 MT |
311 | } |
312 | ||
7fe6a218 MT |
313 | LOC_EXPORT unsigned int loc_network_prefix(struct loc_network* network) { |
314 | switch (network->family) { | |
315 | case AF_INET6: | |
316 | return network->prefix; | |
317 | ||
318 | case AF_INET: | |
319 | return network->prefix - 96; | |
320 | } | |
321 | ||
322 | return 0; | |
323 | } | |
324 | ||
2b9338ea MT |
325 | static char* loc_network_format_address(struct loc_network* network, const struct in6_addr* address) { |
326 | const size_t length = INET6_ADDRSTRLEN; | |
327 | ||
328 | char* string = malloc(length); | |
329 | if (!string) | |
330 | return NULL; | |
331 | ||
332 | int r = 0; | |
333 | ||
c3068be1 | 334 | switch (network->family) { |
2b9338ea MT |
335 | case AF_INET6: |
336 | r = format_ipv6_address(address, string, length); | |
337 | break; | |
338 | ||
339 | case AF_INET: | |
340 | r = format_ipv4_address(address, string, length); | |
341 | break; | |
342 | ||
343 | default: | |
344 | r = -1; | |
345 | break; | |
346 | } | |
347 | ||
348 | if (r) { | |
349 | ERROR(network->ctx, "Could not format IP address to string: %s\n", strerror(errno)); | |
350 | free(string); | |
351 | ||
352 | return NULL; | |
353 | } | |
354 | ||
355 | return string; | |
356 | } | |
357 | ||
a1a00053 MT |
358 | LOC_EXPORT const struct in6_addr* loc_network_get_first_address(struct loc_network* network) { |
359 | return &network->first_address; | |
360 | } | |
361 | ||
2b9338ea MT |
362 | LOC_EXPORT char* loc_network_format_first_address(struct loc_network* network) { |
363 | return loc_network_format_address(network, &network->first_address); | |
364 | } | |
365 | ||
a1a00053 MT |
366 | LOC_EXPORT const struct in6_addr* loc_network_get_last_address(struct loc_network* network) { |
367 | return &network->last_address; | |
368 | } | |
369 | ||
2b9338ea MT |
370 | LOC_EXPORT char* loc_network_format_last_address(struct loc_network* network) { |
371 | return loc_network_format_address(network, &network->last_address); | |
372 | } | |
373 | ||
2a30e4de | 374 | LOC_EXPORT int loc_network_match_address(struct loc_network* network, const struct in6_addr* address) { |
f50adb09 | 375 | // Address must be larger than the start address |
ce4f5752 | 376 | if (in6_addr_cmp(&network->first_address, address) > 0) |
fc692a58 | 377 | return 0; |
2a30e4de | 378 | |
2a30e4de | 379 | // Address must be smaller than the last address |
b43edb61 | 380 | if (in6_addr_cmp(&network->last_address, address) < 0) |
fc692a58 | 381 | return 0; |
2a30e4de MT |
382 | |
383 | // The address is inside this network | |
fc692a58 | 384 | return 1; |
2a30e4de MT |
385 | } |
386 | ||
3b5f4af2 MT |
387 | LOC_EXPORT const char* loc_network_get_country_code(struct loc_network* network) { |
388 | return network->country_code; | |
389 | } | |
390 | ||
391 | LOC_EXPORT int loc_network_set_country_code(struct loc_network* network, const char* country_code) { | |
901ef882 MT |
392 | // Set empty country code |
393 | if (!country_code || !*country_code) { | |
394 | *network->country_code = '\0'; | |
395 | return 0; | |
396 | } | |
397 | ||
57146963 MT |
398 | // Check country code |
399 | if (!loc_country_code_is_valid(country_code)) | |
3b5f4af2 MT |
400 | return -EINVAL; |
401 | ||
a7a3d958 | 402 | loc_country_code_copy(network->country_code, country_code); |
3b5f4af2 MT |
403 | |
404 | return 0; | |
405 | } | |
406 | ||
e3f696c1 | 407 | LOC_EXPORT int loc_network_match_country_code(struct loc_network* network, const char* country_code) { |
57146963 MT |
408 | // Check country code |
409 | if (!loc_country_code_is_valid(country_code)) | |
e3f696c1 MT |
410 | return -EINVAL; |
411 | ||
412 | return (network->country_code[0] == country_code[0]) | |
413 | && (network->country_code[1] == country_code[1]); | |
414 | } | |
415 | ||
71ff3e69 MT |
416 | LOC_EXPORT uint32_t loc_network_get_asn(struct loc_network* network) { |
417 | return network->asn; | |
418 | } | |
419 | ||
420 | LOC_EXPORT int loc_network_set_asn(struct loc_network* network, uint32_t asn) { | |
421 | network->asn = asn; | |
422 | ||
423 | return 0; | |
424 | } | |
425 | ||
82910b95 MT |
426 | LOC_EXPORT int loc_network_match_asn(struct loc_network* network, uint32_t asn) { |
427 | return network->asn == asn; | |
428 | } | |
429 | ||
a99e7c2b MT |
430 | LOC_EXPORT int loc_network_has_flag(struct loc_network* network, uint32_t flag) { |
431 | return network->flags & flag; | |
432 | } | |
433 | ||
434 | LOC_EXPORT int loc_network_set_flag(struct loc_network* network, uint32_t flag) { | |
435 | network->flags |= flag; | |
436 | ||
437 | return 0; | |
438 | } | |
439 | ||
440 | LOC_EXPORT int loc_network_match_flag(struct loc_network* network, uint32_t flag) { | |
441 | return loc_network_has_flag(network, flag); | |
442 | } | |
443 | ||
af4689bf | 444 | LOC_EXPORT int loc_network_cmp(struct loc_network* self, struct loc_network* other) { |
af4689bf MT |
445 | // Compare address |
446 | int r = in6_addr_cmp(&self->first_address, &other->first_address); | |
447 | if (r) | |
448 | return r; | |
449 | ||
450 | // Compare prefix | |
451 | if (self->prefix > other->prefix) | |
452 | return 1; | |
453 | else if (self->prefix < other->prefix) | |
454 | return -1; | |
455 | ||
456 | // Both networks are equal | |
457 | return 0; | |
458 | } | |
459 | ||
6159d384 | 460 | LOC_EXPORT int loc_network_overlaps(struct loc_network* self, struct loc_network* other) { |
fc692a58 MT |
461 | // Either of the start addresses must be in the other subnet |
462 | if (loc_network_match_address(self, &other->first_address)) | |
6159d384 MT |
463 | return 1; |
464 | ||
fc692a58 | 465 | if (loc_network_match_address(other, &self->first_address)) |
6159d384 MT |
466 | return 1; |
467 | ||
fc692a58 MT |
468 | // Or either of the end addresses is in the other subnet |
469 | if (loc_network_match_address(self, &other->last_address)) | |
6159d384 MT |
470 | return 1; |
471 | ||
fc692a58 | 472 | if (loc_network_match_address(other, &self->last_address)) |
6159d384 MT |
473 | return 1; |
474 | ||
475 | return 0; | |
476 | } | |
477 | ||
33a051e0 | 478 | LOC_EXPORT int loc_network_is_subnet(struct loc_network* self, struct loc_network* other) { |
cf8d3c64 MT |
479 | // The prefix must be smaller (this avoids the more complex comparisons later) |
480 | if (self->prefix > other->prefix) | |
481 | return 0; | |
482 | ||
33a051e0 MT |
483 | // If the start address of the other network is smaller than this network, |
484 | // it cannot be a subnet. | |
1209ff0c | 485 | if (in6_addr_cmp(&self->first_address, &other->first_address) > 0) |
33a051e0 MT |
486 | return 0; |
487 | ||
488 | // If the end address of the other network is greater than this network, | |
489 | // it cannot be a subnet. | |
1209ff0c | 490 | if (in6_addr_cmp(&self->last_address, &other->last_address) < 0) |
33a051e0 MT |
491 | return 0; |
492 | ||
493 | return 1; | |
494 | } | |
495 | ||
a5967330 MT |
496 | LOC_EXPORT int loc_network_subnets(struct loc_network* network, |
497 | struct loc_network** subnet1, struct loc_network** subnet2) { | |
498 | int r; | |
499 | *subnet1 = NULL; | |
500 | *subnet2 = NULL; | |
850e7516 MT |
501 | |
502 | // New prefix length | |
503 | unsigned int prefix = network->prefix + 1; | |
504 | ||
505 | // Check if the new prefix is valid | |
506 | if (valid_prefix(&network->first_address, prefix)) | |
a5967330 | 507 | return -1; |
850e7516 MT |
508 | |
509 | // Create the first half of the network | |
a5967330 | 510 | r = loc_network_new(network->ctx, subnet1, &network->first_address, prefix); |
850e7516 | 511 | if (r) |
a5967330 | 512 | return r; |
850e7516 MT |
513 | |
514 | // The next subnet starts after the first one | |
a5967330 | 515 | struct in6_addr first_address = address_increment(&(*subnet1)->last_address); |
850e7516 MT |
516 | |
517 | // Create the second half of the network | |
a5967330 | 518 | r = loc_network_new(network->ctx, subnet2, &first_address, prefix); |
850e7516 | 519 | if (r) |
a5967330 | 520 | return r; |
850e7516 | 521 | |
594ca328 MT |
522 | // Copy country code |
523 | const char* country_code = loc_network_get_country_code(network); | |
524 | if (country_code) { | |
a5967330 MT |
525 | loc_network_set_country_code(*subnet1, country_code); |
526 | loc_network_set_country_code(*subnet2, country_code); | |
594ca328 MT |
527 | } |
528 | ||
529 | // Copy ASN | |
530 | uint32_t asn = loc_network_get_asn(network); | |
531 | if (asn) { | |
a5967330 MT |
532 | loc_network_set_asn(*subnet1, asn); |
533 | loc_network_set_asn(*subnet2, asn); | |
594ca328 MT |
534 | } |
535 | ||
3e8d86ab MT |
536 | // Copy flags |
537 | loc_network_set_flag(*subnet1, network->flags); | |
538 | loc_network_set_flag(*subnet2, network->flags); | |
539 | ||
a5967330 MT |
540 | return 0; |
541 | } | |
850e7516 | 542 | |
a5967330 MT |
543 | static int __loc_network_exclude(struct loc_network* network, |
544 | struct loc_network* other, struct loc_network_list* list) { | |
545 | struct loc_network* subnet1 = NULL; | |
546 | struct loc_network* subnet2 = NULL; | |
547 | ||
548 | int r = loc_network_subnets(network, &subnet1, &subnet2); | |
549 | if (r) | |
550 | goto ERROR; | |
551 | ||
da101d55 | 552 | if (loc_network_cmp(other, subnet1) == 0) { |
a5967330 MT |
553 | r = loc_network_list_push(list, subnet2); |
554 | if (r) | |
555 | goto ERROR; | |
556 | ||
da101d55 | 557 | } else if (loc_network_cmp(other, subnet2) == 0) { |
a5967330 MT |
558 | r = loc_network_list_push(list, subnet1); |
559 | if (r) | |
560 | goto ERROR; | |
561 | ||
d6a5092f | 562 | } else if (loc_network_is_subnet(subnet1, other)) { |
a5967330 MT |
563 | r = loc_network_list_push(list, subnet2); |
564 | if (r) | |
565 | goto ERROR; | |
566 | ||
567 | r = __loc_network_exclude(subnet1, other, list); | |
568 | if (r) | |
569 | goto ERROR; | |
570 | ||
d6a5092f | 571 | } else if (loc_network_is_subnet(subnet2, other)) { |
a5967330 MT |
572 | r = loc_network_list_push(list, subnet1); |
573 | if (r) | |
574 | goto ERROR; | |
575 | ||
576 | r = __loc_network_exclude(subnet2, other, list); | |
577 | if (r) | |
578 | goto ERROR; | |
579 | ||
580 | } else { | |
581 | ERROR(network->ctx, "We should never get here\n"); | |
582 | r = 1; | |
583 | goto ERROR; | |
584 | } | |
850e7516 MT |
585 | |
586 | ERROR: | |
587 | if (subnet1) | |
588 | loc_network_unref(subnet1); | |
589 | ||
590 | if (subnet2) | |
591 | loc_network_unref(subnet2); | |
592 | ||
a5967330 | 593 | return r; |
850e7516 MT |
594 | } |
595 | ||
c650008e MT |
596 | static int __loc_network_exclude_to_list(struct loc_network* self, |
597 | struct loc_network* other, struct loc_network_list* list) { | |
850e7516 | 598 | // Other must be a subnet of self |
d6a5092f | 599 | if (!loc_network_is_subnet(self, other)) { |
850e7516 MT |
600 | DEBUG(self->ctx, "Network %p is not contained in network %p\n", other, self); |
601 | ||
abf55926 MT |
602 | // Exit silently |
603 | return 0; | |
850e7516 MT |
604 | } |
605 | ||
606 | // We cannot perform this operation if both networks equal | |
da101d55 | 607 | if (loc_network_cmp(self, other) == 0) { |
850e7516 MT |
608 | DEBUG(self->ctx, "Networks %p and %p are equal\n", self, other); |
609 | ||
abf55926 MT |
610 | // Exit silently |
611 | return 0; | |
850e7516 MT |
612 | } |
613 | ||
c650008e MT |
614 | return __loc_network_exclude(self, other, list); |
615 | } | |
616 | ||
617 | LOC_EXPORT struct loc_network_list* loc_network_exclude( | |
618 | struct loc_network* self, struct loc_network* other) { | |
619 | struct loc_network_list* list; | |
620 | ||
621 | #ifdef ENABLE_DEBUG | |
622 | char* n1 = loc_network_str(self); | |
623 | char* n2 = loc_network_str(other); | |
624 | ||
625 | DEBUG(self->ctx, "Returning %s excluding %s...\n", n1, n2); | |
626 | ||
627 | free(n1); | |
628 | free(n2); | |
629 | #endif | |
630 | ||
850e7516 MT |
631 | // Create a new list with the result |
632 | int r = loc_network_list_new(self->ctx, &list); | |
633 | if (r) { | |
634 | ERROR(self->ctx, "Could not create network list: %d\n", r); | |
c650008e | 635 | |
850e7516 MT |
636 | return NULL; |
637 | } | |
638 | ||
c650008e | 639 | r = __loc_network_exclude_to_list(self, other, list); |
a5967330 MT |
640 | if (r) { |
641 | loc_network_list_unref(list); | |
850e7516 | 642 | |
a5967330 | 643 | return NULL; |
850e7516 MT |
644 | } |
645 | ||
850e7516 MT |
646 | // Return the result |
647 | return list; | |
850e7516 MT |
648 | } |
649 | ||
add5bb65 MT |
650 | LOC_EXPORT struct loc_network_list* loc_network_exclude_list( |
651 | struct loc_network* network, struct loc_network_list* list) { | |
652 | struct loc_network_list* to_check; | |
653 | ||
654 | // Create a new list with all networks to look at | |
655 | int r = loc_network_list_new(network->ctx, &to_check); | |
656 | if (r) | |
657 | return NULL; | |
658 | ||
659 | struct loc_network* subnet = NULL; | |
660 | struct loc_network_list* subnets = NULL; | |
661 | ||
662 | for (unsigned int i = 0; i < loc_network_list_size(list); i++) { | |
663 | subnet = loc_network_list_get(list, i); | |
664 | ||
665 | // Find all excluded networks | |
c650008e MT |
666 | if (!loc_network_list_contains(to_check, subnet)) { |
667 | r = __loc_network_exclude_to_list(network, subnet, to_check); | |
668 | if (r) { | |
669 | loc_network_list_unref(to_check); | |
670 | loc_network_unref(subnet); | |
671 | ||
672 | return NULL; | |
673 | } | |
add5bb65 MT |
674 | } |
675 | ||
676 | // Cleanup | |
677 | loc_network_unref(subnet); | |
678 | } | |
679 | ||
680 | r = loc_network_list_new(network->ctx, &subnets); | |
681 | if (r) { | |
682 | loc_network_list_unref(to_check); | |
683 | return NULL; | |
684 | } | |
685 | ||
058e7800 MT |
686 | off_t smallest_subnet = 0; |
687 | ||
add5bb65 | 688 | while (!loc_network_list_empty(to_check)) { |
058e7800 | 689 | struct loc_network* subnet_to_check = loc_network_list_pop_first(to_check); |
add5bb65 | 690 | |
06177d8c MT |
691 | // Check whether the subnet to check is part of the input list |
692 | if (loc_network_list_contains(list, subnet_to_check)) { | |
693 | loc_network_unref(subnet_to_check); | |
694 | continue; | |
695 | } | |
696 | ||
add5bb65 MT |
697 | // Marks whether this subnet passed all checks |
698 | int passed = 1; | |
699 | ||
058e7800 | 700 | for (unsigned int i = smallest_subnet; i < loc_network_list_size(list); i++) { |
add5bb65 MT |
701 | subnet = loc_network_list_get(list, i); |
702 | ||
add5bb65 | 703 | // Drop this subnet if is a subnet of another subnet |
4de8ff8e | 704 | if (loc_network_is_subnet(subnet, subnet_to_check)) { |
add5bb65 MT |
705 | passed = 0; |
706 | loc_network_unref(subnet); | |
707 | break; | |
708 | } | |
709 | ||
710 | // Break it down if it overlaps | |
4de8ff8e | 711 | if (loc_network_overlaps(subnet, subnet_to_check)) { |
add5bb65 MT |
712 | passed = 0; |
713 | ||
4fc034e2 | 714 | __loc_network_exclude_to_list(subnet_to_check, subnet, to_check); |
add5bb65 MT |
715 | |
716 | loc_network_unref(subnet); | |
717 | break; | |
718 | } | |
719 | ||
058e7800 MT |
720 | // If the subnet is strictly greater, we do not need to continue the search |
721 | r = loc_network_cmp(subnet, subnet_to_check); | |
722 | if (r > 0) { | |
723 | loc_network_unref(subnet); | |
724 | break; | |
725 | ||
726 | // If it is strictly smaller, we can continue the search from here next | |
727 | // time because all networks that are to be checked can only be larger | |
728 | // than this one. | |
729 | } else if (r < 0) { | |
730 | smallest_subnet = i; | |
731 | } | |
732 | ||
add5bb65 MT |
733 | loc_network_unref(subnet); |
734 | } | |
735 | ||
736 | if (passed) { | |
737 | r = loc_network_list_push(subnets, subnet_to_check); | |
738 | } | |
739 | ||
740 | loc_network_unref(subnet_to_check); | |
741 | } | |
742 | ||
743 | loc_network_list_unref(to_check); | |
744 | ||
745 | return subnets; | |
746 | } | |
747 | ||
b904896a | 748 | LOC_EXPORT int loc_network_to_database_v1(struct loc_network* network, struct loc_database_network_v1* dbobj) { |
f3e02bc5 | 749 | // Add country code |
a7a3d958 | 750 | loc_country_code_copy(dbobj->country_code, network->country_code); |
f3e02bc5 MT |
751 | |
752 | // Add ASN | |
71ff3e69 | 753 | dbobj->asn = htobe32(network->asn); |
f3e02bc5 | 754 | |
a99e7c2b | 755 | // Flags |
eee6346d | 756 | dbobj->flags = htobe16(network->flags); |
a99e7c2b | 757 | |
f3e02bc5 MT |
758 | return 0; |
759 | } | |
760 | ||
b904896a MT |
761 | LOC_EXPORT int loc_network_new_from_database_v1(struct loc_ctx* ctx, struct loc_network** network, |
762 | struct in6_addr* address, unsigned int prefix, const struct loc_database_network_v1* dbobj) { | |
3dc8adfb | 763 | char country_code[3] = "\0\0"; |
a7a3d958 | 764 | |
39a55353 | 765 | int r = loc_network_new(ctx, network, address, prefix); |
94a3f329 MT |
766 | if (r) { |
767 | ERROR(ctx, "Could not allocate a new network: %s", strerror(-r)); | |
10778041 | 768 | return r; |
94a3f329 | 769 | } |
10778041 MT |
770 | |
771 | // Import country code | |
a7a3d958 | 772 | loc_country_code_copy(country_code, dbobj->country_code); |
10778041 MT |
773 | |
774 | r = loc_network_set_country_code(*network, country_code); | |
94a3f329 MT |
775 | if (r) { |
776 | ERROR(ctx, "Could not set country code: %s\n", country_code); | |
10778041 | 777 | return r; |
94a3f329 | 778 | } |
10778041 MT |
779 | |
780 | // Import ASN | |
94a3f329 MT |
781 | uint32_t asn = be32toh(dbobj->asn); |
782 | r = loc_network_set_asn(*network, asn); | |
783 | if (r) { | |
784 | ERROR(ctx, "Could not set ASN: %d\n", asn); | |
10778041 | 785 | return r; |
94a3f329 | 786 | } |
10778041 | 787 | |
a99e7c2b | 788 | // Import flags |
94a3f329 MT |
789 | int flags = be16toh(dbobj->flags); |
790 | r = loc_network_set_flag(*network, flags); | |
791 | if (r) { | |
792 | ERROR(ctx, "Could not set flags: %d\n", flags); | |
a99e7c2b | 793 | return r; |
94a3f329 | 794 | } |
a99e7c2b | 795 | |
10778041 MT |
796 | return 0; |
797 | } | |
798 | ||
3b5f4af2 MT |
799 | struct loc_network_tree { |
800 | struct loc_ctx* ctx; | |
801 | int refcount; | |
802 | ||
803 | struct loc_network_tree_node* root; | |
804 | }; | |
805 | ||
806 | struct loc_network_tree_node { | |
438db08c MT |
807 | struct loc_ctx* ctx; |
808 | int refcount; | |
809 | ||
3b5f4af2 MT |
810 | struct loc_network_tree_node* zero; |
811 | struct loc_network_tree_node* one; | |
812 | ||
813 | struct loc_network* network; | |
814 | }; | |
815 | ||
7933f5bf | 816 | int loc_network_tree_new(struct loc_ctx* ctx, struct loc_network_tree** tree) { |
3b5f4af2 MT |
817 | struct loc_network_tree* t = calloc(1, sizeof(*t)); |
818 | if (!t) | |
819 | return -ENOMEM; | |
820 | ||
821 | t->ctx = loc_ref(ctx); | |
822 | t->refcount = 1; | |
823 | ||
824 | // Create the root node | |
438db08c MT |
825 | int r = loc_network_tree_node_new(ctx, &t->root); |
826 | if (r) { | |
827 | loc_network_tree_unref(t); | |
828 | return r; | |
829 | } | |
3b5f4af2 MT |
830 | |
831 | DEBUG(t->ctx, "Network tree allocated at %p\n", t); | |
832 | *tree = t; | |
833 | return 0; | |
834 | } | |
835 | ||
7933f5bf | 836 | struct loc_network_tree_node* loc_network_tree_get_root(struct loc_network_tree* tree) { |
438db08c | 837 | return loc_network_tree_node_ref(tree->root); |
3b5f4af2 MT |
838 | } |
839 | ||
840 | static struct loc_network_tree_node* loc_network_tree_get_node(struct loc_network_tree_node* node, int path) { | |
841 | struct loc_network_tree_node** n; | |
842 | ||
2a30e4de | 843 | if (path == 0) |
3b5f4af2 | 844 | n = &node->zero; |
3eda9cab MT |
845 | else |
846 | n = &node->one; | |
3b5f4af2 MT |
847 | |
848 | // If the desired node doesn't exist, yet, we will create it | |
849 | if (*n == NULL) { | |
438db08c | 850 | int r = loc_network_tree_node_new(node->ctx, n); |
3b5f4af2 MT |
851 | if (r) |
852 | return NULL; | |
853 | } | |
854 | ||
855 | return *n; | |
856 | } | |
857 | ||
39a55353 | 858 | static struct loc_network_tree_node* loc_network_tree_get_path(struct loc_network_tree* tree, const struct in6_addr* address, unsigned int prefix) { |
3b5f4af2 MT |
859 | struct loc_network_tree_node* node = tree->root; |
860 | ||
39a55353 | 861 | for (unsigned int i = 0; i < prefix; i++) { |
3b5f4af2 | 862 | // Check if the ith bit is one or zero |
2a30e4de | 863 | node = loc_network_tree_get_node(node, in6_addr_get_bit(address, i)); |
3b5f4af2 MT |
864 | } |
865 | ||
866 | return node; | |
867 | } | |
868 | ||
869 | static int __loc_network_tree_walk(struct loc_ctx* ctx, struct loc_network_tree_node* node, | |
f3e02bc5 MT |
870 | int(*filter_callback)(struct loc_network* network, void* data), |
871 | int(*callback)(struct loc_network* network, void* data), void* data) { | |
3b5f4af2 MT |
872 | int r; |
873 | ||
874 | // Finding a network ends the walk here | |
875 | if (node->network) { | |
876 | if (filter_callback) { | |
f3e02bc5 | 877 | int f = filter_callback(node->network, data); |
3b5f4af2 MT |
878 | if (f < 0) |
879 | return f; | |
880 | ||
881 | // Skip network if filter function returns value greater than zero | |
882 | if (f > 0) | |
883 | return 0; | |
884 | } | |
885 | ||
f3e02bc5 | 886 | r = callback(node->network, data); |
3b5f4af2 MT |
887 | if (r) |
888 | return r; | |
889 | } | |
890 | ||
891 | // Walk down on the left side of the tree first | |
892 | if (node->zero) { | |
f3e02bc5 | 893 | r = __loc_network_tree_walk(ctx, node->zero, filter_callback, callback, data); |
3b5f4af2 MT |
894 | if (r) |
895 | return r; | |
896 | } | |
897 | ||
898 | // Then walk on the other side | |
899 | if (node->one) { | |
f3e02bc5 | 900 | r = __loc_network_tree_walk(ctx, node->one, filter_callback, callback, data); |
3b5f4af2 MT |
901 | if (r) |
902 | return r; | |
903 | } | |
904 | ||
905 | return 0; | |
906 | } | |
907 | ||
7933f5bf | 908 | int loc_network_tree_walk(struct loc_network_tree* tree, |
f3e02bc5 MT |
909 | int(*filter_callback)(struct loc_network* network, void* data), |
910 | int(*callback)(struct loc_network* network, void* data), void* data) { | |
911 | return __loc_network_tree_walk(tree->ctx, tree->root, filter_callback, callback, data); | |
912 | } | |
913 | ||
3b5f4af2 MT |
914 | static void loc_network_tree_free(struct loc_network_tree* tree) { |
915 | DEBUG(tree->ctx, "Releasing network tree at %p\n", tree); | |
916 | ||
438db08c | 917 | loc_network_tree_node_unref(tree->root); |
3b5f4af2 MT |
918 | |
919 | loc_unref(tree->ctx); | |
920 | free(tree); | |
921 | } | |
922 | ||
7933f5bf | 923 | struct loc_network_tree* loc_network_tree_unref(struct loc_network_tree* tree) { |
3b5f4af2 MT |
924 | if (--tree->refcount > 0) |
925 | return tree; | |
926 | ||
927 | loc_network_tree_free(tree); | |
928 | return NULL; | |
929 | } | |
930 | ||
e9b4e2a8 | 931 | static int __loc_network_tree_dump(struct loc_network* network, void* data) { |
3b5f4af2 MT |
932 | DEBUG(network->ctx, "Dumping network at %p\n", network); |
933 | ||
934 | char* s = loc_network_str(network); | |
935 | if (!s) | |
936 | return 1; | |
937 | ||
938 | INFO(network->ctx, "%s\n", s); | |
939 | free(s); | |
940 | ||
941 | return 0; | |
942 | } | |
943 | ||
7933f5bf | 944 | int loc_network_tree_dump(struct loc_network_tree* tree) { |
3b5f4af2 MT |
945 | DEBUG(tree->ctx, "Dumping network tree at %p\n", tree); |
946 | ||
f3e02bc5 | 947 | return loc_network_tree_walk(tree, NULL, __loc_network_tree_dump, NULL); |
3b5f4af2 MT |
948 | } |
949 | ||
7933f5bf | 950 | int loc_network_tree_add_network(struct loc_network_tree* tree, struct loc_network* network) { |
3b5f4af2 MT |
951 | DEBUG(tree->ctx, "Adding network %p to tree %p\n", network, tree); |
952 | ||
39a55353 | 953 | struct loc_network_tree_node* node = loc_network_tree_get_path(tree, |
ce4f5752 | 954 | &network->first_address, network->prefix); |
3b5f4af2 MT |
955 | if (!node) { |
956 | ERROR(tree->ctx, "Could not find a node\n"); | |
957 | return -ENOMEM; | |
958 | } | |
959 | ||
960 | // Check if node has not been set before | |
961 | if (node->network) { | |
962 | DEBUG(tree->ctx, "There is already a network at this path\n"); | |
c04005bb | 963 | return -EBUSY; |
3b5f4af2 MT |
964 | } |
965 | ||
966 | // Point node to the network | |
967 | node->network = loc_network_ref(network); | |
968 | ||
969 | return 0; | |
970 | } | |
f3e02bc5 MT |
971 | |
972 | static int __loc_network_tree_count(struct loc_network* network, void* data) { | |
973 | size_t* counter = (size_t*)data; | |
974 | ||
975 | // Increase the counter for each network | |
976 | counter++; | |
977 | ||
978 | return 0; | |
979 | } | |
980 | ||
7933f5bf | 981 | size_t loc_network_tree_count_networks(struct loc_network_tree* tree) { |
f3e02bc5 MT |
982 | size_t counter = 0; |
983 | ||
984 | int r = loc_network_tree_walk(tree, NULL, __loc_network_tree_count, &counter); | |
985 | if (r) | |
986 | return r; | |
987 | ||
988 | return counter; | |
989 | } | |
940f9c2b MT |
990 | |
991 | static size_t __loc_network_tree_count_nodes(struct loc_network_tree_node* node) { | |
992 | size_t counter = 1; | |
993 | ||
994 | if (node->zero) | |
995 | counter += __loc_network_tree_count_nodes(node->zero); | |
996 | ||
997 | if (node->one) | |
998 | counter += __loc_network_tree_count_nodes(node->one); | |
999 | ||
1000 | return counter; | |
1001 | } | |
1002 | ||
7933f5bf | 1003 | size_t loc_network_tree_count_nodes(struct loc_network_tree* tree) { |
940f9c2b MT |
1004 | return __loc_network_tree_count_nodes(tree->root); |
1005 | } | |
438db08c | 1006 | |
7933f5bf | 1007 | int loc_network_tree_node_new(struct loc_ctx* ctx, struct loc_network_tree_node** node) { |
438db08c MT |
1008 | struct loc_network_tree_node* n = calloc(1, sizeof(*n)); |
1009 | if (!n) | |
1010 | return -ENOMEM; | |
1011 | ||
1012 | n->ctx = loc_ref(ctx); | |
1013 | n->refcount = 1; | |
1014 | ||
1015 | n->zero = n->one = NULL; | |
1016 | ||
1017 | DEBUG(n->ctx, "Network node allocated at %p\n", n); | |
1018 | *node = n; | |
1019 | return 0; | |
1020 | } | |
1021 | ||
7933f5bf | 1022 | struct loc_network_tree_node* loc_network_tree_node_ref(struct loc_network_tree_node* node) { |
438db08c MT |
1023 | if (node) |
1024 | node->refcount++; | |
1025 | ||
1026 | return node; | |
1027 | } | |
1028 | ||
1029 | static void loc_network_tree_node_free(struct loc_network_tree_node* node) { | |
1030 | DEBUG(node->ctx, "Releasing network node at %p\n", node); | |
1031 | ||
1032 | if (node->network) | |
1033 | loc_network_unref(node->network); | |
1034 | ||
1035 | if (node->zero) | |
1036 | loc_network_tree_node_unref(node->zero); | |
1037 | ||
1038 | if (node->one) | |
1039 | loc_network_tree_node_unref(node->one); | |
1040 | ||
1041 | loc_unref(node->ctx); | |
1042 | free(node); | |
1043 | } | |
1044 | ||
7933f5bf | 1045 | struct loc_network_tree_node* loc_network_tree_node_unref(struct loc_network_tree_node* node) { |
438db08c MT |
1046 | if (!node) |
1047 | return NULL; | |
1048 | ||
1049 | if (--node->refcount > 0) | |
1050 | return node; | |
1051 | ||
1052 | loc_network_tree_node_free(node); | |
1053 | return NULL; | |
1054 | } | |
1055 | ||
7933f5bf | 1056 | struct loc_network_tree_node* loc_network_tree_node_get(struct loc_network_tree_node* node, unsigned int index) { |
438db08c MT |
1057 | if (index == 0) |
1058 | node = node->zero; | |
1059 | else | |
1060 | node = node->one; | |
1061 | ||
1062 | if (!node) | |
1063 | return NULL; | |
1064 | ||
1065 | return loc_network_tree_node_ref(node); | |
1066 | } | |
1067 | ||
7933f5bf | 1068 | int loc_network_tree_node_is_leaf(struct loc_network_tree_node* node) { |
438db08c MT |
1069 | return (!!node->network); |
1070 | } | |
1071 | ||
7933f5bf | 1072 | struct loc_network* loc_network_tree_node_get_network(struct loc_network_tree_node* node) { |
438db08c MT |
1073 | return loc_network_ref(node->network); |
1074 | } |