2 * PIM for FRR - J/P Aggregation
3 * Copyright (C) 2017 Cumulus Networks, Inc.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
29 #include "pim_jp_agg.h"
31 #include "pim_iface.h"
33 void pim_jp_agg_group_list_free(struct pim_jp_agg_group
*jag
)
35 list_delete(jag
->sources
);
37 XFREE(MTYPE_PIM_JP_AGG_GROUP
, jag
);
40 static void pim_jp_agg_src_free(struct pim_jp_sources
*js
)
42 struct pim_upstream
*up
= js
->up
;
45 * When we are being called here, we know
46 * that the neighbor is going away start
47 * the normal j/p timer so that it can
48 * pick this shit back up when the
49 * nbr comes back alive
52 join_timer_start(js
->up
);
53 XFREE(MTYPE_PIM_JP_AGG_SOURCE
, js
);
56 int pim_jp_agg_group_list_cmp(void *arg1
, void *arg2
)
58 const struct pim_jp_agg_group
*jag1
=
59 (const struct pim_jp_agg_group
*)arg1
;
60 const struct pim_jp_agg_group
*jag2
=
61 (const struct pim_jp_agg_group
*)arg2
;
63 if (jag1
->group
.s_addr
< jag2
->group
.s_addr
)
66 if (jag1
->group
.s_addr
> jag2
->group
.s_addr
)
72 static int pim_jp_agg_src_cmp(void *arg1
, void *arg2
)
74 const struct pim_jp_sources
*js1
= (const struct pim_jp_sources
*)arg1
;
75 const struct pim_jp_sources
*js2
= (const struct pim_jp_sources
*)arg2
;
77 if (js1
->is_join
&& !js2
->is_join
)
80 if (!js1
->is_join
&& js2
->is_join
)
83 if ((uint32_t)js1
->up
->sg
.src
.s_addr
< (uint32_t)js2
->up
->sg
.src
.s_addr
)
86 if ((uint32_t)js1
->up
->sg
.src
.s_addr
> (uint32_t)js2
->up
->sg
.src
.s_addr
)
93 * This function is used by scan_oil to clear
94 * the created jp_agg_group created when
95 * figuring out where to send prunes
98 void pim_jp_agg_clear_group(struct list
*group
)
100 struct listnode
*gnode
, *gnnode
;
101 struct listnode
*snode
, *snnode
;
102 struct pim_jp_agg_group
*jag
;
103 struct pim_jp_sources
*js
;
105 for (ALL_LIST_ELEMENTS(group
, gnode
, gnnode
, jag
)) {
106 for (ALL_LIST_ELEMENTS(jag
->sources
, snode
, snnode
, js
)) {
107 listnode_delete(jag
->sources
, js
);
109 XFREE(MTYPE_PIM_JP_AGG_SOURCE
, js
);
111 list_delete(jag
->sources
);
113 listnode_delete(group
, jag
);
114 XFREE(MTYPE_PIM_JP_AGG_GROUP
, jag
);
118 static struct pim_iface_upstream_switch
*
119 pim_jp_agg_get_interface_upstream_switch_list(struct pim_rpf
*rpf
)
121 struct pim_interface
*pim_ifp
= rpf
->source_nexthop
.interface
->info
;
122 struct pim_iface_upstream_switch
*pius
;
123 struct listnode
*node
, *nnode
;
125 /* Old interface is pim disabled */
129 for (ALL_LIST_ELEMENTS(pim_ifp
->upstream_switch_list
, node
, nnode
,
131 if (pius
->address
.s_addr
== rpf
->rpf_addr
.u
.prefix4
.s_addr
)
136 pius
= XCALLOC(MTYPE_PIM_JP_AGG_GROUP
,
137 sizeof(struct pim_iface_upstream_switch
));
138 pius
->address
.s_addr
= rpf
->rpf_addr
.u
.prefix4
.s_addr
;
139 pius
->us
= list_new();
140 listnode_add_sort(pim_ifp
->upstream_switch_list
, pius
);
146 void pim_jp_agg_remove_group(struct list
*group
, struct pim_upstream
*up
)
148 struct listnode
*node
, *nnode
;
149 struct pim_jp_agg_group
*jag
= NULL
;
150 struct pim_jp_sources
*js
= NULL
;
152 for (ALL_LIST_ELEMENTS(group
, node
, nnode
, jag
)) {
153 if (jag
->group
.s_addr
== up
->sg
.grp
.s_addr
)
160 for (ALL_LIST_ELEMENTS(jag
->sources
, node
, nnode
, js
)) {
167 listnode_delete(jag
->sources
, js
);
168 XFREE(MTYPE_PIM_JP_AGG_SOURCE
, js
);
171 if (jag
->sources
->count
== 0) {
172 list_delete(jag
->sources
);
174 listnode_delete(group
, jag
);
175 XFREE(MTYPE_PIM_JP_AGG_GROUP
, jag
);
179 int pim_jp_agg_is_in_list(struct list
*group
, struct pim_upstream
*up
)
181 struct listnode
*node
, *nnode
;
182 struct pim_jp_agg_group
*jag
= NULL
;
183 struct pim_jp_sources
*js
= NULL
;
185 for (ALL_LIST_ELEMENTS(group
, node
, nnode
, jag
)) {
186 if (jag
->group
.s_addr
== up
->sg
.grp
.s_addr
)
193 for (ALL_LIST_ELEMENTS(jag
->sources
, node
, nnode
, js
)) {
201 //#define PIM_JP_AGG_DEBUG 1
203 * For the given upstream, check all the neighbor
204 * jp_agg lists and ensure that it is not
207 * *IF* ignore is true we can skip
208 * up->rpf.source_nexthop.interface particular interface for checking
210 * This is a debugging function, Probably
211 * can be safely compiled out in real
214 void pim_jp_agg_upstream_verification(struct pim_upstream
*up
, bool ignore
)
216 #ifdef PIM_JP_AGG_DEBUG
217 struct listnode
*node
;
218 struct interface
*ifp
;
219 struct pim_interface
*pim_ifp
= up
->rpf
.source_nexthop
.interface
->info
;
220 struct pim_instance
*pim
= pim_ifp
->pim
;
222 for (ALL_LIST_ELEMENTS_RO(vrf_iflist(pim
->vrf_id
), node
, ifp
)) {
224 struct listnode
*nnode
;
226 if (ignore
&& ifp
== up
->rpf
.source_nexthop
.interface
)
230 struct pim_neighbor
*neigh
;
231 for (ALL_LIST_ELEMENTS_RO(pim_ifp
->pim_neighbor_list
,
233 assert(!pim_jp_agg_is_in_list(
234 neigh
->upstream_jp_agg
, up
));
243 void pim_jp_agg_add_group(struct list
*group
, struct pim_upstream
*up
,
246 struct listnode
*node
, *nnode
;
247 struct pim_jp_agg_group
*jag
= NULL
;
248 struct pim_jp_sources
*js
= NULL
;
250 for (ALL_LIST_ELEMENTS(group
, node
, nnode
, jag
)) {
251 if (jag
->group
.s_addr
== up
->sg
.grp
.s_addr
)
256 jag
= XCALLOC(MTYPE_PIM_JP_AGG_GROUP
,
257 sizeof(struct pim_jp_agg_group
));
258 jag
->group
.s_addr
= up
->sg
.grp
.s_addr
;
259 jag
->sources
= list_new();
260 jag
->sources
->cmp
= pim_jp_agg_src_cmp
;
261 jag
->sources
->del
= (void (*)(void *))pim_jp_agg_src_free
;
262 listnode_add_sort(group
, jag
);
265 for (ALL_LIST_ELEMENTS(jag
->sources
, node
, nnode
, js
)) {
271 js
= XCALLOC(MTYPE_PIM_JP_AGG_SOURCE
,
272 sizeof(struct pim_jp_sources
));
274 js
->is_join
= is_join
;
275 listnode_add_sort(jag
->sources
, js
);
277 if (js
->is_join
!= is_join
) {
278 listnode_delete(jag
->sources
, js
);
279 js
->is_join
= is_join
;
280 listnode_add_sort(jag
->sources
, js
);
285 void pim_jp_agg_switch_interface(struct pim_rpf
*orpf
, struct pim_rpf
*nrpf
,
286 struct pim_upstream
*up
)
288 struct pim_iface_upstream_switch
*opius
;
289 struct pim_iface_upstream_switch
*npius
;
291 opius
= pim_jp_agg_get_interface_upstream_switch_list(orpf
);
292 npius
= pim_jp_agg_get_interface_upstream_switch_list(nrpf
);
295 * RFC 4601: 4.5.7. Sending (S,G) Join/Prune Messages
297 * Transitions from Joined State
299 * RPF'(S,G) changes not due to an Assert
301 * The upstream (S,G) state machine remains in Joined
302 * state. Send Join(S,G) to the new upstream neighbor, which is
303 * the new value of RPF'(S,G). Send Prune(S,G) to the old
304 * upstream neighbor, which is the old value of RPF'(S,G). Set
305 * the Join Timer (JT) to expire after t_periodic seconds.
308 /* send Prune(S,G) to the old upstream neighbor */
310 pim_jp_agg_add_group(opius
->us
, up
, false);
312 /* send Join(S,G) to the current upstream neighbor */
313 pim_jp_agg_add_group(npius
->us
, up
, true);
317 void pim_jp_agg_single_upstream_send(struct pim_rpf
*rpf
,
318 struct pim_upstream
*up
, bool is_join
)
320 static struct list
*groups
= NULL
;
321 static struct pim_jp_agg_group jag
;
322 static struct pim_jp_sources js
;
324 static bool first
= true;
326 /* skip JP upstream messages if source is directly connected */
327 if (!up
|| !rpf
->source_nexthop
.interface
|| pim_if_connected_to_source(
336 jag
.sources
= list_new();
338 listnode_add(groups
, &jag
);
339 listnode_add(jag
.sources
, &js
);
344 jag
.group
.s_addr
= up
->sg
.grp
.s_addr
;
346 js
.is_join
= is_join
;
348 pim_joinprune_send(rpf
, groups
);