kroute6_node
int kroute6_insert(struct ktable *, struct kroute6_node *);
int kroute6_remove(struct ktable *, struct kroute6_node *);
struct kroute6_node *kr6;
RB_PROTOTYPE(kroute6_tree, kroute6_node, entry, kroute6_compare)
RB_GENERATE(kroute6_tree, kroute6_node, entry, kroute6_compare)
sizeof(struct kroute6_node))) == NULL) {
kroute6_compare(struct kroute6_node *a, struct kroute6_node *b)
struct kroute6_node *
struct kroute6_node s;
struct kroute6_node *kn6, *tmp;
struct kroute6_node *
kroute6_matchgw(struct kroute6_node *kr, struct sockaddr_in6 *sa_in6)
kroute6_insert(struct ktable *kt, struct kroute6_node *kr)
struct kroute6_node *krm;
kroute6_remove(struct ktable *kt, struct kroute6_node *kr)
struct kroute6_node *krm;
RB_ENTRY(kroute6_node) entry;
struct kroute6_node *kr;
struct kroute6_node *next;
int kroute6_compare(struct kroute6_node *, struct kroute6_node *);
struct kroute6_node *kroute6_find(struct ktable *, const struct in6_addr *,
struct kroute6_node *kroute6_matchgw(struct kroute6_node *,
struct kroute6_node;
RB_HEAD(kroute6_tree, kroute6_node);