pimd/pim_br.c

   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  *
  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
  19  */
  20 #include <zebra.h>
  21
  22 #include "memory.h"
  23 #include "log.h"
  24 #include "if.h"
  25
  26 #include "pimd.h"
  27 #include "pim_str.h"
  28 #include "pim_br.h"
  29 #include "linklist.h"
  30
  31 struct pim_br {
  32         struct prefix_sg sg;
  33         struct in_addr pmbr;
  34 };
  35
  36 struct in_addr pim_br_unknown = {.s_addr = 0};
  37
  38 static struct list *pim_br_list = NULL;
  39
  40 struct in_addr pim_br_get_pmbr(struct prefix_sg *sg)
  41 {
  42         struct listnode *node;
  43         struct pim_br *pim_br;
  44
  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         }
  50
  51         return pim_br_unknown;
  52 }
  53
  54 void pim_br_set_pmbr(struct prefix_sg *sg, struct in_addr br)
  55 {
  56         struct listnode *node, *next;
  57         struct pim_br *pim_br;
  58
  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         }
  64
  65         if (!pim_br) {
  66                 pim_br = XCALLOC(MTYPE_PIM_BR, sizeof(*pim_br));
  67                 pim_br->sg = *sg;
  68
  69                 listnode_add(pim_br_list, pim_br);
  70         }
  71
  72         pim_br->pmbr = br;
  73 }
  74
  75 /*
  76  * Remove the (S,G) from the stored values
  77  */
  78 void pim_br_clear_pmbr(struct prefix_sg *sg)
  79 {
  80         struct listnode *node, *next;
  81         struct pim_br *pim_br;
  82
  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         }
  88
  89         if (!pim_br)
  90                 return;
  91
  92         listnode_delete(pim_br_list, pim_br);
  93 }
  94
  95 void pim_br_init(void)
  96 {
  97         pim_br_list = list_new();
  98 }