mesh_pathtbl.c 23 KB

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