ldp/ldp_nexthop.c

   1
   2 /*
   3  *  Copyright (C) James R. Leu 2003
   4  *  jleu@mindspring.com
   5  *
   6  *  This software is covered under the LGPL, for more
   7  *  info check out http://www.gnu.org/copyleft/lgpl.html
   8  */
   9
  10 #include "ldp_struct.h"
  11 #include "ldp_fec.h"
  12 #include "ldp_if.h"
  13 #include "ldp_addr.h"
  14 #include "ldp_session.h"
  15 #include "ldp_outlabel.h"
  16 #include "mpls_assert.h"
  17 #include "mpls_compare.h"
  18 #include "mpls_mm_impl.h"
  19 #include "mpls_tree_impl.h"
  20 #include "mpls_policy_impl.h"
  21 #include "mpls_trace_impl.h"
  22
  23 #if MPLS_USE_LSR
  24 #include "lsr_cfg.h"
  25 #else
  26 #include "mpls_mpls_impl.h"
  27 #endif
  28
  29 static uint32_t _ldp_nexthop_next_index = 1;
  30 static uint32_t _ldp_nexthop_get_next_index();
  31
  32 ldp_nexthop *ldp_nexthop_for_fec_session(ldp_fec *fec, ldp_session *s)
  33 {
  34   ldp_nexthop *nh = MPLS_LIST_HEAD(&fec->nh_root);
  35   ldp_session *sp;
  36   while (nh) {
  37     sp = ldp_session_for_nexthop(nh);
  38     if (s->index == sp->index) {
  39       return nh;
  40     }
  41     nh = MPLS_LIST_NEXT(&fec->nh_root, nh, _fec);
  42   }
  43   return NULL;
  44 }
  45
  46 ldp_nexthop *ldp_nexthop_create()
  47 {
  48   ldp_nexthop *nh = (ldp_nexthop *) mpls_malloc(sizeof(ldp_nexthop));
  49
  50   if (nh != NULL) {
  51     memset(nh, 0, sizeof(ldp_nexthop));
  52     MPLS_REFCNT_INIT(nh, 0);
  53     MPLS_LIST_ELEM_INIT(nh, _fec);
  54     MPLS_LIST_ELEM_INIT(nh, _addr);
  55     MPLS_LIST_ELEM_INIT(nh, _if);
  56     MPLS_LIST_ELEM_INIT(nh, _outlabel);
  57     nh->index = _ldp_nexthop_get_next_index();
  58   }
  59   return nh;
  60 }
  61
  62 void ldp_nexthop_delete(ldp_nexthop *nh)
  63 {
  64   mpls_free(nh);
  65 }
  66
  67 void ldp_nexthop_add_if(ldp_nexthop * nh, ldp_if * i)
  68 {
  69   MPLS_ASSERT(nh && i);
  70   MPLS_REFCNT_HOLD(i);
  71   nh->iff = i;
  72 }
  73
  74 void ldp_nexthop_del_if(ldp_nexthop * nh)
  75 {
  76   MPLS_ASSERT(nh);
  77   MPLS_REFCNT_RELEASE(nh->iff, ldp_if_delete);
  78   nh->iff = NULL;
  79 }
  80
  81 void ldp_nexthop_add_addr(ldp_nexthop * nh, ldp_addr * a)
  82 {
  83   MPLS_ASSERT(nh && a);
  84   MPLS_REFCNT_HOLD(a);
  85   nh->addr = a;
  86 }
  87
  88 void ldp_nexthop_del_addr(ldp_nexthop * nh)
  89 {
  90   MPLS_ASSERT(nh);
  91   MPLS_REFCNT_RELEASE(nh->addr, ldp_addr_delete);
  92   nh->addr = NULL;
  93 }
  94
  95 void ldp_nexthop_add_outlabel(ldp_nexthop * nh, ldp_outlabel * o)
  96 {
  97   MPLS_ASSERT(nh && o);
  98   MPLS_REFCNT_HOLD(o);
  99   nh->outlabel = o;
 100 }
 101
 102 void ldp_nexthop_del_outlabel(ldp_nexthop * nh)
 103 {
 104   MPLS_ASSERT(nh);
 105   MPLS_REFCNT_RELEASE(nh->outlabel, ldp_outlabel_delete);
 106   nh->outlabel = NULL;
 107 }
 108
 109 void mpls_nexthop2ldp_nexthop(mpls_nexthop *mnh, ldp_nexthop *lnh)
 110 {
 111   lnh->type = mnh->type;
 112   memcpy(mnh, &lnh->info, sizeof(mpls_nexthop));
 113 }
 114
 115 static uint32_t _ldp_nexthop_get_next_index()
 116 {
 117   uint32_t retval = _ldp_nexthop_next_index;
 118
 119   _ldp_nexthop_next_index++;
 120   if (retval > _ldp_nexthop_next_index) {
 121     _ldp_nexthop_next_index = 1;
 122   }
 123   return retval;
 124 }