blob: c08332a6d99767a10fde8d40b2766b1d748a08f8 [file] [log] [blame]
Paul Jakma57345092011-12-25 17:52:09 +01001/*
2 * This file is free software: you may copy, redistribute and/or modify it
3 * under the terms of the GNU General Public License as published by the
4 * Free Software Foundation, either version 2 of the License, or (at your
5 * option) any later version.
6 *
7 * This file is distributed in the hope that it will be useful, but
8 * WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
10 * General Public License for more details.
11 *
12 * You should have received a copy of the GNU General Public License
13 * along with this program. If not, see <http://www.gnu.org/licenses/>.
14 *
15 * This file incorporates work covered by the following copyright and
16 * permission notice:
17 *
18Copyright (c) 2007, 2008 by Juliusz Chroboczek
19Copyright 2011 by Matthieu Boutier and Juliusz Chroboczek
20
21Permission is hereby granted, free of charge, to any person obtaining a copy
22of this software and associated documentation files (the "Software"), to deal
23in the Software without restriction, including without limitation the rights
24to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
25copies of the Software, and to permit persons to whom the Software is
26furnished to do so, subject to the following conditions:
27
28The above copyright notice and this permission notice shall be included in
29all copies or substantial portions of the Software.
30
31THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
32IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
33FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
34AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
35LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
36OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
37THE SOFTWARE.
38*/
39
Matthieu Boutier1f39f462012-01-18 20:01:31 +010040#ifndef BABEL_ROUTE_H
41#define BABEL_ROUTE_H
42
Paul Jakma57345092011-12-25 17:52:09 +010043#include "babel_interface.h"
44#include "source.h"
45
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040046struct babel_route {
Paul Jakma57345092011-12-25 17:52:09 +010047 struct source *src;
48 unsigned short metric;
49 unsigned short refmetric;
50 unsigned short seqno;
51 struct neighbour *neigh;
52 unsigned char nexthop[16];
53 time_t time;
54 unsigned short hold_time; /* in seconds */
55 short installed;
56};
57
Matthieu Boutierc7c53fa2012-01-08 16:43:08 +010058static inline unsigned short
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040059route_metric(const struct babel_route *route)
Paul Jakma57345092011-12-25 17:52:09 +010060{
61 return route->metric;
62}
63
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040064extern struct babel_route *routes;
Paul Jakma57345092011-12-25 17:52:09 +010065extern int numroutes, maxroutes;
66extern int kernel_metric, allow_duplicates;
67
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040068struct babel_route *find_route(const unsigned char *prefix, unsigned char plen,
Paul Jakma57345092011-12-25 17:52:09 +010069 struct neighbour *neigh, const unsigned char *nexthop);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040070struct babel_route *find_installed_route(const unsigned char *prefix,
Paul Jakma57345092011-12-25 17:52:09 +010071 unsigned char plen);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040072void flush_route(struct babel_route *route);
Paul Jakma57345092011-12-25 17:52:09 +010073void flush_neighbour_routes(struct neighbour *neigh);
74void flush_interface_routes(struct interface *ifp, int v4only);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040075void install_route(struct babel_route *route);
76void uninstall_route(struct babel_route *route);
77void switch_route(struct babel_route *old, struct babel_route *new);
78int route_feasible(struct babel_route *route);
79int route_old(struct babel_route *route);
80int route_expired(struct babel_route *route);
Paul Jakma57345092011-12-25 17:52:09 +010081int update_feasible(struct source *src,
82 unsigned short seqno, unsigned short refmetric);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040083struct babel_route *find_best_route(const unsigned char *prefix, unsigned char plen,
Paul Jakma57345092011-12-25 17:52:09 +010084 int feasible, struct neighbour *exclude);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040085struct babel_route *install_best_route(const unsigned char prefix[16],
Paul Jakma57345092011-12-25 17:52:09 +010086 unsigned char plen);
87void update_neighbour_metric(struct neighbour *neigh, int change);
88void update_interface_metric(struct interface *ifp);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040089void update_route_metric(struct babel_route *route);
90struct babel_route *update_route(const unsigned char *a,
Paul Jakma57345092011-12-25 17:52:09 +010091 const unsigned char *p, unsigned char plen,
92 unsigned short seqno, unsigned short refmetric,
93 unsigned short interval, struct neighbour *neigh,
94 const unsigned char *nexthop);
95void retract_neighbour_routes(struct neighbour *neigh);
96void send_unfeasible_request(struct neighbour *neigh, int force,
97 unsigned short seqno, unsigned short metric,
98 struct source *src);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +040099void send_triggered_update(struct babel_route *route,
Paul Jakma57345092011-12-25 17:52:09 +0100100 struct source *oldsrc, unsigned oldmetric);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +0400101void route_changed(struct babel_route *route,
Paul Jakma57345092011-12-25 17:52:09 +0100102 struct source *oldsrc, unsigned short oldmetric);
103void route_lost(struct source *src, unsigned oldmetric);
104void expire_routes(void);
105
106void babel_uninstall_all_routes(void);
Denis Ovsienkoef4de4d2012-01-08 15:29:19 +0400107struct babel_route *babel_route_get_by_source(struct source *src);
Matthieu Boutier1f39f462012-01-18 20:01:31 +0100108
109#endif