1 // SPDX-License-Identifier: GPL-2.0-only
3 * Copyright (c) 2008, 2009 open80211s Ltd.
4 * Author: Luis Carlos Cobo <luisca@cozybit.com>
7 #include <linux/etherdevice.h>
8 #include <linux/list.h>
9 #include <linux/random.h>
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/string.h>
13 #include <net/mac80211.h>
15 #include "ieee80211_i.h"
18 static void mesh_path_free_rcu(struct mesh_table *tbl, struct mesh_path *mpath);
20 static u32 mesh_table_hash(const void *addr, u32 len, u32 seed)
22 /* Use last four bytes of hw addr as hash index */
23 return jhash_1word(__get_unaligned_cpu32((u8 *)addr + 2), seed);
26 static const struct rhashtable_params mesh_rht_params = {
28 .automatic_shrinking = true,
30 .key_offset = offsetof(struct mesh_path, dst),
31 .head_offset = offsetof(struct mesh_path, rhash),
32 .hashfn = mesh_table_hash,
35 static inline bool mpath_expired(struct mesh_path *mpath)
37 return (mpath->flags & MESH_PATH_ACTIVE) &&
38 time_after(jiffies, mpath->exp_time) &&
39 !(mpath->flags & MESH_PATH_FIXED);
42 static void mesh_path_rht_free(void *ptr, void *tblptr)
44 struct mesh_path *mpath = ptr;
45 struct mesh_table *tbl = tblptr;
47 mesh_path_free_rcu(tbl, mpath);
50 static struct mesh_table *mesh_table_alloc(void)
52 struct mesh_table *newtbl;
54 newtbl = kmalloc(sizeof(struct mesh_table), GFP_ATOMIC);
58 INIT_HLIST_HEAD(&newtbl->known_gates);
59 INIT_HLIST_HEAD(&newtbl->walk_head);
60 atomic_set(&newtbl->entries, 0);
61 spin_lock_init(&newtbl->gates_lock);
62 spin_lock_init(&newtbl->walk_lock);
63 rhashtable_init(&newtbl->rhead, &mesh_rht_params);
68 static void mesh_table_free(struct mesh_table *tbl)
70 rhashtable_free_and_destroy(&tbl->rhead,
71 mesh_path_rht_free, tbl);
76 * mesh_path_assign_nexthop - update mesh path next hop
78 * @mpath: mesh path to update
79 * @sta: next hop to assign
81 * Locking: mpath->state_lock must be held when calling this function
83 void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta)
86 struct ieee80211_hdr *hdr;
89 rcu_assign_pointer(mpath->next_hop, sta);
91 spin_lock_irqsave(&mpath->frame_queue.lock, flags);
92 skb_queue_walk(&mpath->frame_queue, skb) {
93 hdr = (struct ieee80211_hdr *) skb->data;
94 memcpy(hdr->addr1, sta->sta.addr, ETH_ALEN);
95 memcpy(hdr->addr2, mpath->sdata->vif.addr, ETH_ALEN);
96 ieee80211_mps_set_frame_flags(sta->sdata, sta, hdr);
99 spin_unlock_irqrestore(&mpath->frame_queue.lock, flags);
102 static void prepare_for_gate(struct sk_buff *skb, char *dst_addr,
103 struct mesh_path *gate_mpath)
105 struct ieee80211_hdr *hdr;
106 struct ieee80211s_hdr *mshdr;
107 int mesh_hdrlen, hdrlen;
110 hdr = (struct ieee80211_hdr *) skb->data;
111 hdrlen = ieee80211_hdrlen(hdr->frame_control);
112 mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen);
114 if (!(mshdr->flags & MESH_FLAGS_AE)) {
115 /* size of the fixed part of the mesh header */
118 /* make room for the two extended addresses */
119 skb_push(skb, 2 * ETH_ALEN);
120 memmove(skb->data, hdr, hdrlen + mesh_hdrlen);
122 hdr = (struct ieee80211_hdr *) skb->data;
124 /* we preserve the previous mesh header and only add
125 * the new addreses */
126 mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen);
127 mshdr->flags = MESH_FLAGS_AE_A5_A6;
128 memcpy(mshdr->eaddr1, hdr->addr3, ETH_ALEN);
129 memcpy(mshdr->eaddr2, hdr->addr4, ETH_ALEN);
132 /* update next hop */
133 hdr = (struct ieee80211_hdr *) skb->data;
135 next_hop = rcu_dereference(gate_mpath->next_hop)->sta.addr;
136 memcpy(hdr->addr1, next_hop, ETH_ALEN);
138 memcpy(hdr->addr2, gate_mpath->sdata->vif.addr, ETH_ALEN);
139 memcpy(hdr->addr3, dst_addr, ETH_ALEN);
143 * mesh_path_move_to_queue - Move or copy frames from one mpath queue to another
145 * This function is used to transfer or copy frames from an unresolved mpath to
146 * a gate mpath. The function also adds the Address Extension field and
147 * updates the next hop.
149 * If a frame already has an Address Extension field, only the next hop and
150 * destination addresses are updated.
152 * The gate mpath must be an active mpath with a valid mpath->next_hop.
154 * @gate_mpath: An active mpath the frames will be sent to (i.e. the gate)
155 * @from_mpath: The failed mpath
156 * @copy: When true, copy all the frames to the new mpath queue. When false,
159 static void mesh_path_move_to_queue(struct mesh_path *gate_mpath,
160 struct mesh_path *from_mpath,
163 struct sk_buff *skb, *fskb, *tmp;
164 struct sk_buff_head failq;
167 if (WARN_ON(gate_mpath == from_mpath))
169 if (WARN_ON(!gate_mpath->next_hop))
172 __skb_queue_head_init(&failq);
174 spin_lock_irqsave(&from_mpath->frame_queue.lock, flags);
175 skb_queue_splice_init(&from_mpath->frame_queue, &failq);
176 spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags);
178 skb_queue_walk_safe(&failq, fskb, tmp) {
179 if (skb_queue_len(&gate_mpath->frame_queue) >=
180 MESH_FRAME_QUEUE_LEN) {
181 mpath_dbg(gate_mpath->sdata, "mpath queue full!\n");
185 skb = skb_copy(fskb, GFP_ATOMIC);
189 prepare_for_gate(skb, gate_mpath->dst, gate_mpath);
190 skb_queue_tail(&gate_mpath->frame_queue, skb);
195 __skb_unlink(fskb, &failq);
199 mpath_dbg(gate_mpath->sdata, "Mpath queue for gate %pM has %d frames\n",
200 gate_mpath->dst, skb_queue_len(&gate_mpath->frame_queue));
205 spin_lock_irqsave(&from_mpath->frame_queue.lock, flags);
206 skb_queue_splice(&failq, &from_mpath->frame_queue);
207 spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags);
211 static struct mesh_path *mpath_lookup(struct mesh_table *tbl, const u8 *dst,
212 struct ieee80211_sub_if_data *sdata)
214 struct mesh_path *mpath;
216 mpath = rhashtable_lookup(&tbl->rhead, dst, mesh_rht_params);
218 if (mpath && mpath_expired(mpath)) {
219 spin_lock_bh(&mpath->state_lock);
220 mpath->flags &= ~MESH_PATH_ACTIVE;
221 spin_unlock_bh(&mpath->state_lock);
227 * mesh_path_lookup - look up a path in the mesh path table
228 * @sdata: local subif
229 * @dst: hardware address (ETH_ALEN length) of destination
231 * Returns: pointer to the mesh path structure, or NULL if not found
233 * Locking: must be called within a read rcu section.
236 mesh_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst)
238 return mpath_lookup(sdata->u.mesh.mesh_paths, dst, sdata);
242 mpp_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst)
244 return mpath_lookup(sdata->u.mesh.mpp_paths, dst, sdata);
247 static struct mesh_path *
248 __mesh_path_lookup_by_idx(struct mesh_table *tbl, int idx)
251 struct mesh_path *mpath;
253 hlist_for_each_entry_rcu(mpath, &tbl->walk_head, walk_list) {
261 if (mpath_expired(mpath)) {
262 spin_lock_bh(&mpath->state_lock);
263 mpath->flags &= ~MESH_PATH_ACTIVE;
264 spin_unlock_bh(&mpath->state_lock);
270 * mesh_path_lookup_by_idx - look up a path in the mesh path table by its index
272 * @sdata: local subif, or NULL for all entries
274 * Returns: pointer to the mesh path structure, or NULL if not found.
276 * Locking: must be called within a read rcu section.
279 mesh_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx)
281 return __mesh_path_lookup_by_idx(sdata->u.mesh.mesh_paths, idx);
285 * mpp_path_lookup_by_idx - look up a path in the proxy path table by its index
287 * @sdata: local subif, or NULL for all entries
289 * Returns: pointer to the proxy path structure, or NULL if not found.
291 * Locking: must be called within a read rcu section.
294 mpp_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx)
296 return __mesh_path_lookup_by_idx(sdata->u.mesh.mpp_paths, idx);
300 * mesh_path_add_gate - add the given mpath to a mesh gate to our path table
301 * @mpath: gate path to add to table
303 int mesh_path_add_gate(struct mesh_path *mpath)
305 struct mesh_table *tbl;
309 tbl = mpath->sdata->u.mesh.mesh_paths;
311 spin_lock_bh(&mpath->state_lock);
312 if (mpath->is_gate) {
314 spin_unlock_bh(&mpath->state_lock);
317 mpath->is_gate = true;
318 mpath->sdata->u.mesh.num_gates++;
320 spin_lock(&tbl->gates_lock);
321 hlist_add_head_rcu(&mpath->gate_list, &tbl->known_gates);
322 spin_unlock(&tbl->gates_lock);
324 spin_unlock_bh(&mpath->state_lock);
326 mpath_dbg(mpath->sdata,
327 "Mesh path: Recorded new gate: %pM. %d known gates\n",
328 mpath->dst, mpath->sdata->u.mesh.num_gates);
336 * mesh_gate_del - remove a mesh gate from the list of known gates
337 * @tbl: table which holds our list of known gates
340 static void mesh_gate_del(struct mesh_table *tbl, struct mesh_path *mpath)
342 lockdep_assert_held(&mpath->state_lock);
346 mpath->is_gate = false;
347 spin_lock_bh(&tbl->gates_lock);
348 hlist_del_rcu(&mpath->gate_list);
349 mpath->sdata->u.mesh.num_gates--;
350 spin_unlock_bh(&tbl->gates_lock);
352 mpath_dbg(mpath->sdata,
353 "Mesh path: Deleted gate: %pM. %d known gates\n",
354 mpath->dst, mpath->sdata->u.mesh.num_gates);
358 * mesh_gate_num - number of gates known to this interface
361 int mesh_gate_num(struct ieee80211_sub_if_data *sdata)
363 return sdata->u.mesh.num_gates;
367 struct mesh_path *mesh_path_new(struct ieee80211_sub_if_data *sdata,
368 const u8 *dst, gfp_t gfp_flags)
370 struct mesh_path *new_mpath;
372 new_mpath = kzalloc(sizeof(struct mesh_path), gfp_flags);
376 memcpy(new_mpath->dst, dst, ETH_ALEN);
377 eth_broadcast_addr(new_mpath->rann_snd_addr);
378 new_mpath->is_root = false;
379 new_mpath->sdata = sdata;
380 new_mpath->flags = 0;
381 skb_queue_head_init(&new_mpath->frame_queue);
382 new_mpath->exp_time = jiffies;
383 spin_lock_init(&new_mpath->state_lock);
384 timer_setup(&new_mpath->timer, mesh_path_timer, 0);
390 * mesh_path_add - allocate and add a new path to the mesh path table
391 * @dst: destination address of the path (ETH_ALEN length)
392 * @sdata: local subif
394 * Returns: 0 on success
396 * State: the initial state of the new path is set to 0
398 struct mesh_path *mesh_path_add(struct ieee80211_sub_if_data *sdata,
401 struct mesh_table *tbl;
402 struct mesh_path *mpath, *new_mpath;
404 if (ether_addr_equal(dst, sdata->vif.addr))
405 /* never add ourselves as neighbours */
406 return ERR_PTR(-ENOTSUPP);
408 if (is_multicast_ether_addr(dst))
409 return ERR_PTR(-ENOTSUPP);
411 if (atomic_add_unless(&sdata->u.mesh.mpaths, 1, MESH_MAX_MPATHS) == 0)
412 return ERR_PTR(-ENOSPC);
414 new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC);
416 return ERR_PTR(-ENOMEM);
418 tbl = sdata->u.mesh.mesh_paths;
419 spin_lock_bh(&tbl->walk_lock);
420 mpath = rhashtable_lookup_get_insert_fast(&tbl->rhead,
424 hlist_add_head(&new_mpath->walk_list, &tbl->walk_head);
425 spin_unlock_bh(&tbl->walk_lock);
436 sdata->u.mesh.mesh_paths_generation++;
440 int mpp_path_add(struct ieee80211_sub_if_data *sdata,
441 const u8 *dst, const u8 *mpp)
443 struct mesh_table *tbl;
444 struct mesh_path *new_mpath;
447 if (ether_addr_equal(dst, sdata->vif.addr))
448 /* never add ourselves as neighbours */
451 if (is_multicast_ether_addr(dst))
454 new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC);
459 memcpy(new_mpath->mpp, mpp, ETH_ALEN);
460 tbl = sdata->u.mesh.mpp_paths;
462 spin_lock_bh(&tbl->walk_lock);
463 ret = rhashtable_lookup_insert_fast(&tbl->rhead,
467 hlist_add_head_rcu(&new_mpath->walk_list, &tbl->walk_head);
468 spin_unlock_bh(&tbl->walk_lock);
473 sdata->u.mesh.mpp_paths_generation++;
479 * mesh_plink_broken - deactivates paths and sends perr when a link breaks
481 * @sta: broken peer link
483 * This function must be called from the rate control algorithm if enough
484 * delivery errors suggest that a peer link is no longer usable.
486 void mesh_plink_broken(struct sta_info *sta)
488 struct ieee80211_sub_if_data *sdata = sta->sdata;
489 struct mesh_table *tbl = sdata->u.mesh.mesh_paths;
490 static const u8 bcast[ETH_ALEN] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
491 struct mesh_path *mpath;
494 hlist_for_each_entry_rcu(mpath, &tbl->walk_head, walk_list) {
495 if (rcu_access_pointer(mpath->next_hop) == sta &&
496 mpath->flags & MESH_PATH_ACTIVE &&
497 !(mpath->flags & MESH_PATH_FIXED)) {
498 spin_lock_bh(&mpath->state_lock);
499 mpath->flags &= ~MESH_PATH_ACTIVE;
501 spin_unlock_bh(&mpath->state_lock);
502 mesh_path_error_tx(sdata,
503 sdata->u.mesh.mshcfg.element_ttl,
504 mpath->dst, mpath->sn,
505 WLAN_REASON_MESH_PATH_DEST_UNREACHABLE, bcast);
511 static void mesh_path_free_rcu(struct mesh_table *tbl,
512 struct mesh_path *mpath)
514 struct ieee80211_sub_if_data *sdata = mpath->sdata;
516 spin_lock_bh(&mpath->state_lock);
517 mpath->flags |= MESH_PATH_RESOLVING | MESH_PATH_DELETED;
518 mesh_gate_del(tbl, mpath);
519 spin_unlock_bh(&mpath->state_lock);
520 del_timer_sync(&mpath->timer);
521 atomic_dec(&sdata->u.mesh.mpaths);
522 atomic_dec(&tbl->entries);
523 mesh_path_flush_pending(mpath);
524 kfree_rcu(mpath, rcu);
527 static void __mesh_path_del(struct mesh_table *tbl, struct mesh_path *mpath)
529 hlist_del_rcu(&mpath->walk_list);
530 rhashtable_remove_fast(&tbl->rhead, &mpath->rhash, mesh_rht_params);
531 mesh_path_free_rcu(tbl, mpath);
535 * mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches
537 * @sta: mesh peer to match
539 * RCU notes: this function is called when a mesh plink transitions from
540 * PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that
541 * allows path creation. This will happen before the sta can be freed (because
542 * sta_info_destroy() calls this) so any reader in a rcu read block will be
543 * protected against the plink disappearing.
545 void mesh_path_flush_by_nexthop(struct sta_info *sta)
547 struct ieee80211_sub_if_data *sdata = sta->sdata;
548 struct mesh_table *tbl = sdata->u.mesh.mesh_paths;
549 struct mesh_path *mpath;
550 struct hlist_node *n;
552 spin_lock_bh(&tbl->walk_lock);
553 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
554 if (rcu_access_pointer(mpath->next_hop) == sta)
555 __mesh_path_del(tbl, mpath);
557 spin_unlock_bh(&tbl->walk_lock);
560 static void mpp_flush_by_proxy(struct ieee80211_sub_if_data *sdata,
563 struct mesh_table *tbl = sdata->u.mesh.mpp_paths;
564 struct mesh_path *mpath;
565 struct hlist_node *n;
567 spin_lock_bh(&tbl->walk_lock);
568 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
569 if (ether_addr_equal(mpath->mpp, proxy))
570 __mesh_path_del(tbl, mpath);
572 spin_unlock_bh(&tbl->walk_lock);
575 static void table_flush_by_iface(struct mesh_table *tbl)
577 struct mesh_path *mpath;
578 struct hlist_node *n;
580 spin_lock_bh(&tbl->walk_lock);
581 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
582 __mesh_path_del(tbl, mpath);
584 spin_unlock_bh(&tbl->walk_lock);
588 * mesh_path_flush_by_iface - Deletes all mesh paths associated with a given iface
590 * This function deletes both mesh paths as well as mesh portal paths.
592 * @sdata: interface data to match
595 void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata)
597 table_flush_by_iface(sdata->u.mesh.mesh_paths);
598 table_flush_by_iface(sdata->u.mesh.mpp_paths);
602 * table_path_del - delete a path from the mesh or mpp table
604 * @tbl: mesh or mpp path table
605 * @sdata: local subif
606 * @addr: dst address (ETH_ALEN length)
608 * Returns: 0 if successful
610 static int table_path_del(struct mesh_table *tbl,
611 struct ieee80211_sub_if_data *sdata,
614 struct mesh_path *mpath;
616 spin_lock_bh(&tbl->walk_lock);
617 mpath = rhashtable_lookup_fast(&tbl->rhead, addr, mesh_rht_params);
619 spin_unlock_bh(&tbl->walk_lock);
623 __mesh_path_del(tbl, mpath);
624 spin_unlock_bh(&tbl->walk_lock);
630 * mesh_path_del - delete a mesh path from the table
632 * @addr: dst address (ETH_ALEN length)
633 * @sdata: local subif
635 * Returns: 0 if successful
637 int mesh_path_del(struct ieee80211_sub_if_data *sdata, const u8 *addr)
641 /* flush relevant mpp entries first */
642 mpp_flush_by_proxy(sdata, addr);
644 err = table_path_del(sdata->u.mesh.mesh_paths, sdata, addr);
645 sdata->u.mesh.mesh_paths_generation++;
650 * mesh_path_tx_pending - sends pending frames in a mesh path queue
652 * @mpath: mesh path to activate
654 * Locking: the state_lock of the mpath structure must NOT be held when calling
657 void mesh_path_tx_pending(struct mesh_path *mpath)
659 if (mpath->flags & MESH_PATH_ACTIVE)
660 ieee80211_add_pending_skbs(mpath->sdata->local,
661 &mpath->frame_queue);
665 * mesh_path_send_to_gates - sends pending frames to all known mesh gates
667 * @mpath: mesh path whose queue will be emptied
669 * If there is only one gate, the frames are transferred from the failed mpath
670 * queue to that gate's queue. If there are more than one gates, the frames
671 * are copied from each gate to the next. After frames are copied, the
672 * mpath queues are emptied onto the transmission queue.
674 int mesh_path_send_to_gates(struct mesh_path *mpath)
676 struct ieee80211_sub_if_data *sdata = mpath->sdata;
677 struct mesh_table *tbl;
678 struct mesh_path *from_mpath = mpath;
679 struct mesh_path *gate;
682 tbl = sdata->u.mesh.mesh_paths;
685 hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) {
686 if (gate->flags & MESH_PATH_ACTIVE) {
687 mpath_dbg(sdata, "Forwarding to %pM\n", gate->dst);
688 mesh_path_move_to_queue(gate, from_mpath, copy);
693 "Not forwarding to %pM (flags %#x)\n",
694 gate->dst, gate->flags);
698 hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) {
699 mpath_dbg(sdata, "Sending to %pM\n", gate->dst);
700 mesh_path_tx_pending(gate);
704 return (from_mpath == mpath) ? -EHOSTUNREACH : 0;
708 * mesh_path_discard_frame - discard a frame whose path could not be resolved
710 * @skb: frame to discard
711 * @sdata: network subif the frame was to be sent through
713 * Locking: the function must me called within a rcu_read_lock region
715 void mesh_path_discard_frame(struct ieee80211_sub_if_data *sdata,
719 sdata->u.mesh.mshstats.dropped_frames_no_route++;
723 * mesh_path_flush_pending - free the pending queue of a mesh path
725 * @mpath: mesh path whose queue has to be freed
727 * Locking: the function must me called within a rcu_read_lock region
729 void mesh_path_flush_pending(struct mesh_path *mpath)
733 while ((skb = skb_dequeue(&mpath->frame_queue)) != NULL)
734 mesh_path_discard_frame(mpath->sdata, skb);
738 * mesh_path_fix_nexthop - force a specific next hop for a mesh path
740 * @mpath: the mesh path to modify
741 * @next_hop: the next hop to force
743 * Locking: this function must be called holding mpath->state_lock
745 void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop)
747 spin_lock_bh(&mpath->state_lock);
748 mesh_path_assign_nexthop(mpath, next_hop);
751 mpath->hop_count = 0;
753 mpath->flags = MESH_PATH_FIXED | MESH_PATH_SN_VALID;
754 mesh_path_activate(mpath);
755 spin_unlock_bh(&mpath->state_lock);
756 ewma_mesh_fail_avg_init(&next_hop->mesh->fail_avg);
757 /* init it at a low value - 0 start is tricky */
758 ewma_mesh_fail_avg_add(&next_hop->mesh->fail_avg, 1);
759 mesh_path_tx_pending(mpath);
762 int mesh_pathtbl_init(struct ieee80211_sub_if_data *sdata)
764 struct mesh_table *tbl_path, *tbl_mpp;
767 tbl_path = mesh_table_alloc();
771 tbl_mpp = mesh_table_alloc();
777 sdata->u.mesh.mesh_paths = tbl_path;
778 sdata->u.mesh.mpp_paths = tbl_mpp;
783 mesh_table_free(tbl_path);
788 void mesh_path_tbl_expire(struct ieee80211_sub_if_data *sdata,
789 struct mesh_table *tbl)
791 struct mesh_path *mpath;
792 struct hlist_node *n;
794 spin_lock_bh(&tbl->walk_lock);
795 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
796 if ((!(mpath->flags & MESH_PATH_RESOLVING)) &&
797 (!(mpath->flags & MESH_PATH_FIXED)) &&
798 time_after(jiffies, mpath->exp_time + MESH_PATH_EXPIRE))
799 __mesh_path_del(tbl, mpath);
801 spin_unlock_bh(&tbl->walk_lock);
804 void mesh_path_expire(struct ieee80211_sub_if_data *sdata)
806 mesh_path_tbl_expire(sdata, sdata->u.mesh.mesh_paths);
807 mesh_path_tbl_expire(sdata, sdata->u.mesh.mpp_paths);
810 void mesh_pathtbl_unregister(struct ieee80211_sub_if_data *sdata)
812 mesh_table_free(sdata->u.mesh.mesh_paths);
813 mesh_table_free(sdata->u.mesh.mpp_paths);