sbin/routed/radix.h

   1 /*
   2  * Copyright (c) 1988, 1989, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  *      @(#)radix.h     8.2 (Berkeley) 10/31/94
  30  *
  31  * $FreeBSD: src/sbin/routed/radix.h,v 1.4 1999/08/28 00:14:17 peter Exp $
  32  * $DragonFly: src/sbin/routed/radix.h,v 1.5 2004/02/04 17:40:01 joerg Exp $
  33  */
  34
  35 #ifndef __RADIX_H_
  36 #define __RADIX_H_
  37
  38 #include <sys/cdefs.h>
  39 struct walkarg;
  40
  41 /*
  42  * Radix search tree node layout.
  43  */
  44
  45 struct radix_node {
  46         struct  radix_mask *rn_mklist;  /* list of masks contained in subtree */
  47         struct  radix_node *rn_p;       /* parent */
  48         short   rn_b;                   /* bit offset; -1-index(netmask) */
  49         char    rn_bmask;               /* node: mask for bit test*/
  50         u_char  rn_flags;               /* enumerated next */
  51 #define RNF_NORMAL      1               /* leaf contains normal route */
  52 #define RNF_ROOT        2               /* leaf is root leaf for tree */
  53 #define RNF_ACTIVE      4               /* This node is alive (for rtfree) */
  54         union {
  55                 struct {                        /* leaf only data: */
  56                         caddr_t rn_Key; /* object of search */
  57                         caddr_t rn_Mask;        /* netmask, if present */
  58                         struct  radix_node *rn_Dupedkey;
  59                 } rn_leaf;
  60                 struct {                        /* node only data: */
  61                         int     rn_Off;         /* where to start compare */
  62                         struct  radix_node *rn_L;/* progeny */
  63                         struct  radix_node *rn_R;/* progeny */
  64                 }rn_node;
  65         }               rn_u;
  66 #ifdef RN_DEBUG
  67         int rn_info;
  68         struct radix_node *rn_twin;
  69         struct radix_node *rn_ybro;
  70 #endif
  71 };
  72
  73 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
  74 #define rn_key rn_u.rn_leaf.rn_Key
  75 #define rn_mask rn_u.rn_leaf.rn_Mask
  76 #define rn_off rn_u.rn_node.rn_Off
  77 #define rn_l rn_u.rn_node.rn_L
  78 #define rn_r rn_u.rn_node.rn_R
  79
  80 /*
  81  * Annotations to tree concerning potential routes applying to subtrees.
  82  */
  83
  84 extern struct radix_mask {
  85         short   rm_b;                   /* bit offset; -1-index(netmask) */
  86         char    rm_unused;              /* cf. rn_bmask */
  87         u_char  rm_flags;               /* cf. rn_flags */
  88         struct  radix_mask *rm_mklist;  /* more masks to try */
  89         union   {
  90                 caddr_t rmu_mask;               /* the mask */
  91                 struct  radix_node *rmu_leaf;   /* for normal routes */
  92         }       rm_rmu;
  93         int     rm_refs;                /* # of references to this struct */
  94 } *rn_mkfreelist;
  95
  96 #define rm_mask rm_rmu.rmu_mask
  97 #define rm_leaf rm_rmu.rmu_leaf         /* extra field would make 32 bytes */
  98
  99 #define MKGet(m) {\
 100         if (rn_mkfreelist) {\
 101                 m = rn_mkfreelist; \
 102                 rn_mkfreelist = (m)->rm_mklist; \
 103         } else \
 104                 m = (struct radix_mask *)rtmalloc(sizeof(*(m)), "MKGet"); }\
 105
 106 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
 107
 108 struct radix_node_head {
 109         struct  radix_node *rnh_treetop;
 110         int     rnh_addrsize;           /* permit, but not require fixed keys */
 111         int     rnh_pktsize;            /* permit, but not require fixed keys */
 112         struct  radix_node *(*rnh_addaddr)      /* add based on sockaddr */
 113                 (void *v, void *mask,
 114                      struct radix_node_head *head, struct radix_node nodes[]);
 115         struct  radix_node *(*rnh_addpkt)       /* add based on packet hdr */
 116                 (void *v, void *mask,
 117                      struct radix_node_head *head, struct radix_node nodes[]);
 118         struct  radix_node *(*rnh_deladdr)      /* remove based on sockaddr */
 119         (void *v, void *mask, struct radix_node_head *head);
 120         struct  radix_node *(*rnh_delpkt)       /* remove based on packet hdr */
 121         (void *v, void *mask, struct radix_node_head *head);
 122         struct  radix_node *(*rnh_matchaddr)    /* locate based on sockaddr */
 123         (void *v, struct radix_node_head *head);
 124         struct  radix_node *(*rnh_lookup)       /* locate based on sockaddr */
 125         (void *v, void *mask, struct radix_node_head *head);
 126         struct  radix_node *(*rnh_matchpkt)     /* locate based on packet hdr */
 127         (void *v, struct radix_node_head *head);
 128         int     (*rnh_walktree)                 /* traverse tree */
 129                         (struct radix_node_head *head,
 130                          int (*f)(struct radix_node *, struct walkarg *),
 131                          struct walkarg *w);
 132         struct  radix_node rnh_nodes[3];        /* empty tree for common case */
 133 };
 134
 135
 136 #define Bcmp(a, b, n) memcmp(((void *)(a)), ((void *)(b)), (n))
 137 #define Bcopy(a, b, n) memmove(((void *)(b)), ((void *)(a)), (size_t)(n))
 138 #define Bzero(p, n) memset((void *)(p), 0, (size_t)(n));
 139 #define Free(p) free((void *)p);
 140
 141 void     rn_init(void);
 142 int      rn_inithead(struct radix_node_head **, int);
 143 int      rn_refines(void *, void *);
 144 int      rn_walktree(struct radix_node_head *,
 145                      int (*)(struct radix_node *, struct walkarg *),
 146                      struct walkarg *);
 147
 148 struct radix_node
 149          *rn_addmask(void *, int, int),
 150          *rn_addroute(void *, void *, struct radix_node_head *,
 151                         struct radix_node [2]),
 152          *rn_delete(void *, void *, struct radix_node_head *),
 153          *rn_insert(void *, struct radix_node_head *, int *,
 154                         struct radix_node [2]),
 155          *rn_match(void *, struct radix_node_head *),
 156          *rn_newpair(void *, int, struct radix_node[2]),
 157          *rn_search(void *, struct radix_node *),
 158          *rn_search_m(void *, struct radix_node *, void *);
 159
 160 struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
 161
 162 #endif /* __RADIX_H_ */