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