distributed-arp-table.c 29 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051
  1. /* Copyright (C) 2011-2012 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. /* packet sent to a candidate: return true */
  531. ret = true;
  532. free_neigh:
  533. batadv_neigh_node_free_ref(neigh_node);
  534. free_orig:
  535. batadv_orig_node_free_ref(cand[i].orig_node);
  536. }
  537. out:
  538. kfree(cand);
  539. return ret;
  540. }
  541. /**
  542. * batadv_dat_hash_free - free the local DAT hash table
  543. * @bat_priv: the bat priv with all the soft interface information
  544. */
  545. static void batadv_dat_hash_free(struct batadv_priv *bat_priv)
  546. {
  547. if (!bat_priv->dat.hash)
  548. return;
  549. __batadv_dat_purge(bat_priv, NULL);
  550. batadv_hash_destroy(bat_priv->dat.hash);
  551. bat_priv->dat.hash = NULL;
  552. }
  553. /**
  554. * batadv_dat_init - initialise the DAT internals
  555. * @bat_priv: the bat priv with all the soft interface information
  556. */
  557. int batadv_dat_init(struct batadv_priv *bat_priv)
  558. {
  559. if (bat_priv->dat.hash)
  560. return 0;
  561. bat_priv->dat.hash = batadv_hash_new(1024);
  562. if (!bat_priv->dat.hash)
  563. return -ENOMEM;
  564. batadv_dat_start_timer(bat_priv);
  565. return 0;
  566. }
  567. /**
  568. * batadv_dat_free - free the DAT internals
  569. * @bat_priv: the bat priv with all the soft interface information
  570. */
  571. void batadv_dat_free(struct batadv_priv *bat_priv)
  572. {
  573. cancel_delayed_work_sync(&bat_priv->dat.work);
  574. batadv_dat_hash_free(bat_priv);
  575. }
  576. /**
  577. * batadv_dat_cache_seq_print_text - print the local DAT hash table
  578. * @seq: seq file to print on
  579. * @offset: not used
  580. */
  581. int batadv_dat_cache_seq_print_text(struct seq_file *seq, void *offset)
  582. {
  583. struct net_device *net_dev = (struct net_device *)seq->private;
  584. struct batadv_priv *bat_priv = netdev_priv(net_dev);
  585. struct batadv_hashtable *hash = bat_priv->dat.hash;
  586. struct batadv_dat_entry *dat_entry;
  587. struct batadv_hard_iface *primary_if;
  588. struct hlist_node *node;
  589. struct hlist_head *head;
  590. unsigned long last_seen_jiffies;
  591. int last_seen_msecs, last_seen_secs, last_seen_mins;
  592. uint32_t i;
  593. primary_if = batadv_seq_print_text_primary_if_get(seq);
  594. if (!primary_if)
  595. goto out;
  596. seq_printf(seq, "Distributed ARP Table (%s):\n", net_dev->name);
  597. seq_printf(seq, " %-7s %-13s %5s\n", "IPv4", "MAC",
  598. "last-seen");
  599. for (i = 0; i < hash->size; i++) {
  600. head = &hash->table[i];
  601. rcu_read_lock();
  602. hlist_for_each_entry_rcu(dat_entry, node, head, hash_entry) {
  603. last_seen_jiffies = jiffies - dat_entry->last_update;
  604. last_seen_msecs = jiffies_to_msecs(last_seen_jiffies);
  605. last_seen_mins = last_seen_msecs / 60000;
  606. last_seen_msecs = last_seen_msecs % 60000;
  607. last_seen_secs = last_seen_msecs / 1000;
  608. seq_printf(seq, " * %15pI4 %14pM %6i:%02i\n",
  609. &dat_entry->ip, dat_entry->mac_addr,
  610. last_seen_mins, last_seen_secs);
  611. }
  612. rcu_read_unlock();
  613. }
  614. out:
  615. if (primary_if)
  616. batadv_hardif_free_ref(primary_if);
  617. return 0;
  618. }
  619. /**
  620. * batadv_arp_get_type - parse an ARP packet and gets the type
  621. * @bat_priv: the bat priv with all the soft interface information
  622. * @skb: packet to analyse
  623. * @hdr_size: size of the possible header before the ARP packet in the skb
  624. *
  625. * Returns the ARP type if the skb contains a valid ARP packet, 0 otherwise
  626. */
  627. static uint16_t batadv_arp_get_type(struct batadv_priv *bat_priv,
  628. struct sk_buff *skb, int hdr_size)
  629. {
  630. struct arphdr *arphdr;
  631. struct ethhdr *ethhdr;
  632. __be32 ip_src, ip_dst;
  633. uint16_t type = 0;
  634. /* pull the ethernet header */
  635. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN)))
  636. goto out;
  637. ethhdr = (struct ethhdr *)(skb->data + hdr_size);
  638. if (ethhdr->h_proto != htons(ETH_P_ARP))
  639. goto out;
  640. /* pull the ARP payload */
  641. if (unlikely(!pskb_may_pull(skb, hdr_size + ETH_HLEN +
  642. arp_hdr_len(skb->dev))))
  643. goto out;
  644. arphdr = (struct arphdr *)(skb->data + hdr_size + ETH_HLEN);
  645. /* Check whether the ARP packet carries a valid
  646. * IP information
  647. */
  648. if (arphdr->ar_hrd != htons(ARPHRD_ETHER))
  649. goto out;
  650. if (arphdr->ar_pro != htons(ETH_P_IP))
  651. goto out;
  652. if (arphdr->ar_hln != ETH_ALEN)
  653. goto out;
  654. if (arphdr->ar_pln != 4)
  655. goto out;
  656. /* Check for bad reply/request. If the ARP message is not sane, DAT
  657. * will simply ignore it
  658. */
  659. ip_src = batadv_arp_ip_src(skb, hdr_size);
  660. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  661. if (ipv4_is_loopback(ip_src) || ipv4_is_multicast(ip_src) ||
  662. ipv4_is_loopback(ip_dst) || ipv4_is_multicast(ip_dst))
  663. goto out;
  664. type = ntohs(arphdr->ar_op);
  665. out:
  666. return type;
  667. }
  668. /**
  669. * batadv_dat_snoop_outgoing_arp_request - snoop the ARP request and try to
  670. * answer using DAT
  671. * @bat_priv: the bat priv with all the soft interface information
  672. * @skb: packet to check
  673. *
  674. * Returns true if the message has been sent to the dht candidates, false
  675. * otherwise. In case of true the message has to be enqueued to permit the
  676. * fallback
  677. */
  678. bool batadv_dat_snoop_outgoing_arp_request(struct batadv_priv *bat_priv,
  679. struct sk_buff *skb)
  680. {
  681. uint16_t type = 0;
  682. __be32 ip_dst, ip_src;
  683. uint8_t *hw_src;
  684. bool ret = false;
  685. struct batadv_dat_entry *dat_entry = NULL;
  686. struct sk_buff *skb_new;
  687. struct batadv_hard_iface *primary_if = NULL;
  688. if (!atomic_read(&bat_priv->distributed_arp_table))
  689. goto out;
  690. type = batadv_arp_get_type(bat_priv, skb, 0);
  691. /* If the node gets an ARP_REQUEST it has to send a DHT_GET unicast
  692. * message to the selected DHT candidates
  693. */
  694. if (type != ARPOP_REQUEST)
  695. goto out;
  696. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REQUEST");
  697. ip_src = batadv_arp_ip_src(skb, 0);
  698. hw_src = batadv_arp_hw_src(skb, 0);
  699. ip_dst = batadv_arp_ip_dst(skb, 0);
  700. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  701. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  702. if (dat_entry) {
  703. primary_if = batadv_primary_if_get_selected(bat_priv);
  704. if (!primary_if)
  705. goto out;
  706. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  707. primary_if->soft_iface, ip_dst, hw_src,
  708. dat_entry->mac_addr, hw_src);
  709. if (!skb_new)
  710. goto out;
  711. skb_reset_mac_header(skb_new);
  712. skb_new->protocol = eth_type_trans(skb_new,
  713. primary_if->soft_iface);
  714. bat_priv->stats.rx_packets++;
  715. bat_priv->stats.rx_bytes += skb->len + ETH_HLEN;
  716. primary_if->soft_iface->last_rx = jiffies;
  717. netif_rx(skb_new);
  718. batadv_dbg(BATADV_DBG_DAT, bat_priv, "ARP request replied locally\n");
  719. ret = true;
  720. } else {
  721. /* Send the request on the DHT */
  722. ret = batadv_dat_send_data(bat_priv, skb, ip_dst,
  723. BATADV_P_DAT_DHT_GET);
  724. }
  725. out:
  726. if (dat_entry)
  727. batadv_dat_entry_free_ref(dat_entry);
  728. if (primary_if)
  729. batadv_hardif_free_ref(primary_if);
  730. return ret;
  731. }
  732. /**
  733. * batadv_dat_snoop_incoming_arp_request - snoop the ARP request and try to
  734. * answer using the local DAT storage
  735. * @bat_priv: the bat priv with all the soft interface information
  736. * @skb: packet to check
  737. * @hdr_size: size of the encapsulation header
  738. *
  739. * Returns true if the request has been answered, false otherwise
  740. */
  741. bool batadv_dat_snoop_incoming_arp_request(struct batadv_priv *bat_priv,
  742. struct sk_buff *skb, int hdr_size)
  743. {
  744. uint16_t type;
  745. __be32 ip_src, ip_dst;
  746. uint8_t *hw_src;
  747. struct sk_buff *skb_new;
  748. struct batadv_hard_iface *primary_if = NULL;
  749. struct batadv_dat_entry *dat_entry = NULL;
  750. bool ret = false;
  751. int err;
  752. if (!atomic_read(&bat_priv->distributed_arp_table))
  753. goto out;
  754. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  755. if (type != ARPOP_REQUEST)
  756. goto out;
  757. hw_src = batadv_arp_hw_src(skb, hdr_size);
  758. ip_src = batadv_arp_ip_src(skb, hdr_size);
  759. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  760. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  761. "Parsing incoming ARP REQUEST");
  762. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  763. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  764. if (!dat_entry)
  765. goto out;
  766. primary_if = batadv_primary_if_get_selected(bat_priv);
  767. if (!primary_if)
  768. goto out;
  769. skb_new = arp_create(ARPOP_REPLY, ETH_P_ARP, ip_src,
  770. primary_if->soft_iface, ip_dst, hw_src,
  771. dat_entry->mac_addr, hw_src);
  772. if (!skb_new)
  773. goto out;
  774. /* to preserve backwards compatibility, here the node has to answer
  775. * using the same packet type it received for the request. This is due
  776. * to that if a node is not using the 4addr packet format it may not
  777. * support it.
  778. */
  779. if (hdr_size == sizeof(struct batadv_unicast_4addr_packet))
  780. err = batadv_unicast_4addr_send_skb(bat_priv, skb_new,
  781. BATADV_P_DAT_CACHE_REPLY);
  782. else
  783. err = batadv_unicast_send_skb(bat_priv, skb_new);
  784. if (!err)
  785. ret = true;
  786. out:
  787. if (dat_entry)
  788. batadv_dat_entry_free_ref(dat_entry);
  789. if (primary_if)
  790. batadv_hardif_free_ref(primary_if);
  791. if (ret)
  792. kfree_skb(skb);
  793. return ret;
  794. }
  795. /**
  796. * batadv_dat_snoop_outgoing_arp_reply - snoop the ARP reply and fill the DHT
  797. * @bat_priv: the bat priv with all the soft interface information
  798. * @skb: packet to check
  799. */
  800. void batadv_dat_snoop_outgoing_arp_reply(struct batadv_priv *bat_priv,
  801. struct sk_buff *skb)
  802. {
  803. uint16_t type;
  804. __be32 ip_src, ip_dst;
  805. uint8_t *hw_src, *hw_dst;
  806. if (!atomic_read(&bat_priv->distributed_arp_table))
  807. return;
  808. type = batadv_arp_get_type(bat_priv, skb, 0);
  809. if (type != ARPOP_REPLY)
  810. return;
  811. batadv_dbg_arp(bat_priv, skb, type, 0, "Parsing outgoing ARP REPLY");
  812. hw_src = batadv_arp_hw_src(skb, 0);
  813. ip_src = batadv_arp_ip_src(skb, 0);
  814. hw_dst = batadv_arp_hw_dst(skb, 0);
  815. ip_dst = batadv_arp_ip_dst(skb, 0);
  816. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  817. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  818. /* Send the ARP reply to the candidates for both the IP addresses that
  819. * the node got within the ARP reply
  820. */
  821. batadv_dat_send_data(bat_priv, skb, ip_src, BATADV_P_DAT_DHT_PUT);
  822. batadv_dat_send_data(bat_priv, skb, ip_dst, BATADV_P_DAT_DHT_PUT);
  823. }
  824. /**
  825. * batadv_dat_snoop_incoming_arp_reply - snoop the ARP reply and fill the local
  826. * DAT storage only
  827. * @bat_priv: the bat priv with all the soft interface information
  828. * @skb: packet to check
  829. * @hdr_size: siaze of the encapsulation header
  830. */
  831. bool batadv_dat_snoop_incoming_arp_reply(struct batadv_priv *bat_priv,
  832. struct sk_buff *skb, int hdr_size)
  833. {
  834. uint16_t type;
  835. __be32 ip_src, ip_dst;
  836. uint8_t *hw_src, *hw_dst;
  837. bool ret = false;
  838. if (!atomic_read(&bat_priv->distributed_arp_table))
  839. goto out;
  840. type = batadv_arp_get_type(bat_priv, skb, hdr_size);
  841. if (type != ARPOP_REPLY)
  842. goto out;
  843. batadv_dbg_arp(bat_priv, skb, type, hdr_size,
  844. "Parsing incoming ARP REPLY");
  845. hw_src = batadv_arp_hw_src(skb, hdr_size);
  846. ip_src = batadv_arp_ip_src(skb, hdr_size);
  847. hw_dst = batadv_arp_hw_dst(skb, hdr_size);
  848. ip_dst = batadv_arp_ip_dst(skb, hdr_size);
  849. /* Update our internal cache with both the IP addresses the node got
  850. * within the ARP reply
  851. */
  852. batadv_dat_entry_add(bat_priv, ip_src, hw_src);
  853. batadv_dat_entry_add(bat_priv, ip_dst, hw_dst);
  854. /* if this REPLY is directed to a client of mine, let's deliver the
  855. * packet to the interface
  856. */
  857. ret = !batadv_is_my_client(bat_priv, hw_dst);
  858. out:
  859. /* if ret == false -> packet has to be delivered to the interface */
  860. return ret;
  861. }
  862. /**
  863. * batadv_dat_drop_broadcast_packet - check if an ARP request has to be dropped
  864. * (because the node has already got the reply via DAT) or not
  865. * @bat_priv: the bat priv with all the soft interface information
  866. * @forw_packet: the broadcast packet
  867. *
  868. * Returns true if the node can drop the packet, false otherwise
  869. */
  870. bool batadv_dat_drop_broadcast_packet(struct batadv_priv *bat_priv,
  871. struct batadv_forw_packet *forw_packet)
  872. {
  873. uint16_t type;
  874. __be32 ip_dst;
  875. struct batadv_dat_entry *dat_entry = NULL;
  876. bool ret = false;
  877. const size_t bcast_len = sizeof(struct batadv_bcast_packet);
  878. if (!atomic_read(&bat_priv->distributed_arp_table))
  879. goto out;
  880. /* If this packet is an ARP_REQUEST and the node already has the
  881. * information that it is going to ask, then the packet can be dropped
  882. */
  883. if (forw_packet->num_packets)
  884. goto out;
  885. type = batadv_arp_get_type(bat_priv, forw_packet->skb, bcast_len);
  886. if (type != ARPOP_REQUEST)
  887. goto out;
  888. ip_dst = batadv_arp_ip_dst(forw_packet->skb, bcast_len);
  889. dat_entry = batadv_dat_entry_hash_find(bat_priv, ip_dst);
  890. /* check if the node already got this entry */
  891. if (!dat_entry) {
  892. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  893. "ARP Request for %pI4: fallback\n", &ip_dst);
  894. goto out;
  895. }
  896. batadv_dbg(BATADV_DBG_DAT, bat_priv,
  897. "ARP Request for %pI4: fallback prevented\n", &ip_dst);
  898. ret = true;
  899. out:
  900. if (dat_entry)
  901. batadv_dat_entry_free_ref(dat_entry);
  902. return ret;
  903. }