kif_addr
struct kif_addr *ka;
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
struct kif_addr *ka;
int ka_compare(struct kif_addr *, struct kif_addr *);
void ka_insert(u_short, struct kif_addr *);
struct kif_addr *ka_find(struct sockaddr *);
int ka_remove(struct kif_addr *);
RB_HEAD(ka_tree, kif_addr) kat;
RB_PROTOTYPE(ka_tree, kif_addr, node, ka_compare)
RB_GENERATE(ka_tree, kif_addr, node, ka_compare)
ka_compare(struct kif_addr *a, struct kif_addr *b)
TAILQ_HEAD(, kif_addr) addrs;
struct kif_addr *ka;
ka_insert(u_short if_index, struct kif_addr *ka)
struct kif_addr *
struct kif_addr ka;
ka_remove(struct kif_addr *ka)
struct kif_addr *
struct kif_addr *
struct kif_addr ka;
struct kif_addr *ka;
TAILQ_ENTRY(kif_addr) entry;
RB_ENTRY(kif_addr) node;
struct kif_addr *kr_getaddr(struct sockaddr *);
struct kif_addr *kr_getnextaddr(struct sockaddr *);
struct kif_addr *ka;
struct kif_addr *ka;
struct kif_addr {
TAILQ_ENTRY(kif_addr) entry;
TAILQ_HEAD(, kif_addr) addrs;
struct kif_addr *ka;
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
struct kif_addr *ka, *nka;
struct kif_addr *ka;
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
struct kif_addr *ka, *nka;
struct kif_addr *ka;
struct kif_addr {
TAILQ_ENTRY(kif_addr) entry;
TAILQ_HEAD(, kif_addr) addrs;
struct kif_addr *ka;
struct kif_addr *ka;
if_new(struct kif *kif, struct kif_addr *ka)
struct kif_addr *ka;
if ((ka = calloc(1, sizeof(struct kif_addr))) == NULL)
struct kif_addr *ka, *nka;
TAILQ_HEAD(, kif_addr) addrs;
kif_findname(char *ifname, struct in_addr addr, struct kif_addr **kap)
struct kif_addr *ka;
struct kif_addr *ka;
TAILQ_ENTRY(kif_addr) entry;
struct kif *kif_findname(char *, struct in_addr, struct kif_addr **);
struct iface *if_new(struct kif *, struct kif_addr *);
struct iface *conf_get_if(struct kif *, struct kif_addr *);
conf_get_if(struct kif *kif, struct kif_addr *ka)
struct kif_addr *ka = NULL;