-// Returns the highest result available
-static int __loc_database_lookup_max(struct loc_database* db, const struct in6_addr* address,
- struct loc_network** network, struct in6_addr* network_address,
- const struct loc_database_network_node_v0* node, unsigned int level) {
- int r;
- off_t node_index;
-
- // If the node is a leaf node, we end here
- if (__loc_database_node_is_leaf(node)) {
- r = __loc_database_lookup_handle_leaf(db, address, network, network_address, level, node);
- if (r <= 0)
- return r;
- }
-
- // Try to go down the ones path first
- if (node->one) {
- node_index = be32toh(node->one);
- in6_addr_set_bit(network_address, level, 1);
-
- // Check boundaries
- if (node_index > 0 && (size_t)node_index <= db->network_nodes_count) {
- r = __loc_database_lookup_max(db, address, network, network_address,
- db->network_nodes_v0 + node_index, level + 1);
-
- // Abort when match was found or error
- if (r <= 0)
- return r;
- }
- }
-
- // ... and if that fails, we try to go down one step on a zero
- // branch and then try the ones again...
- if (node->zero) {
- node_index = be32toh(node->zero);
- in6_addr_set_bit(network_address, level, 0);
-
- // Check boundaries
- if (node_index > 0 && (size_t)node_index <= db->network_nodes_count) {
- r = __loc_database_lookup_max(db, address, network, network_address,
- db->network_nodes_v0 + node_index, level + 1);
-
- // Abort when match was found or error
- if (r <= 0)
- return r;
- }
- }
-
- // End of path
- return 1;
-}
-