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);
67 static void mesh_table_free(struct mesh_table *tbl)
69 rhashtable_free_and_destroy(&tbl->rhead,
70 mesh_path_rht_free, tbl);
75 * mesh_path_assign_nexthop - update mesh path next hop
77 * @mpath: mesh path to update
78 * @sta: next hop to assign
80 * Locking: mpath->state_lock must be held when calling this function
82 void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta)
85 struct ieee80211_hdr *hdr;
88 rcu_assign_pointer(mpath->next_hop, sta);
90 spin_lock_irqsave(&mpath->frame_queue.lock, flags);
91 skb_queue_walk(&mpath->frame_queue, skb) {
92 hdr = (struct ieee80211_hdr *) skb->data;
93 memcpy(hdr->addr1, sta->sta.addr, ETH_ALEN);
94 memcpy(hdr->addr2, mpath->sdata->vif.addr, ETH_ALEN);
95 ieee80211_mps_set_frame_flags(sta->sdata, sta, hdr);
98 spin_unlock_irqrestore(&mpath->frame_queue.lock, flags);
101 static void prepare_for_gate(struct sk_buff *skb, char *dst_addr,
102 struct mesh_path *gate_mpath)
104 struct ieee80211_hdr *hdr;
105 struct ieee80211s_hdr *mshdr;
106 int mesh_hdrlen, hdrlen;
109 hdr = (struct ieee80211_hdr *) skb->data;
110 hdrlen = ieee80211_hdrlen(hdr->frame_control);
111 mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen);
113 if (!(mshdr->flags & MESH_FLAGS_AE)) {
114 /* size of the fixed part of the mesh header */
117 /* make room for the two extended addresses */
118 skb_push(skb, 2 * ETH_ALEN);
119 memmove(skb->data, hdr, hdrlen + mesh_hdrlen);
121 hdr = (struct ieee80211_hdr *) skb->data;
123 /* we preserve the previous mesh header and only add
124 * the new addreses */
125 mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen);
126 mshdr->flags = MESH_FLAGS_AE_A5_A6;
127 memcpy(mshdr->eaddr1, hdr->addr3, ETH_ALEN);
128 memcpy(mshdr->eaddr2, hdr->addr4, ETH_ALEN);
131 /* update next hop */
132 hdr = (struct ieee80211_hdr *) skb->data;
134 next_hop = rcu_dereference(gate_mpath->next_hop)->sta.addr;
135 memcpy(hdr->addr1, next_hop, ETH_ALEN);
137 memcpy(hdr->addr2, gate_mpath->sdata->vif.addr, ETH_ALEN);
138 memcpy(hdr->addr3, dst_addr, ETH_ALEN);
142 * mesh_path_move_to_queue - Move or copy frames from one mpath queue to another
144 * This function is used to transfer or copy frames from an unresolved mpath to
145 * a gate mpath. The function also adds the Address Extension field and
146 * updates the next hop.
148 * If a frame already has an Address Extension field, only the next hop and
149 * destination addresses are updated.
151 * The gate mpath must be an active mpath with a valid mpath->next_hop.
153 * @gate_mpath: An active mpath the frames will be sent to (i.e. the gate)
154 * @from_mpath: The failed mpath
155 * @copy: When true, copy all the frames to the new mpath queue. When false,
158 static void mesh_path_move_to_queue(struct mesh_path *gate_mpath,
159 struct mesh_path *from_mpath,
162 struct sk_buff *skb, *fskb, *tmp;
163 struct sk_buff_head failq;
166 if (WARN_ON(gate_mpath == from_mpath))
168 if (WARN_ON(!gate_mpath->next_hop))
171 __skb_queue_head_init(&failq);
173 spin_lock_irqsave(&from_mpath->frame_queue.lock, flags);
174 skb_queue_splice_init(&from_mpath->frame_queue, &failq);
175 spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags);
177 skb_queue_walk_safe(&failq, fskb, tmp) {
178 if (skb_queue_len(&gate_mpath->frame_queue) >=
179 MESH_FRAME_QUEUE_LEN) {
180 mpath_dbg(gate_mpath->sdata, "mpath queue full!\n");
184 skb = skb_copy(fskb, GFP_ATOMIC);
188 prepare_for_gate(skb, gate_mpath->dst, gate_mpath);
189 skb_queue_tail(&gate_mpath->frame_queue, skb);
194 __skb_unlink(fskb, &failq);
198 mpath_dbg(gate_mpath->sdata, "Mpath queue for gate %pM has %d frames\n",
199 gate_mpath->dst, skb_queue_len(&gate_mpath->frame_queue));
204 spin_lock_irqsave(&from_mpath->frame_queue.lock, flags);
205 skb_queue_splice(&failq, &from_mpath->frame_queue);
206 spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags);
210 static struct mesh_path *mpath_lookup(struct mesh_table *tbl, const u8 *dst,
211 struct ieee80211_sub_if_data *sdata)
213 struct mesh_path *mpath;
215 mpath = rhashtable_lookup(&tbl->rhead, dst, mesh_rht_params);
217 if (mpath && mpath_expired(mpath)) {
218 spin_lock_bh(&mpath->state_lock);
219 mpath->flags &= ~MESH_PATH_ACTIVE;
220 spin_unlock_bh(&mpath->state_lock);
226 * mesh_path_lookup - look up a path in the mesh path table
227 * @sdata: local subif
228 * @dst: hardware address (ETH_ALEN length) of destination
230 * Returns: pointer to the mesh path structure, or NULL if not found
232 * Locking: must be called within a read rcu section.
235 mesh_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst)
237 return mpath_lookup(sdata->u.mesh.mesh_paths, dst, sdata);
241 mpp_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst)
243 return mpath_lookup(sdata->u.mesh.mpp_paths, dst, sdata);
246 static struct mesh_path *
247 __mesh_path_lookup_by_idx(struct mesh_table *tbl, int idx)
250 struct mesh_path *mpath;
252 hlist_for_each_entry_rcu(mpath, &tbl->walk_head, walk_list) {
260 if (mpath_expired(mpath)) {
261 spin_lock_bh(&mpath->state_lock);
262 mpath->flags &= ~MESH_PATH_ACTIVE;
263 spin_unlock_bh(&mpath->state_lock);
269 * mesh_path_lookup_by_idx - look up a path in the mesh path table by its index
271 * @sdata: local subif, or NULL for all entries
273 * Returns: pointer to the mesh path structure, or NULL if not found.
275 * Locking: must be called within a read rcu section.
278 mesh_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx)
280 return __mesh_path_lookup_by_idx(sdata->u.mesh.mesh_paths, idx);
284 * mpp_path_lookup_by_idx - look up a path in the proxy path table by its index
286 * @sdata: local subif, or NULL for all entries
288 * Returns: pointer to the proxy path structure, or NULL if not found.
290 * Locking: must be called within a read rcu section.
293 mpp_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx)
295 return __mesh_path_lookup_by_idx(sdata->u.mesh.mpp_paths, idx);
299 * mesh_path_add_gate - add the given mpath to a mesh gate to our path table
300 * @mpath: gate path to add to table
302 int mesh_path_add_gate(struct mesh_path *mpath)
304 struct mesh_table *tbl;
308 tbl = mpath->sdata->u.mesh.mesh_paths;
310 spin_lock_bh(&mpath->state_lock);
311 if (mpath->is_gate) {
313 spin_unlock_bh(&mpath->state_lock);
316 mpath->is_gate = true;
317 mpath->sdata->u.mesh.num_gates++;
319 spin_lock(&tbl->gates_lock);
320 hlist_add_head_rcu(&mpath->gate_list, &tbl->known_gates);
321 spin_unlock(&tbl->gates_lock);
323 spin_unlock_bh(&mpath->state_lock);
325 mpath_dbg(mpath->sdata,
326 "Mesh path: Recorded new gate: %pM. %d known gates\n",
327 mpath->dst, mpath->sdata->u.mesh.num_gates);
335 * mesh_gate_del - remove a mesh gate from the list of known gates
336 * @tbl: table which holds our list of known gates
339 static void mesh_gate_del(struct mesh_table *tbl, struct mesh_path *mpath)
341 lockdep_assert_held(&mpath->state_lock);
345 mpath->is_gate = false;
346 spin_lock_bh(&tbl->gates_lock);
347 hlist_del_rcu(&mpath->gate_list);
348 mpath->sdata->u.mesh.num_gates--;
349 spin_unlock_bh(&tbl->gates_lock);
351 mpath_dbg(mpath->sdata,
352 "Mesh path: Deleted gate: %pM. %d known gates\n",
353 mpath->dst, mpath->sdata->u.mesh.num_gates);
357 * mesh_gate_num - number of gates known to this interface
360 int mesh_gate_num(struct ieee80211_sub_if_data *sdata)
362 return sdata->u.mesh.num_gates;
366 struct mesh_path *mesh_path_new(struct ieee80211_sub_if_data *sdata,
367 const u8 *dst, gfp_t gfp_flags)
369 struct mesh_path *new_mpath;
371 new_mpath = kzalloc(sizeof(struct mesh_path), gfp_flags);
375 memcpy(new_mpath->dst, dst, ETH_ALEN);
376 eth_broadcast_addr(new_mpath->rann_snd_addr);
377 new_mpath->is_root = false;
378 new_mpath->sdata = sdata;
379 new_mpath->flags = 0;
380 skb_queue_head_init(&new_mpath->frame_queue);
381 new_mpath->exp_time = jiffies;
382 spin_lock_init(&new_mpath->state_lock);
383 timer_setup(&new_mpath->timer, mesh_path_timer, 0);
389 * mesh_path_add - allocate and add a new path to the mesh path table
390 * @dst: destination address of the path (ETH_ALEN length)
391 * @sdata: local subif
393 * Returns: 0 on success
395 * State: the initial state of the new path is set to 0
397 struct mesh_path *mesh_path_add(struct ieee80211_sub_if_data *sdata,
400 struct mesh_table *tbl;
401 struct mesh_path *mpath, *new_mpath;
403 if (ether_addr_equal(dst, sdata->vif.addr))
404 /* never add ourselves as neighbours */
405 return ERR_PTR(-ENOTSUPP);
407 if (is_multicast_ether_addr(dst))
408 return ERR_PTR(-ENOTSUPP);
410 if (atomic_add_unless(&sdata->u.mesh.mpaths, 1, MESH_MAX_MPATHS) == 0)
411 return ERR_PTR(-ENOSPC);
413 new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC);
415 return ERR_PTR(-ENOMEM);
417 tbl = sdata->u.mesh.mesh_paths;
418 spin_lock_bh(&tbl->walk_lock);
419 mpath = rhashtable_lookup_get_insert_fast(&tbl->rhead,
423 hlist_add_head(&new_mpath->walk_list, &tbl->walk_head);
424 spin_unlock_bh(&tbl->walk_lock);
435 sdata->u.mesh.mesh_paths_generation++;
439 int mpp_path_add(struct ieee80211_sub_if_data *sdata,
440 const u8 *dst, const u8 *mpp)
442 struct mesh_table *tbl;
443 struct mesh_path *new_mpath;
446 if (ether_addr_equal(dst, sdata->vif.addr))
447 /* never add ourselves as neighbours */
450 if (is_multicast_ether_addr(dst))
453 new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC);
458 memcpy(new_mpath->mpp, mpp, ETH_ALEN);
459 tbl = sdata->u.mesh.mpp_paths;
461 spin_lock_bh(&tbl->walk_lock);
462 ret = rhashtable_lookup_insert_fast(&tbl->rhead,
466 hlist_add_head_rcu(&new_mpath->walk_list, &tbl->walk_head);
467 spin_unlock_bh(&tbl->walk_lock);
472 sdata->u.mesh.mpp_paths_generation++;
478 * mesh_plink_broken - deactivates paths and sends perr when a link breaks
480 * @sta: broken peer link
482 * This function must be called from the rate control algorithm if enough
483 * delivery errors suggest that a peer link is no longer usable.
485 void mesh_plink_broken(struct sta_info *sta)
487 struct ieee80211_sub_if_data *sdata = sta->sdata;
488 struct mesh_table *tbl = sdata->u.mesh.mesh_paths;
489 static const u8 bcast[ETH_ALEN] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
490 struct mesh_path *mpath;
493 hlist_for_each_entry_rcu(mpath, &tbl->walk_head, walk_list) {
494 if (rcu_access_pointer(mpath->next_hop) == sta &&
495 mpath->flags & MESH_PATH_ACTIVE &&
496 !(mpath->flags & MESH_PATH_FIXED)) {
497 spin_lock_bh(&mpath->state_lock);
498 mpath->flags &= ~MESH_PATH_ACTIVE;
500 spin_unlock_bh(&mpath->state_lock);
501 mesh_path_error_tx(sdata,
502 sdata->u.mesh.mshcfg.element_ttl,
503 mpath->dst, mpath->sn,
504 WLAN_REASON_MESH_PATH_DEST_UNREACHABLE, bcast);
510 static void mesh_path_free_rcu(struct mesh_table *tbl,
511 struct mesh_path *mpath)
513 struct ieee80211_sub_if_data *sdata = mpath->sdata;
515 spin_lock_bh(&mpath->state_lock);
516 mpath->flags |= MESH_PATH_RESOLVING | MESH_PATH_DELETED;
517 mesh_gate_del(tbl, mpath);
518 spin_unlock_bh(&mpath->state_lock);
519 del_timer_sync(&mpath->timer);
520 atomic_dec(&sdata->u.mesh.mpaths);
521 atomic_dec(&tbl->entries);
522 mesh_path_flush_pending(mpath);
523 kfree_rcu(mpath, rcu);
526 static void __mesh_path_del(struct mesh_table *tbl, struct mesh_path *mpath)
528 hlist_del_rcu(&mpath->walk_list);
529 rhashtable_remove_fast(&tbl->rhead, &mpath->rhash, mesh_rht_params);
530 mesh_path_free_rcu(tbl, mpath);
534 * mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches
536 * @sta: mesh peer to match
538 * RCU notes: this function is called when a mesh plink transitions from
539 * PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that
540 * allows path creation. This will happen before the sta can be freed (because
541 * sta_info_destroy() calls this) so any reader in a rcu read block will be
542 * protected against the plink disappearing.
544 void mesh_path_flush_by_nexthop(struct sta_info *sta)
546 struct ieee80211_sub_if_data *sdata = sta->sdata;
547 struct mesh_table *tbl = sdata->u.mesh.mesh_paths;
548 struct mesh_path *mpath;
549 struct hlist_node *n;
551 spin_lock_bh(&tbl->walk_lock);
552 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
553 if (rcu_access_pointer(mpath->next_hop) == sta)
554 __mesh_path_del(tbl, mpath);
556 spin_unlock_bh(&tbl->walk_lock);
559 static void mpp_flush_by_proxy(struct ieee80211_sub_if_data *sdata,
562 struct mesh_table *tbl = sdata->u.mesh.mpp_paths;
563 struct mesh_path *mpath;
564 struct hlist_node *n;
566 spin_lock_bh(&tbl->walk_lock);
567 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
568 if (ether_addr_equal(mpath->mpp, proxy))
569 __mesh_path_del(tbl, mpath);
571 spin_unlock_bh(&tbl->walk_lock);
574 static void table_flush_by_iface(struct mesh_table *tbl)
576 struct mesh_path *mpath;
577 struct hlist_node *n;
579 spin_lock_bh(&tbl->walk_lock);
580 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
581 __mesh_path_del(tbl, mpath);
583 spin_unlock_bh(&tbl->walk_lock);
587 * mesh_path_flush_by_iface - Deletes all mesh paths associated with a given iface
589 * This function deletes both mesh paths as well as mesh portal paths.
591 * @sdata: interface data to match
594 void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata)
596 table_flush_by_iface(sdata->u.mesh.mesh_paths);
597 table_flush_by_iface(sdata->u.mesh.mpp_paths);
601 * table_path_del - delete a path from the mesh or mpp table
603 * @tbl: mesh or mpp path table
604 * @sdata: local subif
605 * @addr: dst address (ETH_ALEN length)
607 * Returns: 0 if successful
609 static int table_path_del(struct mesh_table *tbl,
610 struct ieee80211_sub_if_data *sdata,
613 struct mesh_path *mpath;
615 spin_lock_bh(&tbl->walk_lock);
616 mpath = rhashtable_lookup_fast(&tbl->rhead, addr, mesh_rht_params);
618 spin_unlock_bh(&tbl->walk_lock);
622 __mesh_path_del(tbl, mpath);
623 spin_unlock_bh(&tbl->walk_lock);
629 * mesh_path_del - delete a mesh path from the table
631 * @addr: dst address (ETH_ALEN length)
632 * @sdata: local subif
634 * Returns: 0 if successful
636 int mesh_path_del(struct ieee80211_sub_if_data *sdata, const u8 *addr)
640 /* flush relevant mpp entries first */
641 mpp_flush_by_proxy(sdata, addr);
643 err = table_path_del(sdata->u.mesh.mesh_paths, sdata, addr);
644 sdata->u.mesh.mesh_paths_generation++;
649 * mesh_path_tx_pending - sends pending frames in a mesh path queue
651 * @mpath: mesh path to activate
653 * Locking: the state_lock of the mpath structure must NOT be held when calling
656 void mesh_path_tx_pending(struct mesh_path *mpath)
658 if (mpath->flags & MESH_PATH_ACTIVE)
659 ieee80211_add_pending_skbs(mpath->sdata->local,
660 &mpath->frame_queue);
664 * mesh_path_send_to_gates - sends pending frames to all known mesh gates
666 * @mpath: mesh path whose queue will be emptied
668 * If there is only one gate, the frames are transferred from the failed mpath
669 * queue to that gate's queue. If there are more than one gates, the frames
670 * are copied from each gate to the next. After frames are copied, the
671 * mpath queues are emptied onto the transmission queue.
673 int mesh_path_send_to_gates(struct mesh_path *mpath)
675 struct ieee80211_sub_if_data *sdata = mpath->sdata;
676 struct mesh_table *tbl;
677 struct mesh_path *from_mpath = mpath;
678 struct mesh_path *gate;
681 tbl = sdata->u.mesh.mesh_paths;
684 hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) {
685 if (gate->flags & MESH_PATH_ACTIVE) {
686 mpath_dbg(sdata, "Forwarding to %pM\n", gate->dst);
687 mesh_path_move_to_queue(gate, from_mpath, copy);
692 "Not forwarding to %pM (flags %#x)\n",
693 gate->dst, gate->flags);
697 hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) {
698 mpath_dbg(sdata, "Sending to %pM\n", gate->dst);
699 mesh_path_tx_pending(gate);
703 return (from_mpath == mpath) ? -EHOSTUNREACH : 0;
707 * mesh_path_discard_frame - discard a frame whose path could not be resolved
709 * @skb: frame to discard
710 * @sdata: network subif the frame was to be sent through
712 * Locking: the function must me called within a rcu_read_lock region
714 void mesh_path_discard_frame(struct ieee80211_sub_if_data *sdata,
718 sdata->u.mesh.mshstats.dropped_frames_no_route++;
722 * mesh_path_flush_pending - free the pending queue of a mesh path
724 * @mpath: mesh path whose queue has to be freed
726 * Locking: the function must me called within a rcu_read_lock region
728 void mesh_path_flush_pending(struct mesh_path *mpath)
732 while ((skb = skb_dequeue(&mpath->frame_queue)) != NULL)
733 mesh_path_discard_frame(mpath->sdata, skb);
737 * mesh_path_fix_nexthop - force a specific next hop for a mesh path
739 * @mpath: the mesh path to modify
740 * @next_hop: the next hop to force
742 * Locking: this function must be called holding mpath->state_lock
744 void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop)
746 spin_lock_bh(&mpath->state_lock);
747 mesh_path_assign_nexthop(mpath, next_hop);
750 mpath->hop_count = 0;
752 mpath->flags = MESH_PATH_FIXED | MESH_PATH_SN_VALID;
753 mesh_path_activate(mpath);
754 spin_unlock_bh(&mpath->state_lock);
755 ewma_mesh_fail_avg_init(&next_hop->mesh->fail_avg);
756 /* init it at a low value - 0 start is tricky */
757 ewma_mesh_fail_avg_add(&next_hop->mesh->fail_avg, 1);
758 mesh_path_tx_pending(mpath);
761 int mesh_pathtbl_init(struct ieee80211_sub_if_data *sdata)
763 struct mesh_table *tbl_path, *tbl_mpp;
766 tbl_path = mesh_table_alloc();
770 tbl_mpp = mesh_table_alloc();
776 rhashtable_init(&tbl_path->rhead, &mesh_rht_params);
777 rhashtable_init(&tbl_mpp->rhead, &mesh_rht_params);
779 sdata->u.mesh.mesh_paths = tbl_path;
780 sdata->u.mesh.mpp_paths = tbl_mpp;
785 mesh_table_free(tbl_path);
790 void mesh_path_tbl_expire(struct ieee80211_sub_if_data *sdata,
791 struct mesh_table *tbl)
793 struct mesh_path *mpath;
794 struct hlist_node *n;
796 spin_lock_bh(&tbl->walk_lock);
797 hlist_for_each_entry_safe(mpath, n, &tbl->walk_head, walk_list) {
798 if ((!(mpath->flags & MESH_PATH_RESOLVING)) &&
799 (!(mpath->flags & MESH_PATH_FIXED)) &&
800 time_after(jiffies, mpath->exp_time + MESH_PATH_EXPIRE))
801 __mesh_path_del(tbl, mpath);
803 spin_unlock_bh(&tbl->walk_lock);
806 void mesh_path_expire(struct ieee80211_sub_if_data *sdata)
808 mesh_path_tbl_expire(sdata, sdata->u.mesh.mesh_paths);
809 mesh_path_tbl_expire(sdata, sdata->u.mesh.mpp_paths);
812 void mesh_pathtbl_unregister(struct ieee80211_sub_if_data *sdata)
814 mesh_table_free(sdata->u.mesh.mesh_paths);
815 mesh_table_free(sdata->u.mesh.mpp_paths);