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

Diff for /embedaddon/quagga/lib/table.h between versions 1.1.1.1 and 1.1.1.2

version 1.1.1.1, 2012/02/21 17:26:12 version 1.1.1.2, 2013/07/21 23:54:39
Line 23 Line 23
 #ifndef _ZEBRA_TABLE_H  #ifndef _ZEBRA_TABLE_H
 #define _ZEBRA_TABLE_H  #define _ZEBRA_TABLE_H
   
   /*
    * Forward declarations.
    */
   struct route_node;
   struct route_table;
   
   /*
    * route_table_delegate_t
    *
    * Function vector that can be used by a client to customize the
    * behavior of one or more route tables.
    */
   typedef struct route_table_delegate_t_ route_table_delegate_t;
   
   typedef struct route_node * (*route_table_create_node_func_t) 
     (route_table_delegate_t *, struct route_table *);
   
   typedef void (*route_table_destroy_node_func_t) 
     (route_table_delegate_t *, struct route_table *, struct route_node *);
   
   struct route_table_delegate_t_ 
   {
     route_table_create_node_func_t create_node;
     route_table_destroy_node_func_t destroy_node;
   };
   
 /* Routing table top structure. */  /* Routing table top structure. */
 struct route_table  struct route_table
 {  {
   struct route_node *top;    struct route_node *top;
   
     /*
      * Delegate that performs certain functions for this table.
      */
     route_table_delegate_t *delegate;
     
     unsigned long count;
     
     /*
      * User data.
      */
     void *info;
 };  };
   
   /*
    * Macro that defines all fields in a route node.
    */
   #define ROUTE_NODE_FIELDS                       \
     /* Actual prefix of this radix. */            \
     struct prefix p;                              \
                                                   \
     /* Tree link. */                              \
     struct route_table *table;                    \
     struct route_node *parent;                    \
     struct route_node *link[2];                   \
                                                   \
     /* Lock of this radix */                      \
     unsigned int lock;                            \
                                                   \
     /* Each node of route. */                     \
     void *info;                                   \
                                                   \
     /* Aggregation. */                            \
     void *aggregate;
   
   
 /* Each routing entry. */  /* Each routing entry. */
 struct route_node  struct route_node
 {  {
  /* Actual prefix of this radix. */  ROUTE_NODE_FIELDS;
  struct prefix p; 
   
   /* Tree link. */  
   struct route_table *table;  
   struct route_node *parent;  
   struct route_node *link[2];  
 #define l_left   link[0]  #define l_left   link[0]
 #define l_right  link[1]  #define l_right  link[1]
   };
   
  /* Lock of this radix */typedef struct route_table_iter_t_ route_table_iter_t;
  unsigned int lock; 
   
  /* Each node of route. */typedef enum 
  void *info;{
   RT_ITER_STATE_INIT,
   RT_ITER_STATE_ITERATING,
   RT_ITER_STATE_PAUSED,
   RT_ITER_STATE_DONE
 } route_table_iter_state_t;
   
  /* Aggregation. *//*
  void *aggregate; * route_table_iter_t
  * 
  * Structure that holds state for iterating over a route table.
  */
 struct route_table_iter_t_ 
 {
 
   route_table_iter_state_t state;
 
   /*
    * Routing table that we are iterating over. The caller must ensure
    * that that table outlives the iterator.
    */
   struct route_table *table;
 
   /*
    * The node that the iterator is currently on.
    */
   struct route_node *current;
 
   /*
    * The last prefix that the iterator processed before it was paused.
    */  
   struct prefix pause_prefix;
 };  };
   
 /* Prototypes. */  /* Prototypes. */
 extern struct route_table *route_table_init (void);  extern struct route_table *route_table_init (void);
   
   extern struct route_table *
   route_table_init_with_delegate (route_table_delegate_t *);
   
 extern void route_table_finish (struct route_table *);  extern void route_table_finish (struct route_table *);
 extern void route_unlock_node (struct route_node *node);  extern void route_unlock_node (struct route_node *node);
 extern void route_node_delete (struct route_node *node);  
 extern struct route_node *route_top (struct route_table *);  extern struct route_node *route_top (struct route_table *);
 extern struct route_node *route_next (struct route_node *);  extern struct route_node *route_next (struct route_node *);
 extern struct route_node *route_next_until (struct route_node *,  extern struct route_node *route_next_until (struct route_node *,
                                             struct route_node *);                                              struct route_node *);
extern struct route_node *route_node_get (struct route_table *,extern struct route_node *route_node_get (struct route_table *const,
                                           struct prefix *);                                            struct prefix *);
extern struct route_node *route_node_lookup (struct route_table *,extern struct route_node *route_node_lookup (const struct route_table *,
                                              struct prefix *);                                               struct prefix *);
 extern struct route_node *route_lock_node (struct route_node *node);  extern struct route_node *route_lock_node (struct route_node *node);
 extern struct route_node *route_node_match (const struct route_table *,  extern struct route_node *route_node_match (const struct route_table *,
Line 74  extern struct route_node *route_node_match_ipv4 (const Line 160  extern struct route_node *route_node_match_ipv4 (const
 extern struct route_node *route_node_match_ipv6 (const struct route_table *,  extern struct route_node *route_node_match_ipv6 (const struct route_table *,
                                                  const struct in6_addr *);                                                   const struct in6_addr *);
 #endif /* HAVE_IPV6 */  #endif /* HAVE_IPV6 */
   
   extern unsigned long route_table_count (const struct route_table *);
   
   extern struct route_node *
   route_table_get_next (const struct route_table *table, struct prefix *p);
   extern int
   route_table_prefix_iter_cmp (struct prefix *p1, struct prefix *p2);
   
   /*
    * Iterator functions.
    */
   extern void route_table_iter_init (route_table_iter_t *iter,
                                      struct route_table *table);
   extern void route_table_iter_pause (route_table_iter_t *iter);
   extern void route_table_iter_cleanup (route_table_iter_t *iter);
   
   /*
    * Inline functions.
    */
   
   /*
    * route_table_iter_next
    *
    * Get the next node in the tree.
    */
   static inline struct route_node *
   route_table_iter_next (route_table_iter_t * iter)
   {
     struct route_node *node;
   
     switch (iter->state)
       {
   
       case RT_ITER_STATE_INIT:
   
         /*
          * We're just starting the iteration.
          */
         node = route_top (iter->table);
         break;
   
       case RT_ITER_STATE_ITERATING:
         node = route_next (iter->current);
         break;
   
       case RT_ITER_STATE_PAUSED:
   
         /*
          * Start with the node following pause_prefix.
          */
         node = route_table_get_next (iter->table, &iter->pause_prefix);
         break;
   
       case RT_ITER_STATE_DONE:
         return NULL;
   
       default:
         assert (0);
       }
   
     iter->current = node;
     if (node)
       iter->state = RT_ITER_STATE_ITERATING;
     else
       iter->state = RT_ITER_STATE_DONE;
   
     return node;
   }
   
   /*
    * route_table_iter_is_done
    *
    * Returns TRUE if the iteration is complete.
    */
   static inline int
   route_table_iter_is_done (route_table_iter_t *iter)
   {
     return iter->state == RT_ITER_STATE_DONE;
   }
   
   /*
    * route_table_iter_started
    *
    * Returns TRUE if this iterator has started iterating over the tree.
    */
   static inline int
   route_table_iter_started (route_table_iter_t *iter)
   {
     return iter->state != RT_ITER_STATE_INIT;
   }
   
 #endif /* _ZEBRA_TABLE_H */  #endif /* _ZEBRA_TABLE_H */
Removed from v.1.1.1.1  
changed lines
  Added in v.1.1.1.2

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