1 /* 2 * Copyright (c) 1988, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 * 7 * @(#)radix.h 8.2 (Berkeley) 10/31/94 8 */ 9 10 #ifndef _RADIX_H_ 11 #define _RADIX_H_ 12 13 /* 14 * Radix search tree node layout. 15 */ 16 17 struct radix_node { 18 struct radix_mask *rn_mklist; /* list of masks contained in subtree */ 19 struct radix_node *rn_p; /* parent */ 20 short rn_b; /* bit offset; -1-index(netmask) */ 21 char rn_bmask; /* node: mask for bit test*/ 22 u_char rn_flags; /* enumerated next */ 23 #define RNF_NORMAL 1 /* leaf contains normal route */ 24 #define RNF_ROOT 2 /* leaf is root leaf for tree */ 25 #define RNF_ACTIVE 4 /* This node is alive (for rtfree) */ 26 union { 27 struct { /* leaf only data: */ 28 caddr_t rn_Key; /* object of search */ 29 caddr_t rn_Mask; /* netmask, if present */ 30 struct radix_node *rn_Dupedkey; 31 } rn_leaf; 32 struct { /* node only data: */ 33 int rn_Off; /* where to start compare */ 34 struct radix_node *rn_L;/* progeny */ 35 struct radix_node *rn_R;/* progeny */ 36 }rn_node; 37 } rn_u; 38 #ifdef RN_DEBUG 39 int rn_info; 40 struct radix_node *rn_twin; 41 struct radix_node *rn_ybro; 42 #endif 43 }; 44 45 #define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey 46 #define rn_key rn_u.rn_leaf.rn_Key 47 #define rn_mask rn_u.rn_leaf.rn_Mask 48 #define rn_off rn_u.rn_node.rn_Off 49 #define rn_l rn_u.rn_node.rn_L 50 #define rn_r rn_u.rn_node.rn_R 51 52 /* 53 * Annotations to tree concerning potential routes applying to subtrees. 54 */ 55 56 extern struct radix_mask { 57 short rm_b; /* bit offset; -1-index(netmask) */ 58 char rm_unused; /* cf. rn_bmask */ 59 u_char rm_flags; /* cf. rn_flags */ 60 struct radix_mask *rm_mklist; /* more masks to try */ 61 union { 62 caddr_t rmu_mask; /* the mask */ 63 struct radix_node *rmu_leaf; /* for normal routes */ 64 } rm_rmu; 65 int rm_refs; /* # of references to this struct */ 66 } *rn_mkfreelist; 67 68 #define rm_mask rm_rmu.rmu_mask 69 #define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ 70 71 #define MKGet(m) {\ 72 if (rn_mkfreelist) {\ 73 m = rn_mkfreelist; \ 74 rn_mkfreelist = (m)->rm_mklist; \ 75 } else \ 76 R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\ 77 78 #define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} 79 80 struct radix_node_head { 81 struct radix_node *rnh_treetop; 82 int rnh_addrsize; /* permit, but not require fixed keys */ 83 int rnh_pktsize; /* permit, but not require fixed keys */ 84 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */ 85 __P((void *v, void *mask, 86 struct radix_node_head *head, struct radix_node nodes[])); 87 struct radix_node *(*rnh_addpkt) /* add based on packet hdr */ 88 __P((void *v, void *mask, 89 struct radix_node_head *head, struct radix_node nodes[])); 90 struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */ 91 __P((void *v, void *mask, struct radix_node_head *head)); 92 struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */ 93 __P((void *v, void *mask, struct radix_node_head *head)); 94 struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */ 95 __P((void *v, struct radix_node_head *head)); 96 struct radix_node *(*rnh_lookup) /* locate based on sockaddr */ 97 __P((void *v, void *mask, struct radix_node_head *head)); 98 struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */ 99 __P((void *v, struct radix_node_head *head)); 100 int (*rnh_walktree) /* traverse tree */ 101 __P((struct radix_node_head *head, int (*f)(), void *w)); 102 struct radix_node rnh_nodes[3]; /* empty tree for common case */ 103 }; 104 105 106 #ifndef KERNEL 107 #define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n)) 108 #define Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n)) 109 #define Bzero(p, n) bzero((char *)(p), (int)(n)); 110 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n))) 111 #define Free(p) free((char *)p); 112 #else 113 #define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 114 #define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n)) 115 #define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n)); 116 #define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT)) 117 #define Free(p) free((caddr_t)p, M_RTABLE); 118 #endif /*KERNEL*/ 119 120 void rn_init __P((void)); 121 int rn_inithead __P((void **, int)); 122 int rn_refines __P((void *, void *)); 123 int rn_walktree __P((struct radix_node_head *, int (*)(), void *)); 124 struct radix_node 125 *rn_addmask __P((void *, int, int)), 126 *rn_addroute __P((void *, void *, struct radix_node_head *, 127 struct radix_node [2])), 128 *rn_delete __P((void *, void *, struct radix_node_head *)), 129 *rn_insert __P((void *, struct radix_node_head *, int *, 130 struct radix_node [2])), 131 *rn_match __P((void *, struct radix_node_head *)), 132 *rn_newpair __P((void *, int, struct radix_node[2])), 133 *rn_search __P((void *, struct radix_node *)), 134 *rn_search_m __P((void *, struct radix_node *, void *)); 135 136 #endif /* _RADIX_H_ */ 137