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

Diff for /embedaddon/quagga/lib/table.c between versions 1.1.1.2 and 1.1.1.3

version 1.1.1.2, 2013/07/21 23:54:39 version 1.1.1.3, 2016/11/02 10:09:10
Line 29 Line 29
   
 static void route_node_delete (struct route_node *);  static void route_node_delete (struct route_node *);
 static void route_table_free (struct route_table *);  static void route_table_free (struct route_table *);
   
   
   
 /*  /*
  * route_table_init_with_delegate   * route_table_init_with_delegate
  */   */
Line 59  route_node_new (struct route_table *table) Line 59  route_node_new (struct route_table *table)
   
 /* Allocate new route node with prefix set. */  /* Allocate new route node with prefix set. */
 static struct route_node *  static struct route_node *
route_node_set (struct route_table *table, struct prefix *prefix)route_node_set (struct route_table *table, const struct prefix *prefix)
 {  {
   struct route_node *node;    struct route_node *node;
       
Line 141  static const u_char maskbit[] = Line 141  static const u_char maskbit[] =
   
 /* Common prefix route genaration. */  /* Common prefix route genaration. */
 static void  static void
route_common (struct prefix *n, struct prefix *p, struct prefix *new)route_common (const struct prefix *n, const struct prefix *p, struct prefix *new)
 {  {
   int i;    int i;
   u_char diff;    u_char diff;
   u_char mask;    u_char mask;
   
  u_char *np = (u_char *)&n->u.prefix;  const u_char *np = (const u_char *)&n->u.prefix;
  u_char *pp = (u_char *)&p->u.prefix;  const u_char *pp = (const u_char *)&p->u.prefix;
   u_char *newp = (u_char *)&new->u.prefix;    u_char *newp = (u_char *)&new->u.prefix;
   
   for (i = 0; i < p->prefixlen / 8; i++)    for (i = 0; i < p->prefixlen / 8; i++)
Line 265  route_node_match_ipv6 (const struct route_table *table Line 265  route_node_match_ipv6 (const struct route_table *table
   
 /* Lookup same prefix node.  Return NULL when we can't find route. */  /* Lookup same prefix node.  Return NULL when we can't find route. */
 struct route_node *  struct route_node *
route_node_lookup (const struct route_table *table, struct prefix *p)route_node_lookup (const struct route_table *table, const struct prefix *p)
 {  {
   struct route_node *node;    struct route_node *node;
   u_char prefixlen = p->prefixlen;    u_char prefixlen = p->prefixlen;
Line 287  route_node_lookup (const struct route_table *table, st Line 287  route_node_lookup (const struct route_table *table, st
   
 /* Add node to routing table. */  /* Add node to routing table. */
 struct route_node *  struct route_node *
route_node_get (struct route_table *const table, struct prefix *p)route_node_get (struct route_table *const table, const struct prefix *p)
 {  {
   struct route_node *new;    struct route_node *new;
   struct route_node *node;    struct route_node *node;
Line 626  route_table_get_next_internal (const struct route_tabl Line 626  route_table_get_next_internal (const struct route_tabl
                                struct prefix *p)                                 struct prefix *p)
 {  {
   struct route_node *node, *tmp_node;    struct route_node *node, *tmp_node;
   u_char prefixlen;  
   int cmp;    int cmp;
   
   prefixlen = p->prefixlen;  
   
   node = table->top;    node = table->top;
   
Removed from v.1.1.1.2  
changed lines
  Added in v.1.1.1.3

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