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         pim_sgaddr 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(pim_sgaddr *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 (!pim_sgaddr_cmp(*sg, pim_br->sg))
  47                         return pim_br->pmbr;
  48         }
  49
  50         return pim_br_unknown;
  51 }
  52
  53 void pim_br_set_pmbr(pim_sgaddr *sg, struct in_addr br)
  54 {
  55         struct listnode *node, *next;
  56         struct pim_br *pim_br;
  57
  58         for (ALL_LIST_ELEMENTS(pim_br_list, node, next, pim_br)) {
  59                 if (!pim_sgaddr_cmp(*sg, pim_br->sg))
  60                         break;
  61         }
  62
  63         if (!pim_br) {
  64                 pim_br = XCALLOC(MTYPE_PIM_BR, sizeof(*pim_br));
  65                 pim_br->sg = *sg;
  66
  67                 listnode_add(pim_br_list, pim_br);
  68         }
  69
  70         pim_br->pmbr = br;
  71 }
  72
  73 /*
  74  * Remove the (S,G) from the stored values
  75  */
  76 void pim_br_clear_pmbr(pim_sgaddr *sg)
  77 {
  78         struct listnode *node, *next;
  79         struct pim_br *pim_br;
  80
  81         for (ALL_LIST_ELEMENTS(pim_br_list, node, next, pim_br)) {
  82                 if (!pim_sgaddr_cmp(*sg, pim_br->sg))
  83                         break;
  84         }
  85
  86         if (!pim_br)
  87                 return;
  88
  89         listnode_delete(pim_br_list, pim_br);
  90 }
  91
  92 void pim_br_init(void)
  93 {
  94         pim_br_list = list_new();
  95 }