]>
jfr.im git - solanum.git/blob - libratbox/include/rb_patricia.h
2 * $Id: patricia.h 23020 2006-09-01 18:20:19Z androsyn $
3 * Dave Plonka <plonka@doit.wisc.edu>
5 * This product includes software developed by the University of Michigan,
6 * Merit Network, Inc., and their contributors.
8 * This file had been called "radix.h" in the MRT sources.
10 * I renamed it to "patricia.h" since it's not an implementation of a general
11 * radix trie. Also, pulled in various requirements from "mrt.h" and added
12 * some other things it could be used as a standalone API.
15 #ifndef _RB_PATRICIA_H
16 #define _RB_PATRICIA_H
24 #ifndef INET6_ADDRSTRLEN
25 #define INET6_ADDRSTRLEN 46
28 /* typedef unsigned int u_int; */
29 #define rb_prefix_touchar(prefix) ((unsigned char *)&(prefix)->add.sin)
31 #define BIT_TEST(f, b) ((f) & (b))
33 typedef struct _rb_prefix_t
35 unsigned short family
; /* AF_INET | AF_INET6 */
36 unsigned short bitlen
; /* same as mask? */
37 int ref_count
; /* reference count */
50 typedef struct _rb_patricia_node_t
52 unsigned int bit
; /* flag if this node used */
53 rb_prefix_t
*prefix
; /* who we are in patricia tree */
54 struct _rb_patricia_node_t
*l
, *r
; /* left and right children */
55 struct _rb_patricia_node_t
*parent
; /* may be used */
60 typedef struct _rb_patricia_tree_t
62 rb_patricia_node_t
*head
;
63 unsigned int maxbits
; /* for IP, 32 bit addresses */
64 int num_active_node
; /* for debug purpose */
69 rb_patricia_node_t
*rb_match_ip(rb_patricia_tree_t
* tree
, struct sockaddr
*ip
);
70 rb_patricia_node_t
*rb_match_ip_exact(rb_patricia_tree_t
* tree
, struct sockaddr
*ip
, unsigned int len
);
71 rb_patricia_node_t
*rb_match_string(rb_patricia_tree_t
* tree
, const char *string
);
72 rb_patricia_node_t
*rb_match_exact_string(rb_patricia_tree_t
* tree
, const char *string
);
73 rb_patricia_node_t
*rb_patricia_search_exact(rb_patricia_tree_t
* patricia
, rb_prefix_t
* prefix
);
74 rb_patricia_node_t
*rb_patricia_search_best(rb_patricia_tree_t
* patricia
, rb_prefix_t
* prefix
);
75 rb_patricia_node_t
*rb_patricia_search_best2(rb_patricia_tree_t
* patricia
,
76 rb_prefix_t
* prefix
, int inclusive
);
77 rb_patricia_node_t
*rb_patricia_lookup(rb_patricia_tree_t
* patricia
, rb_prefix_t
* prefix
);
79 void rb_patricia_remove(rb_patricia_tree_t
* patricia
, rb_patricia_node_t
* node
);
80 rb_patricia_tree_t
*rb_new_patricia(int maxbits
);
81 void rb_clear_patricia(rb_patricia_tree_t
* patricia
, void (*func
)(void *));
82 void rb_destroy_patricia(rb_patricia_tree_t
* patricia
, void (*func
)(void *));
83 void rb_patricia_process(rb_patricia_tree_t
* patricia
, void (*func
)(rb_prefix_t
*, void *));
84 void rb_init_patricia(void);
88 rb_prefix_t
*ascii2prefix(int family
, char *string
);
90 rb_patricia_node_t
*make_and_lookup(rb_patricia_tree_t
* tree
, const char *string
);
91 rb_patricia_node_t
*make_and_lookup_ip(rb_patricia_tree_t
* tree
, struct sockaddr
*, int bitlen
);
94 #define RB_PATRICIA_MAXBITS 128
95 #define RB_PATRICIA_NBIT(x) (0x80 >> ((x) & 0x7f))
96 #define RB_PATRICIA_NBYTE(x) ((x) >> 3)
98 #define RB_PATRICIA_DATA_GET(node, type) (type *)((node)->data)
99 #define RB_PATRICIA_DATA_SET(node, value) ((node)->data = (void *)(value))
101 #define RB_PATRICIA_WALK(Xhead, Xnode) \
103 rb_patricia_node_t *Xstack[RB_PATRICIA_MAXBITS+1]; \
104 rb_patricia_node_t **Xsp = Xstack; \
105 rb_patricia_node_t *Xrn = (Xhead); \
106 while ((Xnode = Xrn)) { \
109 #define RB_PATRICIA_WALK_ALL(Xhead, Xnode) \
111 rb_patricia_node_t *Xstack[RB_PATRICIA_MAXBITS+1]; \
112 rb_patricia_node_t **Xsp = Xstack; \
113 rb_patricia_node_t *Xrn = (Xhead); \
114 while ((Xnode = Xrn)) { \
117 #define RB_PATRICIA_WALK_BREAK { \
118 if (Xsp != Xstack) { \
121 Xrn = (rb_patricia_node_t *) 0; \
125 #define RB_PATRICIA_WALK_END \
131 } else if (Xrn->r) { \
133 } else if (Xsp != Xstack) { \
136 Xrn = (rb_patricia_node_t *) 0; \
141 #endif /* _RB_PATRICIA_H */