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>
31 #include <loc/libloc.h>
33 #include <loc/database.h>
34 #include <loc/format.h>
35 #include <loc/network.h>
36 #include <loc/private.h>
37 #include <loc/stringpool.h>
48 // ASes in the database
49 struct loc_database_as_v0
* as_v0
;
53 struct loc_database_network_node_v0
* network_nodes_v0
;
54 size_t network_nodes_count
;
57 struct loc_database_network_v0
* networks_v0
;
58 size_t networks_count
;
60 struct loc_stringpool
* pool
;
63 static int loc_database_read_magic(struct loc_database
* db
, FILE* f
) {
64 struct loc_database_magic magic
;
67 size_t bytes_read
= fread(&magic
, 1, sizeof(magic
), f
);
69 // Check if we have been able to read enough data
70 if (bytes_read
< sizeof(magic
)) {
71 ERROR(db
->ctx
, "Could not read enough data to validate magic bytes\n");
72 DEBUG(db
->ctx
, "Read %zu bytes, but needed %zu\n", bytes_read
, sizeof(magic
));
76 // Compare magic bytes
77 if (memcmp(LOC_DATABASE_MAGIC
, magic
.magic
, strlen(LOC_DATABASE_MAGIC
)) == 0) {
78 DEBUG(db
->ctx
, "Magic value matches\n");
81 db
->version
= be16toh(magic
.version
);
82 DEBUG(db
->ctx
, "Database version is %u\n", db
->version
);
87 ERROR(db
->ctx
, "Database format is not compatible\n");
93 static int loc_database_read_as_section_v0(struct loc_database
* db
,
94 FILE* f
, const struct loc_database_header_v0
* header
) {
95 off_t as_offset
= be32toh(header
->as_offset
);
96 size_t as_length
= be32toh(header
->as_length
);
98 DEBUG(db
->ctx
, "Reading AS section from %jd (%zu bytes)\n", as_offset
, as_length
);
101 db
->as_v0
= mmap(NULL
, as_length
, PROT_READ
,
102 MAP_SHARED
, fileno(f
), as_offset
);
104 if (db
->as_v0
== MAP_FAILED
)
108 db
->as_count
= as_length
/ sizeof(*db
->as_v0
);
110 INFO(db
->ctx
, "Read %zu ASes from the database\n", db
->as_count
);
115 static int loc_database_read_network_nodes_section_v0(struct loc_database
* db
,
116 FILE* f
, const struct loc_database_header_v0
* header
) {
117 off_t network_nodes_offset
= be32toh(header
->network_tree_offset
);
118 size_t network_nodes_length
= be32toh(header
->network_tree_length
);
120 DEBUG(db
->ctx
, "Reading network nodes section from %jd (%zu bytes)\n",
121 network_nodes_offset
, network_nodes_length
);
123 if (network_nodes_length
> 0) {
124 db
->network_nodes_v0
= mmap(NULL
, network_nodes_length
, PROT_READ
,
125 MAP_SHARED
, fileno(f
), network_nodes_offset
);
127 if (db
->network_nodes_v0
== MAP_FAILED
)
131 db
->network_nodes_count
= network_nodes_length
/ sizeof(*db
->network_nodes_v0
);
133 INFO(db
->ctx
, "Read %zu network nodes from the database\n", db
->network_nodes_count
);
138 static int loc_database_read_networks_section_v0(struct loc_database
* db
,
139 FILE* f
, const struct loc_database_header_v0
* header
) {
140 off_t networks_offset
= be32toh(header
->network_data_offset
);
141 size_t networks_length
= be32toh(header
->network_data_length
);
143 DEBUG(db
->ctx
, "Reading networks section from %jd (%zu bytes)\n",
144 networks_offset
, networks_length
);
146 if (networks_length
> 0) {
147 db
->networks_v0
= mmap(NULL
, networks_length
, PROT_READ
,
148 MAP_SHARED
, fileno(f
), networks_offset
);
150 if (db
->networks_v0
== MAP_FAILED
)
154 db
->networks_count
= networks_length
/ sizeof(*db
->networks_v0
);
156 INFO(db
->ctx
, "Read %zu networks from the database\n", db
->networks_count
);
161 static int loc_database_read_header_v0(struct loc_database
* db
, FILE* f
) {
162 struct loc_database_header_v0 header
;
165 size_t size
= fread(&header
, 1, sizeof(header
), f
);
167 if (size
< sizeof(header
)) {
168 ERROR(db
->ctx
, "Could not read enough data for header\n");
173 db
->created_at
= be64toh(header
.created_at
);
174 db
->vendor
= be32toh(header
.vendor
);
175 db
->description
= be32toh(header
.description
);
178 off_t pool_offset
= be32toh(header
.pool_offset
);
179 size_t pool_length
= be32toh(header
.pool_length
);
181 int r
= loc_stringpool_open(db
->ctx
, &db
->pool
,
182 f
, pool_length
, pool_offset
);
187 r
= loc_database_read_as_section_v0(db
, f
, &header
);
192 r
= loc_database_read_network_nodes_section_v0(db
, f
, &header
);
197 r
= loc_database_read_networks_section_v0(db
, f
, &header
);
204 static int loc_database_read_header(struct loc_database
* db
, FILE* f
) {
205 switch (db
->version
) {
207 return loc_database_read_header_v0(db
, f
);
210 ERROR(db
->ctx
, "Incompatible database version: %u\n", db
->version
);
215 static int loc_database_read(struct loc_database
* db
, FILE* f
) {
216 clock_t start
= clock();
219 int r
= loc_database_read_magic(db
, f
);
224 r
= loc_database_read_header(db
, f
);
228 clock_t end
= clock();
230 INFO(db
->ctx
, "Opened database in %.8fs\n",
231 (double)(end
- start
) / CLOCKS_PER_SEC
);
236 LOC_EXPORT
int loc_database_new(struct loc_ctx
* ctx
, struct loc_database
** database
, FILE* f
) {
237 // Fail on invalid file handle
241 struct loc_database
* db
= calloc(1, sizeof(*db
));
246 db
->ctx
= loc_ref(ctx
);
249 DEBUG(db
->ctx
, "Database object allocated at %p\n", db
);
251 int r
= loc_database_read(db
, f
);
253 loc_database_unref(db
);
262 LOC_EXPORT
struct loc_database
* loc_database_ref(struct loc_database
* db
) {
268 static void loc_database_free(struct loc_database
* db
) {
269 DEBUG(db
->ctx
, "Releasing database %p\n", db
);
273 int r
= munmap(db
->as_v0
, db
->as_count
* sizeof(*db
->as_v0
));
275 ERROR(db
->ctx
, "Could not unmap AS section: %s\n", strerror(errno
));
278 loc_stringpool_unref(db
->pool
);
284 LOC_EXPORT
struct loc_database
* loc_database_unref(struct loc_database
* db
) {
285 if (--db
->refcount
> 0)
288 loc_database_free(db
);
292 LOC_EXPORT
time_t loc_database_created_at(struct loc_database
* db
) {
293 return db
->created_at
;
296 LOC_EXPORT
const char* loc_database_get_vendor(struct loc_database
* db
) {
297 return loc_stringpool_get(db
->pool
, db
->vendor
);
300 LOC_EXPORT
const char* loc_database_get_description(struct loc_database
* db
) {
301 return loc_stringpool_get(db
->pool
, db
->description
);
304 LOC_EXPORT
size_t loc_database_count_as(struct loc_database
* db
) {
308 // Returns the AS at position pos
309 static int loc_database_fetch_as(struct loc_database
* db
, struct loc_as
** as
, off_t pos
) {
310 if ((size_t)pos
>= db
->as_count
)
313 DEBUG(db
->ctx
, "Fetching AS at position %jd\n", pos
);
316 switch (db
->version
) {
318 r
= loc_as_new_from_database_v0(db
->ctx
, db
->pool
, as
, db
->as_v0
+ pos
);
326 DEBUG(db
->ctx
, "Got AS%u\n", loc_as_get_number(*as
));
332 // Performs a binary search to find the AS in the list
333 LOC_EXPORT
int loc_database_get_as(struct loc_database
* db
, struct loc_as
** as
, uint32_t number
) {
335 off_t hi
= db
->as_count
- 1;
338 clock_t start
= clock();
341 off_t i
= (lo
+ hi
) / 2;
343 // Fetch AS in the middle between lo and hi
344 int r
= loc_database_fetch_as(db
, as
, i
);
348 // Check if this is a match
349 uint32_t as_number
= loc_as_get_number(*as
);
350 if (as_number
== number
) {
351 clock_t end
= clock();
353 // Log how fast this has been
354 DEBUG(db
->ctx
, "Found AS%u in %.8fs\n", as_number
,
355 (double)(end
- start
) / CLOCKS_PER_SEC
);
360 // If it wasn't, we release the AS and
361 // adjust our search pointers
364 if (as_number
< number
) {
376 // Returns the network at position pos
377 static int loc_database_fetch_network(struct loc_database
* db
, struct loc_network
** network
, struct in6_addr
* address
, off_t pos
) {
378 if ((size_t)pos
>= db
->networks_count
)
381 DEBUG(db
->ctx
, "Fetching network at position %jd\n", pos
);
384 switch (db
->version
) {
386 r
= loc_network_new_from_database_v0(db
->ctx
, network
, address
, db
->networks_v0
+ pos
);
394 char* string
= loc_network_str(*network
);
395 DEBUG(db
->ctx
, "Got network %s\n", string
);
402 static int __loc_database_lookup_leaf_node(struct loc_database
* db
, const struct in6_addr
* address
,
403 struct loc_network
** network
, struct in6_addr
* network_address
,
404 const struct loc_database_network_node_v0
* node
) {
405 // Check if this node is a leaf node
406 if (node
->zero
!= htobe32(0xffffffff))
409 DEBUG(db
->ctx
, "Node is a leaf: %jd\n", node
- db
->network_nodes_v0
);
412 int r
= loc_database_fetch_network(db
, network
,
413 network_address
, be32toh(node
->one
));
417 // Check if the given IP address is inside the network
418 r
= loc_network_match_address(*network
, address
);
420 DEBUG(db
->ctx
, "Searched address is not part of the network\n");
422 loc_network_unref(*network
);
427 // A network was found and the IP address matches
431 // Returns the highest result available
432 static int __loc_database_lookup_max(struct loc_database
* db
, const struct in6_addr
* address
,
433 struct loc_network
** network
, struct in6_addr
* network_address
,
434 const struct loc_database_network_node_v0
* node
, int level
) {
436 // If the node is a leaf node, we end here
437 int r
= __loc_database_lookup_leaf_node(db
, address
, network
, network_address
, node
);
443 // Try to go down the ones path first
445 node_index
= be32toh(node
->one
);
446 in6_addr_set_bit(network_address
, level
, 1);
449 if (node_index
> 0 && (size_t)node_index
<= db
->network_nodes_count
) {
450 r
= __loc_database_lookup_max(db
, address
, network
, network_address
,
451 db
->network_nodes_v0
+ node_index
, level
+ 1);
453 // Abort when match was found or error
459 // ... and if that fails, we try to go down one step on a zero
460 // branch and then try the ones again...
462 node_index
= be32toh(node
->zero
);
463 in6_addr_set_bit(network_address
, level
, 0);
466 if (node_index
> 0 && (size_t)node_index
<= db
->network_nodes_count
) {
467 r
= __loc_database_lookup_max(db
, address
, network
, network_address
,
468 db
->network_nodes_v0
+ node_index
, level
+ 1);
470 // Abort when match was found or error
480 // Searches for an exact match along the path
481 static int __loc_database_lookup(struct loc_database
* db
, const struct in6_addr
* address
,
482 struct loc_network
** network
, struct in6_addr
* network_address
,
483 const struct loc_database_network_node_v0
* node
, int level
) {
484 // If the node is a leaf node, we end here
485 int r
= __loc_database_lookup_leaf_node(db
, address
, network
, network_address
, node
);
492 int bit
= in6_addr_get_bit(address
, level
);
493 in6_addr_set_bit(network_address
, level
, bit
);
496 node_index
= be32toh(node
->zero
);
498 node_index
= be32toh(node
->one
);
500 // If we point back to root, the path ends here
501 if (node_index
== 0) {
502 DEBUG(db
->ctx
, "Tree ends here\n");
507 if ((size_t)node_index
>= db
->network_nodes_count
)
510 // Move on to the next node
511 r
= __loc_database_lookup(db
, address
, network
, network_address
,
512 db
->network_nodes_v0
+ node_index
, level
+ 1);
514 // End here if a result was found
522 DEBUG(db
->ctx
, "Could not find an exact match at %u\n", level
);
524 // If nothing was found, we have to search for an inexact match
525 return __loc_database_lookup_max(db
, address
, network
, network_address
, node
, level
);
528 LOC_EXPORT
int loc_database_lookup(struct loc_database
* db
,
529 struct in6_addr
* address
, struct loc_network
** network
) {
530 struct in6_addr network_address
;
531 memset(&network_address
, 0, sizeof(network_address
));
536 clock_t start
= clock();
538 int r
= __loc_database_lookup(db
, address
, network
, &network_address
,
539 db
->network_nodes_v0
, 0);
541 clock_t end
= clock();
543 // Log how fast this has been
544 DEBUG(db
->ctx
, "Executed network search in %.8fs\n",
545 (double)(end
- start
) / CLOCKS_PER_SEC
);
550 LOC_EXPORT
int loc_database_lookup_from_string(struct loc_database
* db
,
551 const char* string
, struct loc_network
** network
) {
552 struct in6_addr address
;
554 int r
= loc_parse_address(db
->ctx
, string
, &address
);
558 return loc_database_lookup(db
, &address
, network
);