types.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /*
  2. * Copyright (C) 2007-2012 B.A.T.M.A.N. contributors:
  3. *
  4. * Marek Lindner, Simon Wunderlich
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of version 2 of the GNU General Public
  8. * License as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18. * 02110-1301, USA
  19. *
  20. */
  21. #ifndef _NET_BATMAN_ADV_TYPES_H_
  22. #define _NET_BATMAN_ADV_TYPES_H_
  23. #include "packet.h"
  24. #include "bitarray.h"
  25. #define BAT_HEADER_LEN (sizeof(struct ethhdr) + \
  26. ((sizeof(struct unicast_packet) > sizeof(struct bcast_packet) ? \
  27. sizeof(struct unicast_packet) : \
  28. sizeof(struct bcast_packet))))
  29. struct hard_iface {
  30. struct list_head list;
  31. int16_t if_num;
  32. char if_status;
  33. struct net_device *net_dev;
  34. atomic_t seqno;
  35. atomic_t frag_seqno;
  36. unsigned char *packet_buff;
  37. int packet_len;
  38. struct kobject *hardif_obj;
  39. atomic_t refcount;
  40. struct packet_type batman_adv_ptype;
  41. struct net_device *soft_iface;
  42. struct rcu_head rcu;
  43. };
  44. /**
  45. * orig_node - structure for orig_list maintaining nodes of mesh
  46. * @primary_addr: hosts primary interface address
  47. * @last_valid: when last packet from this node was received
  48. * @bcast_seqno_reset: time when the broadcast seqno window was reset
  49. * @batman_seqno_reset: time when the batman seqno window was reset
  50. * @gw_flags: flags related to gateway class
  51. * @flags: for now only VIS_SERVER flag
  52. * @last_real_seqno: last and best known sequence number
  53. * @last_ttl: ttl of last received packet
  54. * @last_bcast_seqno: last broadcast sequence number received by this host
  55. *
  56. * @candidates: how many candidates are available
  57. * @selected: next bonding candidate
  58. */
  59. struct orig_node {
  60. uint8_t orig[ETH_ALEN];
  61. uint8_t primary_addr[ETH_ALEN];
  62. struct neigh_node __rcu *router; /* rcu protected pointer */
  63. unsigned long *bcast_own;
  64. uint8_t *bcast_own_sum;
  65. unsigned long last_valid;
  66. unsigned long bcast_seqno_reset;
  67. unsigned long batman_seqno_reset;
  68. uint8_t gw_flags;
  69. uint8_t flags;
  70. atomic_t last_ttvn; /* last seen translation table version number */
  71. uint16_t tt_crc;
  72. unsigned char *tt_buff;
  73. int16_t tt_buff_len;
  74. spinlock_t tt_buff_lock; /* protects tt_buff */
  75. atomic_t tt_size;
  76. bool tt_initialised;
  77. /* The tt_poss_change flag is used to detect an ongoing roaming phase.
  78. * If true, then I sent a Roaming_adv to this orig_node and I have to
  79. * inspect every packet directed to it to check whether it is still
  80. * the true destination or not. This flag will be reset to false as
  81. * soon as I receive a new TTVN from this orig_node */
  82. bool tt_poss_change;
  83. uint32_t last_real_seqno;
  84. uint8_t last_ttl;
  85. unsigned long bcast_bits[NUM_WORDS];
  86. uint32_t last_bcast_seqno;
  87. struct hlist_head neigh_list;
  88. struct list_head frag_list;
  89. spinlock_t neigh_list_lock; /* protects neigh_list and router */
  90. atomic_t refcount;
  91. struct rcu_head rcu;
  92. struct hlist_node hash_entry;
  93. struct bat_priv *bat_priv;
  94. unsigned long last_frag_packet;
  95. /* ogm_cnt_lock protects: bcast_own, bcast_own_sum,
  96. * neigh_node->real_bits, neigh_node->real_packet_count */
  97. spinlock_t ogm_cnt_lock;
  98. /* bcast_seqno_lock protects bcast_bits, last_bcast_seqno */
  99. spinlock_t bcast_seqno_lock;
  100. spinlock_t tt_list_lock; /* protects tt_list */
  101. atomic_t bond_candidates;
  102. struct list_head bond_list;
  103. };
  104. struct gw_node {
  105. struct hlist_node list;
  106. struct orig_node *orig_node;
  107. unsigned long deleted;
  108. atomic_t refcount;
  109. struct rcu_head rcu;
  110. };
  111. /**
  112. * neigh_node
  113. * @last_valid: when last packet via this neighbor was received
  114. */
  115. struct neigh_node {
  116. struct hlist_node list;
  117. uint8_t addr[ETH_ALEN];
  118. uint8_t real_packet_count;
  119. uint8_t tq_recv[TQ_GLOBAL_WINDOW_SIZE];
  120. uint8_t tq_index;
  121. uint8_t tq_avg;
  122. uint8_t last_ttl;
  123. struct list_head bonding_list;
  124. unsigned long last_valid;
  125. unsigned long real_bits[NUM_WORDS];
  126. atomic_t refcount;
  127. struct rcu_head rcu;
  128. struct orig_node *orig_node;
  129. struct hard_iface *if_incoming;
  130. spinlock_t tq_lock; /* protects: tq_recv, tq_index */
  131. };
  132. struct bat_priv {
  133. atomic_t mesh_state;
  134. struct net_device_stats stats;
  135. atomic_t aggregated_ogms; /* boolean */
  136. atomic_t bonding; /* boolean */
  137. atomic_t fragmentation; /* boolean */
  138. atomic_t ap_isolation; /* boolean */
  139. atomic_t vis_mode; /* VIS_TYPE_* */
  140. atomic_t gw_mode; /* GW_MODE_* */
  141. atomic_t gw_sel_class; /* uint */
  142. atomic_t gw_bandwidth; /* gw bandwidth */
  143. atomic_t orig_interval; /* uint */
  144. atomic_t hop_penalty; /* uint */
  145. atomic_t log_level; /* uint */
  146. atomic_t bcast_seqno;
  147. atomic_t bcast_queue_left;
  148. atomic_t batman_queue_left;
  149. atomic_t ttvn; /* translation table version number */
  150. atomic_t tt_ogm_append_cnt;
  151. atomic_t tt_local_changes; /* changes registered in a OGM interval */
  152. /* The tt_poss_change flag is used to detect an ongoing roaming phase.
  153. * If true, then I received a Roaming_adv and I have to inspect every
  154. * packet directed to me to check whether I am still the true
  155. * destination or not. This flag will be reset to false as soon as I
  156. * increase my TTVN */
  157. bool tt_poss_change;
  158. char num_ifaces;
  159. struct debug_log *debug_log;
  160. struct kobject *mesh_obj;
  161. struct dentry *debug_dir;
  162. struct hlist_head forw_bat_list;
  163. struct hlist_head forw_bcast_list;
  164. struct hlist_head gw_list;
  165. struct hlist_head softif_neigh_vids;
  166. struct list_head tt_changes_list; /* tracks changes in a OGM int */
  167. struct list_head vis_send_list;
  168. struct hashtable_t *orig_hash;
  169. struct hashtable_t *tt_local_hash;
  170. struct hashtable_t *tt_global_hash;
  171. struct list_head tt_req_list; /* list of pending tt_requests */
  172. struct list_head tt_roam_list;
  173. struct hashtable_t *vis_hash;
  174. spinlock_t forw_bat_list_lock; /* protects forw_bat_list */
  175. spinlock_t forw_bcast_list_lock; /* protects */
  176. spinlock_t tt_changes_list_lock; /* protects tt_changes */
  177. spinlock_t tt_req_list_lock; /* protects tt_req_list */
  178. spinlock_t tt_roam_list_lock; /* protects tt_roam_list */
  179. spinlock_t gw_list_lock; /* protects gw_list and curr_gw */
  180. spinlock_t vis_hash_lock; /* protects vis_hash */
  181. spinlock_t vis_list_lock; /* protects vis_info::recv_list */
  182. spinlock_t softif_neigh_lock; /* protects soft-interface neigh list */
  183. spinlock_t softif_neigh_vid_lock; /* protects soft-interface vid list */
  184. atomic_t num_local_tt;
  185. /* Checksum of the local table, recomputed before sending a new OGM */
  186. atomic_t tt_crc;
  187. unsigned char *tt_buff;
  188. int16_t tt_buff_len;
  189. spinlock_t tt_buff_lock; /* protects tt_buff */
  190. struct delayed_work tt_work;
  191. struct delayed_work orig_work;
  192. struct delayed_work vis_work;
  193. struct gw_node __rcu *curr_gw; /* rcu protected pointer */
  194. atomic_t gw_reselect;
  195. struct hard_iface __rcu *primary_if; /* rcu protected pointer */
  196. struct vis_info *my_vis_info;
  197. struct bat_algo_ops *bat_algo_ops;
  198. };
  199. struct socket_client {
  200. struct list_head queue_list;
  201. unsigned int queue_len;
  202. unsigned char index;
  203. spinlock_t lock; /* protects queue_list, queue_len, index */
  204. wait_queue_head_t queue_wait;
  205. struct bat_priv *bat_priv;
  206. };
  207. struct socket_packet {
  208. struct list_head list;
  209. size_t icmp_len;
  210. struct icmp_packet_rr icmp_packet;
  211. };
  212. struct tt_common_entry {
  213. uint8_t addr[ETH_ALEN];
  214. struct hlist_node hash_entry;
  215. uint16_t flags;
  216. atomic_t refcount;
  217. struct rcu_head rcu;
  218. };
  219. struct tt_local_entry {
  220. struct tt_common_entry common;
  221. unsigned long last_seen;
  222. };
  223. struct tt_global_entry {
  224. struct tt_common_entry common;
  225. struct orig_node *orig_node;
  226. uint8_t ttvn;
  227. unsigned long roam_at; /* time at which TT_GLOBAL_ROAM was set */
  228. };
  229. struct tt_change_node {
  230. struct list_head list;
  231. struct tt_change change;
  232. };
  233. struct tt_req_node {
  234. uint8_t addr[ETH_ALEN];
  235. unsigned long issued_at;
  236. struct list_head list;
  237. };
  238. struct tt_roam_node {
  239. uint8_t addr[ETH_ALEN];
  240. atomic_t counter;
  241. unsigned long first_time;
  242. struct list_head list;
  243. };
  244. /**
  245. * forw_packet - structure for forw_list maintaining packets to be
  246. * send/forwarded
  247. */
  248. struct forw_packet {
  249. struct hlist_node list;
  250. unsigned long send_time;
  251. uint8_t own;
  252. struct sk_buff *skb;
  253. uint16_t packet_len;
  254. uint32_t direct_link_flags;
  255. uint8_t num_packets;
  256. struct delayed_work delayed_work;
  257. struct hard_iface *if_incoming;
  258. };
  259. /* While scanning for vis-entries of a particular vis-originator
  260. * this list collects its interfaces to create a subgraph/cluster
  261. * out of them later
  262. */
  263. struct if_list_entry {
  264. uint8_t addr[ETH_ALEN];
  265. bool primary;
  266. struct hlist_node list;
  267. };
  268. struct debug_log {
  269. char log_buff[LOG_BUF_LEN];
  270. unsigned long log_start;
  271. unsigned long log_end;
  272. spinlock_t lock; /* protects log_buff, log_start and log_end */
  273. wait_queue_head_t queue_wait;
  274. };
  275. struct frag_packet_list_entry {
  276. struct list_head list;
  277. uint16_t seqno;
  278. struct sk_buff *skb;
  279. };
  280. struct vis_info {
  281. unsigned long first_seen;
  282. /* list of server-neighbors we received a vis-packet
  283. * from. we should not reply to them. */
  284. struct list_head recv_list;
  285. struct list_head send_list;
  286. struct kref refcount;
  287. struct hlist_node hash_entry;
  288. struct bat_priv *bat_priv;
  289. /* this packet might be part of the vis send queue. */
  290. struct sk_buff *skb_packet;
  291. /* vis_info may follow here*/
  292. } __packed;
  293. struct vis_info_entry {
  294. uint8_t src[ETH_ALEN];
  295. uint8_t dest[ETH_ALEN];
  296. uint8_t quality; /* quality = 0 client */
  297. } __packed;
  298. struct recvlist_node {
  299. struct list_head list;
  300. uint8_t mac[ETH_ALEN];
  301. };
  302. struct softif_neigh_vid {
  303. struct hlist_node list;
  304. struct bat_priv *bat_priv;
  305. short vid;
  306. atomic_t refcount;
  307. struct softif_neigh __rcu *softif_neigh;
  308. struct rcu_head rcu;
  309. struct hlist_head softif_neigh_list;
  310. };
  311. struct softif_neigh {
  312. struct hlist_node list;
  313. uint8_t addr[ETH_ALEN];
  314. unsigned long last_seen;
  315. atomic_t refcount;
  316. struct rcu_head rcu;
  317. };
  318. struct bat_algo_ops {
  319. struct hlist_node list;
  320. char *name;
  321. /* init OGM when hard-interface is enabled */
  322. void (*bat_ogm_init)(struct hard_iface *hard_iface);
  323. /* init primary OGM when primary interface is selected */
  324. void (*bat_ogm_init_primary)(struct hard_iface *hard_iface);
  325. /* init mac addresses of the OGM belonging to this hard-interface */
  326. void (*bat_ogm_update_mac)(struct hard_iface *hard_iface);
  327. /* prepare a new outgoing OGM for the send queue */
  328. void (*bat_ogm_schedule)(struct hard_iface *hard_iface,
  329. int tt_num_changes);
  330. /* send scheduled OGM */
  331. void (*bat_ogm_emit)(struct forw_packet *forw_packet);
  332. /* receive incoming OGM */
  333. void (*bat_ogm_receive)(struct hard_iface *if_incoming,
  334. struct sk_buff *skb);
  335. };
  336. #endif /* _NET_BATMAN_ADV_TYPES_H_ */