mesh.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /*
  2. * Copyright (c) 2008, 2009 open80211s Ltd.
  3. * Authors: Luis Carlos Cobo <luisca@cozybit.com>
  4. * Javier Cardona <javier@cozybit.com>
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License version 2 as
  8. * published by the Free Software Foundation.
  9. */
  10. #ifndef IEEE80211S_H
  11. #define IEEE80211S_H
  12. #include <linux/types.h>
  13. #include <linux/jhash.h>
  14. #include "ieee80211_i.h"
  15. /* Data structures */
  16. /**
  17. * enum mesh_config_capab_flags - mesh config IE capability flags
  18. *
  19. * @MESHCONF_CAPAB_ACCEPT_PLINKS: STA is willing to establish
  20. * additional mesh peerings with other mesh STAs
  21. * @MESHCONF_CAPAB_FORWARDING: the STA forwards MSDUs
  22. * @MESHCONF_CAPAB_TBTT_ADJUSTING: TBTT adjustment procedure is ongoing
  23. */
  24. enum mesh_config_capab_flags {
  25. MESHCONF_CAPAB_ACCEPT_PLINKS = BIT(0),
  26. MESHCONF_CAPAB_FORWARDING = BIT(3),
  27. MESHCONF_CAPAB_TBTT_ADJUSTING = BIT(5),
  28. };
  29. /**
  30. * enum mesh_path_flags - mac80211 mesh path flags
  31. *
  32. *
  33. *
  34. * @MESH_PATH_ACTIVE: the mesh path can be used for forwarding
  35. * @MESH_PATH_RESOLVING: the discovery process is running for this mesh path
  36. * @MESH_PATH_SN_VALID: the mesh path contains a valid destination sequence
  37. * number
  38. * @MESH_PATH_FIXED: the mesh path has been manually set and should not be
  39. * modified
  40. * @MESH_PATH_RESOLVED: the mesh path can has been resolved
  41. * @MESH_PATH_REQ_QUEUED: there is an unsent path request for this destination
  42. * already queued up, waiting for the discovery process to start.
  43. *
  44. * MESH_PATH_RESOLVED is used by the mesh path timer to
  45. * decide when to stop or cancel the mesh path discovery.
  46. */
  47. enum mesh_path_flags {
  48. MESH_PATH_ACTIVE = BIT(0),
  49. MESH_PATH_RESOLVING = BIT(1),
  50. MESH_PATH_SN_VALID = BIT(2),
  51. MESH_PATH_FIXED = BIT(3),
  52. MESH_PATH_RESOLVED = BIT(4),
  53. MESH_PATH_REQ_QUEUED = BIT(5),
  54. };
  55. /**
  56. * enum mesh_deferred_task_flags - mac80211 mesh deferred tasks
  57. *
  58. *
  59. *
  60. * @MESH_WORK_HOUSEKEEPING: run the periodic mesh housekeeping tasks
  61. * @MESH_WORK_GROW_MPATH_TABLE: the mesh path table is full and needs
  62. * to grow.
  63. * @MESH_WORK_GROW_MPP_TABLE: the mesh portals table is full and needs to
  64. * grow
  65. * @MESH_WORK_ROOT: the mesh root station needs to send a frame
  66. * @MESH_WORK_DRIFT_ADJUST: time to compensate for clock drift relative to other
  67. * mesh nodes
  68. */
  69. enum mesh_deferred_task_flags {
  70. MESH_WORK_HOUSEKEEPING,
  71. MESH_WORK_GROW_MPATH_TABLE,
  72. MESH_WORK_GROW_MPP_TABLE,
  73. MESH_WORK_ROOT,
  74. MESH_WORK_DRIFT_ADJUST,
  75. };
  76. /**
  77. * struct mesh_path - mac80211 mesh path structure
  78. *
  79. * @dst: mesh path destination mac address
  80. * @sdata: mesh subif
  81. * @next_hop: mesh neighbor to which frames for this destination will be
  82. * forwarded
  83. * @timer: mesh path discovery timer
  84. * @frame_queue: pending queue for frames sent to this destination while the
  85. * path is unresolved
  86. * @sn: target sequence number
  87. * @metric: current metric to this destination
  88. * @hop_count: hops to destination
  89. * @exp_time: in jiffies, when the path will expire or when it expired
  90. * @discovery_timeout: timeout (lapse in jiffies) used for the last discovery
  91. * retry
  92. * @discovery_retries: number of discovery retries
  93. * @flags: mesh path flags, as specified on &enum mesh_path_flags
  94. * @state_lock: mesh path state lock used to protect changes to the
  95. * mpath itself. No need to take this lock when adding or removing
  96. * an mpath to a hash bucket on a path table.
  97. * @rann_snd_addr: the RANN sender address
  98. * @rann_metric: the aggregated path metric towards the root node
  99. * @last_preq_to_root: Timestamp of last PREQ sent to root
  100. * @is_root: the destination station of this path is a root node
  101. * @is_gate: the destination station of this path is a mesh gate
  102. *
  103. *
  104. * The combination of dst and sdata is unique in the mesh path table. Since the
  105. * next_hop STA is only protected by RCU as well, deleting the STA must also
  106. * remove/substitute the mesh_path structure and wait until that is no longer
  107. * reachable before destroying the STA completely.
  108. */
  109. struct mesh_path {
  110. u8 dst[ETH_ALEN];
  111. u8 mpp[ETH_ALEN]; /* used for MPP or MAP */
  112. struct ieee80211_sub_if_data *sdata;
  113. struct sta_info __rcu *next_hop;
  114. struct timer_list timer;
  115. struct sk_buff_head frame_queue;
  116. struct rcu_head rcu;
  117. u32 sn;
  118. u32 metric;
  119. u8 hop_count;
  120. unsigned long exp_time;
  121. u32 discovery_timeout;
  122. u8 discovery_retries;
  123. enum mesh_path_flags flags;
  124. spinlock_t state_lock;
  125. u8 rann_snd_addr[ETH_ALEN];
  126. u32 rann_metric;
  127. unsigned long last_preq_to_root;
  128. bool is_root;
  129. bool is_gate;
  130. };
  131. /**
  132. * struct mesh_table
  133. *
  134. * @hash_buckets: array of hash buckets of the table
  135. * @hashwlock: array of locks to protect write operations, one per bucket
  136. * @hash_mask: 2^size_order - 1, used to compute hash idx
  137. * @hash_rnd: random value used for hash computations
  138. * @entries: number of entries in the table
  139. * @free_node: function to free nodes of the table
  140. * @copy_node: function to copy nodes of the table
  141. * @size_order: determines size of the table, there will be 2^size_order hash
  142. * buckets
  143. * @mean_chain_len: maximum average length for the hash buckets' list, if it is
  144. * reached, the table will grow
  145. * @known_gates: list of known mesh gates and their mpaths by the station. The
  146. * gate's mpath may or may not be resolved and active.
  147. *
  148. * rcu_head: RCU head to free the table
  149. */
  150. struct mesh_table {
  151. /* Number of buckets will be 2^N */
  152. struct hlist_head *hash_buckets;
  153. spinlock_t *hashwlock; /* One per bucket, for add/del */
  154. unsigned int hash_mask; /* (2^size_order) - 1 */
  155. __u32 hash_rnd; /* Used for hash generation */
  156. atomic_t entries; /* Up to MAX_MESH_NEIGHBOURS */
  157. void (*free_node) (struct hlist_node *p, bool free_leafs);
  158. int (*copy_node) (struct hlist_node *p, struct mesh_table *newtbl);
  159. int size_order;
  160. int mean_chain_len;
  161. struct hlist_head *known_gates;
  162. spinlock_t gates_lock;
  163. struct rcu_head rcu_head;
  164. };
  165. /* Recent multicast cache */
  166. /* RMC_BUCKETS must be a power of 2, maximum 256 */
  167. #define RMC_BUCKETS 256
  168. #define RMC_QUEUE_MAX_LEN 4
  169. #define RMC_TIMEOUT (3 * HZ)
  170. /**
  171. * struct rmc_entry - entry in the Recent Multicast Cache
  172. *
  173. * @seqnum: mesh sequence number of the frame
  174. * @exp_time: expiration time of the entry, in jiffies
  175. * @sa: source address of the frame
  176. *
  177. * The Recent Multicast Cache keeps track of the latest multicast frames that
  178. * have been received by a mesh interface and discards received multicast frames
  179. * that are found in the cache.
  180. */
  181. struct rmc_entry {
  182. struct list_head list;
  183. u32 seqnum;
  184. unsigned long exp_time;
  185. u8 sa[ETH_ALEN];
  186. };
  187. struct mesh_rmc {
  188. struct rmc_entry bucket[RMC_BUCKETS];
  189. u32 idx_mask;
  190. };
  191. #define IEEE80211_MESH_PEER_INACTIVITY_LIMIT (1800 * HZ)
  192. #define IEEE80211_MESH_HOUSEKEEPING_INTERVAL (60 * HZ)
  193. #define MESH_DEFAULT_BEACON_INTERVAL 1000 /* in 1024 us units */
  194. #define MESH_PATH_EXPIRE (600 * HZ)
  195. /* Default maximum number of plinks per interface */
  196. #define MESH_MAX_PLINKS 256
  197. /* Maximum number of paths per interface */
  198. #define MESH_MAX_MPATHS 1024
  199. /* Public interfaces */
  200. /* Various */
  201. int ieee80211_fill_mesh_addresses(struct ieee80211_hdr *hdr, __le16 *fc,
  202. const u8 *da, const u8 *sa);
  203. int ieee80211_new_mesh_header(struct ieee80211s_hdr *meshhdr,
  204. struct ieee80211_sub_if_data *sdata, char *addr4or5,
  205. char *addr6);
  206. int mesh_rmc_check(u8 *addr, struct ieee80211s_hdr *mesh_hdr,
  207. struct ieee80211_sub_if_data *sdata);
  208. bool mesh_matches_local(struct ieee80211_sub_if_data *sdata,
  209. struct ieee802_11_elems *ie);
  210. void mesh_ids_set_default(struct ieee80211_if_mesh *mesh);
  211. void mesh_mgmt_ies_add(struct sk_buff *skb,
  212. struct ieee80211_sub_if_data *sdata);
  213. int mesh_add_meshconf_ie(struct sk_buff *skb,
  214. struct ieee80211_sub_if_data *sdata);
  215. int mesh_add_meshid_ie(struct sk_buff *skb,
  216. struct ieee80211_sub_if_data *sdata);
  217. int mesh_add_rsn_ie(struct sk_buff *skb,
  218. struct ieee80211_sub_if_data *sdata);
  219. int mesh_add_vendor_ies(struct sk_buff *skb,
  220. struct ieee80211_sub_if_data *sdata);
  221. int mesh_add_ds_params_ie(struct sk_buff *skb,
  222. struct ieee80211_sub_if_data *sdata);
  223. int mesh_add_ht_cap_ie(struct sk_buff *skb,
  224. struct ieee80211_sub_if_data *sdata);
  225. int mesh_add_ht_oper_ie(struct sk_buff *skb,
  226. struct ieee80211_sub_if_data *sdata);
  227. void mesh_rmc_free(struct ieee80211_sub_if_data *sdata);
  228. int mesh_rmc_init(struct ieee80211_sub_if_data *sdata);
  229. void ieee80211s_init(void);
  230. void ieee80211s_update_metric(struct ieee80211_local *local,
  231. struct sta_info *sta, struct sk_buff *skb);
  232. void ieee80211s_stop(void);
  233. void ieee80211_mesh_init_sdata(struct ieee80211_sub_if_data *sdata);
  234. void ieee80211_start_mesh(struct ieee80211_sub_if_data *sdata);
  235. void ieee80211_stop_mesh(struct ieee80211_sub_if_data *sdata);
  236. void ieee80211_mesh_root_setup(struct ieee80211_if_mesh *ifmsh);
  237. struct ieee80211_mesh_sync_ops *ieee80211_mesh_sync_ops_get(u8 method);
  238. /* Mesh paths */
  239. int mesh_nexthop_lookup(struct sk_buff *skb,
  240. struct ieee80211_sub_if_data *sdata);
  241. int mesh_nexthop_resolve(struct sk_buff *skb,
  242. struct ieee80211_sub_if_data *sdata);
  243. void mesh_path_start_discovery(struct ieee80211_sub_if_data *sdata);
  244. struct mesh_path *mesh_path_lookup(u8 *dst,
  245. struct ieee80211_sub_if_data *sdata);
  246. struct mesh_path *mpp_path_lookup(u8 *dst,
  247. struct ieee80211_sub_if_data *sdata);
  248. int mpp_path_add(u8 *dst, u8 *mpp, struct ieee80211_sub_if_data *sdata);
  249. struct mesh_path *mesh_path_lookup_by_idx(int idx,
  250. struct ieee80211_sub_if_data *sdata);
  251. void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop);
  252. void mesh_path_expire(struct ieee80211_sub_if_data *sdata);
  253. void mesh_rx_path_sel_frame(struct ieee80211_sub_if_data *sdata,
  254. struct ieee80211_mgmt *mgmt, size_t len);
  255. int mesh_path_add(u8 *dst, struct ieee80211_sub_if_data *sdata);
  256. int mesh_path_add_gate(struct mesh_path *mpath);
  257. int mesh_path_send_to_gates(struct mesh_path *mpath);
  258. int mesh_gate_num(struct ieee80211_sub_if_data *sdata);
  259. /* Mesh plinks */
  260. void mesh_neighbour_update(struct ieee80211_sub_if_data *sdata,
  261. u8 *hw_addr,
  262. struct ieee802_11_elems *ie);
  263. bool mesh_peer_accepts_plinks(struct ieee802_11_elems *ie);
  264. void mesh_accept_plinks_update(struct ieee80211_sub_if_data *sdata);
  265. void mesh_plink_broken(struct sta_info *sta);
  266. void mesh_plink_deactivate(struct sta_info *sta);
  267. int mesh_plink_open(struct sta_info *sta);
  268. void mesh_plink_block(struct sta_info *sta);
  269. void mesh_rx_plink_frame(struct ieee80211_sub_if_data *sdata,
  270. struct ieee80211_mgmt *mgmt, size_t len,
  271. struct ieee80211_rx_status *rx_status);
  272. /* Private interfaces */
  273. /* Mesh tables */
  274. void mesh_mpath_table_grow(void);
  275. void mesh_mpp_table_grow(void);
  276. /* Mesh paths */
  277. int mesh_path_error_tx(u8 ttl, u8 *target, __le32 target_sn, __le16 target_rcode,
  278. const u8 *ra, struct ieee80211_sub_if_data *sdata);
  279. void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta);
  280. void mesh_path_flush_pending(struct mesh_path *mpath);
  281. void mesh_path_tx_pending(struct mesh_path *mpath);
  282. int mesh_pathtbl_init(void);
  283. void mesh_pathtbl_unregister(void);
  284. int mesh_path_del(u8 *addr, struct ieee80211_sub_if_data *sdata);
  285. void mesh_path_timer(unsigned long data);
  286. void mesh_path_flush_by_nexthop(struct sta_info *sta);
  287. void mesh_path_discard_frame(struct sk_buff *skb,
  288. struct ieee80211_sub_if_data *sdata);
  289. void mesh_path_quiesce(struct ieee80211_sub_if_data *sdata);
  290. void mesh_path_restart(struct ieee80211_sub_if_data *sdata);
  291. void mesh_path_tx_root_frame(struct ieee80211_sub_if_data *sdata);
  292. bool mesh_action_is_path_sel(struct ieee80211_mgmt *mgmt);
  293. extern int mesh_paths_generation;
  294. #ifdef CONFIG_MAC80211_MESH
  295. extern int mesh_allocated;
  296. static inline int mesh_plink_free_count(struct ieee80211_sub_if_data *sdata)
  297. {
  298. return sdata->u.mesh.mshcfg.dot11MeshMaxPeerLinks -
  299. atomic_read(&sdata->u.mesh.mshstats.estab_plinks);
  300. }
  301. static inline bool mesh_plink_availables(struct ieee80211_sub_if_data *sdata)
  302. {
  303. return (min_t(long, mesh_plink_free_count(sdata),
  304. MESH_MAX_PLINKS - sdata->local->num_sta)) > 0;
  305. }
  306. static inline void mesh_path_activate(struct mesh_path *mpath)
  307. {
  308. mpath->flags |= MESH_PATH_ACTIVE | MESH_PATH_RESOLVED;
  309. }
  310. static inline bool mesh_path_sel_is_hwmp(struct ieee80211_sub_if_data *sdata)
  311. {
  312. return sdata->u.mesh.mesh_pp_id == IEEE80211_PATH_PROTOCOL_HWMP;
  313. }
  314. void ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local);
  315. void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata);
  316. void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata);
  317. void mesh_plink_quiesce(struct sta_info *sta);
  318. void mesh_plink_restart(struct sta_info *sta);
  319. void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata);
  320. void mesh_sync_adjust_tbtt(struct ieee80211_sub_if_data *sdata);
  321. #else
  322. #define mesh_allocated 0
  323. static inline void
  324. ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local) {}
  325. static inline void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata)
  326. {}
  327. static inline void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata)
  328. {}
  329. static inline void mesh_plink_quiesce(struct sta_info *sta) {}
  330. static inline void mesh_plink_restart(struct sta_info *sta) {}
  331. static inline bool mesh_path_sel_is_hwmp(struct ieee80211_sub_if_data *sdata)
  332. { return false; }
  333. static inline void mesh_path_flush_by_iface(struct ieee80211_sub_if_data *sdata)
  334. {}
  335. #endif
  336. #endif /* IEEE80211S_H */