Lines Matching defs:nt
96 struct ieee80211_node_table *nt, const char *name,
100 static void ieee80211_node_table_cleanup(struct ieee80211_node_table *nt);
1144 ieee80211_alloc_node(struct ieee80211_node_table *nt,
1147 struct ieee80211com *ic = nt->nt_ic;
1159 ether_sprintf(macaddr), nt->nt_name);
1170 ni->ni_inact_reload = nt->nt_inact_init;
1178 IEEE80211_NODE_LOCK(nt);
1179 TAILQ_INSERT_TAIL(&nt->nt_node, ni, ni_list);
1180 LIST_INSERT_HEAD(&nt->nt_hash[hash], ni, ni_hash);
1181 ni->ni_table = nt;
1184 IEEE80211_NODE_UNLOCK(nt);
1321 ieee80211_find_node_locked_debug(struct ieee80211_node_table *nt,
1324 ieee80211_find_node_locked(struct ieee80211_node_table *nt,
1331 IEEE80211_NODE_LOCK_ASSERT(nt);
1333 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr);
1334 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1352 ieee80211_find_node_debug(struct ieee80211_node_table *nt,
1355 ieee80211_find_node(struct ieee80211_node_table *nt,
1361 IEEE80211_NODE_LOCK(nt);
1362 ni = ieee80211_find_node_locked(nt, macaddr);
1363 IEEE80211_NODE_UNLOCK(nt);
1369 ieee80211_find_vap_node_locked_debug(struct ieee80211_node_table *nt,
1373 ieee80211_find_vap_node_locked(struct ieee80211_node_table *nt,
1381 IEEE80211_NODE_LOCK_ASSERT(nt);
1383 hash = IEEE80211_NODE_HASH(nt->nt_ic, macaddr);
1384 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1403 ieee80211_find_vap_node_debug(struct ieee80211_node_table *nt,
1407 ieee80211_find_vap_node(struct ieee80211_node_table *nt,
1414 IEEE80211_NODE_LOCK(nt);
1415 ni = ieee80211_find_vap_node_locked(nt, vap, macaddr);
1416 IEEE80211_NODE_UNLOCK(nt);
1576 _find_rxnode(struct ieee80211_node_table *nt,
1581 return ieee80211_find_node_locked(nt, wh->i_addr2);
1598 struct ieee80211_node_table *nt;
1601 nt = &ic->ic_sta;
1602 IEEE80211_NODE_LOCK(nt);
1603 ni = _find_rxnode(nt, wh);
1604 IEEE80211_NODE_UNLOCK(nt);
1627 struct ieee80211_node_table *nt;
1630 nt = &ic->ic_sta;
1631 IEEE80211_NODE_LOCK(nt);
1632 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax)
1633 ni = nt->nt_keyixmap[keyix];
1637 ni = _find_rxnode(nt, wh);
1638 if (ni != NULL && nt->nt_keyixmap != NULL) {
1645 if (keyix < nt->nt_keyixmax &&
1646 nt->nt_keyixmap[keyix] == NULL) {
1652 nt->nt_keyixmap[keyix] = ieee80211_ref_node(ni);
1661 IEEE80211_NODE_UNLOCK(nt);
1682 struct ieee80211_node_table *nt = &vap->iv_ic->ic_sta;
1692 IEEE80211_NODE_LOCK(nt);
1698 ni = ieee80211_find_node_locked(nt, macaddr);
1699 IEEE80211_NODE_UNLOCK(nt);
1725 struct ieee80211_node_table *nt = ni->ni_table;
1737 nt != NULL ? nt->nt_name : "<gone>");
1744 if (nt != NULL) {
1745 TAILQ_REMOVE(&nt->nt_node, ni, ni_list);
1758 struct ieee80211_node_table *nt = ni->ni_table;
1765 if (nt != NULL) {
1766 IEEE80211_NODE_LOCK(nt);
1773 nt->nt_keyixmap != NULL) {
1779 if (keyix < nt->nt_keyixmax &&
1780 nt->nt_keyixmap[keyix] == ni) {
1785 nt->nt_keyixmap[keyix] = NULL;
1790 IEEE80211_NODE_UNLOCK(nt);
1804 struct ieee80211_node_table *nt = &ic->ic_sta;
1821 isowned = IEEE80211_NODE_IS_LOCKED(nt);
1823 IEEE80211_NODE_LOCK(nt);
1829 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax) {
1830 nikey = nt->nt_keyixmap[keyix];
1831 nt->nt_keyixmap[keyix] = NULL;
1835 IEEE80211_NODE_UNLOCK(nt);
1855 node_reclaim(struct ieee80211_node_table *nt, struct ieee80211_node *ni)
1859 IEEE80211_NODE_LOCK_ASSERT(nt);
1864 nt->nt_name, ieee80211_node_refcnt(ni)-1);
1873 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax &&
1874 nt->nt_keyixmap[keyix] == ni) {
1878 nt->nt_keyixmap[keyix] = NULL;
1888 TAILQ_REMOVE(&nt->nt_node, ni, ni_list);
1901 struct ieee80211_node_table *nt,
1906 nt->nt_ic = ic;
1907 IEEE80211_NODE_LOCK_INIT(nt, ifp->if_xname);
1908 IEEE80211_NODE_ITERATE_LOCK_INIT(nt, ifp->if_xname);
1909 TAILQ_INIT(&nt->nt_node);
1910 nt->nt_name = name;
1911 nt->nt_scangen = 1;
1912 nt->nt_inact_init = inact;
1913 nt->nt_keyixmax = keyixmax;
1914 if (nt->nt_keyixmax > 0) {
1915 nt->nt_keyixmap = (struct ieee80211_node **) malloc(
1918 if (nt->nt_keyixmap == NULL)
1923 nt->nt_keyixmap = NULL;
1927 ieee80211_node_table_reset(struct ieee80211_node_table *nt,
1932 IEEE80211_NODE_LOCK(nt);
1933 TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, next) {
1946 node_reclaim(nt, ni);
1956 TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, next)
1960 IEEE80211_NODE_UNLOCK(nt);
1964 ieee80211_node_table_cleanup(struct ieee80211_node_table *nt)
1966 ieee80211_node_table_reset(nt, NULL);
1967 if (nt->nt_keyixmap != NULL) {
1971 for (i = 0; i < nt->nt_keyixmax; i++)
1972 if (nt->nt_keyixmap[i] != NULL)
1974 nt->nt_name, i);
1976 free(nt->nt_keyixmap, M_80211_NODE);
1977 nt->nt_keyixmap = NULL;
1979 IEEE80211_NODE_ITERATE_LOCK_DESTROY(nt);
1980 IEEE80211_NODE_LOCK_DESTROY(nt);
1996 struct ieee80211_node_table *nt = &ic->ic_sta;
2001 IEEE80211_NODE_ITERATE_LOCK(nt);
2002 gen = ++nt->nt_scangen;
2004 IEEE80211_NODE_LOCK(nt);
2005 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
2089 IEEE80211_NODE_UNLOCK(nt);
2117 IEEE80211_NODE_UNLOCK(nt);
2129 IEEE80211_NODE_UNLOCK(nt);
2131 IEEE80211_NODE_ITERATE_UNLOCK(nt);
2141 struct ieee80211_node_table *nt = &ic->ic_sta;
2145 IEEE80211_NODE_LOCK(nt);
2146 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
2181 IEEE80211_NODE_UNLOCK(nt);
2229 ieee80211_iterate_nt(struct ieee80211_node_table *nt,
2236 IEEE80211_NODE_ITERATE_LOCK(nt);
2237 IEEE80211_NODE_LOCK(nt);
2239 gen = ++nt->nt_scangen;
2249 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
2252 if_printf(nt->nt_ic->ic_ifp,
2271 IEEE80211_NODE_UNLOCK(nt);
2272 IEEE80211_NODE_ITERATE_UNLOCK(nt);
2297 ieee80211_iterate_nodes(struct ieee80211_node_table *nt,
2310 vap = TAILQ_FIRST(&nt->nt_ic->ic_vaps);
2327 if (ieee80211_iterate_nt(nt, ni_arr, max_aid) != 0)
2343 ieee80211_dump_node(struct ieee80211_node_table *nt, struct ieee80211_node *ni)
2373 ieee80211_dump_nodes(struct ieee80211_node_table *nt)
2375 ieee80211_iterate_nodes(nt,
2376 (ieee80211_iter_func *) ieee80211_dump_node, nt);
2652 struct ieee80211_node_table *nt = ni->ni_table;
2701 if (nt != NULL) {
2702 IEEE80211_NODE_LOCK(nt);
2703 node_reclaim(nt, ni);
2704 IEEE80211_NODE_UNLOCK(nt);