Go to the source code of this file.
|
#define | RNF_NORMAL 1 /* leaf contains normal route */ |
|
#define | RNF_ROOT 2 /* leaf is root leaf for tree */ |
|
#define | RNF_ACTIVE 4 /* This node is alive (for rtfree) */ |
|
#define | rn_dupedkey rn_u.rn_leaf.rn_Dupedkey |
|
#define | rn_key rn_u.rn_leaf.rn_Key |
|
#define | rn_mask rn_u.rn_leaf.rn_Mask |
|
#define | rn_offset rn_u.rn_node.rn_Off |
|
#define | rn_left rn_u.rn_node.rn_L |
|
#define | rn_right rn_u.rn_node.rn_R |
|
#define | rm_mask rm_rmu.rmu_mask |
|
#define | rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */ |
|
#define | MKGet(m) |
|
#define | MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);} |
|
#define | Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n)) |
|
#define | Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n)) |
|
#define | Bzero(p, n) bzero((char *)(p), (int)(n)); |
|
#define | R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n))) |
|
#define | R_Zalloc(p, t, n) (p = (t) calloc(1,(unsigned int)(n))) |
|
#define | Free(p) free((char *)p); |
|
|
typedef int | walktree_f_t(struct radix_node *, void *) |
|
|
void | rn_init (void) |
|
int | rn_inithead (void **, int) |
|
int | rn_refines (void *, void *) |
|
struct radix_node * | rn_addmask (void *, int, int) |
|
struct radix_node * | rn_addroute (void *, void *, struct radix_node_head *, struct radix_node [2]) |
|
struct radix_node * | rn_delete (void *, void *, struct radix_node_head *) |
|
struct radix_node * | rn_lookup (void *v_arg, void *m_arg, struct radix_node_head *head) |
|
struct radix_node * | rn_match (void *, struct radix_node_head *) |
|
◆ MKGet
Value:{\
if (rn_mkfreelist) {\
m = rn_mkfreelist; \
rn_mkfreelist = (m)->rm_mklist; \
} else \
R_Malloc(m,
struct radix_mask *,
sizeof (*(m))); }\