dhcpv6: Use for loop instead of goto to avoid false positive cppcheck warning
cppcheck 2.16.0 reports: dhcpv6.c:334:14: style: The comparison 'ia_type == 3' is always true. [knownConditionTrueFalse] if (ia_type == OPT_IA_NA) { ^ dhcpv6.c:306:12: note: 'ia_type' is assigned value '3' here. ia_type = OPT_IA_NA; ^ dhcpv6.c:334:14: note: The comparison 'ia_type == 3' is always true. if (ia_type == OPT_IA_NA) { ^ this is not really the case as we set ia_type to OPT_IA_TA and then jump back. Anyway, there's no particular reason to use a goto here: add a trivial foreach() macro to go through elements of an array and use it instead. Signed-off-by: Stefano Brivio <sbrivio@redhat.com> Reviewed-by: David Gibson <david@gibson.dropbear.id.au>
This commit is contained in:
parent
78da088f7b
commit
5f5e814cfc
2 changed files with 26 additions and 28 deletions
27
dhcpv6.c
27
dhcpv6.c
|
@ -296,47 +296,42 @@ static struct opt_hdr *dhcpv6_opt(const struct pool *p, size_t *offset,
|
||||||
static struct opt_hdr *dhcpv6_ia_notonlink(const struct pool *p,
|
static struct opt_hdr *dhcpv6_ia_notonlink(const struct pool *p,
|
||||||
struct in6_addr *la)
|
struct in6_addr *la)
|
||||||
{
|
{
|
||||||
|
int ia_types[2] = { OPT_IA_NA, OPT_IA_TA }, *ia_type;
|
||||||
|
const struct opt_ia_addr *opt_addr;
|
||||||
char buf[INET6_ADDRSTRLEN];
|
char buf[INET6_ADDRSTRLEN];
|
||||||
struct in6_addr req_addr;
|
struct in6_addr req_addr;
|
||||||
const struct opt_hdr *h;
|
const struct opt_hdr *h;
|
||||||
struct opt_hdr *ia;
|
struct opt_hdr *ia;
|
||||||
size_t offset;
|
size_t offset;
|
||||||
int ia_type;
|
|
||||||
|
|
||||||
ia_type = OPT_IA_NA;
|
foreach(ia_type, ia_types) {
|
||||||
ia_ta:
|
|
||||||
offset = 0;
|
offset = 0;
|
||||||
while ((ia = dhcpv6_opt(p, &offset, ia_type))) {
|
while ((ia = dhcpv6_opt(p, &offset, *ia_type))) {
|
||||||
if (ntohs(ia->l) < OPT_VSIZE(ia_na))
|
if (ntohs(ia->l) < OPT_VSIZE(ia_na))
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
offset += sizeof(struct opt_ia_na);
|
offset += sizeof(struct opt_ia_na);
|
||||||
|
|
||||||
while ((h = dhcpv6_opt(p, &offset, OPT_IAAADR))) {
|
while ((h = dhcpv6_opt(p, &offset, OPT_IAAADR))) {
|
||||||
const struct opt_ia_addr *opt_addr;
|
|
||||||
|
|
||||||
if (ntohs(h->l) != OPT_VSIZE(ia_addr))
|
if (ntohs(h->l) != OPT_VSIZE(ia_addr))
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
opt_addr = (const struct opt_ia_addr *)h;
|
opt_addr = (const struct opt_ia_addr *)h;
|
||||||
req_addr = opt_addr->addr;
|
req_addr = opt_addr->addr;
|
||||||
if (!IN6_ARE_ADDR_EQUAL(la, &req_addr)) {
|
if (!IN6_ARE_ADDR_EQUAL(la, &req_addr))
|
||||||
info("DHCPv6: requested address %s not on link",
|
goto err;
|
||||||
inet_ntop(AF_INET6, &req_addr,
|
|
||||||
buf, sizeof(buf)));
|
|
||||||
return ia;
|
|
||||||
}
|
|
||||||
|
|
||||||
offset += sizeof(struct opt_ia_addr);
|
offset += sizeof(struct opt_ia_addr);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (ia_type == OPT_IA_NA) {
|
|
||||||
ia_type = OPT_IA_TA;
|
|
||||||
goto ia_ta;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
|
err:
|
||||||
|
info("DHCPv6: requested address %s not on link",
|
||||||
|
inet_ntop(AF_INET6, &req_addr, buf, sizeof(buf)));
|
||||||
|
return ia;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|
3
util.h
3
util.h
|
@ -102,6 +102,9 @@
|
||||||
|
|
||||||
#define ARRAY_SIZE(a) ((int)(sizeof(a) / sizeof((a)[0])))
|
#define ARRAY_SIZE(a) ((int)(sizeof(a) / sizeof((a)[0])))
|
||||||
|
|
||||||
|
#define foreach(item, array) \
|
||||||
|
for ((item) = (array); (item) - (array) < ARRAY_SIZE(array); (item)++)
|
||||||
|
|
||||||
#define IN_INTERVAL(a, b, x) ((x) >= (a) && (x) <= (b))
|
#define IN_INTERVAL(a, b, x) ((x) >= (a) && (x) <= (b))
|
||||||
#define FD_PROTO(x, proto) \
|
#define FD_PROTO(x, proto) \
|
||||||
(IN_INTERVAL(c->proto.fd_min, c->proto.fd_max, (x)))
|
(IN_INTERVAL(c->proto.fd_min, c->proto.fd_max, (x)))
|
||||||
|
|
Loading…
Reference in a new issue