distributed-arp-table.c 30 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083
  1. /* Copyright (C) 2011-2013 B.A.T.M.A.N. contributors:
  2. *
  3. * Antonio Quartulli
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of version 2 of the GNU General Public
  7. * License as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful, but
  10. * WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  17. * 02110-1301, USA
  18. */
  19. #include <linux/if_ether.h>
  20. #include <linux/if_arp.h>
  21. #include <net/arp.h>
  22. #include "main.h"
  23. #include "hash.h"
  24. #include "distributed-arp-table.h"
  25. #include "hard-interface.h"
  26. #include "originator.h"
  27. #include "send.h"
  28. #include "types.h"
  29. #include "translation-table.h"
  30. #include "unicast.h"
  31. static void batadv_dat_purge(struct work_struct *work);
  32. /**
  33. * batadv_dat_start_timer - initialise the DAT periodic worker
  34. * @bat_priv: the bat priv with all the soft interface information
  35. */
  36. static void batadv_dat_start_timer(struct batadv_priv *bat_priv)
  37. {
  38. INIT_DELAYED_WORK(&bat_priv->dat.work, batadv_dat_purge);
  39. queue_delayed_work(batadv_event_workqueue, &bat_priv->dat.work,
  40. msecs_to_jiffies(10000));
  41. }
  42. /**
  43. * batadv_dat_entry_free_ref - decrements the dat_entry refcounter and possibly
  44. * free it
  45. * @dat_entry: the oentry to free
  46. */
  47. static void batadv_dat_entry_free_ref(struct batadv_dat_entry *dat_entry)
  48. {
  49. if (atomic_dec_and_test(&dat_entry->refcount))
  50. kfree_rcu(dat_entry, rcu);
  51. }
  52. /**
  53. * batadv_dat_to_purge - checks whether a dat_entry has to be purged or not
  54. * @dat_entry: the entry to check
  55. *
  56. * Returns true if the entry has to be purged now, false otherwise
  57. */
  58. static bool batadv_dat_to_purge(struct batadv_dat_entry *dat_entry)
  59. {
  60. return batadv_has_timed_out(dat_entry->last_update,
  61. BATADV_DAT_ENTRY_TIMEOUT);
  62. }
  63. /**
  64. * __batadv_dat_purge - delete entries from the DAT local storage
  65. * @bat_priv: the bat priv with all the soft interface information
  66. * @to_purge: function in charge to decide whether an entry has to be purged or
  67. * not. This function takes the dat_entry as argument and has to
  68. * returns a boolean value: true is the entry has to be deleted,
  69. * false otherwise
  70. *
  71. * Loops over each entry in the DAT local storage and delete it if and only if
  72. * the to_purge function passed as argument returns true
  73. */
  74. static void __batadv_dat_purge(struct batadv_priv *bat_priv,
  75. bool (*to_purge)(struct batadv_dat_entry *))
  76. {
  77. spinlock_t *list_lock; /* protects write access to the hash lists */
  78. struct batadv_dat_entry *dat_entry;
  79. struct hlist_node *node, *node_tmp;
  80. struct hlist_head *head;
  81. uint32_t i;
  82. if (!bat_priv->dat.hash)
  83. return;
  84. for (i = 0; i < bat_priv->dat.hash->size; i++) {
  85. head = &bat_priv->dat.hash->table[i];
  86. list_lock = &bat_priv->dat.hash->list_locks[i];
  87. spin_lock_bh(list_lock);
  88. hlist_for_each_entry_safe(dat_entry, node, node_tmp, head,
  89. hash_entry) {
  90. /* if an helper function has been passed as parameter,
  91. * ask it if the entry has to be purged or not
  92. */
  93. if (to_purge && !to_purge(dat_entry))
  94. continue;
  95. hlist_del_rcu(node);
  96. batadv_dat_entry_free_ref(dat_entry);
  97. }
  98. spin_unlock_bh(list_lock);
  99. }
  100. }
  101. /**
  102. * batadv_dat_purge - periodic task that deletes old entries from the local DAT
  103. * hash table
  104. * @work: kernel work struct
  105. */
  106. static void batadv_dat_purge(struct work_struct *work)
  107. {
  108. struct delayed_work *delayed_work;
  109. struct batadv_priv_dat *priv_dat;
  110. struct batadv_priv *bat_priv;
  111. delayed_work = container_of(work, struct delayed_work, work);
  112. priv_dat = container_of(delayed_work, struct batadv_priv_dat, work);
  113. bat_priv = container_of(priv_dat, struct batadv_priv, dat);
  114. __batadv_dat_purge(bat_priv, batadv_dat_to_purge);
  115. batadv_dat_start_timer(bat_priv);
  116. }
  117. /**
  118. * batadv_compare_dat - comparing function used in the local DAT hash table
  119. * @node: node in the local table
  120. * @data2: second object to compare the node to
  121. *
  122. * Returns 1 if the two entry are the same, 0 otherwise
  123. */
  124. static int batadv_compare_dat(const struct hlist_node *node, const void *data2)
  125. {
  126. const void *data1 = container_of(node, struct batadv_dat_entry,
  127. hash_entry);
  128. return (memcmp(data1, data2, sizeof(__be32)) == 0 ? 1 : 0);
  129. }
  130. /**
  131. * batadv_arp_hw_src - extract the hw_src field from an ARP packet
  132. * @skb: ARP packet
  133. * @hdr_size: size of the possible header before the ARP packet
  134. *
  135. * Returns the value of the hw_src field in the ARP packet
  136. */
  137. static uint8_t *batadv_arp_hw_src(struct sk_buff *skb, int hdr_size)
  138. {
  139. uint8_t *addr;
  140. addr = (uint8_t *)(skb->data + hdr_size);
  141. addr += ETH_HLEN + sizeof(struct arphdr);
  142. return addr;
  143. }
  144. /**
  145. * batadv_arp_ip_src - extract the ip_src field from an ARP packet
  146. * @skb: ARP packet
  147. * @hdr_size: size of the possible header before the ARP packet
  148. *
  149. * Returns the value of the ip_src field in the ARP packet
  150. */
  151. static __be32 batadv_arp_ip_src(struct sk_buff *skb, int hdr_size)
  152. {
  153. return *(__be32 *)(batadv_arp_hw_src(skb, hdr_size) + ETH_ALEN);
  154. }
  155. /**
  156. * batadv_arp_hw_dst - extract the hw_dst field from an ARP packet
  157. * @skb: ARP packet
  158. * @hdr_size: size of the possible header before the ARP packet
  159. *
  160. * Returns the value of the hw_dst field in the ARP packet
  161. */
  162. static uint8_t *batadv_arp_hw_dst(struct sk_buff *skb, int hdr_size)
  163. {
  164. return batadv_arp_hw_src(skb, hdr_size) + ETH_ALEN + 4;
  165. }
  166. /**
  167. * batadv_arp_ip_dst - extract the ip_dst field from an ARP packet
  168. * @skb: ARP packet
  169. * @hdr_size: size of the possible header before the ARP packet
  170. *
  171. * Returns the value of the ip_dst field in the ARP packet
  172. */
  173. static __be32 batadv_arp_ip_dst(struct sk_buff *skb, int hdr_size)
  174. {
  175. return *(__be32 *)(batadv_arp_hw_src(skb, hdr_size) + ETH_ALEN * 2 + 4);
  176. }
  177. /**
  178. * batadv_hash_dat - compute the hash value for an IP address
  179. * @data: data to hash
  180. * @size: size of the hash table
  181. *
  182. * Returns the selected index in the hash table for the given data
  183. */
  184. static uint32_t batadv_hash_dat(const void *data, uint32_t size)
  185. {
  186. const unsigned char *key = data;
  187. uint32_t hash = 0;
  188. size_t i;
  189. for (i = 0; i < 4; i++) {
  190. hash += key[i];
  191. hash += (hash << 10);
  192. hash ^= (hash >> 6);
  193. }
  194. hash += (hash << 3);
  195. hash ^= (hash >> 11);
  196. hash += (hash << 15);
  197. return hash % size;
  198. }
  199. /**
  200. * batadv_dat_entry_hash_find - looks for a given dat_entry in the local hash
  201. * table
  202. * @bat_priv: the bat priv with all the soft interface information
  203. * @ip: search key
  204. *
  205. * Returns the dat_entry if found, NULL otherwise
  206. */
  207. static struct batadv_dat_entry *
  208. batadv_dat_entry_hash_find(struct batadv_priv *bat_priv, __be32 ip)
  209. {
  210. struct hlist_head *head;
  211. struct hlist_node *node;
  212. struct batadv_dat_entry *dat_entry, *dat_entry_tmp = NULL;
  213. struct batadv_hashtable *hash = bat_priv->dat.hash;
  214. uint32_t index;
  215. if (!hash)
  216. return NULL;
  217. index = batadv_hash_dat(&ip, hash->size);
  218. head = &hash->table[index];
  219. rcu_read_lock();
  220. hlist_for_each_entry_rcu(dat_entry, node, head, hash_entry) {
  221. if (dat_entry->ip != ip)
  222. continue;
  223. if (!atomic_inc_not_zero(&dat_entry->refcount))
  224. continue;
  225. dat_entry_tmp = dat_entry;
  226. break;
  227. }
  228. rcu_read_unlock();
  229. return dat_entry_tmp;
  230. }
  231. /**
  232. * batadv_dat_entry_add - add a new dat entry or update it if already exists
  233. * @bat_priv: the bat priv with all the soft interface information
  234. * @ip: ipv4 to add/edit
  235. * @mac_addr: mac address to assign to the given ipv4
  236. */
  237. static void batadv_dat_entry_add(struct batadv_priv *bat_priv, __be32 ip,
  238. uint8_t *mac_addr)
  239. {
  240. struct batadv_dat_entry *dat_entry;
  241. int hash_added;
  242. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip);
  243. /* if this entry is already known, just update it */
  244. if (dat_entry) {
  245. if (!batadv_compare_eth(dat_entry->mac_addr, mac_addr))
  246. memcpy(dat_entry->mac_addr, mac_addr, ETH_ALEN);
  247. dat_entry->last_update = jiffies;
  248. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  249. "Entry updated: %pI4 %pM\n", &dat_entry->ip,
  250. dat_entry->mac_addr);
  251. goto out;
  252. }
  253. dat_entry = kmalloc(sizeof(*dat_entry), GFP_ATOMIC);
  254. if (!dat_entry)
  255. goto out;
  256. dat_entry->ip = ip;
  257. memcpy(dat_entry->mac_addr, mac_addr, ETH_ALEN);
  258. dat_entry->last_update = jiffies;
  259. atomic_set(&dat_entry->refcount, 2);
  260. hash_added = batadv_hash_add(bat_priv->dat.hash, batadv_compare_dat,
  261. batadv_hash_dat, &dat_entry->ip,
  262. &dat_entry->hash_entry);
  263. if (unlikely(hash_added != 0)) {
  264. /* remove the reference for the hash */
  265. batadv_dat_entry_free_ref(dat_entry);
  266. goto out;
  267. }
  268. batadv_dbg(BATADV_DBG_DAT, bat_priv, "New entry added: %pI4 %pM\n",
  269. &dat_entry->ip, dat_entry->mac_addr);
  270. out:
  271. if (dat_entry)
  272. batadv_dat_entry_free_ref(dat_entry);
  273. }
  274. #ifdef CONFIG_BATMAN_ADV_DEBUG
  275. /**
  276. * batadv_dbg_arp - print a debug message containing all the ARP packet details
  277. * @bat_priv: the bat priv with all the soft interface information
  278. * @skb: ARP packet
  279. * @type: ARP type
  280. * @hdr_size: size of the possible header before the ARP packet
  281. * @msg: message to print together with the debugging information
  282. */
  283. static void batadv_dbg_arp(struct batadv_priv *bat_priv, struct sk_buff *skb,
  284. uint16_t type, int hdr_size, char *msg)
  285. {
  286. struct batadv_unicast_4addr_packet *unicast_4addr_packet;
  287. struct batadv_bcast_packet *bcast_pkt;
  288. uint8_t *orig_addr;
  289. __be32 ip_src, ip_dst;
  290. if (msg)
  291. batadv_dbg(BATADV_DBG_DAT, bat_priv, "%s\n", msg);
  292. ip_src = batadv_arp_ip_src(skb, hdr_size);
  293. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  294. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  295. "ARP MSG = [src: %pM-%pI4 dst: %pM-%pI4]\n",
  296. batadv_arp_hw_src(skb, hdr_size), &ip_src,
  297. batadv_arp_hw_dst(skb, hdr_size), &ip_dst);
  298. if (hdr_size == 0)
  299. return;
  300. /* if the ARP packet is encapsulated in a batman packet, let's print
  301. * some debug messages
  302. */
  303. unicast_4addr_packet = (struct batadv_unicast_4addr_packet *)skb->data;
  304. switch (unicast_4addr_packet->u.header.packet_type) {
  305. case BATADV_UNICAST:
  306. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  307. "* encapsulated within a UNICAST packet\n");
  308. break;
  309. case BATADV_UNICAST_4ADDR:
  310. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  311. "* encapsulated within a UNICAST_4ADDR packet (src: %pM)\n",
  312. unicast_4addr_packet->src);
  313. switch (unicast_4addr_packet->subtype) {
  314. case BATADV_P_DAT_DHT_PUT:
  315. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DAT_DHT_PUT\n");
  316. break;
  317. case BATADV_P_DAT_DHT_GET:
  318. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DAT_DHT_GET\n");
  319. break;
  320. case BATADV_P_DAT_CACHE_REPLY:
  321. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  322. "* type: DAT_CACHE_REPLY\n");
  323. break;
  324. case BATADV_P_DATA:
  325. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DATA\n");
  326. break;
  327. default:
  328. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: Unknown (%u)!\n",
  329. unicast_4addr_packet->u.header.packet_type);
  330. }
  331. break;
  332. case BATADV_BCAST:
  333. bcast_pkt = (struct batadv_bcast_packet *)unicast_4addr_packet;
  334. orig_addr = bcast_pkt->orig;
  335. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  336. "* encapsulated within a BCAST packet (src: %pM)\n",
  337. orig_addr);
  338. break;
  339. default:
  340. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  341. "* encapsulated within an unknown packet type (0x%x)\n",
  342. unicast_4addr_packet->u.header.packet_type);
  343. }
  344. }
  345. #else
  346. static void batadv_dbg_arp(struct batadv_priv *bat_priv, struct sk_buff *skb,
  347. uint16_t type, int hdr_size, char *msg)
  348. {
  349. }
  350. #endif /* CONFIG_BATMAN_ADV_DEBUG */
  351. /**
  352. * batadv_is_orig_node_eligible - check whether a node can be a DHT candidate
  353. * @res: the array with the already selected candidates
  354. * @select: number of already selected candidates
  355. * @tmp_max: address of the currently evaluated node
  356. * @max: current round max address
  357. * @last_max: address of the last selected candidate
  358. * @candidate: orig_node under evaluation
  359. * @max_orig_node: last selected candidate
  360. *
  361. * Returns true if the node has been elected as next candidate or false othrwise
  362. */
  363. static bool batadv_is_orig_node_eligible(struct batadv_dat_candidate *res,
  364. int select, batadv_dat_addr_t tmp_max,
  365. batadv_dat_addr_t max,
  366. batadv_dat_addr_t last_max,
  367. struct batadv_orig_node *candidate,
  368. struct batadv_orig_node *max_orig_node)
  369. {
  370. bool ret = false;
  371. int j;
  372. /* Check if this node has already been selected... */
  373. for (j = 0; j < select; j++)
  374. if (res[j].orig_node == candidate)
  375. break;
  376. /* ..and possibly skip it */
  377. if (j < select)
  378. goto out;
  379. /* sanity check: has it already been selected? This should not happen */
  380. if (tmp_max > last_max)
  381. goto out;
  382. /* check if during this iteration an originator with a closer dht
  383. * address has already been found
  384. */
  385. if (tmp_max < max)
  386. goto out;
  387. /* this is an hash collision with the temporary selected node. Choose
  388. * the one with the lowest address
  389. */
  390. if ((tmp_max == max) &&
  391. (batadv_compare_eth(candidate->orig, max_orig_node->orig) > 0))
  392. goto out;
  393. ret = true;
  394. out:
  395. return ret;
  396. }
  397. /**
  398. * batadv_choose_next_candidate - select the next DHT candidate
  399. * @bat_priv: the bat priv with all the soft interface information
  400. * @cands: candidates array
  401. * @select: number of candidates already present in the array
  402. * @ip_key: key to look up in the DHT
  403. * @last_max: pointer where the address of the selected candidate will be saved
  404. */
  405. static void batadv_choose_next_candidate(struct batadv_priv *bat_priv,
  406. struct batadv_dat_candidate *cands,
  407. int select, batadv_dat_addr_t ip_key,
  408. batadv_dat_addr_t *last_max)
  409. {
  410. batadv_dat_addr_t max = 0, tmp_max = 0;
  411. struct batadv_orig_node *orig_node, *max_orig_node = NULL;
  412. struct batadv_hashtable *hash = bat_priv->orig_hash;
  413. struct hlist_node *node;
  414. struct hlist_head *head;
  415. int i;
  416. /* if no node is eligible as candidate, leave the candidate type as
  417. * NOT_FOUND
  418. */
  419. cands[select].type = BATADV_DAT_CANDIDATE_NOT_FOUND;
  420. /* iterate over the originator list and find the node with closest
  421. * dat_address which has not been selected yet
  422. */
  423. for (i = 0; i < hash->size; i++) {
  424. head = &hash->table[i];
  425. rcu_read_lock();
  426. hlist_for_each_entry_rcu(orig_node, node, head, hash_entry) {
  427. /* the dht space is a ring and addresses are unsigned */
  428. tmp_max = BATADV_DAT_ADDR_MAX - orig_node->dat_addr +
  429. ip_key;
  430. if (!batadv_is_orig_node_eligible(cands, select,
  431. tmp_max, max,
  432. *last_max, orig_node,
  433. max_orig_node))
  434. continue;
  435. if (!atomic_inc_not_zero(&orig_node->refcount))
  436. continue;
  437. max = tmp_max;
  438. if (max_orig_node)
  439. batadv_orig_node_free_ref(max_orig_node);
  440. max_orig_node = orig_node;
  441. }
  442. rcu_read_unlock();
  443. }
  444. if (max_orig_node) {
  445. cands[select].type = BATADV_DAT_CANDIDATE_ORIG;
  446. cands[select].orig_node = max_orig_node;
  447. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  448. "dat_select_candidates() %d: selected %pM addr=%u dist=%u\n",
  449. select, max_orig_node->orig, max_orig_node->dat_addr,
  450. max);
  451. }
  452. *last_max = max;
  453. }
  454. /**
  455. * batadv_dat_select_candidates - selects the nodes which the DHT message has to
  456. * be sent to
  457. * @bat_priv: the bat priv with all the soft interface information
  458. * @ip_dst: ipv4 to look up in the DHT
  459. *
  460. * An originator O is selected if and only if its DHT_ID value is one of three
  461. * closest values (from the LEFT, with wrap around if needed) then the hash
  462. * value of the key. ip_dst is the key.
  463. *
  464. * Returns the candidate array of size BATADV_DAT_CANDIDATE_NUM
  465. */
  466. static struct batadv_dat_candidate *
  467. batadv_dat_select_candidates(struct batadv_priv *bat_priv, __be32 ip_dst)
  468. {
  469. int select;
  470. batadv_dat_addr_t last_max = BATADV_DAT_ADDR_MAX, ip_key;
  471. struct batadv_dat_candidate *res;
  472. if (!bat_priv->orig_hash)
  473. return NULL;
  474. res = kmalloc(BATADV_DAT_CANDIDATES_NUM * sizeof(*res), GFP_ATOMIC);
  475. if (!res)
  476. return NULL;
  477. ip_key = (batadv_dat_addr_t)batadv_hash_dat(&ip_dst,
  478. BATADV_DAT_ADDR_MAX);
  479. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  480. "dat_select_candidates(): IP=%pI4 hash(IP)=%u\n", &ip_dst,
  481. ip_key);
  482. for (select = 0; select < BATADV_DAT_CANDIDATES_NUM; select++)
  483. batadv_choose_next_candidate(bat_priv, res, select, ip_key,
  484. &last_max);
  485. return res;
  486. }
  487. /**
  488. * batadv_dat_send_data - send a payload to the selected candidates
  489. * @bat_priv: the bat priv with all the soft interface information
  490. * @skb: payload to send
  491. * @ip: the DHT key
  492. * @packet_subtype: unicast4addr packet subtype to use
  493. *
  494. * In this function the skb is copied by means of pskb_copy() and is sent as
  495. * unicast packet to each of the selected candidates
  496. *
  497. * Returns true if the packet is sent to at least one candidate, false otherwise
  498. */
  499. static bool batadv_dat_send_data(struct batadv_priv *bat_priv,
  500. struct sk_buff *skb, __be32 ip,
  501. int packet_subtype)
  502. {
  503. int i;
  504. bool ret = false;
  505. int send_status;
  506. struct batadv_neigh_node *neigh_node = NULL;
  507. struct sk_buff *tmp_skb;
  508. struct batadv_dat_candidate *cand;
  509. cand = batadv_dat_select_candidates(bat_priv, ip);
  510. if (!cand)
  511. goto out;
  512. batadv_dbg(BATADV_DBG_DAT, bat_priv, "DHT_SEND for %pI4\n", &ip);
  513. for (i = 0; i < BATADV_DAT_CANDIDATES_NUM; i++) {
  514. if (cand[i].type == BATADV_DAT_CANDIDATE_NOT_FOUND)
  515. continue;
  516. neigh_node = batadv_orig_node_get_router(cand[i].orig_node);
  517. if (!neigh_node)
  518. goto free_orig;
  519. tmp_skb = pskb_copy(skb, GFP_ATOMIC);
  520. if (!batadv_unicast_4addr_prepare_skb(bat_priv, tmp_skb,
  521. cand[i].orig_node,
  522. packet_subtype)) {
  523. kfree_skb(tmp_skb);
  524. goto free_neigh;
  525. }
  526. send_status = batadv_send_skb_packet(tmp_skb,
  527. neigh_node->if_incoming,
  528. neigh_node->addr);
  529. if (send_status == NET_XMIT_SUCCESS) {
  530. /* count the sent packet */
  531. switch (packet_subtype) {
  532. case BATADV_P_DAT_DHT_GET:
  533. batadv_inc_counter(bat_priv,
  534. BATADV_CNT_DAT_GET_TX);
  535. break;
  536. case BATADV_P_DAT_DHT_PUT:
  537. batadv_inc_counter(bat_priv,
  538. BATADV_CNT_DAT_PUT_TX);
  539. break;
  540. }
  541. /* packet sent to a candidate: return true */
  542. ret = true;
  543. }
  544. free_neigh:
  545. batadv_neigh_node_free_ref(neigh_node);
  546. free_orig:
  547. batadv_orig_node_free_ref(cand[i].orig_node);
  548. }
  549. out:
  550. kfree(cand);
  551. return ret;
  552. }
  553. /**
  554. * batadv_dat_hash_free - free the local DAT hash table
  555. * @bat_priv: the bat priv with all the soft interface information
  556. */
  557. static void batadv_dat_hash_free(struct batadv_priv *bat_priv)
  558. {
  559. if (!bat_priv->dat.hash)
  560. return;
  561. __batadv_dat_purge(bat_priv, NULL);
  562. batadv_hash_destroy(bat_priv->dat.hash);
  563. bat_priv->dat.hash = NULL;
  564. }
  565. /**
  566. * batadv_dat_init - initialise the DAT internals
  567. * @bat_priv: the bat priv with all the soft interface information
  568. */
  569. int batadv_dat_init(struct batadv_priv *bat_priv)
  570. {
  571. if (bat_priv->dat.hash)
  572. return 0;
  573. bat_priv->dat.hash = batadv_hash_new(1024);
  574. if (!bat_priv->dat.hash)
  575. return -ENOMEM;
  576. batadv_dat_start_timer(bat_priv);
  577. return 0;
  578. }
  579. /**
  580. * batadv_dat_free - free the DAT internals
  581. * @bat_priv: the bat priv with all the soft interface information
  582. */
  583. void batadv_dat_free(struct batadv_priv *bat_priv)
  584. {
  585. cancel_delayed_work_sync(&bat_priv->dat.work);
  586. batadv_dat_hash_free(bat_priv);
  587. }
  588. /**
  589. * batadv_dat_cache_seq_print_text - print the local DAT hash table
  590. * @seq: seq file to print on
  591. * @offset: not used
  592. */
  593. int batadv_dat_cache_seq_print_text(struct seq_file *seq, void *offset)
  594. {
  595. struct net_device *net_dev = (struct net_device *)seq->private;
  596. struct batadv_priv *bat_priv = netdev_priv(net_dev);
  597. struct batadv_hashtable *hash = bat_priv->dat.hash;
  598. struct batadv_dat_entry *dat_entry;
  599. struct batadv_hard_iface *primary_if;
  600. struct hlist_node *node;
  601. struct hlist_head *head;
  602. unsigned long last_seen_jiffies;
  603. int last_seen_msecs, last_seen_secs, last_seen_mins;
  604. uint32_t i;
  605. primary_if = batadv_seq_print_text_primary_if_get(seq);
  606. if (!primary_if)
  607. goto out;
  608. seq_printf(seq, "Distributed ARP Table (%s):\n", net_dev->name);
  609. seq_printf(seq, " %-7s %-13s %5s\n", "IPv4", "MAC",
  610. "last-seen");
  611. for (i = 0; i < hash->size; i++) {
  612. head = &hash->table[i];
  613. rcu_read_lock();
  614. hlist_for_each_entry_rcu(dat_entry, node, head, hash_entry) {
  615. last_seen_jiffies = jiffies - dat_entry->last_update;
  616. last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
  617. last_seen_mins = last_seen_msecs / 60000;
  618. last_seen_msecs = last_seen_msecs % 60000;
  619. last_seen_secs = last_seen_msecs / 1000;
  620. seq_printf(seq, " * %15pI4 %14pM %6i:%02i\n",
  621. &dat_entry->ip, dat_entry->mac_addr,
  622. last_seen_mins, last_seen_secs);
  623. }
  624. rcu_read_unlock();
  625. }
  626. out:
  627. if (primary_if)
  628. batadv_hardif_free_ref(primary_if);
  629. return 0;
  630. }
  631. /**
  632. * batadv_arp_get_type - parse an ARP packet and gets the type
  633. * @bat_priv: the bat priv with all the soft interface information
  634. * @skb: packet to analyse
  635. * @hdr_size: size of the possible header before the ARP packet in the skb
  636. *
  637. * Returns the ARP type if the skb contains a valid ARP packet, 0 otherwise
  638. */
  639. static uint16_t batadv_arp_get_type(struct batadv_priv *bat_priv,
  640. struct sk_buff *skb, int hdr_size)
  641. {
  642. struct arphdr *arphdr;
  643. struct ethhdr *ethhdr;
  644. __be32 ip_src, ip_dst;
  645. uint8_t *hw_src, *hw_dst;
  646. uint16_t type = 0;
  647. /* pull the ethernet header */
  648. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN)))
  649. goto out;
  650. ethhdr = (struct ethhdr *)(skb->data + hdr_size);
  651. if (ethhdr->h_proto != htons(ETH_P_ARP))
  652. goto out;
  653. /* pull the ARP payload */
  654. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN +
  655. arp_hdr_len(skb->dev))))
  656. goto out;
  657. arphdr = (struct arphdr *)(skb->data + hdr_size + ETH_HLEN);
  658. /* Check whether the ARP packet carries a valid
  659. * IP information
  660. */
  661. if (arphdr->ar_hrd != htons(ARPHRD_ETHER))
  662. goto out;
  663. if (arphdr->ar_pro != htons(ETH_P_IP))
  664. goto out;
  665. if (arphdr->ar_hln != ETH_ALEN)
  666. goto out;
  667. if (arphdr->ar_pln != 4)
  668. goto out;
  669. /* Check for bad reply/request. If the ARP message is not sane, DAT
  670. * will simply ignore it
  671. */
  672. ip_src = batadv_arp_ip_src(skb, hdr_size);
  673. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  674. if (ipv4_is_loopback(ip_src) || ipv4_is_multicast(ip_src) ||
  675. ipv4_is_loopback(ip_dst) || ipv4_is_multicast(ip_dst) ||
  676. ipv4_is_zeronet(ip_src) || ipv4_is_lbcast(ip_src) ||
  677. ipv4_is_zeronet(ip_dst) || ipv4_is_lbcast(ip_dst))
  678. goto out;
  679. hw_src = batadv_arp_hw_src(skb, hdr_size);
  680. if (is_zero_ether_addr(hw_src) || is_multicast_ether_addr(hw_src))
  681. goto out;
  682. /* we don't care about the destination MAC address in ARP requests */
  683. if (arphdr->ar_op != htons(ARPOP_REQUEST)) {
  684. hw_dst = batadv_arp_hw_dst(skb, hdr_size);
  685. if (is_zero_ether_addr(hw_dst) ||
  686. is_multicast_ether_addr(hw_dst))
  687. goto out;
  688. }
  689. type = ntohs(arphdr->ar_op);
  690. out:
  691. return type;
  692. }
  693. /**
  694. * batadv_dat_snoop_outgoing_arp_request - snoop the ARP request and try to
  695. * answer using DAT
  696. * @bat_priv: the bat priv with all the soft interface information
  697. * @skb: packet to check
  698. *
  699. * Returns true if the message has been sent to the dht candidates, false
  700. * otherwise. In case of true the message has to be enqueued to permit the
  701. * fallback
  702. */
  703. bool batadv_dat_snoop_outgoing_arp_request(struct batadv_priv *bat_priv,
  704. struct sk_buff *skb)
  705. {
  706. uint16_t type = 0;
  707. __be32 ip_dst, ip_src;
  708. uint8_t *hw_src;
  709. bool ret = false;
  710. struct batadv_dat_entry *dat_entry = NULL;
  711. struct sk_buff *skb_new;
  712. struct batadv_hard_iface *primary_if = NULL;
  713. if (!atomic_read(&bat_priv->distributed_arp_table))
  714. goto out;
  715. type = batadv_arp_get_type(bat_priv, skb, 0);
  716. /* If the node gets an ARP_REQUEST it has to send a DHT_GET unicast
  717. * message to the selected DHT candidates
  718. */
  719. if (type != ARPOP_REQUEST)
  720. goto out;
  721. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REQUEST");
  722. ip_src = batadv_arp_ip_src(skb, 0);
  723. hw_src = batadv_arp_hw_src(skb, 0);
  724. ip_dst = batadv_arp_ip_dst(skb, 0);
  725. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  726. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  727. if (dat_entry) {
  728. primary_if = batadv_primary_if_get_selected(bat_priv);
  729. if (!primary_if)
  730. goto out;
  731. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  732. primary_if->soft_iface, ip_dst, hw_src,
  733. dat_entry->mac_addr, hw_src);
  734. if (!skb_new)
  735. goto out;
  736. skb_reset_mac_header(skb_new);
  737. skb_new->protocol = eth_type_trans(skb_new,
  738. primary_if->soft_iface);
  739. bat_priv->stats.rx_packets++;
  740. bat_priv->stats.rx_bytes += skb->len + ETH_HLEN;
  741. primary_if->soft_iface->last_rx = jiffies;
  742. netif_rx(skb_new);
  743. batadv_dbg(BATADV_DBG_DAT, bat_priv, "ARP request replied locally\n");
  744. ret = true;
  745. } else {
  746. /* Send the request on the DHT */
  747. ret = batadv_dat_send_data(bat_priv, skb, ip_dst,
  748. BATADV_P_DAT_DHT_GET);
  749. }
  750. out:
  751. if (dat_entry)
  752. batadv_dat_entry_free_ref(dat_entry);
  753. if (primary_if)
  754. batadv_hardif_free_ref(primary_if);
  755. return ret;
  756. }
  757. /**
  758. * batadv_dat_snoop_incoming_arp_request - snoop the ARP request and try to
  759. * answer using the local DAT storage
  760. * @bat_priv: the bat priv with all the soft interface information
  761. * @skb: packet to check
  762. * @hdr_size: size of the encapsulation header
  763. *
  764. * Returns true if the request has been answered, false otherwise
  765. */
  766. bool batadv_dat_snoop_incoming_arp_request(struct batadv_priv *bat_priv,
  767. struct sk_buff *skb, int hdr_size)
  768. {
  769. uint16_t type;
  770. __be32 ip_src, ip_dst;
  771. uint8_t *hw_src;
  772. struct sk_buff *skb_new;
  773. struct batadv_hard_iface *primary_if = NULL;
  774. struct batadv_dat_entry *dat_entry = NULL;
  775. bool ret = false;
  776. int err;
  777. if (!atomic_read(&bat_priv->distributed_arp_table))
  778. goto out;
  779. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  780. if (type != ARPOP_REQUEST)
  781. goto out;
  782. hw_src = batadv_arp_hw_src(skb, hdr_size);
  783. ip_src = batadv_arp_ip_src(skb, hdr_size);
  784. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  785. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  786. "Parsing incoming ARP REQUEST");
  787. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  788. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  789. if (!dat_entry)
  790. goto out;
  791. primary_if = batadv_primary_if_get_selected(bat_priv);
  792. if (!primary_if)
  793. goto out;
  794. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  795. primary_if->soft_iface, ip_dst, hw_src,
  796. dat_entry->mac_addr, hw_src);
  797. if (!skb_new)
  798. goto out;
  799. /* to preserve backwards compatibility, here the node has to answer
  800. * using the same packet type it received for the request. This is due
  801. * to that if a node is not using the 4addr packet format it may not
  802. * support it.
  803. */
  804. if (hdr_size == sizeof(struct batadv_unicast_4addr_packet))
  805. err = batadv_unicast_4addr_send_skb(bat_priv, skb_new,
  806. BATADV_P_DAT_CACHE_REPLY);
  807. else
  808. err = batadv_unicast_send_skb(bat_priv, skb_new);
  809. if (!err) {
  810. batadv_inc_counter(bat_priv, BATADV_CNT_DAT_CACHED_REPLY_TX);
  811. ret = true;
  812. }
  813. out:
  814. if (dat_entry)
  815. batadv_dat_entry_free_ref(dat_entry);
  816. if (primary_if)
  817. batadv_hardif_free_ref(primary_if);
  818. if (ret)
  819. kfree_skb(skb);
  820. return ret;
  821. }
  822. /**
  823. * batadv_dat_snoop_outgoing_arp_reply - snoop the ARP reply and fill the DHT
  824. * @bat_priv: the bat priv with all the soft interface information
  825. * @skb: packet to check
  826. */
  827. void batadv_dat_snoop_outgoing_arp_reply(struct batadv_priv *bat_priv,
  828. struct sk_buff *skb)
  829. {
  830. uint16_t type;
  831. __be32 ip_src, ip_dst;
  832. uint8_t *hw_src, *hw_dst;
  833. if (!atomic_read(&bat_priv->distributed_arp_table))
  834. return;
  835. type = batadv_arp_get_type(bat_priv, skb, 0);
  836. if (type != ARPOP_REPLY)
  837. return;
  838. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REPLY");
  839. hw_src = batadv_arp_hw_src(skb, 0);
  840. ip_src = batadv_arp_ip_src(skb, 0);
  841. hw_dst = batadv_arp_hw_dst(skb, 0);
  842. ip_dst = batadv_arp_ip_dst(skb, 0);
  843. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  844. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  845. /* Send the ARP reply to the candidates for both the IP addresses that
  846. * the node got within the ARP reply
  847. */
  848. batadv_dat_send_data(bat_priv, skb, ip_src, BATADV_P_DAT_DHT_PUT);
  849. batadv_dat_send_data(bat_priv, skb, ip_dst, BATADV_P_DAT_DHT_PUT);
  850. }
  851. /**
  852. * batadv_dat_snoop_incoming_arp_reply - snoop the ARP reply and fill the local
  853. * DAT storage only
  854. * @bat_priv: the bat priv with all the soft interface information
  855. * @skb: packet to check
  856. * @hdr_size: siaze of the encapsulation header
  857. */
  858. bool batadv_dat_snoop_incoming_arp_reply(struct batadv_priv *bat_priv,
  859. struct sk_buff *skb, int hdr_size)
  860. {
  861. uint16_t type;
  862. __be32 ip_src, ip_dst;
  863. uint8_t *hw_src, *hw_dst;
  864. bool ret = false;
  865. if (!atomic_read(&bat_priv->distributed_arp_table))
  866. goto out;
  867. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  868. if (type != ARPOP_REPLY)
  869. goto out;
  870. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  871. "Parsing incoming ARP REPLY");
  872. hw_src = batadv_arp_hw_src(skb, hdr_size);
  873. ip_src = batadv_arp_ip_src(skb, hdr_size);
  874. hw_dst = batadv_arp_hw_dst(skb, hdr_size);
  875. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  876. /* Update our internal cache with both the IP addresses the node got
  877. * within the ARP reply
  878. */
  879. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  880. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  881. /* if this REPLY is directed to a client of mine, let's deliver the
  882. * packet to the interface
  883. */
  884. ret = !batadv_is_my_client(bat_priv, hw_dst);
  885. out:
  886. if (ret)
  887. kfree_skb(skb);
  888. /* if ret == false -> packet has to be delivered to the interface */
  889. return ret;
  890. }
  891. /**
  892. * batadv_dat_drop_broadcast_packet - check if an ARP request has to be dropped
  893. * (because the node has already got the reply via DAT) or not
  894. * @bat_priv: the bat priv with all the soft interface information
  895. * @forw_packet: the broadcast packet
  896. *
  897. * Returns true if the node can drop the packet, false otherwise
  898. */
  899. bool batadv_dat_drop_broadcast_packet(struct batadv_priv *bat_priv,
  900. struct batadv_forw_packet *forw_packet)
  901. {
  902. uint16_t type;
  903. __be32 ip_dst;
  904. struct batadv_dat_entry *dat_entry = NULL;
  905. bool ret = false;
  906. const size_t bcast_len = sizeof(struct batadv_bcast_packet);
  907. if (!atomic_read(&bat_priv->distributed_arp_table))
  908. goto out;
  909. /* If this packet is an ARP_REQUEST and the node already has the
  910. * information that it is going to ask, then the packet can be dropped
  911. */
  912. if (forw_packet->num_packets)
  913. goto out;
  914. type = batadv_arp_get_type(bat_priv, forw_packet->skb, bcast_len);
  915. if (type != ARPOP_REQUEST)
  916. goto out;
  917. ip_dst = batadv_arp_ip_dst(forw_packet->skb, bcast_len);
  918. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  919. /* check if the node already got this entry */
  920. if (!dat_entry) {
  921. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  922. "ARP Request for %pI4: fallback\n", &ip_dst);
  923. goto out;
  924. }
  925. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  926. "ARP Request for %pI4: fallback prevented\n", &ip_dst);
  927. ret = true;
  928. out:
  929. if (dat_entry)
  930. batadv_dat_entry_free_ref(dat_entry);
  931. return ret;
  932. }