]>
Commit | Line | Data |
---|---|---|
2bd9e1bc DS |
1 | /* |
2 | * PIM for Quagga | |
3 | * Copyright (C) 2015 Cumulus Networks, Inc. | |
4 | * Donald Sharp | |
5 | * | |
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. | |
10 | * | |
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. | |
15 | * | |
896014f4 DL |
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 | |
2bd9e1bc DS |
19 | */ |
20 | #include <zebra.h> | |
21 | ||
22 | #include "memory.h" | |
23 | #include "log.h" | |
744d91b3 | 24 | #include "if.h" |
2bd9e1bc DS |
25 | |
26 | #include "pimd.h" | |
27 | #include "pim_str.h" | |
28 | #include "pim_br.h" | |
29 | #include "linklist.h" | |
30 | ||
31 | struct pim_br { | |
d62a17ae | 32 | struct prefix_sg sg; |
33 | struct in_addr pmbr; | |
2bd9e1bc DS |
34 | }; |
35 | ||
d62a17ae | 36 | struct in_addr pim_br_unknown = {.s_addr = 0}; |
2bd9e1bc DS |
37 | |
38 | static struct list *pim_br_list = NULL; | |
39 | ||
d62a17ae | 40 | struct in_addr pim_br_get_pmbr(struct prefix_sg *sg) |
2bd9e1bc | 41 | { |
d62a17ae | 42 | struct listnode *node; |
43 | struct pim_br *pim_br; | |
2bd9e1bc | 44 | |
d62a17ae | 45 | for (ALL_LIST_ELEMENTS_RO(pim_br_list, node, pim_br)) { |
46 | if (sg->src.s_addr == pim_br->sg.src.s_addr | |
47 | && sg->grp.s_addr == pim_br->sg.grp.s_addr) | |
48 | return pim_br->pmbr; | |
49 | } | |
2bd9e1bc | 50 | |
d62a17ae | 51 | return pim_br_unknown; |
2bd9e1bc DS |
52 | } |
53 | ||
d62a17ae | 54 | void pim_br_set_pmbr(struct prefix_sg *sg, struct in_addr br) |
2bd9e1bc | 55 | { |
d62a17ae | 56 | struct listnode *node, *next; |
57 | struct pim_br *pim_br; | |
2bd9e1bc | 58 | |
d62a17ae | 59 | for (ALL_LIST_ELEMENTS(pim_br_list, node, next, pim_br)) { |
60 | if (sg->src.s_addr == pim_br->sg.src.s_addr | |
61 | && sg->grp.s_addr == pim_br->sg.grp.s_addr) | |
62 | break; | |
63 | } | |
2bd9e1bc | 64 | |
d62a17ae | 65 | if (!pim_br) { |
66 | pim_br = XCALLOC(MTYPE_PIM_BR, sizeof(*pim_br)); | |
d62a17ae | 67 | pim_br->sg = *sg; |
2bd9e1bc | 68 | |
d62a17ae | 69 | listnode_add(pim_br_list, pim_br); |
70 | } | |
2bd9e1bc | 71 | |
d62a17ae | 72 | pim_br->pmbr = br; |
2bd9e1bc DS |
73 | } |
74 | ||
f14248dd DS |
75 | /* |
76 | * Remove the (S,G) from the stored values | |
77 | */ | |
d62a17ae | 78 | void pim_br_clear_pmbr(struct prefix_sg *sg) |
f14248dd | 79 | { |
d62a17ae | 80 | struct listnode *node, *next; |
81 | struct pim_br *pim_br; | |
f14248dd | 82 | |
d62a17ae | 83 | for (ALL_LIST_ELEMENTS(pim_br_list, node, next, pim_br)) { |
84 | if (sg->src.s_addr == pim_br->sg.src.s_addr | |
85 | && sg->grp.s_addr == pim_br->sg.grp.s_addr) | |
86 | break; | |
87 | } | |
f14248dd | 88 | |
d62a17ae | 89 | if (!pim_br) |
90 | return; | |
f14248dd | 91 | |
d62a17ae | 92 | listnode_delete(pim_br_list, pim_br); |
f14248dd | 93 | } |
2bd9e1bc | 94 | |
d62a17ae | 95 | void pim_br_init(void) |
2bd9e1bc | 96 | { |
d62a17ae | 97 | pim_br_list = list_new(); |
2bd9e1bc | 98 | } |