bif 243 net/if_bridge.c struct bridge_iflist *bif; bif 248 net/if_bridge.c while ((bif = LIST_FIRST(&sc->sc_iflist)) != NULL) bif 249 net/if_bridge.c bridge_delete(sc, bif); bif 250 net/if_bridge.c while ((bif = LIST_FIRST(&sc->sc_spanlist)) != NULL) { bif 251 net/if_bridge.c LIST_REMOVE(bif, next); bif 252 net/if_bridge.c free(bif, M_DEVBUF); bif 737 net/if_bridge.c struct bridge_iflist *bif; bif 739 net/if_bridge.c LIST_FOREACH(bif, &sc->sc_iflist, next) bif 740 net/if_bridge.c if (bif->ifp == ifp) { bif 741 net/if_bridge.c LIST_REMOVE(bif, next); bif 743 net/if_bridge.c bridge_flushrule(bif); bif 744 net/if_bridge.c free(bif, M_DEVBUF); bif 754 net/if_bridge.c struct bridge_iflist *bif; bif 759 net/if_bridge.c LIST_FOREACH(bif, &sc->sc_iflist, next) bif 760 net/if_bridge.c if (bif->ifp == ifp) { bif 765 net/if_bridge.c if ((bif->bif_flags & IFBIF_LEARNING) && bif 770 net/if_bridge.c if ((bif->bif_flags & IFBIF_STP) && bif 771 net/if_bridge.c (bif->bif_state == BSTP_IFSTATE_DISCARDING)) bif 2159 net/if_bridge.c bridge_addrule(struct bridge_iflist *bif, struct ifbrlreq *req, int out) bif 2179 net/if_bridge.c SIMPLEQ_INSERT_TAIL(&bif->bif_brlout, n, brl_next); bif 2183 net/if_bridge.c SIMPLEQ_INSERT_TAIL(&bif->bif_brlin, n, brl_next); bif 2189 net/if_bridge.c bridge_flushrule(struct bridge_iflist *bif) bif 2193 net/if_bridge.c while (!SIMPLEQ_EMPTY(&bif->bif_brlin)) { bif 2194 net/if_bridge.c p = SIMPLEQ_FIRST(&bif->bif_brlin); bif 2195 net/if_bridge.c SIMPLEQ_REMOVE_HEAD(&bif->bif_brlin, brl_next); bif 2201 net/if_bridge.c while (!SIMPLEQ_EMPTY(&bif->bif_brlout)) { bif 2202 net/if_bridge.c p = SIMPLEQ_FIRST(&bif->bif_brlout); bif 2203 net/if_bridge.c SIMPLEQ_REMOVE_HEAD(&bif->bif_brlout, brl_next);