mesh.h 13 KB

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