[BACK]Return to rib.h CVS log [TXT] [DIR] Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / quagga / zebra

Diff for /embedaddon/quagga/zebra/rib.h between versions 1.1.1.1 and 1.1.1.4

version 1.1.1.1, 2012/02/21 17:26:11 version 1.1.1.4, 2016/11/02 10:09:10
Line 23 Line 23
 #ifndef _ZEBRA_RIB_H  #ifndef _ZEBRA_RIB_H
 #define _ZEBRA_RIB_H  #define _ZEBRA_RIB_H
   
   #include "linklist.h"
 #include "prefix.h"  #include "prefix.h"
   #include "table.h"
   #include "queue.h"
   
 #define DISTANCE_INFINITY  255  #define DISTANCE_INFINITY  255
   
Line 38  union g_addr { Line 41  union g_addr {
   
 struct rib  struct rib
 {  {
   /* Status Flags for the *route_node*, but kept in the head RIB.. */  
   u_char rn_status;  
 #define RIB_ROUTE_QUEUED(x)     (1 << (x))  
   
   /* Link list. */    /* Link list. */
   struct rib *next;    struct rib *next;
   struct rib *prev;    struct rib *prev;
Line 58  struct rib Line 57  struct rib
   /* Type fo this route. */    /* Type fo this route. */
   int type;    int type;
   
     /* VRF identifier. */
     vrf_id_t vrf_id;
   
   /* Which routing table */    /* Which routing table */
   int table;                        int table;                    
   
   /* Metric */    /* Metric */
   u_int32_t metric;    u_int32_t metric;
   
     /* MTU */
     u_int32_t mtu;
     u_int32_t nexthop_mtu;
   
   /* Distance. */    /* Distance. */
   u_char distance;    u_char distance;
   
Line 76  struct rib Line 82  struct rib
   /* RIB internal status */    /* RIB internal status */
   u_char status;    u_char status;
 #define RIB_ENTRY_REMOVED       (1 << 0)  #define RIB_ENTRY_REMOVED       (1 << 0)
   #define RIB_ENTRY_CHANGED       (1 << 1)
   #define RIB_ENTRY_SELECTED_FIB  (1 << 2)
   
   /* Nexthop information. */    /* Nexthop information. */
   u_char nexthop_num;    u_char nexthop_num;
Line 97  struct meta_queue Line 105  struct meta_queue
   u_int32_t size; /* sum of lengths of all subqueues */    u_int32_t size; /* sum of lengths of all subqueues */
 };  };
   
/* Static route information. *//*
struct static_ipv4 * Structure that represents a single destination (prefix).
  */
 typedef struct rib_dest_t_
 {  {
   /* For linked list. */  
   struct static_ipv4 *prev;  
   struct static_ipv4 *next;  
   
  /* Administrative distance. */  /*
  u_char distance;   * Back pointer to the route node for this destination. This helps
    * us get to the prefix that this structure is for.
    */
   struct route_node *rnode;
   
  /* Flag for this static route's type. */  /*
  u_char type;   * Doubly-linked list of routes for this prefix.
#define STATIC_IPV4_GATEWAY     1   */
#define STATIC_IPV4_IFNAME      2  struct rib *routes;
#define STATIC_IPV4_BLACKHOLE   3 
   
  /* Nexthop value. */  /*
  union    * Flags, see below.
  {   */
    struct in_addr ipv4;  u_int32_t flags;
    char *ifname; 
  } gate; 
   
  /* bit flags */  /*
  u_char flags;   * Linkage to put dest on the FPM processing queue.
    */
   TAILQ_ENTRY(rib_dest_t_) fpm_q_entries;
 
 } rib_dest_t;
 
 #define RIB_ROUTE_QUEUED(x)     (1 << (x))
 
 /*  /*
 see ZEBRA_FLAG_REJECT * The maximum qindex that can be used.
     ZEBRA_FLAG_BLACKHOLE 
  */   */
};#define ZEBRA_MAX_QINDEX        (MQ_SIZE - 1)
   
#ifdef HAVE_IPV6/*
  * This flag indicates that a given prefix has been 'advertised' to
  * the FPM to be installed in the forwarding plane.
  */
 #define RIB_DEST_SENT_TO_FPM   (1 << (ZEBRA_MAX_QINDEX + 1))
 
 /*
  * This flag is set when we need to send an update to the FPM about a
  * dest.
  */
 #define RIB_DEST_UPDATE_FPM    (1 << (ZEBRA_MAX_QINDEX + 2))
 
 /*
  * Macro to iterate over each route for a destination (prefix).
  */
 #define RIB_DEST_FOREACH_ROUTE(dest, rib)                               \
   for ((rib) = (dest) ? (dest)->routes : NULL; (rib); (rib) = (rib)->next)
 
 /*
  * Same as above, but allows the current node to be unlinked.
  */
 #define RIB_DEST_FOREACH_ROUTE_SAFE(dest, rib, next)    \
   for ((rib) = (dest) ? (dest)->routes : NULL;          \
        (rib) && ((next) = (rib)->next, 1);              \
        (rib) = (next))
 
 #define RNODE_FOREACH_RIB(rn, rib)                              \
   RIB_DEST_FOREACH_ROUTE (rib_dest_from_rnode (rn), rib)
 
 #define RNODE_FOREACH_RIB_SAFE(rn, rib, next)                           \
   RIB_DEST_FOREACH_ROUTE_SAFE (rib_dest_from_rnode (rn), rib, next)
 
 /* Static route information. */  /* Static route information. */
struct static_ipv6struct static_route
 {  {
   /* For linked list. */    /* For linked list. */
  struct static_ipv6 *prev;  struct static_route *prev;
  struct static_ipv6 *next;  struct static_route *next;
   
     /* VRF identifier. */
     vrf_id_t vrf_id;
   
   /* Administrative distance. */    /* Administrative distance. */
   u_char distance;    u_char distance;
   
   /* Flag for this static route's type. */    /* Flag for this static route's type. */
   u_char type;    u_char type;
#define STATIC_IPV6_GATEWAY          1#define STATIC_IPV4_GATEWAY          1
#define STATIC_IPV6_GATEWAY_IFNAME   2#define STATIC_IPV4_IFNAME           2
#define STATIC_IPV6_IFNAME           3#define STATIC_IPV4_BLACKHOLE        3
 #define STATIC_IPV6_GATEWAY          4
 #define STATIC_IPV6_GATEWAY_IFNAME   5
 #define STATIC_IPV6_IFNAME           6
   
   /* Nexthop value. */    /* Nexthop value. */
  struct in6_addr ipv6;  union g_addr addr;
   char *ifname;    char *ifname;
   
   /* bit flags */    /* bit flags */
Line 156  struct static_ipv6 Line 206  struct static_ipv6
      ZEBRA_FLAG_BLACKHOLE       ZEBRA_FLAG_BLACKHOLE
  */   */
 };  };
 #endif /* HAVE_IPV6 */  
   
 enum nexthop_types_t  enum nexthop_types_t
 {  {
Line 179  struct nexthop Line 228  struct nexthop
   
   /* Interface index. */    /* Interface index. */
   char *ifname;    char *ifname;
  unsigned int ifindex;  ifindex_t ifindex;
       
   enum nexthop_types_t type;    enum nexthop_types_t type;
   
Line 187  struct nexthop Line 236  struct nexthop
 #define NEXTHOP_FLAG_ACTIVE     (1 << 0) /* This nexthop is alive. */  #define NEXTHOP_FLAG_ACTIVE     (1 << 0) /* This nexthop is alive. */
 #define NEXTHOP_FLAG_FIB        (1 << 1) /* FIB nexthop. */  #define NEXTHOP_FLAG_FIB        (1 << 1) /* FIB nexthop. */
 #define NEXTHOP_FLAG_RECURSIVE  (1 << 2) /* Recursive nexthop. */  #define NEXTHOP_FLAG_RECURSIVE  (1 << 2) /* Recursive nexthop. */
   #define NEXTHOP_FLAG_ONLINK     (1 << 3) /* Nexthop should be installed onlink. */
   
  /* Nexthop address or interface name. */  /* Nexthop address */
   union g_addr gate;    union g_addr gate;
   
   /* Recursive lookup nexthop. */  
   u_char rtype;  
   unsigned int rifindex;  
   union g_addr rgate;  
   union g_addr src;    union g_addr src;
   
     /* Nexthops obtained by recursive resolution.
      *
      * If the nexthop struct needs to be resolved recursively,
      * NEXTHOP_FLAG_RECURSIVE will be set in flags and the nexthops
      * obtained by recursive resolution will be added to `resolved'.
      * Only one level of recursive resolution is currently supported. */
     struct nexthop *resolved;
 };  };
   
   /* The following for loop allows to iterate over the nexthop
    * structure of routes.
    *
    * We have to maintain quite a bit of state:
    *
    * nexthop:   The pointer to the current nexthop, either in the
    *            top-level chain or in the resolved chain of ni.
    * tnexthop:  The pointer to the current nexthop in the top-level
    *            nexthop chain.
    * recursing: Information if nh currently is in the top-level chain
    *            (0) or in a resolved chain (1).
    *
    * Initialization: Set `nexthop' and `tnexthop' to the head of the
    * top-level chain. As nexthop is in the top level chain, set recursing
    * to 0.
    *
    * Iteration check: Check that the `nexthop' pointer is not NULL.
    *
    * Iteration step: This is the tricky part. Check if `nexthop' has
    * NEXTHOP_FLAG_RECURSIVE set. If yes, this implies that `nexthop' is in
    * the top level chain and has at least one nexthop attached to
    * `nexthop->resolved'. As we want to descend into `nexthop->resolved',
    * set `recursing' to 1 and set `nexthop' to `nexthop->resolved'.
    * `tnexthop' is left alone in that case so we can remember which nexthop
    * in the top level chain we are currently handling.
    *
    * If NEXTHOP_FLAG_RECURSIVE is not set, `nexthop' will progress in its
    * current chain. If we are recursing, `nexthop' will be set to
    * `nexthop->next' and `tnexthop' will be left alone. If we are not
    * recursing, both `tnexthop' and `nexthop' will be set to `nexthop->next'
    * as we are progressing in the top level chain.
    *   If we encounter `nexthop->next == NULL', we will clear the `recursing'
    * flag as we arived either at the end of the resolved chain or at the end
    * of the top level chain. In both cases, we set `tnexthop' and `nexthop'
    * to `tnexthop->next', progressing to the next position in the top-level
    * chain and possibly to its end marked by NULL.
    */
   #define ALL_NEXTHOPS_RO(head, nexthop, tnexthop, recursing) \
     (tnexthop) = (nexthop) = (head), (recursing) = 0; \
     (nexthop); \
     (nexthop) = CHECK_FLAG((nexthop)->flags, NEXTHOP_FLAG_RECURSIVE) \
       ? (((recursing) = 1), (nexthop)->resolved) \
       : ((nexthop)->next ? ((recursing) ? (nexthop)->next \
                                         : ((tnexthop) = (nexthop)->next)) \
                          : (((recursing) = 0),((tnexthop) = (tnexthop)->next)))
   
   /* Structure holding nexthop & VRF identifier,
    * used for applying the route-map. */
   struct nexthop_vrfid
   {
     struct nexthop *nexthop;
     vrf_id_t vrf_id;
   };
   
   
   #if defined (HAVE_RTADV)
   /* Structure which hold status of router advertisement. */
   struct rtadv
   {
     int sock;
   
     int adv_if_count;
     int adv_msec_if_count;
   
     struct thread *ra_read;
     struct thread *ra_timer;
   };
   #endif /* HAVE_RTADV */
   
   #ifdef HAVE_NETLINK
   /* Socket interface to kernel */
   struct nlsock
   {
     int sock;
     int seq;
     struct sockaddr_nl snl;
     const char *name;
   };
   #endif
   
 /* Routing table instance.  */  /* Routing table instance.  */
struct vrfstruct zebra_vrf
 {  {
  /* Identifier.  This is same as routing table vector index.  */  /* Identifier. */
  u_int32_t id;  vrf_id_t vrf_id;
   
   /* Routing table name.  */    /* Routing table name.  */
   char *name;    char *name;
Line 218  struct vrf Line 351  struct vrf
   
   /* Static route configuration.  */    /* Static route configuration.  */
   struct route_table *stable[AFI_MAX][SAFI_MAX];    struct route_table *stable[AFI_MAX][SAFI_MAX];
   
   #ifdef HAVE_NETLINK
     struct nlsock netlink;     /* kernel messages */
     struct nlsock netlink_cmd; /* command channel */
     struct thread *t_netlink;
   #endif
   
     /* 2nd pointer type used primarily to quell a warning on
      * ALL_LIST_ELEMENTS_RO
      */
     struct list _rid_all_sorted_list;
     struct list _rid_lo_sorted_list;
     struct list *rid_all_sorted_list;
     struct list *rid_lo_sorted_list;
     struct prefix rid_user_assigned;
   
   #if defined (HAVE_RTADV)
     struct rtadv rtadv;
   #endif /* HAVE_RTADV */
 };  };
   
extern struct nexthop *nexthop_ifindex_add (struct rib *, unsigned int);/*
  * rib_table_info_t
  *
  * Structure that is hung off of a route_table that holds information about
  * the table.
  */
 typedef struct rib_table_info_t_
 {
 
   /*
    * Back pointer to zebra_vrf.
    */
   struct zebra_vrf *zvrf;
   afi_t afi;
   safi_t safi;
 
 } rib_table_info_t;
 
 typedef enum
 {
   RIB_TABLES_ITER_S_INIT,
   RIB_TABLES_ITER_S_ITERATING,
   RIB_TABLES_ITER_S_DONE
 } rib_tables_iter_state_t;
 
 /*
  * Structure that holds state for iterating over all tables in the
  * Routing Information Base.
  */
 typedef struct rib_tables_iter_t_
 {
   vrf_id_t vrf_id;
   int afi_safi_ix;
 
   rib_tables_iter_state_t state;
 } rib_tables_iter_t;
 
 /* RPF lookup behaviour */
 enum multicast_mode
 {
   MCAST_NO_CONFIG = 0,  /* MIX_MRIB_FIRST, but no show in config write */
   MCAST_MRIB_ONLY,      /* MRIB only */
   MCAST_URIB_ONLY,      /* URIB only */
   MCAST_MIX_MRIB_FIRST, /* MRIB, if nothing at all then URIB */
   MCAST_MIX_DISTANCE,   /* MRIB & URIB, lower distance wins */
   MCAST_MIX_PFXLEN,     /* MRIB & URIB, longer prefix wins */
                         /* on equal value, MRIB wins for last 2 */
 };
 
 extern void multicast_mode_ipv4_set (enum multicast_mode mode);
 extern enum multicast_mode multicast_mode_ipv4_get (void);
 
 extern const char *nexthop_type_to_str (enum nexthop_types_t nh_type);
 extern struct nexthop *nexthop_ifindex_add (struct rib *, ifindex_t);
 extern struct nexthop *nexthop_ifname_add (struct rib *, char *);  extern struct nexthop *nexthop_ifname_add (struct rib *, char *);
 extern struct nexthop *nexthop_blackhole_add (struct rib *);  extern struct nexthop *nexthop_blackhole_add (struct rib *);
 extern struct nexthop *nexthop_ipv4_add (struct rib *, struct in_addr *,  extern struct nexthop *nexthop_ipv4_add (struct rib *, struct in_addr *,
                                          struct in_addr *);                                           struct in_addr *);
   extern struct nexthop *nexthop_ipv4_ifindex_add (struct rib *,
                                                    struct in_addr *,
                                                    struct in_addr *,
                                                    ifindex_t);
   extern int nexthop_has_fib_child(struct nexthop *);
 extern void rib_lookup_and_dump (struct prefix_ipv4 *);  extern void rib_lookup_and_dump (struct prefix_ipv4 *);
 extern void rib_lookup_and_pushup (struct prefix_ipv4 *);  extern void rib_lookup_and_pushup (struct prefix_ipv4 *);
extern void rib_dump (const char *, const struct prefix_ipv4 *, const struct rib *);#define rib_dump(prefix ,rib) _rib_dump(__func__, prefix, rib)
extern int rib_lookup_ipv4_route (struct prefix_ipv4 *, union sockunion *);extern void _rib_dump (const char *,
                        union prefix46constptr, const struct rib *);
 extern int rib_lookup_ipv4_route (struct prefix_ipv4 *, union sockunion *,
                                   vrf_id_t);
 #define ZEBRA_RIB_LOOKUP_ERROR -1  #define ZEBRA_RIB_LOOKUP_ERROR -1
 #define ZEBRA_RIB_FOUND_EXACT 0  #define ZEBRA_RIB_FOUND_EXACT 0
 #define ZEBRA_RIB_FOUND_NOGATE 1  #define ZEBRA_RIB_FOUND_NOGATE 1
 #define ZEBRA_RIB_FOUND_CONNECTED 2  #define ZEBRA_RIB_FOUND_CONNECTED 2
 #define ZEBRA_RIB_NOTFOUND 3  #define ZEBRA_RIB_NOTFOUND 3
   
 #ifdef HAVE_IPV6  
 extern struct nexthop *nexthop_ipv6_add (struct rib *, struct in6_addr *);  extern struct nexthop *nexthop_ipv6_add (struct rib *, struct in6_addr *);
 #endif /* HAVE_IPV6 */  
   
extern struct vrf *vrf_lookup (u_int32_t);extern struct zebra_vrf *zebra_vrf_alloc (vrf_id_t);
extern struct route_table *vrf_table (afi_t afi, safi_t safi, u_int32_t id);extern struct route_table *zebra_vrf_table (afi_t, safi_t, vrf_id_t);
extern struct route_table *vrf_static_table (afi_t afi, safi_t safi, u_int32_t id);extern struct route_table *zebra_vrf_static_table (afi_t, safi_t, vrf_id_t);
   
 /* NOTE:  /* NOTE:
  * All rib_add_ipv[46]* functions will not just add prefix into RIB, but   * All rib_add_ipv[46]* functions will not just add prefix into RIB, but
  * also implicitly withdraw equal prefix of same type. */   * also implicitly withdraw equal prefix of same type. */
 extern int rib_add_ipv4 (int type, int flags, struct prefix_ipv4 *p,   extern int rib_add_ipv4 (int type, int flags, struct prefix_ipv4 *p, 
                          struct in_addr *gate, struct in_addr *src,                           struct in_addr *gate, struct in_addr *src,
                         unsigned int ifindex, u_int32_t vrf_id,                         ifindex_t ifindex, vrf_id_t vrf_id, int table_id,
                         u_int32_t, u_char);                         u_int32_t, u_int32_t, u_char, safi_t);
   
extern int rib_add_ipv4_multipath (struct prefix_ipv4 *, struct rib *);extern int rib_add_ipv4_multipath (struct prefix_ipv4 *, struct rib *, safi_t);
   
 extern int rib_delete_ipv4 (int type, int flags, struct prefix_ipv4 *p,  extern int rib_delete_ipv4 (int type, int flags, struct prefix_ipv4 *p,
                            struct in_addr *gate, unsigned int ifindex,                             struct in_addr *gate, ifindex_t ifindex, 
                            u_int32_t);                            vrf_id_t, safi_t safi);
   
extern struct rib *rib_match_ipv4 (struct in_addr);extern struct rib *rib_match_ipv4_safi (struct in_addr addr, safi_t safi,
                                         int skip_bgp, struct route_node **rn_out,
                                         vrf_id_t);
 extern struct rib *rib_match_ipv4_multicast (struct in_addr addr,
                                              struct route_node **rn_out,
                                              vrf_id_t);
   
extern struct rib *rib_lookup_ipv4 (struct prefix_ipv4 *);extern struct rib *rib_lookup_ipv4 (struct prefix_ipv4 *, vrf_id_t);
   
extern void rib_update (void);extern void rib_update (vrf_id_t);
 extern void rib_weed_tables (void);  extern void rib_weed_tables (void);
 extern void rib_sweep_route (void);  extern void rib_sweep_route (void);
   extern void rib_close_table (struct route_table *);
 extern void rib_close (void);  extern void rib_close (void);
 extern void rib_init (void);  extern void rib_init (void);
   extern unsigned long rib_score_proto (u_char proto);
   
 extern int  extern int
static_add_ipv4 (struct prefix *p, struct in_addr *gate, const char *ifname,static_add_ipv4_safi (safi_t safi, struct prefix *p, struct in_addr *gate,
       u_char flags, u_char distance, u_int32_t vrf_id);                      const char *ifname, u_char flags, u_char distance,
                      vrf_id_t vrf_id);
 extern int  extern int
static_delete_ipv4 (struct prefix *p, struct in_addr *gate, const char *ifname,static_delete_ipv4_safi (safi_t safi, struct prefix *p, struct in_addr *gate,
                    u_char distance, u_int32_t vrf_id);                         const char *ifname, u_char distance, vrf_id_t vrf_id);
   
 #ifdef HAVE_IPV6  
 extern int  extern int
 rib_add_ipv6 (int type, int flags, struct prefix_ipv6 *p,  rib_add_ipv6 (int type, int flags, struct prefix_ipv6 *p,
              struct in6_addr *gate, unsigned int ifindex, u_int32_t vrf_id,              struct in6_addr *gate, ifindex_t ifindex, vrf_id_t vrf_id,
              u_int32_t metric, u_char distance);              int table_id, u_int32_t metric, u_int32_t mtu,
               u_char distance, safi_t safi);
   
 extern int  extern int
 rib_delete_ipv6 (int type, int flags, struct prefix_ipv6 *p,  rib_delete_ipv6 (int type, int flags, struct prefix_ipv6 *p,
                 struct in6_addr *gate, unsigned int ifindex, u_int32_t vrf_id);                 struct in6_addr *gate, ifindex_t ifindex, vrf_id_t vrf_id, safi_t safi);
   
extern struct rib *rib_lookup_ipv6 (struct in6_addr *);extern struct rib *rib_lookup_ipv6 (struct in6_addr *, vrf_id_t);
   
extern struct rib *rib_match_ipv6 (struct in6_addr *);extern struct rib *rib_match_ipv6 (struct in6_addr *, vrf_id_t);
   
 extern struct route_table *rib_table_ipv6;  extern struct route_table *rib_table_ipv6;
   
 extern int  extern int
 static_add_ipv6 (struct prefix *p, u_char type, struct in6_addr *gate,  static_add_ipv6 (struct prefix *p, u_char type, struct in6_addr *gate,
                  const char *ifname, u_char flags, u_char distance,                   const char *ifname, u_char flags, u_char distance,
                 u_int32_t vrf_id);                 vrf_id_t vrf_id);
   
 extern int  extern int
 static_delete_ipv6 (struct prefix *p, u_char type, struct in6_addr *gate,  static_delete_ipv6 (struct prefix *p, u_char type, struct in6_addr *gate,
                    const char *ifname, u_char distance, u_int32_t vrf_id);                    const char *ifname, u_char distance, vrf_id_t vrf_id);
   
#endif /* HAVE_IPV6 */extern int rib_gc_dest (struct route_node *rn);
 extern struct route_table *rib_tables_iter_next (rib_tables_iter_t *iter);
 
 /*
  * Inline functions.
  */
 
 /*
  * rib_table_info
  */
 static inline rib_table_info_t *
 rib_table_info (struct route_table *table)
 {
   return (rib_table_info_t *) table->info;
 }
 
 /*
  * rib_dest_from_rnode
  */
 static inline rib_dest_t *
 rib_dest_from_rnode (struct route_node *rn)
 {
   return (rib_dest_t *) rn->info;
 }
 
 /*
  * rnode_to_ribs
  *
  * Returns a pointer to the list of routes corresponding to the given
  * route_node.
  */
 static inline struct rib *
 rnode_to_ribs (struct route_node *rn)
 {
   rib_dest_t *dest;
 
   dest = rib_dest_from_rnode (rn);
   if (!dest)
     return NULL;
 
   return dest->routes;
 }
 
 /*
  * rib_dest_prefix
  */
 static inline struct prefix *
 rib_dest_prefix (rib_dest_t *dest)
 {
   return &dest->rnode->p;
 }
 
 /*
  * rib_dest_af
  *
  * Returns the address family that the destination is for.
  */
 static inline u_char
 rib_dest_af (rib_dest_t *dest)
 {
   return dest->rnode->p.family;
 }
 
 /*
  * rib_dest_table
  */
 static inline struct route_table *
 rib_dest_table (rib_dest_t *dest)
 {
   return dest->rnode->table;
 }
 
 /*
  * rib_dest_vrf
  */
 static inline struct zebra_vrf *
 rib_dest_vrf (rib_dest_t *dest)
 {
   return rib_table_info (rib_dest_table (dest))->zvrf;
 }
 
 /*
  * rib_tables_iter_init
  */
 static inline void
 rib_tables_iter_init (rib_tables_iter_t *iter)
 
 {
   memset (iter, 0, sizeof (*iter));
   iter->state = RIB_TABLES_ITER_S_INIT;
 }
 
 /*
  * rib_tables_iter_started
  *
  * Returns TRUE if this iterator has started iterating over the set of
  * tables.
  */
 static inline int
 rib_tables_iter_started (rib_tables_iter_t *iter)
 {
   return iter->state != RIB_TABLES_ITER_S_INIT;
 }
 
 /*
  * rib_tables_iter_cleanup
  */
 static inline void
 rib_tables_iter_cleanup (rib_tables_iter_t *iter)
 {
   iter->state = RIB_TABLES_ITER_S_DONE;
 }
   
 #endif /*_ZEBRA_RIB_H */  #endif /*_ZEBRA_RIB_H */
Removed from v.1.1.1.1  
changed lines
  Added in v.1.1.1.4

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>