1e7d8af4fSAlexander V. Chernikov /*- 2e7d8af4fSAlexander V. Chernikov * SPDX-License-Identifier: BSD-2-Clause-FreeBSD 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/cdefs.h> 34e7d8af4fSAlexander V. Chernikov __FBSDID("$FreeBSD$"); 35e7d8af4fSAlexander V. Chernikov 36e7d8af4fSAlexander V. Chernikov #include <sys/param.h> 37e7d8af4fSAlexander V. Chernikov #include <sys/systm.h> 38e7d8af4fSAlexander V. Chernikov #include <sys/socket.h> 39e7d8af4fSAlexander V. Chernikov #include <sys/kernel.h> 40e7d8af4fSAlexander V. Chernikov #include <sys/lock.h> 41da187ddbSAlexander V. Chernikov #include <sys/ck.h> 42e7d8af4fSAlexander V. Chernikov #include <sys/rmlock.h> 43e7d8af4fSAlexander V. Chernikov #include <sys/callout.h> 44e7d8af4fSAlexander V. Chernikov 45e7d8af4fSAlexander V. Chernikov #include <net/if.h> 46e7d8af4fSAlexander V. Chernikov #include <net/route.h> 47da187ddbSAlexander V. Chernikov #include <net/route/route_ctl.h> 48e7d8af4fSAlexander V. Chernikov #include <net/route/route_var.h> 49e7d8af4fSAlexander V. Chernikov #include <net/vnet.h> 50e7d8af4fSAlexander V. Chernikov 51e7d8af4fSAlexander V. Chernikov /* 52e7d8af4fSAlexander V. Chernikov * Callback returning 1 for the expired routes. 53e7d8af4fSAlexander V. Chernikov * Updates time of the next nearest route expiration as a side effect. 54e7d8af4fSAlexander V. Chernikov */ 55e7d8af4fSAlexander V. Chernikov static int 56e7d8af4fSAlexander V. Chernikov expire_route(const struct rtentry *rt, const struct nhop_object *nh, void *arg) 57e7d8af4fSAlexander V. Chernikov { 58*2717e958SAlexander V. Chernikov uint32_t nh_expire = nhop_get_expire(nh); 59e7d8af4fSAlexander V. Chernikov time_t *next_callout; 60e7d8af4fSAlexander V. Chernikov 61*2717e958SAlexander V. Chernikov if (nh_expire == 0) 62e7d8af4fSAlexander V. Chernikov return (0); 63e7d8af4fSAlexander V. Chernikov 64*2717e958SAlexander V. Chernikov if (nh_expire <= time_uptime) 65e7d8af4fSAlexander V. Chernikov return (1); 66e7d8af4fSAlexander V. Chernikov 67e7d8af4fSAlexander V. Chernikov next_callout = (time_t *)arg; 68e7d8af4fSAlexander V. Chernikov 69e7d8af4fSAlexander V. Chernikov /* 70e7d8af4fSAlexander V. Chernikov * Update next_callout to determine the next ts to 71e7d8af4fSAlexander V. Chernikov * run the callback at. 72e7d8af4fSAlexander V. Chernikov */ 73*2717e958SAlexander V. Chernikov if (*next_callout == 0 || *next_callout > nh_expire) 74*2717e958SAlexander V. Chernikov *next_callout = nh_expire; 75e7d8af4fSAlexander V. Chernikov 76e7d8af4fSAlexander V. Chernikov return (0); 77e7d8af4fSAlexander V. Chernikov } 78e7d8af4fSAlexander V. Chernikov 79e7d8af4fSAlexander V. Chernikov /* 80e7d8af4fSAlexander V. Chernikov * Per-rnh callout function traversing the tree and deleting 81e7d8af4fSAlexander V. Chernikov * expired routes. Calculates next callout run by looking at 82*2717e958SAlexander V. Chernikov * the nh_expire time for the remaining temporal routes. 83e7d8af4fSAlexander V. Chernikov */ 84e7d8af4fSAlexander V. Chernikov static void 85e7d8af4fSAlexander V. Chernikov expire_callout(void *arg) 86e7d8af4fSAlexander V. Chernikov { 87e7d8af4fSAlexander V. Chernikov struct rib_head *rnh; 88e7d8af4fSAlexander V. Chernikov time_t next_expire; 89e7d8af4fSAlexander V. Chernikov int seconds; 90e7d8af4fSAlexander V. Chernikov 91e7d8af4fSAlexander V. Chernikov rnh = (struct rib_head *)arg; 92e7d8af4fSAlexander V. Chernikov 93e7d8af4fSAlexander V. Chernikov CURVNET_SET(rnh->rib_vnet); 94e7d8af4fSAlexander V. Chernikov next_expire = 0; 95e7d8af4fSAlexander V. Chernikov 96e7d8af4fSAlexander V. Chernikov rib_walk_del(rnh->rib_fibnum, rnh->rib_family, expire_route, 97e7d8af4fSAlexander V. Chernikov (void *)&next_expire, 1); 98e7d8af4fSAlexander V. Chernikov 99e7d8af4fSAlexander V. Chernikov RIB_WLOCK(rnh); 100e7d8af4fSAlexander V. Chernikov if (next_expire > 0) { 101e7d8af4fSAlexander V. Chernikov seconds = (next_expire - time_uptime); 102e7d8af4fSAlexander V. Chernikov if (seconds < 0) 103e7d8af4fSAlexander V. Chernikov seconds = 0; 104e7d8af4fSAlexander V. Chernikov callout_reset_sbt(&rnh->expire_callout, SBT_1S * seconds, 105e7d8af4fSAlexander V. Chernikov SBT_1MS * 500, expire_callout, rnh, 0); 106e7d8af4fSAlexander V. Chernikov rnh->next_expire = next_expire; 107e7d8af4fSAlexander V. Chernikov } else { 108e7d8af4fSAlexander V. Chernikov /* 109e7d8af4fSAlexander V. Chernikov * Before resetting next_expire, check that tmproutes_update() 110e7d8af4fSAlexander V. Chernikov * has not kicked in and scheduled another invocation. 111e7d8af4fSAlexander V. Chernikov */ 112e7d8af4fSAlexander V. Chernikov if (callout_pending(&rnh->expire_callout) == 0) 113e7d8af4fSAlexander V. Chernikov rnh->next_expire = 0; 114e7d8af4fSAlexander V. Chernikov } 115e7d8af4fSAlexander V. Chernikov RIB_WUNLOCK(rnh); 116e7d8af4fSAlexander V. Chernikov CURVNET_RESTORE(); 117e7d8af4fSAlexander V. Chernikov } 118e7d8af4fSAlexander V. Chernikov 119e7d8af4fSAlexander V. Chernikov /* 120e7d8af4fSAlexander V. Chernikov * Function responsible for updating the time of the next calllout 121e7d8af4fSAlexander V. Chernikov * w.r.t. new temporal routes insertion. 122e7d8af4fSAlexander V. Chernikov * 123e7d8af4fSAlexander V. Chernikov * Called by the routing code upon adding new temporal route 124e7d8af4fSAlexander V. Chernikov * to the tree. RIB_WLOCK must be held. 125e7d8af4fSAlexander V. Chernikov */ 126e7d8af4fSAlexander V. Chernikov void 127*2717e958SAlexander V. Chernikov tmproutes_update(struct rib_head *rnh, struct rtentry *rt, struct nhop_object *nh) 128e7d8af4fSAlexander V. Chernikov { 129e7d8af4fSAlexander V. Chernikov int seconds; 130*2717e958SAlexander V. Chernikov uint32_t nh_expire = nhop_get_expire(nh); 131e7d8af4fSAlexander V. Chernikov 132e7d8af4fSAlexander V. Chernikov RIB_WLOCK_ASSERT(rnh); 133e7d8af4fSAlexander V. Chernikov 134*2717e958SAlexander V. Chernikov if (rnh->next_expire == 0 || rnh->next_expire > nh_expire) { 135e7d8af4fSAlexander V. Chernikov /* 136e7d8af4fSAlexander V. Chernikov * Callback is not scheduled, is executing, 137e7d8af4fSAlexander V. Chernikov * or is scheduled for a later time than we need. 138e7d8af4fSAlexander V. Chernikov * 139e7d8af4fSAlexander V. Chernikov * Schedule the one for the current @rt expiration time. 140e7d8af4fSAlexander V. Chernikov */ 141*2717e958SAlexander V. Chernikov seconds = (nh_expire - time_uptime); 142e7d8af4fSAlexander V. Chernikov if (seconds < 0) 143e7d8af4fSAlexander V. Chernikov seconds = 0; 144e7d8af4fSAlexander V. Chernikov callout_reset_sbt(&rnh->expire_callout, SBT_1S * seconds, 145e7d8af4fSAlexander V. Chernikov SBT_1MS * 500, expire_callout, rnh, 0); 146e7d8af4fSAlexander V. Chernikov 147*2717e958SAlexander V. Chernikov rnh->next_expire = nh_expire; 148e7d8af4fSAlexander V. Chernikov } 149e7d8af4fSAlexander V. Chernikov } 150e7d8af4fSAlexander V. Chernikov 151e7d8af4fSAlexander V. Chernikov void 152e7d8af4fSAlexander V. Chernikov tmproutes_init(struct rib_head *rh) 153e7d8af4fSAlexander V. Chernikov { 154e7d8af4fSAlexander V. Chernikov 155e7d8af4fSAlexander V. Chernikov callout_init(&rh->expire_callout, 1); 156e7d8af4fSAlexander V. Chernikov } 157e7d8af4fSAlexander V. Chernikov 158e7d8af4fSAlexander V. Chernikov void 159e7d8af4fSAlexander V. Chernikov tmproutes_destroy(struct rib_head *rh) 160e7d8af4fSAlexander V. Chernikov { 161e7d8af4fSAlexander V. Chernikov 162e7d8af4fSAlexander V. Chernikov callout_drain(&rh->expire_callout); 163e7d8af4fSAlexander V. Chernikov } 164