]>
git.ipfire.org Git - location/libloc.git/blob - src/network.c
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>
28 #include <loc/libloc.h>
29 #include <loc/compat.h>
30 #include <loc/country.h>
31 #include <loc/network.h>
32 #include <loc/network-list.h>
33 #include <loc/private.h>
40 struct in6_addr first_address
;
41 struct in6_addr last_address
;
46 enum loc_network_flags flags
;
49 static int valid_prefix(struct in6_addr
* address
, unsigned int prefix
) {
50 // The prefix cannot be larger than 128 bits
54 // And the prefix cannot be zero
58 // For IPv4-mapped addresses the prefix has to be 96 or lager
59 if (IN6_IS_ADDR_V4MAPPED(address
) && prefix
<= 96)
65 static struct in6_addr
prefix_to_bitmask(unsigned int prefix
) {
66 struct in6_addr bitmask
;
68 for (unsigned int i
= 0; i
< 16; i
++)
69 bitmask
.s6_addr
[i
] = 0;
71 for (int i
= prefix
, j
= 0; i
> 0; i
-= 8, j
++) {
73 bitmask
.s6_addr
[j
] = 0xff;
75 bitmask
.s6_addr
[j
] = 0xff << (8 - i
);
81 static struct in6_addr
make_first_address(const struct in6_addr
* address
, const struct in6_addr
* bitmask
) {
84 // Perform bitwise AND
85 for (unsigned int i
= 0; i
< 4; i
++)
86 a
.s6_addr32
[i
] = address
->s6_addr32
[i
] & bitmask
->s6_addr32
[i
];
91 static struct in6_addr
make_last_address(const struct in6_addr
* address
, const struct in6_addr
* bitmask
) {
95 for (unsigned int i
= 0; i
< 4; i
++)
96 a
.s6_addr32
[i
] = address
->s6_addr32
[i
] | ~bitmask
->s6_addr32
[i
];
101 static struct in6_addr
address_increment(const struct in6_addr
* address
) {
102 struct in6_addr a
= *address
;
104 for (int octet
= 15; octet
>= 0; octet
--) {
105 if (a
.s6_addr
[octet
] < 255) {
109 a
.s6_addr
[octet
] = 0;
116 LOC_EXPORT
int loc_network_new(struct loc_ctx
* ctx
, struct loc_network
** network
,
117 struct in6_addr
* address
, unsigned int prefix
) {
118 // Address cannot be unspecified
119 if (IN6_IS_ADDR_UNSPECIFIED(address
)) {
120 DEBUG(ctx
, "Start address is unspecified\n");
124 // Address cannot be loopback
125 if (IN6_IS_ADDR_LOOPBACK(address
)) {
126 DEBUG(ctx
, "Start address is loopback address\n");
130 // Address cannot be link-local
131 if (IN6_IS_ADDR_LINKLOCAL(address
)) {
132 DEBUG(ctx
, "Start address cannot be link-local\n");
136 // Address cannot be site-local
137 if (IN6_IS_ADDR_SITELOCAL(address
)) {
138 DEBUG(ctx
, "Start address cannot be site-local\n");
142 // Validate the prefix
143 if (valid_prefix(address
, prefix
) != 0) {
144 DEBUG(ctx
, "Invalid prefix: %u\n", prefix
);
148 struct loc_network
* n
= calloc(1, sizeof(*n
));
152 n
->ctx
= loc_ref(ctx
);
158 // Convert the prefix into a bitmask
159 struct in6_addr bitmask
= prefix_to_bitmask(n
->prefix
);
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
);
166 if (IN6_IS_ADDR_V4MAPPED(&n
->first_address
))
169 n
->family
= AF_INET6
;
171 DEBUG(n
->ctx
, "Network allocated at %p\n", n
);
176 LOC_EXPORT
int loc_network_new_from_string(struct loc_ctx
* ctx
, struct loc_network
** network
,
177 const char* address_string
) {
178 struct in6_addr first_address
;
180 unsigned int prefix
= 128;
183 DEBUG(ctx
, "Attempting to parse network %s\n", address_string
);
185 // Make a copy of the string to work on it
186 char* buffer
= strdup(address_string
);
187 address_string
= prefix_string
= buffer
;
189 // Split address and prefix
190 address_string
= strsep(&prefix_string
, "/");
192 DEBUG(ctx
, " Split into address = %s, prefix = %s\n", address_string
, prefix_string
);
195 r
= loc_parse_address(ctx
, address_string
, &first_address
);
197 DEBUG(ctx
, "The address could not be parsed\n");
201 // If a prefix was given, we will try to parse it
203 // Convert prefix to integer
204 prefix
= strtol(prefix_string
, NULL
, 10);
207 DEBUG(ctx
, "The prefix was not parsable: %s\n", prefix_string
);
211 // Map the prefix to IPv6 if needed
212 if (IN6_IS_ADDR_V4MAPPED(&first_address
))
217 // Free temporary buffer
220 // Exit if the parsing was unsuccessful
224 // Create a new network
225 return loc_network_new(ctx
, network
, &first_address
, prefix
);
228 LOC_EXPORT
struct loc_network
* loc_network_ref(struct loc_network
* network
) {
234 static void loc_network_free(struct loc_network
* network
) {
235 DEBUG(network
->ctx
, "Releasing network at %p\n", network
);
237 loc_unref(network
->ctx
);
241 LOC_EXPORT
struct loc_network
* loc_network_unref(struct loc_network
* network
) {
245 if (--network
->refcount
> 0)
248 loc_network_free(network
);
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
);
260 static int format_ipv4_address(const struct in6_addr
* address
, char* string
, size_t length
) {
261 struct in_addr ipv4_address
;
262 ipv4_address
.s_addr
= address
->s6_addr32
[3];
264 const char* ret
= inet_ntop(AF_INET
, &ipv4_address
, string
, length
);
271 LOC_EXPORT
char* loc_network_str(struct loc_network
* network
) {
273 const size_t length
= INET6_ADDRSTRLEN
+ 4;
275 char* string
= malloc(length
);
279 unsigned int prefix
= network
->prefix
;
281 switch (network
->family
) {
283 r
= format_ipv6_address(&network
->first_address
, string
, length
);
287 r
= format_ipv4_address(&network
->first_address
, string
, length
);
297 ERROR(network
->ctx
, "Could not convert network to string: %s\n", strerror(errno
));
304 sprintf(string
+ strlen(string
), "/%u", prefix
);
309 LOC_EXPORT
int loc_network_address_family(struct loc_network
* network
) {
310 return network
->family
;
313 LOC_EXPORT
unsigned int loc_network_prefix(struct loc_network
* network
) {
314 switch (network
->family
) {
316 return network
->prefix
;
319 return network
->prefix
- 96;
325 static char* loc_network_format_address(struct loc_network
* network
, const struct in6_addr
* address
) {
326 const size_t length
= INET6_ADDRSTRLEN
;
328 char* string
= malloc(length
);
334 switch (network
->family
) {
336 r
= format_ipv6_address(address
, string
, length
);
340 r
= format_ipv4_address(address
, string
, length
);
349 ERROR(network
->ctx
, "Could not format IP address to string: %s\n", strerror(errno
));
358 LOC_EXPORT
const struct in6_addr
* loc_network_get_first_address(struct loc_network
* network
) {
359 return &network
->first_address
;
362 LOC_EXPORT
char* loc_network_format_first_address(struct loc_network
* network
) {
363 return loc_network_format_address(network
, &network
->first_address
);
366 LOC_EXPORT
const struct in6_addr
* loc_network_get_last_address(struct loc_network
* network
) {
367 return &network
->last_address
;
370 LOC_EXPORT
char* loc_network_format_last_address(struct loc_network
* network
) {
371 return loc_network_format_address(network
, &network
->last_address
);
374 LOC_EXPORT
int loc_network_match_address(struct loc_network
* network
, const struct in6_addr
* address
) {
375 // Address must be larger than the start address
376 if (in6_addr_cmp(&network
->first_address
, address
) > 0)
379 // Address must be smaller than the last address
380 if (in6_addr_cmp(&network
->last_address
, address
) < 0)
383 // The address is inside this network
387 LOC_EXPORT
const char* loc_network_get_country_code(struct loc_network
* network
) {
388 return network
->country_code
;
391 LOC_EXPORT
int loc_network_set_country_code(struct loc_network
* network
, const char* country_code
) {
392 // Set empty country code
393 if (!country_code
|| !*country_code
) {
394 *network
->country_code
= '\0';
398 // Check country code
399 if (!loc_country_code_is_valid(country_code
))
402 loc_country_code_copy(network
->country_code
, country_code
);
407 LOC_EXPORT
int loc_network_match_country_code(struct loc_network
* network
, const char* country_code
) {
408 // Check country code
409 if (!loc_country_code_is_valid(country_code
))
412 return (network
->country_code
[0] == country_code
[0])
413 && (network
->country_code
[1] == country_code
[1]);
416 LOC_EXPORT
uint32_t loc_network_get_asn(struct loc_network
* network
) {
420 LOC_EXPORT
int loc_network_set_asn(struct loc_network
* network
, uint32_t asn
) {
426 LOC_EXPORT
int loc_network_match_asn(struct loc_network
* network
, uint32_t asn
) {
427 return network
->asn
== asn
;
430 LOC_EXPORT
int loc_network_has_flag(struct loc_network
* network
, uint32_t flag
) {
431 return network
->flags
& flag
;
434 LOC_EXPORT
int loc_network_set_flag(struct loc_network
* network
, uint32_t flag
) {
435 network
->flags
|= flag
;
440 LOC_EXPORT
int loc_network_match_flag(struct loc_network
* network
, uint32_t flag
) {
441 return loc_network_has_flag(network
, flag
);
444 LOC_EXPORT
int loc_network_cmp(struct loc_network
* self
, struct loc_network
* other
) {
446 int r
= in6_addr_cmp(&self
->first_address
, &other
->first_address
);
451 if (self
->prefix
> other
->prefix
)
453 else if (self
->prefix
< other
->prefix
)
456 // Both networks are equal
460 LOC_EXPORT
int loc_network_overlaps(struct loc_network
* self
, struct loc_network
* other
) {
461 // Either of the start addresses must be in the other subnet
462 if (loc_network_match_address(self
, &other
->first_address
))
465 if (loc_network_match_address(other
, &self
->first_address
))
468 // Or either of the end addresses is in the other subnet
469 if (loc_network_match_address(self
, &other
->last_address
))
472 if (loc_network_match_address(other
, &self
->last_address
))
478 LOC_EXPORT
int loc_network_is_subnet(struct loc_network
* self
, struct loc_network
* other
) {
479 // The prefix must be smaller (this avoids the more complex comparisons later)
480 if (self
->prefix
> other
->prefix
)
483 // If the start address of the other network is smaller than this network,
484 // it cannot be a subnet.
485 if (in6_addr_cmp(&self
->first_address
, &other
->first_address
) > 0)
488 // If the end address of the other network is greater than this network,
489 // it cannot be a subnet.
490 if (in6_addr_cmp(&self
->last_address
, &other
->last_address
) < 0)
496 LOC_EXPORT
int loc_network_subnets(struct loc_network
* network
,
497 struct loc_network
** subnet1
, struct loc_network
** subnet2
) {
503 unsigned int prefix
= network
->prefix
+ 1;
505 // Check if the new prefix is valid
506 if (valid_prefix(&network
->first_address
, prefix
))
509 // Create the first half of the network
510 r
= loc_network_new(network
->ctx
, subnet1
, &network
->first_address
, prefix
);
514 // The next subnet starts after the first one
515 struct in6_addr first_address
= address_increment(&(*subnet1
)->last_address
);
517 // Create the second half of the network
518 r
= loc_network_new(network
->ctx
, subnet2
, &first_address
, prefix
);
523 const char* country_code
= loc_network_get_country_code(network
);
525 loc_network_set_country_code(*subnet1
, country_code
);
526 loc_network_set_country_code(*subnet2
, country_code
);
530 uint32_t asn
= loc_network_get_asn(network
);
532 loc_network_set_asn(*subnet1
, asn
);
533 loc_network_set_asn(*subnet2
, asn
);
537 loc_network_set_flag(*subnet1
, network
->flags
);
538 loc_network_set_flag(*subnet2
, network
->flags
);
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
;
548 int r
= loc_network_subnets(network
, &subnet1
, &subnet2
);
552 if (loc_network_cmp(other
, subnet1
) == 0) {
553 r
= loc_network_list_push(list
, subnet2
);
557 } else if (loc_network_cmp(other
, subnet2
) == 0) {
558 r
= loc_network_list_push(list
, subnet1
);
562 } else if (loc_network_is_subnet(subnet1
, other
)) {
563 r
= loc_network_list_push(list
, subnet2
);
567 r
= __loc_network_exclude(subnet1
, other
, list
);
571 } else if (loc_network_is_subnet(subnet2
, other
)) {
572 r
= loc_network_list_push(list
, subnet1
);
576 r
= __loc_network_exclude(subnet2
, other
, list
);
581 ERROR(network
->ctx
, "We should never get here\n");
588 loc_network_unref(subnet1
);
591 loc_network_unref(subnet2
);
596 static int __loc_network_exclude_to_list(struct loc_network
* self
,
597 struct loc_network
* other
, struct loc_network_list
* list
) {
598 // Other must be a subnet of self
599 if (!loc_network_is_subnet(self
, other
)) {
600 DEBUG(self
->ctx
, "Network %p is not contained in network %p\n", other
, self
);
606 // We cannot perform this operation if both networks equal
607 if (loc_network_cmp(self
, other
) == 0) {
608 DEBUG(self
->ctx
, "Networks %p and %p are equal\n", self
, other
);
614 return __loc_network_exclude(self
, other
, list
);
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
;
622 char* n1
= loc_network_str(self
);
623 char* n2
= loc_network_str(other
);
625 DEBUG(self
->ctx
, "Returning %s excluding %s...\n", n1
, n2
);
631 // Create a new list with the result
632 int r
= loc_network_list_new(self
->ctx
, &list
);
634 ERROR(self
->ctx
, "Could not create network list: %d\n", r
);
639 r
= __loc_network_exclude_to_list(self
, other
, list
);
641 loc_network_list_unref(list
);
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
;
654 // Create a new list with all networks to look at
655 int r
= loc_network_list_new(network
->ctx
, &to_check
);
659 struct loc_network
* subnet
= NULL
;
660 struct loc_network_list
* subnets
= NULL
;
662 for (unsigned int i
= 0; i
< loc_network_list_size(list
); i
++) {
663 subnet
= loc_network_list_get(list
, i
);
665 // Find all excluded networks
666 if (!loc_network_list_contains(to_check
, subnet
)) {
667 r
= __loc_network_exclude_to_list(network
, subnet
, to_check
);
669 loc_network_list_unref(to_check
);
670 loc_network_unref(subnet
);
677 loc_network_unref(subnet
);
680 r
= loc_network_list_new(network
->ctx
, &subnets
);
682 loc_network_list_unref(to_check
);
686 off_t smallest_subnet
= 0;
688 while (!loc_network_list_empty(to_check
)) {
689 struct loc_network
* subnet_to_check
= loc_network_list_pop_first(to_check
);
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
);
697 // Marks whether this subnet passed all checks
700 for (unsigned int i
= smallest_subnet
; i
< loc_network_list_size(list
); i
++) {
701 subnet
= loc_network_list_get(list
, i
);
703 // Drop this subnet if is a subnet of another subnet
704 if (loc_network_is_subnet(subnet
, subnet_to_check
)) {
706 loc_network_unref(subnet
);
710 // Break it down if it overlaps
711 if (loc_network_overlaps(subnet
, subnet_to_check
)) {
714 __loc_network_exclude_to_list(subnet_to_check
, subnet
, to_check
);
716 loc_network_unref(subnet
);
720 // If the subnet is strictly greater, we do not need to continue the search
721 r
= loc_network_cmp(subnet
, subnet_to_check
);
723 loc_network_unref(subnet
);
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
733 loc_network_unref(subnet
);
737 r
= loc_network_list_push(subnets
, subnet_to_check
);
740 loc_network_unref(subnet_to_check
);
743 loc_network_list_unref(to_check
);
748 LOC_EXPORT
int loc_network_to_database_v1(struct loc_network
* network
, struct loc_database_network_v1
* dbobj
) {
750 loc_country_code_copy(dbobj
->country_code
, network
->country_code
);
753 dbobj
->asn
= htobe32(network
->asn
);
756 dbobj
->flags
= htobe16(network
->flags
);
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
) {
763 char country_code
[3] = "\0\0";
765 int r
= loc_network_new(ctx
, network
, address
, prefix
);
767 ERROR(ctx
, "Could not allocate a new network: %s", strerror(-r
));
771 // Import country code
772 loc_country_code_copy(country_code
, dbobj
->country_code
);
774 r
= loc_network_set_country_code(*network
, country_code
);
776 ERROR(ctx
, "Could not set country code: %s\n", country_code
);
781 uint32_t asn
= be32toh(dbobj
->asn
);
782 r
= loc_network_set_asn(*network
, asn
);
784 ERROR(ctx
, "Could not set ASN: %d\n", asn
);
789 int flags
= be16toh(dbobj
->flags
);
790 r
= loc_network_set_flag(*network
, flags
);
792 ERROR(ctx
, "Could not set flags: %d\n", flags
);
799 struct loc_network_tree
{
803 struct loc_network_tree_node
* root
;
806 struct loc_network_tree_node
{
810 struct loc_network_tree_node
* zero
;
811 struct loc_network_tree_node
* one
;
813 struct loc_network
* network
;
816 int loc_network_tree_new(struct loc_ctx
* ctx
, struct loc_network_tree
** tree
) {
817 struct loc_network_tree
* t
= calloc(1, sizeof(*t
));
821 t
->ctx
= loc_ref(ctx
);
824 // Create the root node
825 int r
= loc_network_tree_node_new(ctx
, &t
->root
);
827 loc_network_tree_unref(t
);
831 DEBUG(t
->ctx
, "Network tree allocated at %p\n", t
);
836 struct loc_network_tree_node
* loc_network_tree_get_root(struct loc_network_tree
* tree
) {
837 return loc_network_tree_node_ref(tree
->root
);
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
;
848 // If the desired node doesn't exist, yet, we will create it
850 int r
= loc_network_tree_node_new(node
->ctx
, n
);
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
) {
859 struct loc_network_tree_node
* node
= tree
->root
;
861 for (unsigned int i
= 0; i
< prefix
; i
++) {
862 // Check if the ith bit is one or zero
863 node
= loc_network_tree_get_node(node
, in6_addr_get_bit(address
, i
));
869 static int __loc_network_tree_walk(struct loc_ctx
* ctx
, struct loc_network_tree_node
* node
,
870 int(*filter_callback
)(struct loc_network
* network
, void* data
),
871 int(*callback
)(struct loc_network
* network
, void* data
), void* data
) {
874 // Finding a network ends the walk here
876 if (filter_callback
) {
877 int f
= filter_callback(node
->network
, data
);
881 // Skip network if filter function returns value greater than zero
886 r
= callback(node
->network
, data
);
891 // Walk down on the left side of the tree first
893 r
= __loc_network_tree_walk(ctx
, node
->zero
, filter_callback
, callback
, data
);
898 // Then walk on the other side
900 r
= __loc_network_tree_walk(ctx
, node
->one
, filter_callback
, callback
, data
);
908 int loc_network_tree_walk(struct loc_network_tree
* tree
,
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
);
914 static void loc_network_tree_free(struct loc_network_tree
* tree
) {
915 DEBUG(tree
->ctx
, "Releasing network tree at %p\n", tree
);
917 loc_network_tree_node_unref(tree
->root
);
919 loc_unref(tree
->ctx
);
923 struct loc_network_tree
* loc_network_tree_unref(struct loc_network_tree
* tree
) {
924 if (--tree
->refcount
> 0)
927 loc_network_tree_free(tree
);
931 static int __loc_network_tree_dump(struct loc_network
* network
, void* data
) {
932 DEBUG(network
->ctx
, "Dumping network at %p\n", network
);
934 char* s
= loc_network_str(network
);
938 INFO(network
->ctx
, "%s\n", s
);
944 int loc_network_tree_dump(struct loc_network_tree
* tree
) {
945 DEBUG(tree
->ctx
, "Dumping network tree at %p\n", tree
);
947 return loc_network_tree_walk(tree
, NULL
, __loc_network_tree_dump
, NULL
);
950 int loc_network_tree_add_network(struct loc_network_tree
* tree
, struct loc_network
* network
) {
951 DEBUG(tree
->ctx
, "Adding network %p to tree %p\n", network
, tree
);
953 struct loc_network_tree_node
* node
= loc_network_tree_get_path(tree
,
954 &network
->first_address
, network
->prefix
);
956 ERROR(tree
->ctx
, "Could not find a node\n");
960 // Check if node has not been set before
962 DEBUG(tree
->ctx
, "There is already a network at this path\n");
966 // Point node to the network
967 node
->network
= loc_network_ref(network
);
972 static int __loc_network_tree_count(struct loc_network
* network
, void* data
) {
973 size_t* counter
= (size_t*)data
;
975 // Increase the counter for each network
981 size_t loc_network_tree_count_networks(struct loc_network_tree
* tree
) {
984 int r
= loc_network_tree_walk(tree
, NULL
, __loc_network_tree_count
, &counter
);
991 static size_t __loc_network_tree_count_nodes(struct loc_network_tree_node
* node
) {
995 counter
+= __loc_network_tree_count_nodes(node
->zero
);
998 counter
+= __loc_network_tree_count_nodes(node
->one
);
1003 size_t loc_network_tree_count_nodes(struct loc_network_tree
* tree
) {
1004 return __loc_network_tree_count_nodes(tree
->root
);
1007 int loc_network_tree_node_new(struct loc_ctx
* ctx
, struct loc_network_tree_node
** node
) {
1008 struct loc_network_tree_node
* n
= calloc(1, sizeof(*n
));
1012 n
->ctx
= loc_ref(ctx
);
1015 n
->zero
= n
->one
= NULL
;
1017 DEBUG(n
->ctx
, "Network node allocated at %p\n", n
);
1022 struct loc_network_tree_node
* loc_network_tree_node_ref(struct loc_network_tree_node
* node
) {
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
);
1033 loc_network_unref(node
->network
);
1036 loc_network_tree_node_unref(node
->zero
);
1039 loc_network_tree_node_unref(node
->one
);
1041 loc_unref(node
->ctx
);
1045 struct loc_network_tree_node
* loc_network_tree_node_unref(struct loc_network_tree_node
* node
) {
1049 if (--node
->refcount
> 0)
1052 loc_network_tree_node_free(node
);
1056 struct loc_network_tree_node
* loc_network_tree_node_get(struct loc_network_tree_node
* node
, unsigned int index
) {
1065 return loc_network_tree_node_ref(node
);
1068 int loc_network_tree_node_is_leaf(struct loc_network_tree_node
* node
) {
1069 return (!!node
->network
);
1072 struct loc_network
* loc_network_tree_node_get_network(struct loc_network_tree_node
* node
) {
1073 return loc_network_ref(node
->network
);