michaelh/zephyr
1
0
Fork 0
Code Releases Activity

net: if: tweak DAD and RS timeout handling

Browse source 
Both RS and DAD timeouts are simplified because the delay is a
constant, and by construction the list of timeouts is in increasing
time remaining.

Refactor to avoid repeating the expression that represents the time
until DAD state expires.  Uniformly use unsigned operands in deadline
calculation.

Note a case where the racy idiom for retaining an existing timeout is
required in the current work API, but can be replaced with a robust
solution in the proposed new API (the reschedule API replaces any
existing pending update, but the schedule API will leave an existing
scheduled submission in place).

Signed-off-by: Peter Bigot <peter.bigot@nordicsemi.no>
This commit is contained in:
Peter Bigot 2020-12-24 11:05:34 -06:00 • committed by Jukka Rissanen
commit d510f1f84d
1 changed files with 20 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

30
subsys/net/ip/net_if.c
View file

@ -982,12 +982,13 @@ static void join_mcast_nodes(struct net_if *iface, struct in6_addr *addr)
#endif /* CONFIG_NET_IPV6_MLD */
#if defined(CONFIG_NET_IPV6_DAD)
#define DAD_TIMEOUT 100 /* ms */
#define DAD_TIMEOUT 100U /* ms */
static void dad_timeout(struct k_work *work)
{
uint32_t current_time = k_uptime_get_32();
struct net_if_addr *ifaddr, *next;
int32_t delay = -1;
ARG_UNUSED(work);
@ -996,8 +997,12 @@ static void dad_timeout(struct k_work *work)
struct net_if_addr *tmp;
struct net_if *iface;
if ((int32_t)(ifaddr->dad_start +
DAD_TIMEOUT - current_time) > 0) {
/* DAD entries are ordered by construction. Stop when
* we find one that hasn't expired.
*/
delay = (int32_t)(ifaddr->dad_start +
DAD_TIMEOUT - current_time);
if (delay > 0) {
break;
}
@ -1031,10 +1036,8 @@ static void dad_timeout(struct k_work *work)
ifaddr = NULL;
}
if (ifaddr) {
k_delayed_work_submit(&dad_timer,
K_MSEC(ifaddr->dad_start +
DAD_TIMEOUT - current_time));
if ((ifaddr != NULL) && (delay > 0)) {
k_delayed_work_submit(&dad_timer, K_MSEC((uint32_t)delay));
}
}
@ -1058,6 +1061,7 @@ static void net_if_ipv6_start_dad(struct net_if *iface,
ifaddr->dad_start = k_uptime_get_32();
sys_slist_append(&active_dad_timers, &ifaddr->dad_node);
/* FUTURE: use schedule, not reschedule. */
if (!k_delayed_work_remaining_get(&dad_timer)) {
k_delayed_work_submit(&dad_timer,
K_MSEC(DAD_TIMEOUT));
@ -1148,13 +1152,14 @@ static inline void net_if_ipv6_start_dad(struct net_if *iface,
#endif /* CONFIG_NET_IPV6_DAD */
#if defined(CONFIG_NET_IPV6_ND)
#define RS_TIMEOUT (1 * MSEC_PER_SEC)
#define RS_TIMEOUT (1U * MSEC_PER_SEC)
#define RS_COUNT 3
static void rs_timeout(struct k_work *work)
{
uint32_t current_time = k_uptime_get_32();
struct net_if_ipv6 *ipv6, *next;
int32_t delay = -1;
ARG_UNUSED(work);
@ -1162,7 +1167,11 @@ static void rs_timeout(struct k_work *work)
ipv6, next, rs_node) {
struct net_if *iface = NULL;
if ((int32_t)(ipv6->rs_start + RS_TIMEOUT - current_time) > 0) {
/* RS entries are ordered by construction. Stop when
* we find one that hasn't expired.
*/
delay = (int32_t)(ipv6->rs_start + RS_TIMEOUT - current_time);
if (delay > 0) {
break;
}
@ -1192,7 +1201,7 @@ static void rs_timeout(struct k_work *work)
ipv6 = NULL;
}
if (ipv6) {
if ((ipv6 != NULL) && (delay > 0)) {
k_delayed_work_submit(&rs_timer,
K_MSEC(ipv6->rs_start +
RS_TIMEOUT - current_time));
@ -1213,6 +1222,7 @@ void net_if_start_rs(struct net_if *iface)
ipv6->rs_start = k_uptime_get_32();
sys_slist_append(&active_rs_timers, &ipv6->rs_node);
/* FUTURE: use schedule, not reschedule. */
if (!k_delayed_work_remaining_get(&rs_timer)) {
k_delayed_work_submit(&rs_timer, K_MSEC(RS_TIMEOUT));
}