]> git.proxmox.com Git - mirror_frr.git/blame_incremental - ospfd/ospf_lsdb.c
zebra: Allow ns delete to happen after under/over flow checks
[mirror_frr.git] / ospfd / ospf_lsdb.c
... / ...
CommitLineData
1/*
2 * OSPF LSDB support.
3 * Copyright (C) 1999, 2000 Alex Zinin, Kunihiro Ishiguro, Toshiaki Takada
4 *
5 * This file is part of GNU Zebra.
6 *
7 * GNU Zebra is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the
9 * Free Software Foundation; either version 2, or (at your option) any
10 * later version.
11 *
12 * GNU Zebra is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; see the file COPYING; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22#include <zebra.h>
23
24#include "prefix.h"
25#include "table.h"
26#include "memory.h"
27#include "log.h"
28
29#include "ospfd/ospfd.h"
30#include "ospfd/ospf_asbr.h"
31#include "ospfd/ospf_lsa.h"
32#include "ospfd/ospf_lsdb.h"
33
34struct ospf_lsdb *ospf_lsdb_new()
35{
36 struct ospf_lsdb *new;
37
38 new = XCALLOC(MTYPE_OSPF_LSDB, sizeof(struct ospf_lsdb));
39 ospf_lsdb_init(new);
40
41 return new;
42}
43
44void ospf_lsdb_init(struct ospf_lsdb *lsdb)
45{
46 int i;
47
48 for (i = OSPF_MIN_LSA; i < OSPF_MAX_LSA; i++)
49 lsdb->type[i].db = route_table_init();
50}
51
52void ospf_lsdb_free(struct ospf_lsdb *lsdb)
53{
54 ospf_lsdb_cleanup(lsdb);
55 XFREE(MTYPE_OSPF_LSDB, lsdb);
56}
57
58void ospf_lsdb_cleanup(struct ospf_lsdb *lsdb)
59{
60 int i;
61 assert(lsdb);
62 assert(lsdb->total == 0);
63
64 ospf_lsdb_delete_all(lsdb);
65
66 for (i = OSPF_MIN_LSA; i < OSPF_MAX_LSA; i++)
67 route_table_finish(lsdb->type[i].db);
68}
69
70void ls_prefix_set(struct prefix_ls *lp, struct ospf_lsa *lsa)
71{
72 if (lp && lsa && lsa->data) {
73 lp->family = 0;
74 lp->prefixlen = 64;
75 lp->id = lsa->data->id;
76 lp->adv_router = lsa->data->adv_router;
77 }
78}
79
80static void ospf_lsdb_delete_entry(struct ospf_lsdb *lsdb,
81 struct route_node *rn)
82{
83 struct ospf_lsa *lsa = rn->info;
84
85 if (!lsa)
86 return;
87
88 assert(rn->table == lsdb->type[lsa->data->type].db);
89
90 if (IS_LSA_SELF(lsa))
91 lsdb->type[lsa->data->type].count_self--;
92 lsdb->type[lsa->data->type].count--;
93 lsdb->type[lsa->data->type].checksum -= ntohs(lsa->data->checksum);
94 lsdb->total--;
95 rn->info = NULL;
96 route_unlock_node(rn);
97#ifdef MONITOR_LSDB_CHANGE
98 if (lsdb->del_lsa_hook != NULL)
99 (*lsdb->del_lsa_hook)(lsa);
100#endif /* MONITOR_LSDB_CHANGE */
101 ospf_lsa_unlock(&lsa); /* lsdb */
102 return;
103}
104
105/* Add new LSA to lsdb. */
106void ospf_lsdb_add(struct ospf_lsdb *lsdb, struct ospf_lsa *lsa)
107{
108 struct route_table *table;
109 struct prefix_ls lp;
110 struct route_node *rn;
111
112 table = lsdb->type[lsa->data->type].db;
113 ls_prefix_set(&lp, lsa);
114 rn = route_node_get(table, (struct prefix *)&lp);
115
116 /* nothing to do? */
117 if (rn->info && rn->info == lsa) {
118 route_unlock_node(rn);
119 return;
120 }
121
122 /* purge old entry? */
123 if (rn->info)
124 ospf_lsdb_delete_entry(lsdb, rn);
125
126 if (IS_LSA_SELF(lsa))
127 lsdb->type[lsa->data->type].count_self++;
128 lsdb->type[lsa->data->type].count++;
129 lsdb->total++;
130
131#ifdef MONITOR_LSDB_CHANGE
132 if (lsdb->new_lsa_hook != NULL)
133 (*lsdb->new_lsa_hook)(lsa);
134#endif /* MONITOR_LSDB_CHANGE */
135 lsdb->type[lsa->data->type].checksum += ntohs(lsa->data->checksum);
136 rn->info = ospf_lsa_lock(lsa); /* lsdb */
137}
138
139void ospf_lsdb_delete(struct ospf_lsdb *lsdb, struct ospf_lsa *lsa)
140{
141 struct route_table *table;
142 struct prefix_ls lp;
143 struct route_node *rn;
144
145 if (!lsdb || !lsa)
146 return;
147
148 assert(lsa->data->type < OSPF_MAX_LSA);
149 table = lsdb->type[lsa->data->type].db;
150 ls_prefix_set(&lp, lsa);
151 if ((rn = route_node_lookup(table, (struct prefix *)&lp))) {
152 if (rn->info == lsa)
153 ospf_lsdb_delete_entry(lsdb, rn);
154 route_unlock_node(rn); /* route_node_lookup */
155 }
156}
157
158void ospf_lsdb_delete_all(struct ospf_lsdb *lsdb)
159{
160 struct route_table *table;
161 struct route_node *rn;
162 int i;
163
164 for (i = OSPF_MIN_LSA; i < OSPF_MAX_LSA; i++) {
165 table = lsdb->type[i].db;
166 for (rn = route_top(table); rn; rn = route_next(rn))
167 if (rn->info != NULL)
168 ospf_lsdb_delete_entry(lsdb, rn);
169 }
170}
171
172void ospf_lsdb_clean_stat(struct ospf_lsdb *lsdb)
173{
174 struct route_table *table;
175 struct route_node *rn;
176 struct ospf_lsa *lsa;
177 int i;
178
179 for (i = OSPF_MIN_LSA; i < OSPF_MAX_LSA; i++) {
180 table = lsdb->type[i].db;
181 for (rn = route_top(table); rn; rn = route_next(rn))
182 if ((lsa = (rn->info)) != NULL)
183 lsa->stat = LSA_SPF_NOT_EXPLORED;
184 }
185}
186
187struct ospf_lsa *ospf_lsdb_lookup(struct ospf_lsdb *lsdb, struct ospf_lsa *lsa)
188{
189 struct route_table *table;
190 struct prefix_ls lp;
191 struct route_node *rn;
192 struct ospf_lsa *find;
193
194 table = lsdb->type[lsa->data->type].db;
195 ls_prefix_set(&lp, lsa);
196 rn = route_node_lookup(table, (struct prefix *)&lp);
197 if (rn) {
198 find = rn->info;
199 route_unlock_node(rn);
200 return find;
201 }
202 return NULL;
203}
204
205struct ospf_lsa *ospf_lsdb_lookup_by_id(struct ospf_lsdb *lsdb, uint8_t type,
206 struct in_addr id,
207 struct in_addr adv_router)
208{
209 struct route_table *table;
210 struct prefix_ls lp;
211 struct route_node *rn;
212 struct ospf_lsa *find;
213
214 table = lsdb->type[type].db;
215
216 memset(&lp, 0, sizeof(struct prefix_ls));
217 lp.family = 0;
218 lp.prefixlen = 64;
219 lp.id = id;
220 lp.adv_router = adv_router;
221
222 rn = route_node_lookup(table, (struct prefix *)&lp);
223 if (rn) {
224 find = rn->info;
225 route_unlock_node(rn);
226 return find;
227 }
228 return NULL;
229}
230
231struct ospf_lsa *ospf_lsdb_lookup_by_id_next(struct ospf_lsdb *lsdb,
232 uint8_t type, struct in_addr id,
233 struct in_addr adv_router,
234 int first)
235{
236 struct route_table *table;
237 struct prefix_ls lp;
238 struct route_node *rn;
239 struct ospf_lsa *find;
240
241 table = lsdb->type[type].db;
242
243 memset(&lp, 0, sizeof(struct prefix_ls));
244 lp.family = 0;
245 lp.prefixlen = 64;
246 lp.id = id;
247 lp.adv_router = adv_router;
248
249 if (first)
250 rn = route_top(table);
251 else {
252 if ((rn = route_node_lookup(table, (struct prefix *)&lp))
253 == NULL)
254 return NULL;
255 rn = route_next(rn);
256 }
257
258 for (; rn; rn = route_next(rn))
259 if (rn->info)
260 break;
261
262 if (rn && rn->info) {
263 find = rn->info;
264 route_unlock_node(rn);
265 return find;
266 }
267 return NULL;
268}
269
270unsigned long ospf_lsdb_count_all(struct ospf_lsdb *lsdb)
271{
272 return lsdb->total;
273}
274
275unsigned long ospf_lsdb_count(struct ospf_lsdb *lsdb, int type)
276{
277 return lsdb->type[type].count;
278}
279
280unsigned long ospf_lsdb_count_self(struct ospf_lsdb *lsdb, int type)
281{
282 return lsdb->type[type].count_self;
283}
284
285unsigned int ospf_lsdb_checksum(struct ospf_lsdb *lsdb, int type)
286{
287 return lsdb->type[type].checksum;
288}
289
290unsigned long ospf_lsdb_isempty(struct ospf_lsdb *lsdb)
291{
292 return (lsdb->total == 0);
293}