]>
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/private.h>
39 struct in6_addr first_address
;
40 struct in6_addr last_address
;
45 enum loc_network_flags flags
;
48 static int valid_prefix(struct in6_addr
* address
, unsigned int prefix
) {
49 // The prefix cannot be larger than 128 bits
53 // And the prefix cannot be zero
57 // For IPv4-mapped addresses the prefix has to be 96 or lager
58 if (IN6_IS_ADDR_V4MAPPED(address
) && prefix
<= 96)
64 static struct in6_addr
prefix_to_bitmask(unsigned int prefix
) {
65 struct in6_addr bitmask
;
67 for (unsigned int i
= 0; i
< 16; i
++)
68 bitmask
.s6_addr
[i
] = 0;
70 for (int i
= prefix
, j
= 0; i
> 0; i
-= 8, j
++) {
72 bitmask
.s6_addr
[j
] = 0xff;
74 bitmask
.s6_addr
[j
] = 0xff << (8 - i
);
80 static struct in6_addr
make_first_address(const struct in6_addr
* address
, const struct in6_addr
* bitmask
) {
83 // Perform bitwise AND
84 for (unsigned int i
= 0; i
< 4; i
++)
85 a
.s6_addr32
[i
] = address
->s6_addr32
[i
] & bitmask
->s6_addr32
[i
];
90 static struct in6_addr
make_last_address(const struct in6_addr
* address
, const struct in6_addr
* bitmask
) {
94 for (unsigned int i
= 0; i
< 4; i
++)
95 a
.s6_addr32
[i
] = address
->s6_addr32
[i
] | ~bitmask
->s6_addr32
[i
];
100 static struct in6_addr
address_increment(const struct in6_addr
* address
) {
101 struct in6_addr a
= *address
;
103 for (int octet
= 15; octet
>= 0; octet
--) {
104 if (a
.s6_addr
[octet
] < 255) {
108 a
.s6_addr
[octet
] = 0;
115 LOC_EXPORT
int loc_network_new(struct loc_ctx
* ctx
, struct loc_network
** network
,
116 struct in6_addr
* address
, unsigned int prefix
) {
117 // Address cannot be unspecified
118 if (IN6_IS_ADDR_UNSPECIFIED(address
)) {
119 DEBUG(ctx
, "Start address is unspecified\n");
123 // Address cannot be loopback
124 if (IN6_IS_ADDR_LOOPBACK(address
)) {
125 DEBUG(ctx
, "Start address is loopback address\n");
129 // Address cannot be link-local
130 if (IN6_IS_ADDR_LINKLOCAL(address
)) {
131 DEBUG(ctx
, "Start address cannot be link-local\n");
135 // Address cannot be site-local
136 if (IN6_IS_ADDR_SITELOCAL(address
)) {
137 DEBUG(ctx
, "Start address cannot be site-local\n");
141 // Validate the prefix
142 if (valid_prefix(address
, prefix
) != 0) {
143 DEBUG(ctx
, "Invalid prefix: %u\n", prefix
);
147 struct loc_network
* n
= calloc(1, sizeof(*n
));
151 n
->ctx
= loc_ref(ctx
);
157 // Convert the prefix into a bitmask
158 struct in6_addr bitmask
= prefix_to_bitmask(n
->prefix
);
160 // Store the first and last address in the network
161 n
->first_address
= make_first_address(address
, &bitmask
);
162 n
->last_address
= make_last_address(&n
->first_address
, &bitmask
);
165 if (IN6_IS_ADDR_V4MAPPED(&n
->first_address
))
168 n
->family
= AF_INET6
;
170 DEBUG(n
->ctx
, "Network allocated at %p\n", n
);
175 LOC_EXPORT
int loc_network_new_from_string(struct loc_ctx
* ctx
, struct loc_network
** network
,
176 const char* address_string
) {
177 struct in6_addr first_address
;
179 unsigned int prefix
= 128;
182 DEBUG(ctx
, "Attempting to parse network %s\n", address_string
);
184 // Make a copy of the string to work on it
185 char* buffer
= strdup(address_string
);
186 address_string
= prefix_string
= buffer
;
188 // Split address and prefix
189 address_string
= strsep(&prefix_string
, "/");
191 DEBUG(ctx
, " Split into address = %s, prefix = %s\n", address_string
, prefix_string
);
194 r
= loc_parse_address(ctx
, address_string
, &first_address
);
196 DEBUG(ctx
, "The address could not be parsed\n");
200 // If a prefix was given, we will try to parse it
202 // Convert prefix to integer
203 prefix
= strtol(prefix_string
, NULL
, 10);
206 DEBUG(ctx
, "The prefix was not parsable: %s\n", prefix_string
);
210 // Map the prefix to IPv6 if needed
211 if (IN6_IS_ADDR_V4MAPPED(&first_address
))
216 // Free temporary buffer
219 // Exit if the parsing was unsuccessful
223 // Create a new network
224 return loc_network_new(ctx
, network
, &first_address
, prefix
);
227 LOC_EXPORT
struct loc_network
* loc_network_ref(struct loc_network
* network
) {
233 static void loc_network_free(struct loc_network
* network
) {
234 DEBUG(network
->ctx
, "Releasing network at %p\n", network
);
236 loc_unref(network
->ctx
);
240 LOC_EXPORT
struct loc_network
* loc_network_unref(struct loc_network
* network
) {
244 if (--network
->refcount
> 0)
247 loc_network_free(network
);
251 static int format_ipv6_address(const struct in6_addr
* address
, char* string
, size_t length
) {
252 const char* ret
= inet_ntop(AF_INET6
, address
, string
, length
);
259 static int format_ipv4_address(const struct in6_addr
* address
, char* string
, size_t length
) {
260 struct in_addr ipv4_address
;
261 ipv4_address
.s_addr
= address
->s6_addr32
[3];
263 const char* ret
= inet_ntop(AF_INET
, &ipv4_address
, string
, length
);
270 LOC_EXPORT
char* loc_network_str(struct loc_network
* network
) {
272 const size_t length
= INET6_ADDRSTRLEN
+ 4;
274 char* string
= malloc(length
);
278 unsigned int prefix
= network
->prefix
;
280 switch (network
->family
) {
282 r
= format_ipv6_address(&network
->first_address
, string
, length
);
286 r
= format_ipv4_address(&network
->first_address
, string
, length
);
296 ERROR(network
->ctx
, "Could not convert network to string: %s\n", strerror(errno
));
303 sprintf(string
+ strlen(string
), "/%u", prefix
);
308 LOC_EXPORT
int loc_network_address_family(struct loc_network
* network
) {
309 return network
->family
;
312 static char* loc_network_format_address(struct loc_network
* network
, const struct in6_addr
* address
) {
313 const size_t length
= INET6_ADDRSTRLEN
;
315 char* string
= malloc(length
);
321 switch (network
->family
) {
323 r
= format_ipv6_address(address
, string
, length
);
327 r
= format_ipv4_address(address
, string
, length
);
336 ERROR(network
->ctx
, "Could not format IP address to string: %s\n", strerror(errno
));
345 LOC_EXPORT
char* loc_network_format_first_address(struct loc_network
* network
) {
346 return loc_network_format_address(network
, &network
->first_address
);
349 LOC_EXPORT
char* loc_network_format_last_address(struct loc_network
* network
) {
350 return loc_network_format_address(network
, &network
->last_address
);
353 LOC_EXPORT
int loc_network_match_address(struct loc_network
* network
, const struct in6_addr
* address
) {
354 // Address must be larger than the start address
355 if (in6_addr_cmp(&network
->first_address
, address
) > 0)
358 // Address must be smaller than the last address
359 if (in6_addr_cmp(&network
->last_address
, address
) < 0)
362 // The address is inside this network
366 LOC_EXPORT
const char* loc_network_get_country_code(struct loc_network
* network
) {
367 return network
->country_code
;
370 LOC_EXPORT
int loc_network_set_country_code(struct loc_network
* network
, const char* country_code
) {
371 // Set empty country code
372 if (!country_code
|| !*country_code
) {
373 *network
->country_code
= '\0';
377 // Check country code
378 if (!loc_country_code_is_valid(country_code
))
381 loc_country_code_copy(network
->country_code
, country_code
);
386 LOC_EXPORT
int loc_network_match_country_code(struct loc_network
* network
, const char* country_code
) {
387 // Check country code
388 if (!loc_country_code_is_valid(country_code
))
391 return (network
->country_code
[0] == country_code
[0])
392 && (network
->country_code
[1] == country_code
[1]);
395 LOC_EXPORT
uint32_t loc_network_get_asn(struct loc_network
* network
) {
399 LOC_EXPORT
int loc_network_set_asn(struct loc_network
* network
, uint32_t asn
) {
405 LOC_EXPORT
int loc_network_match_asn(struct loc_network
* network
, uint32_t asn
) {
406 return network
->asn
== asn
;
409 LOC_EXPORT
int loc_network_has_flag(struct loc_network
* network
, uint32_t flag
) {
410 return network
->flags
& flag
;
413 LOC_EXPORT
int loc_network_set_flag(struct loc_network
* network
, uint32_t flag
) {
414 network
->flags
|= flag
;
419 LOC_EXPORT
int loc_network_match_flag(struct loc_network
* network
, uint32_t flag
) {
420 return loc_network_has_flag(network
, flag
);
423 LOC_EXPORT
int loc_network_eq(struct loc_network
* self
, struct loc_network
* other
) {
424 // Family must be the same
425 if (self
->family
!= other
->family
)
428 // The start address must be the same
429 if (in6_addr_cmp(&self
->first_address
, &other
->first_address
) != 0)
432 // The prefix length must be the same
433 if (self
->prefix
!= other
->prefix
)
439 static int loc_network_gt(struct loc_network
* self
, struct loc_network
* other
) {
440 // Families must match
441 if (self
->family
!= other
->family
)
444 int r
= in6_addr_cmp(&self
->first_address
, &other
->first_address
);
459 if (self
->prefix
> other
->prefix
)
466 LOC_EXPORT
int loc_network_overlaps(struct loc_network
* self
, struct loc_network
* other
) {
467 if (loc_network_match_address(self
, &other
->first_address
) == 0)
470 if (loc_network_match_address(self
, &other
->last_address
) == 0)
473 if (loc_network_match_address(other
, &self
->first_address
) == 0)
476 if (loc_network_match_address(other
, &self
->last_address
) == 0)
482 LOC_EXPORT
int loc_network_is_subnet_of(struct loc_network
* self
, struct loc_network
* other
) {
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
struct loc_network_list
* loc_network_subnets(struct loc_network
* network
) {
497 struct loc_network_list
* list
;
500 unsigned int prefix
= network
->prefix
+ 1;
502 // Check if the new prefix is valid
503 if (valid_prefix(&network
->first_address
, prefix
))
506 // Create a new list with the result
507 int r
= loc_network_list_new(network
->ctx
, &list
);
509 ERROR(network
->ctx
, "Could not create network list: %d\n", r
);
513 struct loc_network
* subnet1
= NULL
;
514 struct loc_network
* subnet2
= NULL
;
516 // Create the first half of the network
517 r
= loc_network_new(network
->ctx
, &subnet1
, &network
->first_address
, prefix
);
521 // The next subnet starts after the first one
522 struct in6_addr first_address
= address_increment(&subnet1
->last_address
);
524 // Create the second half of the network
525 r
= loc_network_new(network
->ctx
, &subnet2
, &first_address
, prefix
);
529 // Push the both onto the stack (in reverse order)
530 r
= loc_network_list_push(list
, subnet2
);
534 r
= loc_network_list_push(list
, subnet1
);
538 loc_network_unref(subnet1
);
539 loc_network_unref(subnet2
);
545 loc_network_unref(subnet1
);
548 loc_network_unref(subnet2
);
551 loc_network_list_unref(list
);
556 LOC_EXPORT
struct loc_network_list
* loc_network_exclude(
557 struct loc_network
* self
, struct loc_network
* other
) {
558 struct loc_network_list
* list
;
561 char* n1
= loc_network_str(self
);
562 char* n2
= loc_network_str(other
);
564 DEBUG(self
->ctx
, "Returning %s excluding %s...\n", n1
, n2
);
571 if (self
->family
!= other
->family
) {
572 DEBUG(self
->ctx
, "Family mismatch\n");
577 // Other must be a subnet of self
578 if (!loc_network_is_subnet_of(other
, self
)) {
579 DEBUG(self
->ctx
, "Network %p is not contained in network %p\n", other
, self
);
584 // We cannot perform this operation if both networks equal
585 if (loc_network_eq(self
, other
)) {
586 DEBUG(self
->ctx
, "Networks %p and %p are equal\n", self
, other
);
591 // Create a new list with the result
592 int r
= loc_network_list_new(self
->ctx
, &list
);
594 ERROR(self
->ctx
, "Could not create network list: %d\n", r
);
598 struct loc_network_list
* subnets
= loc_network_subnets(self
);
600 struct loc_network
* subnet1
= NULL
;
601 struct loc_network
* subnet2
= NULL
;
604 // Fetch both subnets
605 subnet1
= loc_network_list_get(subnets
, 0);
606 subnet2
= loc_network_list_get(subnets
, 1);
609 loc_network_list_unref(subnets
);
612 if (loc_network_eq(other
, subnet1
)) {
613 r
= loc_network_list_push(list
, subnet2
);
617 } else if (loc_network_eq(other
, subnet2
)) {
618 r
= loc_network_list_push(list
, subnet1
);
622 } else if (loc_network_is_subnet_of(other
, subnet1
)) {
623 r
= loc_network_list_push(list
, subnet2
);
627 subnets
= loc_network_subnets(subnet1
);
629 } else if (loc_network_is_subnet_of(other
, subnet2
)) {
630 r
= loc_network_list_push(list
, subnet1
);
634 subnets
= loc_network_subnets(subnet2
);
637 ERROR(self
->ctx
, "We should never get here\n");
641 loc_network_unref(subnet1
);
642 loc_network_unref(subnet2
);
646 loc_network_list_dump(list
);
654 loc_network_unref(subnet1
);
657 loc_network_unref(subnet2
);
660 loc_network_list_unref(list
);
665 LOC_EXPORT
int loc_network_to_database_v1(struct loc_network
* network
, struct loc_database_network_v1
* dbobj
) {
667 loc_country_code_copy(dbobj
->country_code
, network
->country_code
);
670 dbobj
->asn
= htobe32(network
->asn
);
673 dbobj
->flags
= htobe16(network
->flags
);
678 LOC_EXPORT
int loc_network_new_from_database_v1(struct loc_ctx
* ctx
, struct loc_network
** network
,
679 struct in6_addr
* address
, unsigned int prefix
, const struct loc_database_network_v1
* dbobj
) {
680 char country_code
[3] = "\0\0";
682 int r
= loc_network_new(ctx
, network
, address
, prefix
);
684 ERROR(ctx
, "Could not allocate a new network: %s", strerror(-r
));
688 // Import country code
689 loc_country_code_copy(country_code
, dbobj
->country_code
);
691 r
= loc_network_set_country_code(*network
, country_code
);
693 ERROR(ctx
, "Could not set country code: %s\n", country_code
);
698 uint32_t asn
= be32toh(dbobj
->asn
);
699 r
= loc_network_set_asn(*network
, asn
);
701 ERROR(ctx
, "Could not set ASN: %d\n", asn
);
706 int flags
= be16toh(dbobj
->flags
);
707 r
= loc_network_set_flag(*network
, flags
);
709 ERROR(ctx
, "Could not set flags: %d\n", flags
);
716 struct loc_network_tree
{
720 struct loc_network_tree_node
* root
;
723 struct loc_network_tree_node
{
727 struct loc_network_tree_node
* zero
;
728 struct loc_network_tree_node
* one
;
730 struct loc_network
* network
;
733 LOC_EXPORT
int loc_network_tree_new(struct loc_ctx
* ctx
, struct loc_network_tree
** tree
) {
734 struct loc_network_tree
* t
= calloc(1, sizeof(*t
));
738 t
->ctx
= loc_ref(ctx
);
741 // Create the root node
742 int r
= loc_network_tree_node_new(ctx
, &t
->root
);
744 loc_network_tree_unref(t
);
748 DEBUG(t
->ctx
, "Network tree allocated at %p\n", t
);
753 LOC_EXPORT
struct loc_network_tree_node
* loc_network_tree_get_root(struct loc_network_tree
* tree
) {
754 return loc_network_tree_node_ref(tree
->root
);
757 static struct loc_network_tree_node
* loc_network_tree_get_node(struct loc_network_tree_node
* node
, int path
) {
758 struct loc_network_tree_node
** n
;
765 // If the desired node doesn't exist, yet, we will create it
767 int r
= loc_network_tree_node_new(node
->ctx
, n
);
775 static struct loc_network_tree_node
* loc_network_tree_get_path(struct loc_network_tree
* tree
, const struct in6_addr
* address
, unsigned int prefix
) {
776 struct loc_network_tree_node
* node
= tree
->root
;
778 for (unsigned int i
= 0; i
< prefix
; i
++) {
779 // Check if the ith bit is one or zero
780 node
= loc_network_tree_get_node(node
, in6_addr_get_bit(address
, i
));
786 static int __loc_network_tree_walk(struct loc_ctx
* ctx
, struct loc_network_tree_node
* node
,
787 int(*filter_callback
)(struct loc_network
* network
, void* data
),
788 int(*callback
)(struct loc_network
* network
, void* data
), void* data
) {
791 // Finding a network ends the walk here
793 if (filter_callback
) {
794 int f
= filter_callback(node
->network
, data
);
798 // Skip network if filter function returns value greater than zero
803 r
= callback(node
->network
, data
);
808 // Walk down on the left side of the tree first
810 r
= __loc_network_tree_walk(ctx
, node
->zero
, filter_callback
, callback
, data
);
815 // Then walk on the other side
817 r
= __loc_network_tree_walk(ctx
, node
->one
, filter_callback
, callback
, data
);
825 LOC_EXPORT
int loc_network_tree_walk(struct loc_network_tree
* tree
,
826 int(*filter_callback
)(struct loc_network
* network
, void* data
),
827 int(*callback
)(struct loc_network
* network
, void* data
), void* data
) {
828 return __loc_network_tree_walk(tree
->ctx
, tree
->root
, filter_callback
, callback
, data
);
831 static void loc_network_tree_free(struct loc_network_tree
* tree
) {
832 DEBUG(tree
->ctx
, "Releasing network tree at %p\n", tree
);
834 loc_network_tree_node_unref(tree
->root
);
836 loc_unref(tree
->ctx
);
840 LOC_EXPORT
struct loc_network_tree
* loc_network_tree_unref(struct loc_network_tree
* tree
) {
841 if (--tree
->refcount
> 0)
844 loc_network_tree_free(tree
);
848 static int __loc_network_tree_dump(struct loc_network
* network
, void* data
) {
849 DEBUG(network
->ctx
, "Dumping network at %p\n", network
);
851 char* s
= loc_network_str(network
);
855 INFO(network
->ctx
, "%s\n", s
);
861 LOC_EXPORT
int loc_network_tree_dump(struct loc_network_tree
* tree
) {
862 DEBUG(tree
->ctx
, "Dumping network tree at %p\n", tree
);
864 return loc_network_tree_walk(tree
, NULL
, __loc_network_tree_dump
, NULL
);
867 LOC_EXPORT
int loc_network_tree_add_network(struct loc_network_tree
* tree
, struct loc_network
* network
) {
868 DEBUG(tree
->ctx
, "Adding network %p to tree %p\n", network
, tree
);
870 struct loc_network_tree_node
* node
= loc_network_tree_get_path(tree
,
871 &network
->first_address
, network
->prefix
);
873 ERROR(tree
->ctx
, "Could not find a node\n");
877 // Check if node has not been set before
879 DEBUG(tree
->ctx
, "There is already a network at this path\n");
883 // Point node to the network
884 node
->network
= loc_network_ref(network
);
889 static int __loc_network_tree_count(struct loc_network
* network
, void* data
) {
890 size_t* counter
= (size_t*)data
;
892 // Increase the counter for each network
898 LOC_EXPORT
size_t loc_network_tree_count_networks(struct loc_network_tree
* tree
) {
901 int r
= loc_network_tree_walk(tree
, NULL
, __loc_network_tree_count
, &counter
);
908 static size_t __loc_network_tree_count_nodes(struct loc_network_tree_node
* node
) {
912 counter
+= __loc_network_tree_count_nodes(node
->zero
);
915 counter
+= __loc_network_tree_count_nodes(node
->one
);
920 LOC_EXPORT
size_t loc_network_tree_count_nodes(struct loc_network_tree
* tree
) {
921 return __loc_network_tree_count_nodes(tree
->root
);
924 LOC_EXPORT
int loc_network_tree_node_new(struct loc_ctx
* ctx
, struct loc_network_tree_node
** node
) {
925 struct loc_network_tree_node
* n
= calloc(1, sizeof(*n
));
929 n
->ctx
= loc_ref(ctx
);
932 n
->zero
= n
->one
= NULL
;
934 DEBUG(n
->ctx
, "Network node allocated at %p\n", n
);
939 LOC_EXPORT
struct loc_network_tree_node
* loc_network_tree_node_ref(struct loc_network_tree_node
* node
) {
946 static void loc_network_tree_node_free(struct loc_network_tree_node
* node
) {
947 DEBUG(node
->ctx
, "Releasing network node at %p\n", node
);
950 loc_network_unref(node
->network
);
953 loc_network_tree_node_unref(node
->zero
);
956 loc_network_tree_node_unref(node
->one
);
958 loc_unref(node
->ctx
);
962 LOC_EXPORT
struct loc_network_tree_node
* loc_network_tree_node_unref(struct loc_network_tree_node
* node
) {
966 if (--node
->refcount
> 0)
969 loc_network_tree_node_free(node
);
973 LOC_EXPORT
struct loc_network_tree_node
* loc_network_tree_node_get(struct loc_network_tree_node
* node
, unsigned int index
) {
982 return loc_network_tree_node_ref(node
);
985 LOC_EXPORT
int loc_network_tree_node_is_leaf(struct loc_network_tree_node
* node
) {
986 return (!!node
->network
);
989 LOC_EXPORT
struct loc_network
* loc_network_tree_node_get_network(struct loc_network_tree_node
* node
) {
990 return loc_network_ref(node
->network
);
995 struct loc_network_list
{
999 struct loc_network
* list
[1024];
1004 LOC_EXPORT
int loc_network_list_new(struct loc_ctx
* ctx
,
1005 struct loc_network_list
** list
) {
1006 struct loc_network_list
* l
= calloc(1, sizeof(*l
));
1010 l
->ctx
= loc_ref(ctx
);
1013 // Do not allow this list to grow larger than this
1016 DEBUG(l
->ctx
, "Network list allocated at %p\n", l
);
1021 LOC_EXPORT
struct loc_network_list
* loc_network_list_ref(struct loc_network_list
* list
) {
1027 static void loc_network_list_free(struct loc_network_list
* list
) {
1028 DEBUG(list
->ctx
, "Releasing network list at %p\n", list
);
1030 for (unsigned int i
= 0; i
< list
->size
; i
++)
1031 loc_network_unref(list
->list
[i
]);
1033 loc_unref(list
->ctx
);
1037 LOC_EXPORT
struct loc_network_list
* loc_network_list_unref(struct loc_network_list
* list
) {
1041 if (--list
->refcount
> 0)
1044 loc_network_list_free(list
);
1048 LOC_EXPORT
size_t loc_network_list_size(struct loc_network_list
* list
) {
1052 LOC_EXPORT
int loc_network_list_empty(struct loc_network_list
* list
) {
1053 return list
->size
== 0;
1056 LOC_EXPORT
void loc_network_list_clear(struct loc_network_list
* list
) {
1057 for (unsigned int i
= 0; i
< list
->size
; i
++)
1058 loc_network_unref(list
->list
[i
]);
1063 LOC_EXPORT
void loc_network_list_dump(struct loc_network_list
* list
) {
1064 struct loc_network
* network
;
1067 for (unsigned int i
= 0; i
< list
->size
; i
++) {
1068 network
= list
->list
[i
];
1070 s
= loc_network_str(network
);
1072 INFO(list
->ctx
, "%s\n", s
);
1077 LOC_EXPORT
struct loc_network
* loc_network_list_get(struct loc_network_list
* list
, size_t index
) {
1079 if (index
>= list
->size
)
1082 return loc_network_ref(list
->list
[index
]);
1085 LOC_EXPORT
int loc_network_list_push(struct loc_network_list
* list
, struct loc_network
* network
) {
1086 // Do not add networks that are already on the list
1087 if (loc_network_list_contains(list
, network
))
1090 // Check if we have space left
1091 if (list
->size
== list
->max_size
) {
1092 ERROR(list
->ctx
, "%p: Could not push network onto the stack: Stack full\n", list
);
1096 DEBUG(list
->ctx
, "%p: Pushing network %p onto stack\n", list
, network
);
1098 list
->list
[list
->size
++] = loc_network_ref(network
);
1103 LOC_EXPORT
struct loc_network
* loc_network_list_pop(struct loc_network_list
* list
) {
1104 // Return nothing when empty
1105 if (loc_network_list_empty(list
)) {
1106 DEBUG(list
->ctx
, "%p: Popped empty stack\n", list
);
1110 struct loc_network
* network
= list
->list
[--list
->size
];
1112 DEBUG(list
->ctx
, "%p: Popping network %p from stack\n", list
, network
);
1117 LOC_EXPORT
int loc_network_list_contains(struct loc_network_list
* list
, struct loc_network
* network
) {
1118 for (unsigned int i
= 0; i
< list
->size
; i
++) {
1119 if (loc_network_eq(list
->list
[i
], network
))
1126 static void loc_network_list_swap(struct loc_network_list
* list
, unsigned int i1
, unsigned int i2
) {
1127 // Do nothing for invalid indices
1128 if (i1
>= list
->size
|| i2
>= list
->size
)
1131 struct loc_network
* network1
= list
->list
[i1
];
1132 struct loc_network
* network2
= list
->list
[i2
];
1134 list
->list
[i1
] = network2
;
1135 list
->list
[i2
] = network1
;
1138 LOC_EXPORT
void loc_network_list_reverse(struct loc_network_list
* list
) {
1140 unsigned int j
= list
->size
- 1;
1143 loc_network_list_swap(list
, i
++, j
--);
1147 LOC_EXPORT
void loc_network_list_sort(struct loc_network_list
* list
) {
1148 unsigned int n
= list
->size
;
1154 for (unsigned int i
= 1; i
< n
; i
++) {
1155 if (loc_network_gt(list
->list
[i
-1], list
->list
[i
]) > 0) {
1156 loc_network_list_swap(list
, i
-1, i
);
1165 LOC_EXPORT
int loc_network_list_merge(
1166 struct loc_network_list
* self
, struct loc_network_list
* other
) {
1169 for (unsigned int i
= 0; i
< other
->size
; i
++) {
1170 r
= loc_network_list_push(self
, other
->list
[i
]);