knexthop
struct knexthop;
RB_HEAD(knexthop_tree, knexthop);
int knexthop_compare(struct knexthop *, struct knexthop *);
struct knexthop *nh;
struct knexthop *knexthop_find(struct ktable *, struct bgpd_addr *);
int knexthop_insert(struct ktable *, struct knexthop *);
knexthop_compare(struct knexthop *a, struct knexthop *b)
void knexthop_remove(struct ktable *, struct knexthop *);
void knexthop_validate(struct ktable *, struct knexthop *);
struct knexthop *n;
void knexthop_send_update(struct knexthop *);
void kroute_detach_nexthop(struct ktable *, struct knexthop *);
struct knexthop *n;
struct knexthop *n;
RB_PROTOTYPE(knexthop_tree, knexthop, entry, knexthop_compare)
RB_GENERATE(knexthop_tree, knexthop, entry, knexthop_compare)
struct knexthop *
struct knexthop s;
knexthop_insert(struct ktable *kt, struct knexthop *kn)
knexthop_remove(struct ktable *kt, struct knexthop *kn)
struct knexthop *kn;
struct knexthop *kn;
knexthop_validate(struct ktable *kt, struct knexthop *kn)
struct knexthop *kn;
struct knexthop *kn;
knexthop_send_update(struct knexthop *kn)
kroute_detach_nexthop(struct ktable *kt, struct knexthop *kn)
struct knexthop *s;
struct knexthop *h;
struct knexthop *kn;
RB_ENTRY(knexthop) entry;
struct knexthop *h;