156 lines
4.1 KiB
C
156 lines
4.1 KiB
C
/* SPDX-License-Identifier: LGPL-2.1+ */
|
|
|
|
#include "alloc-util.h"
|
|
#include "networkd-address-pool.h"
|
|
#include "networkd-manager.h"
|
|
#include "set.h"
|
|
#include "string-util.h"
|
|
|
|
#define RANDOM_PREFIX_TRIAL_MAX 1024
|
|
|
|
static int address_pool_new(
|
|
Manager *m,
|
|
AddressPool **ret,
|
|
int family,
|
|
const union in_addr_union *u,
|
|
unsigned prefixlen) {
|
|
|
|
AddressPool *p;
|
|
|
|
assert(m);
|
|
assert(ret);
|
|
assert(u);
|
|
|
|
p = new(AddressPool, 1);
|
|
if (!p)
|
|
return -ENOMEM;
|
|
|
|
*p = (AddressPool) {
|
|
.manager = m,
|
|
.family = family,
|
|
.prefixlen = prefixlen,
|
|
.in_addr = *u,
|
|
};
|
|
|
|
LIST_PREPEND(address_pools, m->address_pools, p);
|
|
|
|
*ret = p;
|
|
return 0;
|
|
}
|
|
|
|
int address_pool_new_from_string(
|
|
Manager *m,
|
|
AddressPool **ret,
|
|
int family,
|
|
const char *p,
|
|
unsigned prefixlen) {
|
|
|
|
union in_addr_union u;
|
|
int r;
|
|
|
|
assert(m);
|
|
assert(ret);
|
|
assert(p);
|
|
|
|
r = in_addr_from_string(family, p, &u);
|
|
if (r < 0)
|
|
return r;
|
|
|
|
return address_pool_new(m, ret, family, &u, prefixlen);
|
|
}
|
|
|
|
void address_pool_free(AddressPool *p) {
|
|
|
|
if (!p)
|
|
return;
|
|
|
|
if (p->manager)
|
|
LIST_REMOVE(address_pools, p->manager->address_pools, p);
|
|
|
|
free(p);
|
|
}
|
|
|
|
static bool address_pool_prefix_is_taken(
|
|
AddressPool *p,
|
|
const union in_addr_union *u,
|
|
unsigned prefixlen) {
|
|
|
|
Link *l;
|
|
Network *n;
|
|
|
|
assert(p);
|
|
assert(u);
|
|
|
|
HASHMAP_FOREACH(l, p->manager->links) {
|
|
Address *a;
|
|
|
|
/* Don't clash with assigned addresses */
|
|
SET_FOREACH(a, l->addresses) {
|
|
if (a->family != p->family)
|
|
continue;
|
|
|
|
if (in_addr_prefix_intersect(p->family, u, prefixlen, &a->in_addr, a->prefixlen))
|
|
return true;
|
|
}
|
|
|
|
/* Don't clash with addresses already pulled from the pool, but not assigned yet */
|
|
LIST_FOREACH(addresses, a, l->pool_addresses) {
|
|
if (a->family != p->family)
|
|
continue;
|
|
|
|
if (in_addr_prefix_intersect(p->family, u, prefixlen, &a->in_addr, a->prefixlen))
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/* And don't clash with configured but un-assigned addresses either */
|
|
ORDERED_HASHMAP_FOREACH(n, p->manager->networks) {
|
|
Address *a;
|
|
|
|
LIST_FOREACH(addresses, a, n->static_addresses) {
|
|
if (a->family != p->family)
|
|
continue;
|
|
|
|
if (in_addr_prefix_intersect(p->family, u, prefixlen, &a->in_addr, a->prefixlen))
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
int address_pool_acquire(AddressPool *p, unsigned prefixlen, union in_addr_union *found) {
|
|
union in_addr_union u;
|
|
unsigned i;
|
|
int r;
|
|
|
|
assert(p);
|
|
assert(prefixlen > 0);
|
|
assert(found);
|
|
|
|
if (p->prefixlen >= prefixlen)
|
|
return 0;
|
|
|
|
u = p->in_addr;
|
|
|
|
for (i = 0; i < RANDOM_PREFIX_TRIAL_MAX; i++) {
|
|
r = in_addr_random_prefix(p->family, &u, p->prefixlen, prefixlen);
|
|
if (r <= 0)
|
|
return r;
|
|
|
|
if (!address_pool_prefix_is_taken(p, &u, prefixlen)) {
|
|
if (DEBUG_LOGGING) {
|
|
_cleanup_free_ char *s = NULL;
|
|
|
|
(void) in_addr_to_string(p->family, &u, &s);
|
|
log_debug("Found range %s/%u", strna(s), prefixlen);
|
|
}
|
|
|
|
*found = u;
|
|
return 1;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|