2 * Copyright (c) 2008, 2009 open80211s Ltd.
3 * Author: Luis Carlos Cobo <luisca@cozybit.com>
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation.
10 #include <linux/etherdevice.h>
11 #include <linux/list.h>
12 #include <linux/random.h>
13 #include <linux/slab.h>
14 #include <linux/spinlock.h>
15 #include <linux/string.h>
16 #include <net/mac80211.h>
18 #include "ieee80211_i.h"
21 static void mesh_path_free_rcu(struct mesh_table
*tbl
, struct mesh_path
*mpath
);
23 static u32
mesh_table_hash(const void *addr
, u32 len
, u32 seed
)
25 /* Use last four bytes of hw addr as hash index */
26 return jhash_1word(*(u32
*)(addr
+2), seed
);
29 static const struct rhashtable_params mesh_rht_params
= {
31 .automatic_shrinking
= true,
33 .key_offset
= offsetof(struct mesh_path
, dst
),
34 .head_offset
= offsetof(struct mesh_path
, rhash
),
35 .hashfn
= mesh_table_hash
,
38 static inline bool mpath_expired(struct mesh_path
*mpath
)
40 return (mpath
->flags
& MESH_PATH_ACTIVE
) &&
41 time_after(jiffies
, mpath
->exp_time
) &&
42 !(mpath
->flags
& MESH_PATH_FIXED
);
45 static void mesh_path_rht_free(void *ptr
, void *tblptr
)
47 struct mesh_path
*mpath
= ptr
;
48 struct mesh_table
*tbl
= tblptr
;
50 mesh_path_free_rcu(tbl
, mpath
);
53 static struct mesh_table
*mesh_table_alloc(void)
55 struct mesh_table
*newtbl
;
57 newtbl
= kmalloc(sizeof(struct mesh_table
), GFP_ATOMIC
);
61 INIT_HLIST_HEAD(&newtbl
->known_gates
);
62 atomic_set(&newtbl
->entries
, 0);
63 spin_lock_init(&newtbl
->gates_lock
);
68 static void mesh_table_free(struct mesh_table
*tbl
)
70 rhashtable_free_and_destroy(&tbl
->rhead
,
71 mesh_path_rht_free
, tbl
);
77 * mesh_path_assign_nexthop - update mesh path next hop
79 * @mpath: mesh path to update
80 * @sta: next hop to assign
82 * Locking: mpath->state_lock must be held when calling this function
84 void mesh_path_assign_nexthop(struct mesh_path
*mpath
, struct sta_info
*sta
)
87 struct ieee80211_hdr
*hdr
;
90 rcu_assign_pointer(mpath
->next_hop
, sta
);
92 spin_lock_irqsave(&mpath
->frame_queue
.lock
, flags
);
93 skb_queue_walk(&mpath
->frame_queue
, skb
) {
94 hdr
= (struct ieee80211_hdr
*) skb
->data
;
95 memcpy(hdr
->addr1
, sta
->sta
.addr
, ETH_ALEN
);
96 memcpy(hdr
->addr2
, mpath
->sdata
->vif
.addr
, ETH_ALEN
);
97 ieee80211_mps_set_frame_flags(sta
->sdata
, sta
, hdr
);
100 spin_unlock_irqrestore(&mpath
->frame_queue
.lock
, flags
);
103 static void prepare_for_gate(struct sk_buff
*skb
, char *dst_addr
,
104 struct mesh_path
*gate_mpath
)
106 struct ieee80211_hdr
*hdr
;
107 struct ieee80211s_hdr
*mshdr
;
108 int mesh_hdrlen
, hdrlen
;
111 hdr
= (struct ieee80211_hdr
*) skb
->data
;
112 hdrlen
= ieee80211_hdrlen(hdr
->frame_control
);
113 mshdr
= (struct ieee80211s_hdr
*) (skb
->data
+ hdrlen
);
115 if (!(mshdr
->flags
& MESH_FLAGS_AE
)) {
116 /* size of the fixed part of the mesh header */
119 /* make room for the two extended addresses */
120 skb_push(skb
, 2 * ETH_ALEN
);
121 memmove(skb
->data
, hdr
, hdrlen
+ mesh_hdrlen
);
123 hdr
= (struct ieee80211_hdr
*) skb
->data
;
125 /* we preserve the previous mesh header and only add
126 * the new addreses */
127 mshdr
= (struct ieee80211s_hdr
*) (skb
->data
+ hdrlen
);
128 mshdr
->flags
= MESH_FLAGS_AE_A5_A6
;
129 memcpy(mshdr
->eaddr1
, hdr
->addr3
, ETH_ALEN
);
130 memcpy(mshdr
->eaddr2
, hdr
->addr4
, ETH_ALEN
);
133 /* update next hop */
134 hdr
= (struct ieee80211_hdr
*) skb
->data
;
136 next_hop
= rcu_dereference(gate_mpath
->next_hop
)->sta
.addr
;
137 memcpy(hdr
->addr1
, next_hop
, ETH_ALEN
);
139 memcpy(hdr
->addr2
, gate_mpath
->sdata
->vif
.addr
, ETH_ALEN
);
140 memcpy(hdr
->addr3
, dst_addr
, ETH_ALEN
);
145 * mesh_path_move_to_queue - Move or copy frames from one mpath queue to another
147 * This function is used to transfer or copy frames from an unresolved mpath to
148 * a gate mpath. The function also adds the Address Extension field and
149 * updates the next hop.
151 * If a frame already has an Address Extension field, only the next hop and
152 * destination addresses are updated.
154 * The gate mpath must be an active mpath with a valid mpath->next_hop.
156 * @mpath: An active mpath the frames will be sent to (i.e. the gate)
157 * @from_mpath: The failed mpath
158 * @copy: When true, copy all the frames to the new mpath queue. When false,
161 static void mesh_path_move_to_queue(struct mesh_path
*gate_mpath
,
162 struct mesh_path
*from_mpath
,
165 struct sk_buff
*skb
, *fskb
, *tmp
;
166 struct sk_buff_head failq
;
169 if (WARN_ON(gate_mpath
== from_mpath
))
171 if (WARN_ON(!gate_mpath
->next_hop
))
174 __skb_queue_head_init(&failq
);
176 spin_lock_irqsave(&from_mpath
->frame_queue
.lock
, flags
);
177 skb_queue_splice_init(&from_mpath
->frame_queue
, &failq
);
178 spin_unlock_irqrestore(&from_mpath
->frame_queue
.lock
, flags
);
180 skb_queue_walk_safe(&failq
, fskb
, tmp
) {
181 if (skb_queue_len(&gate_mpath
->frame_queue
) >=
182 MESH_FRAME_QUEUE_LEN
) {
183 mpath_dbg(gate_mpath
->sdata
, "mpath queue full!\n");
187 skb
= skb_copy(fskb
, GFP_ATOMIC
);
191 prepare_for_gate(skb
, gate_mpath
->dst
, gate_mpath
);
192 skb_queue_tail(&gate_mpath
->frame_queue
, skb
);
197 __skb_unlink(fskb
, &failq
);
201 mpath_dbg(gate_mpath
->sdata
, "Mpath queue for gate %pM has %d frames\n",
202 gate_mpath
->dst
, skb_queue_len(&gate_mpath
->frame_queue
));
207 spin_lock_irqsave(&from_mpath
->frame_queue
.lock
, flags
);
208 skb_queue_splice(&failq
, &from_mpath
->frame_queue
);
209 spin_unlock_irqrestore(&from_mpath
->frame_queue
.lock
, flags
);
213 static struct mesh_path
*mpath_lookup(struct mesh_table
*tbl
, const u8
*dst
,
214 struct ieee80211_sub_if_data
*sdata
)
216 struct mesh_path
*mpath
;
218 mpath
= rhashtable_lookup_fast(&tbl
->rhead
, dst
, mesh_rht_params
);
220 if (mpath
&& mpath_expired(mpath
)) {
221 spin_lock_bh(&mpath
->state_lock
);
222 mpath
->flags
&= ~MESH_PATH_ACTIVE
;
223 spin_unlock_bh(&mpath
->state_lock
);
229 * mesh_path_lookup - look up a path in the mesh path table
230 * @sdata: local subif
231 * @dst: hardware address (ETH_ALEN length) of destination
233 * Returns: pointer to the mesh path structure, or NULL if not found
235 * Locking: must be called within a read rcu section.
238 mesh_path_lookup(struct ieee80211_sub_if_data
*sdata
, const u8
*dst
)
240 return mpath_lookup(sdata
->u
.mesh
.mesh_paths
, dst
, sdata
);
244 mpp_path_lookup(struct ieee80211_sub_if_data
*sdata
, const u8
*dst
)
246 return mpath_lookup(sdata
->u
.mesh
.mpp_paths
, dst
, sdata
);
249 static struct mesh_path
*
250 __mesh_path_lookup_by_idx(struct mesh_table
*tbl
, int idx
)
253 struct mesh_path
*mpath
= NULL
;
254 struct rhashtable_iter iter
;
256 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_ATOMIC
);
260 ret
= rhashtable_walk_start(&iter
);
261 if (ret
&& ret
!= -EAGAIN
)
264 while ((mpath
= rhashtable_walk_next(&iter
))) {
265 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
273 rhashtable_walk_stop(&iter
);
274 rhashtable_walk_exit(&iter
);
276 if (IS_ERR(mpath
) || !mpath
)
279 if (mpath_expired(mpath
)) {
280 spin_lock_bh(&mpath
->state_lock
);
281 mpath
->flags
&= ~MESH_PATH_ACTIVE
;
282 spin_unlock_bh(&mpath
->state_lock
);
288 * mesh_path_lookup_by_idx - look up a path in the mesh path table by its index
290 * @sdata: local subif, or NULL for all entries
292 * Returns: pointer to the mesh path structure, or NULL if not found.
294 * Locking: must be called within a read rcu section.
297 mesh_path_lookup_by_idx(struct ieee80211_sub_if_data
*sdata
, int idx
)
299 return __mesh_path_lookup_by_idx(sdata
->u
.mesh
.mesh_paths
, idx
);
303 * mpp_path_lookup_by_idx - look up a path in the proxy path table by its index
305 * @sdata: local subif, or NULL for all entries
307 * Returns: pointer to the proxy path structure, or NULL if not found.
309 * Locking: must be called within a read rcu section.
312 mpp_path_lookup_by_idx(struct ieee80211_sub_if_data
*sdata
, int idx
)
314 return __mesh_path_lookup_by_idx(sdata
->u
.mesh
.mpp_paths
, idx
);
318 * mesh_path_add_gate - add the given mpath to a mesh gate to our path table
319 * @mpath: gate path to add to table
321 int mesh_path_add_gate(struct mesh_path
*mpath
)
323 struct mesh_table
*tbl
;
327 tbl
= mpath
->sdata
->u
.mesh
.mesh_paths
;
329 spin_lock_bh(&mpath
->state_lock
);
330 if (mpath
->is_gate
) {
332 spin_unlock_bh(&mpath
->state_lock
);
335 mpath
->is_gate
= true;
336 mpath
->sdata
->u
.mesh
.num_gates
++;
338 spin_lock(&tbl
->gates_lock
);
339 hlist_add_head_rcu(&mpath
->gate_list
, &tbl
->known_gates
);
340 spin_unlock(&tbl
->gates_lock
);
342 spin_unlock_bh(&mpath
->state_lock
);
344 mpath_dbg(mpath
->sdata
,
345 "Mesh path: Recorded new gate: %pM. %d known gates\n",
346 mpath
->dst
, mpath
->sdata
->u
.mesh
.num_gates
);
354 * mesh_gate_del - remove a mesh gate from the list of known gates
355 * @tbl: table which holds our list of known gates
358 static void mesh_gate_del(struct mesh_table
*tbl
, struct mesh_path
*mpath
)
360 lockdep_assert_held(&mpath
->state_lock
);
364 mpath
->is_gate
= false;
365 spin_lock_bh(&tbl
->gates_lock
);
366 hlist_del_rcu(&mpath
->gate_list
);
367 mpath
->sdata
->u
.mesh
.num_gates
--;
368 spin_unlock_bh(&tbl
->gates_lock
);
370 mpath_dbg(mpath
->sdata
,
371 "Mesh path: Deleted gate: %pM. %d known gates\n",
372 mpath
->dst
, mpath
->sdata
->u
.mesh
.num_gates
);
376 * mesh_gate_num - number of gates known to this interface
379 int mesh_gate_num(struct ieee80211_sub_if_data
*sdata
)
381 return sdata
->u
.mesh
.num_gates
;
385 struct mesh_path
*mesh_path_new(struct ieee80211_sub_if_data
*sdata
,
386 const u8
*dst
, gfp_t gfp_flags
)
388 struct mesh_path
*new_mpath
;
390 new_mpath
= kzalloc(sizeof(struct mesh_path
), gfp_flags
);
394 memcpy(new_mpath
->dst
, dst
, ETH_ALEN
);
395 eth_broadcast_addr(new_mpath
->rann_snd_addr
);
396 new_mpath
->is_root
= false;
397 new_mpath
->sdata
= sdata
;
398 new_mpath
->flags
= 0;
399 skb_queue_head_init(&new_mpath
->frame_queue
);
400 new_mpath
->exp_time
= jiffies
;
401 spin_lock_init(&new_mpath
->state_lock
);
402 setup_timer(&new_mpath
->timer
, mesh_path_timer
,
403 (unsigned long) new_mpath
);
409 * mesh_path_add - allocate and add a new path to the mesh path table
410 * @dst: destination address of the path (ETH_ALEN length)
411 * @sdata: local subif
413 * Returns: 0 on success
415 * State: the initial state of the new path is set to 0
417 struct mesh_path
*mesh_path_add(struct ieee80211_sub_if_data
*sdata
,
420 struct mesh_table
*tbl
;
421 struct mesh_path
*mpath
, *new_mpath
;
424 if (ether_addr_equal(dst
, sdata
->vif
.addr
))
425 /* never add ourselves as neighbours */
426 return ERR_PTR(-ENOTSUPP
);
428 if (is_multicast_ether_addr(dst
))
429 return ERR_PTR(-ENOTSUPP
);
431 if (atomic_add_unless(&sdata
->u
.mesh
.mpaths
, 1, MESH_MAX_MPATHS
) == 0)
432 return ERR_PTR(-ENOSPC
);
434 new_mpath
= mesh_path_new(sdata
, dst
, GFP_ATOMIC
);
436 return ERR_PTR(-ENOMEM
);
438 tbl
= sdata
->u
.mesh
.mesh_paths
;
440 ret
= rhashtable_lookup_insert_fast(&tbl
->rhead
,
445 mpath
= rhashtable_lookup_fast(&tbl
->rhead
,
449 } while (unlikely(ret
== -EEXIST
&& !mpath
));
451 if (ret
&& ret
!= -EEXIST
)
454 /* At this point either new_mpath was added, or we found a
455 * matching entry already in the table; in the latter case
456 * free the unnecessary new entry.
458 if (ret
== -EEXIST
) {
462 sdata
->u
.mesh
.mesh_paths_generation
++;
466 int mpp_path_add(struct ieee80211_sub_if_data
*sdata
,
467 const u8
*dst
, const u8
*mpp
)
469 struct mesh_table
*tbl
;
470 struct mesh_path
*new_mpath
;
473 if (ether_addr_equal(dst
, sdata
->vif
.addr
))
474 /* never add ourselves as neighbours */
477 if (is_multicast_ether_addr(dst
))
480 new_mpath
= mesh_path_new(sdata
, dst
, GFP_ATOMIC
);
485 memcpy(new_mpath
->mpp
, mpp
, ETH_ALEN
);
486 tbl
= sdata
->u
.mesh
.mpp_paths
;
487 ret
= rhashtable_lookup_insert_fast(&tbl
->rhead
,
491 sdata
->u
.mesh
.mpp_paths_generation
++;
497 * mesh_plink_broken - deactivates paths and sends perr when a link breaks
499 * @sta: broken peer link
501 * This function must be called from the rate control algorithm if enough
502 * delivery errors suggest that a peer link is no longer usable.
504 void mesh_plink_broken(struct sta_info
*sta
)
506 struct ieee80211_sub_if_data
*sdata
= sta
->sdata
;
507 struct mesh_table
*tbl
= sdata
->u
.mesh
.mesh_paths
;
508 static const u8 bcast
[ETH_ALEN
] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
509 struct mesh_path
*mpath
;
510 struct rhashtable_iter iter
;
513 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_ATOMIC
);
517 ret
= rhashtable_walk_start(&iter
);
518 if (ret
&& ret
!= -EAGAIN
)
521 while ((mpath
= rhashtable_walk_next(&iter
))) {
522 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
526 if (rcu_access_pointer(mpath
->next_hop
) == sta
&&
527 mpath
->flags
& MESH_PATH_ACTIVE
&&
528 !(mpath
->flags
& MESH_PATH_FIXED
)) {
529 spin_lock_bh(&mpath
->state_lock
);
530 mpath
->flags
&= ~MESH_PATH_ACTIVE
;
532 spin_unlock_bh(&mpath
->state_lock
);
533 mesh_path_error_tx(sdata
,
534 sdata
->u
.mesh
.mshcfg
.element_ttl
,
535 mpath
->dst
, mpath
->sn
,
536 WLAN_REASON_MESH_PATH_DEST_UNREACHABLE
, bcast
);
540 rhashtable_walk_stop(&iter
);
541 rhashtable_walk_exit(&iter
);
544 static void mesh_path_free_rcu(struct mesh_table
*tbl
,
545 struct mesh_path
*mpath
)
547 struct ieee80211_sub_if_data
*sdata
= mpath
->sdata
;
549 spin_lock_bh(&mpath
->state_lock
);
550 mpath
->flags
|= MESH_PATH_RESOLVING
| MESH_PATH_DELETED
;
551 mesh_gate_del(tbl
, mpath
);
552 spin_unlock_bh(&mpath
->state_lock
);
553 del_timer_sync(&mpath
->timer
);
554 atomic_dec(&sdata
->u
.mesh
.mpaths
);
555 atomic_dec(&tbl
->entries
);
556 kfree_rcu(mpath
, rcu
);
559 static void __mesh_path_del(struct mesh_table
*tbl
, struct mesh_path
*mpath
)
561 rhashtable_remove_fast(&tbl
->rhead
, &mpath
->rhash
, mesh_rht_params
);
562 mesh_path_free_rcu(tbl
, mpath
);
566 * mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches
568 * @sta: mesh peer to match
570 * RCU notes: this function is called when a mesh plink transitions from
571 * PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that
572 * allows path creation. This will happen before the sta can be freed (because
573 * sta_info_destroy() calls this) so any reader in a rcu read block will be
574 * protected against the plink disappearing.
576 void mesh_path_flush_by_nexthop(struct sta_info
*sta
)
578 struct ieee80211_sub_if_data
*sdata
= sta
->sdata
;
579 struct mesh_table
*tbl
= sdata
->u
.mesh
.mesh_paths
;
580 struct mesh_path
*mpath
;
581 struct rhashtable_iter iter
;
584 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_ATOMIC
);
588 ret
= rhashtable_walk_start(&iter
);
589 if (ret
&& ret
!= -EAGAIN
)
592 while ((mpath
= rhashtable_walk_next(&iter
))) {
593 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
598 if (rcu_access_pointer(mpath
->next_hop
) == sta
)
599 __mesh_path_del(tbl
, mpath
);
602 rhashtable_walk_stop(&iter
);
603 rhashtable_walk_exit(&iter
);
606 static void mpp_flush_by_proxy(struct ieee80211_sub_if_data
*sdata
,
609 struct mesh_table
*tbl
= sdata
->u
.mesh
.mpp_paths
;
610 struct mesh_path
*mpath
;
611 struct rhashtable_iter iter
;
614 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_ATOMIC
);
618 ret
= rhashtable_walk_start(&iter
);
619 if (ret
&& ret
!= -EAGAIN
)
622 while ((mpath
= rhashtable_walk_next(&iter
))) {
623 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
628 if (ether_addr_equal(mpath
->mpp
, proxy
))
629 __mesh_path_del(tbl
, mpath
);
632 rhashtable_walk_stop(&iter
);
633 rhashtable_walk_exit(&iter
);
636 static void table_flush_by_iface(struct mesh_table
*tbl
)
638 struct mesh_path
*mpath
;
639 struct rhashtable_iter iter
;
642 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_ATOMIC
);
646 ret
= rhashtable_walk_start(&iter
);
647 if (ret
&& ret
!= -EAGAIN
)
650 while ((mpath
= rhashtable_walk_next(&iter
))) {
651 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
655 __mesh_path_del(tbl
, mpath
);
658 rhashtable_walk_stop(&iter
);
659 rhashtable_walk_exit(&iter
);
663 * mesh_path_flush_by_iface - Deletes all mesh paths associated with a given iface
665 * This function deletes both mesh paths as well as mesh portal paths.
667 * @sdata: interface data to match
670 void mesh_path_flush_by_iface(struct ieee80211_sub_if_data
*sdata
)
672 table_flush_by_iface(sdata
->u
.mesh
.mesh_paths
);
673 table_flush_by_iface(sdata
->u
.mesh
.mpp_paths
);
677 * table_path_del - delete a path from the mesh or mpp table
679 * @tbl: mesh or mpp path table
680 * @sdata: local subif
681 * @addr: dst address (ETH_ALEN length)
683 * Returns: 0 if successful
685 static int table_path_del(struct mesh_table
*tbl
,
686 struct ieee80211_sub_if_data
*sdata
,
689 struct mesh_path
*mpath
;
692 mpath
= rhashtable_lookup_fast(&tbl
->rhead
, addr
, mesh_rht_params
);
698 __mesh_path_del(tbl
, mpath
);
705 * mesh_path_del - delete a mesh path from the table
707 * @addr: dst address (ETH_ALEN length)
708 * @sdata: local subif
710 * Returns: 0 if successful
712 int mesh_path_del(struct ieee80211_sub_if_data
*sdata
, const u8
*addr
)
716 /* flush relevant mpp entries first */
717 mpp_flush_by_proxy(sdata
, addr
);
719 err
= table_path_del(sdata
->u
.mesh
.mesh_paths
, sdata
, addr
);
720 sdata
->u
.mesh
.mesh_paths_generation
++;
725 * mesh_path_tx_pending - sends pending frames in a mesh path queue
727 * @mpath: mesh path to activate
729 * Locking: the state_lock of the mpath structure must NOT be held when calling
732 void mesh_path_tx_pending(struct mesh_path
*mpath
)
734 if (mpath
->flags
& MESH_PATH_ACTIVE
)
735 ieee80211_add_pending_skbs(mpath
->sdata
->local
,
736 &mpath
->frame_queue
);
740 * mesh_path_send_to_gates - sends pending frames to all known mesh gates
742 * @mpath: mesh path whose queue will be emptied
744 * If there is only one gate, the frames are transferred from the failed mpath
745 * queue to that gate's queue. If there are more than one gates, the frames
746 * are copied from each gate to the next. After frames are copied, the
747 * mpath queues are emptied onto the transmission queue.
749 int mesh_path_send_to_gates(struct mesh_path
*mpath
)
751 struct ieee80211_sub_if_data
*sdata
= mpath
->sdata
;
752 struct mesh_table
*tbl
;
753 struct mesh_path
*from_mpath
= mpath
;
754 struct mesh_path
*gate
;
757 tbl
= sdata
->u
.mesh
.mesh_paths
;
760 hlist_for_each_entry_rcu(gate
, &tbl
->known_gates
, gate_list
) {
761 if (gate
->flags
& MESH_PATH_ACTIVE
) {
762 mpath_dbg(sdata
, "Forwarding to %pM\n", gate
->dst
);
763 mesh_path_move_to_queue(gate
, from_mpath
, copy
);
768 "Not forwarding to %pM (flags %#x)\n",
769 gate
->dst
, gate
->flags
);
773 hlist_for_each_entry_rcu(gate
, &tbl
->known_gates
, gate_list
) {
774 mpath_dbg(sdata
, "Sending to %pM\n", gate
->dst
);
775 mesh_path_tx_pending(gate
);
779 return (from_mpath
== mpath
) ? -EHOSTUNREACH
: 0;
783 * mesh_path_discard_frame - discard a frame whose path could not be resolved
785 * @skb: frame to discard
786 * @sdata: network subif the frame was to be sent through
788 * Locking: the function must me called within a rcu_read_lock region
790 void mesh_path_discard_frame(struct ieee80211_sub_if_data
*sdata
,
794 sdata
->u
.mesh
.mshstats
.dropped_frames_no_route
++;
798 * mesh_path_flush_pending - free the pending queue of a mesh path
800 * @mpath: mesh path whose queue has to be freed
802 * Locking: the function must me called within a rcu_read_lock region
804 void mesh_path_flush_pending(struct mesh_path
*mpath
)
808 while ((skb
= skb_dequeue(&mpath
->frame_queue
)) != NULL
)
809 mesh_path_discard_frame(mpath
->sdata
, skb
);
813 * mesh_path_fix_nexthop - force a specific next hop for a mesh path
815 * @mpath: the mesh path to modify
816 * @next_hop: the next hop to force
818 * Locking: this function must be called holding mpath->state_lock
820 void mesh_path_fix_nexthop(struct mesh_path
*mpath
, struct sta_info
*next_hop
)
822 spin_lock_bh(&mpath
->state_lock
);
823 mesh_path_assign_nexthop(mpath
, next_hop
);
826 mpath
->hop_count
= 0;
828 mpath
->flags
= MESH_PATH_FIXED
| MESH_PATH_SN_VALID
;
829 mesh_path_activate(mpath
);
830 spin_unlock_bh(&mpath
->state_lock
);
831 ewma_mesh_fail_avg_init(&next_hop
->mesh
->fail_avg
);
832 /* init it at a low value - 0 start is tricky */
833 ewma_mesh_fail_avg_add(&next_hop
->mesh
->fail_avg
, 1);
834 mesh_path_tx_pending(mpath
);
837 int mesh_pathtbl_init(struct ieee80211_sub_if_data
*sdata
)
839 struct mesh_table
*tbl_path
, *tbl_mpp
;
842 tbl_path
= mesh_table_alloc();
846 tbl_mpp
= mesh_table_alloc();
852 rhashtable_init(&tbl_path
->rhead
, &mesh_rht_params
);
853 rhashtable_init(&tbl_mpp
->rhead
, &mesh_rht_params
);
855 sdata
->u
.mesh
.mesh_paths
= tbl_path
;
856 sdata
->u
.mesh
.mpp_paths
= tbl_mpp
;
861 mesh_table_free(tbl_path
);
866 void mesh_path_tbl_expire(struct ieee80211_sub_if_data
*sdata
,
867 struct mesh_table
*tbl
)
869 struct mesh_path
*mpath
;
870 struct rhashtable_iter iter
;
873 ret
= rhashtable_walk_init(&tbl
->rhead
, &iter
, GFP_KERNEL
);
877 ret
= rhashtable_walk_start(&iter
);
878 if (ret
&& ret
!= -EAGAIN
)
881 while ((mpath
= rhashtable_walk_next(&iter
))) {
882 if (IS_ERR(mpath
) && PTR_ERR(mpath
) == -EAGAIN
)
886 if ((!(mpath
->flags
& MESH_PATH_RESOLVING
)) &&
887 (!(mpath
->flags
& MESH_PATH_FIXED
)) &&
888 time_after(jiffies
, mpath
->exp_time
+ MESH_PATH_EXPIRE
))
889 __mesh_path_del(tbl
, mpath
);
892 rhashtable_walk_stop(&iter
);
893 rhashtable_walk_exit(&iter
);
896 void mesh_path_expire(struct ieee80211_sub_if_data
*sdata
)
898 mesh_path_tbl_expire(sdata
, sdata
->u
.mesh
.mesh_paths
);
899 mesh_path_tbl_expire(sdata
, sdata
->u
.mesh
.mpp_paths
);
902 void mesh_pathtbl_unregister(struct ieee80211_sub_if_data
*sdata
)
904 mesh_table_free(sdata
->u
.mesh
.mesh_paths
);
905 mesh_table_free(sdata
->u
.mesh
.mpp_paths
);