1e7d8af4fSAlexander V. Chernikov /*-
2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause
3e7d8af4fSAlexander V. Chernikov *
4e7d8af4fSAlexander V. Chernikov * Copyright (c) 2020 Alexander V. Chernikov
5e7d8af4fSAlexander V. Chernikov *
6e7d8af4fSAlexander V. Chernikov * Redistribution and use in source and binary forms, with or without
7e7d8af4fSAlexander V. Chernikov * modification, are permitted provided that the following conditions
8e7d8af4fSAlexander V. Chernikov * are met:
9e7d8af4fSAlexander V. Chernikov * 1. Redistributions of source code must retain the above copyright
10e7d8af4fSAlexander V. Chernikov * notice, this list of conditions and the following disclaimer.
11e7d8af4fSAlexander V. Chernikov * 2. Redistributions in binary form must reproduce the above copyright
12e7d8af4fSAlexander V. Chernikov * notice, this list of conditions and the following disclaimer in the
13e7d8af4fSAlexander V. Chernikov * documentation and/or other materials provided with the distribution.
14e7d8af4fSAlexander V. Chernikov *
15e7d8af4fSAlexander V. Chernikov * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16e7d8af4fSAlexander V. Chernikov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17e7d8af4fSAlexander V. Chernikov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18e7d8af4fSAlexander V. Chernikov * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19e7d8af4fSAlexander V. Chernikov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20e7d8af4fSAlexander V. Chernikov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21e7d8af4fSAlexander V. Chernikov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22e7d8af4fSAlexander V. Chernikov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23e7d8af4fSAlexander V. Chernikov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24e7d8af4fSAlexander V. Chernikov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25e7d8af4fSAlexander V. Chernikov * SUCH DAMAGE.
26e7d8af4fSAlexander V. Chernikov */
27e7d8af4fSAlexander V. Chernikov
28e7d8af4fSAlexander V. Chernikov /*
29e7d8af4fSAlexander V. Chernikov * This file contains code responsible for expiring temporal routes
30e7d8af4fSAlexander V. Chernikov * (typically, redirect-originated) from the route tables.
31e7d8af4fSAlexander V. Chernikov */
32e7d8af4fSAlexander V. Chernikov
33e7d8af4fSAlexander V. Chernikov #include <sys/param.h>
34e7d8af4fSAlexander V. Chernikov #include <sys/systm.h>
35e7d8af4fSAlexander V. Chernikov #include <sys/socket.h>
36e7d8af4fSAlexander V. Chernikov #include <sys/kernel.h>
37e7d8af4fSAlexander V. Chernikov #include <sys/lock.h>
38da187ddbSAlexander V. Chernikov #include <sys/ck.h>
39e7d8af4fSAlexander V. Chernikov #include <sys/rmlock.h>
40e7d8af4fSAlexander V. Chernikov #include <sys/callout.h>
41e7d8af4fSAlexander V. Chernikov
42e7d8af4fSAlexander V. Chernikov #include <net/if.h>
43e7d8af4fSAlexander V. Chernikov #include <net/route.h>
44da187ddbSAlexander V. Chernikov #include <net/route/route_ctl.h>
45e7d8af4fSAlexander V. Chernikov #include <net/route/route_var.h>
46e7d8af4fSAlexander V. Chernikov #include <net/vnet.h>
47e7d8af4fSAlexander V. Chernikov
48e7d8af4fSAlexander V. Chernikov /*
49e7d8af4fSAlexander V. Chernikov * Callback returning 1 for the expired routes.
50e7d8af4fSAlexander V. Chernikov * Updates time of the next nearest route expiration as a side effect.
51e7d8af4fSAlexander V. Chernikov */
52e7d8af4fSAlexander V. Chernikov static int
expire_route(const struct rtentry * rt,const struct nhop_object * nh,void * arg)53e7d8af4fSAlexander V. Chernikov expire_route(const struct rtentry *rt, const struct nhop_object *nh, void *arg)
54e7d8af4fSAlexander V. Chernikov {
552717e958SAlexander V. Chernikov uint32_t nh_expire = nhop_get_expire(nh);
56e7d8af4fSAlexander V. Chernikov time_t *next_callout;
57e7d8af4fSAlexander V. Chernikov
582717e958SAlexander V. Chernikov if (nh_expire == 0)
59e7d8af4fSAlexander V. Chernikov return (0);
60e7d8af4fSAlexander V. Chernikov
612717e958SAlexander V. Chernikov if (nh_expire <= time_uptime)
62e7d8af4fSAlexander V. Chernikov return (1);
63e7d8af4fSAlexander V. Chernikov
64e7d8af4fSAlexander V. Chernikov next_callout = (time_t *)arg;
65e7d8af4fSAlexander V. Chernikov
66e7d8af4fSAlexander V. Chernikov /*
67e7d8af4fSAlexander V. Chernikov * Update next_callout to determine the next ts to
68e7d8af4fSAlexander V. Chernikov * run the callback at.
69e7d8af4fSAlexander V. Chernikov */
702717e958SAlexander V. Chernikov if (*next_callout == 0 || *next_callout > nh_expire)
712717e958SAlexander V. Chernikov *next_callout = nh_expire;
72e7d8af4fSAlexander V. Chernikov
73e7d8af4fSAlexander V. Chernikov return (0);
74e7d8af4fSAlexander V. Chernikov }
75e7d8af4fSAlexander V. Chernikov
76e7d8af4fSAlexander V. Chernikov /*
77e7d8af4fSAlexander V. Chernikov * Per-rnh callout function traversing the tree and deleting
78e7d8af4fSAlexander V. Chernikov * expired routes. Calculates next callout run by looking at
792717e958SAlexander V. Chernikov * the nh_expire time for the remaining temporal routes.
80e7d8af4fSAlexander V. Chernikov */
81e7d8af4fSAlexander V. Chernikov static void
expire_callout(void * arg)82e7d8af4fSAlexander V. Chernikov expire_callout(void *arg)
83e7d8af4fSAlexander V. Chernikov {
84e7d8af4fSAlexander V. Chernikov struct rib_head *rnh;
85e7d8af4fSAlexander V. Chernikov time_t next_expire;
86e7d8af4fSAlexander V. Chernikov int seconds;
87e7d8af4fSAlexander V. Chernikov
88e7d8af4fSAlexander V. Chernikov rnh = (struct rib_head *)arg;
89e7d8af4fSAlexander V. Chernikov
90e7d8af4fSAlexander V. Chernikov CURVNET_SET(rnh->rib_vnet);
91e7d8af4fSAlexander V. Chernikov next_expire = 0;
92e7d8af4fSAlexander V. Chernikov
93e7d8af4fSAlexander V. Chernikov rib_walk_del(rnh->rib_fibnum, rnh->rib_family, expire_route,
94e7d8af4fSAlexander V. Chernikov (void *)&next_expire, 1);
95e7d8af4fSAlexander V. Chernikov
96e7d8af4fSAlexander V. Chernikov RIB_WLOCK(rnh);
97e7d8af4fSAlexander V. Chernikov if (next_expire > 0) {
98e7d8af4fSAlexander V. Chernikov seconds = (next_expire - time_uptime);
99e7d8af4fSAlexander V. Chernikov if (seconds < 0)
100e7d8af4fSAlexander V. Chernikov seconds = 0;
101e7d8af4fSAlexander V. Chernikov callout_reset_sbt(&rnh->expire_callout, SBT_1S * seconds,
102e7d8af4fSAlexander V. Chernikov SBT_1MS * 500, expire_callout, rnh, 0);
103e7d8af4fSAlexander V. Chernikov rnh->next_expire = next_expire;
104e7d8af4fSAlexander V. Chernikov } else {
105e7d8af4fSAlexander V. Chernikov /*
106e7d8af4fSAlexander V. Chernikov * Before resetting next_expire, check that tmproutes_update()
107e7d8af4fSAlexander V. Chernikov * has not kicked in and scheduled another invocation.
108e7d8af4fSAlexander V. Chernikov */
109e7d8af4fSAlexander V. Chernikov if (callout_pending(&rnh->expire_callout) == 0)
110e7d8af4fSAlexander V. Chernikov rnh->next_expire = 0;
111e7d8af4fSAlexander V. Chernikov }
112e7d8af4fSAlexander V. Chernikov RIB_WUNLOCK(rnh);
113e7d8af4fSAlexander V. Chernikov CURVNET_RESTORE();
114e7d8af4fSAlexander V. Chernikov }
115e7d8af4fSAlexander V. Chernikov
116e7d8af4fSAlexander V. Chernikov /*
117e7d8af4fSAlexander V. Chernikov * Function responsible for updating the time of the next calllout
118e7d8af4fSAlexander V. Chernikov * w.r.t. new temporal routes insertion.
119e7d8af4fSAlexander V. Chernikov *
120e7d8af4fSAlexander V. Chernikov * Called by the routing code upon adding new temporal route
121e7d8af4fSAlexander V. Chernikov * to the tree. RIB_WLOCK must be held.
122e7d8af4fSAlexander V. Chernikov */
123e7d8af4fSAlexander V. Chernikov void
tmproutes_update(struct rib_head * rnh,struct rtentry * rt,struct nhop_object * nh)1242717e958SAlexander V. Chernikov tmproutes_update(struct rib_head *rnh, struct rtentry *rt, struct nhop_object *nh)
125e7d8af4fSAlexander V. Chernikov {
126e7d8af4fSAlexander V. Chernikov int seconds;
1272717e958SAlexander V. Chernikov uint32_t nh_expire = nhop_get_expire(nh);
128e7d8af4fSAlexander V. Chernikov
129e7d8af4fSAlexander V. Chernikov RIB_WLOCK_ASSERT(rnh);
130e7d8af4fSAlexander V. Chernikov
1312717e958SAlexander V. Chernikov if (rnh->next_expire == 0 || rnh->next_expire > nh_expire) {
132e7d8af4fSAlexander V. Chernikov /*
133e7d8af4fSAlexander V. Chernikov * Callback is not scheduled, is executing,
134e7d8af4fSAlexander V. Chernikov * or is scheduled for a later time than we need.
135e7d8af4fSAlexander V. Chernikov *
136e7d8af4fSAlexander V. Chernikov * Schedule the one for the current @rt expiration time.
137e7d8af4fSAlexander V. Chernikov */
1382717e958SAlexander V. Chernikov seconds = (nh_expire - time_uptime);
139e7d8af4fSAlexander V. Chernikov if (seconds < 0)
140e7d8af4fSAlexander V. Chernikov seconds = 0;
141e7d8af4fSAlexander V. Chernikov callout_reset_sbt(&rnh->expire_callout, SBT_1S * seconds,
142e7d8af4fSAlexander V. Chernikov SBT_1MS * 500, expire_callout, rnh, 0);
143e7d8af4fSAlexander V. Chernikov
1442717e958SAlexander V. Chernikov rnh->next_expire = nh_expire;
145e7d8af4fSAlexander V. Chernikov }
146e7d8af4fSAlexander V. Chernikov }
147e7d8af4fSAlexander V. Chernikov
148e7d8af4fSAlexander V. Chernikov void
tmproutes_init(struct rib_head * rh)149e7d8af4fSAlexander V. Chernikov tmproutes_init(struct rib_head *rh)
150e7d8af4fSAlexander V. Chernikov {
151e7d8af4fSAlexander V. Chernikov
152e7d8af4fSAlexander V. Chernikov callout_init(&rh->expire_callout, 1);
153e7d8af4fSAlexander V. Chernikov }
154e7d8af4fSAlexander V. Chernikov
155e7d8af4fSAlexander V. Chernikov void
tmproutes_destroy(struct rib_head * rh)156e7d8af4fSAlexander V. Chernikov tmproutes_destroy(struct rib_head *rh)
157e7d8af4fSAlexander V. Chernikov {
158e7d8af4fSAlexander V. Chernikov
159e7d8af4fSAlexander V. Chernikov callout_drain(&rh->expire_callout);
160e7d8af4fSAlexander V. Chernikov }
161