80 	while (bif->f_tpa != NULL && bif->sysindex == bif->f_tpa->sysindex) {  in bridge_tpe_bif_free()
81 		tp = TAILQ_NEXT(bif->f_tpa, tp_e);  in bridge_tpe_bif_free()
82 		TAILQ_REMOVE(headp, bif->f_tpa, tp_e);  in bridge_tpe_bif_free()
83 		free(bif->f_tpa);  in bridge_tpe_bif_free()
84 		bif->f_tpa = tp;  in bridge_tpe_bif_free()
116 	struct tp_entry *ta, struct tp_entry **f_tpa)  in bridge_addrs_insert_at()  argument
120 	assert(f_tpa != NULL);  in bridge_addrs_insert_at()
122 	for (t1 = *f_tpa;  in bridge_addrs_insert_at()
127 			if (*f_tpa == t1)  in bridge_addrs_insert_at()
128 				(*f_tpa) = ta;  in bridge_addrs_insert_at()
176     struct tp_entry **f_tpa)  in bridge_addrs_bif_insert()  argument
180 	if (*f_tpa != NULL)  in bridge_addrs_bif_insert()
181 		bridge_addrs_insert_at(headp, te, f_tpa);  in bridge_addrs_bif_insert()
189 		*f_tpa = te;  in bridge_addrs_bif_insert()
238 	return (bif->f_tpa);  in bridge_addrs_bif_first()
262 	if (bif->f_tpa == te)  in bridge_addrs_remove()
263 		bif->f_tpa = bridge_addrs_bif_next(te);  in bridge_addrs_remove()
287 	bridge_addrs_bif_insert(&tp_entries, te, &(bif->f_tpa));  in bridge_new_addrs()
301 	for (te = bif->f_tpa; te != NULL; te = TAILQ_NEXT(te, tp_e)) {  in bridge_addrs_find()