brt_next         1705 net/if_bridge.c 		LIST_INSERT_HEAD(&sc->sc_rts[h], p, brt_next);
brt_next         1712 net/if_bridge.c 		p = LIST_NEXT(p, brt_next);
brt_next         1745 net/if_bridge.c 			LIST_INSERT_BEFORE(q, p, brt_next);
brt_next         1766 net/if_bridge.c 			LIST_INSERT_AFTER(q, p, brt_next);
brt_next         1786 net/if_bridge.c 	LIST_FOREACH(p, &sc->sc_rts[h], brt_next) {
brt_next         1859 net/if_bridge.c 			p = LIST_NEXT(n, brt_next);
brt_next         1861 net/if_bridge.c 				LIST_REMOVE(n, brt_next);
brt_next         1899 net/if_bridge.c 				n = LIST_NEXT(n, brt_next);
brt_next         1902 net/if_bridge.c 				n = LIST_NEXT(n, brt_next);
brt_next         1904 net/if_bridge.c 				p = LIST_NEXT(n, brt_next);
brt_next         1905 net/if_bridge.c 				LIST_REMOVE(n, brt_next);
brt_next         1963 net/if_bridge.c 				p = LIST_NEXT(n, brt_next);
brt_next         1964 net/if_bridge.c 				LIST_REMOVE(n, brt_next);
brt_next         1969 net/if_bridge.c 				n = LIST_NEXT(n, brt_next);
brt_next         1986 net/if_bridge.c 	LIST_FOREACH(p, &sc->sc_rts[h], brt_next) {
brt_next         1988 net/if_bridge.c 			LIST_REMOVE(p, brt_next);
brt_next         2015 net/if_bridge.c 				n = LIST_NEXT(n, brt_next);
brt_next         2021 net/if_bridge.c 				n = LIST_NEXT(n, brt_next);
brt_next         2024 net/if_bridge.c 			p = LIST_NEXT(n, brt_next);
brt_next         2025 net/if_bridge.c 			LIST_REMOVE(n, brt_next);
brt_next         2048 net/if_bridge.c 		LIST_FOREACH(n, &sc->sc_rts[i], brt_next) {
brt_next          400 net/if_bridge.h 	LIST_ENTRY(bridge_rtnode)	brt_next;	/* next in list */