]> git.ipfire.org Git - people/ms/libloc.git/blob - src/database.c
e8ec9b7ec4843669d215eb084e135b4358d3012c
[people/ms/libloc.git] / src / database.c
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 <ctype.h>
19 #include <endian.h>
20 #include <errno.h>
21 #include <netinet/in.h>
22 #include <stddef.h>
23 #include <stdint.h>
24 #include <stdio.h>
25 #include <stdlib.h>
26 #include <string.h>
27 #include <sys/mman.h>
28 #include <sys/types.h>
29 #include <time.h>
30 #include <unistd.h>
31
32 #include <loc/libloc.h>
33 #include <loc/as.h>
34 #include <loc/database.h>
35 #include <loc/format.h>
36 #include <loc/network.h>
37 #include <loc/private.h>
38 #include <loc/stringpool.h>
39
40 struct loc_database {
41 struct loc_ctx* ctx;
42 int refcount;
43
44 unsigned int version;
45 time_t created_at;
46 off_t vendor;
47 off_t description;
48 off_t license;
49
50 // ASes in the database
51 struct loc_database_as_v0* as_v0;
52 size_t as_count;
53
54 // Network tree
55 struct loc_database_network_node_v0* network_nodes_v0;
56 size_t network_nodes_count;
57
58 // Networks
59 struct loc_database_network_v0* networks_v0;
60 size_t networks_count;
61
62 struct loc_stringpool* pool;
63 };
64
65 struct loc_database_enumerator {
66 struct loc_ctx* ctx;
67 struct loc_database* db;
68 int refcount;
69
70 // Search string
71 char* string;
72 char country_code[3];
73
74 // Index of the AS we are looking at
75 unsigned int as_index;
76 };
77
78 static int loc_database_read_magic(struct loc_database* db, FILE* f) {
79 struct loc_database_magic magic;
80
81 // Read from file
82 size_t bytes_read = fread(&magic, 1, sizeof(magic), f);
83
84 // Check if we have been able to read enough data
85 if (bytes_read < sizeof(magic)) {
86 ERROR(db->ctx, "Could not read enough data to validate magic bytes\n");
87 DEBUG(db->ctx, "Read %zu bytes, but needed %zu\n", bytes_read, sizeof(magic));
88 return -ENOMSG;
89 }
90
91 // Compare magic bytes
92 if (memcmp(LOC_DATABASE_MAGIC, magic.magic, strlen(LOC_DATABASE_MAGIC)) == 0) {
93 DEBUG(db->ctx, "Magic value matches\n");
94
95 // Parse version
96 db->version = be16toh(magic.version);
97 DEBUG(db->ctx, "Database version is %u\n", db->version);
98
99 return 0;
100 }
101
102 ERROR(db->ctx, "Database format is not compatible\n");
103
104 // Return an error
105 return 1;
106 }
107
108 static int loc_database_read_as_section_v0(struct loc_database* db,
109 FILE* f, const struct loc_database_header_v0* header) {
110 off_t as_offset = be32toh(header->as_offset);
111 size_t as_length = be32toh(header->as_length);
112
113 DEBUG(db->ctx, "Reading AS section from %jd (%zu bytes)\n", as_offset, as_length);
114
115 if (as_length > 0) {
116 db->as_v0 = mmap(NULL, as_length, PROT_READ,
117 MAP_SHARED, fileno(f), as_offset);
118
119 if (db->as_v0 == MAP_FAILED)
120 return -errno;
121 }
122
123 db->as_count = as_length / sizeof(*db->as_v0);
124
125 INFO(db->ctx, "Read %zu ASes from the database\n", db->as_count);
126
127 return 0;
128 }
129
130 static int loc_database_read_network_nodes_section_v0(struct loc_database* db,
131 FILE* f, const struct loc_database_header_v0* header) {
132 off_t network_nodes_offset = be32toh(header->network_tree_offset);
133 size_t network_nodes_length = be32toh(header->network_tree_length);
134
135 DEBUG(db->ctx, "Reading network nodes section from %jd (%zu bytes)\n",
136 network_nodes_offset, network_nodes_length);
137
138 if (network_nodes_length > 0) {
139 db->network_nodes_v0 = mmap(NULL, network_nodes_length, PROT_READ,
140 MAP_SHARED, fileno(f), network_nodes_offset);
141
142 if (db->network_nodes_v0 == MAP_FAILED)
143 return -errno;
144 }
145
146 db->network_nodes_count = network_nodes_length / sizeof(*db->network_nodes_v0);
147
148 INFO(db->ctx, "Read %zu network nodes from the database\n", db->network_nodes_count);
149
150 return 0;
151 }
152
153 static int loc_database_read_networks_section_v0(struct loc_database* db,
154 FILE* f, const struct loc_database_header_v0* header) {
155 off_t networks_offset = be32toh(header->network_data_offset);
156 size_t networks_length = be32toh(header->network_data_length);
157
158 DEBUG(db->ctx, "Reading networks section from %jd (%zu bytes)\n",
159 networks_offset, networks_length);
160
161 if (networks_length > 0) {
162 db->networks_v0 = mmap(NULL, networks_length, PROT_READ,
163 MAP_SHARED, fileno(f), networks_offset);
164
165 if (db->networks_v0 == MAP_FAILED)
166 return -errno;
167 }
168
169 db->networks_count = networks_length / sizeof(*db->networks_v0);
170
171 INFO(db->ctx, "Read %zu networks from the database\n", db->networks_count);
172
173 return 0;
174 }
175
176 static int loc_database_read_header_v0(struct loc_database* db, FILE* f) {
177 struct loc_database_header_v0 header;
178
179 // Read from file
180 size_t size = fread(&header, 1, sizeof(header), f);
181
182 if (size < sizeof(header)) {
183 ERROR(db->ctx, "Could not read enough data for header\n");
184 return -ENOMSG;
185 }
186
187 // Copy over data
188 db->created_at = be64toh(header.created_at);
189 db->vendor = be32toh(header.vendor);
190 db->description = be32toh(header.description);
191 db->license = be32toh(header.license);
192
193 // Open pool
194 off_t pool_offset = be32toh(header.pool_offset);
195 size_t pool_length = be32toh(header.pool_length);
196
197 int r = loc_stringpool_open(db->ctx, &db->pool,
198 f, pool_length, pool_offset);
199 if (r)
200 return r;
201
202 // AS section
203 r = loc_database_read_as_section_v0(db, f, &header);
204 if (r)
205 return r;
206
207 // Network Nodes
208 r = loc_database_read_network_nodes_section_v0(db, f, &header);
209 if (r)
210 return r;
211
212 // Networks
213 r = loc_database_read_networks_section_v0(db, f, &header);
214 if (r)
215 return r;
216
217 return 0;
218 }
219
220 static int loc_database_read_header(struct loc_database* db, FILE* f) {
221 switch (db->version) {
222 case 0:
223 return loc_database_read_header_v0(db, f);
224
225 default:
226 ERROR(db->ctx, "Incompatible database version: %u\n", db->version);
227 return 1;
228 }
229 }
230
231 static int loc_database_read(struct loc_database* db, FILE* f) {
232 clock_t start = clock();
233
234 // Read magic bytes
235 int r = loc_database_read_magic(db, f);
236 if (r)
237 return r;
238
239 // Read the header
240 r = loc_database_read_header(db, f);
241 if (r)
242 return r;
243
244 clock_t end = clock();
245
246 INFO(db->ctx, "Opened database in %.8fs\n",
247 (double)(end - start) / CLOCKS_PER_SEC);
248
249 return 0;
250 }
251
252 LOC_EXPORT int loc_database_new(struct loc_ctx* ctx, struct loc_database** database, FILE* f) {
253 // Fail on invalid file handle
254 if (!f)
255 return -EINVAL;
256
257 struct loc_database* db = calloc(1, sizeof(*db));
258 if (!db)
259 return -ENOMEM;
260
261 // Reference context
262 db->ctx = loc_ref(ctx);
263 db->refcount = 1;
264
265 DEBUG(db->ctx, "Database object allocated at %p\n", db);
266
267 int r = loc_database_read(db, f);
268 if (r) {
269 loc_database_unref(db);
270 return r;
271 }
272
273 *database = db;
274
275 return 0;
276 }
277
278 LOC_EXPORT struct loc_database* loc_database_ref(struct loc_database* db) {
279 db->refcount++;
280
281 return db;
282 }
283
284 static void loc_database_free(struct loc_database* db) {
285 int r;
286
287 DEBUG(db->ctx, "Releasing database %p\n", db);
288
289 // Removing all ASes
290 if (db->as_v0) {
291 r = munmap(db->as_v0, db->as_count * sizeof(*db->as_v0));
292 if (r)
293 ERROR(db->ctx, "Could not unmap AS section: %s\n", strerror(errno));
294 }
295
296 // Remove mapped network sections
297 if (db->networks_v0) {
298 r = munmap(db->networks_v0, db->networks_count * sizeof(*db->networks_v0));
299 if (r)
300 ERROR(db->ctx, "Could not unmap networks section: %s\n", strerror(errno));
301 }
302
303 // Remove mapped network nodes section
304 if (db->network_nodes_v0) {
305 r = munmap(db->network_nodes_v0, db->network_nodes_count * sizeof(*db->network_nodes_v0));
306 if (r)
307 ERROR(db->ctx, "Could not unmap network nodes section: %s\n", strerror(errno));
308 }
309
310 loc_stringpool_unref(db->pool);
311
312 loc_unref(db->ctx);
313 free(db);
314 }
315
316 LOC_EXPORT struct loc_database* loc_database_unref(struct loc_database* db) {
317 if (--db->refcount > 0)
318 return NULL;
319
320 loc_database_free(db);
321 return NULL;
322 }
323
324 LOC_EXPORT time_t loc_database_created_at(struct loc_database* db) {
325 return db->created_at;
326 }
327
328 LOC_EXPORT const char* loc_database_get_vendor(struct loc_database* db) {
329 return loc_stringpool_get(db->pool, db->vendor);
330 }
331
332 LOC_EXPORT const char* loc_database_get_description(struct loc_database* db) {
333 return loc_stringpool_get(db->pool, db->description);
334 }
335
336 LOC_EXPORT const char* loc_database_get_license(struct loc_database* db) {
337 return loc_stringpool_get(db->pool, db->license);
338 }
339
340 LOC_EXPORT size_t loc_database_count_as(struct loc_database* db) {
341 return db->as_count;
342 }
343
344 // Returns the AS at position pos
345 static int loc_database_fetch_as(struct loc_database* db, struct loc_as** as, off_t pos) {
346 if ((size_t)pos >= db->as_count)
347 return -EINVAL;
348
349 DEBUG(db->ctx, "Fetching AS at position %jd\n", pos);
350
351 int r;
352 switch (db->version) {
353 case 0:
354 r = loc_as_new_from_database_v0(db->ctx, db->pool, as, db->as_v0 + pos);
355 break;
356
357 default:
358 return -1;
359 }
360
361 if (r == 0) {
362 DEBUG(db->ctx, "Got AS%u\n", loc_as_get_number(*as));
363 }
364
365 return r;
366 }
367
368 // Performs a binary search to find the AS in the list
369 LOC_EXPORT int loc_database_get_as(struct loc_database* db, struct loc_as** as, uint32_t number) {
370 off_t lo = 0;
371 off_t hi = db->as_count - 1;
372
373 // Save start time
374 clock_t start = clock();
375
376 while (lo <= hi) {
377 off_t i = (lo + hi) / 2;
378
379 // Fetch AS in the middle between lo and hi
380 int r = loc_database_fetch_as(db, as, i);
381 if (r)
382 return r;
383
384 // Check if this is a match
385 uint32_t as_number = loc_as_get_number(*as);
386 if (as_number == number) {
387 clock_t end = clock();
388
389 // Log how fast this has been
390 DEBUG(db->ctx, "Found AS%u in %.8fs\n", as_number,
391 (double)(end - start) / CLOCKS_PER_SEC);
392
393 return 0;
394 }
395
396 // If it wasn't, we release the AS and
397 // adjust our search pointers
398 loc_as_unref(*as);
399
400 if (as_number < number) {
401 lo = i + 1;
402 } else
403 hi = i - 1;
404 }
405
406 // Nothing found
407 *as = NULL;
408
409 return 1;
410 }
411
412 // Returns the network at position pos
413 static int loc_database_fetch_network(struct loc_database* db, struct loc_network** network,
414 struct in6_addr* address, unsigned int prefix, off_t pos) {
415 if ((size_t)pos >= db->networks_count)
416 return -EINVAL;
417
418 DEBUG(db->ctx, "Fetching network at position %jd\n", pos);
419
420 int r;
421 switch (db->version) {
422 case 0:
423 r = loc_network_new_from_database_v0(db->ctx, network,
424 address, prefix, db->networks_v0 + pos);
425 break;
426
427 default:
428 return -1;
429 }
430
431 if (r == 0) {
432 char* string = loc_network_str(*network);
433 DEBUG(db->ctx, "Got network %s\n", string);
434 free(string);
435 }
436
437 return r;
438 }
439
440 static int __loc_database_node_is_leaf(const struct loc_database_network_node_v0* node) {
441 return (node->network != htobe32(0xffffffff));
442 }
443
444 static int __loc_database_lookup_handle_leaf(struct loc_database* db, const struct in6_addr* address,
445 struct loc_network** network, struct in6_addr* network_address, unsigned int prefix,
446 const struct loc_database_network_node_v0* node) {
447 off_t network_index = be32toh(node->network);
448
449 DEBUG(db->ctx, "Handling leaf node at %jd (%jd)\n", node - db->network_nodes_v0, network_index);
450
451 // Fetch the network
452 int r = loc_database_fetch_network(db, network,
453 network_address, prefix, network_index);
454 if (r) {
455 ERROR(db->ctx, "Could not fetch network %jd from database\n", network_index);
456 return r;
457 }
458
459 // Check if the given IP address is inside the network
460 r = loc_network_match_address(*network, address);
461 if (r) {
462 DEBUG(db->ctx, "Searched address is not part of the network\n");
463
464 loc_network_unref(*network);
465 *network = NULL;
466 return 1;
467 }
468
469 // A network was found and the IP address matches
470 return 0;
471 }
472
473 // Searches for an exact match along the path
474 static int __loc_database_lookup(struct loc_database* db, const struct in6_addr* address,
475 struct loc_network** network, struct in6_addr* network_address,
476 const struct loc_database_network_node_v0* node, unsigned int level) {
477 int r;
478 off_t node_index;
479
480 // Follow the path
481 int bit = in6_addr_get_bit(address, level);
482 in6_addr_set_bit(network_address, level, bit);
483
484 if (bit == 0)
485 node_index = be32toh(node->zero);
486 else
487 node_index = be32toh(node->one);
488
489 // If the node index is zero, the tree ends here
490 // and we cannot descend any further
491 if (node_index > 0) {
492 // Check boundaries
493 if ((size_t)node_index >= db->network_nodes_count)
494 return -EINVAL;
495
496 // Move on to the next node
497 r = __loc_database_lookup(db, address, network, network_address,
498 db->network_nodes_v0 + node_index, level + 1);
499
500 // End here if a result was found
501 if (r == 0)
502 return r;
503
504 // Raise any errors
505 else if (r < 0)
506 return r;
507
508 DEBUG(db->ctx, "No match found below level %u\n", level);
509 } else {
510 DEBUG(db->ctx, "Tree ended at level %u\n", level);
511 }
512
513 // If this node has a leaf, we will check if it matches
514 if (__loc_database_node_is_leaf(node)) {
515 r = __loc_database_lookup_handle_leaf(db, address, network, network_address, level, node);
516 if (r <= 0)
517 return r;
518 }
519
520 return 1;
521 }
522
523 LOC_EXPORT int loc_database_lookup(struct loc_database* db,
524 struct in6_addr* address, struct loc_network** network) {
525 struct in6_addr network_address;
526 memset(&network_address, 0, sizeof(network_address));
527
528 *network = NULL;
529
530 // Save start time
531 clock_t start = clock();
532
533 int r = __loc_database_lookup(db, address, network, &network_address,
534 db->network_nodes_v0, 0);
535
536 clock_t end = clock();
537
538 // Log how fast this has been
539 DEBUG(db->ctx, "Executed network search in %.8fs\n",
540 (double)(end - start) / CLOCKS_PER_SEC);
541
542 return r;
543 }
544
545 LOC_EXPORT int loc_database_lookup_from_string(struct loc_database* db,
546 const char* string, struct loc_network** network) {
547 struct in6_addr address;
548
549 int r = loc_parse_address(db->ctx, string, &address);
550 if (r)
551 return r;
552
553 return loc_database_lookup(db, &address, network);
554 }
555
556 // Enumerator
557
558 LOC_EXPORT int loc_database_enumerator_new(struct loc_database_enumerator** enumerator, struct loc_database* db) {
559 struct loc_database_enumerator* e = calloc(1, sizeof(*e));
560 if (!e)
561 return -ENOMEM;
562
563 // Reference context
564 e->ctx = loc_ref(db->ctx);
565 e->db = loc_database_ref(db);
566 e->refcount = 1;
567
568 DEBUG(e->ctx, "Database enumerator object allocated at %p\n", e);
569
570 *enumerator = e;
571 return 0;
572 }
573
574 LOC_EXPORT struct loc_database_enumerator* loc_database_enumerator_ref(struct loc_database_enumerator* enumerator) {
575 enumerator->refcount++;
576
577 return enumerator;
578 }
579
580 static void loc_database_enumerator_free(struct loc_database_enumerator* enumerator) {
581 DEBUG(enumerator->ctx, "Releasing database enumerator %p\n", enumerator);
582
583 // Release all references
584 loc_database_unref(enumerator->db);
585 loc_unref(enumerator->ctx);
586
587 if (enumerator->string)
588 free(enumerator->string);
589
590 free(enumerator);
591 }
592
593 LOC_EXPORT struct loc_database_enumerator* loc_database_enumerator_unref(struct loc_database_enumerator* enumerator) {
594 if (!enumerator)
595 return NULL;
596
597 if (--enumerator->refcount > 0)
598 return enumerator;
599
600 loc_database_enumerator_free(enumerator);
601 return NULL;
602 }
603
604 LOC_EXPORT int loc_database_enumerator_set_string(struct loc_database_enumerator* enumerator, const char* string) {
605 enumerator->string = strdup(string);
606
607 // Make the string lowercase
608 for (char *p = enumerator->string; *p; p++)
609 *p = tolower(*p);
610
611 return 0;
612 }
613
614 LOC_EXPORT int loc_database_enumerator_set_country_code(struct loc_database_enumerator* enumerator, const char* country_code) {
615 // Set empty country code
616 if (!country_code || !*country_code) {
617 *enumerator->country_code = '\0';
618 return 0;
619 }
620
621 // Country codes must be two characters
622 if (strlen(country_code) != 2)
623 return -EINVAL;
624
625 for (unsigned int i = 0; i < 3; i++) {
626 enumerator->country_code[i] = country_code[i];
627 }
628
629 return 0;
630 }
631
632 LOC_EXPORT struct loc_as* loc_database_enumerator_next_as(struct loc_database_enumerator* enumerator) {
633 struct loc_database* db = enumerator->db;
634 struct loc_as* as;
635
636 while (enumerator->as_index < db->as_count) {
637 // Fetch the next AS
638 int r = loc_database_fetch_as(db, &as, enumerator->as_index++);
639 if (r)
640 return NULL;
641
642 r = loc_as_match_string(as, enumerator->string);
643 if (r == 1) {
644 DEBUG(enumerator->ctx, "AS%d (%s) matches %s\n",
645 loc_as_get_number(as), loc_as_get_name(as), enumerator->string);
646
647 return as;
648 }
649
650 // No match
651 loc_as_unref(as);
652 }
653
654 // Reset the index
655 enumerator->as_index = 0;
656
657 // We have searched through all of them
658 return NULL;
659 }