]>
git.ipfire.org Git - people/ms/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 if (self
->family
> other
->family
)
448 else if (self
->family
< other
->family
)
452 int r
= in6_addr_cmp(&self
->first_address
, &other
->first_address
);
457 if (self
->prefix
> other
->prefix
)
459 else if (self
->prefix
< other
->prefix
)
462 // Both networks are equal
466 LOC_EXPORT
int loc_network_eq(struct loc_network
* self
, struct loc_network
* other
) {
467 // Family must be the same
468 if (self
->family
!= other
->family
)
471 // The start address must be the same
472 if (in6_addr_cmp(&self
->first_address
, &other
->first_address
) != 0)
475 // The prefix length must be the same
476 if (self
->prefix
!= other
->prefix
)
482 LOC_EXPORT
int loc_network_gt(struct loc_network
* self
, struct loc_network
* other
) {
483 // Families must match
484 if (self
->family
!= other
->family
)
487 int r
= in6_addr_cmp(&self
->first_address
, &other
->first_address
);
502 if (self
->prefix
> other
->prefix
)
509 LOC_EXPORT
int loc_network_overlaps(struct loc_network
* self
, struct loc_network
* other
) {
510 if (loc_network_match_address(self
, &other
->first_address
) == 0)
513 if (loc_network_match_address(self
, &other
->last_address
) == 0)
516 if (loc_network_match_address(other
, &self
->first_address
) == 0)
519 if (loc_network_match_address(other
, &self
->last_address
) == 0)
525 LOC_EXPORT
int loc_network_is_subnet(struct loc_network
* self
, struct loc_network
* other
) {
527 if (self
->family
!= other
->family
)
530 // The prefix must be smaller (this avoids the more complex comparisons later)
531 if (self
->prefix
> other
->prefix
)
534 // If the start address of the other network is smaller than this network,
535 // it cannot be a subnet.
536 if (in6_addr_cmp(&self
->first_address
, &other
->first_address
) > 0)
539 // If the end address of the other network is greater than this network,
540 // it cannot be a subnet.
541 if (in6_addr_cmp(&self
->last_address
, &other
->last_address
) < 0)
547 LOC_EXPORT
int loc_network_subnets(struct loc_network
* network
,
548 struct loc_network
** subnet1
, struct loc_network
** subnet2
) {
554 unsigned int prefix
= network
->prefix
+ 1;
556 // Check if the new prefix is valid
557 if (valid_prefix(&network
->first_address
, prefix
))
560 // Create the first half of the network
561 r
= loc_network_new(network
->ctx
, subnet1
, &network
->first_address
, prefix
);
565 // The next subnet starts after the first one
566 struct in6_addr first_address
= address_increment(&(*subnet1
)->last_address
);
568 // Create the second half of the network
569 r
= loc_network_new(network
->ctx
, subnet2
, &first_address
, prefix
);
574 const char* country_code
= loc_network_get_country_code(network
);
576 loc_network_set_country_code(*subnet1
, country_code
);
577 loc_network_set_country_code(*subnet2
, country_code
);
581 uint32_t asn
= loc_network_get_asn(network
);
583 loc_network_set_asn(*subnet1
, asn
);
584 loc_network_set_asn(*subnet2
, asn
);
590 static int __loc_network_exclude(struct loc_network
* network
,
591 struct loc_network
* other
, struct loc_network_list
* list
) {
592 struct loc_network
* subnet1
= NULL
;
593 struct loc_network
* subnet2
= NULL
;
595 int r
= loc_network_subnets(network
, &subnet1
, &subnet2
);
599 if (loc_network_eq(other
, subnet1
)) {
600 r
= loc_network_list_push(list
, subnet2
);
604 } else if (loc_network_eq(other
, subnet2
)) {
605 r
= loc_network_list_push(list
, subnet1
);
609 } else if (loc_network_is_subnet(subnet1
, other
)) {
610 r
= loc_network_list_push(list
, subnet2
);
614 r
= __loc_network_exclude(subnet1
, other
, list
);
618 } else if (loc_network_is_subnet(subnet2
, other
)) {
619 r
= loc_network_list_push(list
, subnet1
);
623 r
= __loc_network_exclude(subnet2
, other
, list
);
628 ERROR(network
->ctx
, "We should never get here\n");
635 loc_network_unref(subnet1
);
638 loc_network_unref(subnet2
);
643 LOC_EXPORT
struct loc_network_list
* loc_network_exclude(
644 struct loc_network
* self
, struct loc_network
* other
) {
645 struct loc_network_list
* list
;
648 char* n1
= loc_network_str(self
);
649 char* n2
= loc_network_str(other
);
651 DEBUG(self
->ctx
, "Returning %s excluding %s...\n", n1
, n2
);
658 if (self
->family
!= other
->family
) {
659 DEBUG(self
->ctx
, "Family mismatch\n");
664 // Other must be a subnet of self
665 if (!loc_network_is_subnet(self
, other
)) {
666 DEBUG(self
->ctx
, "Network %p is not contained in network %p\n", other
, self
);
671 // We cannot perform this operation if both networks equal
672 if (loc_network_eq(self
, other
)) {
673 DEBUG(self
->ctx
, "Networks %p and %p are equal\n", self
, other
);
678 // Create a new list with the result
679 int r
= loc_network_list_new(self
->ctx
, &list
);
681 ERROR(self
->ctx
, "Could not create network list: %d\n", r
);
685 r
= __loc_network_exclude(self
, other
, list
);
687 loc_network_list_unref(list
);
696 LOC_EXPORT
struct loc_network_list
* loc_network_exclude_list(
697 struct loc_network
* network
, struct loc_network_list
* list
) {
698 struct loc_network_list
* to_check
;
700 // Create a new list with all networks to look at
701 int r
= loc_network_list_new(network
->ctx
, &to_check
);
705 struct loc_network
* subnet
= NULL
;
706 struct loc_network_list
* subnets
= NULL
;
708 for (unsigned int i
= 0; i
< loc_network_list_size(list
); i
++) {
709 subnet
= loc_network_list_get(list
, i
);
711 // Find all excluded networks
712 struct loc_network_list
* excluded
= loc_network_exclude(network
, subnet
);
714 // Add them all to the "to check" list
715 loc_network_list_merge(to_check
, excluded
);
716 loc_network_list_unref(excluded
);
720 loc_network_unref(subnet
);
723 r
= loc_network_list_new(network
->ctx
, &subnets
);
725 loc_network_list_unref(to_check
);
729 while (!loc_network_list_empty(to_check
)) {
730 struct loc_network
* subnet_to_check
= loc_network_list_pop(to_check
);
732 // Marks whether this subnet passed all checks
735 for (unsigned int i
= 0; i
< loc_network_list_size(list
); i
++) {
736 subnet
= loc_network_list_get(list
, i
);
738 // Drop this subnet if is is already in list
739 if (loc_network_eq(subnet_to_check
, subnet
)) {
741 loc_network_unref(subnet
);
745 // Drop this subnet if is a subnet of another subnet
746 if (loc_network_is_subnet(subnet_to_check
, subnet
)) {
748 loc_network_unref(subnet
);
752 // Break it down if it overlaps
753 if (loc_network_overlaps(subnet_to_check
, subnet
)) {
756 struct loc_network_list
* excluded
= loc_network_exclude(subnet_to_check
, subnet
);
758 loc_network_list_merge(to_check
, excluded
);
759 loc_network_list_unref(excluded
);
762 loc_network_unref(subnet
);
766 loc_network_unref(subnet
);
770 r
= loc_network_list_push(subnets
, subnet_to_check
);
773 loc_network_unref(subnet_to_check
);
776 loc_network_list_unref(to_check
);
779 loc_network_list_sort(subnets
);
784 LOC_EXPORT
int loc_network_to_database_v1(struct loc_network
* network
, struct loc_database_network_v1
* dbobj
) {
786 loc_country_code_copy(dbobj
->country_code
, network
->country_code
);
789 dbobj
->asn
= htobe32(network
->asn
);
792 dbobj
->flags
= htobe16(network
->flags
);
797 LOC_EXPORT
int loc_network_new_from_database_v1(struct loc_ctx
* ctx
, struct loc_network
** network
,
798 struct in6_addr
* address
, unsigned int prefix
, const struct loc_database_network_v1
* dbobj
) {
799 char country_code
[3] = "\0\0";
801 int r
= loc_network_new(ctx
, network
, address
, prefix
);
803 ERROR(ctx
, "Could not allocate a new network: %s", strerror(-r
));
807 // Import country code
808 loc_country_code_copy(country_code
, dbobj
->country_code
);
810 r
= loc_network_set_country_code(*network
, country_code
);
812 ERROR(ctx
, "Could not set country code: %s\n", country_code
);
817 uint32_t asn
= be32toh(dbobj
->asn
);
818 r
= loc_network_set_asn(*network
, asn
);
820 ERROR(ctx
, "Could not set ASN: %d\n", asn
);
825 int flags
= be16toh(dbobj
->flags
);
826 r
= loc_network_set_flag(*network
, flags
);
828 ERROR(ctx
, "Could not set flags: %d\n", flags
);
835 struct loc_network_tree
{
839 struct loc_network_tree_node
* root
;
842 struct loc_network_tree_node
{
846 struct loc_network_tree_node
* zero
;
847 struct loc_network_tree_node
* one
;
849 struct loc_network
* network
;
852 int loc_network_tree_new(struct loc_ctx
* ctx
, struct loc_network_tree
** tree
) {
853 struct loc_network_tree
* t
= calloc(1, sizeof(*t
));
857 t
->ctx
= loc_ref(ctx
);
860 // Create the root node
861 int r
= loc_network_tree_node_new(ctx
, &t
->root
);
863 loc_network_tree_unref(t
);
867 DEBUG(t
->ctx
, "Network tree allocated at %p\n", t
);
872 struct loc_network_tree_node
* loc_network_tree_get_root(struct loc_network_tree
* tree
) {
873 return loc_network_tree_node_ref(tree
->root
);
876 static struct loc_network_tree_node
* loc_network_tree_get_node(struct loc_network_tree_node
* node
, int path
) {
877 struct loc_network_tree_node
** n
;
884 // If the desired node doesn't exist, yet, we will create it
886 int r
= loc_network_tree_node_new(node
->ctx
, n
);
894 static struct loc_network_tree_node
* loc_network_tree_get_path(struct loc_network_tree
* tree
, const struct in6_addr
* address
, unsigned int prefix
) {
895 struct loc_network_tree_node
* node
= tree
->root
;
897 for (unsigned int i
= 0; i
< prefix
; i
++) {
898 // Check if the ith bit is one or zero
899 node
= loc_network_tree_get_node(node
, in6_addr_get_bit(address
, i
));
905 static int __loc_network_tree_walk(struct loc_ctx
* ctx
, struct loc_network_tree_node
* node
,
906 int(*filter_callback
)(struct loc_network
* network
, void* data
),
907 int(*callback
)(struct loc_network
* network
, void* data
), void* data
) {
910 // Finding a network ends the walk here
912 if (filter_callback
) {
913 int f
= filter_callback(node
->network
, data
);
917 // Skip network if filter function returns value greater than zero
922 r
= callback(node
->network
, data
);
927 // Walk down on the left side of the tree first
929 r
= __loc_network_tree_walk(ctx
, node
->zero
, filter_callback
, callback
, data
);
934 // Then walk on the other side
936 r
= __loc_network_tree_walk(ctx
, node
->one
, filter_callback
, callback
, data
);
944 int loc_network_tree_walk(struct loc_network_tree
* tree
,
945 int(*filter_callback
)(struct loc_network
* network
, void* data
),
946 int(*callback
)(struct loc_network
* network
, void* data
), void* data
) {
947 return __loc_network_tree_walk(tree
->ctx
, tree
->root
, filter_callback
, callback
, data
);
950 static void loc_network_tree_free(struct loc_network_tree
* tree
) {
951 DEBUG(tree
->ctx
, "Releasing network tree at %p\n", tree
);
953 loc_network_tree_node_unref(tree
->root
);
955 loc_unref(tree
->ctx
);
959 struct loc_network_tree
* loc_network_tree_unref(struct loc_network_tree
* tree
) {
960 if (--tree
->refcount
> 0)
963 loc_network_tree_free(tree
);
967 static int __loc_network_tree_dump(struct loc_network
* network
, void* data
) {
968 DEBUG(network
->ctx
, "Dumping network at %p\n", network
);
970 char* s
= loc_network_str(network
);
974 INFO(network
->ctx
, "%s\n", s
);
980 int loc_network_tree_dump(struct loc_network_tree
* tree
) {
981 DEBUG(tree
->ctx
, "Dumping network tree at %p\n", tree
);
983 return loc_network_tree_walk(tree
, NULL
, __loc_network_tree_dump
, NULL
);
986 int loc_network_tree_add_network(struct loc_network_tree
* tree
, struct loc_network
* network
) {
987 DEBUG(tree
->ctx
, "Adding network %p to tree %p\n", network
, tree
);
989 struct loc_network_tree_node
* node
= loc_network_tree_get_path(tree
,
990 &network
->first_address
, network
->prefix
);
992 ERROR(tree
->ctx
, "Could not find a node\n");
996 // Check if node has not been set before
998 DEBUG(tree
->ctx
, "There is already a network at this path\n");
1002 // Point node to the network
1003 node
->network
= loc_network_ref(network
);
1008 static int __loc_network_tree_count(struct loc_network
* network
, void* data
) {
1009 size_t* counter
= (size_t*)data
;
1011 // Increase the counter for each network
1017 size_t loc_network_tree_count_networks(struct loc_network_tree
* tree
) {
1020 int r
= loc_network_tree_walk(tree
, NULL
, __loc_network_tree_count
, &counter
);
1027 static size_t __loc_network_tree_count_nodes(struct loc_network_tree_node
* node
) {
1031 counter
+= __loc_network_tree_count_nodes(node
->zero
);
1034 counter
+= __loc_network_tree_count_nodes(node
->one
);
1039 size_t loc_network_tree_count_nodes(struct loc_network_tree
* tree
) {
1040 return __loc_network_tree_count_nodes(tree
->root
);
1043 int loc_network_tree_node_new(struct loc_ctx
* ctx
, struct loc_network_tree_node
** node
) {
1044 struct loc_network_tree_node
* n
= calloc(1, sizeof(*n
));
1048 n
->ctx
= loc_ref(ctx
);
1051 n
->zero
= n
->one
= NULL
;
1053 DEBUG(n
->ctx
, "Network node allocated at %p\n", n
);
1058 struct loc_network_tree_node
* loc_network_tree_node_ref(struct loc_network_tree_node
* node
) {
1065 static void loc_network_tree_node_free(struct loc_network_tree_node
* node
) {
1066 DEBUG(node
->ctx
, "Releasing network node at %p\n", node
);
1069 loc_network_unref(node
->network
);
1072 loc_network_tree_node_unref(node
->zero
);
1075 loc_network_tree_node_unref(node
->one
);
1077 loc_unref(node
->ctx
);
1081 struct loc_network_tree_node
* loc_network_tree_node_unref(struct loc_network_tree_node
* node
) {
1085 if (--node
->refcount
> 0)
1088 loc_network_tree_node_free(node
);
1092 struct loc_network_tree_node
* loc_network_tree_node_get(struct loc_network_tree_node
* node
, unsigned int index
) {
1101 return loc_network_tree_node_ref(node
);
1104 int loc_network_tree_node_is_leaf(struct loc_network_tree_node
* node
) {
1105 return (!!node
->network
);
1108 struct loc_network
* loc_network_tree_node_get_network(struct loc_network_tree_node
* node
) {
1109 return loc_network_ref(node
->network
);