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.
22 #include <sys/queue.h>
25 #include <loc/libloc.h>
27 #include <loc/format.h>
28 #include <loc/network.h>
29 #include <loc/private.h>
30 #include <loc/writer.h>
36 struct loc_stringpool
* pool
;
43 struct loc_network_tree
* networks
;
46 LOC_EXPORT
int loc_writer_new(struct loc_ctx
* ctx
, struct loc_writer
** writer
) {
47 struct loc_writer
* w
= calloc(1, sizeof(*w
));
51 w
->ctx
= loc_ref(ctx
);
54 int r
= loc_stringpool_new(ctx
, &w
->pool
);
60 // Initialize the network tree
61 r
= loc_network_tree_new(ctx
, &w
->networks
);
71 LOC_EXPORT
struct loc_writer
* loc_writer_ref(struct loc_writer
* writer
) {
77 static void loc_writer_free(struct loc_writer
* writer
) {
78 DEBUG(writer
->ctx
, "Releasing writer at %p\n", writer
);
81 for (unsigned int i
= 0; i
< writer
->as_count
; i
++) {
82 loc_as_unref(writer
->as
[i
]);
85 // Release network tree
87 loc_network_tree_unref(writer
->networks
);
89 // Unref the string pool
90 loc_stringpool_unref(writer
->pool
);
92 loc_unref(writer
->ctx
);
96 LOC_EXPORT
struct loc_writer
* loc_writer_unref(struct loc_writer
* writer
) {
97 if (--writer
->refcount
> 0)
100 loc_writer_free(writer
);
105 LOC_EXPORT
const char* loc_writer_get_vendor(struct loc_writer
* writer
) {
106 return loc_stringpool_get(writer
->pool
, writer
->vendor
);
109 LOC_EXPORT
int loc_writer_set_vendor(struct loc_writer
* writer
, const char* vendor
) {
110 // Add the string to the string pool
111 off_t offset
= loc_stringpool_add(writer
->pool
, vendor
);
115 writer
->vendor
= offset
;
119 LOC_EXPORT
const char* loc_writer_get_description(struct loc_writer
* writer
) {
120 return loc_stringpool_get(writer
->pool
, writer
->description
);
123 LOC_EXPORT
int loc_writer_set_description(struct loc_writer
* writer
, const char* description
) {
124 // Add the string to the string pool
125 off_t offset
= loc_stringpool_add(writer
->pool
, description
);
129 writer
->description
= offset
;
133 static int __loc_as_cmp(const void* as1
, const void* as2
) {
134 return loc_as_cmp(*(struct loc_as
**)as1
, *(struct loc_as
**)as2
);
137 LOC_EXPORT
int loc_writer_add_as(struct loc_writer
* writer
, struct loc_as
** as
, uint32_t number
) {
138 int r
= loc_as_new(writer
->ctx
, as
, number
);
142 // We have a new AS to add
146 writer
->as
= realloc(writer
->as
, sizeof(*writer
->as
) * writer
->as_count
);
150 // Add as last element
151 writer
->as
[writer
->as_count
- 1] = loc_as_ref(*as
);
154 qsort(writer
->as
, writer
->as_count
, sizeof(*writer
->as
), __loc_as_cmp
);
159 LOC_EXPORT
int loc_writer_add_network(struct loc_writer
* writer
, struct loc_network
** network
, const char* string
) {
162 // Create a new network object
163 r
= loc_network_new_from_string(writer
->ctx
, network
, string
);
167 // Add it to the local tree
168 return loc_network_tree_add_network(writer
->networks
, *network
);
171 static void make_magic(struct loc_writer
* writer
, struct loc_database_magic
* magic
) {
173 for (unsigned int i
= 0; i
< strlen(LOC_DATABASE_MAGIC
); i
++)
174 magic
->magic
[i
] = LOC_DATABASE_MAGIC
[i
];
177 magic
->version
= htobe16(LOC_DATABASE_VERSION
);
180 static void align_page_boundary(off_t
* offset
, FILE* f
) {
181 // Move to next page boundary
182 while (*offset
% LOC_DATABASE_PAGE_SIZE
> 0)
183 *offset
+= fwrite("", 1, 1, f
);
186 static int loc_database_write_pool(struct loc_writer
* writer
,
187 struct loc_database_header_v0
* header
, off_t
* offset
, FILE* f
) {
188 // Save the offset of the pool section
189 DEBUG(writer
->ctx
, "Pool starts at %jd bytes\n", *offset
);
190 header
->pool_offset
= htobe32(*offset
);
193 size_t pool_length
= loc_stringpool_write(writer
->pool
, f
);
194 *offset
+= pool_length
;
196 DEBUG(writer
->ctx
, "Pool has a length of %zu bytes\n", pool_length
);
197 header
->pool_length
= htobe32(pool_length
);
202 static int loc_database_write_as_section(struct loc_writer
* writer
,
203 struct loc_database_header_v0
* header
, off_t
* offset
, FILE* f
) {
204 DEBUG(writer
->ctx
, "AS section starts at %jd bytes\n", *offset
);
205 header
->as_offset
= htobe32(*offset
);
207 size_t as_length
= 0;
209 struct loc_database_as_v0 as
;
210 for (unsigned int i
= 0; i
< writer
->as_count
; i
++) {
211 // Convert AS into database format
212 loc_as_to_database_v0(writer
->as
[i
], writer
->pool
, &as
);
215 *offset
+= fwrite(&as
, 1, sizeof(as
), f
);
216 as_length
+= sizeof(as
);
219 DEBUG(writer
->ctx
, "AS section has a length of %zu bytes\n", as_length
);
220 header
->as_length
= htobe32(as_length
);
222 align_page_boundary(offset
, f
);
228 TAILQ_ENTRY(node
) nodes
;
230 struct loc_network_tree_node
* node
;
232 // Indices of the child nodes
237 static struct node
* make_node(struct loc_network_tree_node
* node
) {
238 struct node
* n
= malloc(sizeof(*n
));
242 n
->node
= loc_network_tree_node_ref(node
);
243 n
->index_zero
= n
->index_one
= 0;
248 static void free_node(struct node
* node
) {
249 loc_network_tree_node_unref(node
->node
);
255 TAILQ_ENTRY(network
) networks
;
257 struct loc_network
* network
;
260 static struct network
* make_network(struct loc_network
* network
) {
261 struct network
* n
= malloc(sizeof(*n
));
265 n
->network
= loc_network_ref(network
);
270 static void free_network(struct network
* network
) {
271 loc_network_unref(network
->network
);
276 static int loc_database_write_networks(struct loc_writer
* writer
,
277 struct loc_database_header_v0
* header
, off_t
* offset
, FILE* f
) {
278 // Write the network tree
279 DEBUG(writer
->ctx
, "Network tree starts at %jd bytes\n", *offset
);
280 header
->network_tree_offset
= htobe32(*offset
);
282 size_t network_tree_length
= 0;
283 size_t network_data_length
= 0;
286 struct node
* child_node
;
289 uint32_t network_index
= 0;
291 struct loc_database_network_v0 db_network
;
292 struct loc_database_network_node_v0 db_node
;
294 // Initialize queue for nodes
295 TAILQ_HEAD(node_t
, node
) nodes
;
298 // Initialize queue for networks
299 TAILQ_HEAD(network_t
, network
) networks
;
300 TAILQ_INIT(&networks
);
303 struct loc_network_tree_node
* root
= loc_network_tree_get_root(writer
->networks
);
304 node
= make_node(root
);
306 TAILQ_INSERT_TAIL(&nodes
, node
, nodes
);
308 while (!TAILQ_EMPTY(&nodes
)) {
309 // Pop first node in list
310 node
= TAILQ_FIRST(&nodes
);
311 TAILQ_REMOVE(&nodes
, node
, nodes
);
313 DEBUG(writer
->ctx
, "Processing node %p\n", node
);
316 struct loc_network_tree_node
* node_zero
= loc_network_tree_node_get(node
->node
, 0);
318 node
->index_zero
= ++index
;
320 child_node
= make_node(node_zero
);
321 loc_network_tree_node_unref(node_zero
);
323 TAILQ_INSERT_TAIL(&nodes
, child_node
, nodes
);
326 struct loc_network_tree_node
* node_one
= loc_network_tree_node_get(node
->node
, 1);
328 node
->index_one
= ++index
;
330 child_node
= make_node(node_one
);
331 loc_network_tree_node_unref(node_one
);
333 TAILQ_INSERT_TAIL(&nodes
, child_node
, nodes
);
336 // Prepare what we are writing to disk
337 if (loc_network_tree_node_is_leaf(node
->node
)) {
338 struct loc_network
* network
= loc_network_tree_node_get_network(node
->node
);
340 // Append network to be written out later
341 struct network
* nw
= make_network(network
);
342 TAILQ_INSERT_TAIL(&networks
, nw
, networks
);
344 db_node
.zero
= htobe32(0xffffffff);
345 db_node
.one
= htobe32(network_index
++);
347 loc_network_unref(network
);
349 db_node
.zero
= htobe32(node
->index_zero
);
350 db_node
.one
= htobe32(node
->index_one
);
353 // Write the current node
354 DEBUG(writer
->ctx
, "Writing node %p (0 = %d, 1 = %d)\n",
355 node
, node
->index_zero
, node
->index_one
);
357 *offset
+= fwrite(&db_node
, 1, sizeof(db_node
), f
);
358 network_tree_length
+= sizeof(db_node
);
363 loc_network_tree_node_unref(root
);
365 header
->network_tree_length
= htobe32(network_tree_length
);
367 align_page_boundary(offset
, f
);
369 DEBUG(writer
->ctx
, "Networks data section starts at %jd bytes\n", *offset
);
370 header
->network_data_offset
= htobe32(*offset
);
372 // We have now written the entire tree and have all networks
373 // in a queue in order as they are indexed
374 while (!TAILQ_EMPTY(&networks
)) {
375 struct network
* nw
= TAILQ_FIRST(&networks
);
376 TAILQ_REMOVE(&networks
, nw
, networks
);
378 // Prepare what we are writing to disk
379 int r
= loc_network_to_database_v0(nw
->network
, &db_network
);
383 *offset
+= fwrite(&db_network
, 1, sizeof(db_network
), f
);
384 network_data_length
+= sizeof(db_network
);
389 header
->network_data_length
= htobe32(network_data_length
);
391 align_page_boundary(offset
, f
);
396 LOC_EXPORT
int loc_writer_write(struct loc_writer
* writer
, FILE* f
) {
397 struct loc_database_magic magic
;
398 make_magic(writer
, &magic
);
401 struct loc_database_header_v0 header
;
402 header
.vendor
= htobe32(writer
->vendor
);
403 header
.description
= htobe32(writer
->description
);
405 time_t now
= time(NULL
);
406 header
.created_at
= htobe64(now
);
411 // Start writing at the beginning of the file
412 r
= fseek(f
, 0, SEEK_SET
);
417 offset
+= fwrite(&magic
, 1, sizeof(magic
), f
);
419 // Skip the space we need to write the header later
420 r
= fseek(f
, sizeof(header
), SEEK_CUR
);
422 DEBUG(writer
->ctx
, "Could not seek to position after header\n");
425 offset
+= sizeof(header
);
427 align_page_boundary(&offset
, f
);
430 r
= loc_database_write_as_section(writer
, &header
, &offset
, f
);
434 // Write all networks
435 r
= loc_database_write_networks(writer
, &header
, &offset
, f
);
440 r
= loc_database_write_pool(writer
, &header
, &offset
, f
);
445 r
= fseek(f
, sizeof(magic
), SEEK_SET
);
449 offset
+= fwrite(&header
, 1, sizeof(header
), f
);