libexec/snmpd/snmpd_metrics/kroute.c
106
int karp_insert(struct kif_node *, struct kif_arp *);
libexec/snmpd/snmpd_metrics/kroute.c
107
int karp_remove(struct kif_node *, struct kif_arp *);
libexec/snmpd/snmpd_metrics/kroute.c
109
struct kif_node *kif_find(u_short);
libexec/snmpd/snmpd_metrics/kroute.c
110
struct kif_node *kif_insert(u_short);
libexec/snmpd/snmpd_metrics/kroute.c
1105
struct kif_node *kif;
libexec/snmpd/snmpd_metrics/kroute.c
111
int kif_remove(struct kif_node *);
libexec/snmpd/snmpd_metrics/kroute.c
1137
struct kif_node *kif;
libexec/snmpd/snmpd_metrics/kroute.c
1158
struct kif_node *kif;
libexec/snmpd/snmpd_metrics/kroute.c
148
RB_HEAD(kif_tree, kif_node) kit;
libexec/snmpd/snmpd_metrics/kroute.c
149
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
libexec/snmpd/snmpd_metrics/kroute.c
150
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
libexec/snmpd/snmpd_metrics/kroute.c
427
kif_compare(struct kif_node *a, struct kif_node *b)
libexec/snmpd/snmpd_metrics/kroute.c
687
karp_search(struct kif_node *kn, struct kif_arp *ka)
libexec/snmpd/snmpd_metrics/kroute.c
706
struct kif_node *kn;
libexec/snmpd/snmpd_metrics/kroute.c
72
RB_ENTRY(kif_node) entry;
libexec/snmpd/snmpd_metrics/kroute.c
731
karp_insert(struct kif_node *kn, struct kif_arp *ka)
libexec/snmpd/snmpd_metrics/kroute.c
755
karp_remove(struct kif_node *kn, struct kif_arp *ka)
libexec/snmpd/snmpd_metrics/kroute.c
769
struct kif_node *kn;
libexec/snmpd/snmpd_metrics/kroute.c
786
struct kif_node *
libexec/snmpd/snmpd_metrics/kroute.c
789
struct kif_node s;
libexec/snmpd/snmpd_metrics/kroute.c
80
int kif_compare(struct kif_node *, struct kif_node *);
libexec/snmpd/snmpd_metrics/kroute.c
803
struct kif_node *kn;
libexec/snmpd/snmpd_metrics/kroute.c
815
struct kif_node *kn;
libexec/snmpd/snmpd_metrics/kroute.c
827
struct kif_node *
libexec/snmpd/snmpd_metrics/kroute.c
830
struct kif_node *kif;
libexec/snmpd/snmpd_metrics/kroute.c
832
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL)
libexec/snmpd/snmpd_metrics/kroute.c
849
kif_remove(struct kif_node *kif)
libexec/snmpd/snmpd_metrics/kroute.c
877
struct kif_node *kif;
libexec/snmpd/snmpd_metrics/kroute.c
889
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
117
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
129
kif_compare(struct kif_node *a, struct kif_node *b)
usr.sbin/dvmrpd/kroute.c
134
struct kif_node *
usr.sbin/dvmrpd/kroute.c
137
struct kif_node s;
usr.sbin/dvmrpd/kroute.c
148
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
158
kif_insert(struct kif_node *kif)
usr.sbin/dvmrpd/kroute.c
170
kif_remove(struct kif_node *kif)
usr.sbin/dvmrpd/kroute.c
184
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
229
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
255
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
261
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL) {
usr.sbin/dvmrpd/kroute.c
304
struct kif_node *kif;
usr.sbin/dvmrpd/kroute.c
340
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL) {
usr.sbin/dvmrpd/kroute.c
49
RB_ENTRY(kif_node) entry;
usr.sbin/dvmrpd/kroute.c
53
int kif_compare(struct kif_node *, struct kif_node *);
usr.sbin/dvmrpd/kroute.c
55
struct kif_node *kif_find(int);
usr.sbin/dvmrpd/kroute.c
56
int kif_insert(struct kif_node *);
usr.sbin/dvmrpd/kroute.c
57
int kif_remove(struct kif_node *);
usr.sbin/dvmrpd/kroute.c
67
RB_HEAD(kif_tree, kif_node) kit;
usr.sbin/dvmrpd/kroute.c
68
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/dvmrpd/kroute.c
69
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/eigrpd/kroute.c
100
static struct kif_node *kif_insert(unsigned short);
usr.sbin/eigrpd/kroute.c
101
static int kif_remove(struct kif_node *);
usr.sbin/eigrpd/kroute.c
1017
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
126
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/eigrpd/kroute.c
191
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
362
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
648
kif_compare(struct kif_node *a, struct kif_node *b)
usr.sbin/eigrpd/kroute.c
654
static struct kif_node *
usr.sbin/eigrpd/kroute.c
657
struct kif_node s;
usr.sbin/eigrpd/kroute.c
668
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
677
static struct kif_node *
usr.sbin/eigrpd/kroute.c
680
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
682
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL)
usr.sbin/eigrpd/kroute.c
695
kif_remove(struct kif_node *kif)
usr.sbin/eigrpd/kroute.c
715
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
725
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
757
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
76
RB_ENTRY(kif_node) entry;
usr.sbin/eigrpd/kroute.c
80
RB_HEAD(kif_tree, kif_node);
usr.sbin/eigrpd/kroute.c
81
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/eigrpd/kroute.c
875
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
942
struct kif_node *kif;
usr.sbin/eigrpd/kroute.c
98
static __inline int kif_compare(struct kif_node *, struct kif_node *);
usr.sbin/eigrpd/kroute.c
99
static struct kif_node *kif_find(unsigned short);
usr.sbin/ldpd/kroute.c
1002
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
103
static __inline int kif_compare(struct kif_node *, struct kif_node *);
usr.sbin/ldpd/kroute.c
104
static struct kif_node *kif_find(unsigned short);
usr.sbin/ldpd/kroute.c
105
static struct kif_node *kif_insert(unsigned short);
usr.sbin/ldpd/kroute.c
106
static int kif_remove(struct kif_node *, int);
usr.sbin/ldpd/kroute.c
1069
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
107
static struct kif_node *kif_update(unsigned short, int, struct if_data *,
usr.sbin/ldpd/kroute.c
1142
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
133
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ldpd/kroute.c
1768
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
1787
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
213
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
328
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
368
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
500
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
785
kif_compare(struct kif_node *a, struct kif_node *b)
usr.sbin/ldpd/kroute.c
79
RB_ENTRY(kif_node) entry;
usr.sbin/ldpd/kroute.c
791
static struct kif_node *
usr.sbin/ldpd/kroute.c
794
struct kif_node s;
usr.sbin/ldpd/kroute.c
805
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
814
static struct kif_node *
usr.sbin/ldpd/kroute.c
817
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
819
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL)
usr.sbin/ldpd/kroute.c
832
kif_remove(struct kif_node *kif, int notify)
usr.sbin/ldpd/kroute.c
84
RB_HEAD(kif_tree, kif_node);
usr.sbin/ldpd/kroute.c
85
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ldpd/kroute.c
855
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
861
static struct kif_node *
usr.sbin/ldpd/kroute.c
865
struct kif_node *kif;
usr.sbin/ldpd/kroute.c
971
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
1097
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
1132
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
1162
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
117
RB_HEAD(kif_tree, kif_node) kit = RB_INITIALIZER(&kit);
usr.sbin/ospfd/kroute.c
118
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ospfd/kroute.c
119
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ospfd/kroute.c
515
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
67
RB_ENTRY(kif_node) entry;
usr.sbin/ospfd/kroute.c
703
kif_compare(struct kif_node *a, struct kif_node *b)
usr.sbin/ospfd/kroute.c
76
int kif_compare(struct kif_node *, struct kif_node *);
usr.sbin/ospfd/kroute.c
837
struct kif_node *
usr.sbin/ospfd/kroute.c
840
struct kif_node s;
usr.sbin/ospfd/kroute.c
851
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
86
struct kif_node *kif_find(u_short);
usr.sbin/ospfd/kroute.c
87
struct kif_node *kif_insert(u_short);
usr.sbin/ospfd/kroute.c
871
struct kif_node *
usr.sbin/ospfd/kroute.c
874
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
876
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL)
usr.sbin/ospfd/kroute.c
88
int kif_remove(struct kif_node *);
usr.sbin/ospfd/kroute.c
889
kif_remove(struct kif_node *kif)
usr.sbin/ospfd/kroute.c
909
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
919
struct kif_node *kif;
usr.sbin/ospfd/kroute.c
951
struct kif_node *kif;
usr.sbin/ripd/kroute.c
325
struct kif_node *kif;
usr.sbin/ripd/kroute.c
407
kif_compare(struct kif_node *a, struct kif_node *b)
usr.sbin/ripd/kroute.c
490
struct kif_node *
usr.sbin/ripd/kroute.c
493
struct kif_node s;
usr.sbin/ripd/kroute.c
504
struct kif_node *kif;
usr.sbin/ripd/kroute.c
514
kif_insert(struct kif_node *kif)
usr.sbin/ripd/kroute.c
526
kif_remove(struct kif_node *kif)
usr.sbin/ripd/kroute.c
540
struct kif_node *kif;
usr.sbin/ripd/kroute.c
549
struct kif_node *kif;
usr.sbin/ripd/kroute.c
59
RB_ENTRY(kif_node) entry;
usr.sbin/ripd/kroute.c
65
int kif_compare(struct kif_node *, struct kif_node *);
usr.sbin/ripd/kroute.c
655
struct kif_node *kif;
usr.sbin/ripd/kroute.c
696
struct kif_node *kif;
usr.sbin/ripd/kroute.c
702
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL) {
usr.sbin/ripd/kroute.c
73
struct kif_node *kif_find(int);
usr.sbin/ripd/kroute.c
74
int kif_insert(struct kif_node *);
usr.sbin/ripd/kroute.c
75
int kif_remove(struct kif_node *);
usr.sbin/ripd/kroute.c
951
struct kif_node *kif;
usr.sbin/ripd/kroute.c
96
RB_HEAD(kif_tree, kif_node) kit;
usr.sbin/ripd/kroute.c
97
RB_PROTOTYPE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ripd/kroute.c
98
RB_GENERATE(kif_tree, kif_node, entry, kif_compare)
usr.sbin/ripd/kroute.c
987
if ((kif = calloc(1, sizeof(struct kif_node))) == NULL) {