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
  17  * along with this program; see the file COPYING; if not, write to the
  18  * Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
  19  * MA 02110-1301 USA
  20  */
  21 #include <zebra.h>
  22
  23 #include "memory.h"
  24 #include "log.h"
  25 #include "if.h"
  26
  27 #include "pimd.h"
  28 #include "pim_str.h"
  29 #include "pim_br.h"
  30 #include "linklist.h"
  31
  32 struct pim_br {
  33   struct prefix_sg sg;
  34   struct in_addr pmbr;
  35 };
  36
  37 struct in_addr pim_br_unknown = { .s_addr = 0 };
  38
  39 static struct list *pim_br_list = NULL;
  40
  41 struct in_addr
  42 pim_br_get_pmbr (struct prefix_sg *sg)
  43 {
  44   struct listnode *node;
  45   struct pim_br   *pim_br;
  46
  47   for (ALL_LIST_ELEMENTS_RO (pim_br_list, node, pim_br)) {
  48     if (sg->src.s_addr == pim_br->sg.src.s_addr &&
  49         sg->grp.s_addr == pim_br->sg.grp.s_addr)
  50       return pim_br->pmbr;
  51   }
  52
  53   return pim_br_unknown;
  54 }
  55
  56 void
  57 pim_br_set_pmbr (struct prefix_sg *sg, struct in_addr br)
  58 {
  59   struct listnode *node, *next;
  60   struct pim_br *pim_br;
  61
  62   for (ALL_LIST_ELEMENTS (pim_br_list, node, next, pim_br)) {
  63     if (sg->src.s_addr == pim_br->sg.src.s_addr &&
  64         sg->grp.s_addr == pim_br->sg.grp.s_addr)
  65       break;
  66   }
  67
  68   if (!pim_br) {
  69     pim_br = XCALLOC(MTYPE_PIM_BR, sizeof (*pim_br));
  70     if (!pim_br) {
  71       zlog_err("PIM XCALLOC(%zu) failure", sizeof(*pim_br));
  72       return;
  73     }
  74
  75     pim_br->sg = *sg;
  76
  77     listnode_add(pim_br_list, pim_br);
  78   }
  79
  80   pim_br->pmbr = br;
  81 }
  82
  83 /*
  84  * Remove the (S,G) from the stored values
  85  */
  86 void
  87 pim_br_clear_pmbr (struct prefix_sg *sg)
  88 {
  89   struct listnode *node, *next;
  90   struct pim_br *pim_br;
  91
  92   for (ALL_LIST_ELEMENTS (pim_br_list, node, next, pim_br)) {
  93     if (sg->src.s_addr == pim_br->sg.src.s_addr &&
  94         sg->grp.s_addr == pim_br->sg.grp.s_addr)
  95       break;
  96   }
  97
  98   if (!pim_br)
  99     return;
 100
 101   listnode_delete (pim_br_list, pim_br);
 102 }
 103
 104 void pim_br_init (void)
 105 {
 106   pim_br_list = list_new();
 107   if (!pim_br_list) {
 108     zlog_err("%s: Failure to create pim_br_list",
 109              __PRETTY_FUNCTION__);
 110     return;
 111   }
 112 }