2 libloc - A library to determine the location of someone on the Internet
4 Copyright (C) 2017 IPFire Development Team <info@ipfire.org>
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.
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.
17 #include <arpa/inet.h>
20 #include <netinet/in.h>
27 #include <sys/types.h>
35 #include <openssl/err.h>
36 #include <openssl/evp.h>
37 #include <openssl/pem.h>
39 #include <libloc/libloc.h>
40 #include <libloc/address.h>
41 #include <libloc/as.h>
42 #include <libloc/as-list.h>
43 #include <libloc/compat.h>
44 #include <libloc/country.h>
45 #include <libloc/country-list.h>
46 #include <libloc/database.h>
47 #include <libloc/format.h>
48 #include <libloc/network.h>
49 #include <libloc/network-list.h>
50 #include <libloc/private.h>
51 #include <libloc/stringpool.h>
53 struct loc_database_objects
{
59 struct loc_database_signature
{
70 enum loc_database_version version
;
77 struct loc_database_signature signature1
;
78 struct loc_database_signature signature2
;
80 // Data mapped into memory
84 struct loc_stringpool
* pool
;
86 // ASes in the database
87 struct loc_database_objects as_objects
;
90 struct loc_database_objects network_node_objects
;
93 struct loc_database_objects network_objects
;
96 struct loc_database_objects country_objects
;
99 #define MAX_STACK_DEPTH 256
101 struct loc_node_stack
{
103 int i
; // Is this node 0 or 1?
107 struct loc_database_enumerator
{
109 struct loc_database
* db
;
110 enum loc_database_enumerator_mode mode
;
115 struct loc_country_list
* countries
;
116 struct loc_as_list
* asns
;
117 enum loc_network_flags flags
;
123 // Index of the AS we are looking at
124 unsigned int as_index
;
126 // Index of the country we are looking at
127 unsigned int country_index
;
130 struct in6_addr network_address
;
131 struct loc_node_stack network_stack
[MAX_STACK_DEPTH
];
132 int network_stack_depth
;
133 unsigned int* networks_visited
;
135 // For subnet search and bogons
136 struct loc_network_list
* stack
;
137 struct loc_network_list
* subnets
;
140 struct in6_addr gap6_start
;
141 struct in6_addr gap4_start
;
145 Checks if it is safe to read the buffer of size length starting at p.
147 #define loc_database_check_boundaries(db, p) \
148 __loc_database_check_boundaries(db, (const char*)p, sizeof(*p))
150 static inline int __loc_database_check_boundaries(struct loc_database
* db
,
151 const char* p
, const size_t length
) {
152 size_t offset
= p
- db
->data
;
154 // Return if everything is within the boundary
155 if (offset
<= db
->length
- length
)
158 DEBUG(db
->ctx
, "Database read check failed at %p for %zu byte(s)\n", p
, length
);
159 DEBUG(db
->ctx
, " p = %p (offset = %jd, length = %zu)\n", p
, offset
, length
);
160 DEBUG(db
->ctx
, " data = %p (length = %zu)\n", db
->data
, db
->length
);
161 DEBUG(db
->ctx
, " end = %p\n", db
->data
+ db
->length
);
162 DEBUG(db
->ctx
, " overflow of %zu byte(s)\n", offset
+ length
- db
->length
);
164 // Otherwise raise EFAULT
170 Returns a pointer to the n-th object
172 static inline char* loc_database_object(struct loc_database
* db
,
173 const struct loc_database_objects
* objects
, const size_t length
, const off_t n
) {
175 const off_t offset
= n
* length
;
177 // Return a pointer to where the object lies
178 char* object
= objects
->data
+ offset
;
180 // Check if the object is part of the memory
181 if (!__loc_database_check_boundaries(db
, object
, length
))
187 static int loc_database_version_supported(struct loc_database
* db
, uint8_t version
) {
189 // Supported versions
190 case LOC_DATABASE_VERSION_1
:
194 ERROR(db
->ctx
, "Database version %d is not supported\n", version
);
200 static int loc_database_check_magic(struct loc_database
* db
) {
201 struct loc_database_magic magic
;
204 size_t bytes_read
= fread(&magic
, 1, sizeof(magic
), db
->f
);
206 // Check if we have been able to read enough data
207 if (bytes_read
< sizeof(magic
)) {
208 ERROR(db
->ctx
, "Could not read enough data to validate magic bytes\n");
209 DEBUG(db
->ctx
, "Read %zu bytes, but needed %zu\n", bytes_read
, sizeof(magic
));
213 // Compare magic bytes
214 if (memcmp(magic
.magic
, LOC_DATABASE_MAGIC
, sizeof(magic
.magic
)) == 0) {
215 DEBUG(db
->ctx
, "Magic value matches\n");
217 // Do we support this version?
218 if (!loc_database_version_supported(db
, magic
.version
))
222 db
->version
= magic
.version
;
228 ERROR(db
->ctx
, "Unrecognized file type\n");
236 Maps the entire database into memory
238 static int loc_database_mmap(struct loc_database
* db
) {
241 // Get file descriptor
242 int fd
= fileno(db
->f
);
244 // Determine the length of the database
245 db
->length
= lseek(fd
, 0, SEEK_END
);
246 if (db
->length
< 0) {
247 ERROR(db
->ctx
, "Could not determine the length of the database: %m\n");
254 db
->data
= mmap(NULL
, db
->length
, PROT_READ
, MAP_SHARED
, fd
, 0);
255 if (db
->data
== MAP_FAILED
) {
256 ERROR(db
->ctx
, "Could not map the database: %m\n");
261 DEBUG(db
->ctx
, "Mapped database of %zu byte(s) at %p\n", db
->length
, db
->data
);
263 // Tell the system that we expect to read data randomly
264 r
= madvise(db
->data
, db
->length
, MADV_RANDOM
);
266 ERROR(db
->ctx
, "madvise() failed: %m\n");
274 Maps arbitrary objects from the database into memory.
276 static int loc_database_map_objects(struct loc_database
* db
, struct loc_database_objects
* objects
,
277 const size_t size
, const off_t offset
, const size_t length
) {
279 objects
->data
= db
->data
+ offset
;
280 objects
->length
= length
;
281 objects
->count
= objects
->length
/ size
;
286 static int loc_database_read_signature(struct loc_database
* db
,
287 struct loc_database_signature
* signature
, const char* data
, const size_t length
) {
288 // Check for a plausible signature length
289 if (length
> LOC_SIGNATURE_MAX_LENGTH
) {
290 ERROR(db
->ctx
, "Signature too long: %zu\n", length
);
295 // Store data & length
296 signature
->data
= data
;
297 signature
->length
= length
;
299 DEBUG(db
->ctx
, "Read signature of %zu byte(s) at %p\n",
300 signature
->length
, signature
->data
);
302 hexdump(db
->ctx
, signature
->data
, signature
->length
);
307 static int loc_database_read_header_v1(struct loc_database
* db
) {
308 const struct loc_database_header_v1
* header
=
309 (const struct loc_database_header_v1
*)(db
->data
+ LOC_DATABASE_MAGIC_SIZE
);
312 DEBUG(db
->ctx
, "Reading header at %p\n", header
);
314 // Check if we can read the header
315 if (!loc_database_check_boundaries(db
, header
)) {
316 ERROR(db
->ctx
, "Could not read enough data for header\n");
320 // Dump the entire header
321 hexdump(db
->ctx
, header
, sizeof(*header
));
324 db
->created_at
= be64toh(header
->created_at
);
325 db
->vendor
= be32toh(header
->vendor
);
326 db
->description
= be32toh(header
->description
);
327 db
->license
= be32toh(header
->license
);
330 r
= loc_database_read_signature(db
, &db
->signature1
,
331 header
->signature1
, be16toh(header
->signature1_length
));
335 r
= loc_database_read_signature(db
, &db
->signature2
,
336 header
->signature2
, be16toh(header
->signature2_length
));
340 const char* stringpool_start
= db
->data
+ be32toh(header
->pool_offset
);
341 size_t stringpool_length
= be32toh(header
->pool_length
);
343 // Check if the stringpool is part of the mapped area
344 if (!__loc_database_check_boundaries(db
, stringpool_start
, stringpool_length
))
347 // Open the stringpool
348 r
= loc_stringpool_open(db
->ctx
, &db
->pool
, stringpool_start
, stringpool_length
);
353 r
= loc_database_map_objects(db
, &db
->as_objects
,
354 sizeof(struct loc_database_as_v1
),
355 be32toh(header
->as_offset
),
356 be32toh(header
->as_length
));
361 r
= loc_database_map_objects(db
, &db
->network_node_objects
,
362 sizeof(struct loc_database_network_node_v1
),
363 be32toh(header
->network_tree_offset
),
364 be32toh(header
->network_tree_length
));
369 r
= loc_database_map_objects(db
, &db
->network_objects
,
370 sizeof(struct loc_database_network_v1
),
371 be32toh(header
->network_data_offset
),
372 be32toh(header
->network_data_length
));
377 r
= loc_database_map_objects(db
, &db
->country_objects
,
378 sizeof(struct loc_database_country_v1
),
379 be32toh(header
->countries_offset
),
380 be32toh(header
->countries_length
));
387 static int loc_database_read_header(struct loc_database
* db
) {
388 DEBUG(db
->ctx
, "Database version is %u\n", db
->version
);
390 switch (db
->version
) {
391 case LOC_DATABASE_VERSION_1
:
392 return loc_database_read_header_v1(db
);
395 ERROR(db
->ctx
, "Incompatible database version: %u\n", db
->version
);
400 static int loc_database_clone_handle(struct loc_database
* db
, FILE* f
) {
401 // Fetch the FD of the original handle
404 // Clone file descriptor
407 ERROR(db
->ctx
, "Could not duplicate file descriptor\n");
411 // Reopen the file so that we can keep our own file handle
412 db
->f
= fdopen(fd
, "r");
414 ERROR(db
->ctx
, "Could not re-open database file\n");
418 // Rewind to the start of the file
424 static int loc_database_open(struct loc_database
* db
, FILE* f
) {
427 clock_t start
= clock();
429 // Clone the file handle
430 r
= loc_database_clone_handle(db
, f
);
435 r
= loc_database_check_magic(db
);
439 // Map the database into memory
440 r
= loc_database_mmap(db
);
445 r
= loc_database_read_header(db
);
449 clock_t end
= clock();
451 INFO(db
->ctx
, "Opened database in %.4fms\n",
452 (double)(end
- start
) / CLOCKS_PER_SEC
* 1000);
457 static void loc_database_free(struct loc_database
* db
) {
460 DEBUG(db
->ctx
, "Releasing database %p\n", db
);
462 // Unmap the entire database
464 r
= munmap(db
->data
, db
->length
);
466 ERROR(db
->ctx
, "Could not unmap the database: %m\n");
469 // Free the stringpool
471 loc_stringpool_unref(db
->pool
);
473 // Close database file
481 LOC_EXPORT
int loc_database_new(struct loc_ctx
* ctx
, struct loc_database
** database
, FILE* f
) {
482 struct loc_database
* db
= NULL
;
485 // Fail on invalid file handle
491 // Allocate the database object
492 db
= calloc(1, sizeof(*db
));
497 db
->ctx
= loc_ref(ctx
);
500 DEBUG(db
->ctx
, "Database object allocated at %p\n", db
);
502 // Try to open the database
503 r
= loc_database_open(db
, f
);
512 loc_database_free(db
);
517 LOC_EXPORT
struct loc_database
* loc_database_ref(struct loc_database
* db
) {
523 LOC_EXPORT
struct loc_database
* loc_database_unref(struct loc_database
* db
) {
524 if (--db
->refcount
> 0)
527 loc_database_free(db
);
531 LOC_EXPORT
int loc_database_verify(struct loc_database
* db
, FILE* f
) {
532 size_t bytes_read
= 0;
534 // Cannot do this when no signature is available
535 if (!db
->signature1
.data
&& !db
->signature2
.data
) {
536 DEBUG(db
->ctx
, "No signature available to verify\n");
540 // Start the stopwatch
541 clock_t start
= clock();
544 EVP_PKEY
* pkey
= PEM_read_PUBKEY(f
, NULL
, NULL
, NULL
);
546 ERROR(db
->ctx
, "Could not parse public key: %s\n",
547 ERR_error_string(ERR_get_error(), NULL
));
554 EVP_MD_CTX
* mdctx
= EVP_MD_CTX_new();
556 // Initialise hash function
557 r
= EVP_DigestVerifyInit(mdctx
, NULL
, NULL
, NULL
, pkey
);
559 ERROR(db
->ctx
, "Error initializing signature validation: %s\n",
560 ERR_error_string(ERR_get_error(), NULL
));
566 // Reset file to start
570 struct loc_database_magic magic
;
571 bytes_read
= fread(&magic
, 1, sizeof(magic
), db
->f
);
572 if (bytes_read
< sizeof(magic
)) {
573 ERROR(db
->ctx
, "Could not read header: %m\n");
578 hexdump(db
->ctx
, &magic
, sizeof(magic
));
580 // Feed magic into the hash
581 r
= EVP_DigestVerifyUpdate(mdctx
, &magic
, sizeof(magic
));
583 ERROR(db
->ctx
, "%s\n", ERR_error_string(ERR_get_error(), NULL
));
590 struct loc_database_header_v1 header_v1
;
592 switch (db
->version
) {
593 case LOC_DATABASE_VERSION_1
:
594 bytes_read
= fread(&header_v1
, 1, sizeof(header_v1
), db
->f
);
595 if (bytes_read
< sizeof(header_v1
)) {
596 ERROR(db
->ctx
, "Could not read header\n");
603 memset(header_v1
.signature1
, '\0', sizeof(header_v1
.signature1
));
604 header_v1
.signature1_length
= 0;
605 memset(header_v1
.signature2
, '\0', sizeof(header_v1
.signature2
));
606 header_v1
.signature2_length
= 0;
608 hexdump(db
->ctx
, &header_v1
, sizeof(header_v1
));
610 // Feed header into the hash
611 r
= EVP_DigestVerifyUpdate(mdctx
, &header_v1
, sizeof(header_v1
));
613 ERROR(db
->ctx
, "%s\n", ERR_error_string(ERR_get_error(), NULL
));
621 ERROR(db
->ctx
, "Cannot compute hash for database with format %d\n",
627 // Walk through the file in chunks of 64kB
628 char buffer
[64 * 1024];
630 while (!feof(db
->f
)) {
631 bytes_read
= fread(buffer
, 1, sizeof(buffer
), db
->f
);
633 hexdump(db
->ctx
, buffer
, bytes_read
);
635 r
= EVP_DigestVerifyUpdate(mdctx
, buffer
, bytes_read
);
637 ERROR(db
->ctx
, "%s\n", ERR_error_string(ERR_get_error(), NULL
));
644 // Check first signature
645 if (db
->signature1
.data
) {
646 hexdump(db
->ctx
, db
->signature1
.data
, db
->signature1
.length
);
648 r
= EVP_DigestVerifyFinal(mdctx
,
649 (unsigned char*)db
->signature1
.data
, db
->signature1
.length
);
652 DEBUG(db
->ctx
, "The first signature is invalid\n");
655 DEBUG(db
->ctx
, "The first signature is valid\n");
658 ERROR(db
->ctx
, "Error verifying the first signature: %s\n",
659 ERR_error_string(ERR_get_error(), NULL
));
664 // Check second signature only when the first one was invalid
665 if (r
&& db
->signature2
.data
) {
666 hexdump(db
->ctx
, db
->signature2
.data
, db
->signature2
.length
);
668 r
= EVP_DigestVerifyFinal(mdctx
,
669 (unsigned char*)db
->signature2
.data
, db
->signature2
.length
);
672 DEBUG(db
->ctx
, "The second signature is invalid\n");
675 DEBUG(db
->ctx
, "The second signature is valid\n");
678 ERROR(db
->ctx
, "Error verifying the second signature: %s\n",
679 ERR_error_string(ERR_get_error(), NULL
));
684 clock_t end
= clock();
685 INFO(db
->ctx
, "Signature checked in %.4fms\n",
686 (double)(end
- start
) / CLOCKS_PER_SEC
* 1000);
690 EVP_MD_CTX_free(mdctx
);
696 LOC_EXPORT
time_t loc_database_created_at(struct loc_database
* db
) {
697 return db
->created_at
;
700 LOC_EXPORT
const char* loc_database_get_vendor(struct loc_database
* db
) {
701 return loc_stringpool_get(db
->pool
, db
->vendor
);
704 LOC_EXPORT
const char* loc_database_get_description(struct loc_database
* db
) {
705 return loc_stringpool_get(db
->pool
, db
->description
);
708 LOC_EXPORT
const char* loc_database_get_license(struct loc_database
* db
) {
709 return loc_stringpool_get(db
->pool
, db
->license
);
712 LOC_EXPORT
size_t loc_database_count_as(struct loc_database
* db
) {
713 return db
->as_objects
.count
;
716 // Returns the AS at position pos
717 static int loc_database_fetch_as(struct loc_database
* db
, struct loc_as
** as
, off_t pos
) {
718 struct loc_database_as_v1
* as_v1
= NULL
;
721 if ((size_t)pos
>= db
->as_objects
.count
) {
726 DEBUG(db
->ctx
, "Fetching AS at position %jd\n", (intmax_t)pos
);
728 switch (db
->version
) {
729 case LOC_DATABASE_VERSION_1
:
731 as_v1
= (struct loc_database_as_v1
*)loc_database_object(db
,
732 &db
->as_objects
, sizeof(*as_v1
), pos
);
736 r
= loc_as_new_from_database_v1(db
->ctx
, db
->pool
, as
, as_v1
);
745 DEBUG(db
->ctx
, "Got AS%u\n", loc_as_get_number(*as
));
750 // Performs a binary search to find the AS in the list
751 LOC_EXPORT
int loc_database_get_as(struct loc_database
* db
, struct loc_as
** as
, uint32_t number
) {
753 off_t hi
= db
->as_objects
.count
- 1;
757 clock_t start
= clock();
761 off_t i
= (lo
+ hi
) / 2;
763 // Fetch AS in the middle between lo and hi
764 int r
= loc_database_fetch_as(db
, as
, i
);
768 // Check if this is a match
769 uint32_t as_number
= loc_as_get_number(*as
);
770 if (as_number
== number
) {
772 clock_t end
= clock();
774 // Log how fast this has been
775 DEBUG(db
->ctx
, "Found AS%u in %.4fms\n", as_number
,
776 (double)(end
- start
) / CLOCKS_PER_SEC
* 1000);
782 // If it wasn't, we release the AS and
783 // adjust our search pointers
786 if (as_number
< number
) {
798 // Returns the network at position pos
799 static int loc_database_fetch_network(struct loc_database
* db
, struct loc_network
** network
,
800 struct in6_addr
* address
, unsigned int prefix
, off_t pos
) {
801 struct loc_database_network_v1
* network_v1
= NULL
;
804 if ((size_t)pos
>= db
->network_objects
.count
) {
805 DEBUG(db
->ctx
, "Network ID out of range: %jd/%jd\n",
806 (intmax_t)pos
, (intmax_t)db
->network_objects
.count
);
811 DEBUG(db
->ctx
, "Fetching network at position %jd\n", (intmax_t)pos
);
813 switch (db
->version
) {
814 case LOC_DATABASE_VERSION_1
:
816 network_v1
= (struct loc_database_network_v1
*)loc_database_object(db
,
817 &db
->network_objects
, sizeof(*network_v1
), pos
);
821 r
= loc_network_new_from_database_v1(db
->ctx
, network
, address
, prefix
, network_v1
);
830 DEBUG(db
->ctx
, "Got network %s\n", loc_network_str(*network
));
835 static int __loc_database_node_is_leaf(const struct loc_database_network_node_v1
* node
) {
836 return (node
->network
!= htobe32(0xffffffff));
839 static int __loc_database_lookup_handle_leaf(struct loc_database
* db
, const struct in6_addr
* address
,
840 struct loc_network
** network
, struct in6_addr
* network_address
, unsigned int prefix
,
841 const struct loc_database_network_node_v1
* node
) {
842 off_t network_index
= be32toh(node
->network
);
844 DEBUG(db
->ctx
, "Handling leaf node at %jd\n", (intmax_t)network_index
);
847 int r
= loc_database_fetch_network(db
, network
, network_address
, prefix
, network_index
);
849 ERROR(db
->ctx
, "Could not fetch network %jd from database: %m\n",
850 (intmax_t)network_index
);
854 // Check if the given IP address is inside the network
855 if (!loc_network_matches_address(*network
, address
)) {
856 DEBUG(db
->ctx
, "Searched address is not part of the network\n");
858 loc_network_unref(*network
);
863 // A network was found and the IP address matches
867 // Searches for an exact match along the path
868 static int __loc_database_lookup(struct loc_database
* db
, const struct in6_addr
* address
,
869 struct loc_network
** network
, struct in6_addr
* network_address
,
870 off_t node_index
, unsigned int level
) {
871 struct loc_database_network_node_v1
* node_v1
= NULL
;
875 // Fetch the next node
876 node_v1
= (struct loc_database_network_node_v1
*)loc_database_object(db
,
877 &db
->network_node_objects
, sizeof(*node_v1
), node_index
);
882 int bit
= loc_address_get_bit(address
, level
);
883 loc_address_set_bit(network_address
, level
, bit
);
886 node_index
= be32toh(node_v1
->zero
);
888 node_index
= be32toh(node_v1
->one
);
890 // If the node index is zero, the tree ends here
891 // and we cannot descend any further
892 if (node_index
> 0) {
894 if ((size_t)node_index
>= db
->network_node_objects
.count
) {
899 // Move on to the next node
900 r
= __loc_database_lookup(db
, address
, network
, network_address
, node_index
, level
+ 1);
902 // End here if a result was found
910 DEBUG(db
->ctx
, "No match found below level %u\n", level
);
912 DEBUG(db
->ctx
, "Tree ended at level %u\n", level
);
915 // If this node has a leaf, we will check if it matches
916 if (__loc_database_node_is_leaf(node_v1
)) {
917 r
= __loc_database_lookup_handle_leaf(db
, address
, network
, network_address
, level
, node_v1
);
925 LOC_EXPORT
int loc_database_lookup(struct loc_database
* db
,
926 const struct in6_addr
* address
, struct loc_network
** network
) {
927 struct in6_addr network_address
;
928 memset(&network_address
, 0, sizeof(network_address
));
934 clock_t start
= clock();
937 int r
= __loc_database_lookup(db
, address
, network
, &network_address
, 0, 0);
940 clock_t end
= clock();
942 // Log how fast this has been
943 DEBUG(db
->ctx
, "Executed network search in %.4fms\n",
944 (double)(end
- start
) / CLOCKS_PER_SEC
* 1000);
950 LOC_EXPORT
int loc_database_lookup_from_string(struct loc_database
* db
,
951 const char* string
, struct loc_network
** network
) {
952 struct in6_addr address
;
954 int r
= loc_address_parse(&address
, NULL
, string
);
958 return loc_database_lookup(db
, &address
, network
);
961 // Returns the country at position pos
962 static int loc_database_fetch_country(struct loc_database
* db
,
963 struct loc_country
** country
, off_t pos
) {
964 struct loc_database_country_v1
* country_v1
= NULL
;
967 // Check if the country is within range
968 if ((size_t)pos
>= db
->country_objects
.count
) {
973 DEBUG(db
->ctx
, "Fetching country at position %jd\n", (intmax_t)pos
);
975 switch (db
->version
) {
976 case LOC_DATABASE_VERSION_1
:
978 country_v1
= (struct loc_database_country_v1
*)loc_database_object(db
,
979 &db
->country_objects
, sizeof(*country_v1
), pos
);
983 r
= loc_country_new_from_database_v1(db
->ctx
, db
->pool
, country
, country_v1
);
992 DEBUG(db
->ctx
, "Got country %s\n", loc_country_get_code(*country
));
997 // Performs a binary search to find the country in the list
998 LOC_EXPORT
int loc_database_get_country(struct loc_database
* db
,
999 struct loc_country
** country
, const char* code
) {
1001 off_t hi
= db
->country_objects
.count
- 1;
1003 // Check if the country code is valid
1004 if (!loc_country_code_is_valid(code
)) {
1011 clock_t start
= clock();
1015 off_t i
= (lo
+ hi
) / 2;
1017 // Fetch country in the middle between lo and hi
1018 int r
= loc_database_fetch_country(db
, country
, i
);
1022 // Check if this is a match
1023 const char* cc
= loc_country_get_code(*country
);
1024 int result
= strcmp(code
, cc
);
1028 clock_t end
= clock();
1030 // Log how fast this has been
1031 DEBUG(db
->ctx
, "Found country %s in %.4fms\n", cc
,
1032 (double)(end
- start
) / CLOCKS_PER_SEC
* 1000);
1038 // If it wasn't, we release the country and
1039 // adjust our search pointers
1040 loc_country_unref(*country
);
1056 static void loc_database_enumerator_free(struct loc_database_enumerator
* enumerator
) {
1057 DEBUG(enumerator
->ctx
, "Releasing database enumerator %p\n", enumerator
);
1059 // Release all references
1060 loc_database_unref(enumerator
->db
);
1061 loc_unref(enumerator
->ctx
);
1063 if (enumerator
->string
)
1064 free(enumerator
->string
);
1066 if (enumerator
->countries
)
1067 loc_country_list_unref(enumerator
->countries
);
1069 if (enumerator
->asns
)
1070 loc_as_list_unref(enumerator
->asns
);
1072 // Free network search
1073 if (enumerator
->networks_visited
)
1074 free(enumerator
->networks_visited
);
1076 // Free subnet/bogons stack
1077 if (enumerator
->stack
)
1078 loc_network_list_unref(enumerator
->stack
);
1080 if (enumerator
->subnets
)
1081 loc_network_list_unref(enumerator
->subnets
);
1086 LOC_EXPORT
int loc_database_enumerator_new(struct loc_database_enumerator
** enumerator
,
1087 struct loc_database
* db
, enum loc_database_enumerator_mode mode
, int flags
) {
1090 struct loc_database_enumerator
* e
= calloc(1, sizeof(*e
));
1095 // Reference context
1096 e
->ctx
= loc_ref(db
->ctx
);
1097 e
->db
= loc_database_ref(db
);
1102 e
->flatten
= (flags
& LOC_DB_ENUMERATOR_FLAGS_FLATTEN
);
1104 // Initialise graph search
1105 e
->network_stack_depth
= 1;
1106 e
->networks_visited
= calloc(db
->network_node_objects
.count
, sizeof(*e
->networks_visited
));
1107 if (!e
->networks_visited
) {
1108 ERROR(db
->ctx
, "Could not allocated visited networks: %m\n");
1114 r
= loc_network_list_new(e
->ctx
, &e
->stack
);
1118 // Initialize bogon search
1119 loc_address_reset(&e
->gap6_start
, AF_INET6
);
1120 loc_address_reset(&e
->gap4_start
, AF_INET
);
1122 DEBUG(e
->ctx
, "Database enumerator object allocated at %p\n", e
);
1129 loc_database_enumerator_free(e
);
1134 LOC_EXPORT
struct loc_database_enumerator
* loc_database_enumerator_ref(struct loc_database_enumerator
* enumerator
) {
1135 enumerator
->refcount
++;
1140 LOC_EXPORT
struct loc_database_enumerator
* loc_database_enumerator_unref(struct loc_database_enumerator
* enumerator
) {
1144 if (--enumerator
->refcount
> 0)
1147 loc_database_enumerator_free(enumerator
);
1151 LOC_EXPORT
int loc_database_enumerator_set_string(struct loc_database_enumerator
* enumerator
, const char* string
) {
1152 enumerator
->string
= strdup(string
);
1154 // Make the string lowercase
1155 for (char *p
= enumerator
->string
; *p
; p
++)
1161 LOC_EXPORT
struct loc_country_list
* loc_database_enumerator_get_countries(
1162 struct loc_database_enumerator
* enumerator
) {
1163 if (!enumerator
->countries
)
1166 return loc_country_list_ref(enumerator
->countries
);
1169 LOC_EXPORT
int loc_database_enumerator_set_countries(
1170 struct loc_database_enumerator
* enumerator
, struct loc_country_list
* countries
) {
1171 if (enumerator
->countries
)
1172 loc_country_list_unref(enumerator
->countries
);
1174 enumerator
->countries
= loc_country_list_ref(countries
);
1179 LOC_EXPORT
struct loc_as_list
* loc_database_enumerator_get_asns(
1180 struct loc_database_enumerator
* enumerator
) {
1181 if (!enumerator
->asns
)
1184 return loc_as_list_ref(enumerator
->asns
);
1187 LOC_EXPORT
int loc_database_enumerator_set_asns(
1188 struct loc_database_enumerator
* enumerator
, struct loc_as_list
* asns
) {
1189 if (enumerator
->asns
)
1190 loc_as_list_unref(enumerator
->asns
);
1192 enumerator
->asns
= loc_as_list_ref(asns
);
1197 LOC_EXPORT
int loc_database_enumerator_set_flag(
1198 struct loc_database_enumerator
* enumerator
, enum loc_network_flags flag
) {
1199 enumerator
->flags
|= flag
;
1204 LOC_EXPORT
int loc_database_enumerator_set_family(
1205 struct loc_database_enumerator
* enumerator
, int family
) {
1206 enumerator
->family
= family
;
1211 LOC_EXPORT
int loc_database_enumerator_next_as(
1212 struct loc_database_enumerator
* enumerator
, struct loc_as
** as
) {
1215 // Do not do anything if not in AS mode
1216 if (enumerator
->mode
!= LOC_DB_ENUMERATE_ASES
)
1219 struct loc_database
* db
= enumerator
->db
;
1221 while (enumerator
->as_index
< db
->as_objects
.count
) {
1222 // Fetch the next AS
1223 int r
= loc_database_fetch_as(db
, as
, enumerator
->as_index
++);
1227 r
= loc_as_match_string(*as
, enumerator
->string
);
1229 DEBUG(enumerator
->ctx
, "AS%d (%s) matches %s\n",
1230 loc_as_get_number(*as
), loc_as_get_name(*as
), enumerator
->string
);
1241 enumerator
->as_index
= 0;
1243 // We have searched through all of them
1247 static int loc_database_enumerator_stack_push_node(
1248 struct loc_database_enumerator
* e
, off_t offset
, int i
, int depth
) {
1249 // Do not add empty nodes
1253 // Check if there is any space left on the stack
1254 if (e
->network_stack_depth
>= MAX_STACK_DEPTH
) {
1255 ERROR(e
->ctx
, "Maximum stack size reached: %d\n", e
->network_stack_depth
);
1259 // Check if the node is in range
1260 if (offset
>= (off_t
)e
->db
->network_node_objects
.count
) {
1261 ERROR(e
->ctx
, "Trying to add invalid node with offset %jd/%zu\n",
1262 offset
, e
->db
->network_node_objects
.count
);
1267 // Increase stack size
1268 int s
= ++e
->network_stack_depth
;
1270 DEBUG(e
->ctx
, "Added node %jd to stack (%d)\n", (intmax_t)offset
, depth
);
1272 e
->network_stack
[s
].offset
= offset
;
1273 e
->network_stack
[s
].i
= i
;
1274 e
->network_stack
[s
].depth
= depth
;
1279 static int loc_database_enumerator_match_network(
1280 struct loc_database_enumerator
* enumerator
, struct loc_network
* network
) {
1281 // If family is set, it must match
1282 if (enumerator
->family
&& loc_network_address_family(network
) != enumerator
->family
) {
1283 DEBUG(enumerator
->ctx
, "Filtered network %p because of family not matching\n", network
);
1287 // Match if no filter criteria is configured
1288 if (!enumerator
->countries
&& !enumerator
->asns
&& !enumerator
->flags
)
1291 // Check if the country code matches
1292 if (enumerator
->countries
&& !loc_country_list_empty(enumerator
->countries
)) {
1293 const char* country_code
= loc_network_get_country_code(network
);
1295 if (loc_country_list_contains_code(enumerator
->countries
, country_code
)) {
1296 DEBUG(enumerator
->ctx
, "Matched network %p because of its country code\n", network
);
1301 // Check if the ASN matches
1302 if (enumerator
->asns
&& !loc_as_list_empty(enumerator
->asns
)) {
1303 uint32_t asn
= loc_network_get_asn(network
);
1305 if (loc_as_list_contains_number(enumerator
->asns
, asn
)) {
1306 DEBUG(enumerator
->ctx
, "Matched network %p because of its ASN\n", network
);
1311 // Check if flags match
1312 if (enumerator
->flags
&& loc_network_has_flag(network
, enumerator
->flags
)) {
1313 DEBUG(enumerator
->ctx
, "Matched network %p because of its flags\n", network
);
1321 static int __loc_database_enumerator_next_network(
1322 struct loc_database_enumerator
* enumerator
, struct loc_network
** network
, int filter
) {
1323 // Return top element from the stack
1325 *network
= loc_network_list_pop_first(enumerator
->stack
);
1331 // Return everything if filter isn't enabled, or only return matches
1332 if (!filter
|| loc_database_enumerator_match_network(enumerator
, *network
))
1335 // Throw away anything that doesn't match
1336 loc_network_unref(*network
);
1340 DEBUG(enumerator
->ctx
, "Called with a stack of %u nodes\n",
1341 enumerator
->network_stack_depth
);
1344 while (enumerator
->network_stack_depth
> 0) {
1345 DEBUG(enumerator
->ctx
, "Stack depth: %u\n", enumerator
->network_stack_depth
);
1347 // Get object from top of the stack
1348 struct loc_node_stack
* node
= &enumerator
->network_stack
[enumerator
->network_stack_depth
];
1350 DEBUG(enumerator
->ctx
, " Got node: %jd\n", node
->offset
);
1352 // Remove the node from the stack if we have already visited it
1353 if (enumerator
->networks_visited
[node
->offset
]) {
1354 enumerator
->network_stack_depth
--;
1358 // Mark the bits on the path correctly
1359 loc_address_set_bit(&enumerator
->network_address
,
1360 (node
->depth
> 0) ? node
->depth
- 1 : 0, node
->i
);
1362 DEBUG(enumerator
->ctx
, "Looking at node %jd\n", (intmax_t)node
->offset
);
1363 enumerator
->networks_visited
[node
->offset
]++;
1365 // Pop node from top of the stack
1366 struct loc_database_network_node_v1
* n
=
1367 (struct loc_database_network_node_v1
*)loc_database_object(enumerator
->db
,
1368 &enumerator
->db
->network_node_objects
, sizeof(*n
), node
->offset
);
1372 // Add edges to stack
1373 int r
= loc_database_enumerator_stack_push_node(enumerator
,
1374 be32toh(n
->one
), 1, node
->depth
+ 1);
1378 r
= loc_database_enumerator_stack_push_node(enumerator
,
1379 be32toh(n
->zero
), 0, node
->depth
+ 1);
1383 // Check if this node is a leaf and has a network object
1384 if (__loc_database_node_is_leaf(n
)) {
1385 off_t network_index
= be32toh(n
->network
);
1387 DEBUG(enumerator
->ctx
, "Node has a network at %jd\n", (intmax_t)network_index
);
1389 // Fetch the network object
1390 r
= loc_database_fetch_network(enumerator
->db
, network
,
1391 &enumerator
->network_address
, node
->depth
, network_index
);
1393 // Break on any errors
1397 // Return all networks when the filter is disabled, or check for match
1398 if (!filter
|| loc_database_enumerator_match_network(enumerator
, *network
))
1401 // Does not seem to be a match, so we cleanup and move on
1402 loc_network_unref(*network
);
1407 // Reached the end of the search
1411 static int __loc_database_enumerator_next_network_flattened(
1412 struct loc_database_enumerator
* enumerator
, struct loc_network
** network
) {
1413 // Fetch the next network
1414 int r
= __loc_database_enumerator_next_network(enumerator
, network
, 1);
1418 // End if we could not read another network
1422 struct loc_network
* subnet
= NULL
;
1424 // Create a list with all subnets
1425 if (!enumerator
->subnets
) {
1426 r
= loc_network_list_new(enumerator
->ctx
, &enumerator
->subnets
);
1431 // Search all subnets from the database
1433 // Fetch the next network in line
1434 r
= __loc_database_enumerator_next_network(enumerator
, &subnet
, 0);
1436 loc_network_unref(subnet
);
1437 loc_network_list_clear(enumerator
->subnets
);
1442 // End if we did not receive another subnet
1446 // Collect all subnets in a list
1447 if (loc_network_is_subnet(*network
, subnet
)) {
1448 r
= loc_network_list_push(enumerator
->subnets
, subnet
);
1450 loc_network_unref(subnet
);
1451 loc_network_list_clear(enumerator
->subnets
);
1456 loc_network_unref(subnet
);
1460 // If this is not a subnet, we push it back onto the stack and break
1461 r
= loc_network_list_push(enumerator
->stack
, subnet
);
1463 loc_network_unref(subnet
);
1464 loc_network_list_clear(enumerator
->subnets
);
1469 loc_network_unref(subnet
);
1473 DEBUG(enumerator
->ctx
, "Found %zu subnet(s)\n",
1474 loc_network_list_size(enumerator
->subnets
));
1476 // We can abort here if the network has no subnets
1477 if (loc_network_list_empty(enumerator
->subnets
)) {
1478 loc_network_list_clear(enumerator
->subnets
);
1483 // If the network has any subnets, we will break it into smaller parts
1484 // without the subnets.
1485 struct loc_network_list
* excluded
= loc_network_exclude_list(*network
, enumerator
->subnets
);
1487 loc_network_list_clear(enumerator
->subnets
);
1491 // Merge subnets onto the stack
1492 r
= loc_network_list_merge(enumerator
->stack
, enumerator
->subnets
);
1494 loc_network_list_clear(enumerator
->subnets
);
1495 loc_network_list_unref(excluded
);
1500 // Push excluded list onto the stack
1501 r
= loc_network_list_merge(enumerator
->stack
, excluded
);
1503 loc_network_list_clear(enumerator
->subnets
);
1504 loc_network_list_unref(excluded
);
1509 loc_network_list_clear(enumerator
->subnets
);
1510 loc_network_list_unref(excluded
);
1512 // Drop the network and restart the whole process again to pick the next network
1513 loc_network_unref(*network
);
1515 return __loc_database_enumerator_next_network_flattened(enumerator
, network
);
1519 This function finds all bogons (i.e. gaps) between the input networks
1521 static int __loc_database_enumerator_next_bogon(
1522 struct loc_database_enumerator
* enumerator
, struct loc_network
** bogon
) {
1525 // Return top element from the stack
1527 *bogon
= loc_network_list_pop_first(enumerator
->stack
);
1537 struct loc_network
* network
= NULL
;
1538 struct in6_addr
* gap_start
= NULL
;
1539 struct in6_addr gap_end
= IN6ADDR_ANY_INIT
;
1542 r
= __loc_database_enumerator_next_network(enumerator
, &network
, 1);
1546 // We have read the last network
1550 const char* country_code
= loc_network_get_country_code(network
);
1553 Skip anything that does not have a country code
1555 Even if a network is part of the routing table, and the database provides
1556 an ASN, this does not mean that this is a legitimate announcement.
1558 if (country_code
&& !*country_code
) {
1559 loc_network_unref(network
);
1563 // Determine the network family
1564 int family
= loc_network_address_family(network
);
1568 gap_start
= &enumerator
->gap6_start
;
1572 gap_start
= &enumerator
->gap4_start
;
1576 ERROR(enumerator
->ctx
, "Unsupported network family %d\n", family
);
1581 const struct in6_addr
* first_address
= loc_network_get_first_address(network
);
1582 const struct in6_addr
* last_address
= loc_network_get_last_address(network
);
1584 // Skip if this network is a subnet of a former one
1585 if (loc_address_cmp(gap_start
, last_address
) >= 0) {
1586 loc_network_unref(network
);
1590 // Search where the gap could end
1591 gap_end
= *first_address
;
1592 loc_address_decrement(&gap_end
);
1595 if (loc_address_cmp(gap_start
, &gap_end
) <= 0) {
1596 r
= loc_network_list_summarize(enumerator
->ctx
,
1597 gap_start
, &gap_end
, &enumerator
->stack
);
1599 loc_network_unref(network
);
1604 // The gap now starts after this network
1605 *gap_start
= *last_address
;
1606 loc_address_increment(gap_start
);
1608 loc_network_unref(network
);
1610 // Try to return something
1611 *bogon
= loc_network_list_pop_first(enumerator
->stack
);
1620 if (!loc_address_all_zeroes(&enumerator
->gap6_start
)) {
1621 r
= loc_address_reset_last(&gap_end
, AF_INET6
);
1625 if (loc_address_cmp(&enumerator
->gap6_start
, &gap_end
) <= 0) {
1626 r
= loc_network_list_summarize(enumerator
->ctx
,
1627 &enumerator
->gap6_start
, &gap_end
, &enumerator
->stack
);
1633 loc_address_reset(&enumerator
->gap6_start
, AF_INET6
);
1636 if (!loc_address_all_zeroes(&enumerator
->gap4_start
)) {
1637 r
= loc_address_reset_last(&gap_end
, AF_INET
);
1641 if (loc_address_cmp(&enumerator
->gap4_start
, &gap_end
) <= 0) {
1642 r
= loc_network_list_summarize(enumerator
->ctx
,
1643 &enumerator
->gap4_start
, &gap_end
, &enumerator
->stack
);
1649 loc_address_reset(&enumerator
->gap4_start
, AF_INET
);
1652 // Try to return something
1653 *bogon
= loc_network_list_pop_first(enumerator
->stack
);
1658 LOC_EXPORT
int loc_database_enumerator_next_network(
1659 struct loc_database_enumerator
* enumerator
, struct loc_network
** network
) {
1660 switch (enumerator
->mode
) {
1661 case LOC_DB_ENUMERATE_NETWORKS
:
1663 if (enumerator
->flatten
)
1664 return __loc_database_enumerator_next_network_flattened(enumerator
, network
);
1666 return __loc_database_enumerator_next_network(enumerator
, network
, 1);
1668 case LOC_DB_ENUMERATE_BOGONS
:
1669 return __loc_database_enumerator_next_bogon(enumerator
, network
);
1676 LOC_EXPORT
int loc_database_enumerator_next_country(
1677 struct loc_database_enumerator
* enumerator
, struct loc_country
** country
) {
1680 // Do not do anything if not in country mode
1681 if (enumerator
->mode
!= LOC_DB_ENUMERATE_COUNTRIES
)
1684 struct loc_database
* db
= enumerator
->db
;
1686 while (enumerator
->country_index
< db
->country_objects
.count
) {
1687 // Fetch the next country
1688 int r
= loc_database_fetch_country(db
, country
, enumerator
->country_index
++);
1692 // We do not filter here, so it always is a match
1697 enumerator
->country_index
= 0;
1699 // We have searched through all of them