distributed-arp-table.c 30 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075
  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 - decrement the dat_entry refcounter and possibly
  44. * free it
  45. * @dat_entry: the entry 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 - check 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 deletes 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_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_tmp, head,
  89. hash_entry) {
  90. /* if a 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(&dat_entry->hash_entry);
  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 entries 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 - look 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 batadv_dat_entry *dat_entry, *dat_entry_tmp = NULL;
  212. struct batadv_hashtable *hash = bat_priv->dat.hash;
  213. uint32_t index;
  214. if (!hash)
  215. return NULL;
  216. index = batadv_hash_dat(&ip, hash->size);
  217. head = &hash->table[index];
  218. rcu_read_lock();
  219. hlist_for_each_entry_rcu(dat_entry, head, hash_entry) {
  220. if (dat_entry->ip != ip)
  221. continue;
  222. if (!atomic_inc_not_zero(&dat_entry->refcount))
  223. continue;
  224. dat_entry_tmp = dat_entry;
  225. break;
  226. }
  227. rcu_read_unlock();
  228. return dat_entry_tmp;
  229. }
  230. /**
  231. * batadv_dat_entry_add - add a new dat entry or update it if already exists
  232. * @bat_priv: the bat priv with all the soft interface information
  233. * @ip: ipv4 to add/edit
  234. * @mac_addr: mac address to assign to the given ipv4
  235. */
  236. static void batadv_dat_entry_add(struct batadv_priv *bat_priv, __be32 ip,
  237. uint8_t *mac_addr)
  238. {
  239. struct batadv_dat_entry *dat_entry;
  240. int hash_added;
  241. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip);
  242. /* if this entry is already known, just update it */
  243. if (dat_entry) {
  244. if (!batadv_compare_eth(dat_entry->mac_addr, mac_addr))
  245. memcpy(dat_entry->mac_addr, mac_addr, ETH_ALEN);
  246. dat_entry->last_update = jiffies;
  247. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  248. "Entry updated: %pI4 %pM\n", &dat_entry->ip,
  249. dat_entry->mac_addr);
  250. goto out;
  251. }
  252. dat_entry = kmalloc(sizeof(*dat_entry), GFP_ATOMIC);
  253. if (!dat_entry)
  254. goto out;
  255. dat_entry->ip = ip;
  256. memcpy(dat_entry->mac_addr, mac_addr, ETH_ALEN);
  257. dat_entry->last_update = jiffies;
  258. atomic_set(&dat_entry->refcount, 2);
  259. hash_added = batadv_hash_add(bat_priv->dat.hash, batadv_compare_dat,
  260. batadv_hash_dat, &dat_entry->ip,
  261. &dat_entry->hash_entry);
  262. if (unlikely(hash_added != 0)) {
  263. /* remove the reference for the hash */
  264. batadv_dat_entry_free_ref(dat_entry);
  265. goto out;
  266. }
  267. batadv_dbg(BATADV_DBG_DAT, bat_priv, "New entry added: %pI4 %pM\n",
  268. &dat_entry->ip, dat_entry->mac_addr);
  269. out:
  270. if (dat_entry)
  271. batadv_dat_entry_free_ref(dat_entry);
  272. }
  273. #ifdef CONFIG_BATMAN_ADV_DEBUG
  274. /**
  275. * batadv_dbg_arp - print a debug message containing all the ARP packet details
  276. * @bat_priv: the bat priv with all the soft interface information
  277. * @skb: ARP packet
  278. * @type: ARP type
  279. * @hdr_size: size of the possible header before the ARP packet
  280. * @msg: message to print together with the debugging information
  281. */
  282. static void batadv_dbg_arp(struct batadv_priv *bat_priv, struct sk_buff *skb,
  283. uint16_t type, int hdr_size, char *msg)
  284. {
  285. struct batadv_unicast_4addr_packet *unicast_4addr_packet;
  286. struct batadv_bcast_packet *bcast_pkt;
  287. uint8_t *orig_addr;
  288. __be32 ip_src, ip_dst;
  289. if (msg)
  290. batadv_dbg(BATADV_DBG_DAT, bat_priv, "%s\n", msg);
  291. ip_src = batadv_arp_ip_src(skb, hdr_size);
  292. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  293. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  294. "ARP MSG = [src: %pM-%pI4 dst: %pM-%pI4]\n",
  295. batadv_arp_hw_src(skb, hdr_size), &ip_src,
  296. batadv_arp_hw_dst(skb, hdr_size), &ip_dst);
  297. if (hdr_size == 0)
  298. return;
  299. unicast_4addr_packet = (struct batadv_unicast_4addr_packet *)skb->data;
  300. switch (unicast_4addr_packet->u.header.packet_type) {
  301. case BATADV_UNICAST:
  302. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  303. "* encapsulated within a UNICAST packet\n");
  304. break;
  305. case BATADV_UNICAST_4ADDR:
  306. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  307. "* encapsulated within a UNICAST_4ADDR packet (src: %pM)\n",
  308. unicast_4addr_packet->src);
  309. switch (unicast_4addr_packet->subtype) {
  310. case BATADV_P_DAT_DHT_PUT:
  311. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DAT_DHT_PUT\n");
  312. break;
  313. case BATADV_P_DAT_DHT_GET:
  314. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DAT_DHT_GET\n");
  315. break;
  316. case BATADV_P_DAT_CACHE_REPLY:
  317. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  318. "* type: DAT_CACHE_REPLY\n");
  319. break;
  320. case BATADV_P_DATA:
  321. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: DATA\n");
  322. break;
  323. default:
  324. batadv_dbg(BATADV_DBG_DAT, bat_priv, "* type: Unknown (%u)!\n",
  325. unicast_4addr_packet->u.header.packet_type);
  326. }
  327. break;
  328. case BATADV_BCAST:
  329. bcast_pkt = (struct batadv_bcast_packet *)unicast_4addr_packet;
  330. orig_addr = bcast_pkt->orig;
  331. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  332. "* encapsulated within a BCAST packet (src: %pM)\n",
  333. orig_addr);
  334. break;
  335. default:
  336. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  337. "* encapsulated within an unknown packet type (0x%x)\n",
  338. unicast_4addr_packet->u.header.packet_type);
  339. }
  340. }
  341. #else
  342. static void batadv_dbg_arp(struct batadv_priv *bat_priv, struct sk_buff *skb,
  343. uint16_t type, int hdr_size, char *msg)
  344. {
  345. }
  346. #endif /* CONFIG_BATMAN_ADV_DEBUG */
  347. /**
  348. * batadv_is_orig_node_eligible - check whether a node can be a DHT candidate
  349. * @res: the array with the already selected candidates
  350. * @select: number of already selected candidates
  351. * @tmp_max: address of the currently evaluated node
  352. * @max: current round max address
  353. * @last_max: address of the last selected candidate
  354. * @candidate: orig_node under evaluation
  355. * @max_orig_node: last selected candidate
  356. *
  357. * Returns true if the node has been elected as next candidate or false
  358. * otherwise.
  359. */
  360. static bool batadv_is_orig_node_eligible(struct batadv_dat_candidate *res,
  361. int select, batadv_dat_addr_t tmp_max,
  362. batadv_dat_addr_t max,
  363. batadv_dat_addr_t last_max,
  364. struct batadv_orig_node *candidate,
  365. struct batadv_orig_node *max_orig_node)
  366. {
  367. bool ret = false;
  368. int j;
  369. /* Check if this node has already been selected... */
  370. for (j = 0; j < select; j++)
  371. if (res[j].orig_node == candidate)
  372. break;
  373. /* ..and possibly skip it */
  374. if (j < select)
  375. goto out;
  376. /* sanity check: has it already been selected? This should not happen */
  377. if (tmp_max > last_max)
  378. goto out;
  379. /* check if during this iteration an originator with a closer dht
  380. * address has already been found
  381. */
  382. if (tmp_max < max)
  383. goto out;
  384. /* this is an hash collision with the temporary selected node. Choose
  385. * the one with the lowest address
  386. */
  387. if ((tmp_max == max) && max_orig_node &&
  388. (batadv_compare_eth(candidate->orig, max_orig_node->orig) > 0))
  389. goto out;
  390. ret = true;
  391. out:
  392. return ret;
  393. }
  394. /**
  395. * batadv_choose_next_candidate - select the next DHT candidate
  396. * @bat_priv: the bat priv with all the soft interface information
  397. * @cands: candidates array
  398. * @select: number of candidates already present in the array
  399. * @ip_key: key to look up in the DHT
  400. * @last_max: pointer where the address of the selected candidate will be saved
  401. */
  402. static void batadv_choose_next_candidate(struct batadv_priv *bat_priv,
  403. struct batadv_dat_candidate *cands,
  404. int select, batadv_dat_addr_t ip_key,
  405. batadv_dat_addr_t *last_max)
  406. {
  407. batadv_dat_addr_t max = 0, tmp_max = 0;
  408. struct batadv_orig_node *orig_node, *max_orig_node = NULL;
  409. struct batadv_hashtable *hash = bat_priv->orig_hash;
  410. struct hlist_head *head;
  411. int i;
  412. /* if no node is eligible as candidate, leave the candidate type as
  413. * NOT_FOUND
  414. */
  415. cands[select].type = BATADV_DAT_CANDIDATE_NOT_FOUND;
  416. /* iterate over the originator list and find the node with the closest
  417. * dat_address which has not been selected yet
  418. */
  419. for (i = 0; i < hash->size; i++) {
  420. head = &hash->table[i];
  421. rcu_read_lock();
  422. hlist_for_each_entry_rcu(orig_node, head, hash_entry) {
  423. /* the dht space is a ring using unsigned addresses */
  424. tmp_max = BATADV_DAT_ADDR_MAX - orig_node->dat_addr +
  425. ip_key;
  426. if (!batadv_is_orig_node_eligible(cands, select,
  427. tmp_max, max,
  428. *last_max, orig_node,
  429. max_orig_node))
  430. continue;
  431. if (!atomic_inc_not_zero(&orig_node->refcount))
  432. continue;
  433. max = tmp_max;
  434. if (max_orig_node)
  435. batadv_orig_node_free_ref(max_orig_node);
  436. max_orig_node = orig_node;
  437. }
  438. rcu_read_unlock();
  439. }
  440. if (max_orig_node) {
  441. cands[select].type = BATADV_DAT_CANDIDATE_ORIG;
  442. cands[select].orig_node = max_orig_node;
  443. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  444. "dat_select_candidates() %d: selected %pM addr=%u dist=%u\n",
  445. select, max_orig_node->orig, max_orig_node->dat_addr,
  446. max);
  447. }
  448. *last_max = max;
  449. }
  450. /**
  451. * batadv_dat_select_candidates - select the nodes which the DHT message has to
  452. * be sent to
  453. * @bat_priv: the bat priv with all the soft interface information
  454. * @ip_dst: ipv4 to look up in the DHT
  455. *
  456. * An originator O is selected if and only if its DHT_ID value is one of three
  457. * closest values (from the LEFT, with wrap around if needed) then the hash
  458. * value of the key. ip_dst is the key.
  459. *
  460. * Returns the candidate array of size BATADV_DAT_CANDIDATE_NUM.
  461. */
  462. static struct batadv_dat_candidate *
  463. batadv_dat_select_candidates(struct batadv_priv *bat_priv, __be32 ip_dst)
  464. {
  465. int select;
  466. batadv_dat_addr_t last_max = BATADV_DAT_ADDR_MAX, ip_key;
  467. struct batadv_dat_candidate *res;
  468. if (!bat_priv->orig_hash)
  469. return NULL;
  470. res = kmalloc(BATADV_DAT_CANDIDATES_NUM * sizeof(*res), GFP_ATOMIC);
  471. if (!res)
  472. return NULL;
  473. ip_key = (batadv_dat_addr_t)batadv_hash_dat(&ip_dst,
  474. BATADV_DAT_ADDR_MAX);
  475. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  476. "dat_select_candidates(): IP=%pI4 hash(IP)=%u\n", &ip_dst,
  477. ip_key);
  478. for (select = 0; select < BATADV_DAT_CANDIDATES_NUM; select++)
  479. batadv_choose_next_candidate(bat_priv, res, select, ip_key,
  480. &last_max);
  481. return res;
  482. }
  483. /**
  484. * batadv_dat_send_data - send a payload to the selected candidates
  485. * @bat_priv: the bat priv with all the soft interface information
  486. * @skb: payload to send
  487. * @ip: the DHT key
  488. * @packet_subtype: unicast4addr packet subtype to use
  489. *
  490. * This function copies the skb with pskb_copy() and is sent as unicast packet
  491. * to each of the selected candidates.
  492. *
  493. * Returns true if the packet is sent to at least one candidate, false
  494. * otherwise.
  495. */
  496. static bool batadv_dat_send_data(struct batadv_priv *bat_priv,
  497. struct sk_buff *skb, __be32 ip,
  498. int packet_subtype)
  499. {
  500. int i;
  501. bool ret = false;
  502. int send_status;
  503. struct batadv_neigh_node *neigh_node = NULL;
  504. struct sk_buff *tmp_skb;
  505. struct batadv_dat_candidate *cand;
  506. cand = batadv_dat_select_candidates(bat_priv, ip);
  507. if (!cand)
  508. goto out;
  509. batadv_dbg(BATADV_DBG_DAT, bat_priv, "DHT_SEND for %pI4\n", &ip);
  510. for (i = 0; i < BATADV_DAT_CANDIDATES_NUM; i++) {
  511. if (cand[i].type == BATADV_DAT_CANDIDATE_NOT_FOUND)
  512. continue;
  513. neigh_node = batadv_orig_node_get_router(cand[i].orig_node);
  514. if (!neigh_node)
  515. goto free_orig;
  516. tmp_skb = pskb_copy(skb, GFP_ATOMIC);
  517. if (!batadv_unicast_4addr_prepare_skb(bat_priv, tmp_skb,
  518. cand[i].orig_node,
  519. packet_subtype)) {
  520. kfree_skb(tmp_skb);
  521. goto free_neigh;
  522. }
  523. send_status = batadv_send_skb_packet(tmp_skb,
  524. neigh_node->if_incoming,
  525. neigh_node->addr);
  526. if (send_status == NET_XMIT_SUCCESS) {
  527. /* count the sent packet */
  528. switch (packet_subtype) {
  529. case BATADV_P_DAT_DHT_GET:
  530. batadv_inc_counter(bat_priv,
  531. BATADV_CNT_DAT_GET_TX);
  532. break;
  533. case BATADV_P_DAT_DHT_PUT:
  534. batadv_inc_counter(bat_priv,
  535. BATADV_CNT_DAT_PUT_TX);
  536. break;
  537. }
  538. /* packet sent to a candidate: return true */
  539. ret = true;
  540. }
  541. free_neigh:
  542. batadv_neigh_node_free_ref(neigh_node);
  543. free_orig:
  544. batadv_orig_node_free_ref(cand[i].orig_node);
  545. }
  546. out:
  547. kfree(cand);
  548. return ret;
  549. }
  550. /**
  551. * batadv_dat_hash_free - free the local DAT hash table
  552. * @bat_priv: the bat priv with all the soft interface information
  553. */
  554. static void batadv_dat_hash_free(struct batadv_priv *bat_priv)
  555. {
  556. if (!bat_priv->dat.hash)
  557. return;
  558. __batadv_dat_purge(bat_priv, NULL);
  559. batadv_hash_destroy(bat_priv->dat.hash);
  560. bat_priv->dat.hash = NULL;
  561. }
  562. /**
  563. * batadv_dat_init - initialise the DAT internals
  564. * @bat_priv: the bat priv with all the soft interface information
  565. */
  566. int batadv_dat_init(struct batadv_priv *bat_priv)
  567. {
  568. if (bat_priv->dat.hash)
  569. return 0;
  570. bat_priv->dat.hash = batadv_hash_new(1024);
  571. if (!bat_priv->dat.hash)
  572. return -ENOMEM;
  573. batadv_dat_start_timer(bat_priv);
  574. return 0;
  575. }
  576. /**
  577. * batadv_dat_free - free the DAT internals
  578. * @bat_priv: the bat priv with all the soft interface information
  579. */
  580. void batadv_dat_free(struct batadv_priv *bat_priv)
  581. {
  582. cancel_delayed_work_sync(&bat_priv->dat.work);
  583. batadv_dat_hash_free(bat_priv);
  584. }
  585. /**
  586. * batadv_dat_cache_seq_print_text - print the local DAT hash table
  587. * @seq: seq file to print on
  588. * @offset: not used
  589. */
  590. int batadv_dat_cache_seq_print_text(struct seq_file *seq, void *offset)
  591. {
  592. struct net_device *net_dev = (struct net_device *)seq->private;
  593. struct batadv_priv *bat_priv = netdev_priv(net_dev);
  594. struct batadv_hashtable *hash = bat_priv->dat.hash;
  595. struct batadv_dat_entry *dat_entry;
  596. struct batadv_hard_iface *primary_if;
  597. struct hlist_head *head;
  598. unsigned long last_seen_jiffies;
  599. int last_seen_msecs, last_seen_secs, last_seen_mins;
  600. uint32_t i;
  601. primary_if = batadv_seq_print_text_primary_if_get(seq);
  602. if (!primary_if)
  603. goto out;
  604. seq_printf(seq, "Distributed ARP Table (%s):\n", net_dev->name);
  605. seq_printf(seq, " %-7s %-13s %5s\n", "IPv4", "MAC",
  606. "last-seen");
  607. for (i = 0; i < hash->size; i++) {
  608. head = &hash->table[i];
  609. rcu_read_lock();
  610. hlist_for_each_entry_rcu(dat_entry, head, hash_entry) {
  611. last_seen_jiffies = jiffies - dat_entry->last_update;
  612. last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
  613. last_seen_mins = last_seen_msecs / 60000;
  614. last_seen_msecs = last_seen_msecs % 60000;
  615. last_seen_secs = last_seen_msecs / 1000;
  616. seq_printf(seq, " * %15pI4 %14pM %6i:%02i\n",
  617. &dat_entry->ip, dat_entry->mac_addr,
  618. last_seen_mins, last_seen_secs);
  619. }
  620. rcu_read_unlock();
  621. }
  622. out:
  623. if (primary_if)
  624. batadv_hardif_free_ref(primary_if);
  625. return 0;
  626. }
  627. /**
  628. * batadv_arp_get_type - parse an ARP packet and gets the type
  629. * @bat_priv: the bat priv with all the soft interface information
  630. * @skb: packet to analyse
  631. * @hdr_size: size of the possible header before the ARP packet in the skb
  632. *
  633. * Returns the ARP type if the skb contains a valid ARP packet, 0 otherwise.
  634. */
  635. static uint16_t batadv_arp_get_type(struct batadv_priv *bat_priv,
  636. struct sk_buff *skb, int hdr_size)
  637. {
  638. struct arphdr *arphdr;
  639. struct ethhdr *ethhdr;
  640. __be32 ip_src, ip_dst;
  641. uint8_t *hw_src, *hw_dst;
  642. uint16_t type = 0;
  643. /* pull the ethernet header */
  644. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN)))
  645. goto out;
  646. ethhdr = (struct ethhdr *)(skb->data + hdr_size);
  647. if (ethhdr->h_proto != htons(ETH_P_ARP))
  648. goto out;
  649. /* pull the ARP payload */
  650. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN +
  651. arp_hdr_len(skb->dev))))
  652. goto out;
  653. arphdr = (struct arphdr *)(skb->data + hdr_size + ETH_HLEN);
  654. /* check whether the ARP packet carries a valid IP information */
  655. if (arphdr->ar_hrd != htons(ARPHRD_ETHER))
  656. goto out;
  657. if (arphdr->ar_pro != htons(ETH_P_IP))
  658. goto out;
  659. if (arphdr->ar_hln != ETH_ALEN)
  660. goto out;
  661. if (arphdr->ar_pln != 4)
  662. goto out;
  663. /* Check for bad reply/request. If the ARP message is not sane, DAT
  664. * will simply ignore it
  665. */
  666. ip_src = batadv_arp_ip_src(skb, hdr_size);
  667. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  668. if (ipv4_is_loopback(ip_src) || ipv4_is_multicast(ip_src) ||
  669. ipv4_is_loopback(ip_dst) || ipv4_is_multicast(ip_dst) ||
  670. ipv4_is_zeronet(ip_src) || ipv4_is_lbcast(ip_src) ||
  671. ipv4_is_zeronet(ip_dst) || ipv4_is_lbcast(ip_dst))
  672. goto out;
  673. hw_src = batadv_arp_hw_src(skb, hdr_size);
  674. if (is_zero_ether_addr(hw_src) || is_multicast_ether_addr(hw_src))
  675. goto out;
  676. /* don't care about the destination MAC address in ARP requests */
  677. if (arphdr->ar_op != htons(ARPOP_REQUEST)) {
  678. hw_dst = batadv_arp_hw_dst(skb, hdr_size);
  679. if (is_zero_ether_addr(hw_dst) ||
  680. is_multicast_ether_addr(hw_dst))
  681. goto out;
  682. }
  683. type = ntohs(arphdr->ar_op);
  684. out:
  685. return type;
  686. }
  687. /**
  688. * batadv_dat_snoop_outgoing_arp_request - snoop the ARP request and try to
  689. * answer using DAT
  690. * @bat_priv: the bat priv with all the soft interface information
  691. * @skb: packet to check
  692. *
  693. * Returns true if the message has been sent to the dht candidates, false
  694. * otherwise. In case of a positive return value the message has to be enqueued
  695. * to permit the fallback.
  696. */
  697. bool batadv_dat_snoop_outgoing_arp_request(struct batadv_priv *bat_priv,
  698. struct sk_buff *skb)
  699. {
  700. uint16_t type = 0;
  701. __be32 ip_dst, ip_src;
  702. uint8_t *hw_src;
  703. bool ret = false;
  704. struct batadv_dat_entry *dat_entry = NULL;
  705. struct sk_buff *skb_new;
  706. if (!atomic_read(&bat_priv->distributed_arp_table))
  707. goto out;
  708. type = batadv_arp_get_type(bat_priv, skb, 0);
  709. /* If the node gets an ARP_REQUEST it has to send a DHT_GET unicast
  710. * message to the selected DHT candidates
  711. */
  712. if (type != ARPOP_REQUEST)
  713. goto out;
  714. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REQUEST");
  715. ip_src = batadv_arp_ip_src(skb, 0);
  716. hw_src = batadv_arp_hw_src(skb, 0);
  717. ip_dst = batadv_arp_ip_dst(skb, 0);
  718. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  719. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  720. if (dat_entry) {
  721. /* If the ARP request is destined for a local client the local
  722. * client will answer itself. DAT would only generate a
  723. * duplicate packet.
  724. *
  725. * Moreover, if the soft-interface is enslaved into a bridge, an
  726. * additional DAT answer may trigger kernel warnings about
  727. * a packet coming from the wrong port.
  728. */
  729. if (batadv_is_my_client(bat_priv, dat_entry->mac_addr)) {
  730. ret = true;
  731. goto out;
  732. }
  733. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  734. bat_priv->soft_iface, ip_dst, hw_src,
  735. dat_entry->mac_addr, hw_src);
  736. if (!skb_new)
  737. goto out;
  738. skb_reset_mac_header(skb_new);
  739. skb_new->protocol = eth_type_trans(skb_new,
  740. bat_priv->soft_iface);
  741. bat_priv->stats.rx_packets++;
  742. bat_priv->stats.rx_bytes += skb->len + ETH_HLEN;
  743. bat_priv->soft_iface->last_rx = jiffies;
  744. netif_rx(skb_new);
  745. batadv_dbg(BATADV_DBG_DAT, bat_priv, "ARP request replied locally\n");
  746. ret = true;
  747. } else {
  748. /* Send the request to the DHT */
  749. ret = batadv_dat_send_data(bat_priv, skb, ip_dst,
  750. BATADV_P_DAT_DHT_GET);
  751. }
  752. out:
  753. if (dat_entry)
  754. batadv_dat_entry_free_ref(dat_entry);
  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_dat_entry *dat_entry = NULL;
  774. bool ret = false;
  775. int err;
  776. if (!atomic_read(&bat_priv->distributed_arp_table))
  777. goto out;
  778. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  779. if (type != ARPOP_REQUEST)
  780. goto out;
  781. hw_src = batadv_arp_hw_src(skb, hdr_size);
  782. ip_src = batadv_arp_ip_src(skb, hdr_size);
  783. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  784. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  785. "Parsing incoming ARP REQUEST");
  786. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  787. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  788. if (!dat_entry)
  789. goto out;
  790. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  791. bat_priv->soft_iface, ip_dst, hw_src,
  792. dat_entry->mac_addr, hw_src);
  793. if (!skb_new)
  794. goto out;
  795. /* To preserve backwards compatibility, the node has choose the outgoing
  796. * format based on the incoming request packet type. The assumption is
  797. * that a node not using the 4addr packet format doesn't support it.
  798. */
  799. if (hdr_size == sizeof(struct batadv_unicast_4addr_packet))
  800. err = batadv_unicast_4addr_send_skb(bat_priv, skb_new,
  801. BATADV_P_DAT_CACHE_REPLY);
  802. else
  803. err = batadv_unicast_send_skb(bat_priv, skb_new);
  804. if (!err) {
  805. batadv_inc_counter(bat_priv, BATADV_CNT_DAT_CACHED_REPLY_TX);
  806. ret = true;
  807. }
  808. out:
  809. if (dat_entry)
  810. batadv_dat_entry_free_ref(dat_entry);
  811. if (ret)
  812. kfree_skb(skb);
  813. return ret;
  814. }
  815. /**
  816. * batadv_dat_snoop_outgoing_arp_reply - snoop the ARP reply and fill the DHT
  817. * @bat_priv: the bat priv with all the soft interface information
  818. * @skb: packet to check
  819. */
  820. void batadv_dat_snoop_outgoing_arp_reply(struct batadv_priv *bat_priv,
  821. struct sk_buff *skb)
  822. {
  823. uint16_t type;
  824. __be32 ip_src, ip_dst;
  825. uint8_t *hw_src, *hw_dst;
  826. if (!atomic_read(&bat_priv->distributed_arp_table))
  827. return;
  828. type = batadv_arp_get_type(bat_priv, skb, 0);
  829. if (type != ARPOP_REPLY)
  830. return;
  831. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REPLY");
  832. hw_src = batadv_arp_hw_src(skb, 0);
  833. ip_src = batadv_arp_ip_src(skb, 0);
  834. hw_dst = batadv_arp_hw_dst(skb, 0);
  835. ip_dst = batadv_arp_ip_dst(skb, 0);
  836. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  837. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  838. /* Send the ARP reply to the candidates for both the IP addresses that
  839. * the node obtained from the ARP reply
  840. */
  841. batadv_dat_send_data(bat_priv, skb, ip_src, BATADV_P_DAT_DHT_PUT);
  842. batadv_dat_send_data(bat_priv, skb, ip_dst, BATADV_P_DAT_DHT_PUT);
  843. }
  844. /**
  845. * batadv_dat_snoop_incoming_arp_reply - snoop the ARP reply and fill the local
  846. * DAT storage only
  847. * @bat_priv: the bat priv with all the soft interface information
  848. * @skb: packet to check
  849. * @hdr_size: size of the encapsulation header
  850. */
  851. bool batadv_dat_snoop_incoming_arp_reply(struct batadv_priv *bat_priv,
  852. struct sk_buff *skb, int hdr_size)
  853. {
  854. uint16_t type;
  855. __be32 ip_src, ip_dst;
  856. uint8_t *hw_src, *hw_dst;
  857. bool ret = false;
  858. if (!atomic_read(&bat_priv->distributed_arp_table))
  859. goto out;
  860. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  861. if (type != ARPOP_REPLY)
  862. goto out;
  863. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  864. "Parsing incoming ARP REPLY");
  865. hw_src = batadv_arp_hw_src(skb, hdr_size);
  866. ip_src = batadv_arp_ip_src(skb, hdr_size);
  867. hw_dst = batadv_arp_hw_dst(skb, hdr_size);
  868. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  869. /* Update our internal cache with both the IP addresses the node got
  870. * within the ARP reply
  871. */
  872. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  873. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  874. /* if this REPLY is directed to a client of mine, let's deliver the
  875. * packet to the interface
  876. */
  877. ret = !batadv_is_my_client(bat_priv, hw_dst);
  878. out:
  879. if (ret)
  880. kfree_skb(skb);
  881. /* if ret == false -> packet has to be delivered to the interface */
  882. return ret;
  883. }
  884. /**
  885. * batadv_dat_drop_broadcast_packet - check if an ARP request has to be dropped
  886. * (because the node has already obtained the reply via DAT) or not
  887. * @bat_priv: the bat priv with all the soft interface information
  888. * @forw_packet: the broadcast packet
  889. *
  890. * Returns true if the node can drop the packet, false otherwise.
  891. */
  892. bool batadv_dat_drop_broadcast_packet(struct batadv_priv *bat_priv,
  893. struct batadv_forw_packet *forw_packet)
  894. {
  895. uint16_t type;
  896. __be32 ip_dst;
  897. struct batadv_dat_entry *dat_entry = NULL;
  898. bool ret = false;
  899. const size_t bcast_len = sizeof(struct batadv_bcast_packet);
  900. if (!atomic_read(&bat_priv->distributed_arp_table))
  901. goto out;
  902. /* If this packet is an ARP_REQUEST and the node already has the
  903. * information that it is going to ask, then the packet can be dropped
  904. */
  905. if (forw_packet->num_packets)
  906. goto out;
  907. type = batadv_arp_get_type(bat_priv, forw_packet->skb, bcast_len);
  908. if (type != ARPOP_REQUEST)
  909. goto out;
  910. ip_dst = batadv_arp_ip_dst(forw_packet->skb, bcast_len);
  911. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  912. /* check if the node already got this entry */
  913. if (!dat_entry) {
  914. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  915. "ARP Request for %pI4: fallback\n", &ip_dst);
  916. goto out;
  917. }
  918. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  919. "ARP Request for %pI4: fallback prevented\n", &ip_dst);
  920. ret = true;
  921. out:
  922. if (dat_entry)
  923. batadv_dat_entry_free_ref(dat_entry);
  924. return ret;
  925. }