blob: 511b292d7c48d32a55222e972e6f2b741ea9528f [file] [log] [blame]
paul2d598362003-01-17 23:48:42 +00001/*
2 * OSPF Neighbor functions.
3 * Copyright (C) 1999, 2000 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
8 * it under the terms of the GNU General Public License as published
9 * by the Free Software Foundation; either version 2, or (at your
10 * option) any 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
18 * along with GNU Zebra; see the file COPYING. If not, write to the
19 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 * Boston, MA 02111-1307, USA.
21 */
22
23#include <zebra.h>
24
25#include "linklist.h"
26#include "prefix.h"
27#include "memory.h"
28#include "command.h"
29#include "thread.h"
30#include "stream.h"
31#include "table.h"
32#include "log.h"
33
34#include "ospfd/ospfd.h"
35#include "ospfd/ospf_interface.h"
36#include "ospfd/ospf_asbr.h"
37#include "ospfd/ospf_lsa.h"
38#include "ospfd/ospf_lsdb.h"
39#include "ospfd/ospf_neighbor.h"
40#include "ospfd/ospf_nsm.h"
41#include "ospfd/ospf_packet.h"
42#include "ospfd/ospf_network.h"
43#include "ospfd/ospf_flood.h"
44#include "ospfd/ospf_dump.h"
45
46struct ospf_neighbor *
47ospf_nbr_new (struct ospf_interface *oi)
48{
49 struct ospf_neighbor *nbr;
50
51 /* Allcate new neighbor. */
52 nbr = XMALLOC (MTYPE_OSPF_NEIGHBOR, sizeof (struct ospf_neighbor));
53 memset (nbr, 0, sizeof (struct ospf_neighbor));
54
55 /* Relate neighbor to the interface. */
56 nbr->oi = oi;
57
58 /* Set default values. */
59 nbr->state = NSM_Down;
60
61 /* Set inheritance values. */
62 nbr->v_inactivity = OSPF_IF_PARAM (oi, v_wait);
63 nbr->v_db_desc = OSPF_IF_PARAM (oi, retransmit_interval);
64 nbr->v_ls_req = OSPF_IF_PARAM (oi, retransmit_interval);
65 nbr->v_ls_upd = OSPF_IF_PARAM (oi, retransmit_interval);
66 nbr->priority = -1;
67
68 /* DD flags. */
69 nbr->dd_flags = OSPF_DD_FLAG_MS|OSPF_DD_FLAG_M|OSPF_DD_FLAG_I;
70
71 /* Last received and sent DD. */
72 nbr->last_send = NULL;
73
74 nbr->nbr_nbma = NULL;
75
76 ospf_lsdb_init (&nbr->db_sum);
77 ospf_lsdb_init (&nbr->ls_rxmt);
78 ospf_lsdb_init (&nbr->ls_req);
79
80 nbr->crypt_seqnum = 0;
81
82 return nbr;
83}
84
85void
86ospf_nbr_free (struct ospf_neighbor *nbr)
87{
88 /* Free DB summary list. */
89 if (ospf_db_summary_count (nbr))
90 ospf_db_summary_clear (nbr);
91 /* ospf_db_summary_delete_all (nbr); */
92
93 /* Free ls request list. */
94 if (ospf_ls_request_count (nbr))
95 ospf_ls_request_delete_all (nbr);
96
97 /* Free retransmit list. */
98 if (ospf_ls_retransmit_count (nbr))
99 ospf_ls_retransmit_clear (nbr);
100
101 /* Cleanup LSDBs. */
102 ospf_lsdb_cleanup (&nbr->db_sum);
103 ospf_lsdb_cleanup (&nbr->ls_req);
104 ospf_lsdb_cleanup (&nbr->ls_rxmt);
105
106 /* Clear last send packet. */
107 if (nbr->last_send)
108 ospf_packet_free (nbr->last_send);
109
110 if (nbr->nbr_nbma)
111 {
112 nbr->nbr_nbma->nbr = NULL;
113 nbr->nbr_nbma = NULL;
114 }
115
116 /* Cancel all timers. */
117 OSPF_NSM_TIMER_OFF (nbr->t_inactivity);
118 OSPF_NSM_TIMER_OFF (nbr->t_db_desc);
119 OSPF_NSM_TIMER_OFF (nbr->t_ls_req);
120 OSPF_NSM_TIMER_OFF (nbr->t_ls_upd);
121
122 /* Cancel all events. *//* Thread lookup cost would be negligible. */
123 thread_cancel_event (master, nbr);
124
125 XFREE (MTYPE_OSPF_NEIGHBOR, nbr);
126}
127
128/* Delete specified OSPF neighbor from interface. */
129void
130ospf_nbr_delete (struct ospf_neighbor *nbr)
131{
132 struct ospf_interface *oi;
133 struct route_node *rn;
134 struct prefix p;
135
136 oi = nbr->oi;
137
138 /* Unlink ospf neighbor from the interface. */
139 p.family = AF_INET;
140 p.prefixlen = IPV4_MAX_BITLEN;
pauld3f0d622004-05-05 15:27:15 +0000141
142 /* vlinks are indexed by router-id */
143 if (oi->type == OSPF_IFTYPE_VIRTUALLINK)
144 p.u.prefix4 = nbr->router_id;
145 else
paul2d598362003-01-17 23:48:42 +0000146 p.u.prefix4 = nbr->src;
147
148 rn = route_node_lookup (oi->nbrs, &p);
149 if (rn)
150 {
151 if (rn->info)
152 {
153 rn->info = NULL;
154 route_unlock_node (rn);
155 }
156 else
157 zlog_info ("Can't find neighbor %s in the interface %s",
158 inet_ntoa (nbr->src), IF_NAME (oi));
159
160 route_unlock_node (rn);
161 }
162
163 /* Free ospf_neighbor structure. */
164 ospf_nbr_free (nbr);
165}
166
167/* Check myself is in the neighbor list. */
168int
169ospf_nbr_bidirectional (struct in_addr *router_id,
170 struct in_addr *neighbors, int size)
171{
172 int i;
173 int max;
174
175 max = size / sizeof (struct in_addr);
176
177 for (i = 0; i < max; i ++)
178 if (IPV4_ADDR_SAME (router_id, &neighbors[i]))
179 return 1;
180
181 return 0;
182}
183
184/* Add self to nbr list. */
185void
186ospf_nbr_add_self (struct ospf_interface *oi)
187{
188 struct ospf_neighbor *nbr;
189 struct prefix p;
190 struct route_node *rn;
191
192 p.family = AF_INET;
193 p.prefixlen = 32;
194 p.u.prefix4 = oi->address->u.prefix4;
195
196 rn = route_node_get (oi->nbrs, &p);
197 if (rn->info)
198 {
199 /* There is already pseudo neighbor. */
200 nbr = rn->info;
201 route_unlock_node (rn);
202 }
203 else
204 rn->info = oi->nbr_self;
205}
206
207/* Get neighbor count by status.
208 Specify status = 0, get all neighbor other than myself. */
209int
paul68980082003-03-25 05:07:42 +0000210ospf_nbr_count (struct ospf_interface *oi, int state)
paul2d598362003-01-17 23:48:42 +0000211{
paul2d598362003-01-17 23:48:42 +0000212 struct ospf_neighbor *nbr;
paul68980082003-03-25 05:07:42 +0000213 struct route_node *rn;
paul2d598362003-01-17 23:48:42 +0000214 int count = 0;
215
paul68980082003-03-25 05:07:42 +0000216 for (rn = route_top (oi->nbrs); rn; rn = route_next (rn))
217 if ((nbr = rn->info))
218 if (!IPV4_ADDR_SAME (&nbr->router_id, &oi->ospf->router_id))
paul2d598362003-01-17 23:48:42 +0000219 if (state == 0 || nbr->state == state)
220 count++;
221
222 return count;
223}
224
225#ifdef HAVE_OPAQUE_LSA
226int
paul68980082003-03-25 05:07:42 +0000227ospf_nbr_count_opaque_capable (struct ospf_interface *oi)
paul2d598362003-01-17 23:48:42 +0000228{
paul2d598362003-01-17 23:48:42 +0000229 struct ospf_neighbor *nbr;
paul68980082003-03-25 05:07:42 +0000230 struct route_node *rn;
paul2d598362003-01-17 23:48:42 +0000231 int count = 0;
232
paul68980082003-03-25 05:07:42 +0000233 for (rn = route_top (oi->nbrs); rn; rn = route_next (rn))
234 if ((nbr = rn->info))
235 if (!IPV4_ADDR_SAME (&nbr->router_id, &oi->ospf->router_id))
236 if (nbr->state == NSM_Full)
237 if (CHECK_FLAG (nbr->options, OSPF_OPTION_O))
238 count++;
paul2d598362003-01-17 23:48:42 +0000239
240 return count;
241}
242#endif /* HAVE_OPAQUE_LSA */
243
pauld3f0d622004-05-05 15:27:15 +0000244/* lookup nbr by address - use this only if you know you must
245 * otherwise use the ospf_nbr_lookup() wrapper, which deals
246 * with virtual link neighbours
247 */
paul2d598362003-01-17 23:48:42 +0000248struct ospf_neighbor *
249ospf_nbr_lookup_by_addr (struct route_table *nbrs,
250 struct in_addr *addr)
251{
252 struct prefix p;
253 struct route_node *rn;
254 struct ospf_neighbor *nbr;
255
256 p.family = AF_INET;
257 p.prefixlen = IPV4_MAX_BITLEN;
258 p.u.prefix4 = *addr;
259
260 rn = route_node_lookup (nbrs, &p);
261 if (! rn)
262 return NULL;
263
264 if (rn->info == NULL)
265 {
266 route_unlock_node (rn);
267 return NULL;
268 }
269
270 nbr = (struct ospf_neighbor *) rn->info;
271 route_unlock_node (rn);
272
273 return nbr;
274}
275
276struct ospf_neighbor *
277ospf_nbr_lookup_by_routerid (struct route_table *nbrs,
278 struct in_addr *id)
279{
280 struct route_node *rn;
281 struct ospf_neighbor *nbr;
282
283 for (rn = route_top (nbrs); rn; rn = route_next (rn))
284 if ((nbr = rn->info) != NULL)
285 if (IPV4_ADDR_SAME (&nbr->router_id, id))
286 {
287 route_unlock_node(rn);
288 return nbr;
289 }
290
291 return NULL;
292}
293
294void
295ospf_renegotiate_optional_capabilities (struct ospf *top)
296{
hasso52dc7ee2004-09-23 19:18:23 +0000297 struct listnode *node;
paul2d598362003-01-17 23:48:42 +0000298 struct ospf_interface *oi;
299 struct route_table *nbrs;
300 struct route_node *rn;
301 struct ospf_neighbor *nbr;
302
303 /* At first, flush self-originated LSAs from routing domain. */
304 ospf_flush_self_originated_lsas_now (top);
305
306 /* Revert all neighbor status to ExStart. */
307 for (node = listhead (top->oiflist); node; nextnode (node))
308 {
309 if ((oi = getdata (node)) == NULL || (nbrs = oi->nbrs) == NULL)
310 continue;
311
312 for (rn = route_top (nbrs); rn; rn = route_next (rn))
313 {
314 if ((nbr = rn->info) == NULL || nbr == oi->nbr_self)
315 continue;
316
317 if (nbr->state < NSM_ExStart)
318 continue;
319
320 if (IS_DEBUG_OSPF_EVENT)
321 zlog_info ("Renegotiate optional capabilities with neighbor(%s)", inet_ntoa (nbr->router_id));
322
323 OSPF_NSM_EVENT_SCHEDULE (nbr, NSM_SeqNumberMismatch);
324 }
325 }
326
327 return;
328}
pauld3f0d622004-05-05 15:27:15 +0000329
330
331struct ospf_neighbor *
332ospf_nbr_lookup (struct ospf_interface *oi, struct ip *iph,
333 struct ospf_header *ospfh)
334{
335 if (oi->type == OSPF_IFTYPE_VIRTUALLINK)
336 return (ospf_nbr_lookup_by_routerid (oi->nbrs, &ospfh->router_id));
337 else
338 return (ospf_nbr_lookup_by_addr (oi->nbrs, &iph->ip_src));
339}
340
341struct ospf_neighbor *
342ospf_nbr_add (struct ospf_interface *oi, struct ospf_header *ospfh,
343 struct prefix *p)
344{
345 struct ospf_neighbor *nbr;
346
347 nbr = ospf_nbr_new (oi);
348 nbr->state = NSM_Down;
349 nbr->src = p->u.prefix4;
350 memcpy (&nbr->address, p, sizeof (struct prefix));
351
352 nbr->nbr_nbma = NULL;
353 if (oi->type == OSPF_IFTYPE_NBMA)
354 {
355 struct ospf_nbr_nbma *nbr_nbma;
hasso52dc7ee2004-09-23 19:18:23 +0000356 struct listnode *node;
pauld3f0d622004-05-05 15:27:15 +0000357
358 for (node = listhead (oi->nbr_nbma); node; nextnode (node))
359 {
360 nbr_nbma = getdata (node);
361 assert (nbr_nbma);
362
363 if (IPV4_ADDR_SAME(&nbr_nbma->addr, &nbr->src))
364 {
365 nbr_nbma->nbr = nbr;
366 nbr->nbr_nbma = nbr_nbma;
367
368 if (nbr_nbma->t_poll)
369 OSPF_POLL_TIMER_OFF (nbr_nbma->t_poll);
370
371 nbr->state_change = nbr_nbma->state_change + 1;
372 }
373 }
374 }
375
376 /* New nbr, save the crypto sequence number if necessary */
377 if (ntohs (ospfh->auth_type) == OSPF_AUTH_CRYPTOGRAPHIC)
378 nbr->crypt_seqnum = ospfh->u.crypt.crypt_seqnum;
379
380 if (IS_DEBUG_OSPF_EVENT)
381 zlog_info ("NSM[%s:%s]: start", IF_NAME (nbr->oi),
382 inet_ntoa (nbr->router_id));
383
384 return nbr;
385}
386
387struct ospf_neighbor *
388ospf_nbr_get (struct ospf_interface *oi, struct ospf_header *ospfh,
389 struct ip *iph, struct prefix *p)
390{
391 struct route_node *rn;
392 struct prefix key;
393 struct ospf_neighbor *nbr;
394
395 key.family = AF_INET;
396 key.prefixlen = IPV4_MAX_BITLEN;
397
398 if (oi->type == OSPF_IFTYPE_VIRTUALLINK)
399 key.u.prefix4 = ospfh->router_id; /* index vlink nbrs by router-id */
400 else
401 key.u.prefix4 = iph->ip_src;
402
403 rn = route_node_get (oi->nbrs, &key);
404 if (rn->info)
405 {
406 route_unlock_node (rn);
407 nbr = rn->info;
408
409 if (oi->type == OSPF_IFTYPE_NBMA && nbr->state == NSM_Attempt)
410 {
411 nbr->src = iph->ip_src;
412 memcpy (&nbr->address, p, sizeof (struct prefix));
413 }
414 }
415 else
416 {
417 rn->info = nbr = ospf_nbr_add (oi, ospfh, p);
418 }
419
420 nbr->router_id = ospfh->router_id;
421
422 return nbr;
423}
424