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 | ||
74932959 BC |
21 | static void mesh_path_free_rcu(struct mesh_table *tbl, struct mesh_path *mpath); |
22 | ||
60854fd9 BC |
23 | static u32 mesh_table_hash(const void *addr, u32 len, u32 seed) |
24 | { | |
25 | /* Use last four bytes of hw addr as hash index */ | |
26 | return jhash_1word(*(u32 *)(addr+2), seed); | |
27 | } | |
eb2b9311 | 28 | |
60854fd9 BC |
29 | static const struct rhashtable_params mesh_rht_params = { |
30 | .nelem_hint = 2, | |
31 | .automatic_shrinking = true, | |
32 | .key_len = ETH_ALEN, | |
33 | .key_offset = offsetof(struct mesh_path, dst), | |
34 | .head_offset = offsetof(struct mesh_path, rhash), | |
35 | .hashfn = mesh_table_hash, | |
36 | }; | |
eb2b9311 | 37 | |
bf7cd94d JB |
38 | static inline bool mpath_expired(struct mesh_path *mpath) |
39 | { | |
40 | return (mpath->flags & MESH_PATH_ACTIVE) && | |
41 | time_after(jiffies, mpath->exp_time) && | |
42 | !(mpath->flags & MESH_PATH_FIXED); | |
43 | } | |
eb2b9311 | 44 | |
74932959 | 45 | static void mesh_path_rht_free(void *ptr, void *tblptr) |
349eb8cf | 46 | { |
60854fd9 | 47 | struct mesh_path *mpath = ptr; |
74932959 BC |
48 | struct mesh_table *tbl = tblptr; |
49 | ||
50 | mesh_path_free_rcu(tbl, mpath); | |
349eb8cf JB |
51 | } |
52 | ||
60854fd9 | 53 | static struct mesh_table *mesh_table_alloc(void) |
6b86bd62 | 54 | { |
6b86bd62 JB |
55 | struct mesh_table *newtbl; |
56 | ||
d676ff49 | 57 | newtbl = kmalloc(sizeof(struct mesh_table), GFP_ATOMIC); |
6b86bd62 JB |
58 | if (!newtbl) |
59 | return NULL; | |
60 | ||
18b27ff7 | 61 | INIT_HLIST_HEAD(&newtbl->known_gates); |
6b86bd62 | 62 | atomic_set(&newtbl->entries, 0); |
5ee68e5b | 63 | spin_lock_init(&newtbl->gates_lock); |
6b86bd62 JB |
64 | |
65 | return newtbl; | |
66 | } | |
67 | ||
60854fd9 | 68 | static void mesh_table_free(struct mesh_table *tbl) |
18889231 | 69 | { |
60854fd9 | 70 | rhashtable_free_and_destroy(&tbl->rhead, |
74932959 | 71 | mesh_path_rht_free, tbl); |
18889231 JC |
72 | kfree(tbl); |
73 | } | |
74 | ||
eb2b9311 LCC |
75 | /** |
76 | * | |
77 | * mesh_path_assign_nexthop - update mesh path next hop | |
78 | * | |
79 | * @mpath: mesh path to update | |
80 | * @sta: next hop to assign | |
81 | * | |
82 | * Locking: mpath->state_lock must be held when calling this function | |
83 | */ | |
84 | void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta) | |
85 | { | |
10c836d7 JC |
86 | struct sk_buff *skb; |
87 | struct ieee80211_hdr *hdr; | |
10c836d7 JC |
88 | unsigned long flags; |
89 | ||
d0709a65 | 90 | rcu_assign_pointer(mpath->next_hop, sta); |
10c836d7 | 91 | |
10c836d7 | 92 | spin_lock_irqsave(&mpath->frame_queue.lock, flags); |
b22bd522 | 93 | skb_queue_walk(&mpath->frame_queue, skb) { |
10c836d7 JC |
94 | hdr = (struct ieee80211_hdr *) skb->data; |
95 | memcpy(hdr->addr1, sta->sta.addr, ETH_ALEN); | |
7e3c8866 | 96 | memcpy(hdr->addr2, mpath->sdata->vif.addr, ETH_ALEN); |
3f52b7e3 | 97 | ieee80211_mps_set_frame_flags(sta->sdata, sta, hdr); |
10c836d7 JC |
98 | } |
99 | ||
10c836d7 | 100 | spin_unlock_irqrestore(&mpath->frame_queue.lock, flags); |
eb2b9311 LCC |
101 | } |
102 | ||
5ee68e5b JC |
103 | static void prepare_for_gate(struct sk_buff *skb, char *dst_addr, |
104 | struct mesh_path *gate_mpath) | |
105 | { | |
106 | struct ieee80211_hdr *hdr; | |
107 | struct ieee80211s_hdr *mshdr; | |
108 | int mesh_hdrlen, hdrlen; | |
109 | char *next_hop; | |
110 | ||
111 | hdr = (struct ieee80211_hdr *) skb->data; | |
112 | hdrlen = ieee80211_hdrlen(hdr->frame_control); | |
113 | mshdr = (struct ieee80211s_hdr *) (skb->data + hdrlen); | |
114 | ||
115 | if (!(mshdr->flags & MESH_FLAGS_AE)) { | |
116 | /* size of the fixed part of the mesh header */ | |
117 | mesh_hdrlen = 6; | |
118 | ||
119 | /* make room for the two extended addresses */ | |
120 | skb_push(skb, 2 * ETH_ALEN); | |
121 | memmove(skb->data, hdr, hdrlen + mesh_hdrlen); | |
122 | ||
123 | hdr = (struct ieee80211_hdr *) skb->data; | |
124 | ||
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); | |
131 | } | |
132 | ||
133 | /* update next hop */ | |
134 | hdr = (struct ieee80211_hdr *) skb->data; | |
135 | rcu_read_lock(); | |
136 | next_hop = rcu_dereference(gate_mpath->next_hop)->sta.addr; | |
137 | memcpy(hdr->addr1, next_hop, ETH_ALEN); | |
138 | rcu_read_unlock(); | |
7e3c8866 | 139 | memcpy(hdr->addr2, gate_mpath->sdata->vif.addr, ETH_ALEN); |
5ee68e5b JC |
140 | memcpy(hdr->addr3, dst_addr, ETH_ALEN); |
141 | } | |
142 | ||
143 | /** | |
144 | * | |
145 | * mesh_path_move_to_queue - Move or copy frames from one mpath queue to another | |
146 | * | |
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. | |
150 | * | |
151 | * If a frame already has an Address Extension field, only the next hop and | |
152 | * destination addresses are updated. | |
153 | * | |
154 | * The gate mpath must be an active mpath with a valid mpath->next_hop. | |
155 | * | |
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, | |
159 | * move them. | |
160 | */ | |
161 | static void mesh_path_move_to_queue(struct mesh_path *gate_mpath, | |
162 | struct mesh_path *from_mpath, | |
163 | bool copy) | |
164 | { | |
4bd4c2dd TP |
165 | struct sk_buff *skb, *fskb, *tmp; |
166 | struct sk_buff_head failq; | |
5ee68e5b | 167 | unsigned long flags; |
5ee68e5b | 168 | |
8c5bb1fa JB |
169 | if (WARN_ON(gate_mpath == from_mpath)) |
170 | return; | |
171 | if (WARN_ON(!gate_mpath->next_hop)) | |
172 | return; | |
5ee68e5b | 173 | |
5ee68e5b JC |
174 | __skb_queue_head_init(&failq); |
175 | ||
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); | |
179 | ||
4bd4c2dd TP |
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"); | |
184 | break; | |
817a53d9 | 185 | } |
5ee68e5b | 186 | |
4bd4c2dd TP |
187 | skb = skb_copy(fskb, GFP_ATOMIC); |
188 | if (WARN_ON(!skb)) | |
189 | break; | |
190 | ||
5ee68e5b | 191 | prepare_for_gate(skb, gate_mpath->dst, gate_mpath); |
4bd4c2dd TP |
192 | skb_queue_tail(&gate_mpath->frame_queue, skb); |
193 | ||
194 | if (copy) | |
195 | continue; | |
196 | ||
197 | __skb_unlink(fskb, &failq); | |
198 | kfree_skb(fskb); | |
5ee68e5b JC |
199 | } |
200 | ||
bdcbd8e0 JB |
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)); | |
5ee68e5b JC |
203 | |
204 | if (!copy) | |
205 | return; | |
206 | ||
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); | |
210 | } | |
211 | ||
eb2b9311 | 212 | |
4a3cb702 JB |
213 | static struct mesh_path *mpath_lookup(struct mesh_table *tbl, const u8 *dst, |
214 | struct ieee80211_sub_if_data *sdata) | |
eb2b9311 LCC |
215 | { |
216 | struct mesh_path *mpath; | |
60854fd9 BC |
217 | |
218 | mpath = rhashtable_lookup_fast(&tbl->rhead, dst, mesh_rht_params); | |
219 | ||
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); | |
eb2b9311 | 224 | } |
60854fd9 | 225 | return mpath; |
eb2b9311 LCC |
226 | } |
227 | ||
239289e4 JC |
228 | /** |
229 | * mesh_path_lookup - look up a path in the mesh path table | |
239289e4 | 230 | * @sdata: local subif |
bf7cd94d | 231 | * @dst: hardware address (ETH_ALEN length) of destination |
239289e4 JC |
232 | * |
233 | * Returns: pointer to the mesh path structure, or NULL if not found | |
234 | * | |
235 | * Locking: must be called within a read rcu section. | |
236 | */ | |
bf7cd94d JB |
237 | struct mesh_path * |
238 | mesh_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst) | |
79617dee | 239 | { |
60854fd9 | 240 | return mpath_lookup(sdata->u.mesh.mesh_paths, dst, sdata); |
239289e4 | 241 | } |
79617dee | 242 | |
bf7cd94d JB |
243 | struct mesh_path * |
244 | mpp_path_lookup(struct ieee80211_sub_if_data *sdata, const u8 *dst) | |
239289e4 | 245 | { |
60854fd9 | 246 | return mpath_lookup(sdata->u.mesh.mpp_paths, dst, sdata); |
79617dee Y |
247 | } |
248 | ||
60854fd9 BC |
249 | static struct mesh_path * |
250 | __mesh_path_lookup_by_idx(struct mesh_table *tbl, int idx) | |
251 | { | |
252 | int i = 0, ret; | |
253 | struct mesh_path *mpath = NULL; | |
254 | struct rhashtable_iter iter; | |
255 | ||
256 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_ATOMIC); | |
257 | if (ret) | |
258 | return NULL; | |
259 | ||
97a6ec4a | 260 | rhashtable_walk_start(&iter); |
60854fd9 BC |
261 | |
262 | while ((mpath = rhashtable_walk_next(&iter))) { | |
263 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
264 | continue; | |
265 | if (IS_ERR(mpath)) | |
266 | break; | |
267 | if (i++ == idx) | |
268 | break; | |
269 | } | |
60854fd9 BC |
270 | rhashtable_walk_stop(&iter); |
271 | rhashtable_walk_exit(&iter); | |
272 | ||
273 | if (IS_ERR(mpath) || !mpath) | |
274 | return NULL; | |
275 | ||
276 | if (mpath_expired(mpath)) { | |
277 | spin_lock_bh(&mpath->state_lock); | |
278 | mpath->flags &= ~MESH_PATH_ACTIVE; | |
279 | spin_unlock_bh(&mpath->state_lock); | |
280 | } | |
281 | return mpath; | |
282 | } | |
79617dee | 283 | |
eb2b9311 LCC |
284 | /** |
285 | * mesh_path_lookup_by_idx - look up a path in the mesh path table by its index | |
286 | * @idx: index | |
f698d856 | 287 | * @sdata: local subif, or NULL for all entries |
eb2b9311 LCC |
288 | * |
289 | * Returns: pointer to the mesh path structure, or NULL if not found. | |
290 | * | |
291 | * Locking: must be called within a read rcu section. | |
292 | */ | |
bf7cd94d JB |
293 | struct mesh_path * |
294 | mesh_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx) | |
eb2b9311 | 295 | { |
60854fd9 | 296 | return __mesh_path_lookup_by_idx(sdata->u.mesh.mesh_paths, idx); |
eb2b9311 LCC |
297 | } |
298 | ||
a2db2ed3 HR |
299 | /** |
300 | * mpp_path_lookup_by_idx - look up a path in the proxy path table by its index | |
301 | * @idx: index | |
302 | * @sdata: local subif, or NULL for all entries | |
303 | * | |
304 | * Returns: pointer to the proxy path structure, or NULL if not found. | |
305 | * | |
306 | * Locking: must be called within a read rcu section. | |
307 | */ | |
308 | struct mesh_path * | |
309 | mpp_path_lookup_by_idx(struct ieee80211_sub_if_data *sdata, int idx) | |
310 | { | |
60854fd9 | 311 | return __mesh_path_lookup_by_idx(sdata->u.mesh.mpp_paths, idx); |
a2db2ed3 HR |
312 | } |
313 | ||
5ee68e5b | 314 | /** |
30be52e4 JB |
315 | * mesh_path_add_gate - add the given mpath to a mesh gate to our path table |
316 | * @mpath: gate path to add to table | |
5ee68e5b | 317 | */ |
30be52e4 | 318 | int mesh_path_add_gate(struct mesh_path *mpath) |
5ee68e5b | 319 | { |
30be52e4 | 320 | struct mesh_table *tbl; |
5ee68e5b JC |
321 | int err; |
322 | ||
323 | rcu_read_lock(); | |
60854fd9 | 324 | tbl = mpath->sdata->u.mesh.mesh_paths; |
5ee68e5b | 325 | |
947c2a0e BC |
326 | spin_lock_bh(&mpath->state_lock); |
327 | if (mpath->is_gate) { | |
328 | err = -EEXIST; | |
329 | spin_unlock_bh(&mpath->state_lock); | |
5ee68e5b JC |
330 | goto err_rcu; |
331 | } | |
5ee68e5b JC |
332 | mpath->is_gate = true; |
333 | mpath->sdata->u.mesh.num_gates++; | |
947c2a0e BC |
334 | |
335 | spin_lock(&tbl->gates_lock); | |
18b27ff7 | 336 | hlist_add_head_rcu(&mpath->gate_list, &tbl->known_gates); |
947c2a0e BC |
337 | spin_unlock(&tbl->gates_lock); |
338 | ||
339 | spin_unlock_bh(&mpath->state_lock); | |
340 | ||
bdcbd8e0 JB |
341 | mpath_dbg(mpath->sdata, |
342 | "Mesh path: Recorded new gate: %pM. %d known gates\n", | |
343 | mpath->dst, mpath->sdata->u.mesh.num_gates); | |
bf7cd94d | 344 | err = 0; |
5ee68e5b JC |
345 | err_rcu: |
346 | rcu_read_unlock(); | |
347 | return err; | |
348 | } | |
349 | ||
350 | /** | |
351 | * mesh_gate_del - remove a mesh gate from the list of known gates | |
352 | * @tbl: table which holds our list of known gates | |
353 | * @mpath: gate mpath | |
5ee68e5b | 354 | */ |
bf7cd94d | 355 | static void mesh_gate_del(struct mesh_table *tbl, struct mesh_path *mpath) |
5ee68e5b | 356 | { |
947c2a0e BC |
357 | lockdep_assert_held(&mpath->state_lock); |
358 | if (!mpath->is_gate) | |
359 | return; | |
5ee68e5b | 360 | |
947c2a0e BC |
361 | mpath->is_gate = false; |
362 | spin_lock_bh(&tbl->gates_lock); | |
363 | hlist_del_rcu(&mpath->gate_list); | |
364 | mpath->sdata->u.mesh.num_gates--; | |
365 | spin_unlock_bh(&tbl->gates_lock); | |
366 | ||
367 | mpath_dbg(mpath->sdata, | |
368 | "Mesh path: Deleted gate: %pM. %d known gates\n", | |
369 | mpath->dst, mpath->sdata->u.mesh.num_gates); | |
5ee68e5b JC |
370 | } |
371 | ||
5ee68e5b JC |
372 | /** |
373 | * mesh_gate_num - number of gates known to this interface | |
374 | * @sdata: subif data | |
375 | */ | |
376 | int mesh_gate_num(struct ieee80211_sub_if_data *sdata) | |
377 | { | |
378 | return sdata->u.mesh.num_gates; | |
379 | } | |
380 | ||
b15dc38b BC |
381 | static |
382 | struct mesh_path *mesh_path_new(struct ieee80211_sub_if_data *sdata, | |
383 | const u8 *dst, gfp_t gfp_flags) | |
384 | { | |
385 | struct mesh_path *new_mpath; | |
386 | ||
387 | new_mpath = kzalloc(sizeof(struct mesh_path), gfp_flags); | |
388 | if (!new_mpath) | |
389 | return NULL; | |
390 | ||
391 | memcpy(new_mpath->dst, dst, ETH_ALEN); | |
392 | eth_broadcast_addr(new_mpath->rann_snd_addr); | |
393 | new_mpath->is_root = false; | |
394 | new_mpath->sdata = sdata; | |
395 | new_mpath->flags = 0; | |
396 | skb_queue_head_init(&new_mpath->frame_queue); | |
b15dc38b BC |
397 | new_mpath->exp_time = jiffies; |
398 | spin_lock_init(&new_mpath->state_lock); | |
34f11cd3 | 399 | timer_setup(&new_mpath->timer, mesh_path_timer, 0); |
b15dc38b BC |
400 | |
401 | return new_mpath; | |
402 | } | |
403 | ||
eb2b9311 LCC |
404 | /** |
405 | * mesh_path_add - allocate and add a new path to the mesh path table | |
bf7cd94d | 406 | * @dst: destination address of the path (ETH_ALEN length) |
f698d856 | 407 | * @sdata: local subif |
eb2b9311 | 408 | * |
af901ca1 | 409 | * Returns: 0 on success |
eb2b9311 LCC |
410 | * |
411 | * State: the initial state of the new path is set to 0 | |
412 | */ | |
ae76eef0 BC |
413 | struct mesh_path *mesh_path_add(struct ieee80211_sub_if_data *sdata, |
414 | const u8 *dst) | |
eb2b9311 | 415 | { |
349eb8cf | 416 | struct mesh_table *tbl; |
eb2b9311 | 417 | struct mesh_path *mpath, *new_mpath; |
60854fd9 | 418 | int ret; |
eb2b9311 | 419 | |
b203ca39 | 420 | if (ether_addr_equal(dst, sdata->vif.addr)) |
eb2b9311 | 421 | /* never add ourselves as neighbours */ |
ae76eef0 | 422 | return ERR_PTR(-ENOTSUPP); |
eb2b9311 LCC |
423 | |
424 | if (is_multicast_ether_addr(dst)) | |
ae76eef0 | 425 | return ERR_PTR(-ENOTSUPP); |
eb2b9311 | 426 | |
472dbc45 | 427 | if (atomic_add_unless(&sdata->u.mesh.mpaths, 1, MESH_MAX_MPATHS) == 0) |
ae76eef0 BC |
428 | return ERR_PTR(-ENOSPC); |
429 | ||
b15dc38b | 430 | new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC); |
402d7752 | 431 | if (!new_mpath) |
60854fd9 | 432 | return ERR_PTR(-ENOMEM); |
18889231 | 433 | |
60854fd9 BC |
434 | tbl = sdata->u.mesh.mesh_paths; |
435 | do { | |
436 | ret = rhashtable_lookup_insert_fast(&tbl->rhead, | |
437 | &new_mpath->rhash, | |
438 | mesh_rht_params); | |
18889231 | 439 | |
60854fd9 BC |
440 | if (ret == -EEXIST) |
441 | mpath = rhashtable_lookup_fast(&tbl->rhead, | |
442 | dst, | |
443 | mesh_rht_params); | |
1928ecab | 444 | |
60854fd9 | 445 | } while (unlikely(ret == -EEXIST && !mpath)); |
18889231 | 446 | |
60854fd9 BC |
447 | if (ret && ret != -EEXIST) |
448 | return ERR_PTR(ret); | |
18889231 | 449 | |
60854fd9 BC |
450 | /* At this point either new_mpath was added, or we found a |
451 | * matching entry already in the table; in the latter case | |
452 | * free the unnecessary new entry. | |
453 | */ | |
454 | if (ret == -EEXIST) { | |
455 | kfree(new_mpath); | |
456 | new_mpath = mpath; | |
18889231 | 457 | } |
60854fd9 BC |
458 | sdata->u.mesh.mesh_paths_generation++; |
459 | return new_mpath; | |
18889231 | 460 | } |
eb2b9311 | 461 | |
bf7cd94d JB |
462 | int mpp_path_add(struct ieee80211_sub_if_data *sdata, |
463 | const u8 *dst, const u8 *mpp) | |
79617dee | 464 | { |
349eb8cf | 465 | struct mesh_table *tbl; |
60854fd9 BC |
466 | struct mesh_path *new_mpath; |
467 | int ret; | |
79617dee | 468 | |
b203ca39 | 469 | if (ether_addr_equal(dst, sdata->vif.addr)) |
79617dee Y |
470 | /* never add ourselves as neighbours */ |
471 | return -ENOTSUPP; | |
472 | ||
473 | if (is_multicast_ether_addr(dst)) | |
474 | return -ENOTSUPP; | |
475 | ||
b15dc38b | 476 | new_mpath = mesh_path_new(sdata, dst, GFP_ATOMIC); |
79617dee | 477 | |
60854fd9 BC |
478 | if (!new_mpath) |
479 | return -ENOMEM; | |
79617dee | 480 | |
79617dee | 481 | memcpy(new_mpath->mpp, mpp, ETH_ALEN); |
60854fd9 BC |
482 | tbl = sdata->u.mesh.mpp_paths; |
483 | ret = rhashtable_lookup_insert_fast(&tbl->rhead, | |
484 | &new_mpath->rhash, | |
485 | mesh_rht_params); | |
a2db2ed3 | 486 | |
2bdaf386 | 487 | sdata->u.mesh.mpp_paths_generation++; |
60854fd9 | 488 | return ret; |
79617dee Y |
489 | } |
490 | ||
491 | ||
eb2b9311 LCC |
492 | /** |
493 | * mesh_plink_broken - deactivates paths and sends perr when a link breaks | |
494 | * | |
495 | * @sta: broken peer link | |
496 | * | |
497 | * This function must be called from the rate control algorithm if enough | |
498 | * delivery errors suggest that a peer link is no longer usable. | |
499 | */ | |
500 | void mesh_plink_broken(struct sta_info *sta) | |
501 | { | |
60854fd9 BC |
502 | struct ieee80211_sub_if_data *sdata = sta->sdata; |
503 | struct mesh_table *tbl = sdata->u.mesh.mesh_paths; | |
15ff6365 | 504 | static const u8 bcast[ETH_ALEN] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff}; |
eb2b9311 | 505 | struct mesh_path *mpath; |
60854fd9 BC |
506 | struct rhashtable_iter iter; |
507 | int ret; | |
eb2b9311 | 508 | |
60854fd9 BC |
509 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_ATOMIC); |
510 | if (ret) | |
511 | return; | |
512 | ||
97a6ec4a | 513 | rhashtable_walk_start(&iter); |
60854fd9 BC |
514 | |
515 | while ((mpath = rhashtable_walk_next(&iter))) { | |
516 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
517 | continue; | |
518 | if (IS_ERR(mpath)) | |
519 | break; | |
2688eba9 | 520 | if (rcu_access_pointer(mpath->next_hop) == sta && |
eb2b9311 LCC |
521 | mpath->flags & MESH_PATH_ACTIVE && |
522 | !(mpath->flags & MESH_PATH_FIXED)) { | |
f5e50cd0 | 523 | spin_lock_bh(&mpath->state_lock); |
eb2b9311 | 524 | mpath->flags &= ~MESH_PATH_ACTIVE; |
d19b3bf6 | 525 | ++mpath->sn; |
eb2b9311 | 526 | spin_unlock_bh(&mpath->state_lock); |
bf7cd94d | 527 | mesh_path_error_tx(sdata, |
f63f8421 CYY |
528 | sdata->u.mesh.mshcfg.element_ttl, |
529 | mpath->dst, mpath->sn, | |
530 | WLAN_REASON_MESH_PATH_DEST_UNREACHABLE, bcast); | |
f5e50cd0 | 531 | } |
eb2b9311 | 532 | } |
60854fd9 BC |
533 | rhashtable_walk_stop(&iter); |
534 | rhashtable_walk_exit(&iter); | |
19c50b3d JC |
535 | } |
536 | ||
74932959 BC |
537 | static void mesh_path_free_rcu(struct mesh_table *tbl, |
538 | struct mesh_path *mpath) | |
19c50b3d | 539 | { |
60854fd9 | 540 | struct ieee80211_sub_if_data *sdata = mpath->sdata; |
c2e703a5 | 541 | |
947c2a0e | 542 | spin_lock_bh(&mpath->state_lock); |
74932959 | 543 | mpath->flags |= MESH_PATH_RESOLVING | MESH_PATH_DELETED; |
60854fd9 | 544 | mesh_gate_del(tbl, mpath); |
947c2a0e | 545 | spin_unlock_bh(&mpath->state_lock); |
74932959 | 546 | del_timer_sync(&mpath->timer); |
c2e703a5 | 547 | atomic_dec(&sdata->u.mesh.mpaths); |
19c50b3d | 548 | atomic_dec(&tbl->entries); |
74932959 BC |
549 | kfree_rcu(mpath, rcu); |
550 | } | |
551 | ||
552 | static void __mesh_path_del(struct mesh_table *tbl, struct mesh_path *mpath) | |
553 | { | |
554 | rhashtable_remove_fast(&tbl->rhead, &mpath->rhash, mesh_rht_params); | |
555 | mesh_path_free_rcu(tbl, mpath); | |
19c50b3d JC |
556 | } |
557 | ||
eb2b9311 LCC |
558 | /** |
559 | * mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches | |
560 | * | |
2c53040f | 561 | * @sta: mesh peer to match |
eb2b9311 | 562 | * |
b4e08ea1 LCC |
563 | * RCU notes: this function is called when a mesh plink transitions from |
564 | * PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that | |
565 | * allows path creation. This will happen before the sta can be freed (because | |
d0709a65 JB |
566 | * sta_info_destroy() calls this) so any reader in a rcu read block will be |
567 | * protected against the plink disappearing. | |
eb2b9311 LCC |
568 | */ |
569 | void mesh_path_flush_by_nexthop(struct sta_info *sta) | |
570 | { | |
2bdaf386 | 571 | struct ieee80211_sub_if_data *sdata = sta->sdata; |
60854fd9 | 572 | struct mesh_table *tbl = sdata->u.mesh.mesh_paths; |
eb2b9311 | 573 | struct mesh_path *mpath; |
60854fd9 BC |
574 | struct rhashtable_iter iter; |
575 | int ret; | |
eb2b9311 | 576 | |
60854fd9 BC |
577 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_ATOMIC); |
578 | if (ret) | |
579 | return; | |
580 | ||
97a6ec4a | 581 | rhashtable_walk_start(&iter); |
60854fd9 BC |
582 | |
583 | while ((mpath = rhashtable_walk_next(&iter))) { | |
584 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
585 | continue; | |
586 | if (IS_ERR(mpath)) | |
587 | break; | |
588 | ||
589 | if (rcu_access_pointer(mpath->next_hop) == sta) | |
590 | __mesh_path_del(tbl, mpath); | |
eb2b9311 | 591 | } |
97a6ec4a | 592 | |
60854fd9 BC |
593 | rhashtable_walk_stop(&iter); |
594 | rhashtable_walk_exit(&iter); | |
eb2b9311 LCC |
595 | } |
596 | ||
bf5a70e1 HR |
597 | static void mpp_flush_by_proxy(struct ieee80211_sub_if_data *sdata, |
598 | const u8 *proxy) | |
599 | { | |
60854fd9 BC |
600 | struct mesh_table *tbl = sdata->u.mesh.mpp_paths; |
601 | struct mesh_path *mpath; | |
602 | struct rhashtable_iter iter; | |
603 | int ret; | |
bf5a70e1 | 604 | |
60854fd9 BC |
605 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_ATOMIC); |
606 | if (ret) | |
607 | return; | |
608 | ||
97a6ec4a | 609 | rhashtable_walk_start(&iter); |
60854fd9 BC |
610 | |
611 | while ((mpath = rhashtable_walk_next(&iter))) { | |
612 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
613 | continue; | |
614 | if (IS_ERR(mpath)) | |
615 | break; | |
616 | ||
617 | if (ether_addr_equal(mpath->mpp, proxy)) | |
618 | __mesh_path_del(tbl, mpath); | |
bf5a70e1 | 619 | } |
97a6ec4a | 620 | |
60854fd9 BC |
621 | rhashtable_walk_stop(&iter); |
622 | rhashtable_walk_exit(&iter); | |
bf5a70e1 HR |
623 | } |
624 | ||
60854fd9 | 625 | static void table_flush_by_iface(struct mesh_table *tbl) |
eb2b9311 LCC |
626 | { |
627 | struct mesh_path *mpath; | |
60854fd9 BC |
628 | struct rhashtable_iter iter; |
629 | int ret; | |
630 | ||
631 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_ATOMIC); | |
632 | if (ret) | |
633 | return; | |
634 | ||
97a6ec4a | 635 | rhashtable_walk_start(&iter); |
60854fd9 BC |
636 | |
637 | while ((mpath = rhashtable_walk_next(&iter))) { | |
638 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
639 | continue; | |
640 | if (IS_ERR(mpath)) | |
641 | break; | |
642 | __mesh_path_del(tbl, mpath); | |
eb2b9311 | 643 | } |
97a6ec4a | 644 | |
60854fd9 BC |
645 | rhashtable_walk_stop(&iter); |
646 | rhashtable_walk_exit(&iter); | |
eb2b9311 LCC |
647 | } |
648 | ||
ece1a2e7 JC |
649 | /** |
650 | * mesh_path_flush_by_iface - Deletes all mesh paths associated with a given iface | |
651 | * | |
652 | * This function deletes both mesh paths as well as mesh portal paths. | |
653 | * | |
2c53040f | 654 | * @sdata: interface data to match |
ece1a2e7 JC |
655 | * |
656 | */ | |
657 | void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata) | |
eb2b9311 | 658 | { |
60854fd9 BC |
659 | table_flush_by_iface(sdata->u.mesh.mesh_paths); |
660 | table_flush_by_iface(sdata->u.mesh.mpp_paths); | |
eb2b9311 LCC |
661 | } |
662 | ||
663 | /** | |
4cc955de | 664 | * table_path_del - delete a path from the mesh or mpp table |
eb2b9311 | 665 | * |
4cc955de | 666 | * @tbl: mesh or mpp path table |
f698d856 | 667 | * @sdata: local subif |
4cc955de | 668 | * @addr: dst address (ETH_ALEN length) |
eb2b9311 | 669 | * |
af901ca1 | 670 | * Returns: 0 if successful |
eb2b9311 | 671 | */ |
60854fd9 | 672 | static int table_path_del(struct mesh_table *tbl, |
4cc955de HR |
673 | struct ieee80211_sub_if_data *sdata, |
674 | const u8 *addr) | |
eb2b9311 LCC |
675 | { |
676 | struct mesh_path *mpath; | |
60854fd9 BC |
677 | |
678 | rcu_read_lock(); | |
679 | mpath = rhashtable_lookup_fast(&tbl->rhead, addr, mesh_rht_params); | |
680 | if (!mpath) { | |
681 | rcu_read_unlock(); | |
682 | return -ENXIO; | |
eb2b9311 LCC |
683 | } |
684 | ||
60854fd9 BC |
685 | __mesh_path_del(tbl, mpath); |
686 | rcu_read_unlock(); | |
687 | return 0; | |
4cc955de HR |
688 | } |
689 | ||
60854fd9 | 690 | |
4cc955de HR |
691 | /** |
692 | * mesh_path_del - delete a mesh path from the table | |
693 | * | |
694 | * @addr: dst address (ETH_ALEN length) | |
695 | * @sdata: local subif | |
696 | * | |
697 | * Returns: 0 if successful | |
698 | */ | |
699 | int mesh_path_del(struct ieee80211_sub_if_data *sdata, const u8 *addr) | |
700 | { | |
60854fd9 | 701 | int err; |
4cc955de HR |
702 | |
703 | /* flush relevant mpp entries first */ | |
704 | mpp_flush_by_proxy(sdata, addr); | |
705 | ||
2bdaf386 BC |
706 | err = table_path_del(sdata->u.mesh.mesh_paths, sdata, addr); |
707 | sdata->u.mesh.mesh_paths_generation++; | |
ab1c7906 HR |
708 | return err; |
709 | } | |
710 | ||
eb2b9311 LCC |
711 | /** |
712 | * mesh_path_tx_pending - sends pending frames in a mesh path queue | |
713 | * | |
714 | * @mpath: mesh path to activate | |
715 | * | |
716 | * Locking: the state_lock of the mpath structure must NOT be held when calling | |
717 | * this function. | |
718 | */ | |
719 | void mesh_path_tx_pending(struct mesh_path *mpath) | |
720 | { | |
249b405c JC |
721 | if (mpath->flags & MESH_PATH_ACTIVE) |
722 | ieee80211_add_pending_skbs(mpath->sdata->local, | |
723 | &mpath->frame_queue); | |
eb2b9311 LCC |
724 | } |
725 | ||
5ee68e5b JC |
726 | /** |
727 | * mesh_path_send_to_gates - sends pending frames to all known mesh gates | |
728 | * | |
729 | * @mpath: mesh path whose queue will be emptied | |
730 | * | |
731 | * If there is only one gate, the frames are transferred from the failed mpath | |
732 | * queue to that gate's queue. If there are more than one gates, the frames | |
733 | * are copied from each gate to the next. After frames are copied, the | |
734 | * mpath queues are emptied onto the transmission queue. | |
735 | */ | |
736 | int mesh_path_send_to_gates(struct mesh_path *mpath) | |
737 | { | |
738 | struct ieee80211_sub_if_data *sdata = mpath->sdata; | |
5ee68e5b JC |
739 | struct mesh_table *tbl; |
740 | struct mesh_path *from_mpath = mpath; | |
60854fd9 | 741 | struct mesh_path *gate; |
5ee68e5b | 742 | bool copy = false; |
5ee68e5b | 743 | |
60854fd9 | 744 | tbl = sdata->u.mesh.mesh_paths; |
5ee68e5b | 745 | |
60854fd9 | 746 | rcu_read_lock(); |
18b27ff7 | 747 | hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) { |
947c2a0e BC |
748 | if (gate->flags & MESH_PATH_ACTIVE) { |
749 | mpath_dbg(sdata, "Forwarding to %pM\n", gate->dst); | |
750 | mesh_path_move_to_queue(gate, from_mpath, copy); | |
751 | from_mpath = gate; | |
5ee68e5b JC |
752 | copy = true; |
753 | } else { | |
bdcbd8e0 | 754 | mpath_dbg(sdata, |
d671b2a0 | 755 | "Not forwarding to %pM (flags %#x)\n", |
947c2a0e | 756 | gate->dst, gate->flags); |
5ee68e5b JC |
757 | } |
758 | } | |
759 | ||
18b27ff7 | 760 | hlist_for_each_entry_rcu(gate, &tbl->known_gates, gate_list) { |
947c2a0e BC |
761 | mpath_dbg(sdata, "Sending to %pM\n", gate->dst); |
762 | mesh_path_tx_pending(gate); | |
2bdaf386 | 763 | } |
60854fd9 | 764 | rcu_read_unlock(); |
5ee68e5b JC |
765 | |
766 | return (from_mpath == mpath) ? -EHOSTUNREACH : 0; | |
767 | } | |
768 | ||
eb2b9311 LCC |
769 | /** |
770 | * mesh_path_discard_frame - discard a frame whose path could not be resolved | |
771 | * | |
772 | * @skb: frame to discard | |
f698d856 | 773 | * @sdata: network subif the frame was to be sent through |
eb2b9311 | 774 | * |
eb2b9311 LCC |
775 | * Locking: the function must me called within a rcu_read_lock region |
776 | */ | |
bf7cd94d JB |
777 | void mesh_path_discard_frame(struct ieee80211_sub_if_data *sdata, |
778 | struct sk_buff *skb) | |
eb2b9311 | 779 | { |
eb2b9311 | 780 | kfree_skb(skb); |
472dbc45 | 781 | sdata->u.mesh.mshstats.dropped_frames_no_route++; |
eb2b9311 LCC |
782 | } |
783 | ||
784 | /** | |
785 | * mesh_path_flush_pending - free the pending queue of a mesh path | |
786 | * | |
787 | * @mpath: mesh path whose queue has to be freed | |
788 | * | |
25985edc | 789 | * Locking: the function must me called within a rcu_read_lock region |
eb2b9311 LCC |
790 | */ |
791 | void mesh_path_flush_pending(struct mesh_path *mpath) | |
792 | { | |
eb2b9311 LCC |
793 | struct sk_buff *skb; |
794 | ||
00e3f25c | 795 | while ((skb = skb_dequeue(&mpath->frame_queue)) != NULL) |
bf7cd94d | 796 | mesh_path_discard_frame(mpath->sdata, skb); |
eb2b9311 LCC |
797 | } |
798 | ||
799 | /** | |
800 | * mesh_path_fix_nexthop - force a specific next hop for a mesh path | |
801 | * | |
802 | * @mpath: the mesh path to modify | |
803 | * @next_hop: the next hop to force | |
804 | * | |
805 | * Locking: this function must be called holding mpath->state_lock | |
806 | */ | |
807 | void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop) | |
808 | { | |
809 | spin_lock_bh(&mpath->state_lock); | |
810 | mesh_path_assign_nexthop(mpath, next_hop); | |
d19b3bf6 | 811 | mpath->sn = 0xffff; |
eb2b9311 LCC |
812 | mpath->metric = 0; |
813 | mpath->hop_count = 0; | |
814 | mpath->exp_time = 0; | |
5df20f21 | 815 | mpath->flags = MESH_PATH_FIXED | MESH_PATH_SN_VALID; |
eb2b9311 LCC |
816 | mesh_path_activate(mpath); |
817 | spin_unlock_bh(&mpath->state_lock); | |
3eb0928f MR |
818 | ewma_mesh_fail_avg_init(&next_hop->mesh->fail_avg); |
819 | /* init it at a low value - 0 start is tricky */ | |
820 | ewma_mesh_fail_avg_add(&next_hop->mesh->fail_avg, 1); | |
eb2b9311 LCC |
821 | mesh_path_tx_pending(mpath); |
822 | } | |
823 | ||
2bdaf386 | 824 | int mesh_pathtbl_init(struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 825 | { |
349eb8cf | 826 | struct mesh_table *tbl_path, *tbl_mpp; |
4c5ade41 | 827 | int ret; |
349eb8cf | 828 | |
60854fd9 | 829 | tbl_path = mesh_table_alloc(); |
349eb8cf | 830 | if (!tbl_path) |
79617dee | 831 | return -ENOMEM; |
5ee68e5b | 832 | |
60854fd9 | 833 | tbl_mpp = mesh_table_alloc(); |
349eb8cf | 834 | if (!tbl_mpp) { |
4c5ade41 DC |
835 | ret = -ENOMEM; |
836 | goto free_path; | |
79617dee | 837 | } |
349eb8cf | 838 | |
60854fd9 BC |
839 | rhashtable_init(&tbl_path->rhead, &mesh_rht_params); |
840 | rhashtable_init(&tbl_mpp->rhead, &mesh_rht_params); | |
2bdaf386 | 841 | |
60854fd9 BC |
842 | sdata->u.mesh.mesh_paths = tbl_path; |
843 | sdata->u.mesh.mpp_paths = tbl_mpp; | |
79617dee | 844 | |
eb2b9311 | 845 | return 0; |
4c5ade41 | 846 | |
4c5ade41 | 847 | free_path: |
60854fd9 | 848 | mesh_table_free(tbl_path); |
4c5ade41 | 849 | return ret; |
eb2b9311 LCC |
850 | } |
851 | ||
60854fd9 BC |
852 | static |
853 | void mesh_path_tbl_expire(struct ieee80211_sub_if_data *sdata, | |
854 | struct mesh_table *tbl) | |
eb2b9311 LCC |
855 | { |
856 | struct mesh_path *mpath; | |
60854fd9 BC |
857 | struct rhashtable_iter iter; |
858 | int ret; | |
eb2b9311 | 859 | |
60854fd9 BC |
860 | ret = rhashtable_walk_init(&tbl->rhead, &iter, GFP_KERNEL); |
861 | if (ret) | |
862 | return; | |
863 | ||
97a6ec4a | 864 | rhashtable_walk_start(&iter); |
60854fd9 BC |
865 | |
866 | while ((mpath = rhashtable_walk_next(&iter))) { | |
867 | if (IS_ERR(mpath) && PTR_ERR(mpath) == -EAGAIN) | |
868 | continue; | |
869 | if (IS_ERR(mpath)) | |
870 | break; | |
eb2b9311 LCC |
871 | if ((!(mpath->flags & MESH_PATH_RESOLVING)) && |
872 | (!(mpath->flags & MESH_PATH_FIXED)) && | |
f5e50cd0 | 873 | time_after(jiffies, mpath->exp_time + MESH_PATH_EXPIRE)) |
60854fd9 | 874 | __mesh_path_del(tbl, mpath); |
ab1c7906 | 875 | } |
97a6ec4a | 876 | |
60854fd9 BC |
877 | rhashtable_walk_stop(&iter); |
878 | rhashtable_walk_exit(&iter); | |
879 | } | |
ab1c7906 | 880 | |
60854fd9 BC |
881 | void mesh_path_expire(struct ieee80211_sub_if_data *sdata) |
882 | { | |
883 | mesh_path_tbl_expire(sdata, sdata->u.mesh.mesh_paths); | |
884 | mesh_path_tbl_expire(sdata, sdata->u.mesh.mpp_paths); | |
eb2b9311 LCC |
885 | } |
886 | ||
2bdaf386 | 887 | void mesh_pathtbl_unregister(struct ieee80211_sub_if_data *sdata) |
eb2b9311 | 888 | { |
60854fd9 BC |
889 | mesh_table_free(sdata->u.mesh.mesh_paths); |
890 | mesh_table_free(sdata->u.mesh.mpp_paths); | |
eb2b9311 | 891 | } |