1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
|
/*
* PIM for FRR - J/P Aggregation
* Copyright (C) 2017 Cumulus Networks, Inc.
* Donald Sharp
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; see the file COPYING; if not, write to the
* Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
* MA 02110-1301 USA
*/
#include <zebra.h>
#include "linklist.h"
#include "log.h"
#include "vrf.h"
#include "if.h"
#include "pimd.h"
#include "pim_msg.h"
#include "pim_jp_agg.h"
#include "pim_join.h"
#include "pim_iface.h"
void
pim_jp_agg_group_list_free (struct pim_jp_agg_group *jag)
{
list_delete(jag->sources);
XFREE (MTYPE_PIM_JP_AGG_GROUP, jag);
}
static void
pim_jp_agg_src_free (struct pim_jp_sources *js)
{
struct pim_upstream *up = js->up;
/*
* When we are being called here, we know
* that the neighbor is going away start
* the normal j/p timer so that it can
* pick this shit back up when the
* nbr comes back alive
*/
if (up)
join_timer_start(js->up);
XFREE (MTYPE_PIM_JP_AGG_SOURCE, js);
}
int
pim_jp_agg_group_list_cmp (void *arg1, void *arg2)
{
const struct pim_jp_agg_group *jag1 = (const struct pim_jp_agg_group *)arg1;
const struct pim_jp_agg_group *jag2 = (const struct pim_jp_agg_group *)arg2;
if (jag1->group.s_addr < jag2->group.s_addr)
return -1;
if (jag1->group.s_addr > jag2->group.s_addr)
return 1;
return 0;
}
static int
pim_jp_agg_src_cmp (void *arg1, void *arg2)
{
const struct pim_jp_sources *js1 = (const struct pim_jp_sources *)arg1;
const struct pim_jp_sources *js2 = (const struct pim_jp_sources *)arg2;
if (js1->is_join && !js2->is_join)
return -1;
if (!js1->is_join && js2->is_join)
return 1;
if ((uint32_t)js1->up->sg.src.s_addr < (uint32_t)js2->up->sg.src.s_addr)
return -1;
if ((uint32_t)js1->up->sg.src.s_addr > (uint32_t)js2->up->sg.src.s_addr)
return 1;
return 0;
}
/*
* This function is used by scan_oil to clear
* the created jp_agg_group created when
* figuring out where to send prunes
* and joins.
*/
void
pim_jp_agg_clear_group (struct list *group)
{
struct listnode *gnode, *gnnode;
struct listnode *snode, *snnode;
struct pim_jp_agg_group *jag;
struct pim_jp_sources *js;
for (ALL_LIST_ELEMENTS(group, gnode, gnnode, jag))
{
for (ALL_LIST_ELEMENTS(jag->sources, snode, snnode, js))
{
listnode_delete(jag->sources, js);
js->up = NULL;
XFREE(MTYPE_PIM_JP_AGG_SOURCE, js);
}
jag->sources = NULL;
listnode_delete(group, jag);
XFREE(MTYPE_PIM_JP_AGG_GROUP, jag);
}
}
static struct pim_iface_upstream_switch *
pim_jp_agg_get_interface_upstream_switch_list (struct pim_rpf *rpf)
{
struct pim_interface *pim_ifp = rpf->source_nexthop.interface->info;
struct pim_iface_upstream_switch *pius;
struct listnode *node, *nnode;
for (ALL_LIST_ELEMENTS(pim_ifp->upstream_switch_list, node, nnode, pius))
{
if (pius->address.s_addr == rpf->rpf_addr.u.prefix4.s_addr)
break;
}
if (!pius)
{
pius = XCALLOC(MTYPE_PIM_JP_AGG_GROUP, sizeof (struct pim_iface_upstream_switch));
pius->address.s_addr = rpf->rpf_addr.u.prefix4.s_addr;
pius->us = list_new();
listnode_add_sort (pim_ifp->upstream_switch_list, pius);
}
return pius;
}
void
pim_jp_agg_remove_group (struct list *group, struct pim_upstream *up)
{
struct listnode *node, *nnode;
struct pim_jp_agg_group *jag = NULL;
struct pim_jp_sources *js = NULL;
for (ALL_LIST_ELEMENTS(group, node, nnode, jag))
{
if (jag->group.s_addr == up->sg.grp.s_addr)
break;
}
if (!jag)
return;
for (ALL_LIST_ELEMENTS(jag->sources, node, nnode, js))
{
if (js->up == up)
break;
}
if (js)
{
js->up = NULL;
listnode_delete(jag->sources, js);
XFREE(MTYPE_PIM_JP_AGG_SOURCE, js);
}
if (jag->sources->count == 0)
{
list_delete(jag->sources);
jag->sources = NULL;
listnode_delete(group, jag);
XFREE(MTYPE_PIM_JP_AGG_GROUP, jag);
}
}
int
pim_jp_agg_is_in_list (struct list *group, struct pim_upstream *up)
{
struct listnode *node, *nnode;
struct pim_jp_agg_group *jag = NULL;
struct pim_jp_sources *js = NULL;
for (ALL_LIST_ELEMENTS (group, node, nnode, jag))
{
if (jag->group.s_addr == up->sg.grp.s_addr)
break;
}
if (!jag)
return 0;
for (ALL_LIST_ELEMENTS(jag->sources, node, nnode, js))
{
if (js->up == up)
return 1;
}
return 0;
}
//#define PIM_JP_AGG_DEBUG 1
/*
* For the given upstream, check all the neighbor
* jp_agg lists and ensure that it is not
* in another list
*
* *IF* ignore is true we can skip
* up->rpf.source_nexthop.interface particular interface for checking
*
* This is a debugging function, Probably
* can be safely compiled out in real
* builds
*/
void
pim_jp_agg_upstream_verification (struct pim_upstream *up, bool ignore)
{
#ifdef PIM_JP_AGG_DEBUG
struct listnode *node;
struct interface *ifp;
for (ALL_LIST_ELEMENTS_RO (vrf_iflist (VRF_DEFAULT), node, ifp))
{
struct pim_interface *pim_ifp = ifp->info;
struct listnode *nnode;
if (ignore && ifp == up->rpf.source_nexthop.interface)
continue;
if (pim_ifp)
{
struct pim_neighbor *neigh;
for (ALL_LIST_ELEMENTS_RO(pim_ifp->pim_neighbor_list, nnode, neigh))
{
assert (!pim_jp_agg_is_in_list(neigh->upstream_jp_agg, up));
}
}
}
#else
return;
#endif
}
void
pim_jp_agg_add_group (struct list *group, struct pim_upstream *up, bool is_join)
{
struct listnode *node, *nnode;
struct pim_jp_agg_group *jag = NULL;
struct pim_jp_sources *js = NULL;
for (ALL_LIST_ELEMENTS(group, node, nnode, jag))
{
if (jag->group.s_addr == up->sg.grp.s_addr)
break;
}
if (!jag)
{
jag = XCALLOC(MTYPE_PIM_JP_AGG_GROUP, sizeof (struct pim_jp_agg_group));
jag->group.s_addr = up->sg.grp.s_addr;
jag->sources = list_new();
jag->sources->cmp = pim_jp_agg_src_cmp;
jag->sources->del = (void (*)(void *))pim_jp_agg_src_free;
listnode_add_sort (group, jag);
}
for (ALL_LIST_ELEMENTS(jag->sources, node, nnode, js))
{
if (js->up == up)
break;
}
if (!js)
{
js = XCALLOC(MTYPE_PIM_JP_AGG_SOURCE, sizeof (struct pim_jp_sources));
js->up = up;
js->is_join = is_join;
listnode_add_sort (jag->sources, js);
}
else
{
if (js->is_join != is_join)
{
listnode_delete(jag->sources, js);
js->is_join = is_join;
listnode_add_sort (jag->sources, js);
}
}
}
void
pim_jp_agg_switch_interface (struct pim_rpf *orpf,
struct pim_rpf *nrpf,
struct pim_upstream *up)
{
struct pim_iface_upstream_switch *opius;
struct pim_iface_upstream_switch *npius;
opius = pim_jp_agg_get_interface_upstream_switch_list(orpf);
npius = pim_jp_agg_get_interface_upstream_switch_list(nrpf);
/*
* RFC 4601: 4.5.7. Sending (S,G) Join/Prune Messages
*
* Transitions from Joined State
*
* RPF'(S,G) changes not due to an Assert
*
* The upstream (S,G) state machine remains in Joined
* state. Send Join(S,G) to the new upstream neighbor, which is
* the new value of RPF'(S,G). Send Prune(S,G) to the old
* upstream neighbor, which is the old value of RPF'(S,G). Set
* the Join Timer (JT) to expire after t_periodic seconds.
*/
/* send Prune(S,G) to the old upstream neighbor */
pim_jp_agg_add_group (opius->us, up, false);
/* send Join(S,G) to the current upstream neighbor */
pim_jp_agg_add_group (npius->us, up, true);
}
void
pim_jp_agg_single_upstream_send (struct pim_rpf *rpf,
struct pim_upstream *up,
bool is_join)
{
static struct list *groups = NULL;
static struct pim_jp_agg_group jag;
static struct pim_jp_sources js;
static bool first = true;
/* skip JP upstream messages if source is directly connected */
if (pim_if_connected_to_source (rpf->source_nexthop.interface, up->sg.src))
return;
if (first)
{
groups = list_new();
jag.sources = list_new();
listnode_add(groups, &jag);
listnode_add(jag.sources, &js);
first = false;
}
jag.group.s_addr = up->sg.grp.s_addr;
js.up = up;
js.is_join = is_join;
pim_joinprune_send(rpf, groups);
}
|