Commit | Line | Data |
---|---|---|
eb2b9311 | 1 | /* |
264d9b7d | 2 | * Copyright (c) 2008, 2009 open80211s Ltd. |
eb2b9311 LCC |
3 | * Author: Luis Carlos Cobo <luisca@cozybit.com> |
4 | * | |
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. | |
8 | */ | |
9 | ||
10 | #include <linux/etherdevice.h> | |
11 | #include <linux/list.h> | |
eb2b9311 | 12 | #include <linux/random.h> |
5a0e3ad6 | 13 | #include <linux/slab.h> |
eb2b9311 LCC |
14 | #include <linux/spinlock.h> |
15 | #include <linux/string.h> | |
16 | #include <net/mac80211.h> | |
4777be41 | 17 | #include "wme.h" |
eb2b9311 LCC |
18 | #include "ieee80211_i.h" |
19 | #include "mesh.h" | |
20 | ||
7646887a JC |
21 | #ifdef CONFIG_MAC80211_VERBOSE_MPATH_DEBUG |
22 | #define mpath_dbg(fmt, args...) printk(KERN_DEBUG fmt, ##args) | |
23 | #else | |
24 | #define mpath_dbg(fmt, args...) do { (void)(0); } while (0) | |
25 | #endif | |
26 | ||
eb2b9311 LCC |
27 | /* There will be initially 2^INIT_PATHS_SIZE_ORDER buckets */ |
28 | #define INIT_PATHS_SIZE_ORDER 2 | |
29 | ||
30 | /* Keep the mean chain length below this constant */ | |
31 | #define MEAN_CHAIN_LEN 2 | |
32 | ||
33 | #define MPATH_EXPIRED(mpath) ((mpath->flags & MESH_PATH_ACTIVE) && \ | |
34 | time_after(jiffies, mpath->exp_time) && \ | |
35 | !(mpath->flags & MESH_PATH_FIXED)) | |
36 | ||
37 | struct mpath_node { | |
38 | struct hlist_node list; | |
39 | struct rcu_head rcu; | |
40 | /* This indirection allows two different tables to point to the same | |
41 | * mesh_path structure, useful when resizing | |
42 | */ | |
43 | struct mesh_path *mpath; | |
44 | }; | |
45 | ||
349eb8cf JB |
46 | static struct mesh_table __rcu *mesh_paths; |
47 | static struct mesh_table __rcu *mpp_paths; /* Store paths for MPP&MAP */ | |
eb2b9311 | 48 | |
f5ea9120 | 49 | int mesh_paths_generation; |
6b86bd62 JB |
50 | |
51 | /* This lock will have the grow table function as writer and add / delete nodes | |
239289e4 JC |
52 | * as readers. RCU provides sufficient protection only when reading the table |
53 | * (i.e. doing lookups). Adding or adding or removing nodes requires we take | |
54 | * the read lock or we risk operating on an old table. The write lock is only | |
55 | * needed when modifying the number of buckets a table. | |
6b86bd62 JB |
56 | */ |
57 | static DEFINE_RWLOCK(pathtbl_resize_lock); | |
58 | ||
59 | ||
349eb8cf JB |
60 | static inline struct mesh_table *resize_dereference_mesh_paths(void) |
61 | { | |
62 | return rcu_dereference_protected(mesh_paths, | |
63 | lockdep_is_held(&pathtbl_resize_lock)); | |
64 | } | |
65 | ||
66 | static inline struct mesh_table *resize_dereference_mpp_paths(void) | |
67 | { | |
68 | return rcu_dereference_protected(mpp_paths, | |
69 | lockdep_is_held(&pathtbl_resize_lock)); | |
70 | } | |
71 | ||
72 | /* | |
73 | * CAREFUL -- "tbl" must not be an expression, | |
74 | * in particular not an rcu_dereference(), since | |
75 | * it's used twice. So it is illegal to do | |
76 | * for_each_mesh_entry(rcu_dereference(...), ...) | |
77 | */ | |
78 | #define for_each_mesh_entry(tbl, p, node, i) \ | |
79 | for (i = 0; i <= tbl->hash_mask; i++) \ | |
80 | hlist_for_each_entry_rcu(node, p, &tbl->hash_buckets[i], list) | |
81 | ||
82 | ||
6b86bd62 JB |
83 | static struct mesh_table *mesh_table_alloc(int size_order) |
84 | { | |
85 | int i; | |
86 | struct mesh_table *newtbl; | |
87 | ||
d676ff49 | 88 | newtbl = kmalloc(sizeof(struct mesh_table), GFP_ATOMIC); |
6b86bd62 JB |
89 | if (!newtbl) |
90 | return NULL; | |
91 | ||
92 | newtbl->hash_buckets = kzalloc(sizeof(struct hlist_head) * | |
d676ff49 | 93 | (1 << size_order), GFP_ATOMIC); |
6b86bd62 JB |
94 | |
95 | if (!newtbl->hash_buckets) { | |
96 | kfree(newtbl); | |
97 | return NULL; | |
98 | } | |
99 | ||
100 | newtbl->hashwlock = kmalloc(sizeof(spinlock_t) * | |
d676ff49 | 101 | (1 << size_order), GFP_ATOMIC); |
6b86bd62 JB |
102 | if (!newtbl->hashwlock) { |
103 | kfree(newtbl->hash_buckets); | |
104 | kfree(newtbl); | |
105 | return NULL; | |
106 | } | |
107 | ||
108 | newtbl->size_order = size_order; | |
109 | newtbl->hash_mask = (1 << size_order) - 1; | |
110 | atomic_set(&newtbl->entries, 0); | |
111 | get_random_bytes(&newtbl->hash_rnd, | |
112 | sizeof(newtbl->hash_rnd)); | |
113 | for (i = 0; i <= newtbl->hash_mask; i++) | |
114 | spin_lock_init(&newtbl->hashwlock[i]); | |
5ee68e5b | 115 | spin_lock_init(&newtbl->gates_lock); |
6b86bd62 JB |
116 | |
117 | return newtbl; | |
118 | } | |
119 | ||
18889231 JC |
120 | static void __mesh_table_free(struct mesh_table *tbl) |
121 | { | |
122 | kfree(tbl->hash_buckets); | |
123 | kfree(tbl->hashwlock); | |
124 | kfree(tbl); | |
125 | } | |
126 | ||
6b86bd62 | 127 | static void mesh_table_free(struct mesh_table *tbl, bool free_leafs) |
18889231 JC |
128 | { |
129 | struct hlist_head *mesh_hash; | |
130 | struct hlist_node *p, *q; | |
5ee68e5b | 131 | struct mpath_node *gate; |
18889231 JC |
132 | int i; |
133 | ||
134 | mesh_hash = tbl->hash_buckets; | |
135 | for (i = 0; i <= tbl->hash_mask; i++) { | |
9b84b808 | 136 | spin_lock_bh(&tbl->hashwlock[i]); |
18889231 JC |
137 | hlist_for_each_safe(p, q, &mesh_hash[i]) { |
138 | tbl->free_node(p, free_leafs); | |
139 | atomic_dec(&tbl->entries); | |
140 | } | |
9b84b808 | 141 | spin_unlock_bh(&tbl->hashwlock[i]); |
18889231 | 142 | } |
5ee68e5b JC |
143 | if (free_leafs) { |
144 | spin_lock_bh(&tbl->gates_lock); | |
145 | hlist_for_each_entry_safe(gate, p, q, | |
146 | tbl->known_gates, list) { | |
147 | hlist_del(&gate->list); | |
148 | kfree(gate); | |
149 | } | |
150 | kfree(tbl->known_gates); | |
151 | spin_unlock_bh(&tbl->gates_lock); | |
152 | } | |
153 | ||
18889231 JC |
154 | __mesh_table_free(tbl); |
155 | } | |
156 | ||
a3e6b12c | 157 | static int mesh_table_grow(struct mesh_table *oldtbl, |
6b86bd62 | 158 | struct mesh_table *newtbl) |
18889231 | 159 | { |
18889231 JC |
160 | struct hlist_head *oldhash; |
161 | struct hlist_node *p, *q; | |
162 | int i; | |
163 | ||
a3e6b12c I |
164 | if (atomic_read(&oldtbl->entries) |
165 | < oldtbl->mean_chain_len * (oldtbl->hash_mask + 1)) | |
166 | return -EAGAIN; | |
18889231 | 167 | |
a3e6b12c I |
168 | newtbl->free_node = oldtbl->free_node; |
169 | newtbl->mean_chain_len = oldtbl->mean_chain_len; | |
170 | newtbl->copy_node = oldtbl->copy_node; | |
5ee68e5b | 171 | newtbl->known_gates = oldtbl->known_gates; |
a3e6b12c | 172 | atomic_set(&newtbl->entries, atomic_read(&oldtbl->entries)); |
18889231 | 173 | |
a3e6b12c I |
174 | oldhash = oldtbl->hash_buckets; |
175 | for (i = 0; i <= oldtbl->hash_mask; i++) | |
18889231 | 176 | hlist_for_each(p, &oldhash[i]) |
a3e6b12c | 177 | if (oldtbl->copy_node(p, newtbl) < 0) |
18889231 JC |
178 | goto errcopy; |
179 | ||
a3e6b12c | 180 | return 0; |
18889231 JC |
181 | |
182 | errcopy: | |
183 | for (i = 0; i <= newtbl->hash_mask; i++) { | |
184 | hlist_for_each_safe(p, q, &newtbl->hash_buckets[i]) | |
a3e6b12c | 185 | oldtbl->free_node(p, 0); |
18889231 | 186 | } |
a3e6b12c | 187 | return -ENOMEM; |
18889231 JC |
188 | } |
189 | ||
6b86bd62 JB |
190 | static u32 mesh_table_hash(u8 *addr, struct ieee80211_sub_if_data *sdata, |
191 | struct mesh_table *tbl) | |
192 | { | |
193 | /* Use last four bytes of hw addr and interface index as hash index */ | |
194 | return jhash_2words(*(u32 *)(addr+2), sdata->dev->ifindex, tbl->hash_rnd) | |
195 | & tbl->hash_mask; | |
196 | } | |
f5ea9120 | 197 | |
eb2b9311 LCC |
198 | |
199 | /** | |
200 | * | |
201 | * mesh_path_assign_nexthop - update mesh path next hop | |
202 | * | |
203 | * @mpath: mesh path to update | |
204 | * @sta: next hop to assign | |
205 | * | |
206 | * Locking: mpath->state_lock must be held when calling this function | |
207 | */ | |
208 | void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta) | |
209 | { | |
10c836d7 JC |
210 | struct sk_buff *skb; |
211 | struct ieee80211_hdr *hdr; | |
212 | struct sk_buff_head tmpq; | |
213 | unsigned long flags; | |
214 | ||
d0709a65 | 215 | rcu_assign_pointer(mpath->next_hop, sta); |
10c836d7 JC |
216 | |
217 | __skb_queue_head_init(&tmpq); | |
218 | ||
219 | spin_lock_irqsave(&mpath->frame_queue.lock, flags); | |
220 | ||
221 | while ((skb = __skb_dequeue(&mpath->frame_queue)) != NULL) { | |
222 | hdr = (struct ieee80211_hdr *) skb->data; | |
223 | memcpy(hdr->addr1, sta->sta.addr, ETH_ALEN); | |
7e3c8866 | 224 | memcpy(hdr->addr2, mpath->sdata->vif.addr, ETH_ALEN); |
10c836d7 JC |
225 | __skb_queue_tail(&tmpq, skb); |
226 | } | |
227 | ||
228 | skb_queue_splice(&tmpq, &mpath->frame_queue); | |
229 | spin_unlock_irqrestore(&mpath->frame_queue.lock, flags); | |
eb2b9311 LCC |
230 | } |
231 | ||
5ee68e5b JC |
232 | static void prepare_for_gate(struct sk_buff *skb, char *dst_addr, |
233 | struct mesh_path *gate_mpath) | |
234 | { | |
235 | struct ieee80211_hdr *hdr; | |
236 | struct ieee80211s_hdr *mshdr; | |
237 | int mesh_hdrlen, hdrlen; | |
238 | char *next_hop; | |
239 | ||
240 | hdr = (struct ieee80211_hdr *) skb->data; | |
241 | hdrlen = ieee80211_hdrlen(hdr->frame_control); | |
242 | mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen); | |
243 | ||
244 | if (!(mshdr->flags & MESH_FLAGS_AE)) { | |
245 | /* size of the fixed part of the mesh header */ | |
246 | mesh_hdrlen = 6; | |
247 | ||
248 | /* make room for the two extended addresses */ | |
249 | skb_push(skb, 2 * ETH_ALEN); | |
250 | memmove(skb->data, hdr, hdrlen + mesh_hdrlen); | |
251 | ||
252 | hdr = (struct ieee80211_hdr *) skb->data; | |
253 | ||
254 | /* we preserve the previous mesh header and only add | |
255 | * the new addreses */ | |
256 | mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen); | |
257 | mshdr->flags = MESH_FLAGS_AE_A5_A6; | |
258 | memcpy(mshdr->eaddr1, hdr->addr3, ETH_ALEN); | |
259 | memcpy(mshdr->eaddr2, hdr->addr4, ETH_ALEN); | |
260 | } | |
261 | ||
262 | /* update next hop */ | |
263 | hdr = (struct ieee80211_hdr *) skb->data; | |
264 | rcu_read_lock(); | |
265 | next_hop = rcu_dereference(gate_mpath->next_hop)->sta.addr; | |
266 | memcpy(hdr->addr1, next_hop, ETH_ALEN); | |
267 | rcu_read_unlock(); | |
7e3c8866 | 268 | memcpy(hdr->addr2, gate_mpath->sdata->vif.addr, ETH_ALEN); |
5ee68e5b JC |
269 | memcpy(hdr->addr3, dst_addr, ETH_ALEN); |
270 | } | |
271 | ||
272 | /** | |
273 | * | |
274 | * mesh_path_move_to_queue - Move or copy frames from one mpath queue to another | |
275 | * | |
276 | * This function is used to transfer or copy frames from an unresolved mpath to | |
277 | * a gate mpath. The function also adds the Address Extension field and | |
278 | * updates the next hop. | |
279 | * | |
280 | * If a frame already has an Address Extension field, only the next hop and | |
281 | * destination addresses are updated. | |
282 | * | |
283 | * The gate mpath must be an active mpath with a valid mpath->next_hop. | |
284 | * | |
285 | * @mpath: An active mpath the frames will be sent to (i.e. the gate) | |
286 | * @from_mpath: The failed mpath | |
287 | * @copy: When true, copy all the frames to the new mpath queue. When false, | |
288 | * move them. | |
289 | */ | |
290 | static void mesh_path_move_to_queue(struct mesh_path *gate_mpath, | |
291 | struct mesh_path *from_mpath, | |
292 | bool copy) | |
293 | { | |
c6133661 | 294 | struct sk_buff *skb, *cp_skb = NULL; |
5ee68e5b JC |
295 | struct sk_buff_head gateq, failq; |
296 | unsigned long flags; | |
297 | int num_skbs; | |
298 | ||
299 | BUG_ON(gate_mpath == from_mpath); | |
300 | BUG_ON(!gate_mpath->next_hop); | |
301 | ||
302 | __skb_queue_head_init(&gateq); | |
303 | __skb_queue_head_init(&failq); | |
304 | ||
305 | spin_lock_irqsave(&from_mpath->frame_queue.lock, flags); | |
306 | skb_queue_splice_init(&from_mpath->frame_queue, &failq); | |
307 | spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags); | |
308 | ||
309 | num_skbs = skb_queue_len(&failq); | |
310 | ||
311 | while (num_skbs--) { | |
312 | skb = __skb_dequeue(&failq); | |
817a53d9 | 313 | if (copy) { |
5ee68e5b | 314 | cp_skb = skb_copy(skb, GFP_ATOMIC); |
817a53d9 JL |
315 | if (cp_skb) |
316 | __skb_queue_tail(&failq, cp_skb); | |
317 | } | |
5ee68e5b JC |
318 | |
319 | prepare_for_gate(skb, gate_mpath->dst, gate_mpath); | |
320 | __skb_queue_tail(&gateq, skb); | |
5ee68e5b JC |
321 | } |
322 | ||
323 | spin_lock_irqsave(&gate_mpath->frame_queue.lock, flags); | |
324 | skb_queue_splice(&gateq, &gate_mpath->frame_queue); | |
325 | mpath_dbg("Mpath queue for gate %pM has %d frames\n", | |
326 | gate_mpath->dst, | |
327 | skb_queue_len(&gate_mpath->frame_queue)); | |
328 | spin_unlock_irqrestore(&gate_mpath->frame_queue.lock, flags); | |
329 | ||
330 | if (!copy) | |
331 | return; | |
332 | ||
333 | spin_lock_irqsave(&from_mpath->frame_queue.lock, flags); | |
334 | skb_queue_splice(&failq, &from_mpath->frame_queue); | |
335 | spin_unlock_irqrestore(&from_mpath->frame_queue.lock, flags); | |
336 | } | |
337 | ||
eb2b9311 | 338 | |
239289e4 JC |
339 | static struct mesh_path *path_lookup(struct mesh_table *tbl, u8 *dst, |
340 | struct ieee80211_sub_if_data *sdata) | |
eb2b9311 LCC |
341 | { |
342 | struct mesh_path *mpath; | |
343 | struct hlist_node *n; | |
344 | struct hlist_head *bucket; | |
eb2b9311 LCC |
345 | struct mpath_node *node; |
346 | ||
f698d856 | 347 | bucket = &tbl->hash_buckets[mesh_table_hash(dst, sdata, tbl)]; |
eb2b9311 LCC |
348 | hlist_for_each_entry_rcu(node, n, bucket, list) { |
349 | mpath = node->mpath; | |
f698d856 | 350 | if (mpath->sdata == sdata && |
eb2b9311 LCC |
351 | memcmp(dst, mpath->dst, ETH_ALEN) == 0) { |
352 | if (MPATH_EXPIRED(mpath)) { | |
353 | spin_lock_bh(&mpath->state_lock); | |
ad99d141 | 354 | mpath->flags &= ~MESH_PATH_ACTIVE; |
eb2b9311 LCC |
355 | spin_unlock_bh(&mpath->state_lock); |
356 | } | |
357 | return mpath; | |
358 | } | |
359 | } | |
360 | return NULL; | |
361 | } | |
362 | ||
239289e4 JC |
363 | /** |
364 | * mesh_path_lookup - look up a path in the mesh path table | |
365 | * @dst: hardware address (ETH_ALEN length) of destination | |
366 | * @sdata: local subif | |
367 | * | |
368 | * Returns: pointer to the mesh path structure, or NULL if not found | |
369 | * | |
370 | * Locking: must be called within a read rcu section. | |
371 | */ | |
372 | struct mesh_path *mesh_path_lookup(u8 *dst, struct ieee80211_sub_if_data *sdata) | |
79617dee | 373 | { |
239289e4 JC |
374 | return path_lookup(rcu_dereference(mesh_paths), dst, sdata); |
375 | } | |
79617dee | 376 | |
239289e4 JC |
377 | struct mesh_path *mpp_path_lookup(u8 *dst, struct ieee80211_sub_if_data *sdata) |
378 | { | |
379 | return path_lookup(rcu_dereference(mpp_paths), dst, sdata); | |
79617dee Y |
380 | } |
381 | ||
382 | ||
eb2b9311 LCC |
383 | /** |
384 | * mesh_path_lookup_by_idx - look up a path in the mesh path table by its index | |
385 | * @idx: index | |
f698d856 | 386 | * @sdata: local subif, or NULL for all entries |
eb2b9311 LCC |
387 | * |
388 | * Returns: pointer to the mesh path structure, or NULL if not found. | |
389 | * | |
390 | * Locking: must be called within a read rcu section. | |
391 | */ | |
f698d856 | 392 | struct mesh_path *mesh_path_lookup_by_idx(int idx, struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 393 | { |
349eb8cf | 394 | struct mesh_table *tbl = rcu_dereference(mesh_paths); |
eb2b9311 LCC |
395 | struct mpath_node *node; |
396 | struct hlist_node *p; | |
397 | int i; | |
398 | int j = 0; | |
399 | ||
349eb8cf | 400 | for_each_mesh_entry(tbl, p, node, i) { |
f698d856 | 401 | if (sdata && node->mpath->sdata != sdata) |
2a8ca29a | 402 | continue; |
eb2b9311 LCC |
403 | if (j++ == idx) { |
404 | if (MPATH_EXPIRED(node->mpath)) { | |
405 | spin_lock_bh(&node->mpath->state_lock); | |
ad99d141 | 406 | node->mpath->flags &= ~MESH_PATH_ACTIVE; |
eb2b9311 LCC |
407 | spin_unlock_bh(&node->mpath->state_lock); |
408 | } | |
409 | return node->mpath; | |
410 | } | |
2a8ca29a | 411 | } |
eb2b9311 LCC |
412 | |
413 | return NULL; | |
414 | } | |
415 | ||
5ee68e5b | 416 | /** |
30be52e4 JB |
417 | * mesh_path_add_gate - add the given mpath to a mesh gate to our path table |
418 | * @mpath: gate path to add to table | |
5ee68e5b | 419 | */ |
30be52e4 | 420 | int mesh_path_add_gate(struct mesh_path *mpath) |
5ee68e5b | 421 | { |
30be52e4 | 422 | struct mesh_table *tbl; |
5ee68e5b JC |
423 | struct mpath_node *gate, *new_gate; |
424 | struct hlist_node *n; | |
425 | int err; | |
426 | ||
427 | rcu_read_lock(); | |
30be52e4 | 428 | tbl = rcu_dereference(mesh_paths); |
5ee68e5b JC |
429 | |
430 | hlist_for_each_entry_rcu(gate, n, tbl->known_gates, list) | |
431 | if (gate->mpath == mpath) { | |
432 | err = -EEXIST; | |
433 | goto err_rcu; | |
434 | } | |
435 | ||
436 | new_gate = kzalloc(sizeof(struct mpath_node), GFP_ATOMIC); | |
437 | if (!new_gate) { | |
438 | err = -ENOMEM; | |
439 | goto err_rcu; | |
440 | } | |
441 | ||
442 | mpath->is_gate = true; | |
443 | mpath->sdata->u.mesh.num_gates++; | |
444 | new_gate->mpath = mpath; | |
445 | spin_lock_bh(&tbl->gates_lock); | |
446 | hlist_add_head_rcu(&new_gate->list, tbl->known_gates); | |
447 | spin_unlock_bh(&tbl->gates_lock); | |
448 | rcu_read_unlock(); | |
449 | mpath_dbg("Mesh path (%s): Recorded new gate: %pM. %d known gates\n", | |
450 | mpath->sdata->name, mpath->dst, | |
451 | mpath->sdata->u.mesh.num_gates); | |
452 | return 0; | |
453 | err_rcu: | |
454 | rcu_read_unlock(); | |
455 | return err; | |
456 | } | |
457 | ||
458 | /** | |
459 | * mesh_gate_del - remove a mesh gate from the list of known gates | |
460 | * @tbl: table which holds our list of known gates | |
461 | * @mpath: gate mpath | |
462 | * | |
463 | * Returns: 0 on success | |
464 | * | |
465 | * Locking: must be called inside rcu_read_lock() section | |
466 | */ | |
467 | static int mesh_gate_del(struct mesh_table *tbl, struct mesh_path *mpath) | |
468 | { | |
469 | struct mpath_node *gate; | |
470 | struct hlist_node *p, *q; | |
471 | ||
5ee68e5b JC |
472 | hlist_for_each_entry_safe(gate, p, q, tbl->known_gates, list) |
473 | if (gate->mpath == mpath) { | |
474 | spin_lock_bh(&tbl->gates_lock); | |
475 | hlist_del_rcu(&gate->list); | |
ae1f18e4 | 476 | kfree_rcu(gate, rcu); |
5ee68e5b JC |
477 | spin_unlock_bh(&tbl->gates_lock); |
478 | mpath->sdata->u.mesh.num_gates--; | |
479 | mpath->is_gate = false; | |
480 | mpath_dbg("Mesh path (%s): Deleted gate: %pM. " | |
481 | "%d known gates\n", mpath->sdata->name, | |
482 | mpath->dst, mpath->sdata->u.mesh.num_gates); | |
483 | break; | |
484 | } | |
485 | ||
486 | return 0; | |
487 | } | |
488 | ||
5ee68e5b JC |
489 | /** |
490 | * mesh_gate_num - number of gates known to this interface | |
491 | * @sdata: subif data | |
492 | */ | |
493 | int mesh_gate_num(struct ieee80211_sub_if_data *sdata) | |
494 | { | |
495 | return sdata->u.mesh.num_gates; | |
496 | } | |
497 | ||
eb2b9311 LCC |
498 | /** |
499 | * mesh_path_add - allocate and add a new path to the mesh path table | |
500 | * @addr: destination address of the path (ETH_ALEN length) | |
f698d856 | 501 | * @sdata: local subif |
eb2b9311 | 502 | * |
af901ca1 | 503 | * Returns: 0 on success |
eb2b9311 LCC |
504 | * |
505 | * State: the initial state of the new path is set to 0 | |
506 | */ | |
f698d856 | 507 | int mesh_path_add(u8 *dst, struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 508 | { |
18889231 JC |
509 | struct ieee80211_if_mesh *ifmsh = &sdata->u.mesh; |
510 | struct ieee80211_local *local = sdata->local; | |
349eb8cf | 511 | struct mesh_table *tbl; |
eb2b9311 LCC |
512 | struct mesh_path *mpath, *new_mpath; |
513 | struct mpath_node *node, *new_node; | |
514 | struct hlist_head *bucket; | |
515 | struct hlist_node *n; | |
516 | int grow = 0; | |
517 | int err = 0; | |
518 | u32 hash_idx; | |
519 | ||
47846c9b | 520 | if (memcmp(dst, sdata->vif.addr, ETH_ALEN) == 0) |
eb2b9311 LCC |
521 | /* never add ourselves as neighbours */ |
522 | return -ENOTSUPP; | |
523 | ||
524 | if (is_multicast_ether_addr(dst)) | |
525 | return -ENOTSUPP; | |
526 | ||
472dbc45 | 527 | if (atomic_add_unless(&sdata->u.mesh.mpaths, 1, MESH_MAX_MPATHS) == 0) |
eb2b9311 LCC |
528 | return -ENOSPC; |
529 | ||
402d7752 | 530 | err = -ENOMEM; |
18889231 | 531 | new_mpath = kzalloc(sizeof(struct mesh_path), GFP_ATOMIC); |
402d7752 PE |
532 | if (!new_mpath) |
533 | goto err_path_alloc; | |
534 | ||
18889231 | 535 | new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC); |
402d7752 PE |
536 | if (!new_node) |
537 | goto err_node_alloc; | |
f84e71a9 | 538 | |
9b84b808 | 539 | read_lock_bh(&pathtbl_resize_lock); |
eb2b9311 | 540 | memcpy(new_mpath->dst, dst, ETH_ALEN); |
f698d856 | 541 | new_mpath->sdata = sdata; |
eb2b9311 LCC |
542 | new_mpath->flags = 0; |
543 | skb_queue_head_init(&new_mpath->frame_queue); | |
eb2b9311 LCC |
544 | new_node->mpath = new_mpath; |
545 | new_mpath->timer.data = (unsigned long) new_mpath; | |
546 | new_mpath->timer.function = mesh_path_timer; | |
547 | new_mpath->exp_time = jiffies; | |
548 | spin_lock_init(&new_mpath->state_lock); | |
549 | init_timer(&new_mpath->timer); | |
550 | ||
349eb8cf | 551 | tbl = resize_dereference_mesh_paths(); |
eb2b9311 | 552 | |
349eb8cf JB |
553 | hash_idx = mesh_table_hash(dst, sdata, tbl); |
554 | bucket = &tbl->hash_buckets[hash_idx]; | |
eb2b9311 | 555 | |
349eb8cf | 556 | spin_lock_bh(&tbl->hashwlock[hash_idx]); |
eb2b9311 | 557 | |
402d7752 | 558 | err = -EEXIST; |
eb2b9311 LCC |
559 | hlist_for_each_entry(node, n, bucket, list) { |
560 | mpath = node->mpath; | |
f698d856 | 561 | if (mpath->sdata == sdata && memcmp(dst, mpath->dst, ETH_ALEN) == 0) |
402d7752 | 562 | goto err_exists; |
eb2b9311 LCC |
563 | } |
564 | ||
565 | hlist_add_head_rcu(&new_node->list, bucket); | |
349eb8cf JB |
566 | if (atomic_inc_return(&tbl->entries) >= |
567 | tbl->mean_chain_len * (tbl->hash_mask + 1)) | |
eb2b9311 LCC |
568 | grow = 1; |
569 | ||
f5ea9120 JB |
570 | mesh_paths_generation++; |
571 | ||
349eb8cf | 572 | spin_unlock_bh(&tbl->hashwlock[hash_idx]); |
9b84b808 | 573 | read_unlock_bh(&pathtbl_resize_lock); |
402d7752 | 574 | if (grow) { |
18889231 | 575 | set_bit(MESH_WORK_GROW_MPATH_TABLE, &ifmsh->wrkq_flags); |
64592c8f | 576 | ieee80211_queue_work(&local->hw, &sdata->work); |
eb2b9311 | 577 | } |
402d7752 PE |
578 | return 0; |
579 | ||
580 | err_exists: | |
349eb8cf | 581 | spin_unlock_bh(&tbl->hashwlock[hash_idx]); |
9b84b808 | 582 | read_unlock_bh(&pathtbl_resize_lock); |
402d7752 PE |
583 | kfree(new_node); |
584 | err_node_alloc: | |
585 | kfree(new_mpath); | |
586 | err_path_alloc: | |
472dbc45 | 587 | atomic_dec(&sdata->u.mesh.mpaths); |
eb2b9311 LCC |
588 | return err; |
589 | } | |
590 | ||
1928ecab JB |
591 | static void mesh_table_free_rcu(struct rcu_head *rcu) |
592 | { | |
593 | struct mesh_table *tbl = container_of(rcu, struct mesh_table, rcu_head); | |
594 | ||
595 | mesh_table_free(tbl, false); | |
596 | } | |
597 | ||
18889231 JC |
598 | void mesh_mpath_table_grow(void) |
599 | { | |
600 | struct mesh_table *oldtbl, *newtbl; | |
601 | ||
9b84b808 | 602 | write_lock_bh(&pathtbl_resize_lock); |
349eb8cf JB |
603 | oldtbl = resize_dereference_mesh_paths(); |
604 | newtbl = mesh_table_alloc(oldtbl->size_order + 1); | |
1928ecab JB |
605 | if (!newtbl) |
606 | goto out; | |
349eb8cf | 607 | if (mesh_table_grow(oldtbl, newtbl) < 0) { |
a3e6b12c | 608 | __mesh_table_free(newtbl); |
1928ecab | 609 | goto out; |
18889231 JC |
610 | } |
611 | rcu_assign_pointer(mesh_paths, newtbl); | |
18889231 | 612 | |
1928ecab JB |
613 | call_rcu(&oldtbl->rcu_head, mesh_table_free_rcu); |
614 | ||
615 | out: | |
616 | write_unlock_bh(&pathtbl_resize_lock); | |
18889231 JC |
617 | } |
618 | ||
619 | void mesh_mpp_table_grow(void) | |
620 | { | |
621 | struct mesh_table *oldtbl, *newtbl; | |
622 | ||
9b84b808 | 623 | write_lock_bh(&pathtbl_resize_lock); |
349eb8cf JB |
624 | oldtbl = resize_dereference_mpp_paths(); |
625 | newtbl = mesh_table_alloc(oldtbl->size_order + 1); | |
1928ecab JB |
626 | if (!newtbl) |
627 | goto out; | |
349eb8cf | 628 | if (mesh_table_grow(oldtbl, newtbl) < 0) { |
a3e6b12c | 629 | __mesh_table_free(newtbl); |
1928ecab | 630 | goto out; |
18889231 JC |
631 | } |
632 | rcu_assign_pointer(mpp_paths, newtbl); | |
1928ecab | 633 | call_rcu(&oldtbl->rcu_head, mesh_table_free_rcu); |
18889231 | 634 | |
1928ecab JB |
635 | out: |
636 | write_unlock_bh(&pathtbl_resize_lock); | |
18889231 | 637 | } |
eb2b9311 | 638 | |
79617dee Y |
639 | int mpp_path_add(u8 *dst, u8 *mpp, struct ieee80211_sub_if_data *sdata) |
640 | { | |
18889231 JC |
641 | struct ieee80211_if_mesh *ifmsh = &sdata->u.mesh; |
642 | struct ieee80211_local *local = sdata->local; | |
349eb8cf | 643 | struct mesh_table *tbl; |
79617dee Y |
644 | struct mesh_path *mpath, *new_mpath; |
645 | struct mpath_node *node, *new_node; | |
646 | struct hlist_head *bucket; | |
647 | struct hlist_node *n; | |
648 | int grow = 0; | |
649 | int err = 0; | |
650 | u32 hash_idx; | |
651 | ||
47846c9b | 652 | if (memcmp(dst, sdata->vif.addr, ETH_ALEN) == 0) |
79617dee Y |
653 | /* never add ourselves as neighbours */ |
654 | return -ENOTSUPP; | |
655 | ||
656 | if (is_multicast_ether_addr(dst)) | |
657 | return -ENOTSUPP; | |
658 | ||
659 | err = -ENOMEM; | |
18889231 | 660 | new_mpath = kzalloc(sizeof(struct mesh_path), GFP_ATOMIC); |
79617dee Y |
661 | if (!new_mpath) |
662 | goto err_path_alloc; | |
663 | ||
18889231 | 664 | new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC); |
79617dee Y |
665 | if (!new_node) |
666 | goto err_node_alloc; | |
667 | ||
9b84b808 | 668 | read_lock_bh(&pathtbl_resize_lock); |
79617dee Y |
669 | memcpy(new_mpath->dst, dst, ETH_ALEN); |
670 | memcpy(new_mpath->mpp, mpp, ETH_ALEN); | |
671 | new_mpath->sdata = sdata; | |
672 | new_mpath->flags = 0; | |
673 | skb_queue_head_init(&new_mpath->frame_queue); | |
674 | new_node->mpath = new_mpath; | |
c6133661 | 675 | init_timer(&new_mpath->timer); |
79617dee Y |
676 | new_mpath->exp_time = jiffies; |
677 | spin_lock_init(&new_mpath->state_lock); | |
678 | ||
349eb8cf | 679 | tbl = resize_dereference_mpp_paths(); |
79617dee | 680 | |
349eb8cf JB |
681 | hash_idx = mesh_table_hash(dst, sdata, tbl); |
682 | bucket = &tbl->hash_buckets[hash_idx]; | |
683 | ||
684 | spin_lock_bh(&tbl->hashwlock[hash_idx]); | |
79617dee Y |
685 | |
686 | err = -EEXIST; | |
687 | hlist_for_each_entry(node, n, bucket, list) { | |
688 | mpath = node->mpath; | |
689 | if (mpath->sdata == sdata && memcmp(dst, mpath->dst, ETH_ALEN) == 0) | |
690 | goto err_exists; | |
691 | } | |
692 | ||
693 | hlist_add_head_rcu(&new_node->list, bucket); | |
349eb8cf JB |
694 | if (atomic_inc_return(&tbl->entries) >= |
695 | tbl->mean_chain_len * (tbl->hash_mask + 1)) | |
79617dee Y |
696 | grow = 1; |
697 | ||
349eb8cf | 698 | spin_unlock_bh(&tbl->hashwlock[hash_idx]); |
9b84b808 | 699 | read_unlock_bh(&pathtbl_resize_lock); |
79617dee | 700 | if (grow) { |
18889231 | 701 | set_bit(MESH_WORK_GROW_MPP_TABLE, &ifmsh->wrkq_flags); |
64592c8f | 702 | ieee80211_queue_work(&local->hw, &sdata->work); |
79617dee Y |
703 | } |
704 | return 0; | |
705 | ||
706 | err_exists: | |
349eb8cf | 707 | spin_unlock_bh(&tbl->hashwlock[hash_idx]); |
9b84b808 | 708 | read_unlock_bh(&pathtbl_resize_lock); |
79617dee Y |
709 | kfree(new_node); |
710 | err_node_alloc: | |
711 | kfree(new_mpath); | |
712 | err_path_alloc: | |
713 | return err; | |
714 | } | |
715 | ||
716 | ||
eb2b9311 LCC |
717 | /** |
718 | * mesh_plink_broken - deactivates paths and sends perr when a link breaks | |
719 | * | |
720 | * @sta: broken peer link | |
721 | * | |
722 | * This function must be called from the rate control algorithm if enough | |
723 | * delivery errors suggest that a peer link is no longer usable. | |
724 | */ | |
725 | void mesh_plink_broken(struct sta_info *sta) | |
726 | { | |
349eb8cf | 727 | struct mesh_table *tbl; |
15ff6365 | 728 | static const u8 bcast[ETH_ALEN] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff}; |
eb2b9311 LCC |
729 | struct mesh_path *mpath; |
730 | struct mpath_node *node; | |
731 | struct hlist_node *p; | |
f698d856 | 732 | struct ieee80211_sub_if_data *sdata = sta->sdata; |
eb2b9311 | 733 | int i; |
25d49e4d | 734 | __le16 reason = cpu_to_le16(WLAN_REASON_MESH_PATH_DEST_UNREACHABLE); |
eb2b9311 LCC |
735 | |
736 | rcu_read_lock(); | |
349eb8cf JB |
737 | tbl = rcu_dereference(mesh_paths); |
738 | for_each_mesh_entry(tbl, p, node, i) { | |
eb2b9311 | 739 | mpath = node->mpath; |
349eb8cf | 740 | if (rcu_dereference(mpath->next_hop) == sta && |
eb2b9311 LCC |
741 | mpath->flags & MESH_PATH_ACTIVE && |
742 | !(mpath->flags & MESH_PATH_FIXED)) { | |
f5e50cd0 | 743 | spin_lock_bh(&mpath->state_lock); |
eb2b9311 | 744 | mpath->flags &= ~MESH_PATH_ACTIVE; |
d19b3bf6 | 745 | ++mpath->sn; |
eb2b9311 | 746 | spin_unlock_bh(&mpath->state_lock); |
45904f21 JC |
747 | mesh_path_error_tx(sdata->u.mesh.mshcfg.element_ttl, |
748 | mpath->dst, cpu_to_le32(mpath->sn), | |
25d49e4d | 749 | reason, bcast, sdata); |
f5e50cd0 | 750 | } |
eb2b9311 LCC |
751 | } |
752 | rcu_read_unlock(); | |
753 | } | |
754 | ||
19c50b3d JC |
755 | static void mesh_path_node_reclaim(struct rcu_head *rp) |
756 | { | |
757 | struct mpath_node *node = container_of(rp, struct mpath_node, rcu); | |
758 | struct ieee80211_sub_if_data *sdata = node->mpath->sdata; | |
759 | ||
760 | del_timer_sync(&node->mpath->timer); | |
761 | atomic_dec(&sdata->u.mesh.mpaths); | |
762 | kfree(node->mpath); | |
763 | kfree(node); | |
764 | } | |
765 | ||
766 | /* needs to be called with the corresponding hashwlock taken */ | |
767 | static void __mesh_path_del(struct mesh_table *tbl, struct mpath_node *node) | |
768 | { | |
769 | struct mesh_path *mpath; | |
770 | mpath = node->mpath; | |
771 | spin_lock(&mpath->state_lock); | |
772 | mpath->flags |= MESH_PATH_RESOLVING; | |
773 | if (mpath->is_gate) | |
774 | mesh_gate_del(tbl, mpath); | |
775 | hlist_del_rcu(&node->list); | |
776 | call_rcu(&node->rcu, mesh_path_node_reclaim); | |
777 | spin_unlock(&mpath->state_lock); | |
778 | atomic_dec(&tbl->entries); | |
779 | } | |
780 | ||
eb2b9311 LCC |
781 | /** |
782 | * mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches | |
783 | * | |
784 | * @sta - mesh peer to match | |
785 | * | |
b4e08ea1 LCC |
786 | * RCU notes: this function is called when a mesh plink transitions from |
787 | * PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that | |
788 | * allows path creation. This will happen before the sta can be freed (because | |
d0709a65 JB |
789 | * sta_info_destroy() calls this) so any reader in a rcu read block will be |
790 | * protected against the plink disappearing. | |
eb2b9311 LCC |
791 | */ |
792 | void mesh_path_flush_by_nexthop(struct sta_info *sta) | |
793 | { | |
349eb8cf | 794 | struct mesh_table *tbl; |
eb2b9311 LCC |
795 | struct mesh_path *mpath; |
796 | struct mpath_node *node; | |
797 | struct hlist_node *p; | |
798 | int i; | |
799 | ||
349eb8cf | 800 | rcu_read_lock(); |
239289e4 JC |
801 | read_lock_bh(&pathtbl_resize_lock); |
802 | tbl = resize_dereference_mesh_paths(); | |
349eb8cf | 803 | for_each_mesh_entry(tbl, p, node, i) { |
eb2b9311 | 804 | mpath = node->mpath; |
cd72e817 | 805 | if (rcu_dereference(mpath->next_hop) == sta) { |
19c50b3d JC |
806 | spin_lock_bh(&tbl->hashwlock[i]); |
807 | __mesh_path_del(tbl, node); | |
808 | spin_unlock_bh(&tbl->hashwlock[i]); | |
809 | } | |
eb2b9311 | 810 | } |
239289e4 | 811 | read_unlock_bh(&pathtbl_resize_lock); |
349eb8cf | 812 | rcu_read_unlock(); |
eb2b9311 LCC |
813 | } |
814 | ||
cd72e817 JC |
815 | static void table_flush_by_iface(struct mesh_table *tbl, |
816 | struct ieee80211_sub_if_data *sdata) | |
eb2b9311 LCC |
817 | { |
818 | struct mesh_path *mpath; | |
819 | struct mpath_node *node; | |
820 | struct hlist_node *p; | |
821 | int i; | |
822 | ||
cd72e817 | 823 | WARN_ON(!rcu_read_lock_held()); |
349eb8cf | 824 | for_each_mesh_entry(tbl, p, node, i) { |
eb2b9311 | 825 | mpath = node->mpath; |
cd72e817 JC |
826 | if (mpath->sdata != sdata) |
827 | continue; | |
ece1a2e7 | 828 | spin_lock_bh(&tbl->hashwlock[i]); |
19c50b3d | 829 | __mesh_path_del(tbl, node); |
ece1a2e7 | 830 | spin_unlock_bh(&tbl->hashwlock[i]); |
eb2b9311 LCC |
831 | } |
832 | } | |
833 | ||
ece1a2e7 JC |
834 | /** |
835 | * mesh_path_flush_by_iface - Deletes all mesh paths associated with a given iface | |
836 | * | |
837 | * This function deletes both mesh paths as well as mesh portal paths. | |
838 | * | |
839 | * @sdata - interface data to match | |
840 | * | |
841 | */ | |
842 | void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata) | |
eb2b9311 | 843 | { |
cd72e817 | 844 | struct mesh_table *tbl; |
d0709a65 | 845 | |
cd72e817 | 846 | rcu_read_lock(); |
239289e4 JC |
847 | read_lock_bh(&pathtbl_resize_lock); |
848 | tbl = resize_dereference_mesh_paths(); | |
cd72e817 | 849 | table_flush_by_iface(tbl, sdata); |
239289e4 | 850 | tbl = resize_dereference_mpp_paths(); |
cd72e817 | 851 | table_flush_by_iface(tbl, sdata); |
239289e4 | 852 | read_unlock_bh(&pathtbl_resize_lock); |
cd72e817 | 853 | rcu_read_unlock(); |
eb2b9311 LCC |
854 | } |
855 | ||
856 | /** | |
857 | * mesh_path_del - delete a mesh path from the table | |
858 | * | |
859 | * @addr: dst address (ETH_ALEN length) | |
f698d856 | 860 | * @sdata: local subif |
eb2b9311 | 861 | * |
af901ca1 | 862 | * Returns: 0 if successful |
eb2b9311 | 863 | */ |
f698d856 | 864 | int mesh_path_del(u8 *addr, struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 865 | { |
349eb8cf | 866 | struct mesh_table *tbl; |
eb2b9311 LCC |
867 | struct mesh_path *mpath; |
868 | struct mpath_node *node; | |
869 | struct hlist_head *bucket; | |
870 | struct hlist_node *n; | |
871 | int hash_idx; | |
872 | int err = 0; | |
873 | ||
9b84b808 | 874 | read_lock_bh(&pathtbl_resize_lock); |
349eb8cf JB |
875 | tbl = resize_dereference_mesh_paths(); |
876 | hash_idx = mesh_table_hash(addr, sdata, tbl); | |
877 | bucket = &tbl->hash_buckets[hash_idx]; | |
eb2b9311 | 878 | |
349eb8cf | 879 | spin_lock_bh(&tbl->hashwlock[hash_idx]); |
eb2b9311 LCC |
880 | hlist_for_each_entry(node, n, bucket, list) { |
881 | mpath = node->mpath; | |
f698d856 | 882 | if (mpath->sdata == sdata && |
349eb8cf | 883 | memcmp(addr, mpath->dst, ETH_ALEN) == 0) { |
19c50b3d | 884 | __mesh_path_del(tbl, node); |
eb2b9311 LCC |
885 | goto enddel; |
886 | } | |
887 | } | |
888 | ||
889 | err = -ENXIO; | |
890 | enddel: | |
f5ea9120 | 891 | mesh_paths_generation++; |
349eb8cf | 892 | spin_unlock_bh(&tbl->hashwlock[hash_idx]); |
9b84b808 | 893 | read_unlock_bh(&pathtbl_resize_lock); |
eb2b9311 LCC |
894 | return err; |
895 | } | |
896 | ||
897 | /** | |
898 | * mesh_path_tx_pending - sends pending frames in a mesh path queue | |
899 | * | |
900 | * @mpath: mesh path to activate | |
901 | * | |
902 | * Locking: the state_lock of the mpath structure must NOT be held when calling | |
903 | * this function. | |
904 | */ | |
905 | void mesh_path_tx_pending(struct mesh_path *mpath) | |
906 | { | |
249b405c JC |
907 | if (mpath->flags & MESH_PATH_ACTIVE) |
908 | ieee80211_add_pending_skbs(mpath->sdata->local, | |
909 | &mpath->frame_queue); | |
eb2b9311 LCC |
910 | } |
911 | ||
5ee68e5b JC |
912 | /** |
913 | * mesh_path_send_to_gates - sends pending frames to all known mesh gates | |
914 | * | |
915 | * @mpath: mesh path whose queue will be emptied | |
916 | * | |
917 | * If there is only one gate, the frames are transferred from the failed mpath | |
918 | * queue to that gate's queue. If there are more than one gates, the frames | |
919 | * are copied from each gate to the next. After frames are copied, the | |
920 | * mpath queues are emptied onto the transmission queue. | |
921 | */ | |
922 | int mesh_path_send_to_gates(struct mesh_path *mpath) | |
923 | { | |
924 | struct ieee80211_sub_if_data *sdata = mpath->sdata; | |
925 | struct hlist_node *n; | |
926 | struct mesh_table *tbl; | |
927 | struct mesh_path *from_mpath = mpath; | |
928 | struct mpath_node *gate = NULL; | |
929 | bool copy = false; | |
930 | struct hlist_head *known_gates; | |
931 | ||
932 | rcu_read_lock(); | |
933 | tbl = rcu_dereference(mesh_paths); | |
934 | known_gates = tbl->known_gates; | |
935 | rcu_read_unlock(); | |
936 | ||
937 | if (!known_gates) | |
938 | return -EHOSTUNREACH; | |
939 | ||
940 | hlist_for_each_entry_rcu(gate, n, known_gates, list) { | |
941 | if (gate->mpath->sdata != sdata) | |
942 | continue; | |
943 | ||
944 | if (gate->mpath->flags & MESH_PATH_ACTIVE) { | |
945 | mpath_dbg("Forwarding to %pM\n", gate->mpath->dst); | |
946 | mesh_path_move_to_queue(gate->mpath, from_mpath, copy); | |
947 | from_mpath = gate->mpath; | |
948 | copy = true; | |
949 | } else { | |
950 | mpath_dbg("Not forwarding %p\n", gate->mpath); | |
951 | mpath_dbg("flags %x\n", gate->mpath->flags); | |
952 | } | |
953 | } | |
954 | ||
955 | hlist_for_each_entry_rcu(gate, n, known_gates, list) | |
956 | if (gate->mpath->sdata == sdata) { | |
957 | mpath_dbg("Sending to %pM\n", gate->mpath->dst); | |
958 | mesh_path_tx_pending(gate->mpath); | |
959 | } | |
960 | ||
961 | return (from_mpath == mpath) ? -EHOSTUNREACH : 0; | |
962 | } | |
963 | ||
eb2b9311 LCC |
964 | /** |
965 | * mesh_path_discard_frame - discard a frame whose path could not be resolved | |
966 | * | |
967 | * @skb: frame to discard | |
f698d856 | 968 | * @sdata: network subif the frame was to be sent through |
eb2b9311 | 969 | * |
eb2b9311 LCC |
970 | * Locking: the function must me called within a rcu_read_lock region |
971 | */ | |
f698d856 JBG |
972 | void mesh_path_discard_frame(struct sk_buff *skb, |
973 | struct ieee80211_sub_if_data *sdata) | |
eb2b9311 | 974 | { |
eb2b9311 | 975 | kfree_skb(skb); |
472dbc45 | 976 | sdata->u.mesh.mshstats.dropped_frames_no_route++; |
eb2b9311 LCC |
977 | } |
978 | ||
979 | /** | |
980 | * mesh_path_flush_pending - free the pending queue of a mesh path | |
981 | * | |
982 | * @mpath: mesh path whose queue has to be freed | |
983 | * | |
25985edc | 984 | * Locking: the function must me called within a rcu_read_lock region |
eb2b9311 LCC |
985 | */ |
986 | void mesh_path_flush_pending(struct mesh_path *mpath) | |
987 | { | |
eb2b9311 LCC |
988 | struct sk_buff *skb; |
989 | ||
00e3f25c | 990 | while ((skb = skb_dequeue(&mpath->frame_queue)) != NULL) |
f698d856 | 991 | mesh_path_discard_frame(skb, mpath->sdata); |
eb2b9311 LCC |
992 | } |
993 | ||
994 | /** | |
995 | * mesh_path_fix_nexthop - force a specific next hop for a mesh path | |
996 | * | |
997 | * @mpath: the mesh path to modify | |
998 | * @next_hop: the next hop to force | |
999 | * | |
1000 | * Locking: this function must be called holding mpath->state_lock | |
1001 | */ | |
1002 | void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop) | |
1003 | { | |
1004 | spin_lock_bh(&mpath->state_lock); | |
1005 | mesh_path_assign_nexthop(mpath, next_hop); | |
d19b3bf6 | 1006 | mpath->sn = 0xffff; |
eb2b9311 LCC |
1007 | mpath->metric = 0; |
1008 | mpath->hop_count = 0; | |
1009 | mpath->exp_time = 0; | |
1010 | mpath->flags |= MESH_PATH_FIXED; | |
1011 | mesh_path_activate(mpath); | |
1012 | spin_unlock_bh(&mpath->state_lock); | |
1013 | mesh_path_tx_pending(mpath); | |
1014 | } | |
1015 | ||
1016 | static void mesh_path_node_free(struct hlist_node *p, bool free_leafs) | |
1017 | { | |
1018 | struct mesh_path *mpath; | |
1019 | struct mpath_node *node = hlist_entry(p, struct mpath_node, list); | |
1020 | mpath = node->mpath; | |
1021 | hlist_del_rcu(p); | |
d0df9eec JC |
1022 | if (free_leafs) { |
1023 | del_timer_sync(&mpath->timer); | |
eb2b9311 | 1024 | kfree(mpath); |
d0df9eec | 1025 | } |
eb2b9311 LCC |
1026 | kfree(node); |
1027 | } | |
1028 | ||
4caf86c6 | 1029 | static int mesh_path_node_copy(struct hlist_node *p, struct mesh_table *newtbl) |
eb2b9311 LCC |
1030 | { |
1031 | struct mesh_path *mpath; | |
1032 | struct mpath_node *node, *new_node; | |
1033 | u32 hash_idx; | |
1034 | ||
8566dc3f | 1035 | new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC); |
00242c40 PE |
1036 | if (new_node == NULL) |
1037 | return -ENOMEM; | |
1038 | ||
eb2b9311 LCC |
1039 | node = hlist_entry(p, struct mpath_node, list); |
1040 | mpath = node->mpath; | |
eb2b9311 | 1041 | new_node->mpath = mpath; |
f698d856 | 1042 | hash_idx = mesh_table_hash(mpath->dst, mpath->sdata, newtbl); |
eb2b9311 LCC |
1043 | hlist_add_head(&new_node->list, |
1044 | &newtbl->hash_buckets[hash_idx]); | |
4caf86c6 | 1045 | return 0; |
eb2b9311 LCC |
1046 | } |
1047 | ||
1048 | int mesh_pathtbl_init(void) | |
1049 | { | |
349eb8cf | 1050 | struct mesh_table *tbl_path, *tbl_mpp; |
4c5ade41 | 1051 | int ret; |
349eb8cf JB |
1052 | |
1053 | tbl_path = mesh_table_alloc(INIT_PATHS_SIZE_ORDER); | |
1054 | if (!tbl_path) | |
79617dee | 1055 | return -ENOMEM; |
349eb8cf JB |
1056 | tbl_path->free_node = &mesh_path_node_free; |
1057 | tbl_path->copy_node = &mesh_path_node_copy; | |
1058 | tbl_path->mean_chain_len = MEAN_CHAIN_LEN; | |
5ee68e5b | 1059 | tbl_path->known_gates = kzalloc(sizeof(struct hlist_head), GFP_ATOMIC); |
4c5ade41 DC |
1060 | if (!tbl_path->known_gates) { |
1061 | ret = -ENOMEM; | |
1062 | goto free_path; | |
1063 | } | |
5ee68e5b JC |
1064 | INIT_HLIST_HEAD(tbl_path->known_gates); |
1065 | ||
79617dee | 1066 | |
349eb8cf JB |
1067 | tbl_mpp = mesh_table_alloc(INIT_PATHS_SIZE_ORDER); |
1068 | if (!tbl_mpp) { | |
4c5ade41 DC |
1069 | ret = -ENOMEM; |
1070 | goto free_path; | |
79617dee | 1071 | } |
349eb8cf JB |
1072 | tbl_mpp->free_node = &mesh_path_node_free; |
1073 | tbl_mpp->copy_node = &mesh_path_node_copy; | |
1074 | tbl_mpp->mean_chain_len = MEAN_CHAIN_LEN; | |
5ee68e5b | 1075 | tbl_mpp->known_gates = kzalloc(sizeof(struct hlist_head), GFP_ATOMIC); |
4c5ade41 DC |
1076 | if (!tbl_mpp->known_gates) { |
1077 | ret = -ENOMEM; | |
1078 | goto free_mpp; | |
1079 | } | |
5ee68e5b | 1080 | INIT_HLIST_HEAD(tbl_mpp->known_gates); |
349eb8cf JB |
1081 | |
1082 | /* Need no locking since this is during init */ | |
1083 | RCU_INIT_POINTER(mesh_paths, tbl_path); | |
1084 | RCU_INIT_POINTER(mpp_paths, tbl_mpp); | |
79617dee | 1085 | |
eb2b9311 | 1086 | return 0; |
4c5ade41 DC |
1087 | |
1088 | free_mpp: | |
1089 | mesh_table_free(tbl_mpp, true); | |
1090 | free_path: | |
1091 | mesh_table_free(tbl_path, true); | |
1092 | return ret; | |
eb2b9311 LCC |
1093 | } |
1094 | ||
f698d856 | 1095 | void mesh_path_expire(struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 1096 | { |
349eb8cf | 1097 | struct mesh_table *tbl; |
eb2b9311 LCC |
1098 | struct mesh_path *mpath; |
1099 | struct mpath_node *node; | |
1100 | struct hlist_node *p; | |
1101 | int i; | |
1102 | ||
349eb8cf JB |
1103 | rcu_read_lock(); |
1104 | tbl = rcu_dereference(mesh_paths); | |
1105 | for_each_mesh_entry(tbl, p, node, i) { | |
f698d856 | 1106 | if (node->mpath->sdata != sdata) |
eb2b9311 LCC |
1107 | continue; |
1108 | mpath = node->mpath; | |
eb2b9311 LCC |
1109 | if ((!(mpath->flags & MESH_PATH_RESOLVING)) && |
1110 | (!(mpath->flags & MESH_PATH_FIXED)) && | |
f5e50cd0 | 1111 | time_after(jiffies, mpath->exp_time + MESH_PATH_EXPIRE)) |
f698d856 | 1112 | mesh_path_del(mpath->dst, mpath->sdata); |
eb2b9311 | 1113 | } |
349eb8cf | 1114 | rcu_read_unlock(); |
eb2b9311 LCC |
1115 | } |
1116 | ||
1117 | void mesh_pathtbl_unregister(void) | |
1118 | { | |
349eb8cf | 1119 | /* no need for locking during exit path */ |
33d480ce ED |
1120 | mesh_table_free(rcu_dereference_protected(mesh_paths, 1), true); |
1121 | mesh_table_free(rcu_dereference_protected(mpp_paths, 1), true); | |
eb2b9311 | 1122 | } |