radix_node_head
extern struct radix_node_head *rhead;
rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
struct radix_node_head *head)
struct radix_node_head *head,
struct radix_node_head *head,
struct radix_node_head *mask_rnhead;
struct radix_node_head *head)
rn_walktree(struct radix_node_head *h,
struct radix_node_head *rnh;
rnh = (struct radix_node_head *)rtmalloc(sizeof(*rnh), "rn_inithead");
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node_head *head, struct radix_node nodes[]);
(void *v, void *mask, struct radix_node_head *head);
(void *v, void *mask, struct radix_node_head *head);
(void *v, struct radix_node_head *head);
(void *v, void *mask, struct radix_node_head *head);
(void *v, struct radix_node_head *head);
(struct radix_node_head *head,
int rn_walktree(struct radix_node_head *,
*rn_addroute(void *, void *, struct radix_node_head *,
*rn_delete(void *, void *, struct radix_node_head *),
*rn_insert(void *, struct radix_node_head *, int *,
*rn_match(void *, struct radix_node_head *),
struct radix_node *rn_lookup(void *, void *, struct radix_node_head *);
struct radix_node_head *rhead; /* root of the radix tree */
struct radix_node_head *head = (void *)0xdeadb;
struct radix_node_head *head = (void *)0xdeadb;
SWAP(struct radix_node_head *, kt->pfrkt_ip4,
SWAP(struct radix_node_head *, kt->pfrkt_ip6,
struct radix_node_head *head = (void *)0xdeadb;
struct radix_node_head *pfrkt_ip4;
struct radix_node_head *pfrkt_ip6;
struct radix_node_head *rnh = wg_rnh(wg, wga->wga_family);
struct radix_node_head *rnh;
struct radix_node_head *rnh;
struct radix_node_head *wg_rtable_ipv4;
struct radix_node_head *wg_rtable_ipv6;
static struct radix_node_head *
rn_search_matched(struct radix_node_head *h,
struct radix_node_head *rnh;
R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
rn_inithead0(struct radix_node_head *rnh, int off)
struct radix_node_head *head)
struct radix_node_head *head)
rn_treeprint(struct radix_node_head *h, rn_printer_t printer, void *arg)
struct radix_node_head *head,
struct radix_node_head *head,
struct radix_node_head *mask_rnhead;
struct radix_node_head *head,
static void rn_treeprint(struct radix_node_head *, rn_printer_t, void *);
struct radix_node_head *head)
struct radix_node_head *h,
struct radix_node_head *head, struct radix_node nodes[]);
struct radix_node_head *head, struct radix_node nodes[]);
(const void *v, const void *mask, struct radix_node_head *head);
(const void *v, const void *mask, struct radix_node_head *head);
(const void *v, struct radix_node_head *head);
(const void *v, const void *mask, struct radix_node_head *head);
(const void *v, struct radix_node_head *head);
int rn_inithead0(struct radix_node_head *, int);
int rn_walktree(struct radix_node_head *,
rn_search_matched(struct radix_node_head *,
*rn_addroute(const void *, const void *, struct radix_node_head *,
*rn_delete1(const void *, const void *, struct radix_node_head *,
*rn_delete(const void *, const void *, struct radix_node_head *),
*rn_insert(const void *, struct radix_node_head *, int *,
*rn_lookup(const void *, const void *, struct radix_node_head *),
*rn_match(const void *, struct radix_node_head *),
struct radix_node_head t_rnh;
struct radix_node_head *rnh = &t->t_rnh;
struct radix_node_head *rnh = &t->t_rnh;
struct radix_node_head *rnh = &t->t_rnh;
struct radix_node_head *rnh = &t->t_rnh;
at_lookup(const void *v_arg, const void *m_arg, struct radix_node_head * head)
at_delroute(const void *v_arg, const void *netmask_arg, struct radix_node_head * head)
struct radix_node_head *rnh;
at_addroute(const void *v_arg, const void *n_arg, struct radix_node_head * head,
at_matroute(const void *v_arg, struct radix_node_head * head)
struct radix_node_head *ne_rtable[AF_MAX+1]; /* Individual exports */
struct radix_node_head *rnh;
struct radix_node_head *rnh = (struct radix_node_head *)w;
struct radix_node_head *rnh;
struct radix_node_head *rnh;
struct radix_node_head *rnh, head;
struct radix_node_head *rt_nodes[AF_MAX + 1];